From 93021161c2a273df8447b17e09de6b3f2fc9c23f Mon Sep 17 00:00:00 2001 From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Date: Fri, 19 Jun 2020 16:07:44 +0000 Subject: [PATCH] Documentation for aaa08b0150acc987a47f87b26d64dbbdf96945ac --- annotated.html | 150 + annotated_dup.js | 37 + bc_s.png | Bin 0 -> 676 bytes bdwn.png | Bin 0 -> 147 bytes classes.html | 192 ++ closed.png | Bin 0 -> 132 bytes d0/d01/smallest__circle_8cpp.html | 572 ++++ d0/d01/smallest__circle_8cpp.js | 12 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 11 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 254 ++ ...86819c7c140a023582b7269e2d0_cgraph_org.svg | 166 + ...b0676df8e4da7a08c7ccaecea344903_cgraph.map | 9 + ...b0676df8e4da7a08c7ccaecea344903_cgraph.md5 | 1 + ...b0676df8e4da7a08c7ccaecea344903_cgraph.svg | 130 + ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map | 4 + ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 | 1 + ...cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg | 37 + ...d0455dd5c30adda100e95f0423c786e_cgraph.map | 11 + ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 | 1 + ...d0455dd5c30adda100e95f0423c786e_cgraph.svg | 254 ++ ...5dd5c30adda100e95f0423c786e_cgraph_org.svg | 166 + ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.map | 5 + ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 | 1 + ...4682a4a70d5906857ca09de5b9fb2cc_cgraph.svg | 52 + ...1a3968e7947464bee7714f6d43b7002_cgraph.map | 11 + ...1a3968e7947464bee7714f6d43b7002_cgraph.md5 | 1 + ...1a3968e7947464bee7714f6d43b7002_cgraph.svg | 254 ++ ...68e7947464bee7714f6d43b7002_cgraph_org.svg | 166 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 14 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 341 ++ ...b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg | 253 ++ ...e6d48762c1dfb9f14627927f0c16fad_cgraph.map | 6 + ...e6d48762c1dfb9f14627927f0c16fad_cgraph.md5 | 1 + ...e6d48762c1dfb9f14627927f0c16fad_cgraph.svg | 67 + d0/d04/qr__decompose_8h__incl.map | 10 + d0/d04/qr__decompose_8h__incl.md5 | 1 + d0/d04/qr__decompose_8h__incl.svg | 128 + d0/d08/realtime__stats_8cpp.html | 313 ++ d0/d08/realtime__stats_8cpp.js | 7 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 14 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 353 +++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 265 ++ ...54c915581fcc495489175a4386d59fd_cgraph.map | 13 + ...54c915581fcc495489175a4386d59fd_cgraph.md5 | 1 + ...54c915581fcc495489175a4386d59fd_cgraph.svg | 196 ++ d0/d0d/structmst-members.html | 114 + d0/d1f/structnode__coll__graph.map | 3 + d0/d1f/structnode__coll__graph.md5 | 1 + d0/d1f/structnode__coll__graph.svg | 33 + d0/d55/classcll-members.html | 122 + d0/d77/linear__search_8cpp__incl.map | 4 + d0/d77/linear__search_8cpp__incl.md5 | 1 + d0/d77/linear__search_8cpp__incl.svg | 37 + ...tatistics_1_1stats__computer1-members.html | 120 + d0/d80/classgraph__coll__graph.map | 6 + d0/d80/classgraph__coll__graph.md5 | 1 + d0/d80/classgraph__coll__graph.svg | 78 + d0/da1/string__fibonacci_8cpp__incl.map | 5 + d0/da1/string__fibonacci_8cpp__incl.md5 | 1 + d0/da1/string__fibonacci_8cpp__incl.svg | 52 + .../number__of__positive__divisors_8cpp.html | 241 ++ d0/da2/number__of__positive__divisors_8cpp.js | 5 + ...89ccced8504b5116046cfa03066ffeb_cgraph.map | 5 + ...89ccced8504b5116046cfa03066ffeb_cgraph.md5 | 1 + ...89ccced8504b5116046cfa03066ffeb_cgraph.svg | 53 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 83 + d0/dab/interpolation__search_8cpp__incl.map | 4 + d0/dab/interpolation__search_8cpp__incl.md5 | 1 + d0/dab/interpolation__search_8cpp__incl.svg | 38 + d0/db5/trie__modern_8cpp__incl.map | 6 + d0/db5/trie__modern_8cpp__incl.md5 | 1 + d0/db5/trie__modern_8cpp__incl.svg | 68 + d0/db6/non__recursive__merge__sort_8cpp.html | 153 + d0/db6/non__recursive__merge__sort_8cpp.js | 8 + d0/db7/smallest__circle_8cpp__incl.map | 6 + d0/db7/smallest__circle_8cpp__incl.md5 | 1 + d0/db7/smallest__circle_8cpp__incl.svg | 67 + d0/dc4/struct_point-members.html | 116 + .../successive__approximation_8cpp__incl.map | 5 + .../successive__approximation_8cpp__incl.md5 | 1 + .../successive__approximation_8cpp__incl.svg | 53 + d0/dd1/binaryheap_8cpp__incl.map | 6 + d0/dd1/binaryheap_8cpp__incl.md5 | 1 + d0/dd1/binaryheap_8cpp__incl.svg | 67 + d0/dd2/class_queue___array.html | 148 + d0/dd2/class_queue___array.js | 11 + d0/dd5/ode__midpoint__euler_8cpp__incl.map | 8 + d0/dd5/ode__midpoint__euler_8cpp__incl.md5 | 1 + d0/dd5/ode__midpoint__euler_8cpp__incl.svg | 98 + d0/de2/gaussian__elimination_8cpp.html | 226 ++ d0/de2/gaussian__elimination_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d0/dfc/sqrt__double_8cpp__incl.map | 5 + d0/dfc/sqrt__double_8cpp__incl.md5 | 1 + d0/dfc/sqrt__double_8cpp__incl.svg | 52 + d0/dff/structlinkedlist.html | 131 + d0/dff/structlinkedlist.js | 5 + d1/d06/ternary__search_8cpp__incl.map | 4 + d1/d06/ternary__search_8cpp__incl.md5 | 1 + d1/d06/ternary__search_8cpp__incl.svg | 37 + d1/d07/class_solution-members.html | 119 + d1/d11/gcd__of__n__numbers_8cpp.html | 223 ++ d1/d11/gcd__of__n__numbers_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d1/d1d/class_graph-members.html | 153 + d1/d1d/pascal__triangle_8cpp__incl.map | 6 + d1/d1d/pascal__triangle_8cpp__incl.md5 | 1 + d1/d1d/pascal__triangle_8cpp__incl.svg | 67 + d1/d21/quick__sort_8cpp.html | 202 ++ d1/d21/quick__sort_8cpp.js | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 67 + ...__least__squares__regressor_8cpp__incl.map | 6 + ...__least__squares__regressor_8cpp__incl.md5 | 1 + ...__least__squares__regressor_8cpp__incl.svg | 68 + d1/d57/classcll__coll__graph.map | 4 + d1/d57/classcll__coll__graph.md5 | 1 + d1/d57/classcll__coll__graph.svg | 49 + d1/d76/buzz__number_8cpp.html | 169 + d1/d76/buzz__number_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d1/d77/structmst.html | 128 + d1/d77/structmst.js | 6 + d1/d7d/gcd__of__n__numbers_8cpp__incl.map | 4 + d1/d7d/gcd__of__n__numbers_8cpp__incl.md5 | 1 + d1/d7d/gcd__of__n__numbers_8cpp__incl.svg | 37 + .../decimal__to__hexadecimal_8cpp__incl.map | 4 + .../decimal__to__hexadecimal_8cpp__incl.md5 | 1 + .../decimal__to__hexadecimal_8cpp__incl.svg | 37 + d1/db3/structcompare.html | 122 + d1/db3/structcompare.js | 4 + d1/dc2/class_graph__coll__graph.map | 9 + d1/dc2/class_graph__coll__graph.md5 | 1 + d1/dc2/class_graph__coll__graph.svg | 123 + d1/dc2/classstack.html | 520 ++++ d1/dc2/classstack.js | 14 + ...7f65710c376f67d1ba3bde45a9cb628_cgraph.map | 4 + ...7f65710c376f67d1ba3bde45a9cb628_cgraph.md5 | 1 + ...7f65710c376f67d1ba3bde45a9cb628_cgraph.svg | 37 + ...cd4b95d5de00d41b2491392338384dc_cgraph.map | 5 + ...cd4b95d5de00d41b2491392338384dc_cgraph.md5 | 1 + ...cd4b95d5de00d41b2491392338384dc_cgraph.svg | 52 + d1/dc5/classlarge__number__coll__graph.map | 4 + d1/dc5/classlarge__number__coll__graph.md5 | 1 + d1/dc5/classlarge__number__coll__graph.svg | 39 + d1/dda/fast__interger__input_8cpp__incl.map | 4 + d1/dda/fast__interger__input_8cpp__incl.md5 | 1 + d1/dda/fast__interger__input_8cpp__incl.svg | 38 + d1/df2/structnode-members.html | 127 + d1/df3/hash__search_8cpp.html | 406 +++ d1/df3/hash__search_8cpp.js | 14 + ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map | 4 + ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 | 1 + ...6ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg | 37 + ...0831425f1389166a9518f422d0c6ec5_cgraph.map | 4 + ...0831425f1389166a9518f422d0c6ec5_cgraph.md5 | 1 + ...0831425f1389166a9518f422d0c6ec5_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 88 + d1/df9/qr__decomposition_8cpp__incl.map | 13 + d1/df9/qr__decomposition_8cpp__incl.md5 | 1 + d1/df9/qr__decomposition_8cpp__incl.svg | 191 ++ d2/d05/class_min_heap.html | 478 +++ d2/d05/class_min_heap.js | 16 + ...7ac126eabb0c3ce04047172abccca29_cgraph.map | 9 + ...7ac126eabb0c3ce04047172abccca29_cgraph.md5 | 1 + ...7ac126eabb0c3ce04047172abccca29_cgraph.svg | 206 ++ ...26eabb0c3ce04047172abccca29_cgraph_org.svg | 118 + ...014f1edaed0bd7db0c0d2ca53228980_cgraph.map | 7 + ...014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 | 1 + ...014f1edaed0bd7db0c0d2ca53228980_cgraph.svg | 82 + ...7f726cc6327955d22871592227432f5_cgraph.map | 4 + ...7f726cc6327955d22871592227432f5_cgraph.md5 | 1 + ...7f726cc6327955d22871592227432f5_cgraph.svg | 37 + ...ef438c1056492cb62c4a4d9035b5cad_cgraph.map | 6 + ...ef438c1056492cb62c4a4d9035b5cad_cgraph.md5 | 1 + ...ef438c1056492cb62c4a4d9035b5cad_cgraph.svg | 67 + ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.map | 4 + ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 | 1 + ...f78f3384f5a0ae880ad0883d2d44b82_cgraph.svg | 37 + d2/d07/class_bit__coll__graph.map | 4 + d2/d07/class_bit__coll__graph.md5 | 1 + d2/d07/class_bit__coll__graph.svg | 38 + d2/d0b/fast__power_8cpp.html | 301 ++ d2/d0b/fast__power_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 8 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 98 + d2/d22/jump__search_8cpp.html | 209 ++ d2/d22/jump__search_8cpp.js | 5 + ...49fd8f401bfc71f63b74711390cccf0_cgraph.map | 5 + ...49fd8f401bfc71f63b74711390cccf0_cgraph.md5 | 1 + ...49fd8f401bfc71f63b74711390cccf0_cgraph.svg | 52 + d2/d26/addition__rule_8cpp__incl.map | 4 + d2/d26/addition__rule_8cpp__incl.md5 | 1 + d2/d26/addition__rule_8cpp__incl.svg | 38 + d2/d2c/structtower.html | 129 + d2/d2c/structtower.js | 5 + d2/d36/structqueue.html | 517 ++++ d2/d36/structqueue.js | 17 + ...89d4af5532e0a801f560070da6e1f86_cgraph.map | 5 + ...89d4af5532e0a801f560070da6e1f86_cgraph.md5 | 1 + ...89d4af5532e0a801f560070da6e1f86_cgraph.svg | 52 + ...6f48801df462ade003b50739196fa4c_cgraph.map | 4 + ...6f48801df462ade003b50739196fa4c_cgraph.md5 | 1 + ...6f48801df462ade003b50739196fa4c_cgraph.svg | 37 + d2/d3b/namespaceqr__algorithm.html | 634 ++++ ...40edf2b6b5942c0e5f2c9d3e326797f_cgraph.map | 6 + ...40edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5 | 1 + ...40edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg | 67 + ...63896dbb4a7e95c4a1e614ac0819d66_cgraph.map | 9 + ...63896dbb4a7e95c4a1e614ac0819d66_cgraph.md5 | 1 + ...63896dbb4a7e95c4a1e614ac0819d66_cgraph.svg | 201 ++ ...6dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg | 113 + ...c63c78d6839b8ad73b77c161210b514_cgraph.map | 7 + ...c63c78d6839b8ad73b77c161210b514_cgraph.md5 | 1 + ...c63c78d6839b8ad73b77c161210b514_cgraph.svg | 82 + ...1ac74497ffb2101040cc1efe3546de8_cgraph.map | 7 + ...1ac74497ffb2101040cc1efe3546de8_cgraph.md5 | 1 + ...1ac74497ffb2101040cc1efe3546de8_cgraph.svg | 82 + ...16da2183db22378435042f26af43d5f_cgraph.map | 5 + ...16da2183db22378435042f26af43d5f_cgraph.md5 | 1 + ...16da2183db22378435042f26af43d5f_cgraph.svg | 52 + d2/d66/binary__search_8cpp__incl.map | 4 + d2/d66/binary__search_8cpp__incl.md5 | 1 + d2/d66/binary__search_8cpp__incl.svg | 37 + d2/d89/median__search_8cpp__incl.map | 6 + d2/d89/median__search_8cpp__incl.md5 | 1 + d2/d89/median__search_8cpp__incl.svg | 67 + d2/dc4/classstack__linked_list.html | 144 + d2/dc4/classstack__linked_list.js | 9 + d2/dcf/namespacestatistics.html | 124 + d2/dcf/namespacestatistics.js | 5 + d2/ddd/gaussian__elimination_8cpp__incl.map | 4 + d2/ddd/gaussian__elimination_8cpp__incl.md5 | 1 + d2/ddd/gaussian__elimination_8cpp__incl.svg | 38 + d2/def/prime__factorization_8cpp__incl.map | 7 + d2/def/prime__factorization_8cpp__incl.md5 | 1 + d2/def/prime__factorization_8cpp__incl.svg | 82 + d3/d06/ode__semi__implicit__euler_8cpp.html | 414 +++ d3/d06/ode__semi__implicit__euler_8cpp.js | 9 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 16 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 241 ++ ...13517b8e5de1b75592052db7f7e237f_cgraph.map | 10 + ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 | 1 + ...13517b8e5de1b75592052db7f7e237f_cgraph.svg | 127 + ...3adf7b092a87868917ee5fb4255192b_cgraph.map | 5 + ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 | 1 + ...3adf7b092a87868917ee5fb4255192b_cgraph.svg | 52 + d3/d19/sparse__matrix_8cpp.html | 188 ++ d3/d19/sparse__matrix_8cpp.js | 4 + ...se__fermat__little__theorem_8cpp__incl.map | 5 + ...se__fermat__little__theorem_8cpp__incl.md5 | 1 + ...se__fermat__little__theorem_8cpp__incl.svg | 53 + d3/d24/qr__decomposition_8cpp.html | 203 ++ d3/d24/qr__decomposition_8cpp.js | 4 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.map | 9 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.md5 | 1 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.svg | 200 ++ ...1bc02cba5474a4cb46a9b9566fe_cgraph_org.svg | 112 + d3/d26/binary__search__tree_8cpp.html | 174 ++ d3/d26/binary__search__tree_8cpp.js | 16 + d3/d30/hash__search_8cpp__incl.map | 5 + d3/d30/hash__search_8cpp__incl.md5 | 1 + d3/d30/hash__search_8cpp__incl.svg | 52 + d3/d39/check__prime_8cpp__incl.map | 5 + d3/d39/check__prime_8cpp__incl.md5 | 1 + d3/d39/check__prime_8cpp__incl.svg | 52 + d3/d56/binomial__dist_8cpp__incl.map | 5 + d3/d56/binomial__dist_8cpp__incl.md5 | 1 + d3/d56/binomial__dist_8cpp__incl.svg | 53 + d3/d61/vector__important__functions_8cpp.html | 197 ++ d3/d61/vector__important__functions_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + d3/d66/structlinkedlist__coll__graph.map | 3 + d3/d66/structlinkedlist__coll__graph.md5 | 1 + d3/d66/structlinkedlist__coll__graph.svg | 29 + .../brute__force__string__searching_8cpp.html | 206 ++ .../brute__force__string__searching_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 83 + ...tatistics_1_1stats__computer2-members.html | 120 + d3/dbb/class_cycle_check.html | 397 +++ d3/dbb/class_cycle_check.js | 11 + ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map | 5 + ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 | 1 + ...f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg | 53 + ...99292a33edf87499daa52b51315aca5_cgraph.map | 7 + ...99292a33edf87499daa52b51315aca5_cgraph.md5 | 1 + ...99292a33edf87499daa52b51315aca5_cgraph.svg | 82 + ...9a270ffba3a68539b92272c702e3474_cgraph.map | 6 + ...9a270ffba3a68539b92272c702e3474_cgraph.md5 | 1 + ...9a270ffba3a68539b92272c702e3474_cgraph.svg | 68 + ...edlist__implentation__usingarray_8cpp.html | 307 ++ ...nkedlist__implentation__usingarray_8cpp.js | 14 + ...cb07da7984e20b3207934696791f5df_cgraph.map | 4 + ...cb07da7984e20b3207934696791f5df_cgraph.md5 | 1 + ...cb07da7984e20b3207934696791f5df_cgraph.svg | 37 + d4/d0c/binary__search__tree_8cpp__incl.map | 4 + d4/d0c/binary__search__tree_8cpp__incl.md5 | 1 + d4/d0c/binary__search__tree_8cpp__incl.svg | 38 + d4/d0e/class_bit-members.html | 119 + d4/d1f/class_min_heap-members.html | 124 + d4/d21/least__common__multiple_8cpp.html | 293 ++ d4/d21/least__common__multiple_8cpp.js | 7 + ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.map | 6 + ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 | 1 + ...8ec9ad42717780d6caaff9d3d6977f9_cgraph.svg | 67 + ...8d0e241db517813725e721a152e3a25_cgraph.map | 4 + ...8d0e241db517813725e721a152e3a25_cgraph.md5 | 1 + ...8d0e241db517813725e721a152e3a25_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + d4/d26/durand__kerner__roots_8cpp__incl.map | 12 + d4/d26/durand__kerner__roots_8cpp__incl.md5 | 1 + d4/d26/durand__kerner__roots_8cpp__incl.svg | 246 ++ .../durand__kerner__roots_8cpp__incl_org.svg | 158 + ...struct_trie_1_1_trie_node__coll__graph.map | 4 + ...struct_trie_1_1_trie_node__coll__graph.md5 | 1 + ...struct_trie_1_1_trie_node__coll__graph.svg | 46 + d4/d32/fibonacci__fast_8cpp.html | 246 ++ d4/d32/fibonacci__fast_8cpp.js | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d4/d45/gcd__recursive__euclidean_8cpp.html | 225 ++ d4/d45/gcd__recursive__euclidean_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d4/d59/large__factorial_8cpp__incl.map | 12 + d4/d59/large__factorial_8cpp__incl.md5 | 1 + d4/d59/large__factorial_8cpp__incl.svg | 169 + d4/d60/kohonen__som__trace_8cpp__incl.map | 11 + d4/d60/kohonen__som__trace_8cpp__incl.md5 | 1 + d4/d60/kohonen__som__trace_8cpp__incl.svg | 231 ++ d4/d60/kohonen__som__trace_8cpp__incl_org.svg | 143 + d4/d68/qr__decompose_8h.html | 167 + d4/d68/qr__decompose_8h.js | 9 + d4/d68/qr__decompose_8h_source.html | 473 +++ d4/d6d/struct_entry-members.html | 115 + d4/d72/qr__eigen__values_8cpp__incl.map | 13 + d4/d72/qr__eigen__values_8cpp__incl.md5 | 1 + d4/d72/qr__eigen__values_8cpp__incl.svg | 191 ++ d4/d7a/shell__sort2_8cpp.html | 522 ++++ d4/d7a/shell__sort2_8cpp.js | 12 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 14 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 235 ++ ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.map | 8 + ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 | 1 + ...2ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg | 97 + ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map | 5 + ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 | 1 + ...3aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg | 52 + ...95b313cb2671e8f712040460325573e_cgraph.map | 8 + ...95b313cb2671e8f712040460325573e_cgraph.md5 | 1 + ...95b313cb2671e8f712040460325573e_cgraph.svg | 97 + ...51127aea9d7e1e53ea9ae0868633246_cgraph.map | 4 + ...51127aea9d7e1e53ea9ae0868633246_cgraph.md5 | 1 + ...51127aea9d7e1e53ea9ae0868633246_cgraph.svg | 37 + d4/d86/large__number_8h.html | 144 + d4/d86/large__number_8h_source.html | 655 ++++ d4/d9c/primes__up__to__billion_8cpp.html | 226 ++ d4/d9c/primes__up__to__billion_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d4/da0/gcd__iterative__euclidean_8cpp.html | 231 ++ d4/da0/gcd__iterative__euclidean_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d4/da4/class_queue.html | 147 + d4/da4/class_queue.js | 10 + ...ber__of__positive__divisors_8cpp__incl.map | 5 + ...ber__of__positive__divisors_8cpp__incl.md5 | 1 + ...ber__of__positive__divisors_8cpp__incl.svg | 53 + d4/db4/bayes__theorem_8cpp__incl.map | 4 + d4/db4/bayes__theorem_8cpp__incl.md5 | 1 + d4/db4/bayes__theorem_8cpp__incl.svg | 37 + d4/db4/struct_segment_intersection.html | 240 ++ d4/db4/struct_segment_intersection.js | 6 + ...08941b2272866c64cdaf959afa939bf_cgraph.map | 5 + ...08941b2272866c64cdaf959afa939bf_cgraph.md5 | 1 + ...08941b2272866c64cdaf959afa939bf_cgraph.svg | 53 + d4/db6/struct_min_heap_node-members.html | 116 + d4/dbd/structlca__coll__graph.map | 4 + d4/dbd/structlca__coll__graph.md5 | 1 + d4/dbd/structlca__coll__graph.svg | 38 + ...extended__euclid__algorithm_8cpp__incl.map | 5 + ...extended__euclid__algorithm_8cpp__incl.md5 | 1 + ...extended__euclid__algorithm_8cpp__incl.svg | 53 + d4/dcb/classstack__coll__graph.map | 5 + d4/dcb/classstack__coll__graph.md5 | 1 + d4/dcb/classstack__coll__graph.svg | 76 + d4/dd9/structtrie.html | 131 + d4/dd9/structtrie.js | 5 + d4/de8/fast__interger__input_8cpp.html | 211 ++ d4/de8/fast__interger__input_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + .../gcd__iterative__euclidean_8cpp__incl.map | 5 + .../gcd__iterative__euclidean_8cpp__incl.md5 | 1 + .../gcd__iterative__euclidean_8cpp__incl.svg | 53 + d4/def/kohonen__som__topology_8cpp.html | 693 +++++ d4/def/kohonen__som__topology_8cpp.js | 19 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 25 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 466 +++ ...86819c7c140a023582b7269e2d0_cgraph_org.svg | 378 +++ ...e7435446ed7c763f7de79a468add2e0_cgraph.map | 5 + ...e7435446ed7c763f7de79a468add2e0_cgraph.md5 | 1 + ...e7435446ed7c763f7de79a468add2e0_cgraph.svg | 52 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 25 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 466 +++ ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg | 378 +++ ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 34 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 685 +++++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 597 ++++ ...b5e744876fd980a3451cbb385d4e755_cgraph.map | 5 + ...b5e744876fd980a3451cbb385d4e755_cgraph.md5 | 1 + ...b5e744876fd980a3451cbb385d4e755_cgraph.svg | 52 + ...d0455dd5c30adda100e95f0423c786e_cgraph.map | 25 + ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 | 1 + ...d0455dd5c30adda100e95f0423c786e_cgraph.svg | 466 +++ ...5dd5c30adda100e95f0423c786e_cgraph_org.svg | 378 +++ ...3081e021270ba21a9fd88646f6a6e26_cgraph.map | 5 + ...3081e021270ba21a9fd88646f6a6e26_cgraph.md5 | 1 + ...3081e021270ba21a9fd88646f6a6e26_cgraph.svg | 52 + d4/df8/prime__numbers_8cpp__incl.map | 5 + d4/df8/prime__numbers_8cpp__incl.md5 | 1 + d4/df8/prime__numbers_8cpp__incl.svg | 52 + d5/d15/classcll.html | 157 + d5/d15/classcll.js | 14 + d5/d29/struct_min_heap_node.html | 144 + d5/d29/struct_min_heap_node.js | 8 + d5/d67/bayes__theorem_8cpp.html | 249 ++ d5/d67/bayes__theorem_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 67 + d5/d88/md__d_i_r_e_c_t_o_r_y.html | 372 +++ d5/d8b/least__common__multiple_8cpp__incl.map | 5 + d5/d8b/least__common__multiple_8cpp__incl.md5 | 1 + d5/d8b/least__common__multiple_8cpp__incl.svg | 52 + d5/d91/namespacesorting.html | 606 ++++ ...40d913e42fb94176a0b2c8b29a80420_cgraph.map | 4 + ...40d913e42fb94176a0b2c8b29a80420_cgraph.md5 | 1 + ...40d913e42fb94176a0b2c8b29a80420_cgraph.svg | 38 + ...7236b8d3df3832e1f1225576a122534_cgraph.map | 5 + ...7236b8d3df3832e1f1225576a122534_cgraph.md5 | 1 + ...7236b8d3df3832e1f1225576a122534_cgraph.svg | 54 + ...d76603c54d3dc56146e92d10a043924_cgraph.map | 4 + ...d76603c54d3dc56146e92d10a043924_cgraph.md5 | 1 + ...d76603c54d3dc56146e92d10a043924_cgraph.svg | 37 + ...0b66a1c652291b9a346ec7342967178_cgraph.map | 4 + ...0b66a1c652291b9a346ec7342967178_cgraph.md5 | 1 + ...0b66a1c652291b9a346ec7342967178_cgraph.svg | 37 + ...97f4dd815654c4682f564afd718e824_cgraph.map | 5 + ...97f4dd815654c4682f564afd718e824_cgraph.md5 | 1 + ...97f4dd815654c4682f564afd718e824_cgraph.svg | 54 + ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.map | 4 + ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 | 1 + ...2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg | 37 + d5/da1/structnode.html | 197 ++ d5/da1/structnode.js | 19 + d5/db0/adaline__learning_8cpp.html | 434 +++ d5/db0/adaline__learning_8cpp.js | 9 + ...79f7488a305f2571f2932b319931f82_cgraph.map | 13 + ...79f7488a305f2571f2932b319931f82_cgraph.md5 | 1 + ...79f7488a305f2571f2932b319931f82_cgraph.svg | 286 ++ ...488a305f2571f2932b319931f82_cgraph_org.svg | 198 ++ ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 18 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 409 +++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 321 ++ ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.map | 12 + ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 | 1 + ...2053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg | 271 ++ ...d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg | 183 ++ ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map | 13 + ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 | 1 + ...92bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg | 286 ++ ...f1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg | 198 ++ d5/dc2/structlca-members.html | 120 + ...ector__important__functions_8cpp__incl.map | 7 + ...ector__important__functions_8cpp__incl.md5 | 1 + ...ector__important__functions_8cpp__incl.svg | 83 + d5/dcd/kohonen__som__topology_8cpp__incl.map | 11 + d5/dcd/kohonen__som__topology_8cpp__incl.md5 | 1 + d5/dcd/kohonen__som__topology_8cpp__incl.svg | 231 ++ .../kohonen__som__topology_8cpp__incl_org.svg | 143 + d5/ddf/struct_btree-members.html | 114 + d5/de2/structtower-members.html | 113 + d5/def/stairs__pattern_8cpp.html | 185 ++ d5/def/stairs__pattern_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d6/d1d/bubble__sort_8cpp__incl.map | 5 + d6/d1d/bubble__sort_8cpp__incl.md5 | 1 + d6/d1d/bubble__sort_8cpp__incl.svg | 52 + d6/d30/classmachine__learning_1_1adaline.html | 558 ++++ d6/d30/classmachine__learning_1_1adaline.js | 13 + ...acbe32aaab897e7939e5b0454035b8c_cgraph.map | 6 + ...acbe32aaab897e7939e5b0454035b8c_cgraph.md5 | 1 + ...acbe32aaab897e7939e5b0454035b8c_cgraph.svg | 68 + ...4e3c6c037b67895014414c5d75465e5_cgraph.map | 11 + ...4e3c6c037b67895014414c5d75465e5_cgraph.md5 | 1 + ...4e3c6c037b67895014414c5d75465e5_cgraph.svg | 244 ++ ...6c037b67895014414c5d75465e5_cgraph_org.svg | 156 + ...11242d9ad5b03a75911e29b04f78fd3_cgraph.map | 10 + ...11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 | 1 + ...11242d9ad5b03a75911e29b04f78fd3_cgraph.svg | 129 + ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map | 5 + ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 | 1 + ...8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg | 53 + d6/d38/newton__raphson__method_8cpp__incl.map | 7 + d6/d38/newton__raphson__method_8cpp__incl.md5 | 1 + d6/d38/newton__raphson__method_8cpp__incl.svg | 83 + d6/d48/structtrie-members.html | 113 + d6/d4a/addition__rule_8cpp.html | 245 ++ d6/d4a/addition__rule_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 67 + .../gcd__recursive__euclidean_8cpp__incl.map | 4 + .../gcd__recursive__euclidean_8cpp__incl.md5 | 1 + .../gcd__recursive__euclidean_8cpp__incl.svg | 38 + d6/d60/group__ode.html | 659 ++++ d6/d60/group__ode.js | 9 + ...6ff0710861ca39d957046c0b09b2985_cgraph.map | 10 + ...6ff0710861ca39d957046c0b09b2985_cgraph.md5 | 1 + ...6ff0710861ca39d957046c0b09b2985_cgraph.svg | 127 + ...874d294ab00fe9ce8731c5b7991a089_cgraph.map | 10 + ...874d294ab00fe9ce8731c5b7991a089_cgraph.md5 | 1 + ...874d294ab00fe9ce8731c5b7991a089_cgraph.svg | 127 + ...27bf009831ddc477c5fa8891d5cb35f_cgraph.map | 4 + ...27bf009831ddc477c5fa8891d5cb35f_cgraph.md5 | 1 + ...27bf009831ddc477c5fa8891d5cb35f_cgraph.svg | 37 + ...c319db420c3d97a83e9dcca803b6812_cgraph.map | 4 + ...c319db420c3d97a83e9dcca803b6812_cgraph.md5 | 1 + ...c319db420c3d97a83e9dcca803b6812_cgraph.svg | 37 + ...197c6b7085ac9ea71abc4c063e6f52f_cgraph.map | 4 + ...197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5 | 1 + ...197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg | 37 + ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.map | 10 + ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 | 1 + ...0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg | 127 + d6/d93/large__number_8h__dep__incl.map | 5 + d6/d93/large__number_8h__dep__incl.md5 | 1 + d6/d93/large__number_8h__dep__incl.svg | 52 + d6/d9d/large__factorial_8cpp.html | 328 ++ d6/d9d/large__factorial_8cpp.js | 6 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 14 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 318 ++ ...224851353fc92bfbff6f499fa97_cgraph_org.svg | 230 ++ ...f93b60e229b6683e24c4754a7106ee8_cgraph.map | 7 + ...f93b60e229b6683e24c4754a7106ee8_cgraph.md5 | 1 + ...f93b60e229b6683e24c4754a7106ee8_cgraph.svg | 88 + ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.map | 7 + ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 | 1 + ...6aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg | 88 + d6/db0/binomial__dist_8cpp.html | 468 +++ d6/db0/binomial__dist_8cpp.js | 10 + ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map | 5 + ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 | 1 + ...9ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg | 52 + ...6ed6ce71415fb400b65f0656cef3d25_cgraph.map | 5 + ...6ed6ce71415fb400b65f0656cef3d25_cgraph.md5 | 1 + ...6ed6ce71415fb400b65f0656cef3d25_cgraph.svg | 52 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 12 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 175 ++ ...09e51f513cee647d41192ab0a872cdc_cgraph.map | 5 + ...09e51f513cee647d41192ab0a872cdc_cgraph.md5 | 1 + ...09e51f513cee647d41192ab0a872cdc_cgraph.svg | 52 + .../ode__semi__implicit__euler_8cpp__incl.map | 8 + .../ode__semi__implicit__euler_8cpp__incl.md5 | 1 + .../ode__semi__implicit__euler_8cpp__incl.svg | 98 + d6/dbc/sparse__matrix_8cpp__incl.map | 4 + d6/dbc/sparse__matrix_8cpp__incl.md5 | 1 + d6/dbc/sparse__matrix_8cpp__incl.svg | 37 + d6/dbd/jump__search_8cpp__incl.map | 6 + d6/dbd/jump__search_8cpp__incl.md5 | 1 + d6/dbd/jump__search_8cpp__incl.svg | 67 + d6/dc0/interpolation__search2_8cpp__incl.map | 4 + d6/dc0/interpolation__search2_8cpp__incl.md5 | 1 + d6/dc0/interpolation__search2_8cpp__incl.svg | 38 + d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html | 215 ++ d6/dce/rabin__karp_8cpp.html | 189 ++ d6/dce/rabin__karp_8cpp.js | 9 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.map | 8 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.md5 | 1 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.svg | 98 + d6/dd3/ode__midpoint__euler_8cpp.html | 414 +++ d6/dd3/ode__midpoint__euler_8cpp.js | 9 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 16 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 241 ++ ...13517b8e5de1b75592052db7f7e237f_cgraph.map | 10 + ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 | 1 + ...13517b8e5de1b75592052db7f7e237f_cgraph.svg | 127 + ...3adf7b092a87868917ee5fb4255192b_cgraph.map | 5 + ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 | 1 + ...3adf7b092a87868917ee5fb4255192b_cgraph.svg | 52 + d7/d1f/realtime__stats_8cpp__incl.map | 6 + d7/d1f/realtime__stats_8cpp__incl.md5 | 1 + d7/d1f/realtime__stats_8cpp__incl.svg | 67 + d7/d21/classstack__linked_list-members.html | 117 + d7/d2e/avltree_8cpp__incl.map | 6 + d7/d2e/avltree_8cpp__incl.md5 | 1 + d7/d2e/avltree_8cpp__incl.svg | 67 + d7/d35/matrix__exponentiation_8cpp.html | 495 +++ d7/d35/matrix__exponentiation_8cpp.js | 16 + ...769b745458157ef2679949155684f3b_cgraph.map | 4 + ...769b745458157ef2679949155684f3b_cgraph.md5 | 1 + ...769b745458157ef2679949155684f3b_cgraph.svg | 37 + ...t__implentation__usingarray_8cpp__incl.map | 4 + ...t__implentation__usingarray_8cpp__incl.md5 | 1 + ...t__implentation__usingarray_8cpp__incl.svg | 38 + d7/d40/class_solution__coll__graph.map | 6 + d7/d40/class_solution__coll__graph.md5 | 1 + d7/d40/class_solution__coll__graph.svg | 73 + d7/d41/struct_min_heap_node__coll__graph.map | 3 + d7/d41/struct_min_heap_node__coll__graph.md5 | 1 + d7/d41/struct_min_heap_node__coll__graph.svg | 30 + d7/d4c/spiral__print_8cpp__incl.map | 4 + d7/d4c/spiral__print_8cpp__incl.md5 | 1 + d7/d4c/spiral__print_8cpp__incl.svg | 37 + d7/d6a/bisection__method_8cpp.html | 277 ++ d7/d6a/bisection__method_8cpp.js | 8 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.map | 4 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 | 1 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.svg | 37 + d7/d77/class_edge.html | 202 ++ d7/d77/class_edge.js | 15 + .../classstatistics_1_1stats__computer1.html | 340 ++ d7/d7c/classstatistics_1_1stats__computer1.js | 12 + ...57e942d49f4fd70f059f224b4ac07e1_cgraph.map | 5 + ...57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 | 1 + ...57e942d49f4fd70f059f224b4ac07e1_cgraph.svg | 53 + d7/d7f/section.html | 114 + d7/d89/double__factorial_8cpp.html | 193 ++ d7/d89/double__factorial_8cpp.js | 6 + .../power__for__huge__numbers_8cpp__incl.map | 4 + .../power__for__huge__numbers_8cpp__incl.md5 | 1 + .../power__for__huge__numbers_8cpp__incl.svg | 38 + d7/da7/adaline__learning_8cpp__incl.map | 11 + d7/da7/adaline__learning_8cpp__incl.md5 | 1 + d7/da7/adaline__learning_8cpp__incl.svg | 231 ++ d7/da7/adaline__learning_8cpp__incl_org.svg | 143 + d7/dae/decimal__to__binary_8cpp__incl.map | 4 + d7/dae/decimal__to__binary_8cpp__incl.md5 | 1 + d7/dae/decimal__to__binary_8cpp__incl.svg | 37 + d7/dba/cll_8h_source.html | 198 ++ d7/de0/stack_8h_source.html | 246 ++ d8/d01/struct_item-members.html | 113 + d8/d10/structlist.html | 170 + d8/d10/structlist.js | 15 + d8/d13/bubble__sort_8cpp.html | 139 + d8/d13/bubble__sort_8cpp.js | 4 + d8/d38/queue_8h_source.html | 244 ++ d8/d38/structquery-members.html | 114 + ...inverse__fermat__little__theorem_8cpp.html | 280 ++ ...__inverse__fermat__little__theorem_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 67 + d8/d55/class_cycle_check-members.html | 118 + d8/d61/class_trie__coll__graph.map | 5 + d8/d61/class_trie__coll__graph.md5 | 1 + d8/d61/class_trie__coll__graph.svg | 62 + d8/d6c/line__segment__intersection_8cpp.html | 183 ++ d8/d6c/line__segment__intersection_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d8/d77/namespacemachine__learning.html | 626 ++++ d8/d77/namespacemachine__learning.js | 4 + ...d577f5d95b774ae97eb6838852d0df5_cgraph.map | 8 + ...d577f5d95b774ae97eb6838852d0df5_cgraph.md5 | 1 + ...d577f5d95b774ae97eb6838852d0df5_cgraph.svg | 98 + ...61674452869413536ee501f053129a8_cgraph.map | 9 + ...61674452869413536ee501f053129a8_cgraph.md5 | 1 + ...61674452869413536ee501f053129a8_cgraph.svg | 113 + ...4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map | 12 + ...4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5 | 1 + ...4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg | 158 + ...c6a28f40512dbda75ab1a3969248898_cgraph.map | 13 + ...c6a28f40512dbda75ab1a3969248898_cgraph.md5 | 1 + ...c6a28f40512dbda75ab1a3969248898_cgraph.svg | 262 ++ ...8f40512dbda75ab1a3969248898_cgraph_org.svg | 174 ++ ...c731720947b4bc2ab047c141e7d0299_cgraph.map | 13 + ...c731720947b4bc2ab047c141e7d0299_cgraph.md5 | 1 + ...c731720947b4bc2ab047c141e7d0299_cgraph.svg | 261 ++ ...720947b4bc2ab047c141e7d0299_cgraph_org.svg | 173 ++ d8/d8a/exponential__search_8cpp.html | 304 ++ d8/d8a/exponential__search_8cpp.js | 6 + ...f697e2a3b5193324ab84bd4045088f7_cgraph.map | 4 + ...f697e2a3b5193324ab84bd4045088f7_cgraph.md5 | 1 + ...f697e2a3b5193324ab84bd4045088f7_cgraph.svg | 37 + d8/d8e/struct_node-members.html | 117 + d8/d9b/classgraph-members.html | 124 + .../classstatistics_1_1stats__computer2.html | 339 ++ d8/dab/classstatistics_1_1stats__computer2.js | 12 + ...f2e84df4fc386bb3295016ef8fd156e_cgraph.map | 5 + ...f2e84df4fc386bb3295016ef8fd156e_cgraph.md5 | 1 + ...f2e84df4fc386bb3295016ef8fd156e_cgraph.svg | 53 + d8/db9/structcompare-members.html | 112 + d8/dc8/struct_point.html | 221 ++ d8/dc8/struct_point.js | 8 + d8/dcc/namespacestd.html | 2734 +++++++++++++++++ d8/ddf/sieve__of__eratosthenes_8cpp.html | 307 ++ d8/ddf/sieve__of__eratosthenes_8cpp.js | 9 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + ...50a5c87d27cfd3462745b37fb9b0f46_cgraph.map | 4 + ...50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5 | 1 + ...50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg | 37 + d8/dee/avltree_8cpp.html | 736 +++++ d8/dee/avltree_8cpp.js | 15 + ...286388b0743a716145639df3a33e541_cgraph.map | 5 + ...286388b0743a716145639df3a33e541_cgraph.md5 | 1 + ...286388b0743a716145639df3a33e541_cgraph.svg | 52 + ...7cd8a68075fae1c33df41233c1bed6a_cgraph.map | 4 + ...7cd8a68075fae1c33df41233c1bed6a_cgraph.md5 | 1 + ...7cd8a68075fae1c33df41233c1bed6a_cgraph.svg | 37 + ...a457ffec24c9643f2768e7a65e96546_cgraph.map | 5 + ...a457ffec24c9643f2768e7a65e96546_cgraph.md5 | 1 + ...a457ffec24c9643f2768e7a65e96546_cgraph.svg | 52 + ...4a66d8b0c2b0d626aea45977e358c83_cgraph.map | 4 + ...4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 | 1 + ...4a66d8b0c2b0d626aea45977e358c83_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 9 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 112 + d9/d00/factorial_8cpp.html | 189 ++ d9/d00/factorial_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d9/d02/linear__search_8cpp.html | 240 ++ d9/d02/linear__search_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 37 + d9/d03/namespacestring__search.html | 554 ++++ ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.map | 7 + ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 | 1 + ...1c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg | 83 + ...6a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map | 5 + ...6a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5 | 1 + ...6a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg | 59 + ...422aab133d4ed5e5d6022a7f701271f_cgraph.map | 4 + ...422aab133d4ed5e5d6022a7f701271f_cgraph.md5 | 1 + ...422aab133d4ed5e5d6022a7f701271f_cgraph.svg | 38 + ...b2cd81064717aedd62bfb096b1a73d8_cgraph.map | 5 + ...b2cd81064717aedd62bfb096b1a73d8_cgraph.md5 | 1 + ...b2cd81064717aedd62bfb096b1a73d8_cgraph.svg | 53 + d9/d1d/structqueue-members.html | 125 + ...smachine__learning_1_1adaline-members.html | 121 + d9/d24/poisson__dist_8cpp.html | 375 +++ d9/d24/poisson__dist_8cpp.js | 9 + ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.map | 6 + ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 | 1 + ...9a136b32707bdc7950fb9057b5fa1e1_cgraph.svg | 67 + ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.map | 7 + ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 | 1 + ...9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg | 82 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 11 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 148 + d9/d28/class_queue__coll__graph.map | 4 + d9/d28/class_queue__coll__graph.md5 | 1 + d9/d28/class_queue__coll__graph.svg | 50 + d9/d49/kohonen__som__trace_8cpp.html | 662 ++++ d9/d49/kohonen__som__trace_8cpp.js | 16 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 20 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 379 +++ ...86819c7c140a023582b7269e2d0_cgraph_org.svg | 291 ++ ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 20 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 379 +++ ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg | 291 ++ ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 30 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 589 ++++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 501 +++ ...12b7afa156306b1f8788643c91a1c60_cgraph.map | 4 + ...12b7afa156306b1f8788643c91a1c60_cgraph.md5 | 1 + ...12b7afa156306b1f8788643c91a1c60_cgraph.svg | 37 + ...d0455dd5c30adda100e95f0423c786e_cgraph.map | 21 + ...d0455dd5c30adda100e95f0423c786e_cgraph.md5 | 1 + ...d0455dd5c30adda100e95f0423c786e_cgraph.svg | 394 +++ ...5dd5c30adda100e95f0423c786e_cgraph_org.svg | 306 ++ ...ab8c79ffb674a63f151f282faeb723b_cgraph.map | 5 + ...ab8c79ffb674a63f151f282faeb723b_cgraph.md5 | 1 + ...ab8c79ffb674a63f151f282faeb723b_cgraph.svg | 52 + ...47fb569e63648bd76e7edfdacc02dbd_cgraph.map | 4 + ...47fb569e63648bd76e7edfdacc02dbd_cgraph.md5 | 1 + ...47fb569e63648bd76e7edfdacc02dbd_cgraph.svg | 37 + d9/d57/structtrie__coll__graph.map | 3 + d9/d57/structtrie__coll__graph.md5 | 1 + d9/d57/structtrie__coll__graph.svg | 29 + d9/d5d/extended__euclid__algorithm_8cpp.html | 372 +++ d9/d5d/extended__euclid__algorithm_8cpp.js | 7 + ...792ac7c33aaf26b860ab55f5652ab25_cgraph.map | 5 + ...792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 | 1 + ...792ac7c33aaf26b860ab55f5652ab25_cgraph.svg | 52 + ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map | 4 + ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 | 1 + ...ba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg | 37 + d9/d66/group__machine__learning.html | 432 +++ d9/d66/group__machine__learning.js | 11 + ...c606bc85a3e9fd9d010f874ad760336_cgraph.map | 6 + ...c606bc85a3e9fd9d010f874ad760336_cgraph.md5 | 1 + ...c606bc85a3e9fd9d010f874ad760336_cgraph.svg | 67 + ...2699c805c19a6cc47a937a6f3378afa_cgraph.map | 6 + ...2699c805c19a6cc47a937a6f3378afa_cgraph.md5 | 1 + ...2699c805c19a6cc47a937a6f3378afa_cgraph.svg | 67 + ...53c14440b2b2dd3172c66afc5c2f63f_cgraph.map | 7 + ...53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5 | 1 + ...53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg | 82 + d9/d69/median__search_8cpp.html | 274 ++ d9/d69/median__search_8cpp.js | 6 + ...a66390d0e407dce4fcbf63a169c6c8f_cgraph.map | 7 + ...a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5 | 1 + ...a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg | 82 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 11 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 142 + d9/d78/factorial_8cpp__incl.map | 4 + d9/d78/factorial_8cpp__incl.md5 | 1 + d9/d78/factorial_8cpp__incl.svg | 37 + d9/d7d/primality__test_8cpp__incl.map | 4 + d9/d7d/primality__test_8cpp__incl.md5 | 1 + d9/d7d/primality__test_8cpp__incl.svg | 37 + d9/d89/fibonacci_8cpp.html | 168 + d9/d89/fibonacci_8cpp.js | 5 + d9/d90/struct_btree.html | 134 + d9/d90/struct_btree.js | 6 + ...e__force__string__searching_8cpp__incl.map | 6 + ...e__force__string__searching_8cpp__incl.md5 | 1 + ...e__force__string__searching_8cpp__incl.svg | 68 + d9/dd7/interpolation__search_8cpp.html | 250 ++ d9/dd7/interpolation__search_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + d9/dd9/bisection__method_8cpp__incl.map | 6 + d9/dd9/bisection__method_8cpp__incl.md5 | 1 + d9/dd9/bisection__method_8cpp__incl.svg | 68 + d9/ddb/tower__of__hanoi_8cpp__incl.map | 4 + d9/ddb/tower__of__hanoi_8cpp__incl.md5 | 1 + d9/ddb/tower__of__hanoi_8cpp__incl.svg | 37 + d9/dee/classdouble__linked__list.html | 134 + d9/dee/classdouble__linked__list.js | 9 + d9/dfd/primes__up__to__billion_8cpp__incl.map | 5 + d9/dfd/primes__up__to__billion_8cpp__incl.md5 | 1 + d9/dfd/primes__up__to__billion_8cpp__incl.svg | 52 + da/d23/eulers__totient__function_8cpp.html | 187 ++ da/d23/eulers__totient__function_8cpp.js | 5 + da/d24/sqrt__double_8cpp.html | 214 ++ da/d24/sqrt__double_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + da/d35/sieve__of__eratosthenes_8cpp__incl.map | 4 + da/d35/sieve__of__eratosthenes_8cpp__incl.md5 | 1 + da/d35/sieve__of__eratosthenes_8cpp__incl.svg | 37 + ...non__recursive__merge__sort_8cpp__incl.map | 6 + ...non__recursive__merge__sort_8cpp__incl.md5 | 1 + ...non__recursive__merge__sort_8cpp__incl.svg | 68 + da/d7b/primality__test_8cpp.html | 213 ++ da/d7b/primality__test_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + da/d8a/paranthesis__matching_8cpp__incl.map | 5 + da/d8a/paranthesis__matching_8cpp__incl.md5 | 1 + da/d8a/paranthesis__matching_8cpp__incl.svg | 53 + da/d9a/class_graph.html | 581 ++++ da/d9a/class_graph.js | 45 + da/d9a/palindrome__of__number_8cpp.html | 181 ++ da/d9a/palindrome__of__number_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + ...hine__learning_1_1adaline__coll__graph.map | 4 + ...hine__learning_1_1adaline__coll__graph.md5 | 1 + ...hine__learning_1_1adaline__coll__graph.svg | 38 + da/dd9/happy__number_8cpp__incl.map | 4 + da/dd9/happy__number_8cpp__incl.md5 | 1 + da/dd9/happy__number_8cpp__incl.svg | 37 + da/de7/decimal__to__hexadecimal_8cpp.html | 182 ++ da/de7/decimal__to__hexadecimal_8cpp.js | 4 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.map | 4 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.md5 | 1 + ...40291bc02cba5474a4cb46a9b9566fe_cgraph.svg | 37 + da/df2/durand__kerner__roots_8cpp.html | 586 ++++ da/df2/durand__kerner__roots_8cpp.js | 12 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 17 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 232 ++ ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 17 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 232 ++ ...1637ff89e55ca749993d3e84b95d153_cgraph.map | 6 + ...1637ff89e55ca749993d3e84b95d153_cgraph.md5 | 1 + ...1637ff89e55ca749993d3e84b95d153_cgraph.svg | 67 + ...38b9cfd2a39d856e0feba3b5d241ded_cgraph.map | 15 + ...38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5 | 1 + ...38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg | 202 ++ da/dfd/buzz__number_8cpp__incl.map | 4 + da/dfd/buzz__number_8cpp__incl.md5 | 1 + da/dfd/buzz__number_8cpp__incl.svg | 37 + db/d07/spiral__print_8cpp.html | 308 ++ db/d07/spiral__print_8cpp.js | 6 + db/d0d/prime__factorization_8cpp.html | 330 ++ db/d0d/prime__factorization_8cpp.js | 9 + ...ece0145fb29a5cf48378c23dde2da46_cgraph.map | 4 + ...ece0145fb29a5cf48378c23dde2da46_cgraph.md5 | 1 + ...ece0145fb29a5cf48378c23dde2da46_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 8 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 97 + ...fe577b9bce8f604f5e2f861c63c7099_cgraph.map | 4 + ...fe577b9bce8f604f5e2f861c63c7099_cgraph.md5 | 1 + ...fe577b9bce8f604f5e2f861c63c7099_cgraph.svg | 37 + db/d30/fast__power_8cpp__incl.map | 9 + db/d30/fast__power_8cpp__incl.md5 | 1 + db/d30/fast__power_8cpp__incl.svg | 112 + db/d3c/tower__of__hanoi_8cpp.html | 350 +++ db/d3c/tower__of__hanoi_8cpp.js | 8 + ...037f72a5eac476535a6cfbbcb965417_cgraph.map | 5 + ...037f72a5eac476535a6cfbbcb965417_cgraph.md5 | 1 + ...037f72a5eac476535a6cfbbcb965417_cgraph.svg | 52 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 73 + db/d51/fibonacci__fast_8cpp__incl.map | 6 + db/d51/fibonacci__fast_8cpp__incl.md5 | 1 + db/d51/fibonacci__fast_8cpp__incl.svg | 67 + db/d66/struct_item.html | 125 + db/d66/struct_item.js | 5 + db/d82/classlarge__number.html | 989 ++++++ db/d82/classlarge__number.js | 26 + ...0119a83839e65962621b73df46a5337_cgraph.map | 4 + ...0119a83839e65962621b73df46a5337_cgraph.md5 | 1 + ...0119a83839e65962621b73df46a5337_cgraph.svg | 38 + ...305a82e7b372617419337b2d2119c7d_cgraph.map | 4 + ...305a82e7b372617419337b2d2119c7d_cgraph.md5 | 1 + ...305a82e7b372617419337b2d2119c7d_cgraph.svg | 37 + ...f5571e66305cf68bb8283e4aeda58bc_cgraph.map | 7 + ...f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 | 1 + ...f5571e66305cf68bb8283e4aeda58bc_cgraph.svg | 82 + ...0c436d1a1c5e3795d6177d3815ad615_cgraph.map | 4 + ...0c436d1a1c5e3795d6177d3815ad615_cgraph.md5 | 1 + ...0c436d1a1c5e3795d6177d3815ad615_cgraph.svg | 37 + ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map | 6 + ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 | 1 + ...59c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg | 68 + ...1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map | 8 + ...1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5 | 1 + ...1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg | 185 ++ ...e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg | 97 + ...4598f1f2794b5e17e10c25e0501e41a_cgraph.map | 5 + ...4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 | 1 + ...4598f1f2794b5e17e10c25e0501e41a_cgraph.svg | 53 + ...530d90830d385c76973658ff3214f98_cgraph.map | 5 + ...530d90830d385c76973658ff3214f98_cgraph.md5 | 1 + ...530d90830d385c76973658ff3214f98_cgraph.svg | 52 + db/d8b/struct_node.html | 149 + db/d8b/struct_node.js | 9 + db/d8f/struct_btree__coll__graph.map | 3 + db/d8f/struct_btree__coll__graph.md5 | 1 + db/d8f/struct_btree__coll__graph.svg | 30 + db/d93/check__prime_8cpp.html | 227 ++ db/d93/check__prime_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + db/dd3/ode__forward__euler_8cpp.html | 414 +++ db/dd3/ode__forward__euler_8cpp.js | 9 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 16 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 + ...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 241 ++ ...13517b8e5de1b75592052db7f7e237f_cgraph.map | 10 + ...13517b8e5de1b75592052db7f7e237f_cgraph.md5 | 1 + ...13517b8e5de1b75592052db7f7e237f_cgraph.svg | 127 + ...3adf7b092a87868917ee5fb4255192b_cgraph.map | 5 + ...3adf7b092a87868917ee5fb4255192b_cgraph.md5 | 1 + ...3adf7b092a87868917ee5fb4255192b_cgraph.svg | 52 + db/dd4/structlist__coll__graph.map | 3 + db/dd4/structlist__coll__graph.md5 | 1 + db/dd4/structlist__coll__graph.svg | 29 + db/df3/happy__number_8cpp.html | 206 ++ db/df3/happy__number_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + dc/d1a/pascal__triangle_8cpp.html | 291 ++ dc/d1a/pascal__triangle_8cpp.js | 6 + ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map | 5 + ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 | 1 + ...7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg | 52 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 88 + dc/d37/lu__decompose_8cpp__incl.map | 7 + dc/d37/lu__decompose_8cpp__incl.md5 | 1 + dc/d37/lu__decompose_8cpp__incl.svg | 83 + ...inary__least__squares__regressor_8cpp.html | 994 ++++++ ...rdinary__least__squares__regressor_8cpp.js | 18 + ...1be3fe36e76b87d5616ff8e7918cd24_cgraph.map | 5 + ...1be3fe36e76b87d5616ff8e7918cd24_cgraph.md5 | 1 + ...1be3fe36e76b87d5616ff8e7918cd24_cgraph.svg | 52 + ...8ff1d954e9b7de93eb20e2dd101a045_cgraph.map | 8 + ...8ff1d954e9b7de93eb20e2dd101a045_cgraph.md5 | 1 + ...8ff1d954e9b7de93eb20e2dd101a045_cgraph.svg | 97 + ...4d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map | 5 + ...4d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5 | 1 + ...4d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg | 52 + ...7249e31221231cf3aaf3cfd870372d0_cgraph.map | 5 + ...7249e31221231cf3aaf3cfd870372d0_cgraph.md5 | 1 + ...7249e31221231cf3aaf3cfd870372d0_cgraph.svg | 52 + ...8ab8f75d981088369b89b8be2182483_cgraph.map | 5 + ...8ab8f75d981088369b89b8be2182483_cgraph.md5 | 1 + ...8ab8f75d981088369b89b8be2182483_cgraph.svg | 52 + ...8eb5807f21b783c341cab402ced6732_cgraph.map | 7 + ...8eb5807f21b783c341cab402ced6732_cgraph.md5 | 1 + ...8eb5807f21b783c341cab402ced6732_cgraph.svg | 82 + ...b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map | 4 + ...b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5 | 1 + ...b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg | 37 + ...799b4cec1681219887d89d037cfab50_cgraph.map | 6 + ...799b4cec1681219887d89d037cfab50_cgraph.md5 | 1 + ...799b4cec1681219887d89d037cfab50_cgraph.svg | 67 + ...6171f4db68a5e50ae0f3500a63acd26_cgraph.map | 4 + ...6171f4db68a5e50ae0f3500a63acd26_cgraph.md5 | 1 + ...6171f4db68a5e50ae0f3500a63acd26_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 10 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 133 + ...cef32c2a4f39a3f7398949256d180a6_cgraph.map | 4 + ...cef32c2a4f39a3f7398949256d180a6_cgraph.md5 | 1 + ...cef32c2a4f39a3f7398949256d180a6_cgraph.svg | 37 + ...decimal__to__roman__numeral_8cpp__incl.map | 7 + ...decimal__to__roman__numeral_8cpp__incl.md5 | 1 + ...decimal__to__roman__numeral_8cpp__incl.svg | 83 + dc/d5f/qr__decompose_8h__dep__incl.map | 5 + dc/d5f/qr__decompose_8h__dep__incl.md5 | 1 + dc/d5f/qr__decompose_8h__dep__incl.svg | 55 + dc/d93/trie__modern_8cpp.html | 171 ++ dc/d93/trie__modern_8cpp.js | 6 + dc/db5/text__search_8cpp.html | 189 ++ dc/db5/text__search_8cpp.js | 4 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + dc/dc5/ode__forward__euler_8cpp__incl.map | 8 + dc/dc5/ode__forward__euler_8cpp__incl.md5 | 1 + dc/dc5/ode__forward__euler_8cpp__incl.svg | 98 + dc/dc5/paranthesis__matching_8cpp.html | 227 ++ dc/dc5/paranthesis__matching_8cpp.js | 10 + dc/de0/fibonacci__large_8cpp__incl.map | 12 + dc/de0/fibonacci__large_8cpp__incl.md5 | 1 + dc/de0/fibonacci__large_8cpp__incl.svg | 169 + dc/de2/false__position_8cpp__incl.map | 7 + dc/de2/false__position_8cpp__incl.md5 | 1 + dc/de2/false__position_8cpp__incl.svg | 83 + dc/dfe/ternary__search_8cpp.html | 461 +++ dc/dfe/ternary__search_8cpp.js | 11 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 8 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 97 + ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.map | 6 + ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 | 1 + ...f655a27eb82efa299bf9d0becf6e9c8_cgraph.svg | 67 + dd/d00/class_queue-members.html | 118 + dd/d0e/double__factorial_8cpp__incl.map | 5 + dd/d0e/double__factorial_8cpp__incl.md5 | 1 + dd/d0e/double__factorial_8cpp__incl.svg | 52 + dd/d0f/text__search_8cpp__incl.map | 6 + dd/d0f/text__search_8cpp__incl.md5 | 1 + dd/d0f/text__search_8cpp__incl.svg | 67 + dd/d1b/structquery.html | 128 + dd/d1b/structquery.js | 6 + dd/d29/false__position_8cpp.html | 275 ++ dd/d29/false__position_8cpp.js | 8 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.map | 4 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 | 1 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.svg | 37 + dd/d2f/class_trie.html | 414 +++ dd/d2f/class_trie.js | 12 + ...5216ffc56cb9f8cede982cecb872af4_cgraph.map | 6 + ...5216ffc56cb9f8cede982cecb872af4_cgraph.md5 | 1 + ...5216ffc56cb9f8cede982cecb872af4_cgraph.svg | 67 + dd/d30/matrix__exponentiation_8cpp__incl.map | 5 + dd/d30/matrix__exponentiation_8cpp__incl.md5 | 1 + dd/d30/matrix__exponentiation_8cpp__incl.svg | 52 + dd/d3b/struct_entry.html | 137 + dd/d3b/struct_entry.js | 7 + dd/d4f/class_solution.html | 157 + dd/d4f/class_solution.js | 11 + dd/d51/classstack-members.html | 122 + dd/d65/lu__decompose_8cpp.html | 365 +++ dd/d65/lu__decompose_8cpp.js | 6 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 8 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 97 + ...8eb5807f21b783c341cab402ced6732_cgraph.map | 7 + ...8eb5807f21b783c341cab402ced6732_cgraph.md5 | 1 + ...8eb5807f21b783c341cab402ced6732_cgraph.svg | 82 + dd/d75/structqueue__coll__graph.map | 4 + dd/d75/structqueue__coll__graph.md5 | 1 + dd/d75/structqueue__coll__graph.svg | 49 + dd/d7a/classdouble__linked__list-members.html | 117 + .../classstack__linked_list__coll__graph.map | 4 + .../classstack__linked_list__coll__graph.md5 | 1 + .../classstack__linked_list__coll__graph.svg | 46 + dd/d82/large__number_8h__incl.map | 10 + dd/d82/large__number_8h__incl.md5 | 1 + dd/d82/large__number_8h__incl.svg | 127 + dd/d86/shell__sort2_8cpp__incl.map | 9 + dd/d86/shell__sort2_8cpp__incl.md5 | 1 + dd/d86/shell__sort2_8cpp__incl.svg | 112 + dd/d9b/classgraph.html | 173 ++ dd/d9b/classgraph.js | 16 + dd/da0/todo.html | 131 + .../struct_segment_intersection-members.html | 114 + ...line__segment__intersection_8cpp__incl.map | 5 + ...line__segment__intersection_8cpp__incl.md5 | 1 + ...line__segment__intersection_8cpp__incl.svg | 53 + dd/df4/structlca.html | 156 + dd/df4/structlca.js | 12 + dd/df5/poisson__dist_8cpp__incl.map | 5 + dd/df5/poisson__dist_8cpp__incl.md5 | 1 + dd/df5/poisson__dist_8cpp__incl.svg | 53 + de/d36/binary__exponent_8cpp__incl.map | 4 + de/d36/binary__exponent_8cpp__incl.md5 | 1 + de/d36/binary__exponent_8cpp__incl.svg | 37 + de/d47/string__fibonacci_8cpp.html | 295 ++ de/d47/string__fibonacci_8cpp.js | 6 + ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.map | 4 + ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 | 1 + ...8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + de/d48/struct_trie_1_1_trie_node.html | 133 + de/d48/struct_trie_1_1_trie_node.js | 5 + .../eulers__totient__function_8cpp__incl.map | 5 + .../eulers__totient__function_8cpp__incl.md5 | 1 + .../eulers__totient__function_8cpp__incl.svg | 53 + de/d69/knuth__morris__pratt_8cpp__incl.map | 6 + de/d69/knuth__morris__pratt_8cpp__incl.md5 | 1 + de/d69/knuth__morris__pratt_8cpp__incl.svg | 68 + de/d6a/knuth__morris__pratt_8cpp.html | 195 ++ de/d6a/knuth__morris__pratt_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 89 + de/d6c/palindrome__of__number_8cpp__incl.map | 6 + de/d6c/palindrome__of__number_8cpp__incl.md5 | 1 + de/d6c/palindrome__of__number_8cpp__incl.svg | 68 + de/d75/qr__eigen__values_8cpp.html | 485 +++ de/d75/qr__eigen__values_8cpp.js | 10 + ...283886819c7c140a023582b7269e2d0_cgraph.map | 11 + ...283886819c7c140a023582b7269e2d0_cgraph.md5 | 1 + ...283886819c7c140a023582b7269e2d0_cgraph.svg | 231 ++ ...86819c7c140a023582b7269e2d0_cgraph_org.svg | 143 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.map | 11 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 | 1 + ...440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg | 231 ++ ...7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg | 143 + ...3cb0a68c36aa26fd599c7c66da86ed7_cgraph.map | 4 + ...3cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5 | 1 + ...3cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg | 37 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.map | 17 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 | 1 + ...c04138a5bfe5d72780bb7e82a18e627_cgraph.svg | 339 ++ ...38a5bfe5d72780bb7e82a18e627_cgraph_org.svg | 251 ++ de/d7c/struct_trie_1_1_trie_node-members.html | 113 + de/d85/decimal__to__roman__numeral_8cpp.html | 322 ++ de/d85/decimal__to__roman__numeral_8cpp.js | 7 + ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map | 4 + ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 | 1 + ...03fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg | 37 + ...14743638eff1336f835310049aef979_cgraph.map | 4 + ...14743638eff1336f835310049aef979_cgraph.md5 | 1 + ...14743638eff1336f835310049aef979_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 73 + de/d8a/class_trie-members.html | 119 + de/d91/class_queue___array-members.html | 119 + de/d91/structlist-members.html | 123 + de/d9b/prime__numbers_8cpp.html | 211 ++ de/d9b/prime__numbers_8cpp.js | 5 + ...b91f208e8365c95a295cfe3e67df5c3_cgraph.map | 4 + ...b91f208e8365c95a295cfe3e67df5c3_cgraph.md5 | 1 + ...b91f208e8365c95a295cfe3e67df5c3_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 7 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 82 + de/db2/quick__sort_8cpp__incl.map | 5 + de/db2/quick__sort_8cpp__incl.md5 | 1 + de/db2/quick__sort_8cpp__incl.svg | 52 + de/db5/class_edge-members.html | 123 + de/dc3/binaryheap_8cpp.html | 138 + de/dc3/binaryheap_8cpp.js | 5 + de/dc8/classlarge__number-members.html | 134 + de/dcf/binary__exponent_8cpp.html | 265 ++ de/dcf/binary__exponent_8cpp.js | 6 + de/dd3/newton__raphson__method_8cpp.html | 281 ++ de/dd3/newton__raphson__method_8cpp.js | 8 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.map | 4 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 | 1 + ...003b5b2dcfff0769b957ab5c968b03d_cgraph.svg | 37 + ...d3f7f41977394680af6ebbed96f3386_cgraph.map | 4 + ...d3f7f41977394680af6ebbed96f3386_cgraph.md5 | 1 + ...d3f7f41977394680af6ebbed96f3386_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + de/de4/fibonacci__large_8cpp.html | 175 ++ de/de4/fibonacci__large_8cpp.js | 5 + df/d06/decimal__to__binary_8cpp.html | 217 ++ df/d06/decimal__to__binary_8cpp.js | 6 + ...0df57491019f0ac39b492740fb388f7_cgraph.map | 4 + ...0df57491019f0ac39b492740fb388f7_cgraph.md5 | 1 + ...0df57491019f0ac39b492740fb388f7_cgraph.svg | 37 + ...240f2e79074a2a248395258aebbfa11_cgraph.map | 4 + ...240f2e79074a2a248395258aebbfa11_cgraph.md5 | 1 + ...240f2e79074a2a248395258aebbfa11_cgraph.svg | 37 + df/d0f/fibonacci_8cpp__incl.map | 5 + df/d0f/fibonacci_8cpp__incl.md5 | 1 + df/d0f/fibonacci_8cpp__incl.svg | 52 + df/d27/class_bit.html | 157 + df/d27/class_bit.js | 11 + df/d39/interpolation__search2_8cpp.html | 231 ++ df/d39/interpolation__search2_8cpp.js | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + df/d3c/exponential__search_8cpp__incl.map | 7 + df/d3c/exponential__search_8cpp__incl.md5 | 1 + df/d3c/exponential__search_8cpp__incl.svg | 83 + df/d86/rabin__karp_8cpp__incl.map | 7 + df/d86/rabin__karp_8cpp__incl.md5 | 1 + df/d86/rabin__karp_8cpp__incl.svg | 82 + df/dc8/successive__approximation_8cpp.html | 246 ++ df/dc8/successive__approximation_8cpp.js | 6 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + df/dd4/stairs__pattern_8cpp__incl.map | 4 + df/dd4/stairs__pattern_8cpp__incl.md5 | 1 + df/dd4/stairs__pattern_8cpp__incl.svg | 37 + df/dd5/binary__search_8cpp.html | 257 ++ df/dd5/binary__search_8cpp.js | 5 + ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.map | 5 + ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 | 1 + ...f9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg | 52 + df/dd7/structlinkedlist-members.html | 113 + df/ddc/struct_node__coll__graph.map | 3 + df/ddc/struct_node__coll__graph.md5 | 1 + df/ddc/struct_node__coll__graph.svg | 29 + df/def/power__for__huge__numbers_8cpp.html | 327 ++ df/def/power__for__huge__numbers_8cpp.js | 7 + ...249a2af508aa94266023ce8aa81426f_cgraph.map | 4 + ...249a2af508aa94266023ce8aa81426f_cgraph.md5 | 1 + ...249a2af508aa94266023ce8aa81426f_cgraph.svg | 37 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map | 5 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 | 1 + ...66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg | 52 + dir_074119ce3a874b57120c49a0cc4bb5ad.html | 109 + dir_0eaa691bd54ab0922ca7f50599de6d22.html | 109 + dir_12552d7fa429bf94a2e32e5cf39f7e69.html | 109 + dir_19b2bf9199a15c634a08b1ede1dd896a.html | 143 + dir_19b2bf9199a15c634a08b1ede1dd896a.js | 13 + dir_296d53ceaeaa7e099814a6def439fe8a.html | 190 ++ dir_296d53ceaeaa7e099814a6def439fe8a.js | 31 + dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html | 131 + dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js | 11 + dir_3343723ae086de42ee4ca9774da3a13f.html | 122 + dir_3343723ae086de42ee4ca9774da3a13f.js | 6 + dir_35422be6552f1b3672c1b6c4aba2da64.html | 109 + dir_73a3cc5065b223eb41b02873c0e19f0e.html | 122 + dir_73a3cc5065b223eb41b02873c0e19f0e.js | 6 + dir_82e494173a87936756866de2fa774307.html | 125 + dir_82e494173a87936756866de2fa774307.js | 7 + dir_8a20dd5bfd5341a725342bf72b6b686f.html | 109 + dir_9510827d0b234b3cc54b29892f217477.html | 163 + dir_9510827d0b234b3cc54b29892f217477.js | 20 + dir_9c6faab82c22511b50177aa2e38e2780.html | 155 + dir_9c6faab82c22511b50177aa2e38e2780.js | 17 + dir_bb1b521853a9c46347182a9d10420771.html | 124 + dir_bb1b521853a9c46347182a9d10420771.js | 7 + dir_c11585dfcef32a26e29098facab6c144.html | 109 + dir_e3380d2178455503f266746fb14246a5.html | 116 + dir_e3380d2178455503f266746fb14246a5.js | 4 + dir_ece9b94c107bbaa1dd68197a8c9983b9.html | 109 + dir_f1797d0c2a0a12033e7d74efffeb14e1.html | 109 + dir_f1797d0c2a0a12033e7d74efffeb14e1.js | 4 + doc.png | Bin 0 -> 746 bytes doxygen.css | 1730 +++++++++++ doxygen.png | Bin 0 -> 3779 bytes dynsections.js | 121 + files.html | 213 ++ files_dup.js | 13 + folderclosed.png | Bin 0 -> 616 bytes folderopen.png | Bin 0 -> 597 bytes functions.html | 447 +++ functions_func.html | 364 +++ functions_rela.html | 123 + functions_vars.html | 154 + globals.html | 114 + globals_a.html | 135 + globals_b.html | 142 + globals_c.html | 132 + globals_d.html | 123 + globals_defs.html | 151 + globals_dup.js | 24 + globals_e.html | 134 + globals_f.html | 154 + globals_func.html | 111 + globals_func.js | 23 + globals_func_a.html | 123 + globals_func_b.html | 142 + globals_func_c.html | 132 + globals_func_d.html | 120 + globals_func_e.html | 131 + globals_func_f.html | 148 + globals_func_g.html | 139 + globals_func_h.html | 117 + globals_func_i.html | 141 + globals_func_j.html | 111 + globals_func_l.html | 126 + globals_func_m.html | 211 ++ globals_func_n.html | 114 + globals_func_o.html | 127 + globals_func_p.html | 159 + globals_func_r.html | 114 + globals_func_s.html | 156 + globals_func_t.html | 179 ++ globals_func_u.html | 111 + globals_g.html | 139 + globals_h.html | 123 + globals_i.html | 147 + globals_j.html | 111 + globals_k.html | 111 + globals_l.html | 135 + globals_m.html | 230 ++ globals_n.html | 117 + globals_o.html | 127 + globals_p.html | 171 ++ globals_r.html | 114 + globals_s.html | 159 + globals_t.html | 185 ++ globals_type.html | 112 + globals_u.html | 111 + globals_vars.html | 149 + graph_legend.html | 168 + graph_legend.md5 | 1 + graph_legend.svg | 117 + index.html | 118 + jquery.js | 35 + menu.js | 51 + menudata.js | 133 + modules.html | 114 + modules.js | 5 + namespacemembers.html | 172 ++ namespacemembers_func.html | 172 ++ namespaces.html | 118 + namespaces_dup.js | 9 + nav_f.png | Bin 0 -> 153 bytes nav_g.png | Bin 0 -> 95 bytes nav_h.png | Bin 0 -> 98 bytes navtree.css | 146 + navtree.js | 546 ++++ navtreedata.js | 109 + navtreeindex0.js | 253 ++ navtreeindex1.js | 253 ++ navtreeindex2.js | 253 ++ navtreeindex3.js | 174 ++ open.png | Bin 0 -> 123 bytes pages.html | 116 + resize.js | 140 + search/all_0.html | 36 + search/all_0.js | 7 + search/all_1.html | 36 + search/all_1.js | 96 + search/all_10.html | 36 + search/all_10.js | 96 + search/all_11.html | 36 + search/all_11.js | 18 + search/all_12.html | 36 + search/all_12.js | 97 + search/all_13.html | 36 + search/all_13.js | 201 ++ search/all_14.html | 36 + search/all_14.js | 96 + search/all_15.html | 36 + search/all_15.js | 62 + search/all_16.html | 36 + search/all_16.js | 37 + search/all_17.html | 36 + search/all_17.js | 82 + search/all_18.html | 36 + search/all_18.js | 7 + search/all_19.html | 36 + search/all_19.js | 7 + search/all_1a.html | 36 + search/all_1a.js | 5 + search/all_1b.html | 36 + search/all_1b.js | 94 + search/all_2.html | 36 + search/all_2.js | 82 + search/all_3.html | 36 + search/all_3.js | 91 + search/all_4.html | 36 + search/all_4.js | 90 + search/all_5.html | 36 + search/all_5.js | 65 + search/all_6.html | 36 + search/all_6.js | 118 + search/all_7.html | 36 + search/all_7.js | 60 + search/all_8.html | 36 + search/all_8.js | 25 + search/all_9.html | 36 + search/all_9.js | 176 ++ search/all_a.html | 36 + search/all_a.js | 8 + search/all_b.html | 36 + search/all_b.js | 16 + search/all_c.html | 36 + search/all_c.js | 66 + search/all_d.html | 36 + search/all_d.js | 101 + search/all_e.html | 36 + search/all_e.js | 60 + search/all_f.html | 36 + search/all_f.js | 66 + search/classes_0.html | 36 + search/classes_0.js | 21 + search/classes_1.html | 36 + search/classes_1.js | 43 + search/classes_10.html | 36 + search/classes_10.js | 6 + search/classes_11.html | 36 + search/classes_11.js | 42 + search/classes_12.html | 36 + search/classes_12.js | 43 + search/classes_13.html | 36 + search/classes_13.js | 25 + search/classes_14.html | 36 + search/classes_14.js | 36 + search/classes_15.html | 36 + search/classes_15.js | 14 + search/classes_16.html | 36 + search/classes_16.js | 34 + search/classes_17.html | 36 + search/classes_17.js | 5 + search/classes_18.html | 36 + search/classes_18.js | 4 + search/classes_2.html | 36 + search/classes_2.js | 37 + search/classes_3.html | 36 + search/classes_3.js | 18 + search/classes_4.html | 36 + search/classes_4.js | 20 + search/classes_5.html | 36 + search/classes_5.js | 19 + search/classes_6.html | 36 + search/classes_6.js | 9 + search/classes_7.html | 36 + search/classes_7.js | 8 + search/classes_8.html | 36 + search/classes_8.js | 101 + search/classes_9.html | 36 + search/classes_9.js | 4 + search/classes_a.html | 36 + search/classes_a.js | 5 + search/classes_b.html | 36 + search/classes_b.js | 20 + search/classes_c.html | 36 + search/classes_c.js | 39 + search/classes_d.html | 36 + search/classes_d.js | 20 + search/classes_e.html | 36 + search/classes_e.js | 15 + search/classes_f.html | 36 + search/classes_f.js | 20 + search/close.png | Bin 0 -> 273 bytes search/defines_0.html | 36 + search/defines_0.js | 4 + search/defines_1.html | 36 + search/defines_1.js | 5 + search/defines_2.html | 36 + search/defines_2.js | 4 + search/defines_3.html | 36 + search/defines_3.js | 4 + search/defines_4.html | 36 + search/defines_4.js | 5 + search/defines_5.html | 36 + search/defines_5.js | 7 + search/defines_6.html | 36 + search/defines_6.js | 5 + search/files_0.html | 36 + search/files_0.js | 6 + search/files_1.html | 36 + search/files_1.js | 13 + search/files_10.html | 36 + search/files_10.js | 7 + search/files_11.html | 36 + search/files_11.js | 5 + search/files_12.html | 36 + search/files_12.js | 12 + search/files_13.html | 36 + search/files_13.js | 7 + search/files_14.html | 36 + search/files_14.js | 4 + search/files_2.html | 36 + search/files_2.js | 4 + search/files_3.html | 36 + search/files_3.js | 8 + search/files_4.html | 36 + search/files_4.js | 6 + search/files_5.html | 36 + search/files_5.js | 10 + search/files_6.html | 36 + search/files_6.js | 7 + search/files_7.html | 36 + search/files_7.js | 5 + search/files_8.html | 36 + search/files_8.js | 5 + search/files_9.html | 36 + search/files_9.js | 4 + search/files_a.html | 36 + search/files_a.js | 6 + search/files_b.html | 36 + search/files_b.js | 10 + search/files_c.html | 36 + search/files_c.js | 6 + search/files_d.html | 36 + search/files_d.js | 6 + search/files_e.html | 36 + search/files_e.js | 7 + search/files_f.html | 36 + search/files_f.js | 12 + search/functions_0.html | 36 + search/functions_0.js | 5 + search/functions_1.html | 36 + search/functions_1.js | 77 + search/functions_10.html | 36 + search/functions_10.js | 74 + search/functions_11.html | 36 + search/functions_11.js | 9 + search/functions_12.html | 36 + search/functions_12.js | 72 + search/functions_13.html | 36 + search/functions_13.js | 168 + search/functions_14.html | 36 + search/functions_14.js | 77 + search/functions_15.html | 36 + search/functions_15.js | 41 + search/functions_16.html | 36 + search/functions_16.js | 25 + search/functions_17.html | 36 + search/functions_17.js | 76 + search/functions_18.html | 36 + search/functions_18.js | 6 + search/functions_19.html | 36 + search/functions_19.js | 4 + search/functions_1a.html | 36 + search/functions_1a.js | 4 + search/functions_1b.html | 36 + search/functions_1b.js | 94 + search/functions_2.html | 36 + search/functions_2.js | 59 + search/functions_3.html | 36 + search/functions_3.js | 71 + search/functions_4.html | 36 + search/functions_4.js | 77 + search/functions_5.html | 36 + search/functions_5.js | 52 + search/functions_6.html | 36 + search/functions_6.js | 102 + search/functions_7.html | 36 + search/functions_7.js | 53 + search/functions_8.html | 36 + search/functions_8.js | 16 + search/functions_9.html | 36 + search/functions_9.js | 86 + search/functions_a.html | 36 + search/functions_a.js | 6 + search/functions_b.html | 36 + search/functions_b.js | 11 + search/functions_c.html | 36 + search/functions_c.js | 46 + search/functions_d.html | 36 + search/functions_d.js | 78 + search/functions_e.html | 36 + search/functions_e.js | 48 + search/functions_f.html | 36 + search/functions_f.js | 57 + search/groups_0.html | 36 + search/groups_0.js | 4 + search/groups_1.html | 36 + search/groups_1.js | 4 + search/mag_sel.png | Bin 0 -> 465 bytes search/namespaces_0.html | 36 + search/namespaces_0.js | 4 + search/namespaces_1.html | 36 + search/namespaces_1.js | 4 + search/namespaces_2.html | 36 + search/namespaces_2.js | 12 + search/nomatches.html | 12 + search/pages_0.html | 36 + search/pages_0.js | 4 + search/pages_1.html | 36 + search/pages_1.js | 4 + search/pages_2.html | 36 + search/pages_2.js | 4 + search/pages_3.html | 36 + search/pages_3.js | 5 + search/related_0.html | 36 + search/related_0.js | 8 + search/search.css | 271 ++ search/search.js | 814 +++++ search/search_l.png | Bin 0 -> 567 bytes search/search_m.png | Bin 0 -> 158 bytes search/search_r.png | Bin 0 -> 553 bytes search/searchdata.js | 45 + search/typedefs_0.html | 36 + search/typedefs_0.js | 4 + search/typedefs_1.html | 36 + search/typedefs_1.js | 4 + search/variables_0.html | 36 + search/variables_0.js | 4 + search/variables_1.html | 36 + search/variables_1.js | 6 + search/variables_10.html | 36 + search/variables_10.js | 4 + search/variables_11.html | 36 + search/variables_11.js | 4 + search/variables_12.html | 36 + search/variables_12.js | 4 + search/variables_2.html | 36 + search/variables_2.js | 4 + search/variables_3.html | 36 + search/variables_3.js | 4 + search/variables_4.html | 36 + search/variables_4.js | 4 + search/variables_5.html | 36 + search/variables_5.js | 5 + search/variables_6.html | 36 + search/variables_6.js | 6 + search/variables_7.html | 36 + search/variables_7.js | 4 + search/variables_8.html | 36 + search/variables_8.js | 5 + search/variables_9.html | 36 + search/variables_9.js | 4 + search/variables_a.html | 36 + search/variables_a.js | 4 + search/variables_b.html | 36 + search/variables_b.js | 5 + search/variables_c.html | 36 + search/variables_c.js | 5 + search/variables_d.html | 36 + search/variables_d.js | 5 + search/variables_e.html | 36 + search/variables_e.js | 5 + search/variables_f.html | 36 + search/variables_f.js | 4 + splitbar.png | Bin 0 -> 314 bytes svgpan.js | 323 ++ sync_off.png | Bin 0 -> 853 bytes sync_on.png | Bin 0 -> 845 bytes tab_a.png | Bin 0 -> 142 bytes tab_b.png | Bin 0 -> 169 bytes tab_h.png | Bin 0 -> 177 bytes tab_s.png | Bin 0 -> 184 bytes tabs.css | 1 + 1714 files changed, 114526 insertions(+) create mode 100644 annotated.html create mode 100644 annotated_dup.js create mode 100644 bc_s.png create mode 100644 bdwn.png create mode 100644 classes.html create mode 100644 closed.png create mode 100644 d0/d01/smallest__circle_8cpp.html create mode 100644 d0/d01/smallest__circle_8cpp.js create mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg create mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg create mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg create mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg create mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map create mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5 create mode 100644 d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg create mode 100644 d0/d04/qr__decompose_8h__incl.map create mode 100644 d0/d04/qr__decompose_8h__incl.md5 create mode 100644 d0/d04/qr__decompose_8h__incl.svg create mode 100644 d0/d08/realtime__stats_8cpp.html create mode 100644 d0/d08/realtime__stats_8cpp.js create mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map create mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5 create mode 100644 d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg create mode 100644 d0/d0d/structmst-members.html create mode 100644 d0/d1f/structnode__coll__graph.map create mode 100644 d0/d1f/structnode__coll__graph.md5 create mode 100644 d0/d1f/structnode__coll__graph.svg create mode 100644 d0/d55/classcll-members.html create mode 100644 d0/d77/linear__search_8cpp__incl.map create mode 100644 d0/d77/linear__search_8cpp__incl.md5 create mode 100644 d0/d77/linear__search_8cpp__incl.svg create mode 100644 d0/d78/classstatistics_1_1stats__computer1-members.html create mode 100644 d0/d80/classgraph__coll__graph.map create mode 100644 d0/d80/classgraph__coll__graph.md5 create mode 100644 d0/d80/classgraph__coll__graph.svg create mode 100644 d0/da1/string__fibonacci_8cpp__incl.map create mode 100644 d0/da1/string__fibonacci_8cpp__incl.md5 create mode 100644 d0/da1/string__fibonacci_8cpp__incl.svg create mode 100644 d0/da2/number__of__positive__divisors_8cpp.html create mode 100644 d0/da2/number__of__positive__divisors_8cpp.js create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.map create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5 create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d0/dab/interpolation__search_8cpp__incl.map create mode 100644 d0/dab/interpolation__search_8cpp__incl.md5 create mode 100644 d0/dab/interpolation__search_8cpp__incl.svg create mode 100644 d0/db5/trie__modern_8cpp__incl.map create mode 100644 d0/db5/trie__modern_8cpp__incl.md5 create mode 100644 d0/db5/trie__modern_8cpp__incl.svg create mode 100644 d0/db6/non__recursive__merge__sort_8cpp.html create mode 100644 d0/db6/non__recursive__merge__sort_8cpp.js create mode 100644 d0/db7/smallest__circle_8cpp__incl.map create mode 100644 d0/db7/smallest__circle_8cpp__incl.md5 create mode 100644 d0/db7/smallest__circle_8cpp__incl.svg create mode 100644 d0/dc4/struct_point-members.html create mode 100644 d0/dcc/successive__approximation_8cpp__incl.map create mode 100644 d0/dcc/successive__approximation_8cpp__incl.md5 create mode 100644 d0/dcc/successive__approximation_8cpp__incl.svg create mode 100644 d0/dd1/binaryheap_8cpp__incl.map create mode 100644 d0/dd1/binaryheap_8cpp__incl.md5 create mode 100644 d0/dd1/binaryheap_8cpp__incl.svg create mode 100644 d0/dd2/class_queue___array.html create mode 100644 d0/dd2/class_queue___array.js create mode 100644 d0/dd5/ode__midpoint__euler_8cpp__incl.map create mode 100644 d0/dd5/ode__midpoint__euler_8cpp__incl.md5 create mode 100644 d0/dd5/ode__midpoint__euler_8cpp__incl.svg create mode 100644 d0/de2/gaussian__elimination_8cpp.html create mode 100644 d0/de2/gaussian__elimination_8cpp.js create mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d0/dfc/sqrt__double_8cpp__incl.map create mode 100644 d0/dfc/sqrt__double_8cpp__incl.md5 create mode 100644 d0/dfc/sqrt__double_8cpp__incl.svg create mode 100644 d0/dff/structlinkedlist.html create mode 100644 d0/dff/structlinkedlist.js create mode 100644 d1/d06/ternary__search_8cpp__incl.map create mode 100644 d1/d06/ternary__search_8cpp__incl.md5 create mode 100644 d1/d06/ternary__search_8cpp__incl.svg create mode 100644 d1/d07/class_solution-members.html create mode 100644 d1/d11/gcd__of__n__numbers_8cpp.html create mode 100644 d1/d11/gcd__of__n__numbers_8cpp.js create mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/d1d/class_graph-members.html create mode 100644 d1/d1d/pascal__triangle_8cpp__incl.map create mode 100644 d1/d1d/pascal__triangle_8cpp__incl.md5 create mode 100644 d1/d1d/pascal__triangle_8cpp__incl.svg create mode 100644 d1/d21/quick__sort_8cpp.html create mode 100644 d1/d21/quick__sort_8cpp.js create mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/d4b/ordinary__least__squares__regressor_8cpp__incl.map create mode 100644 d1/d4b/ordinary__least__squares__regressor_8cpp__incl.md5 create mode 100644 d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg create mode 100644 d1/d57/classcll__coll__graph.map create mode 100644 d1/d57/classcll__coll__graph.md5 create mode 100644 d1/d57/classcll__coll__graph.svg create mode 100644 d1/d76/buzz__number_8cpp.html create mode 100644 d1/d76/buzz__number_8cpp.js create mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/d77/structmst.html create mode 100644 d1/d77/structmst.js create mode 100644 d1/d7d/gcd__of__n__numbers_8cpp__incl.map create mode 100644 d1/d7d/gcd__of__n__numbers_8cpp__incl.md5 create mode 100644 d1/d7d/gcd__of__n__numbers_8cpp__incl.svg create mode 100644 d1/da1/decimal__to__hexadecimal_8cpp__incl.map create mode 100644 d1/da1/decimal__to__hexadecimal_8cpp__incl.md5 create mode 100644 d1/da1/decimal__to__hexadecimal_8cpp__incl.svg create mode 100644 d1/db3/structcompare.html create mode 100644 d1/db3/structcompare.js create mode 100644 d1/dc2/class_graph__coll__graph.map create mode 100644 d1/dc2/class_graph__coll__graph.md5 create mode 100644 d1/dc2/class_graph__coll__graph.svg create mode 100644 d1/dc2/classstack.html create mode 100644 d1/dc2/classstack.js create mode 100644 d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.map create mode 100644 d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 create mode 100644 d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg create mode 100644 d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map create mode 100644 d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 create mode 100644 d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg create mode 100644 d1/dc5/classlarge__number__coll__graph.map create mode 100644 d1/dc5/classlarge__number__coll__graph.md5 create mode 100644 d1/dc5/classlarge__number__coll__graph.svg create mode 100644 d1/dda/fast__interger__input_8cpp__incl.map create mode 100644 d1/dda/fast__interger__input_8cpp__incl.md5 create mode 100644 d1/dda/fast__interger__input_8cpp__incl.svg create mode 100644 d1/df2/structnode-members.html create mode 100644 d1/df3/hash__search_8cpp.html create mode 100644 d1/df3/hash__search_8cpp.js create mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map create mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 create mode 100644 d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg create mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map create mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5 create mode 100644 d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg create mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d1/df9/qr__decomposition_8cpp__incl.map create mode 100644 d1/df9/qr__decomposition_8cpp__incl.md5 create mode 100644 d1/df9/qr__decomposition_8cpp__incl.svg create mode 100644 d2/d05/class_min_heap.html create mode 100644 d2/d05/class_min_heap.js create mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map create mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5 create mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg create mode 100644 d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg create mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map create mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 create mode 100644 d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg create mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map create mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5 create mode 100644 d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg create mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map create mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5 create mode 100644 d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg create mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map create mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 create mode 100644 d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg create mode 100644 d2/d07/class_bit__coll__graph.map create mode 100644 d2/d07/class_bit__coll__graph.md5 create mode 100644 d2/d07/class_bit__coll__graph.svg create mode 100644 d2/d0b/fast__power_8cpp.html create mode 100644 d2/d0b/fast__power_8cpp.js create mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d2/d22/jump__search_8cpp.html create mode 100644 d2/d22/jump__search_8cpp.js create mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map create mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5 create mode 100644 d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg create mode 100644 d2/d26/addition__rule_8cpp__incl.map create mode 100644 d2/d26/addition__rule_8cpp__incl.md5 create mode 100644 d2/d26/addition__rule_8cpp__incl.svg create mode 100644 d2/d2c/structtower.html create mode 100644 d2/d2c/structtower.js create mode 100644 d2/d36/structqueue.html create mode 100644 d2/d36/structqueue.js create mode 100644 d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.map create mode 100644 d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.md5 create mode 100644 d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg create mode 100644 d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.map create mode 100644 d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.md5 create mode 100644 d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm.html create mode 100644 d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg create mode 100644 d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg create mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map create mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5 create mode 100644 d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg create mode 100644 d2/d66/binary__search_8cpp__incl.map create mode 100644 d2/d66/binary__search_8cpp__incl.md5 create mode 100644 d2/d66/binary__search_8cpp__incl.svg create mode 100644 d2/d89/median__search_8cpp__incl.map create mode 100644 d2/d89/median__search_8cpp__incl.md5 create mode 100644 d2/d89/median__search_8cpp__incl.svg create mode 100644 d2/dc4/classstack__linked_list.html create mode 100644 d2/dc4/classstack__linked_list.js create mode 100644 d2/dcf/namespacestatistics.html create mode 100644 d2/dcf/namespacestatistics.js create mode 100644 d2/ddd/gaussian__elimination_8cpp__incl.map create mode 100644 d2/ddd/gaussian__elimination_8cpp__incl.md5 create mode 100644 d2/ddd/gaussian__elimination_8cpp__incl.svg create mode 100644 d2/def/prime__factorization_8cpp__incl.map create mode 100644 d2/def/prime__factorization_8cpp__incl.md5 create mode 100644 d2/def/prime__factorization_8cpp__incl.svg create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp.html create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp.js create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 create mode 100644 d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg create mode 100644 d3/d19/sparse__matrix_8cpp.html create mode 100644 d3/d19/sparse__matrix_8cpp.js create mode 100644 d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.map create mode 100644 d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.md5 create mode 100644 d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg create mode 100644 d3/d24/qr__decomposition_8cpp.html create mode 100644 d3/d24/qr__decomposition_8cpp.js create mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map create mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 create mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg create mode 100644 d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg create mode 100644 d3/d26/binary__search__tree_8cpp.html create mode 100644 d3/d26/binary__search__tree_8cpp.js create mode 100644 d3/d30/hash__search_8cpp__incl.map create mode 100644 d3/d30/hash__search_8cpp__incl.md5 create mode 100644 d3/d30/hash__search_8cpp__incl.svg create mode 100644 d3/d39/check__prime_8cpp__incl.map create mode 100644 d3/d39/check__prime_8cpp__incl.md5 create mode 100644 d3/d39/check__prime_8cpp__incl.svg create mode 100644 d3/d56/binomial__dist_8cpp__incl.map create mode 100644 d3/d56/binomial__dist_8cpp__incl.md5 create mode 100644 d3/d56/binomial__dist_8cpp__incl.svg create mode 100644 d3/d61/vector__important__functions_8cpp.html create mode 100644 d3/d61/vector__important__functions_8cpp.js create mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d3/d66/structlinkedlist__coll__graph.map create mode 100644 d3/d66/structlinkedlist__coll__graph.md5 create mode 100644 d3/d66/structlinkedlist__coll__graph.svg create mode 100644 d3/d7d/brute__force__string__searching_8cpp.html create mode 100644 d3/d7d/brute__force__string__searching_8cpp.js create mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d3/da3/classstatistics_1_1stats__computer2-members.html create mode 100644 d3/dbb/class_cycle_check.html create mode 100644 d3/dbb/class_cycle_check.js create mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map create mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 create mode 100644 d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg create mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map create mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5 create mode 100644 d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg create mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map create mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5 create mode 100644 d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp.html create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp.js create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5 create mode 100644 d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg create mode 100644 d4/d0c/binary__search__tree_8cpp__incl.map create mode 100644 d4/d0c/binary__search__tree_8cpp__incl.md5 create mode 100644 d4/d0c/binary__search__tree_8cpp__incl.svg create mode 100644 d4/d0e/class_bit-members.html create mode 100644 d4/d1f/class_min_heap-members.html create mode 100644 d4/d21/least__common__multiple_8cpp.html create mode 100644 d4/d21/least__common__multiple_8cpp.js create mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map create mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 create mode 100644 d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg create mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map create mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5 create mode 100644 d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg create mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/d26/durand__kerner__roots_8cpp__incl.map create mode 100644 d4/d26/durand__kerner__roots_8cpp__incl.md5 create mode 100644 d4/d26/durand__kerner__roots_8cpp__incl.svg create mode 100644 d4/d26/durand__kerner__roots_8cpp__incl_org.svg create mode 100644 d4/d2c/struct_trie_1_1_trie_node__coll__graph.map create mode 100644 d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 create mode 100644 d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg create mode 100644 d4/d32/fibonacci__fast_8cpp.html create mode 100644 d4/d32/fibonacci__fast_8cpp.js create mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp.html create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp.js create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/d59/large__factorial_8cpp__incl.map create mode 100644 d4/d59/large__factorial_8cpp__incl.md5 create mode 100644 d4/d59/large__factorial_8cpp__incl.svg create mode 100644 d4/d60/kohonen__som__trace_8cpp__incl.map create mode 100644 d4/d60/kohonen__som__trace_8cpp__incl.md5 create mode 100644 d4/d60/kohonen__som__trace_8cpp__incl.svg create mode 100644 d4/d60/kohonen__som__trace_8cpp__incl_org.svg create mode 100644 d4/d68/qr__decompose_8h.html create mode 100644 d4/d68/qr__decompose_8h.js create mode 100644 d4/d68/qr__decompose_8h_source.html create mode 100644 d4/d6d/struct_entry-members.html create mode 100644 d4/d72/qr__eigen__values_8cpp__incl.map create mode 100644 d4/d72/qr__eigen__values_8cpp__incl.md5 create mode 100644 d4/d72/qr__eigen__values_8cpp__incl.svg create mode 100644 d4/d7a/shell__sort2_8cpp.html create mode 100644 d4/d7a/shell__sort2_8cpp.js create mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg create mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg create mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg create mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map create mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5 create mode 100644 d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg create mode 100644 d4/d86/large__number_8h.html create mode 100644 d4/d86/large__number_8h_source.html create mode 100644 d4/d9c/primes__up__to__billion_8cpp.html create mode 100644 d4/d9c/primes__up__to__billion_8cpp.js create mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp.html create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp.js create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/da4/class_queue.html create mode 100644 d4/da4/class_queue.js create mode 100644 d4/da4/number__of__positive__divisors_8cpp__incl.map create mode 100644 d4/da4/number__of__positive__divisors_8cpp__incl.md5 create mode 100644 d4/da4/number__of__positive__divisors_8cpp__incl.svg create mode 100644 d4/db4/bayes__theorem_8cpp__incl.map create mode 100644 d4/db4/bayes__theorem_8cpp__incl.md5 create mode 100644 d4/db4/bayes__theorem_8cpp__incl.svg create mode 100644 d4/db4/struct_segment_intersection.html create mode 100644 d4/db4/struct_segment_intersection.js create mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map create mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5 create mode 100644 d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg create mode 100644 d4/db6/struct_min_heap_node-members.html create mode 100644 d4/dbd/structlca__coll__graph.map create mode 100644 d4/dbd/structlca__coll__graph.md5 create mode 100644 d4/dbd/structlca__coll__graph.svg create mode 100644 d4/dc7/extended__euclid__algorithm_8cpp__incl.map create mode 100644 d4/dc7/extended__euclid__algorithm_8cpp__incl.md5 create mode 100644 d4/dc7/extended__euclid__algorithm_8cpp__incl.svg create mode 100644 d4/dcb/classstack__coll__graph.map create mode 100644 d4/dcb/classstack__coll__graph.md5 create mode 100644 d4/dcb/classstack__coll__graph.svg create mode 100644 d4/dd9/structtrie.html create mode 100644 d4/dd9/structtrie.js create mode 100644 d4/de8/fast__interger__input_8cpp.html create mode 100644 d4/de8/fast__interger__input_8cpp.js create mode 100644 d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d4/deb/gcd__iterative__euclidean_8cpp__incl.map create mode 100644 d4/deb/gcd__iterative__euclidean_8cpp__incl.md5 create mode 100644 d4/deb/gcd__iterative__euclidean_8cpp__incl.svg create mode 100644 d4/def/kohonen__som__topology_8cpp.html create mode 100644 d4/def/kohonen__som__topology_8cpp.js create mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg create mode 100644 d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.map create mode 100644 d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.md5 create mode 100644 d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg create mode 100644 d4/df8/prime__numbers_8cpp__incl.map create mode 100644 d4/df8/prime__numbers_8cpp__incl.md5 create mode 100644 d4/df8/prime__numbers_8cpp__incl.svg create mode 100644 d5/d15/classcll.html create mode 100644 d5/d15/classcll.js create mode 100644 d5/d29/struct_min_heap_node.html create mode 100644 d5/d29/struct_min_heap_node.js create mode 100644 d5/d67/bayes__theorem_8cpp.html create mode 100644 d5/d67/bayes__theorem_8cpp.js create mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d5/d88/md__d_i_r_e_c_t_o_r_y.html create mode 100644 d5/d8b/least__common__multiple_8cpp__incl.map create mode 100644 d5/d8b/least__common__multiple_8cpp__incl.md5 create mode 100644 d5/d8b/least__common__multiple_8cpp__incl.svg create mode 100644 d5/d91/namespacesorting.html create mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map create mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 create mode 100644 d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg create mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map create mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 create mode 100644 d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg create mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map create mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 create mode 100644 d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg create mode 100644 d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.map create mode 100644 d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.md5 create mode 100644 d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.svg create mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map create mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 create mode 100644 d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg create mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map create mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 create mode 100644 d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg create mode 100644 d5/da1/structnode.html create mode 100644 d5/da1/structnode.js create mode 100644 d5/db0/adaline__learning_8cpp.html create mode 100644 d5/db0/adaline__learning_8cpp.js create mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map create mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5 create mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg create mode 100644 d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg create mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map create mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 create mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg create mode 100644 d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg create mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map create mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 create mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg create mode 100644 d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg create mode 100644 d5/dc2/structlca-members.html create mode 100644 d5/dca/vector__important__functions_8cpp__incl.map create mode 100644 d5/dca/vector__important__functions_8cpp__incl.md5 create mode 100644 d5/dca/vector__important__functions_8cpp__incl.svg create mode 100644 d5/dcd/kohonen__som__topology_8cpp__incl.map create mode 100644 d5/dcd/kohonen__som__topology_8cpp__incl.md5 create mode 100644 d5/dcd/kohonen__som__topology_8cpp__incl.svg create mode 100644 d5/dcd/kohonen__som__topology_8cpp__incl_org.svg create mode 100644 d5/ddf/struct_btree-members.html create mode 100644 d5/de2/structtower-members.html create mode 100644 d5/def/stairs__pattern_8cpp.html create mode 100644 d5/def/stairs__pattern_8cpp.js create mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d6/d1d/bubble__sort_8cpp__incl.map create mode 100644 d6/d1d/bubble__sort_8cpp__incl.md5 create mode 100644 d6/d1d/bubble__sort_8cpp__incl.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline.html create mode 100644 d6/d30/classmachine__learning_1_1adaline.js create mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map create mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5 create mode 100644 d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map create mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5 create mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map create mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 create mode 100644 d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg create mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map create mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 create mode 100644 d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg create mode 100644 d6/d38/newton__raphson__method_8cpp__incl.map create mode 100644 d6/d38/newton__raphson__method_8cpp__incl.md5 create mode 100644 d6/d38/newton__raphson__method_8cpp__incl.svg create mode 100644 d6/d48/structtrie-members.html create mode 100644 d6/d4a/addition__rule_8cpp.html create mode 100644 d6/d4a/addition__rule_8cpp.js create mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d6/d4c/gcd__recursive__euclidean_8cpp__incl.map create mode 100644 d6/d4c/gcd__recursive__euclidean_8cpp__incl.md5 create mode 100644 d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg create mode 100644 d6/d60/group__ode.html create mode 100644 d6/d60/group__ode.js create mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map create mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5 create mode 100644 d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg create mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map create mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5 create mode 100644 d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg create mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map create mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5 create mode 100644 d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg create mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map create mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5 create mode 100644 d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg create mode 100644 d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.map create mode 100644 d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5 create mode 100644 d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg create mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map create mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 create mode 100644 d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg create mode 100644 d6/d93/large__number_8h__dep__incl.map create mode 100644 d6/d93/large__number_8h__dep__incl.md5 create mode 100644 d6/d93/large__number_8h__dep__incl.svg create mode 100644 d6/d9d/large__factorial_8cpp.html create mode 100644 d6/d9d/large__factorial_8cpp.js create mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg create mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map create mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5 create mode 100644 d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg create mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map create mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 create mode 100644 d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg create mode 100644 d6/db0/binomial__dist_8cpp.html create mode 100644 d6/db0/binomial__dist_8cpp.js create mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map create mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 create mode 100644 d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg create mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map create mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5 create mode 100644 d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg create mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map create mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5 create mode 100644 d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg create mode 100644 d6/db4/ode__semi__implicit__euler_8cpp__incl.map create mode 100644 d6/db4/ode__semi__implicit__euler_8cpp__incl.md5 create mode 100644 d6/db4/ode__semi__implicit__euler_8cpp__incl.svg create mode 100644 d6/dbc/sparse__matrix_8cpp__incl.map create mode 100644 d6/dbc/sparse__matrix_8cpp__incl.md5 create mode 100644 d6/dbc/sparse__matrix_8cpp__incl.svg create mode 100644 d6/dbd/jump__search_8cpp__incl.map create mode 100644 d6/dbd/jump__search_8cpp__incl.md5 create mode 100644 d6/dbd/jump__search_8cpp__incl.svg create mode 100644 d6/dc0/interpolation__search2_8cpp__incl.map create mode 100644 d6/dc0/interpolation__search2_8cpp__incl.md5 create mode 100644 d6/dc0/interpolation__search2_8cpp__incl.svg create mode 100644 d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html create mode 100644 d6/dce/rabin__karp_8cpp.html create mode 100644 d6/dce/rabin__karp_8cpp.js create mode 100644 d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map create mode 100644 d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 create mode 100644 d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg create mode 100644 d6/dd3/ode__midpoint__euler_8cpp.html create mode 100644 d6/dd3/ode__midpoint__euler_8cpp.js create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 create mode 100644 d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg create mode 100644 d7/d1f/realtime__stats_8cpp__incl.map create mode 100644 d7/d1f/realtime__stats_8cpp__incl.md5 create mode 100644 d7/d1f/realtime__stats_8cpp__incl.svg create mode 100644 d7/d21/classstack__linked_list-members.html create mode 100644 d7/d2e/avltree_8cpp__incl.map create mode 100644 d7/d2e/avltree_8cpp__incl.md5 create mode 100644 d7/d2e/avltree_8cpp__incl.svg create mode 100644 d7/d35/matrix__exponentiation_8cpp.html create mode 100644 d7/d35/matrix__exponentiation_8cpp.js create mode 100644 d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.map create mode 100644 d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.md5 create mode 100644 d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.svg create mode 100644 d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.map create mode 100644 d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.md5 create mode 100644 d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg create mode 100644 d7/d40/class_solution__coll__graph.map create mode 100644 d7/d40/class_solution__coll__graph.md5 create mode 100644 d7/d40/class_solution__coll__graph.svg create mode 100644 d7/d41/struct_min_heap_node__coll__graph.map create mode 100644 d7/d41/struct_min_heap_node__coll__graph.md5 create mode 100644 d7/d41/struct_min_heap_node__coll__graph.svg create mode 100644 d7/d4c/spiral__print_8cpp__incl.map create mode 100644 d7/d4c/spiral__print_8cpp__incl.md5 create mode 100644 d7/d4c/spiral__print_8cpp__incl.svg create mode 100644 d7/d6a/bisection__method_8cpp.html create mode 100644 d7/d6a/bisection__method_8cpp.js create mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map create mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 create mode 100644 d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg create mode 100644 d7/d77/class_edge.html create mode 100644 d7/d77/class_edge.js create mode 100644 d7/d7c/classstatistics_1_1stats__computer1.html create mode 100644 d7/d7c/classstatistics_1_1stats__computer1.js create mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map create mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 create mode 100644 d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg create mode 100644 d7/d7f/section.html create mode 100644 d7/d89/double__factorial_8cpp.html create mode 100644 d7/d89/double__factorial_8cpp.js create mode 100644 d7/d8e/power__for__huge__numbers_8cpp__incl.map create mode 100644 d7/d8e/power__for__huge__numbers_8cpp__incl.md5 create mode 100644 d7/d8e/power__for__huge__numbers_8cpp__incl.svg create mode 100644 d7/da7/adaline__learning_8cpp__incl.map create mode 100644 d7/da7/adaline__learning_8cpp__incl.md5 create mode 100644 d7/da7/adaline__learning_8cpp__incl.svg create mode 100644 d7/da7/adaline__learning_8cpp__incl_org.svg create mode 100644 d7/dae/decimal__to__binary_8cpp__incl.map create mode 100644 d7/dae/decimal__to__binary_8cpp__incl.md5 create mode 100644 d7/dae/decimal__to__binary_8cpp__incl.svg create mode 100644 d7/dba/cll_8h_source.html create mode 100644 d7/de0/stack_8h_source.html create mode 100644 d8/d01/struct_item-members.html create mode 100644 d8/d10/structlist.html create mode 100644 d8/d10/structlist.js create mode 100644 d8/d13/bubble__sort_8cpp.html create mode 100644 d8/d13/bubble__sort_8cpp.js create mode 100644 d8/d38/queue_8h_source.html create mode 100644 d8/d38/structquery-members.html create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp.html create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp.js create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d8/d55/class_cycle_check-members.html create mode 100644 d8/d61/class_trie__coll__graph.map create mode 100644 d8/d61/class_trie__coll__graph.md5 create mode 100644 d8/d61/class_trie__coll__graph.svg create mode 100644 d8/d6c/line__segment__intersection_8cpp.html create mode 100644 d8/d6c/line__segment__intersection_8cpp.js create mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning.html create mode 100644 d8/d77/namespacemachine__learning.js create mode 100644 d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph_org.svg create mode 100644 d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.map create mode 100644 d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.md5 create mode 100644 d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.svg create mode 100644 d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph_org.svg create mode 100644 d8/d8a/exponential__search_8cpp.html create mode 100644 d8/d8a/exponential__search_8cpp.js create mode 100644 d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.map create mode 100644 d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.md5 create mode 100644 d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.svg create mode 100644 d8/d8e/struct_node-members.html create mode 100644 d8/d9b/classgraph-members.html create mode 100644 d8/dab/classstatistics_1_1stats__computer2.html create mode 100644 d8/dab/classstatistics_1_1stats__computer2.js create mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map create mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5 create mode 100644 d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg create mode 100644 d8/db9/structcompare-members.html create mode 100644 d8/dc8/struct_point.html create mode 100644 d8/dc8/struct_point.js create mode 100644 d8/dcc/namespacestd.html create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp.html create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp.js create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.map create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5 create mode 100644 d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg create mode 100644 d8/dee/avltree_8cpp.html create mode 100644 d8/dee/avltree_8cpp.js create mode 100644 d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.map create mode 100644 d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.svg create mode 100644 d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.map create mode 100644 d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.svg create mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map create mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg create mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map create mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg create mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d00/factorial_8cpp.html create mode 100644 d9/d00/factorial_8cpp.js create mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d02/linear__search_8cpp.html create mode 100644 d9/d02/linear__search_8cpp.js create mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d03/namespacestring__search.html create mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map create mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 create mode 100644 d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg create mode 100644 d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map create mode 100644 d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5 create mode 100644 d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg create mode 100644 d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.map create mode 100644 d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.md5 create mode 100644 d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.svg create mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map create mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5 create mode 100644 d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg create mode 100644 d9/d1d/structqueue-members.html create mode 100644 d9/d21/classmachine__learning_1_1adaline-members.html create mode 100644 d9/d24/poisson__dist_8cpp.html create mode 100644 d9/d24/poisson__dist_8cpp.js create mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map create mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 create mode 100644 d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg create mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map create mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 create mode 100644 d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg create mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d28/class_queue__coll__graph.map create mode 100644 d9/d28/class_queue__coll__graph.md5 create mode 100644 d9/d28/class_queue__coll__graph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp.html create mode 100644 d9/d49/kohonen__som__trace_8cpp.js create mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.svg create mode 100644 d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.map create mode 100644 d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.md5 create mode 100644 d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.svg create mode 100644 d9/d57/structtrie__coll__graph.map create mode 100644 d9/d57/structtrie__coll__graph.md5 create mode 100644 d9/d57/structtrie__coll__graph.svg create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp.html create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp.js create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 create mode 100644 d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg create mode 100644 d9/d66/group__machine__learning.html create mode 100644 d9/d66/group__machine__learning.js create mode 100644 d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.map create mode 100644 d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.md5 create mode 100644 d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.svg create mode 100644 d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.map create mode 100644 d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.md5 create mode 100644 d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.svg create mode 100644 d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.map create mode 100644 d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5 create mode 100644 d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg create mode 100644 d9/d69/median__search_8cpp.html create mode 100644 d9/d69/median__search_8cpp.js create mode 100644 d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.map create mode 100644 d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5 create mode 100644 d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg create mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/d78/factorial_8cpp__incl.map create mode 100644 d9/d78/factorial_8cpp__incl.md5 create mode 100644 d9/d78/factorial_8cpp__incl.svg create mode 100644 d9/d7d/primality__test_8cpp__incl.map create mode 100644 d9/d7d/primality__test_8cpp__incl.md5 create mode 100644 d9/d7d/primality__test_8cpp__incl.svg create mode 100644 d9/d89/fibonacci_8cpp.html create mode 100644 d9/d89/fibonacci_8cpp.js create mode 100644 d9/d90/struct_btree.html create mode 100644 d9/d90/struct_btree.js create mode 100644 d9/dbf/brute__force__string__searching_8cpp__incl.map create mode 100644 d9/dbf/brute__force__string__searching_8cpp__incl.md5 create mode 100644 d9/dbf/brute__force__string__searching_8cpp__incl.svg create mode 100644 d9/dd7/interpolation__search_8cpp.html create mode 100644 d9/dd7/interpolation__search_8cpp.js create mode 100644 d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 d9/dd9/bisection__method_8cpp__incl.map create mode 100644 d9/dd9/bisection__method_8cpp__incl.md5 create mode 100644 d9/dd9/bisection__method_8cpp__incl.svg create mode 100644 d9/ddb/tower__of__hanoi_8cpp__incl.map create mode 100644 d9/ddb/tower__of__hanoi_8cpp__incl.md5 create mode 100644 d9/ddb/tower__of__hanoi_8cpp__incl.svg create mode 100644 d9/dee/classdouble__linked__list.html create mode 100644 d9/dee/classdouble__linked__list.js create mode 100644 d9/dfd/primes__up__to__billion_8cpp__incl.map create mode 100644 d9/dfd/primes__up__to__billion_8cpp__incl.md5 create mode 100644 d9/dfd/primes__up__to__billion_8cpp__incl.svg create mode 100644 da/d23/eulers__totient__function_8cpp.html create mode 100644 da/d23/eulers__totient__function_8cpp.js create mode 100644 da/d24/sqrt__double_8cpp.html create mode 100644 da/d24/sqrt__double_8cpp.js create mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 da/d35/sieve__of__eratosthenes_8cpp__incl.map create mode 100644 da/d35/sieve__of__eratosthenes_8cpp__incl.md5 create mode 100644 da/d35/sieve__of__eratosthenes_8cpp__incl.svg create mode 100644 da/d5d/non__recursive__merge__sort_8cpp__incl.map create mode 100644 da/d5d/non__recursive__merge__sort_8cpp__incl.md5 create mode 100644 da/d5d/non__recursive__merge__sort_8cpp__incl.svg create mode 100644 da/d7b/primality__test_8cpp.html create mode 100644 da/d7b/primality__test_8cpp.js create mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 da/d8a/paranthesis__matching_8cpp__incl.map create mode 100644 da/d8a/paranthesis__matching_8cpp__incl.md5 create mode 100644 da/d8a/paranthesis__matching_8cpp__incl.svg create mode 100644 da/d9a/class_graph.html create mode 100644 da/d9a/class_graph.js create mode 100644 da/d9a/palindrome__of__number_8cpp.html create mode 100644 da/d9a/palindrome__of__number_8cpp.js create mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 da/dd3/classmachine__learning_1_1adaline__coll__graph.map create mode 100644 da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 create mode 100644 da/dd3/classmachine__learning_1_1adaline__coll__graph.svg create mode 100644 da/dd9/happy__number_8cpp__incl.map create mode 100644 da/dd9/happy__number_8cpp__incl.md5 create mode 100644 da/dd9/happy__number_8cpp__incl.svg create mode 100644 da/de7/decimal__to__hexadecimal_8cpp.html create mode 100644 da/de7/decimal__to__hexadecimal_8cpp.js create mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map create mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 create mode 100644 da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg create mode 100644 da/df2/durand__kerner__roots_8cpp.html create mode 100644 da/df2/durand__kerner__roots_8cpp.js create mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.map create mode 100644 da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.md5 create mode 100644 da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.svg create mode 100644 da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.map create mode 100644 da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5 create mode 100644 da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg create mode 100644 da/dfd/buzz__number_8cpp__incl.map create mode 100644 da/dfd/buzz__number_8cpp__incl.md5 create mode 100644 da/dfd/buzz__number_8cpp__incl.svg create mode 100644 db/d07/spiral__print_8cpp.html create mode 100644 db/d07/spiral__print_8cpp.js create mode 100644 db/d0d/prime__factorization_8cpp.html create mode 100644 db/d0d/prime__factorization_8cpp.js create mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map create mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5 create mode 100644 db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg create mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map create mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5 create mode 100644 db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg create mode 100644 db/d30/fast__power_8cpp__incl.map create mode 100644 db/d30/fast__power_8cpp__incl.md5 create mode 100644 db/d30/fast__power_8cpp__incl.svg create mode 100644 db/d3c/tower__of__hanoi_8cpp.html create mode 100644 db/d3c/tower__of__hanoi_8cpp.js create mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map create mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5 create mode 100644 db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg create mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 db/d51/fibonacci__fast_8cpp__incl.map create mode 100644 db/d51/fibonacci__fast_8cpp__incl.md5 create mode 100644 db/d51/fibonacci__fast_8cpp__incl.svg create mode 100644 db/d66/struct_item.html create mode 100644 db/d66/struct_item.js create mode 100644 db/d82/classlarge__number.html create mode 100644 db/d82/classlarge__number.js create mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map create mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5 create mode 100644 db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg create mode 100644 db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.map create mode 100644 db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.md5 create mode 100644 db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.svg create mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map create mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 create mode 100644 db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg create mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map create mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5 create mode 100644 db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg create mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map create mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 create mode 100644 db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg create mode 100644 db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map create mode 100644 db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5 create mode 100644 db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg create mode 100644 db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg create mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map create mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 create mode 100644 db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg create mode 100644 db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.map create mode 100644 db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.md5 create mode 100644 db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.svg create mode 100644 db/d8b/struct_node.html create mode 100644 db/d8b/struct_node.js create mode 100644 db/d8f/struct_btree__coll__graph.map create mode 100644 db/d8f/struct_btree__coll__graph.md5 create mode 100644 db/d8f/struct_btree__coll__graph.svg create mode 100644 db/d93/check__prime_8cpp.html create mode 100644 db/d93/check__prime_8cpp.js create mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 db/dd3/ode__forward__euler_8cpp.html create mode 100644 db/dd3/ode__forward__euler_8cpp.js create mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map create mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 create mode 100644 db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg create mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map create mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 create mode 100644 db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg create mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map create mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 create mode 100644 db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg create mode 100644 db/dd4/structlist__coll__graph.map create mode 100644 db/dd4/structlist__coll__graph.md5 create mode 100644 db/dd4/structlist__coll__graph.svg create mode 100644 db/df3/happy__number_8cpp.html create mode 100644 db/df3/happy__number_8cpp.js create mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/d1a/pascal__triangle_8cpp.html create mode 100644 dc/d1a/pascal__triangle_8cpp.js create mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map create mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 create mode 100644 dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg create mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/d37/lu__decompose_8cpp__incl.map create mode 100644 dc/d37/lu__decompose_8cpp__incl.md5 create mode 100644 dc/d37/lu__decompose_8cpp__incl.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp.html create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp.js create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.map create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.md5 create mode 100644 dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg create mode 100644 dc/d43/decimal__to__roman__numeral_8cpp__incl.map create mode 100644 dc/d43/decimal__to__roman__numeral_8cpp__incl.md5 create mode 100644 dc/d43/decimal__to__roman__numeral_8cpp__incl.svg create mode 100644 dc/d5f/qr__decompose_8h__dep__incl.map create mode 100644 dc/d5f/qr__decompose_8h__dep__incl.md5 create mode 100644 dc/d5f/qr__decompose_8h__dep__incl.svg create mode 100644 dc/d93/trie__modern_8cpp.html create mode 100644 dc/d93/trie__modern_8cpp.js create mode 100644 dc/db5/text__search_8cpp.html create mode 100644 dc/db5/text__search_8cpp.js create mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/dc5/ode__forward__euler_8cpp__incl.map create mode 100644 dc/dc5/ode__forward__euler_8cpp__incl.md5 create mode 100644 dc/dc5/ode__forward__euler_8cpp__incl.svg create mode 100644 dc/dc5/paranthesis__matching_8cpp.html create mode 100644 dc/dc5/paranthesis__matching_8cpp.js create mode 100644 dc/de0/fibonacci__large_8cpp__incl.map create mode 100644 dc/de0/fibonacci__large_8cpp__incl.md5 create mode 100644 dc/de0/fibonacci__large_8cpp__incl.svg create mode 100644 dc/de2/false__position_8cpp__incl.map create mode 100644 dc/de2/false__position_8cpp__incl.md5 create mode 100644 dc/de2/false__position_8cpp__incl.svg create mode 100644 dc/dfe/ternary__search_8cpp.html create mode 100644 dc/dfe/ternary__search_8cpp.js create mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map create mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 create mode 100644 dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg create mode 100644 dd/d00/class_queue-members.html create mode 100644 dd/d0e/double__factorial_8cpp__incl.map create mode 100644 dd/d0e/double__factorial_8cpp__incl.md5 create mode 100644 dd/d0e/double__factorial_8cpp__incl.svg create mode 100644 dd/d0f/text__search_8cpp__incl.map create mode 100644 dd/d0f/text__search_8cpp__incl.md5 create mode 100644 dd/d0f/text__search_8cpp__incl.svg create mode 100644 dd/d1b/structquery.html create mode 100644 dd/d1b/structquery.js create mode 100644 dd/d29/false__position_8cpp.html create mode 100644 dd/d29/false__position_8cpp.js create mode 100644 dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map create mode 100644 dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 create mode 100644 dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg create mode 100644 dd/d2f/class_trie.html create mode 100644 dd/d2f/class_trie.js create mode 100644 dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.map create mode 100644 dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.md5 create mode 100644 dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg create mode 100644 dd/d30/matrix__exponentiation_8cpp__incl.map create mode 100644 dd/d30/matrix__exponentiation_8cpp__incl.md5 create mode 100644 dd/d30/matrix__exponentiation_8cpp__incl.svg create mode 100644 dd/d3b/struct_entry.html create mode 100644 dd/d3b/struct_entry.js create mode 100644 dd/d4f/class_solution.html create mode 100644 dd/d4f/class_solution.js create mode 100644 dd/d51/classstack-members.html create mode 100644 dd/d65/lu__decompose_8cpp.html create mode 100644 dd/d65/lu__decompose_8cpp.js create mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map create mode 100644 dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 create mode 100644 dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg create mode 100644 dd/d75/structqueue__coll__graph.map create mode 100644 dd/d75/structqueue__coll__graph.md5 create mode 100644 dd/d75/structqueue__coll__graph.svg create mode 100644 dd/d7a/classdouble__linked__list-members.html create mode 100644 dd/d7f/classstack__linked_list__coll__graph.map create mode 100644 dd/d7f/classstack__linked_list__coll__graph.md5 create mode 100644 dd/d7f/classstack__linked_list__coll__graph.svg create mode 100644 dd/d82/large__number_8h__incl.map create mode 100644 dd/d82/large__number_8h__incl.md5 create mode 100644 dd/d82/large__number_8h__incl.svg create mode 100644 dd/d86/shell__sort2_8cpp__incl.map create mode 100644 dd/d86/shell__sort2_8cpp__incl.md5 create mode 100644 dd/d86/shell__sort2_8cpp__incl.svg create mode 100644 dd/d9b/classgraph.html create mode 100644 dd/d9b/classgraph.js create mode 100644 dd/da0/todo.html create mode 100644 dd/da8/struct_segment_intersection-members.html create mode 100644 dd/df3/line__segment__intersection_8cpp__incl.map create mode 100644 dd/df3/line__segment__intersection_8cpp__incl.md5 create mode 100644 dd/df3/line__segment__intersection_8cpp__incl.svg create mode 100644 dd/df4/structlca.html create mode 100644 dd/df4/structlca.js create mode 100644 dd/df5/poisson__dist_8cpp__incl.map create mode 100644 dd/df5/poisson__dist_8cpp__incl.md5 create mode 100644 dd/df5/poisson__dist_8cpp__incl.svg create mode 100644 de/d36/binary__exponent_8cpp__incl.map create mode 100644 de/d36/binary__exponent_8cpp__incl.md5 create mode 100644 de/d36/binary__exponent_8cpp__incl.svg create mode 100644 de/d47/string__fibonacci_8cpp.html create mode 100644 de/d47/string__fibonacci_8cpp.js create mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map create mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 create mode 100644 de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg create mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/d48/struct_trie_1_1_trie_node.html create mode 100644 de/d48/struct_trie_1_1_trie_node.js create mode 100644 de/d5b/eulers__totient__function_8cpp__incl.map create mode 100644 de/d5b/eulers__totient__function_8cpp__incl.md5 create mode 100644 de/d5b/eulers__totient__function_8cpp__incl.svg create mode 100644 de/d69/knuth__morris__pratt_8cpp__incl.map create mode 100644 de/d69/knuth__morris__pratt_8cpp__incl.md5 create mode 100644 de/d69/knuth__morris__pratt_8cpp__incl.svg create mode 100644 de/d6a/knuth__morris__pratt_8cpp.html create mode 100644 de/d6a/knuth__morris__pratt_8cpp.js create mode 100644 de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/d6c/palindrome__of__number_8cpp__incl.map create mode 100644 de/d6c/palindrome__of__number_8cpp__incl.md5 create mode 100644 de/d6c/palindrome__of__number_8cpp__incl.svg create mode 100644 de/d75/qr__eigen__values_8cpp.html create mode 100644 de/d75/qr__eigen__values_8cpp.js create mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map create mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 create mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map create mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 create mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.map create mode 100644 de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5 create mode 100644 de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map create mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 create mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg create mode 100644 de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg create mode 100644 de/d7c/struct_trie_1_1_trie_node-members.html create mode 100644 de/d85/decimal__to__roman__numeral_8cpp.html create mode 100644 de/d85/decimal__to__roman__numeral_8cpp.js create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5 create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/d8a/class_trie-members.html create mode 100644 de/d91/class_queue___array-members.html create mode 100644 de/d91/structlist-members.html create mode 100644 de/d9b/prime__numbers_8cpp.html create mode 100644 de/d9b/prime__numbers_8cpp.js create mode 100644 de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.map create mode 100644 de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.md5 create mode 100644 de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg create mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/db2/quick__sort_8cpp__incl.map create mode 100644 de/db2/quick__sort_8cpp__incl.md5 create mode 100644 de/db2/quick__sort_8cpp__incl.svg create mode 100644 de/db5/class_edge-members.html create mode 100644 de/dc3/binaryheap_8cpp.html create mode 100644 de/dc3/binaryheap_8cpp.js create mode 100644 de/dc8/classlarge__number-members.html create mode 100644 de/dcf/binary__exponent_8cpp.html create mode 100644 de/dcf/binary__exponent_8cpp.js create mode 100644 de/dd3/newton__raphson__method_8cpp.html create mode 100644 de/dd3/newton__raphson__method_8cpp.js create mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map create mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 create mode 100644 de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg create mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map create mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5 create mode 100644 de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg create mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 de/de4/fibonacci__large_8cpp.html create mode 100644 de/de4/fibonacci__large_8cpp.js create mode 100644 df/d06/decimal__to__binary_8cpp.html create mode 100644 df/d06/decimal__to__binary_8cpp.js create mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map create mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5 create mode 100644 df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg create mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map create mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5 create mode 100644 df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg create mode 100644 df/d0f/fibonacci_8cpp__incl.map create mode 100644 df/d0f/fibonacci_8cpp__incl.md5 create mode 100644 df/d0f/fibonacci_8cpp__incl.svg create mode 100644 df/d27/class_bit.html create mode 100644 df/d27/class_bit.js create mode 100644 df/d39/interpolation__search2_8cpp.html create mode 100644 df/d39/interpolation__search2_8cpp.js create mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 df/d3c/exponential__search_8cpp__incl.map create mode 100644 df/d3c/exponential__search_8cpp__incl.md5 create mode 100644 df/d3c/exponential__search_8cpp__incl.svg create mode 100644 df/d86/rabin__karp_8cpp__incl.map create mode 100644 df/d86/rabin__karp_8cpp__incl.md5 create mode 100644 df/d86/rabin__karp_8cpp__incl.svg create mode 100644 df/dc8/successive__approximation_8cpp.html create mode 100644 df/dc8/successive__approximation_8cpp.js create mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 df/dd4/stairs__pattern_8cpp__incl.map create mode 100644 df/dd4/stairs__pattern_8cpp__incl.md5 create mode 100644 df/dd4/stairs__pattern_8cpp__incl.svg create mode 100644 df/dd5/binary__search_8cpp.html create mode 100644 df/dd5/binary__search_8cpp.js create mode 100644 df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map create mode 100644 df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 create mode 100644 df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg create mode 100644 df/dd7/structlinkedlist-members.html create mode 100644 df/ddc/struct_node__coll__graph.map create mode 100644 df/ddc/struct_node__coll__graph.md5 create mode 100644 df/ddc/struct_node__coll__graph.svg create mode 100644 df/def/power__for__huge__numbers_8cpp.html create mode 100644 df/def/power__for__huge__numbers_8cpp.js create mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map create mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5 create mode 100644 df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg create mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map create mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 create mode 100644 df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg create mode 100644 dir_074119ce3a874b57120c49a0cc4bb5ad.html create mode 100644 dir_0eaa691bd54ab0922ca7f50599de6d22.html create mode 100644 dir_12552d7fa429bf94a2e32e5cf39f7e69.html create mode 100644 dir_19b2bf9199a15c634a08b1ede1dd896a.html create mode 100644 dir_19b2bf9199a15c634a08b1ede1dd896a.js create mode 100644 dir_296d53ceaeaa7e099814a6def439fe8a.html create mode 100644 dir_296d53ceaeaa7e099814a6def439fe8a.js create mode 100644 dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html create mode 100644 dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js create mode 100644 dir_3343723ae086de42ee4ca9774da3a13f.html create mode 100644 dir_3343723ae086de42ee4ca9774da3a13f.js create mode 100644 dir_35422be6552f1b3672c1b6c4aba2da64.html create mode 100644 dir_73a3cc5065b223eb41b02873c0e19f0e.html create mode 100644 dir_73a3cc5065b223eb41b02873c0e19f0e.js create mode 100644 dir_82e494173a87936756866de2fa774307.html create mode 100644 dir_82e494173a87936756866de2fa774307.js create mode 100644 dir_8a20dd5bfd5341a725342bf72b6b686f.html create mode 100644 dir_9510827d0b234b3cc54b29892f217477.html create mode 100644 dir_9510827d0b234b3cc54b29892f217477.js create mode 100644 dir_9c6faab82c22511b50177aa2e38e2780.html create mode 100644 dir_9c6faab82c22511b50177aa2e38e2780.js create mode 100644 dir_bb1b521853a9c46347182a9d10420771.html create mode 100644 dir_bb1b521853a9c46347182a9d10420771.js create mode 100644 dir_c11585dfcef32a26e29098facab6c144.html create mode 100644 dir_e3380d2178455503f266746fb14246a5.html create mode 100644 dir_e3380d2178455503f266746fb14246a5.js create mode 100644 dir_ece9b94c107bbaa1dd68197a8c9983b9.html create mode 100644 dir_f1797d0c2a0a12033e7d74efffeb14e1.html create mode 100644 dir_f1797d0c2a0a12033e7d74efffeb14e1.js create mode 100644 doc.png create mode 100644 doxygen.css create mode 100644 doxygen.png create mode 100644 dynsections.js create mode 100644 files.html create mode 100644 files_dup.js create mode 100644 folderclosed.png create mode 100644 folderopen.png create mode 100644 functions.html create mode 100644 functions_func.html create mode 100644 functions_rela.html create mode 100644 functions_vars.html create mode 100644 globals.html create mode 100644 globals_a.html create mode 100644 globals_b.html create mode 100644 globals_c.html create mode 100644 globals_d.html create mode 100644 globals_defs.html create mode 100644 globals_dup.js create mode 100644 globals_e.html create mode 100644 globals_f.html create mode 100644 globals_func.html create mode 100644 globals_func.js create mode 100644 globals_func_a.html create mode 100644 globals_func_b.html create mode 100644 globals_func_c.html create mode 100644 globals_func_d.html create mode 100644 globals_func_e.html create mode 100644 globals_func_f.html create mode 100644 globals_func_g.html create mode 100644 globals_func_h.html create mode 100644 globals_func_i.html create mode 100644 globals_func_j.html create mode 100644 globals_func_l.html create mode 100644 globals_func_m.html create mode 100644 globals_func_n.html create mode 100644 globals_func_o.html create mode 100644 globals_func_p.html create mode 100644 globals_func_r.html create mode 100644 globals_func_s.html create mode 100644 globals_func_t.html create mode 100644 globals_func_u.html create mode 100644 globals_g.html create mode 100644 globals_h.html create mode 100644 globals_i.html create mode 100644 globals_j.html create mode 100644 globals_k.html create mode 100644 globals_l.html create mode 100644 globals_m.html create mode 100644 globals_n.html create mode 100644 globals_o.html create mode 100644 globals_p.html create mode 100644 globals_r.html create mode 100644 globals_s.html create mode 100644 globals_t.html create mode 100644 globals_type.html create mode 100644 globals_u.html create mode 100644 globals_vars.html create mode 100644 graph_legend.html create mode 100644 graph_legend.md5 create mode 100644 graph_legend.svg create mode 100644 index.html create mode 100644 jquery.js create mode 100644 menu.js create mode 100644 menudata.js create mode 100644 modules.html create mode 100644 modules.js create mode 100644 namespacemembers.html create mode 100644 namespacemembers_func.html create mode 100644 namespaces.html create mode 100644 namespaces_dup.js create mode 100644 nav_f.png create mode 100644 nav_g.png create mode 100644 nav_h.png create mode 100644 navtree.css create mode 100644 navtree.js create mode 100644 navtreedata.js create mode 100644 navtreeindex0.js create mode 100644 navtreeindex1.js create mode 100644 navtreeindex2.js create mode 100644 navtreeindex3.js create mode 100644 open.png create mode 100644 pages.html create mode 100644 resize.js create mode 100644 search/all_0.html create mode 100644 search/all_0.js create mode 100644 search/all_1.html create mode 100644 search/all_1.js create mode 100644 search/all_10.html create mode 100644 search/all_10.js create mode 100644 search/all_11.html create mode 100644 search/all_11.js create mode 100644 search/all_12.html create mode 100644 search/all_12.js create mode 100644 search/all_13.html create mode 100644 search/all_13.js create mode 100644 search/all_14.html create mode 100644 search/all_14.js create mode 100644 search/all_15.html create mode 100644 search/all_15.js create mode 100644 search/all_16.html create mode 100644 search/all_16.js create mode 100644 search/all_17.html create mode 100644 search/all_17.js create mode 100644 search/all_18.html create mode 100644 search/all_18.js create mode 100644 search/all_19.html create mode 100644 search/all_19.js create mode 100644 search/all_1a.html create mode 100644 search/all_1a.js create mode 100644 search/all_1b.html create mode 100644 search/all_1b.js create mode 100644 search/all_2.html create mode 100644 search/all_2.js create mode 100644 search/all_3.html create mode 100644 search/all_3.js create mode 100644 search/all_4.html create mode 100644 search/all_4.js create mode 100644 search/all_5.html create mode 100644 search/all_5.js create mode 100644 search/all_6.html create mode 100644 search/all_6.js create mode 100644 search/all_7.html create mode 100644 search/all_7.js create mode 100644 search/all_8.html create mode 100644 search/all_8.js create mode 100644 search/all_9.html create mode 100644 search/all_9.js create mode 100644 search/all_a.html create mode 100644 search/all_a.js create mode 100644 search/all_b.html create mode 100644 search/all_b.js create mode 100644 search/all_c.html create mode 100644 search/all_c.js create mode 100644 search/all_d.html create mode 100644 search/all_d.js create mode 100644 search/all_e.html create mode 100644 search/all_e.js create mode 100644 search/all_f.html create mode 100644 search/all_f.js create mode 100644 search/classes_0.html create mode 100644 search/classes_0.js create mode 100644 search/classes_1.html create mode 100644 search/classes_1.js create mode 100644 search/classes_10.html create mode 100644 search/classes_10.js create mode 100644 search/classes_11.html create mode 100644 search/classes_11.js create mode 100644 search/classes_12.html create mode 100644 search/classes_12.js create mode 100644 search/classes_13.html create mode 100644 search/classes_13.js create mode 100644 search/classes_14.html create mode 100644 search/classes_14.js create mode 100644 search/classes_15.html create mode 100644 search/classes_15.js create mode 100644 search/classes_16.html create mode 100644 search/classes_16.js create mode 100644 search/classes_17.html create mode 100644 search/classes_17.js create mode 100644 search/classes_18.html create mode 100644 search/classes_18.js create mode 100644 search/classes_2.html create mode 100644 search/classes_2.js create mode 100644 search/classes_3.html create mode 100644 search/classes_3.js create mode 100644 search/classes_4.html create mode 100644 search/classes_4.js create mode 100644 search/classes_5.html create mode 100644 search/classes_5.js create mode 100644 search/classes_6.html create mode 100644 search/classes_6.js create mode 100644 search/classes_7.html create mode 100644 search/classes_7.js create mode 100644 search/classes_8.html create mode 100644 search/classes_8.js create mode 100644 search/classes_9.html create mode 100644 search/classes_9.js create mode 100644 search/classes_a.html create mode 100644 search/classes_a.js create mode 100644 search/classes_b.html create mode 100644 search/classes_b.js create mode 100644 search/classes_c.html create mode 100644 search/classes_c.js create mode 100644 search/classes_d.html create mode 100644 search/classes_d.js create mode 100644 search/classes_e.html create mode 100644 search/classes_e.js create mode 100644 search/classes_f.html create mode 100644 search/classes_f.js create mode 100644 search/close.png create mode 100644 search/defines_0.html create mode 100644 search/defines_0.js create mode 100644 search/defines_1.html create mode 100644 search/defines_1.js create mode 100644 search/defines_2.html create mode 100644 search/defines_2.js create mode 100644 search/defines_3.html create mode 100644 search/defines_3.js create mode 100644 search/defines_4.html create mode 100644 search/defines_4.js create mode 100644 search/defines_5.html create mode 100644 search/defines_5.js create mode 100644 search/defines_6.html create mode 100644 search/defines_6.js create mode 100644 search/files_0.html create mode 100644 search/files_0.js create mode 100644 search/files_1.html create mode 100644 search/files_1.js create mode 100644 search/files_10.html create mode 100644 search/files_10.js create mode 100644 search/files_11.html create mode 100644 search/files_11.js create mode 100644 search/files_12.html create mode 100644 search/files_12.js create mode 100644 search/files_13.html create mode 100644 search/files_13.js create mode 100644 search/files_14.html create mode 100644 search/files_14.js create mode 100644 search/files_2.html create mode 100644 search/files_2.js create mode 100644 search/files_3.html create mode 100644 search/files_3.js create mode 100644 search/files_4.html create mode 100644 search/files_4.js create mode 100644 search/files_5.html create mode 100644 search/files_5.js create mode 100644 search/files_6.html create mode 100644 search/files_6.js create mode 100644 search/files_7.html create mode 100644 search/files_7.js create mode 100644 search/files_8.html create mode 100644 search/files_8.js create mode 100644 search/files_9.html create mode 100644 search/files_9.js create mode 100644 search/files_a.html create mode 100644 search/files_a.js create mode 100644 search/files_b.html create mode 100644 search/files_b.js create mode 100644 search/files_c.html create mode 100644 search/files_c.js create mode 100644 search/files_d.html create mode 100644 search/files_d.js create mode 100644 search/files_e.html create mode 100644 search/files_e.js create mode 100644 search/files_f.html create mode 100644 search/files_f.js create mode 100644 search/functions_0.html create mode 100644 search/functions_0.js create mode 100644 search/functions_1.html create mode 100644 search/functions_1.js create mode 100644 search/functions_10.html create mode 100644 search/functions_10.js create mode 100644 search/functions_11.html create mode 100644 search/functions_11.js create mode 100644 search/functions_12.html create mode 100644 search/functions_12.js create mode 100644 search/functions_13.html create mode 100644 search/functions_13.js create mode 100644 search/functions_14.html create mode 100644 search/functions_14.js create mode 100644 search/functions_15.html create mode 100644 search/functions_15.js create mode 100644 search/functions_16.html create mode 100644 search/functions_16.js create mode 100644 search/functions_17.html create mode 100644 search/functions_17.js create mode 100644 search/functions_18.html create mode 100644 search/functions_18.js create mode 100644 search/functions_19.html create mode 100644 search/functions_19.js create mode 100644 search/functions_1a.html create mode 100644 search/functions_1a.js create mode 100644 search/functions_1b.html create mode 100644 search/functions_1b.js create mode 100644 search/functions_2.html create mode 100644 search/functions_2.js create mode 100644 search/functions_3.html create mode 100644 search/functions_3.js create mode 100644 search/functions_4.html create mode 100644 search/functions_4.js create mode 100644 search/functions_5.html create mode 100644 search/functions_5.js create mode 100644 search/functions_6.html create mode 100644 search/functions_6.js create mode 100644 search/functions_7.html create mode 100644 search/functions_7.js create mode 100644 search/functions_8.html create mode 100644 search/functions_8.js create mode 100644 search/functions_9.html create mode 100644 search/functions_9.js create mode 100644 search/functions_a.html create mode 100644 search/functions_a.js create mode 100644 search/functions_b.html create mode 100644 search/functions_b.js create mode 100644 search/functions_c.html create mode 100644 search/functions_c.js create mode 100644 search/functions_d.html create mode 100644 search/functions_d.js create mode 100644 search/functions_e.html create mode 100644 search/functions_e.js create mode 100644 search/functions_f.html create mode 100644 search/functions_f.js create mode 100644 search/groups_0.html create mode 100644 search/groups_0.js create mode 100644 search/groups_1.html create mode 100644 search/groups_1.js create mode 100644 search/mag_sel.png create mode 100644 search/namespaces_0.html create mode 100644 search/namespaces_0.js create mode 100644 search/namespaces_1.html create mode 100644 search/namespaces_1.js create mode 100644 search/namespaces_2.html create mode 100644 search/namespaces_2.js create mode 100644 search/nomatches.html create mode 100644 search/pages_0.html create mode 100644 search/pages_0.js create mode 100644 search/pages_1.html create mode 100644 search/pages_1.js create mode 100644 search/pages_2.html create mode 100644 search/pages_2.js create mode 100644 search/pages_3.html create mode 100644 search/pages_3.js create mode 100644 search/related_0.html create mode 100644 search/related_0.js create mode 100644 search/search.css create mode 100644 search/search.js create mode 100644 search/search_l.png create mode 100644 search/search_m.png create mode 100644 search/search_r.png create mode 100644 search/searchdata.js create mode 100644 search/typedefs_0.html create mode 100644 search/typedefs_0.js create mode 100644 search/typedefs_1.html create mode 100644 search/typedefs_1.js create mode 100644 search/variables_0.html create mode 100644 search/variables_0.js create mode 100644 search/variables_1.html create mode 100644 search/variables_1.js create mode 100644 search/variables_10.html create mode 100644 search/variables_10.js create mode 100644 search/variables_11.html create mode 100644 search/variables_11.js create mode 100644 search/variables_12.html create mode 100644 search/variables_12.js create mode 100644 search/variables_2.html create mode 100644 search/variables_2.js create mode 100644 search/variables_3.html create mode 100644 search/variables_3.js create mode 100644 search/variables_4.html create mode 100644 search/variables_4.js create mode 100644 search/variables_5.html create mode 100644 search/variables_5.js create mode 100644 search/variables_6.html create mode 100644 search/variables_6.js create mode 100644 search/variables_7.html create mode 100644 search/variables_7.js create mode 100644 search/variables_8.html create mode 100644 search/variables_8.js create mode 100644 search/variables_9.html create mode 100644 search/variables_9.js create mode 100644 search/variables_a.html create mode 100644 search/variables_a.js create mode 100644 search/variables_b.html create mode 100644 search/variables_b.js create mode 100644 search/variables_c.html create mode 100644 search/variables_c.js create mode 100644 search/variables_d.html create mode 100644 search/variables_d.js create mode 100644 search/variables_e.html create mode 100644 search/variables_e.js create mode 100644 search/variables_f.html create mode 100644 search/variables_f.js create mode 100644 splitbar.png create mode 100644 svgpan.js create mode 100644 sync_off.png create mode 100644 sync_on.png create mode 100644 tab_a.png create mode 100644 tab_b.png create mode 100644 tab_h.png create mode 100644 tab_s.png create mode 100644 tabs.css diff --git a/annotated.html b/annotated.html new file mode 100644 index 000000000..26bc771f5 --- /dev/null +++ b/annotated.html @@ -0,0 +1,150 @@ + + + + + + + +Algorithms_in_C++: Class List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Class List
+
+
+
Here are the classes, structs, unions and interfaces with brief descriptions:
+
[detail level 12]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
 Nmachine_learningMachine learning algorithms
 Cadaline
 NstatisticsStatistical algorithms
 Cstats_computer1
 Cstats_computer2
 CBit
 CBtree
 Ccll
 Ccompare
 CCycleCheck
 Cdouble_linked_list
 CEdge
 CEntry
 Cgraph
 CGraph
 CItem
 Clarge_number
 Clca
 Clinkedlist
 Clist
 CMinHeap
 CMinHeapNode
 Cmst
 CNode
 Cnode
 CPoint
 Cquery
 Cqueue
 CQueue
 CQueue_Array
 CSegmentIntersection
 CSolution
 Cstack
 Cstack_linkedList
 Ctower
 CTrie
 CTrieNode
 Ctrie
+
+
+
+ + + + diff --git a/annotated_dup.js b/annotated_dup.js new file mode 100644 index 000000000..1e237cf07 --- /dev/null +++ b/annotated_dup.js @@ -0,0 +1,37 @@ +var annotated_dup = +[ + [ "machine_learning", "d8/d77/namespacemachine__learning.html", "d8/d77/namespacemachine__learning" ], + [ "statistics", "d2/dcf/namespacestatistics.html", "d2/dcf/namespacestatistics" ], + [ "Bit", "df/d27/class_bit.html", "df/d27/class_bit" ], + [ "Btree", "d9/d90/struct_btree.html", "d9/d90/struct_btree" ], + [ "cll", "d5/d15/classcll.html", "d5/d15/classcll" ], + [ "compare", "d1/db3/structcompare.html", "d1/db3/structcompare" ], + [ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ], + [ "double_linked_list", "d9/dee/classdouble__linked__list.html", "d9/dee/classdouble__linked__list" ], + [ "Edge", "d7/d77/class_edge.html", "d7/d77/class_edge" ], + [ "Entry", "dd/d3b/struct_entry.html", "dd/d3b/struct_entry" ], + [ "graph", "dd/d9b/classgraph.html", "dd/d9b/classgraph" ], + [ "Graph", "da/d9a/class_graph.html", "da/d9a/class_graph" ], + [ "Item", "db/d66/struct_item.html", "db/d66/struct_item" ], + [ "large_number", "db/d82/classlarge__number.html", "db/d82/classlarge__number" ], + [ "lca", "dd/df4/structlca.html", "dd/df4/structlca" ], + [ "linkedlist", "d0/dff/structlinkedlist.html", "d0/dff/structlinkedlist" ], + [ "list", "d8/d10/structlist.html", "d8/d10/structlist" ], + [ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ], + [ "MinHeapNode", "d5/d29/struct_min_heap_node.html", "d5/d29/struct_min_heap_node" ], + [ "mst", "d1/d77/structmst.html", "d1/d77/structmst" ], + [ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ], + [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ], + [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], + [ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ], + [ "queue", "d2/d36/structqueue.html", "d2/d36/structqueue" ], + [ "Queue", "d4/da4/class_queue.html", "d4/da4/class_queue" ], + [ "Queue_Array", "d0/dd2/class_queue___array.html", "d0/dd2/class_queue___array" ], + [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], + [ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ], + [ "stack", "d1/dc2/classstack.html", "d1/dc2/classstack" ], + [ "stack_linkedList", "d2/dc4/classstack__linked_list.html", "d2/dc4/classstack__linked_list" ], + [ "tower", "d2/d2c/structtower.html", "d2/d2c/structtower" ], + [ "Trie", "dd/d2f/class_trie.html", "dd/d2f/class_trie" ], + [ "trie", "d4/dd9/structtrie.html", "d4/dd9/structtrie" ] +]; \ No newline at end of file diff --git a/bc_s.png b/bc_s.png new file mode 100644 index 0000000000000000000000000000000000000000..224b29aa9847d5a4b3902efd602b7ddf7d33e6c2 GIT binary patch literal 676 zcmV;V0$crwP)y__>=_9%My z{n931IS})GlGUF8K#6VIbs%684A^L3@%PlP2>_sk`UWPq@f;rU*V%rPy_ekbhXT&s z(GN{DxFv}*vZp`F>S!r||M`I*nOwwKX+BC~3P5N3-)Y{65c;ywYiAh-1*hZcToLHK ztpl1xomJ+Yb}K(cfbJr2=GNOnT!UFA7Vy~fBz8?J>XHsbZoDad^8PxfSa0GDgENZS zuLCEqzb*xWX2CG*b&5IiO#NzrW*;`VC9455M`o1NBh+(k8~`XCEEoC1Ybwf;vr4K3 zg|EB<07?SOqHp9DhLpS&bzgo70I+ghB_#)K7H%AMU3v}xuyQq9&Bm~++VYhF09a+U zl7>n7Jjm$K#b*FONz~fj;I->Bf;ule1prFN9FovcDGBkpg>)O*-}eLnC{6oZHZ$o% zXKW$;0_{8hxHQ>l;_*HATI(`7t#^{$(zLe}h*mqwOc*nRY9=?Sx4OOeVIfI|0V(V2 zBrW#G7Ss9wvzr@>H*`r>zE z+e8bOBgqIgldUJlG(YUDviMB`9+DH8n-s9SXRLyJHO1!=wY^79WYZMTa(wiZ!zP66 zA~!21vmF3H2{ngD;+`6j#~6j;$*f*G_2ZD1E;9(yaw7d-QnSCpK(cR1zU3qU0000< KMNUMnLSTYoA~SLT literal 0 HcmV?d00001 diff --git a/bdwn.png b/bdwn.png new file mode 100644 index 0000000000000000000000000000000000000000..940a0b950443a0bb1b216ac03c45b8a16c955452 GIT binary patch literal 147 zcmeAS@N?(olHy`uVBq!ia0vp^>_E)H!3HEvS)PKZC{Gv1kP61Pb5HX&C2wk~_T + + + + + + +Algorithms_in_C++: Class Index + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Class Index
+
+
+
a | b | c | d | e | g | i | l | m | n | p | q | s | t
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
  a  
+
  e  
+
lca   
  q  
+
stats_computer2 (statistics)   
linkedlist   
  t  
+
adaline (machine_learning)   Edge   list   query   
  b  
+
Entry   
  m  
+
queue   tower   
  g  
+
Queue   Trie   
Bit   MinHeap   Queue_Array   trie   
Btree   graph   MinHeapNode   
  s  
+
Trie::TrieNode   
  c  
+
Graph   mst   
  i  
+
  n  
+
SegmentIntersection   
cll   Solution   
compare   Item   Node   stack   
CycleCheck   
  l  
+
node   stack_linkedList   
  d  
+
  p  
+
stats_computer1 (statistics)   
large_number   
double_linked_list   Point   
+
a | b | c | d | e | g | i | l | m | n | p | q | s | t
+
+
+ + + + diff --git a/closed.png b/closed.png new file mode 100644 index 0000000000000000000000000000000000000000..98cc2c909da37a6df914fbf67780eebd99c597f5 GIT binary patch literal 132 zcmeAS@N?(olHy`uVBq!ia0vp^oFL4>1|%O$WD@{V-kvUwAr*{o@8{^CZMh(5KoB^r_<4^zF@3)Cp&&t3hdujKf f*?bjBoY!V+E))@{xMcbjXe@)LtDnm{r-UW|*e5JT literal 0 HcmV?d00001 diff --git a/d0/d01/smallest__circle_8cpp.html b/d0/d01/smallest__circle_8cpp.html new file mode 100644 index 000000000..34a8c0d79 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp.html @@ -0,0 +1,572 @@ + + + + + + + +Algorithms_in_C++: others/smallest_circle.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
smallest_circle.cpp File Reference
+
+
+ +

Get centre and radius of the smallest circle that circumscribes given set of points. +More...

+
#include <cmath>
+#include <iostream>
+#include <vector>
+
+Include dependency graph for smallest_circle.cpp:
+
+
+
+
+
+ + + +

+Classes

struct  Point
 
+ + + + + + + + + + + + + + + + + +

+Functions

double LenghtLine (const Point &A, const Point &B)
 
double TriangleArea (const Point &A, const Point &B, const Point &C)
 
bool PointInCircle (const std::vector< Point > &P, const Point &Center, double R)
 
double circle (const std::vector< Point > &P)
 
void test ()
 
void test2 ()
 
void test3 ()
 
int main ()
 
+

Detailed Description

+

Get centre and radius of the smallest circle that circumscribes given set of points.

+
See also
other implementation
+

Function Documentation

+ +

◆ circle()

+ +
+
+ + + + + + + + +
double circle (const std::vector< Point > & P)
+
+

Find the centre and radius of a circle enclosing a set of points.
+The function returns the radius of the circle and prints the coordinated of the centre of the circle.

Parameters
+ + +
[in]Pvector of points
+
+
+
Returns
radius of the circle
+
87  {
+
88  double minR = INFINITY;
+
89  double R;
+
90  Point C;
+
91  Point minC;
+
92 
+
93  /* This code is invalid and does not give correct result for TEST 3 */
+
94  // for each point in the list
+
95  for (size_t i = 0; i < P.size() - 2; i++)
+
96  // for every subsequent point in the list
+
97  for (size_t j = i + 1; j < P.size(); j++)
+
98  // for every subsequent point in the list
+
99  for (size_t k = j + 1; k < P.size(); k++) {
+
100  // here, we now have picked three points from the given set of
+
101  // points that we can use
+
102  // viz., P[i], P[j] and P[k]
+
103  C.x = -0.5 * ((P[i].y * (P[j].x * P[j].x + P[j].y * P[j].y -
+
104  P[k].x * P[k].x - P[k].y * P[k].y) +
+
105  P[j].y * (P[k].x * P[k].x + P[k].y * P[k].y -
+
106  P[i].x * P[i].x - P[i].y * P[i].y) +
+
107  P[k].y * (P[i].x * P[i].x + P[i].y * P[i].y -
+
108  P[j].x * P[j].x - P[j].y * P[j].y)) /
+
109  (P[i].x * (P[j].y - P[k].y) +
+
110  P[j].x * (P[k].y - P[i].y) +
+
111  P[k].x * (P[i].y - P[j].y)));
+
112  C.y = 0.5 * ((P[i].x * (P[j].x * P[j].x + P[j].y * P[j].y -
+
113  P[k].x * P[k].x - P[k].y * P[k].y) +
+
114  P[j].x * (P[k].x * P[k].x + P[k].y * P[k].y -
+
115  P[i].x * P[i].x - P[i].y * P[i].y) +
+
116  P[k].x * (P[i].x * P[i].x + P[i].y * P[i].y -
+
117  P[j].x * P[j].x - P[j].y * P[j].y)) /
+
118  (P[i].x * (P[j].y - P[k].y) +
+
119  P[j].x * (P[k].y - P[i].y) +
+
120  P[k].x * (P[i].y - P[j].y)));
+
121  R = (LenghtLine(P[i], P[j]) * LenghtLine(P[j], P[k]) *
+
122  LenghtLine(P[k], P[i])) /
+
123  (4 * TriangleArea(P[i], P[j], P[k]));
+
124  if (!PointInCircle(P, C, R)) {
+
125  continue;
+
126  }
+
127  if (R <= minR) {
+
128  minR = R;
+
129  minC = C;
+
130  }
+
131  }
+
132 
+
133  // for each point in the list
+
134  for (size_t i = 0; i < P.size() - 1; i++)
+
135  // for every subsequent point in the list
+
136  for (size_t j = i + 1; j < P.size(); j++) {
+
137  // check for diameterically opposite points
+
138  C.x = (P[i].x + P[j].x) / 2;
+
139  C.y = (P[i].y + P[j].y) / 2;
+
140  R = LenghtLine(C, P[i]);
+
141  if (!PointInCircle(P, C, R)) {
+
142  continue;
+
143  }
+
144  if (R <= minR) {
+
145  minR = R;
+
146  minC = C;
+
147  }
+
148  }
+
149  std::cout << minC.x << " " << minC.y << std::endl;
+
150  return minR;
+
151 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ LenghtLine()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double LenghtLine (const PointA,
const PointB 
)
+
+

Compute the Euclidian distance between two points \(A\equiv(x_1,y_1)\) and \(B\equiv(x_2,y_2)\) using the formula:

+\[d=\sqrt{\left(x_1-x_2\right)^2+\left(y_1-y_2\right)^2}\] +

+
Parameters
+ + + +
[in]Apoint A
[in]Bpoint B
+
+
+
Returns
ditance
+
37  {
+
38  double dx = B.x - A.x;
+
39  double dy = B.y - A.y;
+
40  return std::sqrt((dx * dx) + (dy * dy));
+
41 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main program

+
198  {
+
199  test();
+
200  std::cout << std::endl;
+
201  test2();
+
202  std::cout << std::endl;
+
203  test3();
+
204  return 0;
+
205 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ PointInCircle()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool PointInCircle (const std::vector< Point > & P,
const PointCenter,
double R 
)
+
+

Check if a set of points lie within given circle. This is true if the distance of all the points from the centre of the circle is less than the radius of the circle

Parameters
+ + + + +
[in]Pset of points to check
[in]Centercoordinates to centre of the circle
[in]Rradius of the circle
+
+
+
Returns
True if P lies on or within the circle
+
+False if P lies outside the circle
+
72  {
+
73  for (size_t i = 0; i < P.size(); i++) {
+
74  if (LenghtLine(P[i], Center) > R)
+
75  return false;
+
76  }
+
77  return true;
+
78 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test()

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

Test case: result should be:
+ Circle with
+ radius 3.318493136080724
+ centre at (3.0454545454545454, 1.3181818181818181)

+
158  {
+ +
160  Pv.push_back(Point(0, 0));
+
161  Pv.push_back(Point(5, 4));
+
162  Pv.push_back(Point(1, 3));
+
163  Pv.push_back(Point(4, 1));
+
164  Pv.push_back(Point(3, -2));
+
165  std::cout << circle(Pv) << std::endl;
+
166 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test2()

+ +
+
+ + + + + + + +
void test2 ()
+
+

Test case: result should be:
+ Circle with
+ radius 1.4142135623730951
+ centre at (1.0, 1.0)

+
173  {
+ +
175  Pv.push_back(Point(0, 0));
+
176  Pv.push_back(Point(0, 2));
+
177  Pv.push_back(Point(2, 2));
+
178  Pv.push_back(Point(2, 0));
+
179  std::cout << circle(Pv) << std::endl;
+
180 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test3()

+ +
+
+ + + + + + + +
void test3 ()
+
+

Test case: result should be:
+ Circle with
+ radius 1.821078397711709
+ centre at (2.142857142857143, 1.7857142857142856)

Todo:
This test fails
+
188  {
+ +
190  Pv.push_back(Point(0.5, 1));
+
191  Pv.push_back(Point(3.5, 3));
+
192  Pv.push_back(Point(2.5, 0));
+
193  Pv.push_back(Point(2, 1.5));
+
194  std::cout << circle(Pv) << std::endl;
+
195 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ TriangleArea()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
double TriangleArea (const PointA,
const PointB,
const PointC 
)
+
+

Compute the area of triangle formed by three points using Heron's formula. If the lengths of the sides of the triangle are \(a,\,b,\,c\) and \(s=\displaystyle\frac{a+b+c}{2}\) is the semi-perimeter then the area is given by

+\[A=\sqrt{s(s-a)(s-b)(s-c)}\] +

+
Parameters
+ + + + +
[in]Avertex A
[in]Bvertex B
[in]Cvertex C
+
+
+
Returns
area of triangle
+
54  {
+
55  double a = LenghtLine(A, B);
+
56  double b = LenghtLine(B, C);
+
57  double c = LenghtLine(C, A);
+
58  double p = (a + b + c) / 2;
+
59  return std::sqrt(p * (p - a) * (p - b) * (p - c));
+
60 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
void test3()
Definition: smallest_circle.cpp:188
+
void test2()
Definition: smallest_circle.cpp:173
+
STL class.
+
T size(T... args)
+
T sqrt(T... args)
+
T push_back(T... args)
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
+ +
ll k
Definition: matrix_exponentiation.cpp:48
+
double LenghtLine(const Point &A, const Point &B)
Definition: smallest_circle.cpp:37
+
double TriangleArea(const Point &A, const Point &B, const Point &C)
Definition: smallest_circle.cpp:54
+
double circle(const std::vector< Point > &P)
Definition: smallest_circle.cpp:87
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+
void test()
Definition: smallest_circle.cpp:158
+
Definition: line_segment_intersection.cpp:12
+
bool PointInCircle(const std::vector< Point > &P, const Point &Center, double R)
Definition: smallest_circle.cpp:72
+ + + + diff --git a/d0/d01/smallest__circle_8cpp.js b/d0/d01/smallest__circle_8cpp.js new file mode 100644 index 000000000..c9dcaab89 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp.js @@ -0,0 +1,12 @@ +var smallest__circle_8cpp = +[ + [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], + [ "circle", "d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903", null ], + [ "LenghtLine", "d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a", null ], + [ "main", "d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "PointInCircle", "d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad", null ], + [ "test", "d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002", null ], + [ "test2", "d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ], + [ "test3", "d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e", null ], + [ "TriangleArea", "d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc", null ] +]; \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map new file mode 100644 index 000000000..a346886ba --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 new file mode 100644 index 000000000..b1ad9e7e3 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 @@ -0,0 +1 @@ +65e4cd27339f81a7658d95b7353e141a \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg new file mode 100644 index 000000000..b50d188f5 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -0,0 +1,254 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +circle + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node9 + + +std::vector::push_back + + + + + +Node1->Node9 + + + + + +Node2->Node3 + + + + + +Node4 + + +LenghtLine + + + + + +Node2->Node4 + + + + + +Node6 + + +PointInCircle + + + + + +Node2->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node2->Node7 + + + + + +Node8 + + +TriangleArea + + + + + +Node2->Node8 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node6->Node7 + + + + + +Node8->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg new file mode 100644 index 000000000..e9e68db15 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -0,0 +1,166 @@ + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +circle + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node9 + + +std::vector::push_back + + + + + +Node1->Node9 + + + + + +Node2->Node3 + + + + + +Node4 + + +LenghtLine + + + + + +Node2->Node4 + + + + + +Node6 + + +PointInCircle + + + + + +Node2->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node2->Node7 + + + + + +Node8 + + +TriangleArea + + + + + +Node2->Node8 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node6->Node7 + + + + + +Node8->Node4 + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map new file mode 100644 index 000000000..6e26a0361 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5 new file mode 100644 index 000000000..b1f010152 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.md5 @@ -0,0 +1 @@ +06028b550a4fec7322d81626ff334f78 \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg new file mode 100644 index 000000000..0bf474ab5 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a0b0676df8e4da7a08c7ccaecea344903_cgraph.svg @@ -0,0 +1,130 @@ + + + + + + +circle + + + +Node1 + + +circle + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +LenghtLine + + + + + +Node1->Node3 + + + + + +Node5 + + +PointInCircle + + + + + +Node1->Node5 + + + + + +Node6 + + +std::vector::size + + + + + +Node1->Node6 + + + + + +Node7 + + +TriangleArea + + + + + +Node1->Node7 + + + + + +Node4 + + +std::sqrt + + + + + +Node3->Node4 + + + + + +Node5->Node3 + + + + + +Node5->Node6 + + + + + +Node7->Node3 + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map new file mode 100644 index 000000000..fe8c04fd2 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 new file mode 100644 index 000000000..6b8e19d21 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.md5 @@ -0,0 +1 @@ +c73d30ff9ab210ea6a8ecff5e8f4a3a6 \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg new file mode 100644 index 000000000..04a743c4e --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a3cbebd6f4d2cdf227663c67fe41ba12a_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +LenghtLine + + + +Node1 + + +LenghtLine + + + + + +Node2 + + +std::sqrt + + + + + +Node1->Node2 + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map new file mode 100644 index 000000000..25d182cd3 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 new file mode 100644 index 000000000..31b2c4997 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 @@ -0,0 +1 @@ +490dfcbbee3c451129fd011a224135ca \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg new file mode 100644 index 000000000..51bb88a88 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg @@ -0,0 +1,254 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test3 + + + +Node1 + + +test3 + + + + + +Node2 + + +circle + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node9 + + +std::vector::push_back + + + + + +Node1->Node9 + + + + + +Node2->Node3 + + + + + +Node4 + + +LenghtLine + + + + + +Node2->Node4 + + + + + +Node6 + + +PointInCircle + + + + + +Node2->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node2->Node7 + + + + + +Node8 + + +TriangleArea + + + + + +Node2->Node8 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node6->Node7 + + + + + +Node8->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg new file mode 100644 index 000000000..49e327817 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -0,0 +1,166 @@ + + + + + + +test3 + + + +Node1 + + +test3 + + + + + +Node2 + + +circle + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node9 + + +std::vector::push_back + + + + + +Node1->Node9 + + + + + +Node2->Node3 + + + + + +Node4 + + +LenghtLine + + + + + +Node2->Node4 + + + + + +Node6 + + +PointInCircle + + + + + +Node2->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node2->Node7 + + + + + +Node8 + + +TriangleArea + + + + + +Node2->Node8 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node6->Node7 + + + + + +Node8->Node4 + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map new file mode 100644 index 000000000..3c4f94f45 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 new file mode 100644 index 000000000..a94cc831c --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.md5 @@ -0,0 +1 @@ +0ce4215dafc761fb197d351e877dd9cc \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg new file mode 100644 index 000000000..e3fffe200 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_a94682a4a70d5906857ca09de5b9fb2cc_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +TriangleArea + + + +Node1 + + +TriangleArea + + + + + +Node2 + + +LenghtLine + + + + + +Node1->Node2 + + + + + +Node3 + + +std::sqrt + + + + + +Node2->Node3 + + + + + diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map new file mode 100644 index 000000000..13e114d6b --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 new file mode 100644 index 000000000..2a08b78ca --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.md5 @@ -0,0 +1 @@ +756e6b6364b0e26f57a06a16541c0208 \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg new file mode 100644 index 000000000..30ceafa4f --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg @@ -0,0 +1,254 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test + + + +Node1 + + +test + + + + + +Node2 + + +circle + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node9 + + +std::vector::push_back + + + + + +Node1->Node9 + + + + + +Node2->Node3 + + + + + +Node4 + + +LenghtLine + + + + + +Node2->Node4 + + + + + +Node6 + + +PointInCircle + + + + + +Node2->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node2->Node7 + + + + + +Node8 + + +TriangleArea + + + + + +Node2->Node8 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node6->Node7 + + + + + +Node8->Node4 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg new file mode 100644 index 000000000..5c6dfa406 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_ae1a3968e7947464bee7714f6d43b7002_cgraph_org.svg @@ -0,0 +1,166 @@ + + + + + + +test + + + +Node1 + + +test + + + + + +Node2 + + +circle + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node9 + + +std::vector::push_back + + + + + +Node1->Node9 + + + + + +Node2->Node3 + + + + + +Node4 + + +LenghtLine + + + + + +Node2->Node4 + + + + + +Node6 + + +PointInCircle + + + + + +Node2->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node2->Node7 + + + + + +Node8 + + +TriangleArea + + + + + +Node2->Node8 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node6->Node7 + + + + + +Node8->Node4 + + + + + diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..a9c0e5846 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,14 @@ + + + + + + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..f6c21bafa --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +2901e10f962428276b67e56b12c17c1d \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..1ce62f069 --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,341 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +test + + + + + +Node1->Node3 + + + + + +Node11 + + +test2 + + + + + +Node1->Node11 + + + + + +Node12 + + +test3 + + + + + +Node1->Node12 + + + + + +Node3->Node2 + + + + + +Node4 + + +circle + + + + + +Node3->Node4 + + + + + +Node10 + + +std::vector::push_back + + + + + +Node3->Node10 + + + + + +Node4->Node2 + + + + + +Node5 + + +LenghtLine + + + + + +Node4->Node5 + + + + + +Node7 + + +PointInCircle + + + + + +Node4->Node7 + + + + + +Node8 + + +std::vector::size + + + + + +Node4->Node8 + + + + + +Node9 + + +TriangleArea + + + + + +Node4->Node9 + + + + + +Node6 + + +std::sqrt + + + + + +Node5->Node6 + + + + + +Node7->Node5 + + + + + +Node7->Node8 + + + + + +Node9->Node5 + + + + + +Node11->Node2 + + + + + +Node11->Node4 + + + + + +Node11->Node10 + + + + + +Node12->Node2 + + + + + +Node12->Node4 + + + + + +Node12->Node10 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg new file mode 100644 index 000000000..d94f8b31c --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -0,0 +1,253 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +test + + + + + +Node1->Node3 + + + + + +Node11 + + +test2 + + + + + +Node1->Node11 + + + + + +Node12 + + +test3 + + + + + +Node1->Node12 + + + + + +Node3->Node2 + + + + + +Node4 + + +circle + + + + + +Node3->Node4 + + + + + +Node10 + + +std::vector::push_back + + + + + +Node3->Node10 + + + + + +Node4->Node2 + + + + + +Node5 + + +LenghtLine + + + + + +Node4->Node5 + + + + + +Node7 + + +PointInCircle + + + + + +Node4->Node7 + + + + + +Node8 + + +std::vector::size + + + + + +Node4->Node8 + + + + + +Node9 + + +TriangleArea + + + + + +Node4->Node9 + + + + + +Node6 + + +std::sqrt + + + + + +Node5->Node6 + + + + + +Node7->Node5 + + + + + +Node7->Node8 + + + + + +Node9->Node5 + + + + + +Node11->Node2 + + + + + +Node11->Node4 + + + + + +Node11->Node10 + + + + + +Node12->Node2 + + + + + +Node12->Node4 + + + + + +Node12->Node10 + + + + + diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map new file mode 100644 index 000000000..65d0d1e4a --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5 b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5 new file mode 100644 index 000000000..61690f89f --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.md5 @@ -0,0 +1 @@ +e972b919d295625efef59ee8ac76009f \ No newline at end of file diff --git a/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg new file mode 100644 index 000000000..aabc4f3cc --- /dev/null +++ b/d0/d01/smallest__circle_8cpp_aee6d48762c1dfb9f14627927f0c16fad_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +PointInCircle + + + +Node1 + + +PointInCircle + + + + + +Node2 + + +LenghtLine + + + + + +Node1->Node2 + + + + + +Node4 + + +std::vector::size + + + + + +Node1->Node4 + + + + + +Node3 + + +std::sqrt + + + + + +Node2->Node3 + + + + + diff --git a/d0/d04/qr__decompose_8h__incl.map b/d0/d04/qr__decompose_8h__incl.map new file mode 100644 index 000000000..d3fe3a6f0 --- /dev/null +++ b/d0/d04/qr__decompose_8h__incl.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d0/d04/qr__decompose_8h__incl.md5 b/d0/d04/qr__decompose_8h__incl.md5 new file mode 100644 index 000000000..27bbe48e6 --- /dev/null +++ b/d0/d04/qr__decompose_8h__incl.md5 @@ -0,0 +1 @@ +599ef160b12f8482c9fd8de1e6e2183f \ No newline at end of file diff --git a/d0/d04/qr__decompose_8h__incl.svg b/d0/d04/qr__decompose_8h__incl.svg new file mode 100644 index 000000000..ba594118e --- /dev/null +++ b/d0/d04/qr__decompose_8h__incl.svg @@ -0,0 +1,128 @@ + + + + + + +numerical_methods/qr_decompose.h + + + +Node1 + + +numerical_methods/qr +_decompose.h + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +cstdlib + + + + + +Node1->Node3 + + + + + +Node4 + + +iomanip + + + + + +Node1->Node4 + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + +Node6 + + +limits + + + + + +Node1->Node6 + + + + + +Node7 + + +numeric + + + + + +Node1->Node7 + + + + + +Node8 + + +valarray + + + + + +Node1->Node8 + + + + + diff --git a/d0/d08/realtime__stats_8cpp.html b/d0/d08/realtime__stats_8cpp.html new file mode 100644 index 000000000..3eff47915 --- /dev/null +++ b/d0/d08/realtime__stats_8cpp.html @@ -0,0 +1,313 @@ + + + + + + + +Algorithms_in_C++: math/realtime_stats.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
realtime_stats.cpp File Reference
+
+
+ +

Compute statistics for data entered in rreal-time. +More...

+
#include <cassert>
+#include <cmath>
+#include <iostream>
+
+Include dependency graph for realtime_stats.cpp:
+
+
+
+
+
+ + + + + +

+Classes

class  statistics::stats_computer1< T >
 
class  statistics::stats_computer2< T >
 
+ + + + +

+Namespaces

 statistics
 Statistical algorithms.
 
+ + + + + +

+Functions

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

Detailed Description

+

Compute statistics for data entered in rreal-time.

+

This algorithm is really beneficial to compute statistics on data read in realtime. For example, devices reading biometrics data. The algorithm is simple enough to be easily implemented in an embedded system.

Author
Krishna Vedala
+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int main (int argc,
char ** argv 
)
+
+

Main function

+
158  {
+
159  const float test_data1[] = {3, 4, 5, -1.4, -3.6, 1.9, 1.};
+
160  test_function(test_data1, sizeof(test_data1) / sizeof(test_data1[0]));
+
161 
+
162  std::cout
+
163  << "Enter data. Any non-numeric data will terminate the data input."
+
164  << std::endl;
+
165 
+
166  stats_computer1<float> stats1;
+
167  stats_computer2<float> stats2;
+
168 
+
169  while (1) {
+
170  double val;
+
171  std::cout << "Enter number: ";
+
172  std::cin >> val;
+
173 
+
174  // check for failure to read input. Happens for
+
175  // non-numeric data
+
176  if (std::cin.fail())
+
177  break;
+
178 
+
179  stats1.new_val(val);
+
180  stats2.new_val(val);
+
181 
+
182  std::cout << "\tMethod 1:"
+
183  << "\tMean: " << stats1.mean()
+
184  << "\t Variance: " << stats1.variance()
+
185  << "\t Std: " << stats1.std() << std::endl;
+
186  std::cout << "\tMethod 2:"
+
187  << "\tMean: " << stats2.mean()
+
188  << "\t Variance: " << stats2.variance()
+
189  << "\t Std: " << stats2.std() << std::endl;
+
190  }
+
191 
+
192  return 0;
+
193 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_function()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void test_function (const float * test_data,
const int number_of_samples 
)
+
+

Test the algorithm implementation

Parameters
+ + +
[in]test_dataarray of data to test the algorithms
+
+
+
118  {
+
119  float mean = 0.f, variance = 0.f;
+
120 
+
121  stats_computer1<float> stats01;
+
122  stats_computer2<float> stats02;
+
123 
+
124  for (int i = 0; i < number_of_samples; i++) {
+
125  stats01.new_val(test_data[i]);
+
126  stats02.new_val(test_data[i]);
+
127  mean += test_data[i];
+
128  }
+
129 
+
130  mean /= number_of_samples;
+
131 
+
132  for (int i = 0; i < number_of_samples; i++) {
+
133  float temp = test_data[i] - mean;
+
134  variance += temp * temp;
+
135  }
+
136  variance /= number_of_samples;
+
137 
+
138  std::cout << "<<<<<<<< Test Function >>>>>>>>" << std::endl
+
139  << "Expected: Mean: " << mean << "\t Variance: " << variance
+
140  << std::endl;
+
141  std::cout << "\tMethod 1:"
+
142  << "\tMean: " << stats01.mean()
+
143  << "\t Variance: " << stats01.variance()
+
144  << "\t Std: " << stats01.std() << std::endl;
+
145  std::cout << "\tMethod 2:"
+
146  << "\tMean: " << stats02.mean()
+
147  << "\t Variance: " << stats02.variance()
+
148  << "\t Std: " << stats02.std() << std::endl;
+
149 
+
150  assert(std::abs(stats01.mean() - mean) < 0.01);
+
151  assert(std::abs(stats02.mean() - mean) < 0.01);
+
152  assert(std::abs(stats02.variance() - variance) < 0.01);
+
153 
+
154  std::cout << "(Tests passed)" << std::endl;
+
155 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
double std() const
Definition: realtime_stats.cpp:48
+ +
double variance() const
Definition: realtime_stats.cpp:89
+
double mean() const
Definition: realtime_stats.cpp:42
+
Definition: realtime_stats.cpp:72
+
void test_function(const float *test_data, const int number_of_samples)
Definition: realtime_stats.cpp:118
+
T endl(T... args)
+
void new_val(T x)
Definition: realtime_stats.cpp:32
+
void new_val(T x)
Definition: realtime_stats.cpp:77
+
double variance() const
Definition: realtime_stats.cpp:45
+
Definition: realtime_stats.cpp:27
+
double std() const
Definition: realtime_stats.cpp:92
+ +
double mean() const
Definition: realtime_stats.cpp:86
+ + + + diff --git a/d0/d08/realtime__stats_8cpp.js b/d0/d08/realtime__stats_8cpp.js new file mode 100644 index 000000000..af9f2b0bf --- /dev/null +++ b/d0/d08/realtime__stats_8cpp.js @@ -0,0 +1,7 @@ +var realtime__stats_8cpp = +[ + [ "stats_computer1", "d7/d7c/classstatistics_1_1stats__computer1.html", "d7/d7c/classstatistics_1_1stats__computer1" ], + [ "stats_computer2", "d8/dab/classstatistics_1_1stats__computer2.html", "d8/dab/classstatistics_1_1stats__computer2" ], + [ "main", "d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "test_function", "d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd", null ] +]; \ No newline at end of file diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map new file mode 100644 index 000000000..e2f9791fb --- /dev/null +++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map @@ -0,0 +1,14 @@ + + + + + + + + + + + + + + diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 new file mode 100644 index 000000000..de7c596bd --- /dev/null +++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 @@ -0,0 +1 @@ +cc77eb4c634a723d383cefcb51fa2331 \ No newline at end of file diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg new file mode 100644 index 000000000..e6e3665f2 --- /dev/null +++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -0,0 +1,353 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +statistics::stats_computer1 +::mean + + + + + +Node1->Node3 + + + + + +Node4 + + +statistics::stats_computer2 +::mean + + + + + +Node1->Node4 + + + + + +Node5 + + +statistics::stats_computer1 +::new_val + + + + + +Node1->Node5 + + + + + +Node6 + + +statistics::stats_computer2 +::new_val + + + + + +Node1->Node6 + + + + + +Node7 + + +statistics::stats_computer1::std + + + + + +Node1->Node7 + + + + + +Node9 + + +statistics::stats_computer1 +::variance + + + + + +Node1->Node9 + + + + + +Node10 + + +statistics::stats_computer2::std + + + + + +Node1->Node10 + + + + + +Node11 + + +statistics::stats_computer2 +::variance + + + + + +Node1->Node11 + + + + + +Node12 + + +test_function + + + + + +Node1->Node12 + + + + + +Node8 + + +std::sqrt + + + + + +Node7->Node8 + + + + + +Node7->Node9 + + + + + +Node10->Node8 + + + + + +Node10->Node11 + + + + + +Node12->Node2 + + + + + +Node12->Node3 + + + + + +Node12->Node4 + + + + + +Node12->Node5 + + + + + +Node12->Node6 + + + + + +Node12->Node7 + + + + + +Node12->Node9 + + + + + +Node12->Node10 + + + + + +Node12->Node11 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg new file mode 100644 index 000000000..abd3b3e5b --- /dev/null +++ b/d0/d08/realtime__stats_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -0,0 +1,265 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +statistics::stats_computer1 +::mean + + + + + +Node1->Node3 + + + + + +Node4 + + +statistics::stats_computer2 +::mean + + + + + +Node1->Node4 + + + + + +Node5 + + +statistics::stats_computer1 +::new_val + + + + + +Node1->Node5 + + + + + +Node6 + + +statistics::stats_computer2 +::new_val + + + + + +Node1->Node6 + + + + + +Node7 + + +statistics::stats_computer1::std + + + + + +Node1->Node7 + + + + + +Node9 + + +statistics::stats_computer1 +::variance + + + + + +Node1->Node9 + + + + + +Node10 + + +statistics::stats_computer2::std + + + + + +Node1->Node10 + + + + + +Node11 + + +statistics::stats_computer2 +::variance + + + + + +Node1->Node11 + + + + + +Node12 + + +test_function + + + + + +Node1->Node12 + + + + + +Node8 + + +std::sqrt + + + + + +Node7->Node8 + + + + + +Node7->Node9 + + + + + +Node10->Node8 + + + + + +Node10->Node11 + + + + + +Node12->Node2 + + + + + +Node12->Node3 + + + + + +Node12->Node4 + + + + + +Node12->Node5 + + + + + +Node12->Node6 + + + + + +Node12->Node7 + + + + + +Node12->Node9 + + + + + +Node12->Node10 + + + + + +Node12->Node11 + + + + + diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map new file mode 100644 index 000000000..d9fab0040 --- /dev/null +++ b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.map @@ -0,0 +1,13 @@ + + + + + + + + + + + + + diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5 b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5 new file mode 100644 index 000000000..2c1dfa465 --- /dev/null +++ b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.md5 @@ -0,0 +1 @@ +a30f230da13c6b4cb69f7282591dd48e \ No newline at end of file diff --git a/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg new file mode 100644 index 000000000..0109c8213 --- /dev/null +++ b/d0/d08/realtime__stats_8cpp_aa54c915581fcc495489175a4386d59fd_cgraph.svg @@ -0,0 +1,196 @@ + + + + + + +test_function + + + +Node1 + + +test_function + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +statistics::stats_computer1 +::mean + + + + + +Node1->Node3 + + + + + +Node4 + + +statistics::stats_computer2 +::mean + + + + + +Node1->Node4 + + + + + +Node5 + + +statistics::stats_computer1 +::new_val + + + + + +Node1->Node5 + + + + + +Node6 + + +statistics::stats_computer2 +::new_val + + + + + +Node1->Node6 + + + + + +Node7 + + +statistics::stats_computer1::std + + + + + +Node1->Node7 + + + + + +Node9 + + +statistics::stats_computer1 +::variance + + + + + +Node1->Node9 + + + + + +Node10 + + +statistics::stats_computer2::std + + + + + +Node1->Node10 + + + + + +Node11 + + +statistics::stats_computer2 +::variance + + + + + +Node1->Node11 + + + + + +Node8 + + +std::sqrt + + + + + +Node7->Node8 + + + + + +Node7->Node9 + + + + + +Node10->Node8 + + + + + +Node10->Node11 + + + + + diff --git a/d0/d0d/structmst-members.html b/d0/d0d/structmst-members.html new file mode 100644 index 000000000..13ab348fe --- /dev/null +++ b/d0/d0d/structmst-members.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
mst Member List
+
+
+ +

This is the complete list of members for mst, including all inherited members.

+ + + + +
key (defined in mst)mst
near (defined in mst)mst
visited (defined in mst)mst
+
+ + + + diff --git a/d0/d1f/structnode__coll__graph.map b/d0/d1f/structnode__coll__graph.map new file mode 100644 index 000000000..557ef1228 --- /dev/null +++ b/d0/d1f/structnode__coll__graph.map @@ -0,0 +1,3 @@ + + + diff --git a/d0/d1f/structnode__coll__graph.md5 b/d0/d1f/structnode__coll__graph.md5 new file mode 100644 index 000000000..8ff512d43 --- /dev/null +++ b/d0/d1f/structnode__coll__graph.md5 @@ -0,0 +1 @@ +1518d0a1711ef8fd81e644063ace5d1f \ No newline at end of file diff --git a/d0/d1f/structnode__coll__graph.svg b/d0/d1f/structnode__coll__graph.svg new file mode 100644 index 000000000..ca6f296a5 --- /dev/null +++ b/d0/d1f/structnode__coll__graph.svg @@ -0,0 +1,33 @@ + + + + + + +node< Kind > + + + +Node1 + + +node< Kind > + + + + + +Node1->Node1 + + + prev +next +right +left +link + + + diff --git a/d0/d55/classcll-members.html b/d0/d55/classcll-members.html new file mode 100644 index 000000000..03e2accb1 --- /dev/null +++ b/d0/d55/classcll-members.html @@ -0,0 +1,122 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
cll Member List
+
+
+ +

This is the complete list of members for cll, including all inherited members.

+ + + + + + + + + + + + +
cll() (defined in cll)cll
display() (defined in cll)cll
find_item(int item_to_find) (defined in cll)cll
get_size() (defined in cll)cll
head (defined in cll)cllprotected
insert_front(int new_data) (defined in cll)cll
insert_tail(int new_data) (defined in cll)cll
operator*() (defined in cll)cll
operator++() (defined in cll)cll
total (defined in cll)cllprotected
~cll() (defined in cll)cll
+
+ + + + diff --git a/d0/d77/linear__search_8cpp__incl.map b/d0/d77/linear__search_8cpp__incl.map new file mode 100644 index 000000000..269598c65 --- /dev/null +++ b/d0/d77/linear__search_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d0/d77/linear__search_8cpp__incl.md5 b/d0/d77/linear__search_8cpp__incl.md5 new file mode 100644 index 000000000..1908e5602 --- /dev/null +++ b/d0/d77/linear__search_8cpp__incl.md5 @@ -0,0 +1 @@ +e338721c2fe625a63f8de627683e9fd6 \ No newline at end of file diff --git a/d0/d77/linear__search_8cpp__incl.svg b/d0/d77/linear__search_8cpp__incl.svg new file mode 100644 index 000000000..750aa6a2f --- /dev/null +++ b/d0/d77/linear__search_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +search/linear_search.cpp + + + +Node1 + + +search/linear_search.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d0/d78/classstatistics_1_1stats__computer1-members.html b/d0/d78/classstatistics_1_1stats__computer1-members.html new file mode 100644 index 000000000..0bbd2356e --- /dev/null +++ b/d0/d78/classstatistics_1_1stats__computer1-members.html @@ -0,0 +1,120 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
statistics::stats_computer1< T > Member List
+
+ +
+ + + + diff --git a/d0/d80/classgraph__coll__graph.map b/d0/d80/classgraph__coll__graph.map new file mode 100644 index 000000000..0d4d1d9c1 --- /dev/null +++ b/d0/d80/classgraph__coll__graph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d0/d80/classgraph__coll__graph.md5 b/d0/d80/classgraph__coll__graph.md5 new file mode 100644 index 000000000..f4c8c909a --- /dev/null +++ b/d0/d80/classgraph__coll__graph.md5 @@ -0,0 +1 @@ +8a5f1f1eb2d7839c33a123be7f538083 \ No newline at end of file diff --git a/d0/d80/classgraph__coll__graph.svg b/d0/d80/classgraph__coll__graph.svg new file mode 100644 index 000000000..2b1e8930e --- /dev/null +++ b/d0/d80/classgraph__coll__graph.svg @@ -0,0 +1,78 @@ + + + + + + +graph + + + +Node1 + + +graph + + + + + +Node2 + + +std::vector< vector +< int > > + + + + + +Node2->Node1 + + + adj + + + +Node3 + + +list< int > + + + + + +Node3->Node1 + + + adj + + + +Node4 + + +list + + + + + +Node4->Node3 + + + next + + + +Node4->Node4 + + + next + + + diff --git a/d0/da1/string__fibonacci_8cpp__incl.map b/d0/da1/string__fibonacci_8cpp__incl.map new file mode 100644 index 000000000..c3953d9db --- /dev/null +++ b/d0/da1/string__fibonacci_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d0/da1/string__fibonacci_8cpp__incl.md5 b/d0/da1/string__fibonacci_8cpp__incl.md5 new file mode 100644 index 000000000..f539511cb --- /dev/null +++ b/d0/da1/string__fibonacci_8cpp__incl.md5 @@ -0,0 +1 @@ +342f5a7c940b82309c6796ebca39a86d \ No newline at end of file diff --git a/d0/da1/string__fibonacci_8cpp__incl.svg b/d0/da1/string__fibonacci_8cpp__incl.svg new file mode 100644 index 000000000..d9284ed44 --- /dev/null +++ b/d0/da1/string__fibonacci_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/string_fibonacci.cpp + + + +Node1 + + +math/string_fibonacci.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +cstring + + + + + +Node1->Node3 + + + + + diff --git a/d0/da2/number__of__positive__divisors_8cpp.html b/d0/da2/number__of__positive__divisors_8cpp.html new file mode 100644 index 000000000..5319de734 --- /dev/null +++ b/d0/da2/number__of__positive__divisors_8cpp.html @@ -0,0 +1,241 @@ + + + + + + + +Algorithms_in_C++: math/number_of_positive_divisors.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
number_of_positive_divisors.cpp File Reference
+
+
+ +

C++ Program to calculate number of divisors. +More...

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

+Functions

int number_of_positive_divisors (int n)
 
int main ()
 
+

Detailed Description

+

C++ Program to calculate number of divisors.

+

This algorithm use the prime factorization approach. Any number can be written in multiplication of its prime factors.
+Let N = P1^E1 * P2^E2 ... Pk^Ek
+Therefore. number-of-divisors(N) = (E1+1) * (E2+1) ... (Ek+1).
+Where P1, P2 ... Pk are prime factors and E1, E2 ... Ek are exponents respectively.

+

Example:-
+N = 36
+36 = (3^2 * 2^2)
+number_of_positive_divisors(36) = (2+1) * (2+1) = 9.
+list of positive divisors of 36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.

+

Similarly if N is -36 at that time number of positive divisors remain same.

+

Example:-
+N = -36
+-36 = -1 * (3^2 * 2^2)
+number_of_positive_divisors(-36) = (2+1) * (2+1) = 9.
+list of positive divisors of -36 = 1, 2, 3, 4, 6, 9, 12, 18, 36.

+

Function Documentation

+ +

◆ main()

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

Main function

+
62  {
+
63  int n;
+
64  std::cin >> n;
+
65  if (n < 0) {
+
66  n = -n;
+
67  }
+
68  if (n == 0) {
+
69  std::cout << "All non-zero numbers are divisors of 0 !" << std::endl;
+
70  } else {
+
71  std::cout << "Number of positive divisors is : ";
+ +
73  }
+
74 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ number_of_positive_divisors()

+ +
+
+ + + + + + + + +
int number_of_positive_divisors (int n)
+
+

Algorithm

+
34  {
+
35  std::vector<int> prime_exponent_count;
+
36  for (int i = 2; i * i <= n; i++) {
+
37  int prime_count = 0;
+
38  while (n % i == 0) {
+
39  prime_count += 1;
+
40  n /= i;
+
41  }
+
42  if (prime_count != 0) {
+
43  prime_exponent_count.push_back(prime_count);
+
44  }
+
45  }
+
46  if (n > 1) {
+
47  prime_exponent_count.push_back(1);
+
48  }
+
49 
+
50  int divisors_count = 1;
+
51 
+
52  for (int i = 0; i < prime_exponent_count.size(); i++) {
+
53  divisors_count = divisors_count * (prime_exponent_count[i] + 1);
+
54  }
+
55 
+
56  return divisors_count;
+
57 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T size(T... args)
+
T push_back(T... args)
+ +
T endl(T... args)
+
int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:34
+ + + + + diff --git a/d0/da2/number__of__positive__divisors_8cpp.js b/d0/da2/number__of__positive__divisors_8cpp.js new file mode 100644 index 000000000..339828f36 --- /dev/null +++ b/d0/da2/number__of__positive__divisors_8cpp.js @@ -0,0 +1,5 @@ +var number__of__positive__divisors_8cpp = +[ + [ "main", "d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "number_of_positive_divisors", "d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb", null ] +]; \ No newline at end of file diff --git a/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.map b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.map new file mode 100644 index 000000000..72cf1f611 --- /dev/null +++ b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5 b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5 new file mode 100644 index 000000000..ba8607281 --- /dev/null +++ b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.md5 @@ -0,0 +1 @@ +990829b2cfcf0b4f0baa485c64feba91 \ No newline at end of file diff --git a/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg new file mode 100644 index 000000000..332c681ec --- /dev/null +++ b/d0/da2/number__of__positive__divisors_8cpp_ad89ccced8504b5116046cfa03066ffeb_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +number_of_positive_divisors + + + +Node1 + + +number_of_positive +_divisors + + + + + +Node2 + + +std::vector::push_back + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::size + + + + + +Node1->Node3 + + + + + diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..00d6ae043 --- /dev/null +++ b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..c40fcb02b --- /dev/null +++ b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +4b955f1e80d28c1a99b4f18828e35b90 \ No newline at end of file diff --git a/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..09f2192bc --- /dev/null +++ b/d0/da2/number__of__positive__divisors_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,83 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +number_of_positive +_divisors + + + + + +Node1->Node3 + + + + + +Node4 + + +std::vector::push_back + + + + + +Node3->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node3->Node5 + + + + + diff --git a/d0/dab/interpolation__search_8cpp__incl.map b/d0/dab/interpolation__search_8cpp__incl.map new file mode 100644 index 000000000..ebdf3a7fa --- /dev/null +++ b/d0/dab/interpolation__search_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d0/dab/interpolation__search_8cpp__incl.md5 b/d0/dab/interpolation__search_8cpp__incl.md5 new file mode 100644 index 000000000..5187ea76f --- /dev/null +++ b/d0/dab/interpolation__search_8cpp__incl.md5 @@ -0,0 +1 @@ +50f0532822ac20b705aed5ad7bea2748 \ No newline at end of file diff --git a/d0/dab/interpolation__search_8cpp__incl.svg b/d0/dab/interpolation__search_8cpp__incl.svg new file mode 100644 index 000000000..f76e11d2e --- /dev/null +++ b/d0/dab/interpolation__search_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +search/interpolation_search.cpp + + + +Node1 + + +search/interpolation +_search.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d0/db5/trie__modern_8cpp__incl.map b/d0/db5/trie__modern_8cpp__incl.map new file mode 100644 index 000000000..3b3f9c199 --- /dev/null +++ b/d0/db5/trie__modern_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d0/db5/trie__modern_8cpp__incl.md5 b/d0/db5/trie__modern_8cpp__incl.md5 new file mode 100644 index 000000000..d0d15a284 --- /dev/null +++ b/d0/db5/trie__modern_8cpp__incl.md5 @@ -0,0 +1 @@ +1439627f44055590d7f63a6ff1ad6c03 \ No newline at end of file diff --git a/d0/db5/trie__modern_8cpp__incl.svg b/d0/db5/trie__modern_8cpp__incl.svg new file mode 100644 index 000000000..b349b58f6 --- /dev/null +++ b/d0/db5/trie__modern_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +data_structures/trie_modern.cpp + + + +Node1 + + +data_structures/trie +_modern.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +memory + + + + + +Node1->Node3 + + + + + +Node4 + + +string + + + + + +Node1->Node4 + + + + + diff --git a/d0/db6/non__recursive__merge__sort_8cpp.html b/d0/db6/non__recursive__merge__sort_8cpp.html new file mode 100644 index 000000000..dc89bb8e4 --- /dev/null +++ b/d0/db6/non__recursive__merge__sort_8cpp.html @@ -0,0 +1,153 @@ + + + + + + + +Algorithms_in_C++: sorting/non_recursive_merge_sort.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
non_recursive_merge_sort.cpp File Reference
+
+
+
#include <cstddef>
+#include <iostream>
+#include <utility>
+
+Include dependency graph for non_recursive_merge_sort.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 sorting
 Sorting algorithms.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<class Iterator >
void sorting::merge (Iterator l, Iterator r, const Iterator e, char b[])
 merges 2 sorted adjacent segments into a larger sorted segment More...
 
template<class Iterator >
void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
 bottom-up merge sort which sorts elements in a non-decreasing order More...
 
template<class Iterator >
void sorting::non_recursive_merge_sort (const Iterator first, const size_t n)
 bottom-up merge sort which sorts elements in a non-decreasing order More...
 
template<class Iterator >
void sorting::non_recursive_merge_sort (const Iterator first, const Iterator last)
 bottom-up merge sort which sorts elements in a non-decreasing order More...
 
+int main (int argc, char **argv)
 
+

Detailed Description

+

Copyright 2020

Author
Albirair
+

A generic implementation of non-recursive merge sort.

+
+
+ + + + diff --git a/d0/db6/non__recursive__merge__sort_8cpp.js b/d0/db6/non__recursive__merge__sort_8cpp.js new file mode 100644 index 000000000..2ccf11480 --- /dev/null +++ b/d0/db6/non__recursive__merge__sort_8cpp.js @@ -0,0 +1,8 @@ +var non__recursive__merge__sort_8cpp = +[ + [ "main", "d0/db6/non__recursive__merge__sort_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "merge", "d0/db6/non__recursive__merge__sort_8cpp.html#aa26de383227859210f14dcf12201a079", null ], + [ "non_recursive_merge_sort", "d0/db6/non__recursive__merge__sort_8cpp.html#ae97f4dd815654c4682f564afd718e824", null ], + [ "non_recursive_merge_sort", "d0/db6/non__recursive__merge__sort_8cpp.html#a140d913e42fb94176a0b2c8b29a80420", null ], + [ "non_recursive_merge_sort", "d0/db6/non__recursive__merge__sort_8cpp.html#a27236b8d3df3832e1f1225576a122534", null ] +]; \ No newline at end of file diff --git a/d0/db7/smallest__circle_8cpp__incl.map b/d0/db7/smallest__circle_8cpp__incl.map new file mode 100644 index 000000000..c87d07ef7 --- /dev/null +++ b/d0/db7/smallest__circle_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d0/db7/smallest__circle_8cpp__incl.md5 b/d0/db7/smallest__circle_8cpp__incl.md5 new file mode 100644 index 000000000..b7f75904c --- /dev/null +++ b/d0/db7/smallest__circle_8cpp__incl.md5 @@ -0,0 +1 @@ +3519d6c8bd7f3487624f46840d81f389 \ No newline at end of file diff --git a/d0/db7/smallest__circle_8cpp__incl.svg b/d0/db7/smallest__circle_8cpp__incl.svg new file mode 100644 index 000000000..1fced8040 --- /dev/null +++ b/d0/db7/smallest__circle_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +others/smallest_circle.cpp + + + +Node1 + + +others/smallest_circle.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + diff --git a/d0/dc4/struct_point-members.html b/d0/dc4/struct_point-members.html new file mode 100644 index 000000000..7ab13b7cb --- /dev/null +++ b/d0/dc4/struct_point-members.html @@ -0,0 +1,116 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Point Member List
+
+
+ +

This is the complete list of members for Point, including all inherited members.

+ + + + + + +
Point(double a=0.f, double b=0.f)Pointinlineexplicit
x (defined in Point)Point
xPoint
yPoint
yPoint
+
+ + + + diff --git a/d0/dcc/successive__approximation_8cpp__incl.map b/d0/dcc/successive__approximation_8cpp__incl.map new file mode 100644 index 000000000..23e69870c --- /dev/null +++ b/d0/dcc/successive__approximation_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d0/dcc/successive__approximation_8cpp__incl.md5 b/d0/dcc/successive__approximation_8cpp__incl.md5 new file mode 100644 index 000000000..0ac8d2a0a --- /dev/null +++ b/d0/dcc/successive__approximation_8cpp__incl.md5 @@ -0,0 +1 @@ +11b6503a2e4cf7f5fd275e8a6254263a \ No newline at end of file diff --git a/d0/dcc/successive__approximation_8cpp__incl.svg b/d0/dcc/successive__approximation_8cpp__incl.svg new file mode 100644 index 000000000..55f580a9a --- /dev/null +++ b/d0/dcc/successive__approximation_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +numerical_methods/successive_approximation.cpp + + + +Node1 + + +numerical_methods/successive +_approximation.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/d0/dd1/binaryheap_8cpp__incl.map b/d0/dd1/binaryheap_8cpp__incl.map new file mode 100644 index 000000000..f2cce02a5 --- /dev/null +++ b/d0/dd1/binaryheap_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d0/dd1/binaryheap_8cpp__incl.md5 b/d0/dd1/binaryheap_8cpp__incl.md5 new file mode 100644 index 000000000..7f17d389d --- /dev/null +++ b/d0/dd1/binaryheap_8cpp__incl.md5 @@ -0,0 +1 @@ +dd50839c38841c72a4716094e86c6cf8 \ No newline at end of file diff --git a/d0/dd1/binaryheap_8cpp__incl.svg b/d0/dd1/binaryheap_8cpp__incl.svg new file mode 100644 index 000000000..f99b4e846 --- /dev/null +++ b/d0/dd1/binaryheap_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +data_structures/binaryheap.cpp + + + +Node1 + + +data_structures/binaryheap.cpp + + + + + +Node2 + + +climits + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +utility + + + + + +Node1->Node4 + + + + + diff --git a/d0/dd2/class_queue___array.html b/d0/dd2/class_queue___array.html new file mode 100644 index 000000000..8f165552e --- /dev/null +++ b/d0/dd2/class_queue___array.html @@ -0,0 +1,148 @@ + + + + + + + +Algorithms_in_C++: Queue_Array Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+ + + + + + + + +

+Public Member Functions

+void enqueue (int)
 
+int dequeue ()
 
+void display ()
 
+ + + +

+Public Attributes

+int * arr = new int[size]
 
+ + + + + + + +

+Private Attributes

+int front
 
+int rear
 
+int size
 
+
The documentation for this class was generated from the following file:
    +
  • data_structures/queue_using_array.cpp
  • +
+
+
+ + + + diff --git a/d0/dd2/class_queue___array.js b/d0/dd2/class_queue___array.js new file mode 100644 index 000000000..50547d3f1 --- /dev/null +++ b/d0/dd2/class_queue___array.js @@ -0,0 +1,11 @@ +var class_queue___array = +[ + [ "Queue_Array", "d0/dd2/class_queue___array.html#abf20bb235f99915addd7f162008365be", null ], + [ "dequeue", "d0/dd2/class_queue___array.html#a4e1ea2bf04c99ef258888fd4303f09cd", null ], + [ "display", "d0/dd2/class_queue___array.html#aa8c58cb7bfd146c39e9dd0a39d47dce7", null ], + [ "enqueue", "d0/dd2/class_queue___array.html#a52de5f54eee2b875016fed8abb64d47a", null ], + [ "arr", "d0/dd2/class_queue___array.html#a81c4648299cc693c61e73b2d7022f420", null ], + [ "front", "d0/dd2/class_queue___array.html#a6de07e48dcd70df0b6c9affe94f7742f", null ], + [ "rear", "d0/dd2/class_queue___array.html#abf0003cf9a3ef11c752a40475f586609", null ], + [ "size", "d0/dd2/class_queue___array.html#a02be998c5cb601b25709804f6887909b", null ] +]; \ No newline at end of file diff --git a/d0/dd5/ode__midpoint__euler_8cpp__incl.map b/d0/dd5/ode__midpoint__euler_8cpp__incl.map new file mode 100644 index 000000000..932d94a32 --- /dev/null +++ b/d0/dd5/ode__midpoint__euler_8cpp__incl.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d0/dd5/ode__midpoint__euler_8cpp__incl.md5 b/d0/dd5/ode__midpoint__euler_8cpp__incl.md5 new file mode 100644 index 000000000..d7e458f92 --- /dev/null +++ b/d0/dd5/ode__midpoint__euler_8cpp__incl.md5 @@ -0,0 +1 @@ +1ec8e01f405364078a4c40d5bbc5a6bf \ No newline at end of file diff --git a/d0/dd5/ode__midpoint__euler_8cpp__incl.svg b/d0/dd5/ode__midpoint__euler_8cpp__incl.svg new file mode 100644 index 000000000..d86c89bba --- /dev/null +++ b/d0/dd5/ode__midpoint__euler_8cpp__incl.svg @@ -0,0 +1,98 @@ + + + + + + +numerical_methods/ode_midpoint_euler.cpp + + + +Node1 + + +numerical_methods/ode +_midpoint_euler.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +ctime + + + + + +Node1->Node3 + + + + + +Node4 + + +fstream + + + + + +Node1->Node4 + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + +Node6 + + +valarray + + + + + +Node1->Node6 + + + + + diff --git a/d0/de2/gaussian__elimination_8cpp.html b/d0/de2/gaussian__elimination_8cpp.html new file mode 100644 index 000000000..436bc3c7d --- /dev/null +++ b/d0/de2/gaussian__elimination_8cpp.html @@ -0,0 +1,226 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/gaussian_elimination.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
gaussian_elimination.cpp File Reference
+
+
+ +

Gaussian elimination method +More...

+
#include <iostream>
+
+Include dependency graph for gaussian_elimination.cpp:
+
+
+
+
+
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

Function Documentation

+ +

◆ main()

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

Main function

+
9  {
+
10  int mat_size, i, j, step;
+
11 
+
12  std::cout << "Matrix size: ";
+
13  std::cin >> mat_size;
+
14 
+
15  // create a 2D matrix by dynamic memory allocation
+
16  double **mat = new double *[mat_size + 1], **x = new double *[mat_size];
+
17  for (i = 0; i <= mat_size; i++) {
+
18  mat[i] = new double[mat_size + 1];
+
19  if (i < mat_size)
+
20  x[i] = new double[mat_size + 1];
+
21  }
+
22 
+
23  // get the matrix elements from user
+
24  std::cout << std::endl << "Enter value of the matrix: " << std::endl;
+
25  for (i = 0; i < mat_size; i++) {
+
26  for (j = 0; j <= mat_size; j++) {
+
27  std::cin >>
+
28  mat[i][j]; // Enter (mat_size*mat_size) value of the matrix.
+
29  }
+
30  }
+
31 
+
32  // perform Gaussian elimination
+
33  for (step = 0; step < mat_size - 1; step++) {
+
34  for (i = step; i < mat_size - 1; i++) {
+
35  double a = (mat[i + 1][step] / mat[step][step]);
+
36 
+
37  for (j = step; j <= mat_size; j++)
+
38  mat[i + 1][j] = mat[i + 1][j] - (a * mat[step][j]);
+
39  }
+
40  }
+
41 
+ +
43  << "Matrix using Gaussian Elimination method: " << std::endl;
+
44  for (i = 0; i < mat_size; i++) {
+
45  for (j = 0; j <= mat_size; j++) {
+
46  x[i][j] = mat[i][j];
+
47  std::cout << mat[i][j] << " ";
+
48  }
+ +
50  }
+ +
52  << "Value of the Gaussian Elimination method: " << std::endl;
+
53  for (i = mat_size - 1; i >= 0; i--) {
+
54  double sum = 0;
+
55  for (j = mat_size - 1; j > i; j--) {
+
56  x[i][j] = x[j][j] * x[i][j];
+
57  sum = x[i][j] + sum;
+
58  }
+
59  if (x[i][i] == 0)
+
60  x[i][i] = 0;
+
61  else
+
62  x[i][i] = (x[i][mat_size] - sum) / (x[i][i]);
+
63 
+
64  std::cout << "x" << i << "= " << x[i][i] << std::endl;
+
65  }
+
66 
+
67  for (i = 0; i <= mat_size; i++) {
+
68  delete[] mat[i];
+
69  if (i < mat_size)
+
70  delete[] x[i];
+
71  }
+
72  delete[] mat;
+
73  delete[] x;
+
74 
+
75  return 0;
+
76 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+ + + + + diff --git a/d0/de2/gaussian__elimination_8cpp.js b/d0/de2/gaussian__elimination_8cpp.js new file mode 100644 index 000000000..fa578263c --- /dev/null +++ b/d0/de2/gaussian__elimination_8cpp.js @@ -0,0 +1,4 @@ +var gaussian__elimination_8cpp = +[ + [ "main", "d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..6da7ad474 --- /dev/null +++ b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..86a68ba5f --- /dev/null +++ b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +7b66b13cd9e906646a781de5e20f13d9 \ No newline at end of file diff --git a/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..01ecc6aea --- /dev/null +++ b/d0/de2/gaussian__elimination_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d0/dfc/sqrt__double_8cpp__incl.map b/d0/dfc/sqrt__double_8cpp__incl.map new file mode 100644 index 000000000..5581512be --- /dev/null +++ b/d0/dfc/sqrt__double_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d0/dfc/sqrt__double_8cpp__incl.md5 b/d0/dfc/sqrt__double_8cpp__incl.md5 new file mode 100644 index 000000000..b3833a6a9 --- /dev/null +++ b/d0/dfc/sqrt__double_8cpp__incl.md5 @@ -0,0 +1 @@ +564ea8b7518aadf13d9e1028dd086ead \ No newline at end of file diff --git a/d0/dfc/sqrt__double_8cpp__incl.svg b/d0/dfc/sqrt__double_8cpp__incl.svg new file mode 100644 index 000000000..ef8b62c47 --- /dev/null +++ b/d0/dfc/sqrt__double_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/sqrt_double.cpp + + + +Node1 + + +math/sqrt_double.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/d0/dff/structlinkedlist.html b/d0/dff/structlinkedlist.html new file mode 100644 index 000000000..72a1e7c8b --- /dev/null +++ b/d0/dff/structlinkedlist.html @@ -0,0 +1,131 @@ + + + + + + + +Algorithms_in_C++: linkedlist Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
linkedlist Struct Reference
+
+
+
+Collaboration diagram for linkedlist:
+
+
+
+
[legend]
+ + + + + + +

+Public Attributes

+int data
 
+linkedlistnext
 
+
The documentation for this struct was generated from the following file:
    +
  • data_structures/queue_using_linkedlist.cpp
  • +
+
+
+ + + + diff --git a/d0/dff/structlinkedlist.js b/d0/dff/structlinkedlist.js new file mode 100644 index 000000000..22f574184 --- /dev/null +++ b/d0/dff/structlinkedlist.js @@ -0,0 +1,5 @@ +var structlinkedlist = +[ + [ "data", "d0/dff/structlinkedlist.html#a4e025f2bca6ab3ae7b0408a416d53d93", null ], + [ "next", "d0/dff/structlinkedlist.html#a698c32a2f4e48b98bb540f518d2937a0", null ] +]; \ No newline at end of file diff --git a/d1/d06/ternary__search_8cpp__incl.map b/d1/d06/ternary__search_8cpp__incl.map new file mode 100644 index 000000000..20efbbdd8 --- /dev/null +++ b/d1/d06/ternary__search_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/d06/ternary__search_8cpp__incl.md5 b/d1/d06/ternary__search_8cpp__incl.md5 new file mode 100644 index 000000000..925a10bd7 --- /dev/null +++ b/d1/d06/ternary__search_8cpp__incl.md5 @@ -0,0 +1 @@ +5127eadafd66bb733d2db9106758857d \ No newline at end of file diff --git a/d1/d06/ternary__search_8cpp__incl.svg b/d1/d06/ternary__search_8cpp__incl.svg new file mode 100644 index 000000000..49e234024 --- /dev/null +++ b/d1/d06/ternary__search_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +search/ternary_search.cpp + + + +Node1 + + +search/ternary_search.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d1/d07/class_solution-members.html b/d1/d07/class_solution-members.html new file mode 100644 index 000000000..ee4c6cedd --- /dev/null +++ b/d1/d07/class_solution-members.html @@ -0,0 +1,119 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Solution Member List
+
+
+ +

This is the complete list of members for Solution, including all inherited members.

+ + + + + + + + + +
bridge (defined in Solution)Solutionprivate
dfs(int current_node, int parent) (defined in Solution)Solutioninlineprivate
graph (defined in Solution)Solutionprivate
in_time (defined in Solution)Solutionprivate
out_time (defined in Solution)Solutionprivate
search_bridges(int n, const vector< vector< int >> &connections) (defined in Solution)Solutioninline
timer (defined in Solution)Solutionprivate
visited (defined in Solution)Solutionprivate
+
+ + + + diff --git a/d1/d11/gcd__of__n__numbers_8cpp.html b/d1/d11/gcd__of__n__numbers_8cpp.html new file mode 100644 index 000000000..a7e8a9ff0 --- /dev/null +++ b/d1/d11/gcd__of__n__numbers_8cpp.html @@ -0,0 +1,223 @@ + + + + + + + +Algorithms_in_C++: math/gcd_of_n_numbers.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
gcd_of_n_numbers.cpp File Reference
+
+
+ +

This program aims at calculating the GCD of n numbers by division method. +More...

+
#include <iostream>
+
+Include dependency graph for gcd_of_n_numbers.cpp:
+
+
+
+
+
+ + + + + +

+Functions

int gcd (int *a, int n)
 
int main ()
 
+

Detailed Description

+

This program aims at calculating the GCD of n numbers by division method.

+
See also
gcd_iterative_euclidean.cpp, gcd_recursive_euclidean.cpp
+

Function Documentation

+ +

◆ gcd()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int gcd (int * a,
int n 
)
+
+

Compute GCD using division algorithm

+
Parameters
+ + + +
[in]aarray of integers to compute GCD for
[in]nnumber of integers in array a
+
+
+
15  {
+
16  int j = 1; // to access all elements of the array starting from 1
+
17  int gcd = a[0];
+
18  while (j < n) {
+
19  if (a[j] % gcd == 0) // value of gcd is as needed so far
+
20  j++; // so we check for next element
+
21  else
+
22  gcd = a[j] % gcd; // calculating GCD by division method
+
23  }
+
24  return gcd;
+
25 }
+
+
+
+ +

◆ main()

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

Main function

+
28  {
+
29  int n;
+
30  std::cout << "Enter value of n:" << std::endl;
+
31  std::cin >> n;
+
32  int *a = new int[n];
+
33  int i;
+
34  std::cout << "Enter the n numbers:" << std::endl;
+
35  for (i = 0; i < n; i++) std::cin >> a[i];
+
36 
+
37  std::cout << "GCD of entered n numbers:" << gcd(a, n) << std::endl;
+
38 
+
39  delete[] a;
+
40  return 0;
+
41 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+
int gcd(int *a, int n)
Definition: gcd_of_n_numbers.cpp:15
+ + + + + diff --git a/d1/d11/gcd__of__n__numbers_8cpp.js b/d1/d11/gcd__of__n__numbers_8cpp.js new file mode 100644 index 000000000..793728d02 --- /dev/null +++ b/d1/d11/gcd__of__n__numbers_8cpp.js @@ -0,0 +1,5 @@ +var gcd__of__n__numbers_8cpp = +[ + [ "gcd", "d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a", null ], + [ "main", "d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..07b6c3507 --- /dev/null +++ b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..971396c4b --- /dev/null +++ b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +94566639bee4e32c12e75e423c07d577 \ No newline at end of file diff --git a/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..76873384b --- /dev/null +++ b/d1/d11/gcd__of__n__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +gcd + + + + + +Node1->Node3 + + + + + diff --git a/d1/d1d/class_graph-members.html b/d1/d1d/class_graph-members.html new file mode 100644 index 000000000..c2410c036 --- /dev/null +++ b/d1/d1d/class_graph-members.html @@ -0,0 +1,153 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Graph Member List
+
+
+ +

This is the complete list of members for Graph, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
addEdge(int src, int dst, int weight) (defined in Graph)Graphinline
addEdge(int src, int dst, int weight) (defined in Graph)Graphinline
addEdge(Edge const &edge)Graphinline
addEdge(unsigned int source, unsigned int destination)Graphinline
addEdge(int src, int dst, int weight) (defined in Graph)Graphinline
addVertices(unsigned int num=1)Graphinline
bfs(int source, int sink) (defined in Graph)Graphinlineprivate
capacity (defined in Graph)Graphprivate
edge_participated (defined in Graph)Graphprivate
edgeNum (defined in Graph)Graph
edges (defined in Graph)Graph
edges (defined in Graph)Graph
ford_fulkerson(void) (defined in Graph)Graphinline
getAdjList() constGraphinline
getVertices() constGraphinline
Graph(int V, int E) (defined in Graph)Graphinline
Graph(int V) (defined in Graph)Graphinline
Graph() (defined in Graph)Graphinline
Graph(Graph &&)=default (defined in Graph)Graph
Graph(Graph const &)=default (defined in Graph)Graph
Graph(unsigned int vertices, AdjList const &adjList)Graphinline
Graph(unsigned int vertices, AdjList &&adjList)Graphinline
Graph(unsigned int vertices, std::vector< Edge > const &edges)Graphinline
Graph() (defined in Graph)Graphinline
Graph(const int V) (defined in Graph)Graphinline
m_adjList (defined in Graph)Graphprivate
m_vertices (defined in Graph)Graphprivate
max_flow (defined in Graph)Graphprivate
operator=(Graph &&)=default (defined in Graph)Graph
operator=(Graph const &)=default (defined in Graph)Graph
parent (defined in Graph)Graphprivate
print_flow_info(void) (defined in Graph)Graphinline
residual_capacity (defined in Graph)Graphprivate
set_graph(void) (defined in Graph)Graphinline
sink (defined in Graph)Graphprivate
source (defined in Graph)Graphprivate
total_edges (defined in Graph)Graphprivate
total_nodes (defined in Graph)Graphprivate
vertexNum (defined in Graph)Graph
visited (defined in Graph)Graphprivate
~Graph() (defined in Graph)Graphinline
~Graph()=default (defined in Graph)Graph
+
+ + + + diff --git a/d1/d1d/pascal__triangle_8cpp__incl.map b/d1/d1d/pascal__triangle_8cpp__incl.map new file mode 100644 index 000000000..e29912ce5 --- /dev/null +++ b/d1/d1d/pascal__triangle_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d1/d1d/pascal__triangle_8cpp__incl.md5 b/d1/d1d/pascal__triangle_8cpp__incl.md5 new file mode 100644 index 000000000..a29dc9e86 --- /dev/null +++ b/d1/d1d/pascal__triangle_8cpp__incl.md5 @@ -0,0 +1 @@ +6ace10fd060f581b98ff35b936ac7bd9 \ No newline at end of file diff --git a/d1/d1d/pascal__triangle_8cpp__incl.svg b/d1/d1d/pascal__triangle_8cpp__incl.svg new file mode 100644 index 000000000..5501da7b5 --- /dev/null +++ b/d1/d1d/pascal__triangle_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +others/pascal_triangle.cpp + + + +Node1 + + +others/pascal_triangle.cpp + + + + + +Node2 + + +cstring + + + + + +Node1->Node2 + + + + + +Node3 + + +iomanip + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + diff --git a/d1/d21/quick__sort_8cpp.html b/d1/d21/quick__sort_8cpp.html new file mode 100644 index 000000000..e683f6c8d --- /dev/null +++ b/d1/d21/quick__sort_8cpp.html @@ -0,0 +1,202 @@ + + + + + + + +Algorithms_in_C++: sorting/quick_sort.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
quick_sort.cpp File Reference
+
+
+ +

Quick sort algorithm. +More...

+
#include <cstdlib>
+#include <iostream>
+
+Include dependency graph for quick_sort.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 sorting
 Sorting algorithms.
 
+ + + + + + + + + +

+Functions

int sorting::partition (int arr[], int low, int high)
 
void sorting::quickSort (int arr[], int low, int high)
 
+void show (int arr[], int size)
 
int main ()
 
+

Detailed Description

+

Quick sort algorithm.

+

Implementation Details - Quick Sort is a divide and conquer algorithm. It picks and element as pivot and partition the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways.

+
    +
  1. Always pick the first element as pivot
  2. +
  3. Always pick the last element as pivot (implemented below)
  4. +
  5. Pick a random element as pivot
  6. +
  7. Pick median as pivot
  8. +
+

The key process in quickSort is partition(). Target of partition is, given an array and an element x(say) of array as pivot, put x at it's correct position in sorted array and put all smaller elements (samller than x) before x, and put all greater elements (greater than x) after x. All this should be done in linear time

+

Function Documentation

+ +

◆ main()

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

Driver program to test above functions

+
82  {
+
83  int size;
+
84  std::cout << "\nEnter the number of elements : ";
+
85 
+
86  std::cin >> size;
+
87 
+
88  int *arr = new int[size];
+
89 
+
90  std::cout << "\nEnter the unsorted elements : ";
+
91 
+
92  for (int i = 0; i < size; ++i) {
+
93  std::cout << "\n";
+
94  std::cin >> arr[i];
+
95  }
+
96  quickSort(arr, 0, size);
+
97  std::cout << "Sorted array\n";
+
98  show(arr, size);
+
99 
+
100  delete[] arr;
+
101  return 0;
+
102 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
+ +
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
+ + + + diff --git a/d1/d21/quick__sort_8cpp.js b/d1/d21/quick__sort_8cpp.js new file mode 100644 index 000000000..1de69d3fc --- /dev/null +++ b/d1/d21/quick__sort_8cpp.js @@ -0,0 +1,7 @@ +var quick__sort_8cpp = +[ + [ "main", "d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "partition", "d1/d21/quick__sort_8cpp.html#a7e7f25f31c50523990437abf2ac3907e", null ], + [ "quickSort", "d1/d21/quick__sort_8cpp.html#a50b66a1c652291b9a346ec7342967178", null ], + [ "show", "d1/d21/quick__sort_8cpp.html#ad34859945724cc7de3cc71936715aec6", null ] +]; \ No newline at end of file diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..5908f18a8 --- /dev/null +++ b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..386212bec --- /dev/null +++ b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +195146ca207e7e26cca3e48bc27ed907 \ No newline at end of file diff --git a/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..95ded9408 --- /dev/null +++ b/d1/d21/quick__sort_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +sorting::quickSort + + + + + +Node1->Node2 + + + + + +Node4 + + +show + + + + + +Node1->Node4 + + + + + +Node3 + + +sorting::partition + + + + + +Node2->Node3 + + + + + diff --git a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.map b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.map new file mode 100644 index 000000000..020cd81ca --- /dev/null +++ b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.md5 b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.md5 new file mode 100644 index 000000000..05d572c7b --- /dev/null +++ b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.md5 @@ -0,0 +1 @@ +3342bed250275ada240abc86394a8bff \ No newline at end of file diff --git a/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg new file mode 100644 index 000000000..5870dd927 --- /dev/null +++ b/d1/d4b/ordinary__least__squares__regressor_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +numerical_methods/ordinary_least_squares_regressor.cpp + + + +Node1 + + +numerical_methods/ordinary +_least_squares_regressor.cpp + + + + + +Node2 + + +iomanip + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + diff --git a/d1/d57/classcll__coll__graph.map b/d1/d57/classcll__coll__graph.map new file mode 100644 index 000000000..b3f79c236 --- /dev/null +++ b/d1/d57/classcll__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/d57/classcll__coll__graph.md5 b/d1/d57/classcll__coll__graph.md5 new file mode 100644 index 000000000..09f1ca9d2 --- /dev/null +++ b/d1/d57/classcll__coll__graph.md5 @@ -0,0 +1 @@ +30bbcf263db77e073bfe658c330853b3 \ No newline at end of file diff --git a/d1/d57/classcll__coll__graph.svg b/d1/d57/classcll__coll__graph.svg new file mode 100644 index 000000000..c88309d21 --- /dev/null +++ b/d1/d57/classcll__coll__graph.svg @@ -0,0 +1,49 @@ + + + + + + +cll + + + +Node1 + + +cll + + + + + +Node2 + + +node< Kind > + + + + + +Node2->Node1 + + + head + + + +Node2->Node2 + + + prev +next +right +left +link + + + diff --git a/d1/d76/buzz__number_8cpp.html b/d1/d76/buzz__number_8cpp.html new file mode 100644 index 000000000..d2f172310 --- /dev/null +++ b/d1/d76/buzz__number_8cpp.html @@ -0,0 +1,169 @@ + + + + + + + +Algorithms_in_C++: others/buzz_number.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
buzz_number.cpp File Reference
+
+
+ +

A buzz number is a number that is either divisible by 7 or has last digit as 7. +More...

+
#include <iostream>
+
+Include dependency graph for buzz_number.cpp:
+
+
+
+
+
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

A buzz number is a number that is either divisible by 7 or has last digit as 7.

+

Function Documentation

+ +

◆ main()

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

main function

+
9  {
+
10  int n, t;
+
11  std::cin >> t;
+
12  while (t--) {
+
13  std::cin >> n;
+
14  if ((n % 7 == 0) || (n % 10 == 7))
+
15  std::cout << n << " is a buzz number" << std::endl;
+
16  else
+
17  std::cout << n << " is not a buzz number" << std::endl;
+
18  }
+
19  return 0;
+
20 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T endl(T... args)
+ + + + + diff --git a/d1/d76/buzz__number_8cpp.js b/d1/d76/buzz__number_8cpp.js new file mode 100644 index 000000000..fd2cf89e7 --- /dev/null +++ b/d1/d76/buzz__number_8cpp.js @@ -0,0 +1,4 @@ +var buzz__number_8cpp = +[ + [ "main", "d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..6da7ad474 --- /dev/null +++ b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..86a68ba5f --- /dev/null +++ b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +7b66b13cd9e906646a781de5e20f13d9 \ No newline at end of file diff --git a/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..01ecc6aea --- /dev/null +++ b/d1/d76/buzz__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d1/d77/structmst.html b/d1/d77/structmst.html new file mode 100644 index 000000000..20ed3f2bb --- /dev/null +++ b/d1/d77/structmst.html @@ -0,0 +1,128 @@ + + + + + + + +Algorithms_in_C++: mst Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
mst Struct Reference
+
+
+ + + + + + + + +

+Public Attributes

+bool visited
 
+int key
 
+int near
 
+
The documentation for this struct was generated from the following file:
    +
  • greedy_algorithms/prims_minimum_spanning_tree.cpp
  • +
+
+
+ + + + diff --git a/d1/d77/structmst.js b/d1/d77/structmst.js new file mode 100644 index 000000000..0d625e316 --- /dev/null +++ b/d1/d77/structmst.js @@ -0,0 +1,6 @@ +var structmst = +[ + [ "key", "d1/d77/structmst.html#a59feb15588a49aac1c243bf649b97c72", null ], + [ "near", "d1/d77/structmst.html#a2ce945d2bf94acc77bde387c30d02af1", null ], + [ "visited", "d1/d77/structmst.html#a53e13cb8fe7481d6173bfa72ac509590", null ] +]; \ No newline at end of file diff --git a/d1/d7d/gcd__of__n__numbers_8cpp__incl.map b/d1/d7d/gcd__of__n__numbers_8cpp__incl.map new file mode 100644 index 000000000..3c4e2ce0c --- /dev/null +++ b/d1/d7d/gcd__of__n__numbers_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/d7d/gcd__of__n__numbers_8cpp__incl.md5 b/d1/d7d/gcd__of__n__numbers_8cpp__incl.md5 new file mode 100644 index 000000000..a7877157a --- /dev/null +++ b/d1/d7d/gcd__of__n__numbers_8cpp__incl.md5 @@ -0,0 +1 @@ +580862ba886f7b9f9ba045d86a092fbc \ No newline at end of file diff --git a/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg b/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg new file mode 100644 index 000000000..29005e2ce --- /dev/null +++ b/d1/d7d/gcd__of__n__numbers_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +math/gcd_of_n_numbers.cpp + + + +Node1 + + +math/gcd_of_n_numbers.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl.map b/d1/da1/decimal__to__hexadecimal_8cpp__incl.map new file mode 100644 index 000000000..3fcddf9cd --- /dev/null +++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl.md5 b/d1/da1/decimal__to__hexadecimal_8cpp__incl.md5 new file mode 100644 index 000000000..3c460fabd --- /dev/null +++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl.md5 @@ -0,0 +1 @@ +e5e51353a4f5329db132e16456629335 \ No newline at end of file diff --git a/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg b/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg new file mode 100644 index 000000000..dc9a12b12 --- /dev/null +++ b/d1/da1/decimal__to__hexadecimal_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/decimal_to_hexadecimal.cpp + + + +Node1 + + +others/decimal_to_hexadecimal.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d1/db3/structcompare.html b/d1/db3/structcompare.html new file mode 100644 index 000000000..95931282d --- /dev/null +++ b/d1/db3/structcompare.html @@ -0,0 +1,122 @@ + + + + + + + +Algorithms_in_C++: compare Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
compare Struct Reference
+
+
+ + + + +

+Public Member Functions

+bool operator() (MinHeapNode *l, MinHeapNode *r)
 
+
The documentation for this struct was generated from the following file:
    +
  • greedy_algorithms/huffman.cpp
  • +
+
+
+ + + + diff --git a/d1/db3/structcompare.js b/d1/db3/structcompare.js new file mode 100644 index 000000000..07fcbfaef --- /dev/null +++ b/d1/db3/structcompare.js @@ -0,0 +1,4 @@ +var structcompare = +[ + [ "operator()", "d1/db3/structcompare.html#a8471ed92f607eeb23021dc4afde9bae0", null ] +]; \ No newline at end of file diff --git a/d1/dc2/class_graph__coll__graph.map b/d1/dc2/class_graph__coll__graph.map new file mode 100644 index 000000000..4fcea2673 --- /dev/null +++ b/d1/dc2/class_graph__coll__graph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d1/dc2/class_graph__coll__graph.md5 b/d1/dc2/class_graph__coll__graph.md5 new file mode 100644 index 000000000..d8b1e0f88 --- /dev/null +++ b/d1/dc2/class_graph__coll__graph.md5 @@ -0,0 +1 @@ +e346b070fc6181e5890782d664d2ce7b \ No newline at end of file diff --git a/d1/dc2/class_graph__coll__graph.svg b/d1/dc2/class_graph__coll__graph.svg new file mode 100644 index 000000000..69686204d --- /dev/null +++ b/d1/dc2/class_graph__coll__graph.svg @@ -0,0 +1,123 @@ + + + + + + +Graph + + + +Node1 + + +Graph + + + + + +Node2 + + +std::bitset< MAXN > + + + + + +Node2->Node1 + + + visited + + + +Node3 + + +std::vector< std::tuple +< int, int, int > > + + + + + +Node3->Node1 + + + edge_participated + + + +Node4 + + +std::tuple< int, int, + int > + + + + + +Node4->Node3 + + + elements + + + +Node5 + + +Edge + + + + + +Node5->Node1 + + + edges + + + +Node6 + + +std::unordered_map +< unsigned int, std +::vector< unsigned int > > + + + + + +Node6->Node1 + + + m_adjList + + + +Node7 + + +std::vector< unsigned + int > + + + + + +Node7->Node6 + + + elements + + + diff --git a/d1/dc2/classstack.html b/d1/dc2/classstack.html new file mode 100644 index 000000000..47bd20a95 --- /dev/null +++ b/d1/dc2/classstack.html @@ -0,0 +1,520 @@ + + + + + + + +Algorithms_in_C++: stack< Type > Class Template Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
stack< Type > Class Template Reference
+
+
+
+Collaboration diagram for stack< Type >:
+
+
+
+
[legend]
+ + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

void display ()
 
 stack ()
 
 ~stack ()
 
bool isEmptyStack ()
 
void push (Type item)
 
Type top ()
 
void pop ()
 
void clear ()
 
stack< Type > & operator= (const stack< Type > &otherStack)
 
+ + + + + +

+Private Attributes

node< Type > * stackTop
 
+int size
 
+

Constructor & Destructor Documentation

+ +

◆ stack()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + +
stack< Type >::stack ()
+
+inline
+
+

Default constructor

+
32  {
+
33  stackTop = NULL;
+
34  size = 0;
+
35  }
+
+
+
+ +

◆ ~stack()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + +
stack< Type >::~stack ()
+
+inline
+
+

Destructor

+
38 {}
+
+
+
+

Member Function Documentation

+ +

◆ clear()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + +
void stack< Type >::clear ()
+
+inline
+
+

Clear stack

+
73 { stackTop = NULL; }
+
+
+
+ +

◆ display()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + +
void stack< Type >::display ()
+
+inline
+
+

Show stack

+
20  {
+
21  node<Type> *current = stackTop;
+
22  std::cout << "Top --> ";
+
23  while (current != NULL) {
+
24  std::cout << current->data << " ";
+
25  current = current->next;
+
26  }
+ +
28  std::cout << "Size of stack: " << size << std::endl;
+
29  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ isEmptyStack()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + +
bool stack< Type >::isEmptyStack ()
+
+inline
+
+

Determine whether the stack is empty

+
41 { return (stackTop == NULL); }
+
+
+
+ +

◆ operator=()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + + +
stack<Type>& stack< Type >::operator= (const stack< Type > & otherStack)
+
+inline
+
+

Overload "=" the assignment operator

+
76  {
+
77  node<Type> *newNode, *current, *last;
+
78 
+
79  /* If stack is no empty, make it empty */
+
80  if (stackTop != NULL) {
+
81  stackTop = NULL;
+
82  }
+
83  if (otherStack.stackTop == NULL) {
+
84  stackTop = NULL;
+
85  } else {
+
86  current = otherStack.stackTop;
+
87  stackTop = new node<Type>;
+
88  stackTop->data = current->data;
+
89  stackTop->next = NULL;
+
90  last = stackTop;
+
91  current = current->next;
+
92  /* Copy the remaining stack */
+
93  while (current != NULL) {
+
94  newNode = new node<Type>;
+
95  newNode->data = current->data;
+
96  newNode->next = NULL;
+
97  last->next = newNode;
+
98  last = newNode;
+
99  current = current->next;
+
100  }
+
101  }
+
102  size = otherStack.size;
+
103  return *this;
+
104  }
+
+
+
+ +

◆ pop()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + +
void stack< Type >::pop ()
+
+inline
+
+

Remove the top element of the stack

+
60  {
+
61  node<Type> *temp;
+
62  if (!isEmptyStack()) {
+
63  temp = stackTop;
+
64  stackTop = stackTop->next;
+
65  delete temp;
+
66  size--;
+
67  } else {
+
68  std::cout << "Stack is empty !" << std::endl;
+
69  }
+
70  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ push()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + + +
void stack< Type >::push (Type item)
+
+inline
+
+

Add new item to the stack

+
44  {
+
45  node<Type> *newNode;
+
46  newNode = new node<Type>;
+
47  newNode->data = item;
+
48  newNode->next = stackTop;
+
49  stackTop = newNode;
+
50  size++;
+
51  }
+
+
+
+ +

◆ top()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + +
Type stack< Type >::top ()
+
+inline
+
+

Return the top element of the stack

+
54  {
+
55  assert(stackTop != NULL);
+
56  return stackTop->data;
+
57  }
+
+
+
+

Member Data Documentation

+ +

◆ stackTop

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + +
node<Type>* stack< Type >::stackTop
+
+private
+
+

Pointer to the stack

+ +
+
+
The documentation for this class was generated from the following file: +
+
+ + +
T endl(T... args)
+
bool isEmptyStack()
Definition: stack.h:41
+
node< Type > * stackTop
Definition: stack.h:107
+ + + + diff --git a/d1/dc2/classstack.js b/d1/dc2/classstack.js new file mode 100644 index 000000000..12890fc58 --- /dev/null +++ b/d1/dc2/classstack.js @@ -0,0 +1,14 @@ +var classstack = +[ + [ "stack", "d1/dc2/classstack.html#a5b64337ec34b12e98458bb9b9d5f8f83", null ], + [ "~stack", "d1/dc2/classstack.html#a0ac1dba9c7019acdc825b31d06eb0b71", null ], + [ "clear", "d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b", null ], + [ "display", "d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628", null ], + [ "isEmptyStack", "d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a", null ], + [ "operator=", "d1/dc2/classstack.html#a61370d5fbaf9ec6bca4a8c114c1058e1", null ], + [ "pop", "d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc", null ], + [ "push", "d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d", null ], + [ "top", "d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344", null ], + [ "size", "d1/dc2/classstack.html#ac512a3efdc84a5f5c9f53905c8e219b0", null ], + [ "stackTop", "d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453", null ] +]; \ No newline at end of file diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.map b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.map new file mode 100644 index 000000000..76db0f0c8 --- /dev/null +++ b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 new file mode 100644 index 000000000..d9b2ea3b3 --- /dev/null +++ b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.md5 @@ -0,0 +1 @@ +b7295061875009c161d79592f78f9f93 \ No newline at end of file diff --git a/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg new file mode 100644 index 000000000..481f9f98d --- /dev/null +++ b/d1/dc2/classstack_a67f65710c376f67d1ba3bde45a9cb628_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +stack::display + + + +Node1 + + +stack::display + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map new file mode 100644 index 000000000..49e71ebc9 --- /dev/null +++ b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 new file mode 100644 index 000000000..41965e583 --- /dev/null +++ b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.md5 @@ -0,0 +1 @@ +55dba1075d9bb162d99cad94b787eecc \ No newline at end of file diff --git a/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg new file mode 100644 index 000000000..c97636ba2 --- /dev/null +++ b/d1/dc2/classstack_a6cd4b95d5de00d41b2491392338384dc_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +stack::pop + + + +Node1 + + +stack::pop + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +stack::isEmptyStack + + + + + +Node1->Node3 + + + + + diff --git a/d1/dc5/classlarge__number__coll__graph.map b/d1/dc5/classlarge__number__coll__graph.map new file mode 100644 index 000000000..7618f3a34 --- /dev/null +++ b/d1/dc5/classlarge__number__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/dc5/classlarge__number__coll__graph.md5 b/d1/dc5/classlarge__number__coll__graph.md5 new file mode 100644 index 000000000..80e266986 --- /dev/null +++ b/d1/dc5/classlarge__number__coll__graph.md5 @@ -0,0 +1 @@ +0e991958ad608f57f8c691742ba4ec9f \ No newline at end of file diff --git a/d1/dc5/classlarge__number__coll__graph.svg b/d1/dc5/classlarge__number__coll__graph.svg new file mode 100644 index 000000000..6bc8fbe6a --- /dev/null +++ b/d1/dc5/classlarge__number__coll__graph.svg @@ -0,0 +1,39 @@ + + + + + + +large_number + + + +Node1 + + +large_number + + + + + +Node2 + + +std::vector< unsigned + char > + + + + + +Node2->Node1 + + + _digits + + + diff --git a/d1/dda/fast__interger__input_8cpp__incl.map b/d1/dda/fast__interger__input_8cpp__incl.map new file mode 100644 index 000000000..7bc1b0ed2 --- /dev/null +++ b/d1/dda/fast__interger__input_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/dda/fast__interger__input_8cpp__incl.md5 b/d1/dda/fast__interger__input_8cpp__incl.md5 new file mode 100644 index 000000000..ed6440f55 --- /dev/null +++ b/d1/dda/fast__interger__input_8cpp__incl.md5 @@ -0,0 +1 @@ +9b2c56b4ddb78fc73944000d83e93239 \ No newline at end of file diff --git a/d1/dda/fast__interger__input_8cpp__incl.svg b/d1/dda/fast__interger__input_8cpp__incl.svg new file mode 100644 index 000000000..46f699659 --- /dev/null +++ b/d1/dda/fast__interger__input_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +others/fast_interger_input.cpp + + + +Node1 + + +others/fast_interger +_input.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d1/df2/structnode-members.html b/d1/df2/structnode-members.html new file mode 100644 index 000000000..bbebf3744 --- /dev/null +++ b/d1/df2/structnode-members.html @@ -0,0 +1,127 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
node< Kind > Member List
+
+
+ +

This is the complete list of members for node< Kind >, including all inherited members.

+ + + + + + + + + + + + + + + + + +
data (defined in node< Kind >)node< Kind >
data (defined in node< Kind >)node< Kind >
data (defined in node< Kind >)node< Kind >
height (defined in node< Kind >)node< Kind >
left (defined in node< Kind >)node< Kind >
left (defined in node< Kind >)node< Kind >
link (defined in node< Kind >)node< Kind >
next (defined in node< Kind >)node< Kind >
next (defined in node< Kind >)node< Kind >
next (defined in node< Kind >)node< Kind >
next (defined in node< Kind >)node< Kind >
node(int d) (defined in node< Kind >)node< Kind >inline
prev (defined in node< Kind >)node< Kind >
right (defined in node< Kind >)node< Kind >
right (defined in node< Kind >)node< Kind >
val (defined in node< Kind >)node< Kind >
+
+ + + + diff --git a/d1/df3/hash__search_8cpp.html b/d1/df3/hash__search_8cpp.html new file mode 100644 index 000000000..cf823ec70 --- /dev/null +++ b/d1/df3/hash__search_8cpp.html @@ -0,0 +1,406 @@ + + + + + + + +Algorithms_in_C++: search/hash_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
hash_search.cpp File Reference
+
+
+ +

Hash Search Algorithm - Best Time Complexity Ω(1) +More...

+
#include <cstdlib>
+#include <iostream>
+
+Include dependency graph for hash_search.cpp:
+
+
+
+
+
+ + + +

+Classes

struct  list
 
+ + + + + + + +

+Macros

+#define MAX   6
 Determines how much data.
 
+#define HASHMAX   5
 Determines the length of the hash table.
 
+ + + + + + +

+Typedefs

typedef struct list node
 
+typedef struct listlink
 pointer to nodes
 
+ + + + + + + + + +

+Functions

int h (int key)
 
void create_list (int key)
 
int hash_search (int key, int *counter)
 
int main ()
 
+ + + + + + + +

+Variables

+int data [MAX] = {1, 10, 15, 5, 8, 7}
 test data
 
+node hashtab [HASHMAX]
 array of nodes
 
+

Detailed Description

+

Hash Search Algorithm - Best Time Complexity Ω(1)

+ +

In this algorithm, we use the method of division and reservation remainder to construct the hash function, and use the method of chain address to solve the conflict, that is, we link a chain list after the data, and store all the records whose keywords are synonyms in the same linear chain list.

+
Warning
This program is only for educational purposes. It has serious flaws in implementation with regards to memory management resulting in large amounts of memory leaks.
+
Todo:
fix the program for memory leaks and better structure in C++ and not C fashion
+

Typedef Documentation

+ +

◆ node

+ +
+
+ + + + +
typedef struct list node
+
+

a one-way linked list define node as one item list

+ +
+
+

Function Documentation

+ +

◆ create_list()

+ +
+
+ + + + + + + + +
void create_list (int key)
+
+

The same after the remainder will be added after the same hash header To avoid conflict, zipper method is used Insert elements into the linked list in the header

Parameters
+ + +
[in]keykey to add to list
+
+
+
Warning
dynamic memory allocated to n never gets freed.
+
Todo:
fix memory leak
+
55  { // Construct hash table
+
56  link p, n;
+
57  int index;
+
58  n = (link)malloc(sizeof(node));
+
59  n->key = key;
+
60  n->next = NULL;
+
61  index = h(key);
+
62  p = hashtab[index].next;
+
63  if (p != NULL) {
+
64  n->next = p;
+
65  hashtab[index].next = n;
+
66  } else {
+
67  hashtab[index].next = n;
+
68  }
+
69 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ h()

+ +
+
+ + + + + + + + +
int h (int key)
+
+

Mode of hash detection : Division method

Parameters
+ + +
[in]keyto hash
+
+
+
Returns
hash value for key
+
45 { return key % HASHMAX; }
+
+
+
+ +

◆ hash_search()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int hash_search (int key,
int * counter 
)
+
+

Input the key to be searched, and get the hash header position through the H (int key) function, then one-dimensional linear search. If found

Returns
element depth and number of searches If not found
+
+-1
+
76  { // Hash lookup function
+
77  link pointer;
+
78  int index;
+
79 
+
80  *counter = 0;
+
81  index = h(key);
+
82  pointer = hashtab[index].next;
+
83 
+
84  std::cout << "data[" << index << "]:";
+
85 
+
86  while (pointer != NULL) {
+
87  counter[0]++;
+
88  std::cout << "data[" << pointer->key << "]:";
+
89  if (pointer->key == key)
+
90  return 1;
+
91  else
+
92  pointer = pointer->next;
+
93  }
+
94 
+
95  return 0;
+
96 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

main function

+
99  {
+
100  link p;
+
101  int key, index, i, counter; // Key is the value to be found
+
102  index = 0;
+
103 
+
104  // You can write the input mode here
+
105  while (index < MAX) { // Construct hash table
+
106  create_list(data[index]);
+
107  index++;
+
108  }
+
109 
+
110  for (i = 0; i < HASHMAX; i++) { // Output hash table
+
111  std::cout << "hashtab [" << i << "]\n";
+
112 
+
113  p = hashtab[i].next;
+
114 
+
115  while (p != NULL) {
+
116  std::cout << "please int key:";
+
117  if (p->key > 0)
+
118  std::cout << "[" << p->key << "]";
+
119  p = p->next;
+
120  }
+
121  std::cout << std::endl;
+
122  }
+
123 
+
124  while (key != -1) {
+
125  // You can write the input mode here
+
126  // test key = 10
+
127  key = 10;
+
128  if (hash_search(key, &counter))
+
129  std::cout << "search time = " << counter << std::endl;
+
130  else
+
131  std::cout << "no found!\n";
+
132  key = -1; // Exit test
+
133  /* The test sample is returned as:
+
134  * data[0]:data[5]:data[15]:data[10]:search time = 3 The search is
+
135  * successful. There are 10 in this set of data */
+
136  }
+
137 
+
138  return 0;
+
139 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
int hash_search(int key, int *counter)
Definition: hash_search.cpp:76
+
STL class.
+
#define HASHMAX
Determines the length of the hash table.
Definition: hash_search.cpp:22
+
Definition: avltree.cpp:13
+
#define MAX
Determines how much data.
Definition: hash_search.cpp:21
+ +
int h(int key)
Definition: hash_search.cpp:45
+
struct list * link
pointer to nodes
+
node hashtab[HASHMAX]
array of nodes
Definition: hash_search.cpp:35
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
T endl(T... args)
+
void create_list(int key)
Definition: hash_search.cpp:55
+
T malloc(T... args)
+ + + + diff --git a/d1/df3/hash__search_8cpp.js b/d1/df3/hash__search_8cpp.js new file mode 100644 index 000000000..078179a28 --- /dev/null +++ b/d1/df3/hash__search_8cpp.js @@ -0,0 +1,14 @@ +var hash__search_8cpp = +[ + [ "list", "d8/d10/structlist.html", "d8/d10/structlist" ], + [ "HASHMAX", "d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367", null ], + [ "MAX", "d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326", null ], + [ "link", "d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6", null ], + [ "node", "d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555", null ], + [ "create_list", "d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5", null ], + [ "h", "d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001", null ], + [ "hash_search", "d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2", null ], + [ "main", "d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "data", "d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243", null ], + [ "hashtab", "d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d", null ] +]; \ No newline at end of file diff --git a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map new file mode 100644 index 000000000..502aa6008 --- /dev/null +++ b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 new file mode 100644 index 000000000..a627facae --- /dev/null +++ b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.md5 @@ -0,0 +1 @@ +719a0fa1f73cf05c2c7f0bb5818caa70 \ No newline at end of file diff --git a/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg new file mode 100644 index 000000000..b6994f271 --- /dev/null +++ b/d1/df3/hash__search_8cpp_a36ea13c16028f18ef2d5ff47f3fda7a2_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +hash_search + + + +Node1 + + +hash_search + + + + + +Node2 + + +h + + + + + +Node1->Node2 + + + + + diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map new file mode 100644 index 000000000..042a1bcad --- /dev/null +++ b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5 b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5 new file mode 100644 index 000000000..d2e21c05c --- /dev/null +++ b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.md5 @@ -0,0 +1 @@ +f486601bc60f8d7e03c49ead19a4d7ae \ No newline at end of file diff --git a/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg new file mode 100644 index 000000000..78ca68cd0 --- /dev/null +++ b/d1/df3/hash__search_8cpp_ad0831425f1389166a9518f422d0c6ec5_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +create_list + + + +Node1 + + +create_list + + + + + +Node2 + + +h + + + + + +Node1->Node2 + + + + + diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..70173a737 --- /dev/null +++ b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..a7619d6a4 --- /dev/null +++ b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +257a1f3236ed3e891fdced482518fb22 \ No newline at end of file diff --git a/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..e46487453 --- /dev/null +++ b/d1/df3/hash__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,88 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +create_list + + + + + +Node1->Node2 + + + + + +Node4 + + +std::endl + + + + + +Node1->Node4 + + + + + +Node5 + + +hash_search + + + + + +Node1->Node5 + + + + + +Node3 + + +h + + + + + +Node2->Node3 + + + + + +Node5->Node3 + + + + + diff --git a/d1/df9/qr__decomposition_8cpp__incl.map b/d1/df9/qr__decomposition_8cpp__incl.map new file mode 100644 index 000000000..470fd1f15 --- /dev/null +++ b/d1/df9/qr__decomposition_8cpp__incl.map @@ -0,0 +1,13 @@ + + + + + + + + + + + + + diff --git a/d1/df9/qr__decomposition_8cpp__incl.md5 b/d1/df9/qr__decomposition_8cpp__incl.md5 new file mode 100644 index 000000000..0140cb41c --- /dev/null +++ b/d1/df9/qr__decomposition_8cpp__incl.md5 @@ -0,0 +1 @@ +9d7124e8d49655be9654967e748b7141 \ No newline at end of file diff --git a/d1/df9/qr__decomposition_8cpp__incl.svg b/d1/df9/qr__decomposition_8cpp__incl.svg new file mode 100644 index 000000000..a87a8c5bb --- /dev/null +++ b/d1/df9/qr__decomposition_8cpp__incl.svg @@ -0,0 +1,191 @@ + + + + + + +numerical_methods/qr_decomposition.cpp + + + +Node1 + + +numerical_methods/qr +_decomposition.cpp + + + + + +Node2 + + +array + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +cstdlib + + + + + +Node1->Node4 + + + + + +Node5 + + +ctime + + + + + +Node1->Node5 + + + + + +Node6 + + +iostream + + + + + +Node1->Node6 + + + + + +Node7 + + +./qr_decompose.h + + + + + +Node1->Node7 + + + + + +Node7->Node3 + + + + + +Node7->Node4 + + + + + +Node7->Node6 + + + + + +Node8 + + +iomanip + + + + + +Node7->Node8 + + + + + +Node9 + + +limits + + + + + +Node7->Node9 + + + + + +Node10 + + +numeric + + + + + +Node7->Node10 + + + + + +Node11 + + +valarray + + + + + +Node7->Node11 + + + + + diff --git a/d2/d05/class_min_heap.html b/d2/d05/class_min_heap.html new file mode 100644 index 000000000..984cff1fe --- /dev/null +++ b/d2/d05/class_min_heap.html @@ -0,0 +1,478 @@ + + + + + + + +Algorithms_in_C++: MinHeap Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
MinHeap Class Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 MinHeap (int capacity)
 
void MinHeapify (int)
 
+int parent (int i)
 
int left (int i)
 
int right (int i)
 
int extractMin ()
 
void decreaseKey (int i, int new_val)
 
int getMin ()
 
void deleteKey (int i)
 
void insertKey (int k)
 
+ + + + + + + + + + +

+Private Attributes

+int * harr
 pointer to array of elements in heap
 
+int capacity
 maximum possible size of min heap
 
+int heap_size
 Current number of elements in min heap.
 
+

Detailed Description

+

A class for Min Heap

+

Constructor & Destructor Documentation

+ +

◆ MinHeap()

+ +
+
+ + + + + + + + +
MinHeap::MinHeap (int cap)
+
+

Constructor

Parameters
+ + +
[in]capacityinitial heap capacity
+
+
+

Constructor: Builds a heap from a given array a[] of given size

+
50  {
+
51  heap_size = 0;
+
52  capacity = cap;
+
53  harr = new int[cap];
+
54 }
+
+
+
+

Member Function Documentation

+ +

◆ decreaseKey()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void MinHeap::decreaseKey (int i,
int new_val 
)
+
+

Decreases key value of key at index i to new_val

+

Decreases value of key at index 'i' to new_val. It is assumed that new_val is smaller than harr[i].

+
78  {
+
79  harr[i] = new_val;
+
80  while (i != 0 && harr[parent(i)] > harr[i]) {
+
81  std::swap(harr[i], harr[parent(i)]);
+
82  i = parent(i);
+
83  }
+
84 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ deleteKey()

+ +
+
+ + + + + + + + +
void MinHeap::deleteKey (int i)
+
+

Deletes a key stored at index i

+

This function deletes key at index i. It first reduced value to minus infinite, then calls extractMin()

+
107  {
+
108  decreaseKey(i, INT_MIN);
+
109  extractMin();
+
110 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ extractMin()

+ +
+
+ + + + + + + +
int MinHeap::extractMin ()
+
+

to extract the root which is the minimum element

+
87  {
+
88  if (heap_size <= 0)
+
89  return INT_MAX;
+
90  if (heap_size == 1) {
+
91  heap_size--;
+
92  return harr[0];
+
93  }
+
94 
+
95  // Store the minimum value, and remove it from heap
+
96  int root = harr[0];
+
97  harr[0] = harr[heap_size - 1];
+
98  heap_size--;
+
99  MinHeapify(0);
+
100 
+
101  return root;
+
102 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ getMin()

+ +
+
+ + + + + +
+ + + + + + + +
int MinHeap::getMin ()
+
+inline
+
+

Returns the minimum key (key at root) from min heap

+
40 { return harr[0]; }
+
+
+
+ +

◆ insertKey()

+ +
+
+ + + + + + + + +
void MinHeap::insertKey (int k)
+
+

Inserts a new key 'k'

+
57  {
+
58  if (heap_size == capacity) {
+
59  std::cout << "\nOverflow: Could not insertKey\n";
+
60  return;
+
61  }
+
62 
+
63  // First insert the new key at the end
+
64  heap_size++;
+
65  int i = heap_size - 1;
+
66  harr[i] = k;
+
67 
+
68  // Fix the min heap property if it is violated
+
69  while (i != 0 && harr[parent(i)] > harr[i]) {
+
70  std::swap(harr[i], harr[parent(i)]);
+
71  i = parent(i);
+
72  }
+
73 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ left()

+ +
+
+ + + + + +
+ + + + + + + + +
int MinHeap::left (int i)
+
+inline
+
+

to get index of left child of node at index i

+
28 { return (2 * i + 1); }
+
+
+
+ +

◆ MinHeapify()

+ +
+
+ + + + + + + + +
void MinHeap::MinHeapify (int i)
+
+

to heapify a subtree with the root at given index

+

A recursive method to heapify a subtree with the root at given index This method assumes that the subtrees are already heapified

+
115  {
+
116  int l = left(i);
+
117  int r = right(i);
+
118  int smallest = i;
+
119  if (l < heap_size && harr[l] < harr[i])
+
120  smallest = l;
+
121  if (r < heap_size && harr[r] < harr[smallest])
+
122  smallest = r;
+
123  if (smallest != i) {
+
124  std::swap(harr[i], harr[smallest]);
+
125  MinHeapify(smallest);
+
126  }
+
127 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ right()

+ +
+
+ + + + + +
+ + + + + + + + +
int MinHeap::right (int i)
+
+inline
+
+

to get index of right child of node at index i

+
31 { return (2 * i + 2); }
+
+
+
+
The documentation for this class was generated from the following file: +
+
+
int heap_size
Current number of elements in min heap.
Definition: binaryheap.cpp:13
+
void decreaseKey(int i, int new_val)
Definition: binaryheap.cpp:78
+
int capacity
maximum possible size of min heap
Definition: binaryheap.cpp:12
+ +
ll k
Definition: matrix_exponentiation.cpp:48
+
int * harr
pointer to array of elements in heap
Definition: binaryheap.cpp:11
+
void MinHeapify(int)
Definition: binaryheap.cpp:115
+
int left(int i)
Definition: binaryheap.cpp:28
+
T swap(T... args)
+
int extractMin()
Definition: binaryheap.cpp:87
+
int right(int i)
Definition: binaryheap.cpp:31
+ + + + diff --git a/d2/d05/class_min_heap.js b/d2/d05/class_min_heap.js new file mode 100644 index 000000000..464af9847 --- /dev/null +++ b/d2/d05/class_min_heap.js @@ -0,0 +1,16 @@ +var class_min_heap = +[ + [ "MinHeap", "d2/d05/class_min_heap.html#ad89ca80a217655a735d266618197965e", null ], + [ "decreaseKey", "d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5", null ], + [ "deleteKey", "d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29", null ], + [ "extractMin", "d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980", null ], + [ "getMin", "d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130", null ], + [ "insertKey", "d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82", null ], + [ "left", "d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca", null ], + [ "MinHeapify", "d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad", null ], + [ "parent", "d2/d05/class_min_heap.html#a0e893f9deb4be4cf4f9990e736483e81", null ], + [ "right", "d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e", null ], + [ "capacity", "d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02", null ], + [ "harr", "d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e", null ], + [ "heap_size", "d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913", null ] +]; \ No newline at end of file diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map new file mode 100644 index 000000000..41cd2047b --- /dev/null +++ b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5 b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5 new file mode 100644 index 000000000..8ef426000 --- /dev/null +++ b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.md5 @@ -0,0 +1 @@ +d7d420966366ced62e7494fdc3f920fc \ No newline at end of file diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg new file mode 100644 index 000000000..3648fde4d --- /dev/null +++ b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph.svg @@ -0,0 +1,206 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +MinHeap::deleteKey + + + +Node1 + + +MinHeap::deleteKey + + + + + +Node2 + + +MinHeap::decreaseKey + + + + + +Node1->Node2 + + + + + +Node4 + + +MinHeap::extractMin + + + + + +Node1->Node4 + + + + + +Node3 + + +std::swap + + + + + +Node2->Node3 + + + + + +Node5 + + +MinHeap::MinHeapify + + + + + +Node4->Node5 + + + + + +Node5->Node3 + + + + + +Node6 + + +MinHeap::left + + + + + +Node5->Node6 + + + + + +Node7 + + +MinHeap::right + + + + + +Node5->Node7 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg new file mode 100644 index 000000000..f81bc8f14 --- /dev/null +++ b/d2/d05/class_min_heap_a37ac126eabb0c3ce04047172abccca29_cgraph_org.svg @@ -0,0 +1,118 @@ + + + + + + +MinHeap::deleteKey + + + +Node1 + + +MinHeap::deleteKey + + + + + +Node2 + + +MinHeap::decreaseKey + + + + + +Node1->Node2 + + + + + +Node4 + + +MinHeap::extractMin + + + + + +Node1->Node4 + + + + + +Node3 + + +std::swap + + + + + +Node2->Node3 + + + + + +Node5 + + +MinHeap::MinHeapify + + + + + +Node4->Node5 + + + + + +Node5->Node3 + + + + + +Node6 + + +MinHeap::left + + + + + +Node5->Node6 + + + + + +Node7 + + +MinHeap::right + + + + + +Node5->Node7 + + + + + diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map new file mode 100644 index 000000000..6abdfb8fe --- /dev/null +++ b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 new file mode 100644 index 000000000..8b85b181a --- /dev/null +++ b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.md5 @@ -0,0 +1 @@ +9b19fdb23a0a9a8079b3ebe438c9619d \ No newline at end of file diff --git a/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg new file mode 100644 index 000000000..b8c036043 --- /dev/null +++ b/d2/d05/class_min_heap_a4014f1edaed0bd7db0c0d2ca53228980_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +MinHeap::extractMin + + + +Node1 + + +MinHeap::extractMin + + + + + +Node2 + + +MinHeap::MinHeapify + + + + + +Node1->Node2 + + + + + +Node3 + + +MinHeap::left + + + + + +Node2->Node3 + + + + + +Node4 + + +MinHeap::right + + + + + +Node2->Node4 + + + + + +Node5 + + +std::swap + + + + + +Node2->Node5 + + + + + diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map new file mode 100644 index 000000000..797a21fb9 --- /dev/null +++ b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5 b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5 new file mode 100644 index 000000000..0588920c3 --- /dev/null +++ b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.md5 @@ -0,0 +1 @@ +079abcec8942fce644afc87238869e91 \ No newline at end of file diff --git a/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg new file mode 100644 index 000000000..b11df99e8 --- /dev/null +++ b/d2/d05/class_min_heap_aa7f726cc6327955d22871592227432f5_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +MinHeap::decreaseKey + + + +Node1 + + +MinHeap::decreaseKey + + + + + +Node2 + + +std::swap + + + + + +Node1->Node2 + + + + + diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map new file mode 100644 index 000000000..49f1cbb4d --- /dev/null +++ b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5 b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5 new file mode 100644 index 000000000..3f527f7fd --- /dev/null +++ b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.md5 @@ -0,0 +1 @@ +d5a31c2962558aa0246cb379c189ad01 \ No newline at end of file diff --git a/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg new file mode 100644 index 000000000..3fe34dcbc --- /dev/null +++ b/d2/d05/class_min_heap_aaef438c1056492cb62c4a4d9035b5cad_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +MinHeap::MinHeapify + + + +Node1 + + +MinHeap::MinHeapify + + + + + +Node2 + + +MinHeap::left + + + + + +Node1->Node2 + + + + + +Node3 + + +MinHeap::right + + + + + +Node1->Node3 + + + + + +Node4 + + +std::swap + + + + + +Node1->Node4 + + + + + diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map new file mode 100644 index 000000000..86877e236 --- /dev/null +++ b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 new file mode 100644 index 000000000..d9cf57624 --- /dev/null +++ b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.md5 @@ -0,0 +1 @@ +6875d5b78d423482dabfbf311d4c6c1c \ No newline at end of file diff --git a/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg new file mode 100644 index 000000000..ffba3d46e --- /dev/null +++ b/d2/d05/class_min_heap_aef78f3384f5a0ae880ad0883d2d44b82_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +MinHeap::insertKey + + + +Node1 + + +MinHeap::insertKey + + + + + +Node2 + + +std::swap + + + + + +Node1->Node2 + + + + + diff --git a/d2/d07/class_bit__coll__graph.map b/d2/d07/class_bit__coll__graph.map new file mode 100644 index 000000000..13af78e54 --- /dev/null +++ b/d2/d07/class_bit__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d2/d07/class_bit__coll__graph.md5 b/d2/d07/class_bit__coll__graph.md5 new file mode 100644 index 000000000..369b2e8b4 --- /dev/null +++ b/d2/d07/class_bit__coll__graph.md5 @@ -0,0 +1 @@ +427190570e081c982a2b8e65b94a704c \ No newline at end of file diff --git a/d2/d07/class_bit__coll__graph.svg b/d2/d07/class_bit__coll__graph.svg new file mode 100644 index 000000000..3fa569ee7 --- /dev/null +++ b/d2/d07/class_bit__coll__graph.svg @@ -0,0 +1,38 @@ + + + + + + +Bit + + + +Node1 + + +Bit + + + + + +Node2 + + +std::vector< int > + + + + + +Node2->Node1 + + + bit + + + diff --git a/d2/d0b/fast__power_8cpp.html b/d2/d0b/fast__power_8cpp.html new file mode 100644 index 000000000..94ece4adc --- /dev/null +++ b/d2/d0b/fast__power_8cpp.html @@ -0,0 +1,301 @@ + + + + + + + +Algorithms_in_C++: math/fast_power.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
fast_power.cpp File Reference
+
+
+ +

Faster computation for \(a^b\). +More...

+
#include <cassert>
+#include <cmath>
+#include <cstdint>
+#include <cstdlib>
+#include <ctime>
+#include <iostream>
+
+Include dependency graph for fast_power.cpp:
+
+
+
+
+
+ + + + + + + + + +

+Functions

template<typename T >
double fast_power_recursive (T a, T b)
 
template<typename T >
double fast_power_linear (T a, T b)
 
int main ()
 
+

Detailed Description

+

Faster computation for \(a^b\).

+

Program that computes \(a^b\) in \(O(logN)\) time. It is based on formula that:

    +
  1. if \(b\) is even: \(a^b = a^\frac{b}{2} \cdot a^\frac{b}{2} = {a^\frac{b}{2}}^2\)
  2. +
  3. if \(b\) is odd: \(a^b = a^\frac{b-1}{2} \cdot a^\frac{b-1}{2} \cdot a = {a^\frac{b-1}{2}}^2 \cdot a\)
  4. +
+

We can compute \(a^b\) recursively using above algorithm.

+

Function Documentation

+ +

◆ fast_power_linear()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
double fast_power_linear (a,
b 
)
+
+

Same algorithm with little different formula. It still calculates in \(O(\log N)\)

+
50  {
+
51  // negative power. a^b = 1 / (a^-b)
+
52  if (b < 0)
+
53  return 1.0 / fast_power_linear(a, -b);
+
54 
+
55  double result = 1;
+
56  while (b) {
+
57  if (b & 1)
+
58  result = result * a;
+
59  a = a * a;
+
60  b = b >> 1;
+
61  }
+
62  return result;
+
63 }
+
+
+
+ +

◆ fast_power_recursive()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
double fast_power_recursive (a,
b 
)
+
+

algorithm implementation for \(a^b\)

+
26  {
+
27  // negative power. a^b = 1 / (a^-b)
+
28  if (b < 0)
+
29  return 1.0 / fast_power_recursive(a, -b);
+
30 
+
31  if (b == 0)
+
32  return 1;
+
33  T bottom = fast_power_recursive(a, b >> 1);
+
34  // Since it is integer division b/2 = (b-1)/2 where b is odd.
+
35  // Therefore, case2 is easily solved by integer division.
+
36 
+
37  double result;
+
38  if ((b & 1) == 0) // case1
+
39  result = bottom * bottom;
+
40  else // case2
+
41  result = bottom * bottom * a;
+
42  return result;
+
43 }
+
+
+
+ +

◆ main()

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

Main function

+
68  {
+
69  std::srand(std::time(nullptr));
+ +
71 
+
72  std::cout << "Testing..." << std::endl;
+
73  for (int i = 0; i < 20; i++) {
+
74  int a = std::rand() % 20 - 10;
+
75  int b = std::rand() % 20 - 10;
+
76  std::cout << std::endl << "Calculating " << a << "^" << b << std::endl;
+
77  assert(fast_power_recursive(a, b) == std::pow(a, b));
+
78  assert(fast_power_linear(a, b) == std::pow(a, b));
+
79 
+
80  std::cout << "------ " << a << "^" << b << " = "
+ +
82  }
+
83 
+
84  int64_t a, b;
+
85  std::cin >> a >> b;
+
86 
+
87  std::cout << a << "^" << b << " = " << fast_power_recursive(a, b)
+
88  << std::endl;
+
89 
+
90  std::cout << a << "^" << b << " = " << fast_power_linear(a, b) << std::endl;
+
91 
+
92  return 0;
+
93 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T srand(T... args)
+
double fast_power_recursive(T a, T b)
Definition: fast_power.cpp:26
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T rand(T... args)
+
T endl(T... args)
+
T sync_with_stdio(T... args)
+
T time(T... args)
+
double fast_power_linear(T a, T b)
Definition: fast_power.cpp:50
+ +
T pow(T... args)
+ + + + diff --git a/d2/d0b/fast__power_8cpp.js b/d2/d0b/fast__power_8cpp.js new file mode 100644 index 000000000..459e4410e --- /dev/null +++ b/d2/d0b/fast__power_8cpp.js @@ -0,0 +1,6 @@ +var fast__power_8cpp = +[ + [ "fast_power_linear", "d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d", null ], + [ "fast_power_recursive", "d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445", null ], + [ "main", "d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..b0defe122 --- /dev/null +++ b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..737ff6ca1 --- /dev/null +++ b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +8a1526b892acf3677d45092bf0fcc1d3 \ No newline at end of file diff --git a/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..6df3a644e --- /dev/null +++ b/d2/d0b/fast__power_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,98 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::rand + + + + + +Node1->Node3 + + + + + +Node4 + + +std::srand + + + + + +Node1->Node4 + + + + + +Node5 + + +std::ios_base::sync +_with_stdio + + + + + +Node1->Node5 + + + + + +Node6 + + +std::time + + + + + +Node1->Node6 + + + + + diff --git a/d2/d22/jump__search_8cpp.html b/d2/d22/jump__search_8cpp.html new file mode 100644 index 000000000..2c4b8d81a --- /dev/null +++ b/d2/d22/jump__search_8cpp.html @@ -0,0 +1,209 @@ + + + + + + + +Algorithms_in_C++: search/jump_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
jump_search.cpp File Reference
+
+
+ +

C++ program to implement Jump Search +More...

+
#include <algorithm>
+#include <cmath>
+#include <iostream>
+
+Include dependency graph for jump_search.cpp:
+
+
+
+
+
+ + + + + +

+Functions

int jumpSearch (int arr[], int x, int n)
 
+int main ()
 
+

Detailed Description

+

C++ program to implement Jump Search

+

Function Documentation

+ +

◆ jumpSearch()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int jumpSearch (int arr[],
int x,
int n 
)
+
+

jump search implementation

+
12  {
+
13  // Finding block size to be jumped
+
14  int step = std::sqrt(n);
+
15 
+
16  // Finding the block where element is
+
17  // present (if it is present)
+
18  int prev = 0;
+
19  while (arr[std::min(step, n) - 1] < x) {
+
20  prev = step;
+
21  step += std::sqrt(n);
+
22  if (prev >= n)
+
23  return -1;
+
24  }
+
25 
+
26  // Doing a linear search for x in block
+
27  // beginning with prev.
+
28  while (arr[prev] < x) {
+
29  prev++;
+
30 
+
31  // If we reached next block or end of
+
32  // array, element is not present.
+
33  if (prev == std::min(step, n))
+
34  return -1;
+
35  }
+
36  // If element is found
+
37  if (arr[prev] == x)
+
38  return prev;
+
39 
+
40  return -1;
+
41 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T sqrt(T... args)
+
T min(T... args)
+
T prev(T... args)
+ + + + diff --git a/d2/d22/jump__search_8cpp.js b/d2/d22/jump__search_8cpp.js new file mode 100644 index 000000000..cab15a289 --- /dev/null +++ b/d2/d22/jump__search_8cpp.js @@ -0,0 +1,5 @@ +var jump__search_8cpp = +[ + [ "jumpSearch", "d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0", null ], + [ "main", "d2/d22/jump__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map new file mode 100644 index 000000000..1047d0ab3 --- /dev/null +++ b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5 b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5 new file mode 100644 index 000000000..636fe69fc --- /dev/null +++ b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.md5 @@ -0,0 +1 @@ +3d29fd226e8064ba8d60b92772c69ca1 \ No newline at end of file diff --git a/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg new file mode 100644 index 000000000..97da7a166 --- /dev/null +++ b/d2/d22/jump__search_8cpp_ab49fd8f401bfc71f63b74711390cccf0_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +jumpSearch + + + +Node1 + + +jumpSearch + + + + + +Node2 + + +std::min + + + + + +Node1->Node2 + + + + + +Node3 + + +std::sqrt + + + + + +Node1->Node3 + + + + + diff --git a/d2/d26/addition__rule_8cpp__incl.map b/d2/d26/addition__rule_8cpp__incl.map new file mode 100644 index 000000000..5781a943a --- /dev/null +++ b/d2/d26/addition__rule_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d2/d26/addition__rule_8cpp__incl.md5 b/d2/d26/addition__rule_8cpp__incl.md5 new file mode 100644 index 000000000..627de54ae --- /dev/null +++ b/d2/d26/addition__rule_8cpp__incl.md5 @@ -0,0 +1 @@ +371f2e285309605032bf7f2e037859fb \ No newline at end of file diff --git a/d2/d26/addition__rule_8cpp__incl.svg b/d2/d26/addition__rule_8cpp__incl.svg new file mode 100644 index 000000000..c558d67b6 --- /dev/null +++ b/d2/d26/addition__rule_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +probability/addition_rule.cpp + + + +Node1 + + +probability/addition +_rule.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d2/d2c/structtower.html b/d2/d2c/structtower.html new file mode 100644 index 000000000..745019614 --- /dev/null +++ b/d2/d2c/structtower.html @@ -0,0 +1,129 @@ + + + + + + + +Algorithms_in_C++: tower Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
tower Struct Reference
+
+
+ + + + + + + + +

+Public Attributes

+int values [10]
 Values in the tower.
 
+int top
 top tower ID
 
+

Detailed Description

+

Define the state of tower

+

The documentation for this struct was generated from the following file: +
+
+ + + + diff --git a/d2/d2c/structtower.js b/d2/d2c/structtower.js new file mode 100644 index 000000000..683f94b60 --- /dev/null +++ b/d2/d2c/structtower.js @@ -0,0 +1,5 @@ +var structtower = +[ + [ "top", "d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d", null ], + [ "values", "d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9", null ] +]; \ No newline at end of file diff --git a/d2/d36/structqueue.html b/d2/d36/structqueue.html new file mode 100644 index 000000000..18f755092 --- /dev/null +++ b/d2/d36/structqueue.html @@ -0,0 +1,517 @@ + + + + + + + +Algorithms_in_C++: queue< Kind > Class Template Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
queue< Kind > Class Template Reference
+
+
+ +

#include <queue.h>

+
+Collaboration diagram for queue< Kind >:
+
+
+
+
[legend]
+ + + + + + + + + + + + + + + + + + +

+Public Member Functions

void display ()
 
 queue ()
 
 ~queue ()
 
bool isEmptyQueue ()
 
void enQueue (Kind item)
 
Kind front ()
 
void deQueue ()
 
void clear ()
 
+ + + + + + + +

+Public Attributes

+nodet [100]
 
+int front
 
+int rear
 
+ + + + + + + +

+Private Attributes

node< Kind > * queueFront
 
node< Kind > * queueRear
 
+int size
 
+

Detailed Description

+

template<class Kind>
+class queue< Kind >

+ +

Definition of the queue class

+

Constructor & Destructor Documentation

+ +

◆ queue()

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + + + + +
queue< Kind >::queue ()
+
+inline
+
+

Default constructor

+
32  {
+
33  queueFront = NULL;
+
34  queueRear = NULL;
+
35  size = 0;
+
36  }
+
+
+
+ +

◆ ~queue()

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + + + + +
queue< Kind >::~queue ()
+
+inline
+
+

Destructor

+
39 {}
+
+
+
+

Member Function Documentation

+ +

◆ clear()

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + + + + +
void queue< Kind >::clear ()
+
+inline
+
+

Clear queue

+
80 { queueFront = NULL; }
+
+
+
+ +

◆ deQueue()

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + + + + +
void queue< Kind >::deQueue ()
+
+inline
+
+

Remove the top element of the queue

+
67  {
+
68  node<Kind> *temp;
+
69  if (!isEmptyQueue()) {
+
70  temp = queueFront;
+
71  queueFront = queueFront->next;
+
72  delete temp;
+
73  size--;
+
74  } else {
+
75  std::cout << "Queue is empty !" << std::endl;
+
76  }
+
77  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ display()

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + + + + +
void queue< Kind >::display ()
+
+inline
+
+

Show queue

+
20  {
+
21  node<Kind> *current = queueFront;
+
22  std::cout << "Front --> ";
+
23  while (current != NULL) {
+
24  std::cout << current->data << " ";
+
25  current = current->next;
+
26  }
+ +
28  std::cout << "Size of queue: " << size << std::endl;
+
29  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ enQueue()

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + + + + + +
void queue< Kind >::enQueue (Kind item)
+
+inline
+
+

Add new item to the queue

+
45  {
+
46  node<Kind> *newNode;
+
47  newNode = new node<Kind>;
+
48  newNode->data = item;
+
49  newNode->next = NULL;
+
50  if (queueFront == NULL) {
+
51  queueFront = newNode;
+
52  queueRear = newNode;
+
53  } else {
+
54  queueRear->next = newNode;
+
55  queueRear = queueRear->next;
+
56  }
+
57  size++;
+
58  }
+
+
+
+ +

◆ front()

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + + + + +
Kind queue< Kind >::front ()
+
+inline
+
+

Return the first element of the queue

+
61  {
+
62  assert(queueFront != NULL);
+
63  return queueFront->data;
+
64  }
+
+
+
+ +

◆ isEmptyQueue()

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + + + + +
bool queue< Kind >::isEmptyQueue ()
+
+inline
+
+

Determine whether the queue is empty

+
42 { return (queueFront == NULL); }
+
+
+
+

Member Data Documentation

+ +

◆ queueFront

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + +
node<Kind>* queue< Kind >::queueFront
+
+private
+
+

Pointer to the front of the queue

+ +
+
+ +

◆ queueRear

+ +
+
+
+template<class Kind >
+ + + + + +
+ + + + +
node<Kind>* queue< Kind >::queueRear
+
+private
+
+

Pointer to the rear of the queue
+

+ +
+
+
The documentation for this class was generated from the following files: +
+
+
Definition: avltree.cpp:13
+
node< Kind > * queueRear
Definition: queue.h:84
+ +
bool isEmptyQueue()
Definition: queue.h:42
+
node< Kind > * queueFront
Definition: queue.h:83
+
T endl(T... args)
+ + + + diff --git a/d2/d36/structqueue.js b/d2/d36/structqueue.js new file mode 100644 index 000000000..38858d353 --- /dev/null +++ b/d2/d36/structqueue.js @@ -0,0 +1,17 @@ +var structqueue = +[ + [ "queue", "d2/d36/structqueue.html#a21381ee7f95daae0332665914780e970", null ], + [ "~queue", "d2/d36/structqueue.html#ad215eee654953d25150bb25d5ac12b7c", null ], + [ "clear", "d2/d36/structqueue.html#ab2019d91e28c06de325fb3076b93a930", null ], + [ "deQueue", "d2/d36/structqueue.html#a089d4af5532e0a801f560070da6e1f86", null ], + [ "display", "d2/d36/structqueue.html#a26f48801df462ade003b50739196fa4c", null ], + [ "enQueue", "d2/d36/structqueue.html#a592c0580551ec0d3b4d43e8198d8a377", null ], + [ "front", "d2/d36/structqueue.html#a36d47fdbedc199609818385110d9f922", null ], + [ "isEmptyQueue", "d2/d36/structqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31", null ], + [ "front", "d2/d36/structqueue.html#a5e48e536f1fce666f59e78c16183d586", null ], + [ "queueFront", "d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5", null ], + [ "queueRear", "d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5", null ], + [ "rear", "d2/d36/structqueue.html#ad3f87c5be45a8c56252ecc96847871a8", null ], + [ "size", "d2/d36/structqueue.html#ab45a4bfef7eba256a9c027bae86fc196", null ], + [ "t", "d2/d36/structqueue.html#ac330f181d25faba50a95d181ca12f42d", null ] +]; \ No newline at end of file diff --git a/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.map b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.map new file mode 100644 index 000000000..731c20171 --- /dev/null +++ b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.md5 b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.md5 new file mode 100644 index 000000000..98bd7110a --- /dev/null +++ b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.md5 @@ -0,0 +1 @@ +f187d2ce1ee81ebaf9b9eec3a9b6d3b3 \ No newline at end of file diff --git a/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg new file mode 100644 index 000000000..ab02e3f55 --- /dev/null +++ b/d2/d36/structqueue_a089d4af5532e0a801f560070da6e1f86_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +queue::deQueue + + + +Node1 + + +queue::deQueue + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +queue::isEmptyQueue + + + + + +Node1->Node3 + + + + + diff --git a/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.map b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.map new file mode 100644 index 000000000..f5560df96 --- /dev/null +++ b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.md5 b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.md5 new file mode 100644 index 000000000..5ad74c8c0 --- /dev/null +++ b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.md5 @@ -0,0 +1 @@ +28b222a5f48788cf436ad67126641845 \ No newline at end of file diff --git a/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg new file mode 100644 index 000000000..9c4bcb3c4 --- /dev/null +++ b/d2/d36/structqueue_a26f48801df462ade003b50739196fa4c_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +queue::display + + + +Node1 + + +queue::display + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d2/d3b/namespaceqr__algorithm.html b/d2/d3b/namespaceqr__algorithm.html new file mode 100644 index 000000000..de9940b34 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm.html @@ -0,0 +1,634 @@ + + + + + + + +Algorithms_in_C++: qr_algorithm Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
qr_algorithm Namespace Reference
+
+
+ +

Functions to compute QR decomposition of any rectangular matrix. +More...

+ + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
std::ostreamoperator<< (std::ostream &out, std::valarray< std::valarray< T >> const &v)
 
template<typename T >
std::ostreamoperator<< (std::ostream &out, std::valarray< T > const &v)
 
template<typename T >
double vector_dot (const std::valarray< T > &a, const std::valarray< T > &b)
 
template<typename T >
double vector_mag (const std::valarray< T > &a)
 
template<typename T >
std::valarray< T > vector_proj (const std::valarray< T > &a, const std::valarray< T > &b)
 
template<typename T >
void qr_decompose (const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
 
std::valarray< double > eigen_values (std::valarray< std::valarray< double >> *A, bool print_intermediates=false)
 
+

Detailed Description

+

Functions to compute QR decomposition of any rectangular matrix.

+

Function Documentation

+ +

◆ eigen_values()

+ +
+
+ + + + + + + + + + + + + + + + + + +
std::valarray<double> qr_algorithm::eigen_values (std::valarray< std::valarray< double >> * A,
bool print_intermediates = false 
)
+
+

Compute eigen values using iterative shifted QR decomposition algorithm as follows:

    +
  1. Use last diagonal element of A as eigen value approximation \(c\)
  2. +
  3. Shift diagonals of matrix \(A' = A - cI\)
  4. +
  5. Decompose matrix \(A'=QR\)
  6. +
  7. Compute next approximation \(A'_1 = RQ \)
  8. +
  9. Shift diagonals back \(A_1 = A'_1 + cI\)
  10. +
  11. Termination condition check: last element below diagonal is almost 0
      +
    1. If not 0, go back to step 1 with the new approximation \(A_1\)
    2. +
    3. If 0, continue to step 7
    4. +
    +
  12. +
  13. Save last known \(c\) as the eigen value.
  14. +
  15. Are all eigen values found?
      +
    1. If not, remove last row and column of \(A_1\) and go back to step 1.
    2. +
    3. If yes, stop.
    4. +
    +
  16. +
+
Note
The matrix \(A\) gets modified
+
Parameters
+ + + +
[in,out]Amatrix to compute eigen values for
[in]print_intermediates(optional) whether to print intermediate A, Q and R matrices (default = false)
+
+
+
99  {
+
100  int rows = A->size();
+
101  int columns = rows;
+
102  int counter = 0, num_eigs = rows - 1;
+
103  double last_eig = 0;
+
104 
+ + +
107 
+
108  /* number of eigen values = matrix size */
+
109  std::valarray<double> eigen_vals(rows);
+
110  for (int i = 0; i < rows; i++) {
+
111  Q[i] = std::valarray<double>(columns);
+
112  R[i] = std::valarray<double>(columns);
+
113  }
+
114 
+
115  /* continue till all eigen values are found */
+
116  while (num_eigs > 0) {
+
117  /* iterate with QR decomposition */
+
118  while (std::abs(A[0][num_eigs][num_eigs - 1]) >
+ +
120  // initial approximation = last diagonal element
+
121  last_eig = A[0][num_eigs][num_eigs];
+
122  for (int i = 0; i < rows; i++) {
+
123  A[0][i][i] -= last_eig; /* A - cI */
+
124  }
+
125 
+
126  qr_decompose(*A, &Q, &R);
+
127 
+
128  if (print_intermediates) {
+
129  std::cout << *A << "\n";
+
130  std::cout << Q << "\n";
+
131  std::cout << R << "\n";
+
132  printf("-------------------- %d ---------------------\n",
+
133  ++counter);
+
134  }
+
135 
+
136  // new approximation A' = R * Q
+
137  mat_mul(R, Q, A);
+
138 
+
139  for (int i = 0; i < rows; i++) {
+
140  A[0][i][i] += last_eig; /* A + cI */
+
141  }
+
142  }
+
143 
+
144  /* store the converged eigen value */
+
145  eigen_vals[num_eigs] = last_eig;
+
146  // A[0][num_eigs][num_eigs];
+
147  if (print_intermediates) {
+
148  std::cout << "========================\n";
+
149  std::cout << "Eigen value: " << last_eig << ",\n";
+
150  std::cout << "========================\n";
+
151  }
+
152 
+
153  num_eigs--;
+
154  rows--;
+
155  columns--;
+
156  }
+
157  eigen_vals[0] = A[0][0][0];
+
158 
+
159  if (print_intermediates) {
+
160  std::cout << Q << "\n";
+
161  std::cout << R << "\n";
+
162  }
+
163 
+
164  return eigen_vals;
+
165 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator<<() [1/2]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::ostream& qr_algorithm::operator<< (std::ostreamout,
std::valarray< std::valarray< T >> const & v 
)
+
+

operator to print a matrix

+
34  {
+
35  const int width = 12;
+
36  const char separator = ' ';
+
37 
+
38  out.precision(4);
+
39  for (size_t row = 0; row < v.size(); row++) {
+
40  for (size_t col = 0; col < v[row].size(); col++)
+
41  out << std::right << std::setw(width) << std::setfill(separator)
+
42  << v[row][col];
+
43  out << std::endl;
+
44  }
+
45 
+
46  return out;
+
47 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator<<() [2/2]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::ostream& qr_algorithm::operator<< (std::ostreamout,
std::valarray< T > const & v 
)
+
+

operator to print a vector

+
53  {
+
54  const int width = 10;
+
55  const char separator = ' ';
+
56 
+
57  out.precision(4);
+
58  for (size_t row = 0; row < v.size(); row++) {
+
59  out << std::right << std::setw(width) << std::setfill(separator)
+
60  << v[row];
+
61  }
+
62 
+
63  return out;
+
64 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ qr_decompose()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + + + + + + + +
void qr_algorithm::qr_decompose (const std::valarray< std::valarray< T >> & A,
std::valarray< std::valarray< T >> * Q,
std::valarray< std::valarray< T >> * R 
)
+
+

Decompose matrix \(A\) using Gram-Schmidt process.

+

+\begin{eqnarray*} \text{given that}\quad A &=& *\left[\mathbf{a}_1,\mathbf{a}_2,\ldots,\mathbf{a}_{N-1},\right]\\ \text{where}\quad\mathbf{a}_i &=& \left[a_{0i},a_{1i},a_{2i},\ldots,a_{(M-1)i}\right]^T\quad\ldots\mbox{(column vectors)}\\ \text{then}\quad\mathbf{u}_i &=& \mathbf{a}_i *-\sum_{j=0}^{i-1}\text{proj}_{\mathbf{u}_j}\mathbf{a}_i\\ \mathbf{e}_i &=&\frac{\mathbf{u}_i}{\left|\mathbf{u}_i\right|}\\ Q &=& \begin{bmatrix}\mathbf{e}_0 & \mathbf{e}_1 & \mathbf{e}_2 & \dots & \mathbf{e}_{N-1}\end{bmatrix}\\ R &=& \begin{bmatrix}\langle\mathbf{e}_0\,,\mathbf{a}_0\rangle & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots \\ 0 & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\ 0 & 0 & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\ \vdots & \vdots & \vdots & \ddots \end{bmatrix}\\ \end{eqnarray*} +

+
Parameters
+ + + + +
Ainput matrix to decompose
Qoutput decomposed matrix
Routput decomposed matrix
+
+
+
150  {
+
151  std::size_t ROWS = A.size(); // number of rows of A
+
152  std::size_t COLUMNS = A[0].size(); // number of columns of A
+
153  std::valarray<T> col_vector(ROWS);
+
154  std::valarray<T> col_vector2(ROWS);
+
155  std::valarray<T> tmp_vector(ROWS);
+
156 
+
157  for (int i = 0; i < COLUMNS; i++) {
+
158  /* for each column => R is a square matrix of NxN */
+
159  int j;
+
160  R[0][i] = 0.; /* make R upper triangular */
+
161 
+
162  /* get corresponding Q vector */
+
163 #ifdef _OPENMP
+
164 // parallelize on threads
+
165 #pragma omp for
+
166 #endif
+
167  for (j = 0; j < ROWS; j++) {
+
168  tmp_vector[j] = A[j][i]; /* accumulator for uk */
+
169  col_vector[j] = A[j][i];
+
170  }
+
171  for (j = 0; j < i; j++) {
+
172  for (int k = 0; k < ROWS; k++) {
+
173  col_vector2[k] = Q[0][k][j];
+
174  }
+
175  col_vector2 = vector_proj(col_vector, col_vector2);
+
176  tmp_vector -= col_vector2;
+
177  }
+
178 
+
179  double mag = vector_mag(tmp_vector);
+
180 
+
181 #ifdef _OPENMP
+
182 // parallelize on threads
+
183 #pragma omp for
+
184 #endif
+
185  for (j = 0; j < ROWS; j++) Q[0][j][i] = tmp_vector[j] / mag;
+
186 
+
187  /* compute upper triangular values of R */
+
188 #ifdef _OPENMP
+
189 // parallelize on threads
+
190 #pragma omp for
+
191 #endif
+
192  for (int kk = 0; kk < ROWS; kk++) {
+
193  col_vector[kk] = Q[0][kk][i];
+
194  }
+
195 
+
196 #ifdef _OPENMP
+
197 // parallelize on threads
+
198 #pragma omp for
+
199 #endif
+
200  for (int k = i; k < COLUMNS; k++) {
+
201  for (int kk = 0; kk < ROWS; kk++) {
+
202  col_vector2[kk] = A[kk][k];
+
203  }
+
204  R[0][i][k] = (col_vector * col_vector2).sum();
+
205  }
+
206  }
+
207 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ vector_dot()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double qr_algorithm::vector_dot (const std::valarray< T > & a,
const std::valarray< T > & b 
)
+
+inline
+
+

Compute dot product of two vectors of equal lengths

+

If \(\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\) and \(\vec{b}=\left[b_0,b_1,b_1,...,b_L\right]\) then \(\vec{a}\cdot\vec{b}=\displaystyle\sum_{i=0}^L a_i\times b_i\)

+
Returns
\(\vec{a}\cdot\vec{b}\)
+
76  {
+
77  return (a * b).sum();
+
78  // could also use following
+
79  // return std::inner_product(std::begin(a), std::end(a), std::begin(b),
+
80  // 0.f);
+
81 }
+
+
+
+ +

◆ vector_mag()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
double qr_algorithm::vector_mag (const std::valarray< T > & a)
+
+inline
+
+

Compute magnitude of vector.

+

If \(\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\) then \(\left|\vec{a}\right|=\sqrt{\displaystyle\sum_{i=0}^L a_i^2}\)

+
Returns
\(\left|\vec{a}\right|\)
+
92  {
+
93  double dot = vector_dot(a, a);
+
94  return std::sqrt(dot);
+
95 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ vector_proj()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::valarray<T> qr_algorithm::vector_proj (const std::valarray< T > & a,
const std::valarray< T > & b 
)
+
+

Compute projection of vector \(\vec{a}\) on \(\vec{b}\) defined as

+\[\text{proj}_\vec{b}\vec{a}=\frac{\vec{a}\cdot\vec{b}}{\left|\vec{b}\right|^2}\vec{b}\] +

+
Returns
NULL if error, otherwise pointer to output
+

check for division by zero using machine epsilon

+
105  {
+
106  double num = vector_dot(a, b);
+
107  double deno = vector_dot(b, b);
+
108 
+
109  /*! check for division by zero using machine epsilon */
+
110  if (deno <= std::numeric_limits<double>::epsilon()) {
+
111  std::cerr << "[" << __func__ << "] Possible division by zero\n";
+
112  return a; // return vector a back
+
113  }
+
114 
+
115  double scalar = num / deno;
+
116 
+
117  return b * scalar;
+
118 }
+
+
+
+
+
+
T setfill(T... args)
+
void mat_mul(const std::valarray< std::valarray< double >> &A, const std::valarray< std::valarray< double >> &B, std::valarray< std::valarray< double >> *OUT)
Definition: qr_eigen_values.cpp:54
+
T sqrt(T... args)
+
T printf(T... args)
+
std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:104
+ +
double vector_mag(const std::valarray< T > &a)
Definition: qr_decompose.h:92
+
ll k
Definition: matrix_exponentiation.cpp:48
+
STL class.
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+
double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:76
+
T right(T... args)
+
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
+ +
T setw(T... args)
+ + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.map b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.map new file mode 100644 index 000000000..db78719c1 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5 new file mode 100644 index 000000000..b9df66db3 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.md5 @@ -0,0 +1 @@ +c188dd63efb3bd8c28af5b09f11c458a \ No newline at end of file diff --git a/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg new file mode 100644 index 000000000..9cdd4eb84 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a240edf2b6b5942c0e5f2c9d3e326797f_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +qr_algorithm::operator<< + + + +Node1 + + +qr_algorithm::operator<< + + + + + +Node2 + + +std::right + + + + + +Node1->Node2 + + + + + +Node3 + + +std::setfill + + + + + +Node1->Node3 + + + + + +Node4 + + +std::setw + + + + + +Node1->Node4 + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.map b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.map new file mode 100644 index 000000000..d24d7d7b4 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.md5 new file mode 100644 index 000000000..a1c4e0099 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.md5 @@ -0,0 +1 @@ +3c8195a16666a20a829d5692b1be9d34 \ No newline at end of file diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg new file mode 100644 index 000000000..0ed72128d --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph.svg @@ -0,0 +1,201 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +qr_algorithm::eigen_values + + + +Node1 + + +qr_algorithm::eigen +_values + + + + + +Node2 + + +mat_mul + + + + + +Node1->Node2 + + + + + +Node3 + + +qr_algorithm::qr_decompose + + + + + +Node1->Node3 + + + + + +Node4 + + +qr_algorithm::vector_mag + + + + + +Node3->Node4 + + + + + +Node7 + + +qr_algorithm::vector_proj + + + + + +Node3->Node7 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6 + + +qr_algorithm::vector_dot + + + + + +Node4->Node6 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg new file mode 100644 index 000000000..1196c1abf --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a763896dbb4a7e95c4a1e614ac0819d66_cgraph_org.svg @@ -0,0 +1,113 @@ + + + + + + +qr_algorithm::eigen_values + + + +Node1 + + +qr_algorithm::eigen +_values + + + + + +Node2 + + +mat_mul + + + + + +Node1->Node2 + + + + + +Node3 + + +qr_algorithm::qr_decompose + + + + + +Node1->Node3 + + + + + +Node4 + + +qr_algorithm::vector_mag + + + + + +Node3->Node4 + + + + + +Node7 + + +qr_algorithm::vector_proj + + + + + +Node3->Node7 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6 + + +qr_algorithm::vector_dot + + + + + +Node4->Node6 + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.map b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.map new file mode 100644 index 000000000..da130d912 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.md5 new file mode 100644 index 000000000..7009851dd --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.md5 @@ -0,0 +1 @@ +26dca506326fcc0e84fc34700e6006ca \ No newline at end of file diff --git a/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg new file mode 100644 index 000000000..ddd21d6c9 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_a7c63c78d6839b8ad73b77c161210b514_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +qr_algorithm::operator<< + + + +Node1 + + +qr_algorithm::operator<< + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::right + + + + + +Node1->Node3 + + + + + +Node4 + + +std::setfill + + + + + +Node1->Node4 + + + + + +Node5 + + +std::setw + + + + + +Node1->Node5 + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.map b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.map new file mode 100644 index 000000000..2fbb754d5 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.md5 new file mode 100644 index 000000000..942ffe2e9 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.md5 @@ -0,0 +1 @@ +5316cb853ca8b338ac154ba9b430dee4 \ No newline at end of file diff --git a/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg new file mode 100644 index 000000000..e81748c9b --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_ab1ac74497ffb2101040cc1efe3546de8_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +qr_algorithm::qr_decompose + + + +Node1 + + +qr_algorithm::qr_decompose + + + + + +Node2 + + +qr_algorithm::vector_mag + + + + + +Node1->Node2 + + + + + +Node5 + + +qr_algorithm::vector_proj + + + + + +Node1->Node5 + + + + + +Node3 + + +std::sqrt + + + + + +Node2->Node3 + + + + + +Node4 + + +qr_algorithm::vector_dot + + + + + +Node2->Node4 + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map new file mode 100644 index 000000000..7e8a08cfb --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5 b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5 new file mode 100644 index 000000000..4747a41bd --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.md5 @@ -0,0 +1 @@ +2e215d06c8343f47b8ed9e40ac51a001 \ No newline at end of file diff --git a/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg new file mode 100644 index 000000000..d72fc49e1 --- /dev/null +++ b/d2/d3b/namespaceqr__algorithm_ad16da2183db22378435042f26af43d5f_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +qr_algorithm::vector_mag + + + +Node1 + + +qr_algorithm::vector_mag + + + + + +Node2 + + +std::sqrt + + + + + +Node1->Node2 + + + + + +Node3 + + +qr_algorithm::vector_dot + + + + + +Node1->Node3 + + + + + diff --git a/d2/d66/binary__search_8cpp__incl.map b/d2/d66/binary__search_8cpp__incl.map new file mode 100644 index 000000000..0da15b325 --- /dev/null +++ b/d2/d66/binary__search_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d2/d66/binary__search_8cpp__incl.md5 b/d2/d66/binary__search_8cpp__incl.md5 new file mode 100644 index 000000000..56067daba --- /dev/null +++ b/d2/d66/binary__search_8cpp__incl.md5 @@ -0,0 +1 @@ +0bb21284fc3084cdc006e78d52ed1561 \ No newline at end of file diff --git a/d2/d66/binary__search_8cpp__incl.svg b/d2/d66/binary__search_8cpp__incl.svg new file mode 100644 index 000000000..505709a11 --- /dev/null +++ b/d2/d66/binary__search_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +search/binary_search.cpp + + + +Node1 + + +search/binary_search.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d2/d89/median__search_8cpp__incl.map b/d2/d89/median__search_8cpp__incl.map new file mode 100644 index 000000000..994163d7a --- /dev/null +++ b/d2/d89/median__search_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d2/d89/median__search_8cpp__incl.md5 b/d2/d89/median__search_8cpp__incl.md5 new file mode 100644 index 000000000..2da10a2dd --- /dev/null +++ b/d2/d89/median__search_8cpp__incl.md5 @@ -0,0 +1 @@ +88dfec9ce92bf01fc71095ea717fc950 \ No newline at end of file diff --git a/d2/d89/median__search_8cpp__incl.svg b/d2/d89/median__search_8cpp__incl.svg new file mode 100644 index 000000000..a89738904 --- /dev/null +++ b/d2/d89/median__search_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +search/median_search.cpp + + + +Node1 + + +search/median_search.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + diff --git a/d2/dc4/classstack__linked_list.html b/d2/dc4/classstack__linked_list.html new file mode 100644 index 000000000..14fb0c0b4 --- /dev/null +++ b/d2/dc4/classstack__linked_list.html @@ -0,0 +1,144 @@ + + + + + + + +Algorithms_in_C++: stack_linkedList Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
stack_linkedList Class Reference
+
+
+
+Collaboration diagram for stack_linkedList:
+
+
+
+
[legend]
+ + + + + + + + +

+Public Member Functions

+void enqueue (int)
 
+int dequeue ()
 
+void display ()
 
+ + + + + +

+Public Attributes

+linkedlistfront
 
+linkedlistrear
 
+
The documentation for this class was generated from the following file:
    +
  • data_structures/queue_using_linkedlist.cpp
  • +
+
+
+ + + + diff --git a/d2/dc4/classstack__linked_list.js b/d2/dc4/classstack__linked_list.js new file mode 100644 index 000000000..e5037602d --- /dev/null +++ b/d2/dc4/classstack__linked_list.js @@ -0,0 +1,9 @@ +var classstack__linked_list = +[ + [ "stack_linkedList", "d2/dc4/classstack__linked_list.html#a44c1c5a34c5fb553025a33abe4f2e819", null ], + [ "dequeue", "d2/dc4/classstack__linked_list.html#af12688f7e4d74a978c93d5b26199a208", null ], + [ "display", "d2/dc4/classstack__linked_list.html#a565e79ec7a9d949664277afda874cf7c", null ], + [ "enqueue", "d2/dc4/classstack__linked_list.html#a1d32f339f2b90dea16f89282db7074e5", null ], + [ "front", "d2/dc4/classstack__linked_list.html#a445c8ffd4a85bf74a5d5f7b7e716f06d", null ], + [ "rear", "d2/dc4/classstack__linked_list.html#aa34ec2024dcfe130e6458149093772b3", null ] +]; \ No newline at end of file diff --git a/d2/dcf/namespacestatistics.html b/d2/dcf/namespacestatistics.html new file mode 100644 index 000000000..be6fec610 --- /dev/null +++ b/d2/dcf/namespacestatistics.html @@ -0,0 +1,124 @@ + + + + + + + +Algorithms_in_C++: statistics Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
statistics Namespace Reference
+
+
+ +

Statistical algorithms. +More...

+ + + + + + +

+Classes

class  stats_computer1
 
class  stats_computer2
 
+

Detailed Description

+

Statistical algorithms.

+
+
+ + + + diff --git a/d2/dcf/namespacestatistics.js b/d2/dcf/namespacestatistics.js new file mode 100644 index 000000000..bbe11feec --- /dev/null +++ b/d2/dcf/namespacestatistics.js @@ -0,0 +1,5 @@ +var namespacestatistics = +[ + [ "stats_computer1", "d7/d7c/classstatistics_1_1stats__computer1.html", "d7/d7c/classstatistics_1_1stats__computer1" ], + [ "stats_computer2", "d8/dab/classstatistics_1_1stats__computer2.html", "d8/dab/classstatistics_1_1stats__computer2" ] +]; \ No newline at end of file diff --git a/d2/ddd/gaussian__elimination_8cpp__incl.map b/d2/ddd/gaussian__elimination_8cpp__incl.map new file mode 100644 index 000000000..8abd7a994 --- /dev/null +++ b/d2/ddd/gaussian__elimination_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d2/ddd/gaussian__elimination_8cpp__incl.md5 b/d2/ddd/gaussian__elimination_8cpp__incl.md5 new file mode 100644 index 000000000..669b5696f --- /dev/null +++ b/d2/ddd/gaussian__elimination_8cpp__incl.md5 @@ -0,0 +1 @@ +1204bbacecdb09d77f6d02ecdbb061cc \ No newline at end of file diff --git a/d2/ddd/gaussian__elimination_8cpp__incl.svg b/d2/ddd/gaussian__elimination_8cpp__incl.svg new file mode 100644 index 000000000..c72117346 --- /dev/null +++ b/d2/ddd/gaussian__elimination_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +numerical_methods/gaussian_elimination.cpp + + + +Node1 + + +numerical_methods/gaussian +_elimination.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d2/def/prime__factorization_8cpp__incl.map b/d2/def/prime__factorization_8cpp__incl.map new file mode 100644 index 000000000..3cd7966cf --- /dev/null +++ b/d2/def/prime__factorization_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d2/def/prime__factorization_8cpp__incl.md5 b/d2/def/prime__factorization_8cpp__incl.md5 new file mode 100644 index 000000000..fcb9ce15c --- /dev/null +++ b/d2/def/prime__factorization_8cpp__incl.md5 @@ -0,0 +1 @@ +8c662fca52c008d09b615fd2f3632535 \ No newline at end of file diff --git a/d2/def/prime__factorization_8cpp__incl.svg b/d2/def/prime__factorization_8cpp__incl.svg new file mode 100644 index 000000000..557fbd493 --- /dev/null +++ b/d2/def/prime__factorization_8cpp__incl.svg @@ -0,0 +1,82 @@ + + + + + + +math/prime_factorization.cpp + + + +Node1 + + +math/prime_factorization.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cstring + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +vector + + + + + +Node1->Node5 + + + + + diff --git a/d3/d06/ode__semi__implicit__euler_8cpp.html b/d3/d06/ode__semi__implicit__euler_8cpp.html new file mode 100644 index 000000000..66572eeb1 --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp.html @@ -0,0 +1,414 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/ode_semi_implicit_euler.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
ode_semi_implicit_euler.cpp File Reference
+
+
+ +

Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method +More...

+
#include <cmath>
+#include <ctime>
+#include <fstream>
+#include <iostream>
+#include <valarray>
+
+Include dependency graph for ode_semi_implicit_euler.cpp:
+
+
+
+
+
+ + + + + + + + + + + + + + + + + +

+Functions

void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Problem statement for a system with first-order differential equations. Updates the system differential variables. More...
 
void exact_solution (const double &x, std::valarray< double > *y)
 Exact solution of the problem. Used for solution comparison. More...
 
void semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Compute next step approximation using the semi-implicit-Euler method. More...
 
double semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
 Compute approximation using the semi-implicit-Euler method in the given limits. More...
 
void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
 
int main (int argc, char *argv[])
 
+

Detailed Description

+

Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method

+
Authors
Krishna Vedala
+

The ODE being solved is:

+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*} +

+

The exact solution for the above problem is:

+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*} +

+

The computation results are stored to a text file semi_implicit_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

+

To implement Van der Pol oscillator, change the problem function to:

const double mu = 2.0;
+
dy[0] = y[1];
+
dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
+
See also
ode_midpoint_euler.cpp, ode_forward_euler.cpp
+

Function Documentation

+ +

◆ exact_solution()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void exact_solution (const double & x,
std::valarray< double > * y 
)
+
+ +

Exact solution of the problem. Used for solution comparison.

+
Parameters
+ + + +
[in]xindependent variable
[in,out]ydependent variable
+
+
+
66  {
+
67  y[0][0] = std::cos(x);
+
68  y[0][1] = -std::sin(x);
+
69 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main Function

+
189  {
+
190  double X0 = 0.f; /* initial value of x0 */
+
191  double X_MAX = 10.F; /* upper limit of integration */
+
192  std::valarray<double> Y0 = {1.f, 0.f}; /* initial value Y = y(x = x_0) */
+
193  double step_size;
+
194 
+
195  if (argc == 1) {
+
196  std::cout << "\nEnter the step size: ";
+
197  std::cin >> step_size;
+
198  } else {
+
199  // use commandline argument as independent variable step size
+
200  step_size = std::atof(argv[1]);
+
201  }
+
202 
+
203  // get approximate solution
+
204  double total_time = semi_implicit_euler(step_size, X0, X_MAX, &Y0, true);
+
205  std::cout << "\tTime = " << total_time << " ms\n";
+
206 
+
207  /* compute exact solution for comparion */
+
208  save_exact_solution(X0, X_MAX, step_size, Y0);
+
209 
+
210  return 0;
+
211 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ problem()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void problem (const double & x,
std::valarray< double > * y,
std::valarray< double > * dy 
)
+
+ +

Problem statement for a system with first-order differential equations. Updates the system differential variables.

+
Note
This function can be updated to and ode of any order.
+
Parameters
+ + + + +
[in]xindependent variable(s)
[in,out]ydependent variable(s)
[in,out]dyfirst-derivative of dependent variable(s)
+
+
+
54  {
+
55  const double omega = 1.F; // some const for the problem
+
56  dy[0][0] = y[0][1]; // x dot
+
57  dy[0][1] = -omega * omega * y[0][0]; // y dot
+
58 }
+
+
+
+ +

◆ save_exact_solution()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void save_exact_solution (const double & X0,
const double & X_MAX,
const double & step_size,
const std::valarray< double > & Y0 
)
+
+

Function to compute and save exact solution for comparison

+
Parameters
+ + + + + +
[in]X0initial value of independent variable
[in]X_MAXfinal value of independent variable
[in]step_sizeindependent variable step size
[in]Y0initial values of dependent variables
+
+
+
155  {
+
156  double x = X0;
+
157  std::valarray<double> y = Y0;
+
158 
+
159  std::ofstream fp("exact.csv", std::ostream::out);
+
160  if (!fp.is_open()) {
+
161  std::perror("Error! ");
+
162  return;
+
163  }
+
164  std::cout << "Finding exact solution\n";
+
165 
+
166  std::clock_t t1 = std::clock();
+
167  do {
+
168  fp << x << ",";
+
169  for (int i = 0; i < y.size() - 1; i++) {
+
170  fp << y[i] << ",";
+
171  }
+
172  fp << y[y.size() - 1] << "\n";
+
173 
+
174  exact_solution(x, &y);
+
175 
+
176  x += step_size;
+
177  } while (x <= X_MAX);
+
178 
+
179  std::clock_t t2 = std::clock();
+
180  double total_time = static_cast<double>(t2 - t1) / CLOCKS_PER_SEC;
+
181  std::cout << "\tTime = " << total_time << " ms\n";
+
182 
+
183  fp.close();
+
184 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
double semi_implicit_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the semi-implicit-Euler method in the given limits.
Definition: ode_semi_implicit_euler.cpp:103
+ +
T cos(T... args)
+
T atof(T... args)
+
T clock(T... args)
+ +
STL class.
+
T perror(T... args)
+
STL class.
+
T sin(T... args)
+
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_semi_implicit_euler.cpp:153
+
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_semi_implicit_euler.cpp:66
+ + + + + diff --git a/d3/d06/ode__semi__implicit__euler_8cpp.js b/d3/d06/ode__semi__implicit__euler_8cpp.js new file mode 100644 index 000000000..b66a59090 --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp.js @@ -0,0 +1,9 @@ +var ode__semi__implicit__euler_8cpp = +[ + [ "exact_solution", "d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b", null ], + [ "main", "d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "problem", "d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe", null ], + [ "save_exact_solution", "d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f", null ], + [ "semi_implicit_euler", "d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089", null ], + [ "semi_implicit_euler_step", "d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f", null ] +]; \ No newline at end of file diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map new file mode 100644 index 000000000..697688c3d --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map @@ -0,0 +1,16 @@ + + + + + + + + + + + + + + + + diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 new file mode 100644 index 000000000..98683141f --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 @@ -0,0 +1 @@ +dd6b81afcc106a1b6ef510c853a38728 \ No newline at end of file diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg new file mode 100644 index 000000000..6be80e886 --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -0,0 +1,241 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::atof + + + + + +Node1->Node2 + + + + + +Node3 + + +save_exact_solution + + + + + +Node1->Node3 + + + + + +Node11 + + +semi_implicit_euler + + + + + +Node1->Node11 + + + + + +Node4 + + +std::clock + + + + + +Node3->Node4 + + + + + +Node5 + + +std::ofstream::close + + + + + +Node3->Node5 + + + + + +Node6 + + +exact_solution + + + + + +Node3->Node6 + + + + + +Node9 + + +std::ofstream::is_open + + + + + +Node3->Node9 + + + + + +Node10 + + +std::perror + + + + + +Node3->Node10 + + + + + +Node7 + + +std::cos + + + + + +Node6->Node7 + + + + + +Node8 + + +std::sin + + + + + +Node6->Node8 + + + + + +Node11->Node4 + + + + + +Node11->Node5 + + + + + +Node11->Node9 + + + + + +Node11->Node10 + + + + + +Node12 + + +std::ofstream::open + + + + + +Node11->Node12 + + + + + +Node13 + + +semi_implicit_euler_step + + + + + +Node11->Node13 + + + + + +Node14 + + +problem + + + + + +Node13->Node14 + + + + + diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map new file mode 100644 index 000000000..ee5a8e0c5 --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 new file mode 100644 index 000000000..417921570 --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 @@ -0,0 +1 @@ +0881ed8175bf272a83fbca20823466f2 \ No newline at end of file diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg new file mode 100644 index 000000000..943566dbb --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg @@ -0,0 +1,127 @@ + + + + + + +save_exact_solution + + + +Node1 + + +save_exact_solution + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::ofstream::close + + + + + +Node1->Node3 + + + + + +Node4 + + +exact_solution + + + + + +Node1->Node4 + + + + + +Node7 + + +std::ofstream::is_open + + + + + +Node1->Node7 + + + + + +Node8 + + +std::perror + + + + + +Node1->Node8 + + + + + +Node5 + + +std::cos + + + + + +Node4->Node5 + + + + + +Node6 + + +std::sin + + + + + +Node4->Node6 + + + + + diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map new file mode 100644 index 000000000..fbb37ebae --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 new file mode 100644 index 000000000..53dab073e --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 @@ -0,0 +1 @@ +28f68d690a34e83ed529b0e7cf875a9c \ No newline at end of file diff --git a/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg new file mode 100644 index 000000000..6b0aebf2e --- /dev/null +++ b/d3/d06/ode__semi__implicit__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +exact_solution + + + +Node1 + + +exact_solution + + + + + +Node2 + + +std::cos + + + + + +Node1->Node2 + + + + + +Node3 + + +std::sin + + + + + +Node1->Node3 + + + + + diff --git a/d3/d19/sparse__matrix_8cpp.html b/d3/d19/sparse__matrix_8cpp.html new file mode 100644 index 000000000..7737b1ea4 --- /dev/null +++ b/d3/d19/sparse__matrix_8cpp.html @@ -0,0 +1,188 @@ + + + + + + + +Algorithms_in_C++: others/sparse_matrix.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
sparse_matrix.cpp File Reference
+
+
+
#include <iostream>
+
+Include dependency graph for sparse_matrix.cpp:
+
+
+
+
+
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

A sparse matrix is a matrix which has number of zeroes greater than \(\frac{m\times n}{2}\), where m and n are the dimensions of the matrix.

+

Function Documentation

+ +

◆ main()

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

main function

+
9  {
+
10  int m, n;
+
11  int counterZeros = 0;
+
12 
+
13  std::cout << "Enter dimensions of matrix (seperated with space): ";
+
14  std::cin >> m;
+
15  std::cin >> n;
+
16 
+
17  int **a = new int *[m];
+
18  for (int i = 0; i < m; i++) a[i] = new int[n];
+
19 
+
20  std::cout << "Enter matrix elements:";
+
21  std::cout << "\n";
+
22 
+
23  // reads the matrix from stdin
+
24  for (int i = 0; i < m; i++) {
+
25  for (int j = 0; j < n; j++) {
+
26  std::cout << "element? ";
+
27  std::cin >> a[i][j];
+
28  }
+
29  }
+
30 
+
31  // counts the zero's
+
32  for (int i = 0; i < m; i++) {
+
33  for (int j = 0; j < n; j++) {
+
34  if (a[i][j] == 0)
+
35  counterZeros++; // Counting number of zeroes
+
36  }
+
37  }
+
38 
+
39  // makes sure the matrix is a sparse matrix
+
40  if (counterZeros > ((m * n) / 2)) // Checking for sparse matrix
+
41  std::cout << "Sparse matrix";
+
42  else
+
43  std::cout << "Not a sparse matrix";
+
44 
+
45  for (int i = 0; i < m; i++) delete[] a[i];
+
46  delete[] a;
+
47  return 0;
+
48 }
+
+
+
+
+
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+ + + + + diff --git a/d3/d19/sparse__matrix_8cpp.js b/d3/d19/sparse__matrix_8cpp.js new file mode 100644 index 000000000..0fc3ce126 --- /dev/null +++ b/d3/d19/sparse__matrix_8cpp.js @@ -0,0 +1,4 @@ +var sparse__matrix_8cpp = +[ + [ "main", "d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.map b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.map new file mode 100644 index 000000000..947c892ba --- /dev/null +++ b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.md5 b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.md5 new file mode 100644 index 000000000..1f02a3fc3 --- /dev/null +++ b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.md5 @@ -0,0 +1 @@ +c690165bd3e35d89189fe64620f731ad \ No newline at end of file diff --git a/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg new file mode 100644 index 000000000..a3d483c13 --- /dev/null +++ b/d3/d1e/modular__inverse__fermat__little__theorem_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +math/modular_inverse_fermat_little_theorem.cpp + + + +Node1 + + +math/modular_inverse +_fermat_little_theorem.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + + + diff --git a/d3/d24/qr__decomposition_8cpp.html b/d3/d24/qr__decomposition_8cpp.html new file mode 100644 index 000000000..0f88a55d8 --- /dev/null +++ b/d3/d24/qr__decomposition_8cpp.html @@ -0,0 +1,203 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/qr_decomposition.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
qr_decomposition.cpp File Reference
+
+
+ +

Program to compute the QR decomposition of a given matrix. +More...

+
#include <array>
+#include <cmath>
+#include <cstdlib>
+#include <ctime>
+#include <iostream>
+#include "./qr_decompose.h"
+
+Include dependency graph for qr_decomposition.cpp:
+
+
+
+
+
+ + + +

+Functions

int main (void)
 
+

Detailed Description

+

Program to compute the QR decomposition of a given matrix.

+
Author
Krishna Vedala
+

Function Documentation

+ +

◆ main()

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

main function

+
23  {
+
24  unsigned int ROWS, COLUMNS;
+
25 
+
26  std::cout << "Enter the number of rows and columns: ";
+
27  std::cin >> ROWS >> COLUMNS;
+
28 
+
29  std::cout << "Enter matrix elements row-wise:\n";
+
30 
+ + + +
34  for (int i = 0; i < std::max(ROWS, COLUMNS); i++) {
+
35  if (i < ROWS) {
+
36  A[i] = std::valarray<double>(COLUMNS);
+
37  Q[i] = std::valarray<double>(COLUMNS);
+
38  }
+
39  if (i < COLUMNS) {
+
40  R[i] = std::valarray<double>(COLUMNS);
+
41  }
+
42  }
+
43 
+
44  for (int i = 0; i < ROWS; i++)
+
45  for (int j = 0; j < COLUMNS; j++) std::cin >> A[i][j];
+
46 
+
47  std::cout << A << "\n";
+
48 
+
49  clock_t t1 = clock();
+
50  qr_decompose(A, &Q, &R);
+
51  double dtime = static_cast<double>(clock() - t1) / CLOCKS_PER_SEC;
+
52 
+
53  std::cout << Q << "\n";
+
54  std::cout << R << "\n";
+
55  std::cout << "Time taken to compute: " << dtime << " sec\n ";
+
56 
+
57  return 0;
+
58 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T clock(T... args)
+ +
STL class.
+
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
+
T max(T... args)
+ + + + + diff --git a/d3/d24/qr__decomposition_8cpp.js b/d3/d24/qr__decomposition_8cpp.js new file mode 100644 index 000000000..32e98ae9e --- /dev/null +++ b/d3/d24/qr__decomposition_8cpp.js @@ -0,0 +1,4 @@ +var qr__decomposition_8cpp = +[ + [ "main", "d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe", null ] +]; \ No newline at end of file diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map new file mode 100644 index 000000000..90022f540 --- /dev/null +++ b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 new file mode 100644 index 000000000..e4b2c5723 --- /dev/null +++ b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 @@ -0,0 +1 @@ +f7a8cceeb1ccef61420e5d6bfbcd057b \ No newline at end of file diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg new file mode 100644 index 000000000..8faff1bc4 --- /dev/null +++ b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg @@ -0,0 +1,200 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::max + + + + + +Node1->Node2 + + + + + +Node3 + + +qr_algorithm::qr_decompose + + + + + +Node1->Node3 + + + + + +Node4 + + +qr_algorithm::vector_mag + + + + + +Node3->Node4 + + + + + +Node7 + + +qr_algorithm::vector_proj + + + + + +Node3->Node7 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6 + + +qr_algorithm::vector_dot + + + + + +Node4->Node6 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg new file mode 100644 index 000000000..1e7538cb4 --- /dev/null +++ b/d3/d24/qr__decomposition_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph_org.svg @@ -0,0 +1,112 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::max + + + + + +Node1->Node2 + + + + + +Node3 + + +qr_algorithm::qr_decompose + + + + + +Node1->Node3 + + + + + +Node4 + + +qr_algorithm::vector_mag + + + + + +Node3->Node4 + + + + + +Node7 + + +qr_algorithm::vector_proj + + + + + +Node3->Node7 + + + + + +Node5 + + +std::sqrt + + + + + +Node4->Node5 + + + + + +Node6 + + +qr_algorithm::vector_dot + + + + + +Node4->Node6 + + + + + diff --git a/d3/d26/binary__search__tree_8cpp.html b/d3/d26/binary__search__tree_8cpp.html new file mode 100644 index 000000000..446911c0c --- /dev/null +++ b/d3/d26/binary__search__tree_8cpp.html @@ -0,0 +1,174 @@ + + + + + + + +Algorithms_in_C++: data_structures/binary_search_tree.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
binary_search_tree.cpp File Reference
+
+
+ +

A simple tree implementation using structured nodes. +More...

+
#include <iostream>
+
+Include dependency graph for binary_search_tree.cpp:
+
+
+
+
+
+ + + + + +

+Classes

class  node< Kind >
 
class  queue< Kind >
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

+void enqueue (node *n)
 
+nodedequeue ()
 
+void Insert (node *n, int x)
 
+int findMaxInLeftST (node *n)
 
+void Remove (node *p, node *n, int x)
 
+void BFT (node *n)
 
+void Pre (node *n)
 
+void In (node *n)
 
+void Post (node *n)
 
+int main ()
 
+ + + +

+Variables

+queue q
 
+

Detailed Description

+

A simple tree implementation using structured nodes.

+
Todo:
update code to use C++ STL library features and OO structure
+
Warning
This program is a poor implementation - C style - and does not utilize any of the C++ STL features.
+
+
+ + + + diff --git a/d3/d26/binary__search__tree_8cpp.js b/d3/d26/binary__search__tree_8cpp.js new file mode 100644 index 000000000..85e49fb56 --- /dev/null +++ b/d3/d26/binary__search__tree_8cpp.js @@ -0,0 +1,16 @@ +var binary__search__tree_8cpp = +[ + [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ], + [ "queue", "d2/d36/structqueue.html", "d2/d36/structqueue" ], + [ "BFT", "d3/d26/binary__search__tree_8cpp.html#aa65d9b7fa9bd517ace3d819abc85c8b6", null ], + [ "dequeue", "d3/d26/binary__search__tree_8cpp.html#ad7a062d9cfb533d97192fd65fad1415c", null ], + [ "enqueue", "d3/d26/binary__search__tree_8cpp.html#a1ca1e6aad9a9e45c1d21a7c8f61bccc3", null ], + [ "findMaxInLeftST", "d3/d26/binary__search__tree_8cpp.html#a4a1aaff44d949318d93231e1fa5c7863", null ], + [ "In", "d3/d26/binary__search__tree_8cpp.html#adb338121baec7856c9593d79ddeb5e18", null ], + [ "Insert", "d3/d26/binary__search__tree_8cpp.html#a521ea77f195e491750e602292c6dc335", null ], + [ "main", "d3/d26/binary__search__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "Post", "d3/d26/binary__search__tree_8cpp.html#a13dac1586cbb95ebfd63dc47aeeff0e1", null ], + [ "Pre", "d3/d26/binary__search__tree_8cpp.html#a9e98619e1c6cea9d6c56849a16ecc416", null ], + [ "Remove", "d3/d26/binary__search__tree_8cpp.html#a4392f2f3d0680befc1a6db07d94d6c5d", null ], + [ "q", "d3/d26/binary__search__tree_8cpp.html#a16d007b4fa0985c2d3f620ac13080e6e", null ] +]; \ No newline at end of file diff --git a/d3/d30/hash__search_8cpp__incl.map b/d3/d30/hash__search_8cpp__incl.map new file mode 100644 index 000000000..9292df97f --- /dev/null +++ b/d3/d30/hash__search_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d3/d30/hash__search_8cpp__incl.md5 b/d3/d30/hash__search_8cpp__incl.md5 new file mode 100644 index 000000000..440fe2336 --- /dev/null +++ b/d3/d30/hash__search_8cpp__incl.md5 @@ -0,0 +1 @@ +84ba7a48b925a3797dbfd542e265dcdf \ No newline at end of file diff --git a/d3/d30/hash__search_8cpp__incl.svg b/d3/d30/hash__search_8cpp__incl.svg new file mode 100644 index 000000000..c8c719d4f --- /dev/null +++ b/d3/d30/hash__search_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +search/hash_search.cpp + + + +Node1 + + +search/hash_search.cpp + + + + + +Node2 + + +cstdlib + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/d3/d39/check__prime_8cpp__incl.map b/d3/d39/check__prime_8cpp__incl.map new file mode 100644 index 000000000..7272c86c6 --- /dev/null +++ b/d3/d39/check__prime_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d3/d39/check__prime_8cpp__incl.md5 b/d3/d39/check__prime_8cpp__incl.md5 new file mode 100644 index 000000000..4e5c78351 --- /dev/null +++ b/d3/d39/check__prime_8cpp__incl.md5 @@ -0,0 +1 @@ +3ebf938e0095dab542ed5d9c4f834f70 \ No newline at end of file diff --git a/d3/d39/check__prime_8cpp__incl.svg b/d3/d39/check__prime_8cpp__incl.svg new file mode 100644 index 000000000..3a15adc6c --- /dev/null +++ b/d3/d39/check__prime_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/check_prime.cpp + + + +Node1 + + +math/check_prime.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/d3/d56/binomial__dist_8cpp__incl.map b/d3/d56/binomial__dist_8cpp__incl.map new file mode 100644 index 000000000..52c06dff6 --- /dev/null +++ b/d3/d56/binomial__dist_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d3/d56/binomial__dist_8cpp__incl.md5 b/d3/d56/binomial__dist_8cpp__incl.md5 new file mode 100644 index 000000000..d787b5480 --- /dev/null +++ b/d3/d56/binomial__dist_8cpp__incl.md5 @@ -0,0 +1 @@ +1c525cb22e94363fb95bb36d47bd8e47 \ No newline at end of file diff --git a/d3/d56/binomial__dist_8cpp__incl.svg b/d3/d56/binomial__dist_8cpp__incl.svg new file mode 100644 index 000000000..ff3e6bc05 --- /dev/null +++ b/d3/d56/binomial__dist_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +probability/binomial_dist.cpp + + + +Node1 + + +probability/binomial +_dist.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/d3/d61/vector__important__functions_8cpp.html b/d3/d61/vector__important__functions_8cpp.html new file mode 100644 index 000000000..35eaba0cb --- /dev/null +++ b/d3/d61/vector__important__functions_8cpp.html @@ -0,0 +1,197 @@ + + + + + + + +Algorithms_in_C++: others/vector_important_functions.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
vector_important_functions.cpp File Reference
+
+
+ +

A C++ program to demonstrate working of std::sort(), std::reverse() +More...

+
#include <algorithm>
+#include <iostream>
+#include <numeric>
+#include <vector>
+
+Include dependency graph for vector_important_functions.cpp:
+
+
+
+
+
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

A C++ program to demonstrate working of std::sort(), std::reverse()

+

Function Documentation

+ +

◆ main()

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

Main function

+
11  {
+
12  // Initializing vector with array values
+
13  int arr[] = {10, 20, 5, 23, 42, 15};
+
14  int n = sizeof(arr) / sizeof(arr[0]);
+
15  std::vector<int> vect(arr, arr + n);
+
16 
+
17  std::cout << "Vector is: ";
+
18  for (int i = 0; i < n; i++) std::cout << vect[i] << " ";
+
19 
+
20  // Sorting the Vector in Ascending order
+
21  std::sort(vect.begin(), vect.end());
+
22 
+
23  std::cout << "\nVector after sorting is: ";
+
24  for (int i = 0; i < n; i++) std::cout << vect[i] << " ";
+
25 
+
26  // Reversing the Vector
+
27  std::reverse(vect.begin(), vect.end());
+
28 
+
29  std::cout << "\nVector after reversing is: ";
+
30  for (int i = 0; i < 6; i++) std::cout << vect[i] << " ";
+
31 
+
32  std::cout << "\nMaximum element of vector is: ";
+
33  std::cout << *max_element(vect.begin(), vect.end());
+
34 
+
35  std::cout << "\nMinimum element of vector is: ";
+
36  std::cout << *min_element(vect.begin(), vect.end());
+
37 
+
38  // Starting the summation from 0
+
39  std::cout << "\nThe summation of vector elements is: ";
+
40  std::cout << accumulate(vect.begin(), vect.end(), 0);
+
41 
+
42  return 0;
+
43 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T max_element(T... args)
+ +
T reverse(T... args)
+
T sort(T... args)
+ +
T min_element(T... args)
+
T accumulate(T... args)
+ + + + diff --git a/d3/d61/vector__important__functions_8cpp.js b/d3/d61/vector__important__functions_8cpp.js new file mode 100644 index 000000000..b9fcafec6 --- /dev/null +++ b/d3/d61/vector__important__functions_8cpp.js @@ -0,0 +1,4 @@ +var vector__important__functions_8cpp = +[ + [ "main", "d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..c9cb8dd17 --- /dev/null +++ b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..545bef5ad --- /dev/null +++ b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +0373c66c8d6fb7c52e5c3c71a27c1620 \ No newline at end of file diff --git a/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..fdfcaa5f0 --- /dev/null +++ b/d3/d61/vector__important__functions_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::vector::begin + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::end + + + + + +Node1->Node3 + + + + + +Node4 + + +std::reverse + + + + + +Node1->Node4 + + + + + +Node5 + + +std::sort + + + + + +Node1->Node5 + + + + + diff --git a/d3/d66/structlinkedlist__coll__graph.map b/d3/d66/structlinkedlist__coll__graph.map new file mode 100644 index 000000000..ca8355bd5 --- /dev/null +++ b/d3/d66/structlinkedlist__coll__graph.map @@ -0,0 +1,3 @@ + + + diff --git a/d3/d66/structlinkedlist__coll__graph.md5 b/d3/d66/structlinkedlist__coll__graph.md5 new file mode 100644 index 000000000..cda3fa991 --- /dev/null +++ b/d3/d66/structlinkedlist__coll__graph.md5 @@ -0,0 +1 @@ +7af5d3b60d8aad98dcc5e97001f952b6 \ No newline at end of file diff --git a/d3/d66/structlinkedlist__coll__graph.svg b/d3/d66/structlinkedlist__coll__graph.svg new file mode 100644 index 000000000..3c6817d27 --- /dev/null +++ b/d3/d66/structlinkedlist__coll__graph.svg @@ -0,0 +1,29 @@ + + + + + + +linkedlist + + + +Node1 + + +linkedlist + + + + + +Node1->Node1 + + + next + + + diff --git a/d3/d7d/brute__force__string__searching_8cpp.html b/d3/d7d/brute__force__string__searching_8cpp.html new file mode 100644 index 000000000..177b6d20d --- /dev/null +++ b/d3/d7d/brute__force__string__searching_8cpp.html @@ -0,0 +1,206 @@ + + + + + + + +Algorithms_in_C++: strings/brute_force_string_searching.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
brute_force_string_searching.cpp File Reference
+
+
+ +

String pattern search - brute force. +More...

+
#include <iostream>
+#include <cstring>
+#include <vector>
+
+Include dependency graph for brute_force_string_searching.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 
+ + + + + +

+Functions

int string_search::brute_force (const std::string &text, const std::string &pattern)
 
int main ()
 
+ + + +

+Variables

const std::vector< std::vector< std::string > > test_set
 
+

Detailed Description

+

String pattern search - brute force.

+

Function Documentation

+ +

◆ main()

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

Main function

+
47  {
+
48  for (size_t i = 0; i < test_set.size(); i++) {
+
49  int output = brute_force(test_set[i][0], test_set[i][1]);
+
50 
+
51  if (std::to_string(output) == test_set[i][2])
+
52  std::cout << "success\n";
+
53  else
+
54  std::cout << "failure\n";
+
55  }
+
56  return 0;
+
57 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+

Variable Documentation

+ +

◆ test_set

+ +
+
+ + + + +
const std::vector<std::vector<std::string> > test_set
+
+Initial value:
= {
+
+
{"a", "aa", "-1"}, {"a", "a", "0"}, {"ba", "b", "0"},
+
{"bba", "bb", "0"}, {"bbca", "c", "2"}, {"ab", "b", "1"}}
+

set of test cases

+ +
+
+
+
+
int brute_force(const std::string &text, const std::string &pattern)
Definition: brute_force_string_searching.cpp:21
+
const std::vector< std::vector< std::string > > test_set
Definition: brute_force_string_searching.cpp:41
+ +
T to_string(T... args)
+ + + + diff --git a/d3/d7d/brute__force__string__searching_8cpp.js b/d3/d7d/brute__force__string__searching_8cpp.js new file mode 100644 index 000000000..d8ff40d7a --- /dev/null +++ b/d3/d7d/brute__force__string__searching_8cpp.js @@ -0,0 +1,6 @@ +var brute__force__string__searching_8cpp = +[ + [ "brute_force", "d3/d7d/brute__force__string__searching_8cpp.html#aeb2cd81064717aedd62bfb096b1a73d8", null ], + [ "main", "d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "test_set", "d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123", null ] +]; \ No newline at end of file diff --git a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..8175805cc --- /dev/null +++ b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..4a84335b2 --- /dev/null +++ b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +28b1843201c870f8026b7db3366b4f79 \ No newline at end of file diff --git a/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..e54e3fe2f --- /dev/null +++ b/d3/d7d/brute__force__string__searching_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,83 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +string_search::brute +_force + + + + + +Node1->Node2 + + + + + +Node5 + + +std::to_string + + + + + +Node1->Node5 + + + + + +Node3 + + +std::string::length + + + + + +Node2->Node3 + + + + + +Node4 + + +std::string::substr + + + + + +Node2->Node4 + + + + + diff --git a/d3/da3/classstatistics_1_1stats__computer2-members.html b/d3/da3/classstatistics_1_1stats__computer2-members.html new file mode 100644 index 000000000..1a34d9098 --- /dev/null +++ b/d3/da3/classstatistics_1_1stats__computer2-members.html @@ -0,0 +1,120 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
statistics::stats_computer2< T > Member List
+
+ +
+ + + + diff --git a/d3/dbb/class_cycle_check.html b/d3/dbb/class_cycle_check.html new file mode 100644 index 000000000..9cab13235 --- /dev/null +++ b/d3/dbb/class_cycle_check.html @@ -0,0 +1,397 @@ + + + + + + + +Algorithms_in_C++: CycleCheck Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+ + + + + + +

+Static Public Member Functions

static bool isCyclicDFS (Graph const &graph)
 
static bool isCyclicBFS (Graph const &graph)
 
+ + + +

+Private Types

enum  nodeStates : uint8_t { not_visited = 0, +in_stack, +visited + }
 
+ + + +

+Static Private Member Functions

static bool isCyclicDFSHelper (AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
 
+

Member Function Documentation

+ +

◆ isCyclicBFS()

+ +
+
+ + + + + +
+ + + + + + + + +
static bool CycleCheck::isCyclicBFS (Graph const & graph)
+
+inlinestatic
+
+

Check if a graph has cycle or not.

+

This function uses BFS to check if a graph is cyclic or not.

+
Parameters
+ + +
graphwhich needs to be evaluated for the presence of cycle.
+
+
+
Returns
true if a cycle is detected, else false.
+
241  {
+
242  AdjList graphAjdList = graph.getAdjList();
+
243 
+
244  std::vector<unsigned int> indegree(graph.getVertices(), 0);
+
245  // Calculate the indegree i.e. the number of incident edges to the node.
+
246  for (auto const& [parent, children] : graphAjdList) {
+
247  for (auto const& child : children) {
+
248  indegree[child]++;
+
249  }
+
250  }
+
251 
+
252  std::queue<unsigned int> can_be_solved;
+
253  for (auto node = 0; node < graph.getVertices(); node++) {
+
254  // If a node doesn't have any input edges, then that node will
+
255  // definately not result in a cycle and can be visited safely.
+
256  if (!indegree[node]) {
+
257  can_be_solved.emplace(node);
+
258  }
+
259  }
+
260 
+
261  // Vertices that need to be traversed.
+
262  auto remain = graph.getVertices();
+
263  // While there are safe nodes that we can visit.
+
264  while (!can_be_solved.empty()) {
+
265  auto front = can_be_solved.front();
+
266  // Visit the node.
+
267  can_be_solved.pop();
+
268  // Decrease number of nodes that need to be traversed.
+
269  remain--;
+
270 
+
271  // Visit all the children of the visited node.
+
272  if (auto it = graphAjdList.find(front); it != graphAjdList.end()) {
+
273  for (auto child : it->second) {
+
274  // Check if we can visited the node safely.
+
275  if (--indegree[child] == 0) {
+
276  // if node can be visited safely, then add that node to
+
277  // the visit queue.
+
278  can_be_solved.emplace(child);
+
279  }
+
280  }
+
281  }
+
282  }
+
283 
+
284  // If there are still nodes that we can't visit, then it means that
+
285  // there is a cycle and return true, else return false.
+
286  return !(remain == 0);
+
287  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ isCyclicDFS()

+ +
+
+ + + + + +
+ + + + + + + + +
static bool CycleCheck::isCyclicDFS (Graph const & graph)
+
+inlinestatic
+
+

Driver function to check if a graph has a cycle.

+

This function uses DFS to check for cycle in the graph.

+
Parameters
+ + +
graphwhich needs to be evaluated for the presence of cycle.
+
+
+
Returns
true if a cycle is detected, else false.
+

State of the node.

+

It is a vector of "nodeStates" which represents the state node is in. It can take only 3 values: "not_visited", "in_stack", and "visited".

+

Initially, all nodes are in "not_visited" state.

+
206  {
+
207  /** State of the node.
+
208  *
+
209  * It is a vector of "nodeStates" which represents the state node is in.
+
210  * It can take only 3 values: "not_visited", "in_stack", and "visited".
+
211  *
+
212  * Initially, all nodes are in "not_visited" state.
+
213  */
+
214  std::vector<nodeStates> state(graph.getVertices(), not_visited);
+
215 
+
216  // Start visiting each node.
+
217  for (auto node = 0; node < graph.getVertices(); node++) {
+
218  // If a node is not visited, only then check for presence of cycle.
+
219  // There is no need to check for presence of cycle for a visited
+
220  // node as it has already been checked for presence of cycle.
+
221  if (state[node] == not_visited) {
+
222  // Check for cycle.
+
223  if (isCyclicDFSHelper(graph.getAdjList(), &state, node)) {
+
224  return true;
+
225  }
+
226  }
+
227  }
+
228 
+
229  // All nodes have been safely traversed, that means there is no cycle in
+
230  // the graph. Return false.
+
231  return false;
+
232  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ isCyclicDFSHelper()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
static bool CycleCheck::isCyclicDFSHelper (AdjList const & adjList,
std::vector< nodeStates > * state,
unsigned int node 
)
+
+inlinestaticprivate
+
+

Helper function of "isCyclicDFS".

+
Parameters
+ + + + +
adjListis the adjacency list representation of some graph.
stateis the state of the nodes of the graph.
nodeis the node being evaluated.
+
+
+
Returns
true if graph has a cycle, else false.
+
167  {
+
168  // Add node "in_stack" state.
+
169  (*state)[node] = in_stack;
+
170 
+
171  // If the node has children, then recursively visit all children of the
+
172  // node.
+
173  if (auto const& it = adjList.find(node); it != adjList.end()) {
+
174  for (auto child : it->second) {
+
175  // If state of child node is "not_visited", evaluate that child
+
176  // for presence of cycle.
+
177  if (auto state_of_child = (*state)[child];
+
178  state_of_child == not_visited) {
+
179  if (isCyclicDFSHelper(adjList, state, child)) {
+
180  return true;
+
181  }
+
182  } else if (state_of_child == in_stack) {
+
183  // If child node was "in_stack", then that means that there
+
184  // is a cycle in the graph. Return true for presence of the
+
185  // cycle.
+
186  return true;
+
187  }
+
188  }
+
189  }
+
190 
+
191  // Current node has been evaluated for the presence of cycle and had no
+
192  // cycle. Mark current node as "visited".
+
193  (*state)[node] = visited;
+
194  // Return that current node didn't result in any cycles.
+
195  return false;
+
196  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
The documentation for this class was generated from the following file:
    +
  • graph/cycle_check_directed_graph.cpp
  • +
+
+
+
Definition: bfs.cpp:3
+ +
T emplace(T... args)
+
Definition: avltree.cpp:13
+
struct list node
+
STL class.
+
T front(T... args)
+
static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
Definition: cycle_check_directed_graph.cpp:165
+
T pop(T... args)
+
T empty(T... args)
+ + + + + diff --git a/d3/dbb/class_cycle_check.js b/d3/dbb/class_cycle_check.js new file mode 100644 index 000000000..032218c69 --- /dev/null +++ b/d3/dbb/class_cycle_check.js @@ -0,0 +1,11 @@ +var class_cycle_check = +[ + [ "nodeStates", "d3/dbb/class_cycle_check.html#ae68a1f08ee8c0b6323ab0f281862eadf", [ + [ "not_visited", "d3/dbb/class_cycle_check.html#ae68a1f08ee8c0b6323ab0f281862eadfa0d6bede6610396cc93dae3c1c7dea757", null ], + [ "in_stack", "d3/dbb/class_cycle_check.html#ae68a1f08ee8c0b6323ab0f281862eadfaf79bb27ce88c169c6039c6a3e2938fa0", null ], + [ "visited", "d3/dbb/class_cycle_check.html#ae68a1f08ee8c0b6323ab0f281862eadfa81d65ae802bc0dd049a92f218008e01f", null ] + ] ], + [ "isCyclicBFS", "d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5", null ], + [ "isCyclicDFS", "d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474", null ], + [ "isCyclicDFSHelper", "d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b", null ] +]; \ No newline at end of file diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map new file mode 100644 index 000000000..46aa2847e --- /dev/null +++ b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 new file mode 100644 index 000000000..d1391cb3c --- /dev/null +++ b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.md5 @@ -0,0 +1 @@ +5c7e163c03f4879f132c8debafc6f730 \ No newline at end of file diff --git a/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg new file mode 100644 index 000000000..43e4fcc68 --- /dev/null +++ b/d3/dbb/class_cycle_check_a2f4485c08b45e7a21a2e86f9c3f01d8b_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +CycleCheck::isCyclicDFSHelper + + + +Node1 + + +CycleCheck::isCyclicDFSHelper + + + + + +Node2 + + +std::unordered_map::end + + + + + +Node1->Node2 + + + + + +Node3 + + +std::unordered_map +::find + + + + + +Node1->Node3 + + + + + diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map new file mode 100644 index 000000000..5924aea05 --- /dev/null +++ b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5 b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5 new file mode 100644 index 000000000..29bae5fdd --- /dev/null +++ b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.md5 @@ -0,0 +1 @@ +e06ebf0c8f4bd11ec03b5a55588c1ae2 \ No newline at end of file diff --git a/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg new file mode 100644 index 000000000..00436acf8 --- /dev/null +++ b/d3/dbb/class_cycle_check_a399292a33edf87499daa52b51315aca5_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +CycleCheck::isCyclicBFS + + + +Node1 + + +CycleCheck::isCyclicBFS + + + + + +Node2 + + +std::queue::emplace + + + + + +Node1->Node2 + + + + + +Node3 + + +std::queue::empty + + + + + +Node1->Node3 + + + + + +Node4 + + +std::queue::front + + + + + +Node1->Node4 + + + + + +Node5 + + +std::queue::pop + + + + + +Node1->Node5 + + + + + diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map new file mode 100644 index 000000000..3bf0d39c7 --- /dev/null +++ b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5 b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5 new file mode 100644 index 000000000..34d9e747c --- /dev/null +++ b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.md5 @@ -0,0 +1 @@ +c0ea8464055e7e62352b54ce9171307c \ No newline at end of file diff --git a/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg new file mode 100644 index 000000000..6666bdad5 --- /dev/null +++ b/d3/dbb/class_cycle_check_ad9a270ffba3a68539b92272c702e3474_cgraph.svg @@ -0,0 +1,68 @@ + + + + + + +CycleCheck::isCyclicDFS + + + +Node1 + + +CycleCheck::isCyclicDFS + + + + + +Node2 + + +CycleCheck::isCyclicDFSHelper + + + + + +Node1->Node2 + + + + + +Node3 + + +std::unordered_map::end + + + + + +Node2->Node3 + + + + + +Node4 + + +std::unordered_map +::find + + + + + +Node2->Node4 + + + + + diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp.html b/d3/dce/linkedlist__implentation__usingarray_8cpp.html new file mode 100644 index 000000000..74d1d8a5d --- /dev/null +++ b/d3/dce/linkedlist__implentation__usingarray_8cpp.html @@ -0,0 +1,307 @@ + + + + + + + +Algorithms_in_C++: data_structures/linkedlist_implentation_usingarray.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
linkedlist_implentation_usingarray.cpp File Reference
+
+
+ +

Linked list implementation using Arrays. +More...

+
#include <iostream>
+
+Include dependency graph for linkedlist_implentation_usingarray.cpp:
+
+
+
+
+
+ + + +

+Classes

class  Node
 
+ + + + + + + + + + + + + + + +

+Functions

+void initialise_list ()
 
int getnode ()
 
void freeNode (int nodeToBeDeleted)
 
void insertAtTheBeginning (int data)
 
+void insertAtTheEnd (int data)
 
+void display ()
 
int main ()
 
+ + + + + + + + +

+Variables

+Node AvailArray [100]
 array that will act as nodes of a linked list.
 
+int head = -1
 
+int avail = 0
 
+

Detailed Description

+

Linked list implementation using Arrays.

+

The difference between the pointer implementation of linked list and array implementation of linked list:

    +
  1. The NULL is represented by -1;
  2. +
  3. Limited size. (in the following case it is 100 nodes at max). But we can reuse the nodes that are to be deleted by again linking it bacj to the list.
  4. +
+

Function Documentation

+ +

◆ freeNode()

+ +
+
+ + + + + + + + +
void freeNode (int nodeToBeDeleted)
+
+

This function when called will delete the node with the index presented as an argument, and will put back that node into the array.

+
42  {
+
43  AvailArray[nodeToBeDeleted].next = avail;
+
44  avail = nodeToBeDeleted;
+
45 }
+
+
+
+ +

◆ getnode()

+ +
+
+ + + + + + + +
int getnode ()
+
+

This will return the index of the first free node present in the avail list

+
32  {
+
33  int NodeIndexToBeReturned = avail;
+
34  avail = AvailArray[avail].next;
+
35  return NodeIndexToBeReturned;
+
36 }
+
+
+
+ +

◆ insertAtTheBeginning()

+ +
+
+ + + + + + + + +
void insertAtTheBeginning (int data)
+
+

The function will insert the given data into the front of the linked list.

+
50  {
+
51  int newNode = getnode();
+
52  AvailArray[newNode].data = data;
+
53  AvailArray[newNode].next = head;
+
54  head = newNode;
+
55 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main function

+
79  {
+
80  initialise_list();
+
81  int x, y, z;
+
82  for (;;) {
+
83  std::cout << "1. Insert At The Beginning" << std::endl;
+
84  std::cout << "2. Insert At The End" << std::endl;
+
85  std::cout << "3. Display" << std::endl;
+
86  std::cout << "4.Exit" << std::endl;
+
87  std::cout << "Enter Your choice" << std::endl;
+
88  std::cin >> z;
+
89  switch (z) {
+
90  case 1:
+
91  std::cout << "Enter the number you want to enter" << std::endl;
+
92  std::cin >> x;
+ +
94  break;
+
95  case 2:
+
96  std::cout << "Enter the number you want to enter" << std::endl;
+
97  std::cin >> y;
+
98  insertAtTheEnd(y);
+
99  break;
+
100  case 3:
+
101  std::cout
+
102  << "The linked list contains the following element in order"
+
103  << std::endl;
+
104  display();
+
105  break;
+
106  case 4:
+
107  return 0;
+
108  default:
+
109  std::cout << "The entered choice is not correct" << std::endl;
+
110  }
+
111  }
+
112 
+
113  return 0;
+
114 }
+
+
+
+
+
+ +
void insertAtTheBeginning(int data)
Definition: linkedlist_implentation_usingarray.cpp:50
+
int getnode()
Definition: linkedlist_implentation_usingarray.cpp:32
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
T endl(T... args)
+ +
Node AvailArray[100]
array that will act as nodes of a linked list.
Definition: linkedlist_implentation_usingarray.cpp:19
+ + + + diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp.js b/d3/dce/linkedlist__implentation__usingarray_8cpp.js new file mode 100644 index 000000000..c5b7c90fe --- /dev/null +++ b/d3/dce/linkedlist__implentation__usingarray_8cpp.js @@ -0,0 +1,14 @@ +var linkedlist__implentation__usingarray_8cpp = +[ + [ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ], + [ "display", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#a1e5b20fed15743656bb6d2e6a6ea6269", null ], + [ "freeNode", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02", null ], + [ "getnode", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be", null ], + [ "initialise_list", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#ac2fa82ac5ae366cc3aca53a40bb7cd70", null ], + [ "insertAtTheBeginning", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df", null ], + [ "insertAtTheEnd", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#a92e0c1bb3b270143881e36b5fea8a60d", null ], + [ "main", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "avail", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#ab84c7d9bed2aa1ade1fd61fbf5c2e07e", null ], + [ "AvailArray", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c", null ], + [ "head", "d3/dce/linkedlist__implentation__usingarray_8cpp.html#a20358970b1abaf992eb85e071e454653", null ] +]; \ No newline at end of file diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map new file mode 100644 index 000000000..27e77fc18 --- /dev/null +++ b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5 b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5 new file mode 100644 index 000000000..68309c225 --- /dev/null +++ b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.md5 @@ -0,0 +1 @@ +9d89a809b7ab90fffbfd49f934f960a2 \ No newline at end of file diff --git a/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg new file mode 100644 index 000000000..0b3d9a345 --- /dev/null +++ b/d3/dce/linkedlist__implentation__usingarray_8cpp_afcb07da7984e20b3207934696791f5df_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +insertAtTheBeginning + + + +Node1 + + +insertAtTheBeginning + + + + + +Node2 + + +getnode + + + + + +Node1->Node2 + + + + + diff --git a/d4/d0c/binary__search__tree_8cpp__incl.map b/d4/d0c/binary__search__tree_8cpp__incl.map new file mode 100644 index 000000000..44a8dc29d --- /dev/null +++ b/d4/d0c/binary__search__tree_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d0c/binary__search__tree_8cpp__incl.md5 b/d4/d0c/binary__search__tree_8cpp__incl.md5 new file mode 100644 index 000000000..26d17aad5 --- /dev/null +++ b/d4/d0c/binary__search__tree_8cpp__incl.md5 @@ -0,0 +1 @@ +c6eb225f7bee89c7f15da1aff139cc80 \ No newline at end of file diff --git a/d4/d0c/binary__search__tree_8cpp__incl.svg b/d4/d0c/binary__search__tree_8cpp__incl.svg new file mode 100644 index 000000000..bec2e90c4 --- /dev/null +++ b/d4/d0c/binary__search__tree_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +data_structures/binary_search_tree.cpp + + + +Node1 + + +data_structures/binary +_search_tree.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d4/d0e/class_bit-members.html b/d4/d0e/class_bit-members.html new file mode 100644 index 000000000..1e0a5e196 --- /dev/null +++ b/d4/d0e/class_bit-members.html @@ -0,0 +1,119 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Bit Member List
+
+
+ +

This is the complete list of members for Bit, including all inherited members.

+ + + + + + + + + +
bit (defined in Bit)Bitprivate
Bit(vector< int > &arr) (defined in Bit)Bitinline
Bit(int x) (defined in Bit)Bitinline
n (defined in Bit)Bitprivate
offset(int x) (defined in Bit)Bitinlineprivate
sum(int id) (defined in Bit)Bitinline
sum_range(int l, int r) (defined in Bit)Bitinline
update(int id, int val) (defined in Bit)Bitinline
+
+ + + + diff --git a/d4/d1f/class_min_heap-members.html b/d4/d1f/class_min_heap-members.html new file mode 100644 index 000000000..66564b509 --- /dev/null +++ b/d4/d1f/class_min_heap-members.html @@ -0,0 +1,124 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
MinHeap Member List
+
+
+ +

This is the complete list of members for MinHeap, including all inherited members.

+ + + + + + + + + + + + + + +
capacityMinHeapprivate
decreaseKey(int i, int new_val)MinHeap
deleteKey(int i)MinHeap
extractMin()MinHeap
getMin()MinHeapinline
harrMinHeapprivate
heap_sizeMinHeapprivate
insertKey(int k)MinHeap
left(int i)MinHeapinline
MinHeap(int capacity)MinHeap
MinHeapify(int)MinHeap
parent(int i) (defined in MinHeap)MinHeapinline
right(int i)MinHeapinline
+
+ + + + diff --git a/d4/d21/least__common__multiple_8cpp.html b/d4/d21/least__common__multiple_8cpp.html new file mode 100644 index 000000000..76ba25a44 --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp.html @@ -0,0 +1,293 @@ + + + + + + + +Algorithms_in_C++: math/least_common_multiple.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
least_common_multiple.cpp File Reference
+
+
+
#include <cassert>
+#include <iostream>
+
+Include dependency graph for least_common_multiple.cpp:
+
+
+
+
+
+ + + + + + + + + +

+Functions

unsigned int gcd (unsigned int x, unsigned int y)
 
unsigned int lcm (unsigned int x, unsigned int y)
 
void tests ()
 
int main ()
 
+

Detailed Description

+

Copyright 2020

Author
tjgurwara99
+

A basic implementation of LCM function

+

Function Documentation

+ +

◆ gcd()

+ +
+
+ + + + + + + + + + + + + + + + + + +
unsigned int gcd (unsigned int x,
unsigned int y 
)
+
+

Function for finding greatest common divisor of two numbers. @params two integers x and y whose gcd we want to find.

Returns
greatest common divisor of x and y.
+
16  {
+
17  if (x == 0) {
+
18  return y;
+
19  }
+
20  if (y == 0) {
+
21  return x;
+
22  }
+
23  if (x == y) {
+
24  return x;
+
25  }
+
26  if (x > y) {
+
27  // The following is valid because we have checked whether y == 0
+
28 
+
29  int temp = x / y;
+
30  return gcd(y, x - temp * y);
+
31  }
+
32  // Again the following is valid because we have checked whether x == 0
+
33 
+
34  int temp = y / x;
+
35  return gcd(x, y - temp * x);
+
36 }
+
+
+
+ +

◆ lcm()

+ +
+
+ + + + + + + + + + + + + + + + + + +
unsigned int lcm (unsigned int x,
unsigned int y 
)
+
+

Function for finding the least common multiple of two numbers. @params integer x and y whose lcm we want to find.

Returns
lcm of x and y using the relation x * y = gcd(x, y) * lcm(x, y)
+
43 { return x * y / gcd(x, y); }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main function

+
67  {
+
68  tests();
+
69  return 0;
+
70 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ tests()

+ +
+
+ + + + + + + +
void tests ()
+
+

Function for testing the lcm() functions with some assert statements.

+
48  {
+
49  // First test on lcm(5,10) == 10
+
50  assert(((void)"LCM of 5 and 10 is 10 but lcm function gives a different "
+
51  "result.\n",
+
52  lcm(5, 10) == 10));
+
53  std::cout << "First assertion passes: LCM of 5 and 10 is " << lcm(5, 10)
+
54  << std::endl;
+
55 
+
56  // Second test on lcm(2,3) == 6 as 2 and 3 are coprime (prime in fact)
+
57  assert(((void)"LCM of 2 and 3 is 6 but lcm function gives a different "
+
58  "result.\n",
+
59  lcm(2, 3) == 6));
+
60  std::cout << "Second assertion passes: LCM of 2 and 3 is " << lcm(2, 3)
+
61  << std::endl;
+
62 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
unsigned int lcm(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:43
+
void tests()
Definition: least_common_multiple.cpp:48
+ +
unsigned int gcd(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:16
+
T endl(T... args)
+ + + + diff --git a/d4/d21/least__common__multiple_8cpp.js b/d4/d21/least__common__multiple_8cpp.js new file mode 100644 index 000000000..c63770cc9 --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp.js @@ -0,0 +1,7 @@ +var least__common__multiple_8cpp = +[ + [ "gcd", "d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563", null ], + [ "lcm", "d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25", null ], + [ "main", "d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "tests", "d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9", null ] +]; \ No newline at end of file diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map new file mode 100644 index 000000000..e64031c34 --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 new file mode 100644 index 000000000..1b080a565 --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.md5 @@ -0,0 +1 @@ +848b9a4f6fc8bb8f5d8cd8d8bf8e39f8 \ No newline at end of file diff --git a/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg new file mode 100644 index 000000000..44e25509c --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_a88ec9ad42717780d6caaff9d3d6977f9_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +tests + + + +Node1 + + +tests + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +lcm + + + + + +Node1->Node3 + + + + + +Node4 + + +gcd + + + + + +Node3->Node4 + + + + + diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map new file mode 100644 index 000000000..c2f98f48b --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5 new file mode 100644 index 000000000..7f0270c34 --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.md5 @@ -0,0 +1 @@ +31d2c67966697e5578929cea1691d489 \ No newline at end of file diff --git a/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg new file mode 100644 index 000000000..6ae30c6ec --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_aa8d0e241db517813725e721a152e3a25_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +lcm + + + +Node1 + + +lcm + + + + + +Node2 + + +gcd + + + + + +Node1->Node2 + + + + + diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..d703d3a22 --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..02c515cb2 --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +1c1c5b7f4e25e868e53fb5f1523b1996 \ No newline at end of file diff --git a/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..8fe855971 --- /dev/null +++ b/d4/d21/least__common__multiple_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +tests + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + +Node4 + + +lcm + + + + + +Node2->Node4 + + + + + +Node5 + + +gcd + + + + + +Node4->Node5 + + + + + diff --git a/d4/d26/durand__kerner__roots_8cpp__incl.map b/d4/d26/durand__kerner__roots_8cpp__incl.map new file mode 100644 index 000000000..3a96d8b74 --- /dev/null +++ b/d4/d26/durand__kerner__roots_8cpp__incl.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/d4/d26/durand__kerner__roots_8cpp__incl.md5 b/d4/d26/durand__kerner__roots_8cpp__incl.md5 new file mode 100644 index 000000000..24ed705c3 --- /dev/null +++ b/d4/d26/durand__kerner__roots_8cpp__incl.md5 @@ -0,0 +1 @@ +1aaa7a5f0108eb8289fa4e59bdbeafc7 \ No newline at end of file diff --git a/d4/d26/durand__kerner__roots_8cpp__incl.svg b/d4/d26/durand__kerner__roots_8cpp__incl.svg new file mode 100644 index 000000000..05bdd8f6a --- /dev/null +++ b/d4/d26/durand__kerner__roots_8cpp__incl.svg @@ -0,0 +1,246 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +numerical_methods/durand_kerner_roots.cpp + + + +Node1 + + +numerical_methods/durand +_kerner_roots.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + +Node4 + + +cmath + + + + + +Node1->Node4 + + + + + +Node5 + + +complex + + + + + +Node1->Node5 + + + + + +Node6 + + +cstdlib + + + + + +Node1->Node6 + + + + + +Node7 + + +ctime + + + + + +Node1->Node7 + + + + + +Node8 + + +fstream + + + + + +Node1->Node8 + + + + + +Node9 + + +iostream + + + + + +Node1->Node9 + + + + + +Node10 + + +valarray + + + + + +Node1->Node10 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/d26/durand__kerner__roots_8cpp__incl_org.svg b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg new file mode 100644 index 000000000..d52ae368a --- /dev/null +++ b/d4/d26/durand__kerner__roots_8cpp__incl_org.svg @@ -0,0 +1,158 @@ + + + + + + +numerical_methods/durand_kerner_roots.cpp + + + +Node1 + + +numerical_methods/durand +_kerner_roots.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + +Node4 + + +cmath + + + + + +Node1->Node4 + + + + + +Node5 + + +complex + + + + + +Node1->Node5 + + + + + +Node6 + + +cstdlib + + + + + +Node1->Node6 + + + + + +Node7 + + +ctime + + + + + +Node1->Node7 + + + + + +Node8 + + +fstream + + + + + +Node1->Node8 + + + + + +Node9 + + +iostream + + + + + +Node1->Node9 + + + + + +Node10 + + +valarray + + + + + +Node1->Node10 + + + + + diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map new file mode 100644 index 000000000..3d67b1faf --- /dev/null +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 new file mode 100644 index 000000000..9159d4278 --- /dev/null +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.md5 @@ -0,0 +1 @@ +e3fce234b2c4d98f287b341746a4fea3 \ No newline at end of file diff --git a/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg new file mode 100644 index 000000000..148955741 --- /dev/null +++ b/d4/d2c/struct_trie_1_1_trie_node__coll__graph.svg @@ -0,0 +1,46 @@ + + + + + + +Trie::TrieNode + + + +Node1 + + +Trie::TrieNode + + + + + +Node2 + + +std::shared_ptr< Trie +::TrieNode > + + + + + +Node1->Node2 + + + ptr + + + +Node2->Node1 + + + character + + + diff --git a/d4/d32/fibonacci__fast_8cpp.html b/d4/d32/fibonacci__fast_8cpp.html new file mode 100644 index 000000000..fc260821e --- /dev/null +++ b/d4/d32/fibonacci__fast_8cpp.html @@ -0,0 +1,246 @@ + + + + + + + +Algorithms_in_C++: math/fibonacci_fast.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
fibonacci_fast.cpp File Reference
+
+
+ +

Faster computation of Fibonacci series. +More...

+
#include <cinttypes>
+#include <cstdio>
+#include <iostream>
+
+Include dependency graph for fibonacci_fast.cpp:
+
+
+
+
+
+ + + + + +

+Functions

uint64_t fib (uint64_t n)
 
int main ()
 
+ + + + + +

+Variables

const uint64_t MAX = 93
 
uint64_t f [MAX] = {0}
 
+

Detailed Description

+

Faster computation of Fibonacci series.

+

An efficient way to calculate nth fibonacci number faster and simpler than \(O(n\log n)\) method of matrix exponentiation This works by using both recursion and dynamic programming. as 93rd fibonacci exceeds 19 digits, which cannot be stored in a single long long variable, we can only use it till 92nd fibonacci we can use it for 10000th fibonacci etc, if we implement bigintegers. This algorithm works with the fact that nth fibonacci can easily found if we have already found n/2th or (n+1)/2th fibonacci It is a property of fibonacci similar to matrix exponentiation.

+
Author
Krishna Vedala
+
See also
fibonacci_large.cpp, fibonacci.cpp, string_fibonacci.cpp
+

Function Documentation

+ +

◆ fib()

+ +
+
+ + + + + + + + +
uint64_t fib (uint64_t n)
+
+

Algorithm

+
30  {
+
31  if (n == 0)
+
32  return 0;
+
33  if (n == 1 || n == 2)
+
34  return (f[n] = 1);
+
35 
+
36  if (f[n])
+
37  return f[n];
+
38 
+
39  uint64_t k = (n % 2 != 0) ? (n + 1) / 2 : n / 2;
+
40 
+
41  f[n] = (n % 2 != 0) ? (fib(k) * fib(k) + fib(k - 1) * fib(k - 1))
+
42  : (2 * fib(k - 1) + fib(k)) * fib(k);
+
43  return f[n];
+
44 }
+
+
+
+ +

◆ main()

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

Main function

+
47  {
+
48  // Main Function
+
49  for (uint64_t i = 1; i < 93; i++) {
+
50  std::cout << i << " th fibonacci number is " << fib(i) << std::endl;
+
51  }
+
52  return 0;
+
53 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+

Variable Documentation

+ +

◆ f

+ +
+
+ + + + +
uint64_t f[MAX] = {0}
+
+

Array of computed fibonacci numbers

+ +
+
+ +

◆ MAX

+ +
+
+ + + + +
const uint64_t MAX = 93
+
+

maximum number that can be computed - The result after 93 cannot be stored in a uint64_t data type.

+ +
+
+
+
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+ +
ll k
Definition: matrix_exponentiation.cpp:48
+
uint64_t fib(uint64_t n)
Definition: fibonacci_fast.cpp:30
+
T endl(T... args)
+ + + + diff --git a/d4/d32/fibonacci__fast_8cpp.js b/d4/d32/fibonacci__fast_8cpp.js new file mode 100644 index 000000000..b9126e453 --- /dev/null +++ b/d4/d32/fibonacci__fast_8cpp.js @@ -0,0 +1,7 @@ +var fibonacci__fast_8cpp = +[ + [ "fib", "d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f", null ], + [ "main", "d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "f", "d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9", null ], + [ "MAX", "d4/d32/fibonacci__fast_8cpp.html#a692ac7187ee88621a9f78fca78ec498d", null ] +]; \ No newline at end of file diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..44a38b82b --- /dev/null +++ b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..7e24798c6 --- /dev/null +++ b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +fb38e9866373b8345412cc1b5490f304 \ No newline at end of file diff --git a/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..5132d3351 --- /dev/null +++ b/d4/d32/fibonacci__fast_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +fib + + + + + +Node1->Node3 + + + + + diff --git a/d4/d45/gcd__recursive__euclidean_8cpp.html b/d4/d45/gcd__recursive__euclidean_8cpp.html new file mode 100644 index 000000000..77ea6f3ac --- /dev/null +++ b/d4/d45/gcd__recursive__euclidean_8cpp.html @@ -0,0 +1,225 @@ + + + + + + + +Algorithms_in_C++: math/gcd_recursive_euclidean.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
gcd_recursive_euclidean.cpp File Reference
+
+
+ +

Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm +More...

+
#include <iostream>
+
+Include dependency graph for gcd_recursive_euclidean.cpp:
+
+
+
+
+
+ + + + + +

+Functions

int gcd (int num1, int num2)
 
int main ()
 
+

Detailed Description

+

Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm

+
See also
gcd_iterative_euclidean.cpp, gcd_of_n_numbers.cpp
+

Function Documentation

+ +

◆ gcd()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int gcd (int num1,
int num2 
)
+
+

algorithm

+
14  {
+
15  if (num1 <= 0 | num2 <= 0) {
+
16  throw std::domain_error("Euclidean algorithm domain is for ints > 0");
+
17  }
+
18 
+
19  if (num1 == num2) {
+
20  return num1;
+
21  }
+
22 
+
23  // Everything divides 0
+
24  if (num1 == 0)
+
25  return num2;
+
26  if (num2 == 0)
+
27  return num1;
+
28 
+
29  // base case
+
30  if (num1 == num2)
+
31  return num1;
+
32 
+
33  // a is greater
+
34  if (num1 > num2)
+
35  return gcd(num1 - num2, num2);
+
36  return gcd(num1, num2 - num1);
+
37 }
+
+
+
+ +

◆ main()

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

Main function

+
42  {
+
43  std::cout << "gcd of 120,7 is " << (gcd(120, 7)) << std::endl;
+
44  try {
+
45  std::cout << "gcd of -120,10 is " << gcd(-120, 10) << std::endl;
+
46  } catch (const std::domain_error &e) {
+
47  std::cout << "Error handling was successful" << std::endl;
+
48  }
+
49  std::cout << "gcd of 312,221 is " << (gcd(312, 221)) << std::endl;
+
50  std::cout << "gcd of 289,204 is " << (gcd(289, 204)) << std::endl;
+
51  return 0;
+
52 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
int gcd(int num1, int num2)
Definition: gcd_recursive_euclidean.cpp:14
+ +
T endl(T... args)
+ + + + diff --git a/d4/d45/gcd__recursive__euclidean_8cpp.js b/d4/d45/gcd__recursive__euclidean_8cpp.js new file mode 100644 index 000000000..cb8f513ac --- /dev/null +++ b/d4/d45/gcd__recursive__euclidean_8cpp.js @@ -0,0 +1,5 @@ +var gcd__recursive__euclidean_8cpp = +[ + [ "gcd", "d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e", null ], + [ "main", "d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..deb118b88 --- /dev/null +++ b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..5328ec2a1 --- /dev/null +++ b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +b86b27d1965842cad0032b0a94ca524d \ No newline at end of file diff --git a/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..2133f5e93 --- /dev/null +++ b/d4/d45/gcd__recursive__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +gcd + + + + + +Node1->Node3 + + + + + diff --git a/d4/d59/large__factorial_8cpp__incl.map b/d4/d59/large__factorial_8cpp__incl.map new file mode 100644 index 000000000..8305daeee --- /dev/null +++ b/d4/d59/large__factorial_8cpp__incl.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/d4/d59/large__factorial_8cpp__incl.md5 b/d4/d59/large__factorial_8cpp__incl.md5 new file mode 100644 index 000000000..5c5c35cda --- /dev/null +++ b/d4/d59/large__factorial_8cpp__incl.md5 @@ -0,0 +1 @@ +8fb77ccff37a413f4f4832efcd1f7cbe \ No newline at end of file diff --git a/d4/d59/large__factorial_8cpp__incl.svg b/d4/d59/large__factorial_8cpp__incl.svg new file mode 100644 index 000000000..da81bf9f1 --- /dev/null +++ b/d4/d59/large__factorial_8cpp__incl.svg @@ -0,0 +1,169 @@ + + + + + + +math/large_factorial.cpp + + + +Node1 + + +math/large_factorial.cpp + + + + + +Node2 + + +cstring + + + + + +Node1->Node2 + + + + + +Node3 + + +ctime + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +./large_number.h + + + + + +Node1->Node5 + + + + + +Node5->Node2 + + + + + +Node5->Node4 + + + + + +Node6 + + +algorithm + + + + + +Node5->Node6 + + + + + +Node7 + + +cassert + + + + + +Node5->Node7 + + + + + +Node8 + + +cinttypes + + + + + +Node5->Node8 + + + + + +Node9 + + +type_traits + + + + + +Node5->Node9 + + + + + +Node10 + + +vector + + + + + +Node5->Node10 + + + + + diff --git a/d4/d60/kohonen__som__trace_8cpp__incl.map b/d4/d60/kohonen__som__trace_8cpp__incl.map new file mode 100644 index 000000000..8c5c42875 --- /dev/null +++ b/d4/d60/kohonen__som__trace_8cpp__incl.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d4/d60/kohonen__som__trace_8cpp__incl.md5 b/d4/d60/kohonen__som__trace_8cpp__incl.md5 new file mode 100644 index 000000000..22bd2e644 --- /dev/null +++ b/d4/d60/kohonen__som__trace_8cpp__incl.md5 @@ -0,0 +1 @@ +b35af84eeb4930be52757e882a8fae69 \ No newline at end of file diff --git a/d4/d60/kohonen__som__trace_8cpp__incl.svg b/d4/d60/kohonen__som__trace_8cpp__incl.svg new file mode 100644 index 000000000..fd535f686 --- /dev/null +++ b/d4/d60/kohonen__som__trace_8cpp__incl.svg @@ -0,0 +1,231 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +machine_learning/kohonen_som_trace.cpp + + + +Node1 + + +machine_learning/kohonen +_som_trace.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +cstdlib + + + + + +Node1->Node4 + + + + + +Node5 + + +ctime + + + + + +Node1->Node5 + + + + + +Node6 + + +fstream + + + + + +Node1->Node6 + + + + + +Node7 + + +iostream + + + + + +Node1->Node7 + + + + + +Node8 + + +valarray + + + + + +Node1->Node8 + + + + + +Node9 + + +vector + + + + + +Node1->Node9 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/d60/kohonen__som__trace_8cpp__incl_org.svg b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg new file mode 100644 index 000000000..4f2c0fa3a --- /dev/null +++ b/d4/d60/kohonen__som__trace_8cpp__incl_org.svg @@ -0,0 +1,143 @@ + + + + + + +machine_learning/kohonen_som_trace.cpp + + + +Node1 + + +machine_learning/kohonen +_som_trace.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +cstdlib + + + + + +Node1->Node4 + + + + + +Node5 + + +ctime + + + + + +Node1->Node5 + + + + + +Node6 + + +fstream + + + + + +Node1->Node6 + + + + + +Node7 + + +iostream + + + + + +Node1->Node7 + + + + + +Node8 + + +valarray + + + + + +Node1->Node8 + + + + + +Node9 + + +vector + + + + + +Node1->Node9 + + + + + diff --git a/d4/d68/qr__decompose_8h.html b/d4/d68/qr__decompose_8h.html new file mode 100644 index 000000000..9a1e6267e --- /dev/null +++ b/d4/d68/qr__decompose_8h.html @@ -0,0 +1,167 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/qr_decompose.h File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
qr_decompose.h File Reference
+
+
+ +

Library functions to compute QR decomposition of a given matrix. +More...

+
#include <cmath>
+#include <cstdlib>
+#include <iomanip>
+#include <iostream>
+#include <limits>
+#include <numeric>
+#include <valarray>
+
+Include dependency graph for qr_decompose.h:
+
+
+
+
+
+This graph shows which files directly or indirectly include this file:
+
+
+
+
+
+

Go to the source code of this file.

+ + + + + +

+Namespaces

 qr_algorithm
 Functions to compute QR decomposition of any rectangular matrix.
 
+ + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
std::ostreamqr_algorithm::operator<< (std::ostream &out, std::valarray< std::valarray< T >> const &v)
 
template<typename T >
std::ostreamqr_algorithm::operator<< (std::ostream &out, std::valarray< T > const &v)
 
template<typename T >
double qr_algorithm::vector_dot (const std::valarray< T > &a, const std::valarray< T > &b)
 
template<typename T >
double qr_algorithm::vector_mag (const std::valarray< T > &a)
 
template<typename T >
std::valarray< T > qr_algorithm::vector_proj (const std::valarray< T > &a, const std::valarray< T > &b)
 
template<typename T >
void qr_algorithm::qr_decompose (const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
 
+

Detailed Description

+

Library functions to compute QR decomposition of a given matrix.

+
Author
Krishna Vedala
+
+
+ + + + diff --git a/d4/d68/qr__decompose_8h.js b/d4/d68/qr__decompose_8h.js new file mode 100644 index 000000000..c86abc107 --- /dev/null +++ b/d4/d68/qr__decompose_8h.js @@ -0,0 +1,9 @@ +var qr__decompose_8h = +[ + [ "operator<<", "d4/d68/qr__decompose_8h.html#a7c63c78d6839b8ad73b77c161210b514", null ], + [ "operator<<", "d4/d68/qr__decompose_8h.html#a240edf2b6b5942c0e5f2c9d3e326797f", null ], + [ "qr_decompose", "d4/d68/qr__decompose_8h.html#ab1ac74497ffb2101040cc1efe3546de8", null ], + [ "vector_dot", "d4/d68/qr__decompose_8h.html#a8ea313a1a1b5f9d0e3e332c29c6446ec", null ], + [ "vector_mag", "d4/d68/qr__decompose_8h.html#ad16da2183db22378435042f26af43d5f", null ], + [ "vector_proj", "d4/d68/qr__decompose_8h.html#a5422c76bfa322620de611083bd518d71", null ] +]; \ No newline at end of file diff --git a/d4/d68/qr__decompose_8h_source.html b/d4/d68/qr__decompose_8h_source.html new file mode 100644 index 000000000..567298a94 --- /dev/null +++ b/d4/d68/qr__decompose_8h_source.html @@ -0,0 +1,473 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/qr_decompose.h Source File + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
qr_decompose.h
+
+
+Go to the documentation of this file.
1 /**
+
2  * @file
+
3  * \brief Library functions to compute [QR
+
4  * decomposition](https://en.wikipedia.org/wiki/QR_decomposition) of a given
+
5  * matrix.
+
6  * \author [Krishna Vedala](https://github.com/kvedala)
+
7  */
+
8 
+
9 #ifndef NUMERICAL_METHODS_QR_DECOMPOSE_H_
+
10 #define NUMERICAL_METHODS_QR_DECOMPOSE_H_
+
11 
+
12 #include <cmath>
+
13 #include <cstdlib>
+
14 #include <iomanip>
+
15 #include <iostream>
+
16 #include <limits>
+
17 #include <numeric>
+
18 #include <valarray>
+
19 #ifdef _OPENMP
+
20 #include <omp.h>
+
21 #endif
+
22 
+
23 /** \namespace qr_algorithm
+
24  * \brief Functions to compute [QR
+
25  * decomposition](https://en.wikipedia.org/wiki/QR_decomposition) of any
+
26  * rectangular matrix
+
27  */
+
28 namespace qr_algorithm {
+
29 /**
+
30  * operator to print a matrix
+
31  */
+
32 template <typename T>
+ +
34  std::valarray<std::valarray<T>> const &v) {
+
35  const int width = 12;
+
36  const char separator = ' ';
+
37 
+
38  out.precision(4);
+
39  for (size_t row = 0; row < v.size(); row++) {
+
40  for (size_t col = 0; col < v[row].size(); col++)
+
41  out << std::right << std::setw(width) << std::setfill(separator)
+
42  << v[row][col];
+
43  out << std::endl;
+
44  }
+
45 
+
46  return out;
+
47 }
+
48 
+
49 /**
+
50  * operator to print a vector
+
51  */
+
52 template <typename T>
+ +
54  const int width = 10;
+
55  const char separator = ' ';
+
56 
+
57  out.precision(4);
+
58  for (size_t row = 0; row < v.size(); row++) {
+
59  out << std::right << std::setw(width) << std::setfill(separator)
+
60  << v[row];
+
61  }
+
62 
+
63  return out;
+
64 }
+
65 
+
66 /**
+
67  * Compute dot product of two vectors of equal lengths
+
68  *
+
69  * If \f$\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\f$ and
+
70  * \f$\vec{b}=\left[b_0,b_1,b_1,...,b_L\right]\f$ then
+
71  * \f$\vec{a}\cdot\vec{b}=\displaystyle\sum_{i=0}^L a_i\times b_i\f$
+
72  *
+
73  * \returns \f$\vec{a}\cdot\vec{b}\f$
+
74  */
+
75 template <typename T>
+
76 inline double vector_dot(const std::valarray<T> &a, const std::valarray<T> &b) {
+
77  return (a * b).sum();
+
78  // could also use following
+
79  // return std::inner_product(std::begin(a), std::end(a), std::begin(b),
+
80  // 0.f);
+
81 }
+
82 
+
83 /**
+
84  * Compute magnitude of vector.
+
85  *
+
86  * If \f$\vec{a}=\left[a_0,a_1,a_2,...,a_L\right]\f$ then
+
87  * \f$\left|\vec{a}\right|=\sqrt{\displaystyle\sum_{i=0}^L a_i^2}\f$
+
88  *
+
89  * \returns \f$\left|\vec{a}\right|\f$
+
90  */
+
91 template <typename T>
+
92 inline double vector_mag(const std::valarray<T> &a) {
+
93  double dot = vector_dot(a, a);
+
94  return std::sqrt(dot);
+
95 }
+
96 
+
97 /**
+
98  * Compute projection of vector \f$\vec{a}\f$ on \f$\vec{b}\f$ defined as
+
99  * \f[\text{proj}_\vec{b}\vec{a}=\frac{\vec{a}\cdot\vec{b}}{\left|\vec{b}\right|^2}\vec{b}\f]
+
100  *
+
101  * \returns NULL if error, otherwise pointer to output
+
102  */
+
103 template <typename T>
+ +
105  const std::valarray<T> &b) {
+
106  double num = vector_dot(a, b);
+
107  double deno = vector_dot(b, b);
+
108 
+
109  /*! check for division by zero using machine epsilon */
+
110  if (deno <= std::numeric_limits<double>::epsilon()) {
+
111  std::cerr << "[" << __func__ << "] Possible division by zero\n";
+
112  return a; // return vector a back
+
113  }
+
114 
+
115  double scalar = num / deno;
+
116 
+
117  return b * scalar;
+
118 }
+
119 
+
120 /**
+
121  * Decompose matrix \f$A\f$ using [Gram-Schmidt
+
122  *process](https://en.wikipedia.org/wiki/QR_decomposition).
+
123  *
+
124  * \f{eqnarray*}{
+
125  * \text{given that}\quad A &=&
+
126  *\left[\mathbf{a}_1,\mathbf{a}_2,\ldots,\mathbf{a}_{N-1},\right]\\
+
127  * \text{where}\quad\mathbf{a}_i &=&
+
128  * \left[a_{0i},a_{1i},a_{2i},\ldots,a_{(M-1)i}\right]^T\quad\ldots\mbox{(column
+
129  * vectors)}\\
+
130  * \text{then}\quad\mathbf{u}_i &=& \mathbf{a}_i
+
131  *-\sum_{j=0}^{i-1}\text{proj}_{\mathbf{u}_j}\mathbf{a}_i\\
+
132  * \mathbf{e}_i &=&\frac{\mathbf{u}_i}{\left|\mathbf{u}_i\right|}\\
+
133  * Q &=& \begin{bmatrix}\mathbf{e}_0 & \mathbf{e}_1 & \mathbf{e}_2 & \dots &
+
134  * \mathbf{e}_{N-1}\end{bmatrix}\\
+
135  * R &=& \begin{bmatrix}\langle\mathbf{e}_0\,,\mathbf{a}_0\rangle &
+
136  * \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle &
+
137  * \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots \\
+
138  * 0 & \langle\mathbf{e}_1\,,\mathbf{a}_1\rangle &
+
139  * \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle & \dots\\
+
140  * 0 & 0 & \langle\mathbf{e}_2\,,\mathbf{a}_2\rangle &
+
141  * \dots\\ \vdots & \vdots & \vdots & \ddots
+
142  * \end{bmatrix}\\
+
143  * \f}
+
144  */
+
145 template <typename T>
+ +
147  const std::valarray<std::valarray<T>> &A, /**< input matrix to decompose */
+
148  std::valarray<std::valarray<T>> *Q, /**< output decomposed matrix */
+
149  std::valarray<std::valarray<T>> *R /**< output decomposed matrix */
+
150 ) {
+
151  std::size_t ROWS = A.size(); // number of rows of A
+
152  std::size_t COLUMNS = A[0].size(); // number of columns of A
+
153  std::valarray<T> col_vector(ROWS);
+
154  std::valarray<T> col_vector2(ROWS);
+
155  std::valarray<T> tmp_vector(ROWS);
+
156 
+
157  for (int i = 0; i < COLUMNS; i++) {
+
158  /* for each column => R is a square matrix of NxN */
+
159  int j;
+
160  R[0][i] = 0.; /* make R upper triangular */
+
161 
+
162  /* get corresponding Q vector */
+
163 #ifdef _OPENMP
+
164 // parallelize on threads
+
165 #pragma omp for
+
166 #endif
+
167  for (j = 0; j < ROWS; j++) {
+
168  tmp_vector[j] = A[j][i]; /* accumulator for uk */
+
169  col_vector[j] = A[j][i];
+
170  }
+
171  for (j = 0; j < i; j++) {
+
172  for (int k = 0; k < ROWS; k++) {
+
173  col_vector2[k] = Q[0][k][j];
+
174  }
+
175  col_vector2 = vector_proj(col_vector, col_vector2);
+
176  tmp_vector -= col_vector2;
+
177  }
+
178 
+
179  double mag = vector_mag(tmp_vector);
+
180 
+
181 #ifdef _OPENMP
+
182 // parallelize on threads
+
183 #pragma omp for
+
184 #endif
+
185  for (j = 0; j < ROWS; j++) Q[0][j][i] = tmp_vector[j] / mag;
+
186 
+
187  /* compute upper triangular values of R */
+
188 #ifdef _OPENMP
+
189 // parallelize on threads
+
190 #pragma omp for
+
191 #endif
+
192  for (int kk = 0; kk < ROWS; kk++) {
+
193  col_vector[kk] = Q[0][kk][i];
+
194  }
+
195 
+
196 #ifdef _OPENMP
+
197 // parallelize on threads
+
198 #pragma omp for
+
199 #endif
+
200  for (int k = i; k < COLUMNS; k++) {
+
201  for (int kk = 0; kk < ROWS; kk++) {
+
202  col_vector2[kk] = A[kk][k];
+
203  }
+
204  R[0][i][k] = (col_vector * col_vector2).sum();
+
205  }
+
206  }
+
207 }
+
208 } // namespace qr_algorithm
+
209 
+
210 #endif // NUMERICAL_METHODS_QR_DECOMPOSE_H_
+
+
+
bool check_termination(long double delta)
Definition: durand_kerner_roots.cpp:91
+
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_midpoint_euler.cpp:156
+
double Sqrt(double a)
Definition: sqrt_double.cpp:16
+
T srand(T... args)
+
unsigned int lcm(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:43
+
void tests()
Definition: least_common_multiple.cpp:48
+
std::vector< int > prime_numbers
Definition: prime_factorization.cpp:16
+
int main()
Definition: primes_up_to_billion.cpp:26
+
double semi_implicit_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the semi-implicit-Euler method in the given limits.
Definition: ode_semi_implicit_euler.cpp:103
+
std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)
Definition: lu_decompose.cpp:75
+
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: false_position.cpp:24
+
friend std::istream & operator>>(std::istream &input, stats_computer2 &stat)
Definition: realtime_stats.cpp:97
+
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: newton_raphson_method.cpp:22
+
STL class.
+
void semi_implicit_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the semi-implicit-Euler method.
Definition: ode_semi_implicit_euler.cpp:82
+
std::vector< int > primes(int max)
Definition: prime_numbers.cpp:12
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+ +
std::vector< T > operator+(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:195
+
static double eq(double i)
Definition: newton_raphson_method.cpp:26
+ +
T cos(T... args)
+
static double eq_der(double i)
Definition: newton_raphson_method.cpp:32
+
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_forward_euler.cpp:67
+
T atof(T... args)
+ +
T size(T... args)
+
int multiply(int x, int res[], int res_size)
Definition: power_for_huge_numbers.cpp:25
+
int main(int argc, char *argv[])
Definition: ode_forward_euler.cpp:188
+
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
+
int main()
Definition: sieve_of_eratosthenes.cpp:59
+
void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
+
const char * complex_str(const std::complex< double > &x)
Definition: durand_kerner_roots.cpp:76
+
T setfill(T... args)
+
int sgn(T val)
Definition: bisection_method.cpp:32
+
double std() const
Definition: realtime_stats.cpp:48
+
void midpoint_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the midpoint-Euler method.
Definition: ode_midpoint_euler.cpp:85
+
std::vector< std::pair< int, int > > factors
Definition: prime_factorization.cpp:19
+
bool is_square(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:54
+
int main()
Definition: prime_factorization.cpp:62
+
T sqrt(T... args)
+
void power(int x, int n)
Definition: power_for_huge_numbers.cpp:56
+
Functions to compute QR decomposition of any rectangular matrix.
+
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:71
+
int main()
Definition: prime_numbers.cpp:26
+
void forward_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the forward-Euler method.
Definition: ode_forward_euler.cpp:86
+
T push_back(T... args)
+
int main()
Definition: modular_inverse_fermat_little_theorem.cpp:84
+
T clock(T... args)
+
std::pair< uint32_t, double > durand_kerner_algo(const std::valarray< double > &coeffs, std::valarray< std::complex< double >> *roots, bool write_log=false)
Definition: durand_kerner_roots.cpp:109
+
std::ostream & operator<<(std::ostream &out, std::vector< std::vector< T >> const &v)
Definition: ordinary_least_squares_regressor.cpp:19
+
T isnan(T... args)
+
Statistical algorithms.
+
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_forward_euler.cpp:152
+
void init()
Definition: sieve_of_eratosthenes.cpp:52
+
T snprintf(T... args)
+
std::valarray< T > vector_proj(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:104
+ +
STL class.
+
int main()
Definition: false_position.cpp:39
+
T isinf(T... args)
+
double vector_mag(const std::valarray< T > &a)
Definition: qr_decompose.h:92
+
ll k
Definition: matrix_exponentiation.cpp:48
+
double variance() const
Definition: realtime_stats.cpp:89
+
unsigned int gcd(unsigned int x, unsigned int y)
Definition: least_common_multiple.cpp:16
+
int main()
Definition: sqrt_double.cpp:42
+
void sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:25
+
T close(T... args)
+
T perror(T... args)
+
std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
Definition: durand_kerner_roots.cpp:53
+
int main(int argc, char **argv)
Definition: lu_decompose.cpp:91
+
STL class.
+
int main()
Definition: ordinary_least_squares_regressor.cpp:357
+
T real(T... args)
+
void test1()
Definition: durand_kerner_roots.cpp:207
+
std::vector< float > predict_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< float > const &beta)
Definition: ordinary_least_squares_regressor.cpp:339
+
int main()
Definition: gaussian_elimination.cpp:9
+
T open(T... args)
+
#define ACCURACY
Definition: durand_kerner_roots.cpp:45
+
double mean() const
Definition: realtime_stats.cpp:42
+
Definition: realtime_stats.cpp:72
+
std::ostream & operator<<(std::ostream &out, std::valarray< std::valarray< T >> const &v)
Definition: qr_decompose.h:33
+
double forward_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the forward-Euler method in the given limits.
Definition: ode_forward_euler.cpp:102
+
int main(int argc, char **argv)
Definition: realtime_stats.cpp:158
+
int sgn(T val)
Definition: false_position.cpp:34
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T rand(T... args)
+
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_semi_implicit_euler.cpp:53
+
void test_function(const float *test_data, const int number_of_samples)
Definition: realtime_stats.cpp:118
+
T sin(T... args)
+
void SieveOfEratosthenes(int N)
Definition: prime_factorization.cpp:23
+
T substr(T... args)
+
int main()
Definition: least_common_multiple.cpp:67
+
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_forward_euler.cpp:54
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
#define MAX
Definition: sieve_of_eratosthenes.cpp:16
+
std::vector< float > fit_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< T > const &Y)
Definition: ordinary_least_squares_regressor.cpp:309
+
std::vector< T > operator-(std::vector< T > const &A, std::vector< T > const &B)
Definition: ordinary_least_squares_regressor.cpp:174
+
int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
+
T endl(T... args)
+
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:217
+
void new_val(T x)
Definition: realtime_stats.cpp:32
+
double vector_dot(const std::valarray< T > &a, const std::valarray< T > &b)
Definition: qr_decompose.h:76
+
T left(T... args)
+
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_midpoint_euler.cpp:53
+
void new_val(T x)
Definition: realtime_stats.cpp:77
+
double variance() const
Definition: realtime_stats.cpp:45
+
int main()
Definition: newton_raphson_method.cpp:37
+
double midpoint_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the midpoint-Euler method in the given limits.
Definition: ode_midpoint_euler.cpp:107
+
int main()
Definition: number_of_positive_divisors.cpp:62
+
T strtod(T... args)
+
int main()
Definition: power_for_huge_numbers.cpp:82
+
void prime_factorization(int num)
Definition: prime_factorization.cpp:40
+
T fixed(T... args)
+
Definition: realtime_stats.cpp:27
+
double std() const
Definition: realtime_stats.cpp:92
+
bool isprime[MAX]
Definition: sieve_of_eratosthenes.cpp:19
+
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
+
STL class.
+
T imag(T... args)
+
int main(int argc, char *argv[])
Definition: ode_semi_implicit_euler.cpp:189
+ +
static double eq(double i)
Definition: false_position.cpp:28
+
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
+
T make_pair(T... args)
+
T time(T... args)
+
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_semi_implicit_euler.cpp:153
+
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: bisection_method.cpp:22
+
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_semi_implicit_euler.cpp:66
+
T setw(T... args)
+
T max(T... args)
+
int main()
Definition: string_fibonacci.cpp:81
+
int number_of_positive_divisors(int n)
Definition: number_of_positive_divisors.cpp:34
+
static double eq(double i)
Definition: bisection_method.cpp:26
+
void fib_Accurate(uint64_t n)
Definition: string_fibonacci.cpp:68
+
void Sieve(int64_t n)
Definition: primes_up_to_billion.cpp:13
+ +
double mean() const
Definition: realtime_stats.cpp:86
+
bool isPrime(int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:68
+ +
T is_open(T... args)
+
void test2()
Definition: durand_kerner_roots.cpp:242
+
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_midpoint_euler.cpp:66
+
int lu_decomposition(const std::vector< std::vector< double >> &A, std::vector< std::vector< double >> *L, std::vector< std::vector< double >> *U)
Definition: lu_decompose.cpp:22
+
int main()
Definition: bisection_method.cpp:37
+
std::vector< float > operator/(std::vector< T > const &A, float const scalar)
Definition: ordinary_least_squares_regressor.cpp:165
+
T exit(T... args)
+
#define MAX
Definition: power_for_huge_numbers.cpp:10
+
friend std::istream & operator>>(std::istream &input, stats_computer1 &stat)
Definition: realtime_stats.cpp:53
+
int main(int argc, char *argv[])
Definition: ode_midpoint_euler.cpp:192
+
char prime[100000000]
Definition: primes_up_to_billion.cpp:10
+
T pow(T... args)
+
bool isprime[1000006]
Definition: prime_factorization.cpp:13
+
std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:288
+ + + + diff --git a/d4/d6d/struct_entry-members.html b/d4/d6d/struct_entry-members.html new file mode 100644 index 000000000..a7ad83d05 --- /dev/null +++ b/d4/d6d/struct_entry-members.html @@ -0,0 +1,115 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Entry Member List
+
+
+ +

This is the complete list of members for Entry, including all inherited members.

+ + + + + +
Entry(int key=notPresent) (defined in Entry)Entryinlineexplicit
Entry(int key=notPresent) (defined in Entry)Entryinlineexplicit
Entry(int key=notPresent) (defined in Entry)Entryinlineexplicit
key (defined in Entry)Entry
+
+ + + + diff --git a/d4/d72/qr__eigen__values_8cpp__incl.map b/d4/d72/qr__eigen__values_8cpp__incl.map new file mode 100644 index 000000000..6783b934b --- /dev/null +++ b/d4/d72/qr__eigen__values_8cpp__incl.map @@ -0,0 +1,13 @@ + + + + + + + + + + + + + diff --git a/d4/d72/qr__eigen__values_8cpp__incl.md5 b/d4/d72/qr__eigen__values_8cpp__incl.md5 new file mode 100644 index 000000000..c9b815bd3 --- /dev/null +++ b/d4/d72/qr__eigen__values_8cpp__incl.md5 @@ -0,0 +1 @@ +59ca5d316530e83f6ca2574df93cfafc \ No newline at end of file diff --git a/d4/d72/qr__eigen__values_8cpp__incl.svg b/d4/d72/qr__eigen__values_8cpp__incl.svg new file mode 100644 index 000000000..b55e917a3 --- /dev/null +++ b/d4/d72/qr__eigen__values_8cpp__incl.svg @@ -0,0 +1,191 @@ + + + + + + +numerical_methods/qr_eigen_values.cpp + + + +Node1 + + +numerical_methods/qr +_eigen_values.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +cstdlib + + + + + +Node1->Node4 + + + + + +Node5 + + +ctime + + + + + +Node1->Node5 + + + + + +Node6 + + +iostream + + + + + +Node1->Node6 + + + + + +Node7 + + +./qr_decompose.h + + + + + +Node1->Node7 + + + + + +Node7->Node3 + + + + + +Node7->Node4 + + + + + +Node7->Node6 + + + + + +Node8 + + +iomanip + + + + + +Node7->Node8 + + + + + +Node9 + + +limits + + + + + +Node7->Node9 + + + + + +Node10 + + +numeric + + + + + +Node7->Node10 + + + + + +Node11 + + +valarray + + + + + +Node7->Node11 + + + + + diff --git a/d4/d7a/shell__sort2_8cpp.html b/d4/d7a/shell__sort2_8cpp.html new file mode 100644 index 000000000..b3ae24fcd --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp.html @@ -0,0 +1,522 @@ + + + + + + + +Algorithms_in_C++: sorting/shell_sort2.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
shell_sort2.cpp File Reference
+
+
+ +

Shell sort algorithm +More...

+
#include <cassert>
+#include <cstdlib>
+#include <ctime>
+#include <iostream>
+#include <utility>
+#include <vector>
+
+Include dependency graph for shell_sort2.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 sorting
 Sorting algorithms.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<class T >
void show_data (T *arr, size_t LEN)
 
template<typename T , size_t N>
void show_data (T(&arr)[N])
 
template<typename T >
void sorting::shell_sort (T *arr, size_t LEN)
 
template<typename T , size_t N>
void sorting::shell_sort (T(&arr)[N])
 
template<typename T >
void sorting::shell_sort (std::vector< T > *arr)
 
template<typename T >
int compare (const void *a, const void *b)
 
void test_int (const int NUM_DATA)
 
void test_f (const int NUM_DATA)
 
int main (int argc, char *argv[])
 
+

Detailed Description

+

Shell sort algorithm

+
Author
Krishna Vedala
+

Function Documentation

+ +

◆ compare()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
int compare (const void * a,
const void * b 
)
+
+

function to compare sorting using cstdlib's qsort

+
87  {
+
88  T arg1 = *static_cast<const T *>(a);
+
89  T arg2 = *static_cast<const T *>(b);
+
90 
+
91  if (arg1 < arg2)
+
92  return -1;
+
93  if (arg1 > arg2)
+
94  return 1;
+
95  return 0;
+
96 
+
97  // return (arg1 > arg2) - (arg1 < arg2); // possible shortcut
+
98  // return arg1 - arg2; // erroneous shortcut (fails if INT_MIN is present)
+
99 }
+
+
+
+ +

◆ main()

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

Main function

+
183  {
+
184  // initialize random number generator - once per program
+
185  std::srand(std::time(NULL));
+
186 
+
187  test_int(100); // test with sorting random array of 100 values
+
188  std::cout << "Test 1 - 100 int values - passed. \n";
+
189  test_int(1000); // test with sorting random array of 1000 values
+
190  std::cout << "Test 2 - 1000 int values - passed.\n";
+
191  test_int(10000); // test with sorting random array of 10000 values
+
192  std::cout << "Test 3 - 10000 int values - passed.\n";
+
193 
+
194  test_f(100); // test with sorting random array of 100 values
+
195  std::cout << "Test 1 - 100 float values - passed. \n";
+
196  test_f(1000); // test with sorting random array of 1000 values
+
197  std::cout << "Test 2 - 1000 float values - passed.\n";
+
198  test_f(10000); // test with sorting random array of 10000 values
+
199  std::cout << "Test 3 - 10000 float values - passed.\n";
+
200 
+
201  int i, NUM_DATA;
+
202 
+
203  if (argc == 2)
+
204  NUM_DATA = atoi(argv[1]);
+
205  else
+
206  NUM_DATA = 200;
+
207 
+
208  // int array = new int[NUM_DATA];
+
209  int *data = new int[NUM_DATA];
+
210  // int array2 = new int[NUM_DATA];
+
211  int range = 1800;
+
212 
+
213  std::srand(time(NULL));
+
214  for (i = 0; i < NUM_DATA; i++) {
+
215  // allocate random numbers in the given range
+
216  data[i] = (std::rand() % range) - (range >> 1);
+
217  }
+
218 
+
219  std::cout << "Unsorted original data: " << std::endl;
+
220  show_data(data, NUM_DATA);
+
221  std::clock_t start = std::clock();
+
222  shell_sort(data, NUM_DATA); // perform sorting
+ +
224 
+ +
226  << "Data Sorted using custom implementation: " << std::endl;
+
227  show_data(data, NUM_DATA);
+
228 
+
229  double elapsed_time = (end - start) * 1.f / CLOCKS_PER_SEC;
+
230  std::cout << "Time spent sorting: " << elapsed_time << "s\n" << std::endl;
+
231 
+
232  delete[] data;
+
233  return 0;
+
234 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ show_data() [1/2]

+ +
+
+
+template<class T >
+ + + + + + + + + + + + + + + + + + +
void show_data (T * arr,
size_t LEN 
)
+
+

pretty print array

Parameters
+ + + +
[in]arrarray to print
[in]LENlength of array to print
+
+
+
18  {
+
19  size_t i;
+
20 
+
21  for (i = 0; i < LEN; i++) {
+
22  std::cout << arr[i] << ", ";
+
23  }
+ +
25 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ show_data() [2/2]

+ +
+
+
+template<typename T , size_t N>
+ + + + + + + + +
void show_data (T(&) arr[N])
+
+

pretty print array

Parameters
+ + + +
[in]arrarray to print
[in]Nlength of array to print
+
+
+
32  {
+
33  show_data(arr, N);
+
34 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_f()

+ +
+
+ + + + + + + + +
void test_f (const int NUM_DATA)
+
+

Test implementation of shell_sort on float arrays by comparing results against std::qsort.

+
145  {
+
146  // int array = new int[NUM_DATA];
+
147  float *data = new float[NUM_DATA];
+
148  float *data2 = new float[NUM_DATA];
+
149  // int array2 = new int[NUM_DATA];
+
150  int range = 1000;
+
151 
+
152  for (int i = 0; i < NUM_DATA; i++) {
+
153  data[i] = data2[i] = ((std::rand() % range) - (range >> 1)) / 100.;
+
154  }
+
155 
+
156  /* sort using our implementation */
+
157  std::clock_t start = std::clock();
+
158  shell_sort(data, NUM_DATA);
+ +
160  double elapsed_time = static_cast<double>(end - start) / CLOCKS_PER_SEC;
+
161  std::cout << "Time spent sorting using shell_sort2: " << elapsed_time
+
162  << "s\n";
+
163 
+
164  /* sort using std::qsort */
+
165  start = std::clock();
+
166  std::qsort(data2, NUM_DATA, sizeof(data2[0]), compare<float>);
+
167  end = std::clock();
+
168 
+
169  elapsed_time = static_cast<double>(end - start) / CLOCKS_PER_SEC;
+
170  std::cout << "Time spent sorting using std::qsort: " << elapsed_time
+
171  << "s\n";
+
172 
+
173  for (int i = 0; i < NUM_DATA; i++) {
+
174  assert(data[i] == data2[i]); // ensure that our sorting results match
+
175  // the standard results
+
176  }
+
177 
+
178  delete[] data;
+
179  delete[] data2;
+
180 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_int()

+ +
+
+ + + + + + + + +
void test_int (const int NUM_DATA)
+
+

Test implementation of shell_sort on integer arrays by comparing results against std::qsort.

+
105  {
+
106  // int array = new int[NUM_DATA];
+
107  int *data = new int[NUM_DATA];
+
108  int *data2 = new int[NUM_DATA];
+
109  // int array2 = new int[NUM_DATA];
+
110  int range = 1800;
+
111 
+
112  for (int i = 0; i < NUM_DATA; i++)
+
113  data[i] = data2[i] = (std::rand() % range) - (range >> 1);
+
114 
+
115  /* sort using our implementation */
+
116  std::clock_t start = std::clock();
+
117  shell_sort(data, NUM_DATA);
+ +
119  double elapsed_time = static_cast<double>(end - start) / CLOCKS_PER_SEC;
+
120  std::cout << "Time spent sorting using shell_sort2: " << elapsed_time
+
121  << "s\n";
+
122 
+
123  /* sort using std::qsort */
+
124  start = std::clock();
+
125  std::qsort(data2, NUM_DATA, sizeof(data2[0]), compare<int>);
+
126  end = std::clock();
+
127 
+
128  elapsed_time = static_cast<double>(end - start) / CLOCKS_PER_SEC;
+
129  std::cout << "Time spent sorting using std::qsort: " << elapsed_time
+
130  << "s\n";
+
131 
+
132  for (int i = 0; i < NUM_DATA; i++) {
+
133  assert(data[i] == data2[i]); // ensure that our sorting results match
+
134  // the standard results
+
135  }
+
136 
+
137  delete[] data;
+
138  delete[] data2;
+
139 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T srand(T... args)
+
void test_f(const int NUM_DATA)
Definition: shell_sort2.cpp:145
+
void show_data(T *arr, size_t LEN)
Definition: shell_sort2.cpp:18
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+ +
T clock(T... args)
+
void test_int(const int NUM_DATA)
Definition: shell_sort2.cpp:105
+ +
T atoi(T... args)
+
T qsort(T... args)
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T rand(T... args)
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
T endl(T... args)
+
Definition: huffman.cpp:28
+
T time(T... args)
+
T end(T... args)
+
void shell_sort(std::vector< T > *arr)
Definition: shell_sort2.cpp:75
+ + + + diff --git a/d4/d7a/shell__sort2_8cpp.js b/d4/d7a/shell__sort2_8cpp.js new file mode 100644 index 000000000..aa645be25 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp.js @@ -0,0 +1,12 @@ +var shell__sort2_8cpp = +[ + [ "compare", "d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c", null ], + [ "main", "d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "shell_sort", "d4/d7a/shell__sort2_8cpp.html#af2c5b92cbfe73f63f6074c61b0a45331", null ], + [ "shell_sort", "d4/d7a/shell__sort2_8cpp.html#a5669396c6a6b1e14b97589b6e37980aa", null ], + [ "shell_sort", "d4/d7a/shell__sort2_8cpp.html#a4d76603c54d3dc56146e92d10a043924", null ], + [ "show_data", "d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246", null ], + [ "show_data", "d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6", null ], + [ "test_f", "d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d", null ], + [ "test_int", "d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e", null ] +]; \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map new file mode 100644 index 000000000..8c303dc0d --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map @@ -0,0 +1,14 @@ + + + + + + + + + + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 new file mode 100644 index 000000000..a16fa6a7f --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 @@ -0,0 +1 @@ +812d230fd2b0faf5643b5581462b3ba1 \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg new file mode 100644 index 000000000..d4841201e --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -0,0 +1,235 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node4 + + +std::rand + + + + + +Node1->Node4 + + + + + +Node5 + + +sorting::shell_sort + + + + + +Node1->Node5 + + + + + +Node7 + + +show_data + + + + + +Node1->Node7 + + + + + +Node8 + + +std::srand + + + + + +Node1->Node8 + + + + + +Node9 + + +test_f + + + + + +Node1->Node9 + + + + + +Node11 + + +test_int + + + + + +Node1->Node11 + + + + + +Node12 + + +std::time + + + + + +Node1->Node12 + + + + + +Node6 + + +sorting::shell_sort + + + + + +Node5->Node6 + + + + + +Node7->Node3 + + + + + +Node9->Node2 + + + + + +Node9->Node4 + + + + + +Node9->Node5 + + + + + +Node10 + + +std::qsort + + + + + +Node9->Node10 + + + + + +Node11->Node2 + + + + + +Node11->Node4 + + + + + +Node11->Node5 + + + + + +Node11->Node10 + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map new file mode 100644 index 000000000..070e7b260 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 new file mode 100644 index 000000000..64a1bd58d --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.md5 @@ -0,0 +1 @@ +8c97e2ca8e8ba98d949db5d5fdd1b107 \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg new file mode 100644 index 000000000..03a217d04 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a22ea0d1f7943ebb4371d31e44b465b6d_cgraph.svg @@ -0,0 +1,97 @@ + + + + + + +test_f + + + +Node1 + + +test_f + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::qsort + + + + + +Node1->Node3 + + + + + +Node4 + + +std::rand + + + + + +Node1->Node4 + + + + + +Node5 + + +sorting::shell_sort + + + + + +Node1->Node5 + + + + + +Node6 + + +sorting::shell_sort + + + + + +Node5->Node6 + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map new file mode 100644 index 000000000..3c8b874e8 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 new file mode 100644 index 000000000..ea991d5a1 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.md5 @@ -0,0 +1 @@ +970a233cb66fe44417f3f67bd58ef33a \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg new file mode 100644 index 000000000..41922d6ad --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a63aaff7cabfa3da2da8b9477b5fad9d6_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +show_data + + + +Node1 + + +show_data + + + + + +Node2 + + +show_data + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map new file mode 100644 index 000000000..f8b073597 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 new file mode 100644 index 000000000..eda02a944 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.md5 @@ -0,0 +1 @@ +6fdbd3961686ad9c94cf92f09ce49f18 \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg new file mode 100644 index 000000000..91dafec98 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a895b313cb2671e8f712040460325573e_cgraph.svg @@ -0,0 +1,97 @@ + + + + + + +test_int + + + +Node1 + + +test_int + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::qsort + + + + + +Node1->Node3 + + + + + +Node4 + + +std::rand + + + + + +Node1->Node4 + + + + + +Node5 + + +sorting::shell_sort + + + + + +Node1->Node5 + + + + + +Node6 + + +sorting::shell_sort + + + + + +Node5->Node6 + + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map new file mode 100644 index 000000000..a809b4d64 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5 b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5 new file mode 100644 index 000000000..02c7b3403 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.md5 @@ -0,0 +1 @@ +b7bc3450f2a6c3644f098184a9ef4054 \ No newline at end of file diff --git a/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg new file mode 100644 index 000000000..5dc5d5b34 --- /dev/null +++ b/d4/d7a/shell__sort2_8cpp_a951127aea9d7e1e53ea9ae0868633246_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +show_data + + + +Node1 + + +show_data + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d4/d86/large__number_8h.html b/d4/d86/large__number_8h.html new file mode 100644 index 000000000..fb0d39a8c --- /dev/null +++ b/d4/d86/large__number_8h.html @@ -0,0 +1,144 @@ + + + + + + + +Algorithms_in_C++: math/large_number.h File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
large_number.h File Reference
+
+
+ +

Library to perform arithmatic operations on arbitrarily large numbers. +More...

+
#include <algorithm>
+#include <cassert>
+#include <cinttypes>
+#include <cstring>
+#include <iostream>
+#include <type_traits>
+#include <vector>
+
+Include dependency graph for large_number.h:
+
+
+
+
+
+This graph shows which files directly or indirectly include this file:
+
+
+
+
+
+

Go to the source code of this file.

+ + + + +

+Classes

class  large_number
 
+

Detailed Description

+

Library to perform arithmatic operations on arbitrarily large numbers.

+
Author
Krishna Vedala
+
+
+ + + + diff --git a/d4/d86/large__number_8h_source.html b/d4/d86/large__number_8h_source.html new file mode 100644 index 000000000..411997aef --- /dev/null +++ b/d4/d86/large__number_8h_source.html @@ -0,0 +1,655 @@ + + + + + + + +Algorithms_in_C++: math/large_number.h Source File + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
large_number.h
+
+
+Go to the documentation of this file.
1 /**
+
2  * @file
+
3  * @brief Library to perform arithmatic operations on arbitrarily large
+
4  * numbers.
+
5  * \author [Krishna Vedala](https://github.com/kvedala)
+
6  */
+
7 
+
8 #ifndef MATH_LARGE_NUMBER_H_
+
9 #define MATH_LARGE_NUMBER_H_
+
10 #include <algorithm>
+
11 #include <cassert>
+
12 #include <cinttypes>
+
13 #include <cstring>
+
14 #include <iostream>
+
15 #include <type_traits>
+
16 #include <vector>
+
17 
+
18 /**
+
19  * Store large unsigned numbers as a C++ vector
+
20  * The class provides convenience functions to add a
+
21  * digit to the number, perform multiplication of
+
22  * large number with long unsigned integers.
+
23  **/
+
24 class large_number {
+
25  public:
+
26  /**< initializer with value = 1 */
+ +
28 
+
29  // /**< initializer from an integer */
+
30  // explicit large_number(uint64_t n) {
+
31  // uint64_t carry = n;
+
32  // do {
+
33  // add_digit(carry % 10);
+
34  // carry /= 10;
+
35  // } while (carry != 0);
+
36  // }
+
37 
+
38  /**< initializer from an integer */
+
39  explicit large_number(int n) {
+
40  int carry = n;
+
41  do {
+
42  add_digit(carry % 10);
+
43  carry /= 10;
+
44  } while (carry != 0);
+
45  }
+
46 
+
47  /**< initializer from another large_number */
+ +
49 
+
50  /**< initializer from a vector */
+ +
52 
+
53  /**< initializer from a string */
+
54  explicit large_number(char const *number_str) {
+
55  for (size_t i = strlen(number_str); i > 0; i--) {
+
56  unsigned char a = number_str[i - 1] - '0';
+
57  if (a >= 0 && a <= 9)
+ +
59  }
+
60  }
+
61 
+
62  /**
+
63  * Function to check implementation
+
64  **/
+
65  static bool test() {
+
66  std::cout << "------ Checking `large_number` class implementations\t"
+
67  << std::endl;
+
68  large_number a(40);
+
69  // 1. test multiplication
+
70  a *= 10;
+
71  if (a != large_number(400)) {
+
72  std::cerr << "\tFailed 1/6 (" << a << "!=400)" << std::endl;
+
73  return false;
+
74  }
+
75  std::cout << "\tPassed 1/6...";
+
76  // 2. test compound addition with integer
+
77  a += 120;
+
78  if (a != large_number(520)) {
+
79  std::cerr << "\tFailed 2/6 (" << a << "!=520)" << std::endl;
+
80  return false;
+
81  }
+
82  std::cout << "\tPassed 2/6...";
+
83  // 3. test compound multiplication again
+
84  a *= 10;
+
85  if (a != large_number(5200)) {
+
86  std::cerr << "\tFailed 3/6 (" << a << "!=5200)" << std::endl;
+
87  return false;
+
88  }
+
89  std::cout << "\tPassed 3/6...";
+
90  // 4. test increment (prefix)
+
91  ++a;
+
92  if (a != large_number(5201)) {
+
93  std::cerr << "\tFailed 4/6 (" << a << "!=5201)" << std::endl;
+
94  return false;
+
95  }
+
96  std::cout << "\tPassed 4/6...";
+
97  // 5. test increment (postfix)
+
98  a++;
+
99  if (a != large_number(5202)) {
+
100  std::cerr << "\tFailed 5/6 (" << a << "!=5202)" << std::endl;
+
101  return false;
+
102  }
+
103  std::cout << "\tPassed 5/6...";
+
104  // 6. test addition with another large number
+
105  a = a + large_number("7000000000000000000000000000000");
+
106  if (a != large_number("7000000000000000000000000005202")) {
+
107  std::cerr << "\tFailed 6/6 (" << a
+
108  << "!=7000000000000000000000000005202)" << std::endl;
+
109  return false;
+
110  }
+
111  std::cout << "\tPassed 6/6..." << std::endl;
+
112  return true;
+
113  }
+
114 
+
115  /**
+
116  * add a digit at MSB to the large number
+
117  **/
+
118  void add_digit(unsigned int value) {
+
119  if (value > 9) {
+
120  std::cerr << "digit > 9!!\n";
+
121  exit(EXIT_FAILURE);
+
122  }
+
123 
+
124  _digits.push_back(value);
+
125  }
+
126 
+
127  /**
+
128  * Get number of digits in the number
+
129  **/
+
130  const size_t num_digits() const { return _digits.size(); }
+
131 
+
132  /**
+
133  * operator over load to access the
+
134  * i^th digit conveniently and also
+
135  * assign value to it
+
136  **/
+
137  inline unsigned char &operator[](size_t n) { return this->_digits[n]; }
+
138 
+
139  inline const unsigned char &operator[](size_t n) const {
+
140  return this->_digits[n];
+
141  }
+
142 
+
143  /**
+
144  * operator overload to compare two numbers
+
145  **/
+ +
147  for (size_t i = a.num_digits(); i > 0; i--)
+
148  out << static_cast<int>(a[i - 1]);
+
149  return out;
+
150  }
+
151 
+
152  /**
+
153  * operator overload to compare two numbers
+
154  **/
+
155  friend bool operator==(large_number const &a, large_number const &b) {
+
156  size_t N = a.num_digits();
+
157  if (N != b.num_digits())
+
158  return false;
+
159  for (size_t i = 0; i < N; i++)
+
160  if (a[i] != b[i])
+
161  return false;
+
162  return true;
+
163  }
+
164 
+
165  /**
+
166  * operator overload to compare two numbers
+
167  **/
+
168  friend bool operator!=(large_number const &a, large_number const &b) {
+
169  return !(a == b);
+
170  }
+
171 
+
172  /**
+
173  * operator overload to increment (prefix)
+
174  **/
+ +
176  (*this) += 1;
+
177  return *this;
+
178  }
+
179 
+
180  /**
+
181  * operator overload to increment (postfix)
+
182  **/
+ +
184  static large_number tmp(_digits);
+
185  ++(*this);
+
186  return tmp;
+
187  }
+
188 
+
189  /**
+
190  * operator overload to add
+
191  **/
+ +
193  // if adding with another large_number
+
194  large_number *b = reinterpret_cast<large_number *>(&n);
+
195  const size_t max_L = std::max(this->num_digits(), b->num_digits());
+
196  unsigned int carry = 0;
+
197  size_t i;
+
198  for (i = 0; i < max_L || carry != 0; i++) {
+
199  if (i < b->num_digits())
+
200  carry += (*b)[i];
+
201  if (i < this->num_digits())
+
202  carry += (*this)[i];
+
203  if (i < this->num_digits())
+
204  (*this)[i] = carry % 10;
+
205  else
+
206  this->add_digit(carry % 10);
+
207  carry /= 10;
+
208  }
+
209  return *this;
+
210  }
+
211 
+
212  large_number &operator+=(int n) { return (*this) += large_number(n); }
+
213  // large_number &operator+=(uint64_t n) { return (*this) += large_number(n);
+
214  // }
+
215 
+
216  /**
+
217  * operator overload to perform addition
+
218  **/
+
219  template <class T>
+
220  friend large_number &operator+(const large_number &a, const T &b) {
+
221  static large_number c = a;
+
222  c += b;
+
223  return c;
+
224  }
+
225 
+
226  /**
+
227  * assignment operator
+
228  **/
+ +
230  this->_digits = b._digits;
+
231  return *this;
+
232  }
+
233 
+
234  /**
+
235  * operator overload to increment
+
236  **/
+
237  template <class T>
+
238  large_number &operator*=(const T n) {
+
239  static_assert(std::is_integral<T>::value,
+
240  "Must be integer addition unsigned integer types.");
+
241  this->multiply(n);
+
242  return *this;
+
243  }
+
244 
+
245  /**
+
246  * returns i^th digit as an ASCII character
+
247  **/
+
248  const char digit_char(size_t i) const {
+
249  return _digits[num_digits() - i - 1] + '0';
+
250  }
+
251 
+
252  private:
+
253  /**
+
254  * multiply large number with another integer and
+
255  * store the result in the same large number
+
256  **/
+
257  template <class T>
+
258  void multiply(const T n) {
+
259  static_assert(std::is_integral<T>::value,
+
260  "Can only have integer types.");
+
261  // assert(!(std::is_signed<T>::value)); //, "Implemented only for
+
262  // unsigned integer types.");
+
263 
+
264  size_t i;
+
265  uint64_t carry = 0, temp;
+
266  for (i = 0; i < this->num_digits(); i++) {
+
267  temp = (*this)[i] * n;
+
268  temp += carry;
+
269  if (temp < 10) {
+
270  carry = 0;
+
271  } else {
+
272  carry = temp / 10;
+
273  temp = temp % 10;
+
274  }
+
275  (*this)[i] = temp;
+
276  }
+
277 
+
278  while (carry != 0) {
+
279  this->add_digit(carry % 10);
+
280  carry /= 10;
+
281  }
+
282  }
+
283 
+ +
285  _digits; /**< where individual digits are stored */
+
286 };
+
287 
+
288 #endif // MATH_LARGE_NUMBER_H_
+
+
+
int binExpo(int a, int b)
Definition: binary_exponent.cpp:28
+
void add_digit(unsigned int value)
Definition: large_number.h:118
+
T showpoint(T... args)
+
void pop()
Definition: stack.h:60
+
Definition: trie_tree.cpp:8
+
T srand(T... args)
+
int main()
main function
Definition: double_factorial.cpp:36
+
int main()
Definition: gcd_of_n_numbers.cpp:28
+
T setprecision(T... args)
+
T resize(T... args)
+ +
T make_tuple(T... args)
+
static bool isCyclicBFS(Graph const &graph)
Definition: cycle_check_directed_graph.cpp:241
+
T strlen(T... args)
+ +
STL class.
+
STL class.
+
void addVertices(unsigned int num=1)
Definition: cycle_check_directed_graph.cpp:122
+
bool test1()
Definition: large_factorial.cpp:17
+
STL class.
+
T fabs(T... args)
+
T inner_product(T... args)
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+ +
int gcd(int num1, int num2)
Definition: gcd_iterative_euclidean.cpp:15
+
T move(T... args)
+
int main()
Main function.
Definition: fibonacci.cpp:28
+
friend std::ostream & operator<<(std::ostream &out, const large_number &a)
Definition: large_number.h:146
+
large_number(std::vector< unsigned char > &vec)
Definition: large_number.h:51
+
void deQueue()
Definition: queue.h:67
+
void update_step(T *r, T *r0, const T2 quotient)
Definition: extended_euclid_algorithm.cpp:24
+ +
Definition: bfs.cpp:3
+
uint64_t double_factorial_iterative(uint64_t n)
Definition: double_factorial.cpp:16
+
adaline(int num_features, const double eta=0.01f, const double accuracy=1e-5)
Definition: adaline_learning.cpp:51
+
Definition: trie_modern.cpp:16
+ +
T system(T... args)
+
T find(T... args)
+
void test1()
Definition: kohonen_som_topology.cpp:357
+
T size(T... args)
+
double fit(const std::vector< double > &x, const int &y)
Definition: adaline_learning.cpp:110
+
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
+
STL class.
+
Definition: large_number.h:24
+
large_number fib(uint64_t n)
Definition: fibonacci_large.cpp:24
+
int main()
Definition: fibonacci_fast.cpp:47
+
void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
+ +
int main(int argc, char **argv)
Definition: kohonen_som_topology.cpp:564
+
static bool hasChildren(std::shared_ptr< TrieNode > node)
Definition: trie_modern.cpp:41
+
T emplace(T... args)
+
int main(int argc, char *argv[])
Definition: large_factorial.cpp:89
+
void test_3d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:347
+
Definition: trie_modern.cpp:26
+
T distance(T... args)
+
int gcd(int num1, int num2)
Definition: gcd_recursive_euclidean.cpp:14
+
Library to perform arithmatic operations on arbitrarily large numbers.
+
Definition: avltree.cpp:13
+
int binExpo_alt(int a, int b)
Definition: binary_exponent.cpp:42
+
T search(T... args)
+
int save_nd_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_trace.cpp:57
+
struct list node
+
T scanf(T... args)
+
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_trace.cpp:438
+
T reverse(T... args)
+
Graph(unsigned int vertices, std::vector< Edge > const &edges)
Definition: cycle_check_directed_graph.cpp:90
+
T back(T... args)
+
const char digit_char(size_t i) const
Definition: large_number.h:248
+
int predict(const std::vector< double > &x, double *out=nullptr)
Definition: adaline_learning.cpp:90
+
Machine learning algorithms.
+
int main()
Definition: gcd_recursive_euclidean.cpp:42
+
double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)
Definition: kohonen_som_topology.cpp:191
+
STL class.
+
Definition: bellman_ford.cpp:13
+
Definition: bridge_finding_with_tarjan_algorithm.cpp:13
+
void get_min_2d(const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx)
Definition: kohonen_som_topology.cpp:97
+
T front(T... args)
+
T sort(T... args)
+
bool check_size_match(const std::vector< double > &x)
Definition: adaline_learning.cpp:174
+
T sqrt(T... args)
+
Definition: double_hash_hash_table.cpp:28
+
void test1()
Definition: kohonen_som_trace.cpp:225
+
large_number & operator+=(large_number n)
Definition: large_number.h:192
+
const size_t num_digits() const
Definition: large_number.h:130
+
Definition: mo.cpp:6
+
bool is_prime(T num)
Definition: check_prime.cpp:22
+
double fast_power_recursive(T a, T b)
Definition: fast_power.cpp:26
+
T tie(T... args)
+
Definition: linkedlist_implentation_usingarray.cpp:14
+
T push_back(T... args)
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
+
T clock(T... args)
+
int main(int argc, char **argv)
Definition: kohonen_som_trace.cpp:443
+
large_number(const large_number &a)
Definition: large_number.h:48
+
int fibonacci(unsigned int n)
Definition: fibonacci.cpp:17
+
void insert(const std::string &word)
Definition: trie_modern.cpp:109
+
Definition: binary_search_tree.cpp:17
+
static bool isCyclicDFS(Graph const &graph)
Definition: cycle_check_directed_graph.cpp:206
+
int top
pointer to track stack index
Definition: paranthesis_matching.cpp:23
+
void test3()
Definition: kohonen_som_topology.cpp:521
+
node * createNode(int data)
Definition: avltree.cpp:21
+
Definition: cycle_check_directed_graph.cpp:153
+
static bool isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)
Definition: cycle_check_directed_graph.cpp:165
+
large_number & operator*=(const T n)
Definition: large_number.h:238
+
large_number()
Definition: large_number.h:27
+
void init()
Definition: sieve_of_eratosthenes.cpp:52
+
int main()
Main function.
Definition: binary_exponent.cpp:55
+
Definition: huffman.cpp:7
+
int main()
Definition: line_segment_intersection.cpp:92
+
large_number & operator++()
Definition: large_number.h:175
+
void test1(double eta=0.01)
Definition: adaline_learning.cpp:202
+
node * insert(node *root, int item)
Definition: avltree.cpp:66
+
T printf(T... args)
+
T at(T... args)
+
unsigned char & operator[](size_t n)
Definition: large_number.h:137
+ +
int h(int key)
Definition: hash_search.cpp:45
+
STL class.
+
int direction(Point first_point, Point second_point, Point third_point)
Definition: line_segment_intersection.cpp:63
+
std::remove_reference_t< AdjList > const & getAdjList() const
Definition: cycle_check_directed_graph.cpp:105
+
const double eta
learning rate of the algorithm
Definition: adaline_learning.cpp:185
+
ll k
Definition: matrix_exponentiation.cpp:48
+
T min_element(T... args)
+
uint64_t phiFunction(uint64_t n)
Definition: eulers_totient_function.cpp:32
+
T pop(T... args)
+
T top(T... args)
+
Edge(unsigned int source, unsigned int destination)
Definition: cycle_check_directed_graph.cpp:42
+
Trie()
constructor to initialise the root of the trie.
Definition: trie_modern.cpp:103
+
Definition: prims_minimum_spanning_tree.cpp:9
+
void addEdge(unsigned int source, unsigned int destination)
Definition: cycle_check_directed_graph.cpp:140
+
T close(T... args)
+
int main()
Definition: factorial.cpp:15
+
void multiply(const T n)
Definition: large_number.h:258
+
T perror(T... args)
+
#define ll
Definition: matrix_exponentiation.cpp:33
+
T erase(T... args)
+
std::vector< double > weights
weights of the neural network
Definition: adaline_learning.cpp:187
+
STL class.
+
Definition: line_segment_intersection.cpp:22
+ +
large_number & operator=(const large_number &b)
Definition: large_number.h:229
+
int main()
Main function.
Definition: extended_euclid_algorithm.cpp:87
+
T open(T... args)
+
void test_3d_classes1(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:397
+
uint64_t fib(uint64_t n)
Definition: fibonacci_fast.cpp:30
+
void test2()
Definition: kohonen_som_topology.cpp:437
+
bool on_segment(Point first_point, Point second_point, Point third_point)
Definition: line_segment_intersection.cpp:75
+
T remove(T... args)
+
std::vector< unsigned char > _digits
Definition: large_number.h:285
+
#define endl
Definition: matrix_exponentiation.cpp:36
+
void push(Type item)
Definition: stack.h:44
+
void test2()
Definition: kohonen_som_trace.cpp:305
+ +
int main()
Definition: check_prime.cpp:45
+
bool test2()
Definition: large_factorial.cpp:54
+
bool isEmptyQueue()
Definition: queue.h:42
+
Graph(unsigned int vertices, AdjList &&adjList)
Definition: cycle_check_directed_graph.cpp:78
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T rand(T... args)
+
int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_topology.cpp:60
+
void test_lamniscate(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:267
+
T swap(T... args)
+
int main()
Definition: trie_modern.cpp:160
+
T min(T... args)
+
Definition: bellman_ford.cpp:7
+
Type top()
Definition: stack.h:54
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
T round(T... args)
+
static bool test()
Definition: large_number.h:65
+
T lower_bound(T... args)
+
T endl(T... args)
+
void display()
Definition: queue.h:20
+
T left(T... args)
+
friend bool operator==(large_number const &a, large_number const &b)
Definition: large_number.h:155
+
friend std::ostream & operator<<(std::ostream &out, const adaline &ada)
Definition: adaline_learning.cpp:72
+
T exp(T... args)
+
T begin(T... args)
+
int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
Definition: kohonen_som_topology.cpp:133
+
unsigned int factorial(unsigned int n)
Definition: factorial.cpp:8
+ +
STL namespace.
+
T insert(T... args)
+
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
+
Definition: huffman.cpp:28
+
int main()
Definition: avltree.cpp:134
+
T sync_with_stdio(T... args)
+
Definition: stack.h:17
+
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_topology.cpp:559
+
int gcd(int *a, int n)
Definition: gcd_of_n_numbers.cpp:15
+
int main()
Definition: fast_power.cpp:68
+
uint64_t double_factorial_recursive(uint64_t n)
Definition: double_factorial.cpp:29
+
T count(T... args)
+
bool search(const std::string &word)
Definition: trie_modern.cpp:132
+
T fixed(T... args)
+
Definition: knapsack.cpp:4
+
const uint64_t MAX
Definition: fibonacci_fast.cpp:24
+
T strtoull(T... args)
+
T empty(T... args)
+
T assign(T... args)
+
void display()
Definition: stack.h:20
+
void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)
Definition: extended_euclid_algorithm.cpp:70
+
void test3()
Definition: kohonen_som_trace.cpp:402
+
T push(T... args)
+
void enQueue(Kind item)
Definition: queue.h:45
+
bool isEmptyStack()
Definition: stack.h:41
+
std::remove_reference_t< unsigned int > const & getVertices() const
Definition: cycle_check_directed_graph.cpp:112
+
Definition: lca.cpp:10
+
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
+
large_number(int n)
Definition: large_number.h:39
+
T make_pair(T... args)
+
T time(T... args)
+
T malloc(T... args)
+
T end(T... args)
+
char stack[MAX]
Definition: paranthesis_matching.cpp:20
+
void extendedEuclid_1(T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)
Definition: extended_euclid_algorithm.cpp:41
+
const double accuracy
model fit convergence accuracy
Definition: adaline_learning.cpp:186
+
int main()
Definition: gcd_iterative_euclidean.cpp:47
+
T max(T... args)
+
void test_2d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:318
+ +
Definition: line_segment_intersection.cpp:12
+
friend bool operator!=(large_number const &a, large_number const &b)
Definition: large_number.h:168
+
void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
Definition: kohonen_som_topology.cpp:259
+
void push(char ch)
push byte to stack variable
Definition: paranthesis_matching.cpp:26
+
std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
Definition: trie_modern.cpp:64
+
void test_3d_classes2(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:477
+
char pop()
pop a byte out of stack variable
Definition: paranthesis_matching.cpp:29
+
void fit(std::vector< double > const (&X)[N], const int *y)
Definition: adaline_learning.cpp:134
+
double _random(double a, double b)
Definition: kohonen_som_topology.cpp:48
+
void addEdge(Edge const &edge)
Definition: cycle_check_directed_graph.cpp:128
+
double fast_power_linear(T a, T b)
Definition: fast_power.cpp:50
+ +
Graph(unsigned int vertices, AdjList const &adjList)
Definition: cycle_check_directed_graph.cpp:70
+
large_number & operator++(int)
Definition: large_number.h:183
+
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
+
void test2(double eta=0.01)
Definition: adaline_learning.cpp:236
+
T partition(T... args)
+
void test3(double eta=0.01)
Definition: adaline_learning.cpp:287
+ +
Definition: adaline_learning.cpp:42
+
int main(int argc, char *argv[])
Main function.
Definition: eulers_totient_function.cpp:48
+
friend large_number & operator+(const large_number &a, const T &b)
Definition: large_number.h:220
+
T data(T... args)
+
T is_open(T... args)
+
STL class.
+
void kohonen_som_tracer(const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)
Definition: kohonen_som_trace.cpp:145
+
T exit(T... args)
+
void clear()
Definition: stack.h:73
+
int main(int argc, char **argv)
Definition: adaline_learning.cpp:331
+ +
T memset(T... args)
+ +
void test_circle(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:188
+
T next(T... args)
+
STL class.
+
T pow(T... args)
+ + + + diff --git a/d4/d9c/primes__up__to__billion_8cpp.html b/d4/d9c/primes__up__to__billion_8cpp.html new file mode 100644 index 000000000..787b533ab --- /dev/null +++ b/d4/d9c/primes__up__to__billion_8cpp.html @@ -0,0 +1,226 @@ + + + + + + + +Algorithms_in_C++: math/primes_up_to_billion.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
primes_up_to_billion.cpp File Reference
+
+
+ +

Compute prime numbers upto 1 billion. +More...

+
#include <cstring>
+#include <iostream>
+
+Include dependency graph for primes_up_to_billion.cpp:
+
+
+
+
+
+ + + + + +

+Functions

void Sieve (int64_t n)
 
int main ()
 
+ + + +

+Variables

char prime [100000000]
 
+

Detailed Description

+

Compute prime numbers upto 1 billion.

+
See also
prime_numbers.cpp sieve_of_eratosthenes.cpp
+

Function Documentation

+ +

◆ main()

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

Main function

+
26  {
+
27  Sieve(100000000);
+
28  int64_t n;
+
29  std::cin >> n; // 10006187
+
30  if (prime[n] == '1')
+
31  std::cout << "YES\n";
+
32  else
+
33  std::cout << "NO\n";
+
34 
+
35  return 0;
+
36 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ Sieve()

+ +
+
+ + + + + + + + +
void Sieve (int64_t n)
+
+

Perform Sieve algorithm

+
13  {
+
14  memset(prime, '1', sizeof(prime)); // intitize '1' to every index
+
15  prime[0] = '0'; // 0 is not prime
+
16  prime[1] = '0'; // 1 is not prime
+
17  for (int p = 2; p * p <= n; p++) {
+
18  if (prime[p] == '1') {
+
19  for (int i = p * p; i <= n; i += p)
+
20  prime[i] = '0'; // set all multiples of p to false
+
21  }
+
22  }
+
23 }
+
+
+
+

Variable Documentation

+ +

◆ prime

+ +
+
+ + + + +
char prime[100000000]
+
+

array to store the primes

+ +
+
+
+
+ +
void Sieve(int64_t n)
Definition: primes_up_to_billion.cpp:13
+ +
T memset(T... args)
+
char prime[100000000]
Definition: primes_up_to_billion.cpp:10
+ + + + diff --git a/d4/d9c/primes__up__to__billion_8cpp.js b/d4/d9c/primes__up__to__billion_8cpp.js new file mode 100644 index 000000000..0fb54b54b --- /dev/null +++ b/d4/d9c/primes__up__to__billion_8cpp.js @@ -0,0 +1,6 @@ +var primes__up__to__billion_8cpp = +[ + [ "main", "d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "Sieve", "d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c", null ], + [ "prime", "d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95", null ] +]; \ No newline at end of file diff --git a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..c531f0ea2 --- /dev/null +++ b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..32c050df8 --- /dev/null +++ b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +175aa14da177cf83432a3084f9ade93c \ No newline at end of file diff --git a/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..a5dc6bae5 --- /dev/null +++ b/d4/d9c/primes__up__to__billion_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +Sieve + + + + + +Node1->Node2 + + + + + diff --git a/d4/da0/gcd__iterative__euclidean_8cpp.html b/d4/da0/gcd__iterative__euclidean_8cpp.html new file mode 100644 index 000000000..1efb00757 --- /dev/null +++ b/d4/da0/gcd__iterative__euclidean_8cpp.html @@ -0,0 +1,231 @@ + + + + + + + +Algorithms_in_C++: math/gcd_iterative_euclidean.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
gcd_iterative_euclidean.cpp File Reference
+
+
+ +

Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm +More...

+
#include <iostream>
+#include <stdexcept>
+
+Include dependency graph for gcd_iterative_euclidean.cpp:
+
+
+
+
+
+ + + + + +

+Functions

int gcd (int num1, int num2)
 
int main ()
 
+

Detailed Description

+

Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm

+
See also
gcd_recursive_euclidean.cpp, gcd_of_n_numbers.cpp
+

Function Documentation

+ +

◆ gcd()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int gcd (int num1,
int num2 
)
+
+

algorithm

+
15  {
+
16  if (num1 <= 0 | num2 <= 0) {
+
17  throw std::domain_error("Euclidean algorithm domain is for ints > 0");
+
18  }
+
19 
+
20  if (num1 == num2) {
+
21  return num1;
+
22  }
+
23 
+
24  int base_num = 0;
+
25  int previous_remainder = 1;
+
26 
+
27  if (num1 > num2) {
+
28  base_num = num1;
+
29  previous_remainder = num2;
+
30  } else {
+
31  base_num = num2;
+
32  previous_remainder = num1;
+
33  }
+
34 
+
35  while ((base_num % previous_remainder) != 0) {
+
36  int old_base = base_num;
+
37  base_num = previous_remainder;
+
38  previous_remainder = old_base % previous_remainder;
+
39  }
+
40 
+
41  return previous_remainder;
+
42 }
+
+
+
+ +

◆ main()

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

Main function

+
47  {
+
48  std::cout << "gcd of 120,7 is " << (gcd(120, 7)) << std::endl;
+
49  try {
+
50  std::cout << "gcd of -120,10 is " << gcd(-120, 10) << std::endl;
+
51  } catch (const std::domain_error &e) {
+
52  std::cout << "Error handling was successful" << std::endl;
+
53  }
+
54  std::cout << "gcd of 312,221 is " << (gcd(312, 221)) << std::endl;
+
55  std::cout << "gcd of 289,204 is " << (gcd(289, 204)) << std::endl;
+
56 
+
57  return 0;
+
58 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
int gcd(int num1, int num2)
Definition: gcd_iterative_euclidean.cpp:15
+ +
T endl(T... args)
+ + + + diff --git a/d4/da0/gcd__iterative__euclidean_8cpp.js b/d4/da0/gcd__iterative__euclidean_8cpp.js new file mode 100644 index 000000000..99a3bd49b --- /dev/null +++ b/d4/da0/gcd__iterative__euclidean_8cpp.js @@ -0,0 +1,5 @@ +var gcd__iterative__euclidean_8cpp = +[ + [ "gcd", "d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e", null ], + [ "main", "d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..0dcffee0a --- /dev/null +++ b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..781fb7858 --- /dev/null +++ b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +206605a797664ca9e916f6876993789c \ No newline at end of file diff --git a/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..5fbe7ad64 --- /dev/null +++ b/d4/da0/gcd__iterative__euclidean_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +gcd + + + + + +Node1->Node3 + + + + + diff --git a/d4/da4/class_queue.html b/d4/da4/class_queue.html new file mode 100644 index 000000000..3e5bf1120 --- /dev/null +++ b/d4/da4/class_queue.html @@ -0,0 +1,147 @@ + + + + + + + +Algorithms_in_C++: Queue Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for Queue:
+
+
+
+
[legend]
+ + + + + + + + + + +

+Public Member Functions

+void createNode (int val)
 
+void enqueue (int val)
 
+void dequeue ()
 
+void traverse ()
 
+ + + + + +

+Private Attributes

+nodefront
 
+noderear
 
+
The documentation for this class was generated from the following file:
    +
  • data_structures/circular_queue_using_linked_list.cpp
  • +
+
+
+ + + + diff --git a/d4/da4/class_queue.js b/d4/da4/class_queue.js new file mode 100644 index 000000000..2c586d5bb --- /dev/null +++ b/d4/da4/class_queue.js @@ -0,0 +1,10 @@ +var class_queue = +[ + [ "Queue", "d4/da4/class_queue.html#a7cfca3637d57c4a9e37351b3426ffd40", null ], + [ "createNode", "d4/da4/class_queue.html#a7df5a5794b817bccb0d288e3e7893326", null ], + [ "dequeue", "d4/da4/class_queue.html#aa01ff898c2bdab7e804bf243eb5bfb31", null ], + [ "enqueue", "d4/da4/class_queue.html#a8e9326b15e162c2d7d663c5cfbdd4405", null ], + [ "traverse", "d4/da4/class_queue.html#af679dbf13749275935f617ac6ab0f9e9", null ], + [ "front", "d4/da4/class_queue.html#a31b892ad81d0e915c20c8f6a88e75f02", null ], + [ "rear", "d4/da4/class_queue.html#a3ed9e95fefd0c13071d192c1512c8db3", null ] +]; \ No newline at end of file diff --git a/d4/da4/number__of__positive__divisors_8cpp__incl.map b/d4/da4/number__of__positive__divisors_8cpp__incl.map new file mode 100644 index 000000000..7bb625180 --- /dev/null +++ b/d4/da4/number__of__positive__divisors_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/da4/number__of__positive__divisors_8cpp__incl.md5 b/d4/da4/number__of__positive__divisors_8cpp__incl.md5 new file mode 100644 index 000000000..07b469a56 --- /dev/null +++ b/d4/da4/number__of__positive__divisors_8cpp__incl.md5 @@ -0,0 +1 @@ +a9574d13c4fc98e06be35d20b3a84993 \ No newline at end of file diff --git a/d4/da4/number__of__positive__divisors_8cpp__incl.svg b/d4/da4/number__of__positive__divisors_8cpp__incl.svg new file mode 100644 index 000000000..037282a07 --- /dev/null +++ b/d4/da4/number__of__positive__divisors_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +math/number_of_positive_divisors.cpp + + + +Node1 + + +math/number_of_positive +_divisors.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + + + diff --git a/d4/db4/bayes__theorem_8cpp__incl.map b/d4/db4/bayes__theorem_8cpp__incl.map new file mode 100644 index 000000000..d396f713f --- /dev/null +++ b/d4/db4/bayes__theorem_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/db4/bayes__theorem_8cpp__incl.md5 b/d4/db4/bayes__theorem_8cpp__incl.md5 new file mode 100644 index 000000000..8c6b2affc --- /dev/null +++ b/d4/db4/bayes__theorem_8cpp__incl.md5 @@ -0,0 +1 @@ +be15fb7a8799a143bea6ea5a5ed86386 \ No newline at end of file diff --git a/d4/db4/bayes__theorem_8cpp__incl.svg b/d4/db4/bayes__theorem_8cpp__incl.svg new file mode 100644 index 000000000..3d865a8ff --- /dev/null +++ b/d4/db4/bayes__theorem_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +probability/bayes_theorem.cpp + + + +Node1 + + +probability/bayes_theorem.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d4/db4/struct_segment_intersection.html b/d4/db4/struct_segment_intersection.html new file mode 100644 index 000000000..5377e2bc8 --- /dev/null +++ b/d4/db4/struct_segment_intersection.html @@ -0,0 +1,240 @@ + + + + + + + +Algorithms_in_C++: SegmentIntersection Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
SegmentIntersection Struct Reference
+
+
+ + + + + + + + +

+Public Member Functions

+bool intersect (Point first_point, Point second_point, Point third_point, Point forth_point)
 
int direction (Point first_point, Point second_point, Point third_point)
 
bool on_segment (Point first_point, Point second_point, Point third_point)
 
+

Detailed Description

+

intersect returns true if segments of two line intersects and false if they do not. It calls the subroutines direction which computes the orientation.

+

Member Function Documentation

+ +

◆ direction()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
int SegmentIntersection::direction (Point first_point,
Point second_point,
Point third_point 
)
+
+inline
+
+

We will find direction of line here respect to @first_point. Here @second_point and @third_point is first and second points of the line respectively. we want a method to determine which way a given angle these three points turns. If returned number is negative, then the angle is counter-clockwise. That means the line is going to right to left. We will fount angle as clockwise if the method returns positive number.

+
64  {
+
65  return ((third_point.x - first_point.x) *
+
66  (second_point.y - first_point.y)) -
+
67  ((second_point.x - first_point.x) *
+
68  (third_point.y - first_point.y));
+
69  }
+
+
+
+ +

◆ on_segment()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
bool SegmentIntersection::on_segment (Point first_point,
Point second_point,
Point third_point 
)
+
+inline
+
+

This method determines whether a point known to be colinear with a segment lies on that segment.

+
76  {
+
77  if (std::min(first_point.x, second_point.x) <= third_point.x &&
+
78  third_point.x <= std::max(first_point.x, second_point.x) &&
+
79  std::min(first_point.y, second_point.y) <= third_point.y &&
+
80  third_point.y <= std::max(first_point.y, second_point.y))
+
81  return true;
+
82 
+
83  else
+
84  return false;
+
85  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
The documentation for this struct was generated from the following file: +
+
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
+
T min(T... args)
+
T max(T... args)
+ + + + diff --git a/d4/db4/struct_segment_intersection.js b/d4/db4/struct_segment_intersection.js new file mode 100644 index 000000000..d0b7e7779 --- /dev/null +++ b/d4/db4/struct_segment_intersection.js @@ -0,0 +1,6 @@ +var struct_segment_intersection = +[ + [ "direction", "d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655", null ], + [ "intersect", "d4/db4/struct_segment_intersection.html#aefd077282f45bd16799b53f8aa430ffd", null ], + [ "on_segment", "d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf", null ] +]; \ No newline at end of file diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map new file mode 100644 index 000000000..f3690b976 --- /dev/null +++ b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5 b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5 new file mode 100644 index 000000000..c82fbf4a8 --- /dev/null +++ b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.md5 @@ -0,0 +1 @@ +0d3dcb1f7c3e3c31812e4d31ccbec50a \ No newline at end of file diff --git a/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg new file mode 100644 index 000000000..e64e2460e --- /dev/null +++ b/d4/db4/struct_segment_intersection_a008941b2272866c64cdaf959afa939bf_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +SegmentIntersection::on_segment + + + +Node1 + + +SegmentIntersection +::on_segment + + + + + +Node2 + + +std::max + + + + + +Node1->Node2 + + + + + +Node3 + + +std::min + + + + + +Node1->Node3 + + + + + diff --git a/d4/db6/struct_min_heap_node-members.html b/d4/db6/struct_min_heap_node-members.html new file mode 100644 index 000000000..c4af233d9 --- /dev/null +++ b/d4/db6/struct_min_heap_node-members.html @@ -0,0 +1,116 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
MinHeapNode Member List
+
+
+ +

This is the complete list of members for MinHeapNode, including all inherited members.

+ + + + + + +
data (defined in MinHeapNode)MinHeapNode
freq (defined in MinHeapNode)MinHeapNode
left (defined in MinHeapNode)MinHeapNode
MinHeapNode(char data, unsigned freq) (defined in MinHeapNode)MinHeapNodeinline
right (defined in MinHeapNode)MinHeapNode
+
+ + + + diff --git a/d4/dbd/structlca__coll__graph.map b/d4/dbd/structlca__coll__graph.map new file mode 100644 index 000000000..96000ebe0 --- /dev/null +++ b/d4/dbd/structlca__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d4/dbd/structlca__coll__graph.md5 b/d4/dbd/structlca__coll__graph.md5 new file mode 100644 index 000000000..5421828d9 --- /dev/null +++ b/d4/dbd/structlca__coll__graph.md5 @@ -0,0 +1 @@ +7f86281226cb492a8d0c40cb3c589dd0 \ No newline at end of file diff --git a/d4/dbd/structlca__coll__graph.svg b/d4/dbd/structlca__coll__graph.svg new file mode 100644 index 000000000..d9f064194 --- /dev/null +++ b/d4/dbd/structlca__coll__graph.svg @@ -0,0 +1,38 @@ + + + + + + +lca + + + +Node1 + + +lca + + + + + +Node2 + + +std::vector< int > + + + + + +Node2->Node1 + + + adj + + + diff --git a/d4/dc7/extended__euclid__algorithm_8cpp__incl.map b/d4/dc7/extended__euclid__algorithm_8cpp__incl.map new file mode 100644 index 000000000..5cf4eab0a --- /dev/null +++ b/d4/dc7/extended__euclid__algorithm_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/dc7/extended__euclid__algorithm_8cpp__incl.md5 b/d4/dc7/extended__euclid__algorithm_8cpp__incl.md5 new file mode 100644 index 000000000..e13985bfc --- /dev/null +++ b/d4/dc7/extended__euclid__algorithm_8cpp__incl.md5 @@ -0,0 +1 @@ +6a99876479612571fa194294f0b387ea \ No newline at end of file diff --git a/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg b/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg new file mode 100644 index 000000000..d644284e7 --- /dev/null +++ b/d4/dc7/extended__euclid__algorithm_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +math/extended_euclid_algorithm.cpp + + + +Node1 + + +math/extended_euclid +_algorithm.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/d4/dcb/classstack__coll__graph.map b/d4/dcb/classstack__coll__graph.map new file mode 100644 index 000000000..a52e49ce0 --- /dev/null +++ b/d4/dcb/classstack__coll__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/dcb/classstack__coll__graph.md5 b/d4/dcb/classstack__coll__graph.md5 new file mode 100644 index 000000000..53818cc26 --- /dev/null +++ b/d4/dcb/classstack__coll__graph.md5 @@ -0,0 +1 @@ +b0de418348dc0917885546f01816203b \ No newline at end of file diff --git a/d4/dcb/classstack__coll__graph.svg b/d4/dcb/classstack__coll__graph.svg new file mode 100644 index 000000000..f9568bf2f --- /dev/null +++ b/d4/dcb/classstack__coll__graph.svg @@ -0,0 +1,76 @@ + + + + + + +stack< Type > + + + +Node1 + + +stack< Type > + + + + + +Node2 + + +node< Type > + + + + + +Node2->Node1 + + + stackTop + + + +Node2->Node2 + + + next + + + +Node3 + + +node< Kind > + + + + + +Node3->Node2 + + + prev +next +right +left +link + + + +Node3->Node3 + + + prev +next +right +left +link + + + diff --git a/d4/dd9/structtrie.html b/d4/dd9/structtrie.html new file mode 100644 index 000000000..dae64e462 --- /dev/null +++ b/d4/dd9/structtrie.html @@ -0,0 +1,131 @@ + + + + + + + +Algorithms_in_C++: trie Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
trie Struct Reference
+
+
+
+Collaboration diagram for trie:
+
+
+
+
[legend]
+ + + + + + +

+Public Attributes

+struct triearr [26]
 
+bool isEndofWord
 
+
The documentation for this struct was generated from the following file:
    +
  • data_structures/trie_tree.cpp
  • +
+
+
+ + + + diff --git a/d4/dd9/structtrie.js b/d4/dd9/structtrie.js new file mode 100644 index 000000000..b6c784412 --- /dev/null +++ b/d4/dd9/structtrie.js @@ -0,0 +1,5 @@ +var structtrie = +[ + [ "arr", "d4/dd9/structtrie.html#ab0321a054f9b62d68fce08882d7e5b03", null ], + [ "isEndofWord", "d4/dd9/structtrie.html#a6ed95bf46944aeb935f82707d2996dd8", null ] +]; \ No newline at end of file diff --git a/d4/de8/fast__interger__input_8cpp.html b/d4/de8/fast__interger__input_8cpp.html new file mode 100644 index 000000000..26614ec67 --- /dev/null +++ b/d4/de8/fast__interger__input_8cpp.html @@ -0,0 +1,211 @@ + + + + + + + +Algorithms_in_C++: others/fast_interger_input.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
fast_interger_input.cpp File Reference
+
+
+ +

Read integers from stdin continuously as they are entered without waiting for the \n character. +More...

+
#include <iostream>
+
+Include dependency graph for fast_interger_input.cpp:
+
+
+
+
+
+ + + + + +

+Functions

void fastinput (int *number)
 
int main ()
 
+

Detailed Description

+

Read integers from stdin continuously as they are entered without waiting for the \n character.

+

Function Documentation

+ +

◆ fastinput()

+ +
+
+ + + + + + + + +
void fastinput (int * number)
+
+

Function to read the number from stdin. The function reads input until a non numeric character is entered.

+
11  {
+
12  // variable to indicate sign of input integer
+
13  bool negative = false;
+
14  register int c;
+
15  *number = 0;
+
16 
+
17  // extract current character from buffer
+
18  c = std::getchar();
+
19  if (c == '-') {
+
20  // number is negative
+
21  negative = true;
+
22 
+
23  // extract the next character from the buffer
+
24  c = std::getchar();
+
25  }
+
26 
+
27  // Keep on extracting characters if they are integers
+
28  // i.e ASCII Value lies from '0'(48) to '9' (57)
+
29  for (; (c > 47 && c < 58); c = std::getchar())
+
30  *number = *number * 10 + c - 48;
+
31 
+
32  // if scanned input has a negative sign, negate the
+
33  // value of the input number
+
34  if (negative)
+
35  *(number) *= -1;
+
36 }
+
+
+
+ +

◆ main()

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

Main function

+
39  {
+
40  int number;
+
41  fastinput(&number);
+
42  std::cout << number << std::endl;
+
43  return 0;
+
44 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T endl(T... args)
+
T getchar(T... args)
+
void fastinput(int *number)
Definition: fast_interger_input.cpp:11
+ + + + diff --git a/d4/de8/fast__interger__input_8cpp.js b/d4/de8/fast__interger__input_8cpp.js new file mode 100644 index 000000000..7e74b83d5 --- /dev/null +++ b/d4/de8/fast__interger__input_8cpp.js @@ -0,0 +1,5 @@ +var fast__interger__input_8cpp = +[ + [ "fastinput", "d4/de8/fast__interger__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82", null ], + [ "main", "d4/de8/fast__interger__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..7389964fc --- /dev/null +++ b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..7d46a30fc --- /dev/null +++ b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +5bc3050e4916da5b438a1fc3738b9cb7 \ No newline at end of file diff --git a/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..1dd95d35c --- /dev/null +++ b/d4/de8/fast__interger__input_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +fastinput + + + + + +Node1->Node3 + + + + + diff --git a/d4/deb/gcd__iterative__euclidean_8cpp__incl.map b/d4/deb/gcd__iterative__euclidean_8cpp__incl.map new file mode 100644 index 000000000..d43619262 --- /dev/null +++ b/d4/deb/gcd__iterative__euclidean_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/deb/gcd__iterative__euclidean_8cpp__incl.md5 b/d4/deb/gcd__iterative__euclidean_8cpp__incl.md5 new file mode 100644 index 000000000..0e6f12702 --- /dev/null +++ b/d4/deb/gcd__iterative__euclidean_8cpp__incl.md5 @@ -0,0 +1 @@ +ba1669f8a58ffa4a5dba151c4a8cfacc \ No newline at end of file diff --git a/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg b/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg new file mode 100644 index 000000000..e56720d15 --- /dev/null +++ b/d4/deb/gcd__iterative__euclidean_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +math/gcd_iterative_euclidean.cpp + + + +Node1 + + +math/gcd_iterative +_euclidean.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +stdexcept + + + + + +Node1->Node3 + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp.html b/d4/def/kohonen__som__topology_8cpp.html new file mode 100644 index 000000000..9a0d61d26 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp.html @@ -0,0 +1,693 @@ + + + + + + + +Algorithms_in_C++: machine_learning/kohonen_som_topology.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
kohonen_som_topology.cpp File Reference
+
+
+ +

Kohonen self organizing map (topological map) +More...

+
#include <algorithm>
+#include <cmath>
+#include <cstdlib>
+#include <ctime>
+#include <fstream>
+#include <iostream>
+#include <valarray>
+#include <vector>
+
+Include dependency graph for kohonen_som_topology.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 machine_learning
 Machine learning algorithms.
 
+ + + + + + +

+Macros

+#define _USE_MATH_DEFINES
 
+#define MIN_DISTANCE   1e-4
 Minimum average distance of image nodes.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

double _random (double a, double b)
 
int save_2d_data (const char *fname, const std::vector< std::valarray< double >> &X)
 
void get_min_2d (const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx)
 
int machine_learning::save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
 
double machine_learning::update_weights (const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)
 
void machine_learning::kohonen_som (const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
 
void test_2d_classes (std::vector< std::valarray< double >> *data)
 
void test1 ()
 
void test_3d_classes1 (std::vector< std::valarray< double >> *data)
 
void test2 ()
 
void test_3d_classes2 (std::vector< std::valarray< double >> *data)
 
void test3 ()
 
double get_clock_diff (clock_t start_t, clock_t end_t)
 
int main (int argc, char **argv)
 
+

Detailed Description

+

Kohonen self organizing map (topological map)

+
Author
Krishna Vedala This example implements a powerful unsupervised learning algorithm called as a self organizing map. The algorithm creates a connected network of weights that closely follows the given data points. This thus creates a topological map of the given data i.e., it maintains the relationship between varipus data points in a much higher dimesional space by creating an equivalent in a 2-dimensional space. Trained topological maps for the test cases in the program
+
Note
This C++ version of the program is considerable slower than its C counterpart
+
+The compiled code is much slower when compiled with MS Visual C++ 2019 than with GCC on windows
+
See also
kohonen_som_trace.cpp
+

Function Documentation

+ +

◆ get_clock_diff()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double get_clock_diff (clock_t start_t,
clock_t end_t 
)
+
+

Convert clock cycle difference to time in seconds

+
Parameters
+ + + +
[in]start_tstart clock
[in]end_tend clock
+
+
+
Returns
time difference in seconds
+
559  {
+
560  return static_cast<double>(end_t - start_t) / CLOCKS_PER_SEC;
+
561 }
+
+
+
+ +

◆ main()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int main (int argc,
char ** argv 
)
+
+

Main function

+
564  {
+
565 #ifdef _OPENMP
+
566  std::cout << "Using OpenMP based parallelization\n";
+
567 #else
+
568  std::cout << "NOT using OpenMP based parallelization\n";
+
569 #endif
+
570 
+
571  std::srand(std::time(nullptr));
+
572 
+
573  std::clock_t start_clk = std::clock();
+
574  test1();
+
575  auto end_clk = std::clock();
+
576  std::cout << "Test 1 completed in " << get_clock_diff(start_clk, end_clk)
+
577  << " sec\n";
+
578 
+
579  start_clk = std::clock();
+
580  test2();
+
581  end_clk = std::clock();
+
582  std::cout << "Test 2 completed in " << get_clock_diff(start_clk, end_clk)
+
583  << " sec\n";
+
584 
+
585  start_clk = std::clock();
+
586  test3();
+
587  end_clk = std::clock();
+
588  std::cout << "Test 3 completed in " << get_clock_diff(start_clk, end_clk)
+
589  << " sec\n";
+
590 
+
591  std::cout
+
592  << "(Note: Calculated times include: creating test sets, training "
+
593  "model and writing files to disk.)\n\n";
+
594  return 0;
+
595 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test1()

+ +
+
+ + + + + + + +
void test1 ()
+
+

Test that creates a random set of points distributed in four clusters in circumference of a circle and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:

    +
  • test1.csv: random test samples points with a circular pattern
  • +
  • w11.csv: initial random map
  • +
  • w12.csv: trained SOM map
  • +
+
357  {
+
358  int j, N = 300;
+
359  int features = 2;
+
360  int num_out = 30;
+ + +
363  for (int i = 0; i < std::max(num_out, N); i++) {
+
364  // loop till max(N, num_out)
+
365  if (i < N) // only add new arrays if i < N
+
366  X[i] = std::valarray<double>(features);
+
367  if (i < num_out) { // only add new arrays if i < num_out
+
368  W[i] = std::vector<std::valarray<double>>(num_out);
+
369  for (int k = 0; k < num_out; k++) {
+
370  W[i][k] = std::valarray<double>(features);
+
371 #ifdef _OPENMP
+
372 #pragma omp for
+
373 #endif
+
374  for (j = 0; j < features; j++)
+
375  // preallocate with random initial weights
+
376  W[i][k][j] = _random(-10, 10);
+
377  }
+
378  }
+
379  }
+
380 
+
381  test_2d_classes(&X); // create test data around circumference of a circle
+
382  save_2d_data("test1.csv", X); // save test data points
+
383  save_u_matrix("w11.csv", W); // save initial random weights
+
384  kohonen_som(X, &W, 1e-4); // train the SOM
+
385  save_u_matrix("w12.csv", W); // save the resultant weights
+
386 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test2()

+ +
+
+ + + + + + + +
void test2 ()
+
+

Test that creates a random set of points distributed in 4 clusters in 3D space and trains an SOM that finds the topological pattern. The following CSV files are created to validate the execution:

    +
  • test2.csv: random test samples points with a lamniscate pattern
  • +
  • w21.csv: initial random map
  • +
  • w22.csv: trained SOM map
  • +
+
437  {
+
438  int j, N = 300;
+
439  int features = 3;
+
440  int num_out = 30;
+ + +
443  for (int i = 0; i < std::max(num_out, N); i++) {
+
444  // loop till max(N, num_out)
+
445  if (i < N) // only add new arrays if i < N
+
446  X[i] = std::valarray<double>(features);
+
447  if (i < num_out) { // only add new arrays if i < num_out
+
448  W[i] = std::vector<std::valarray<double>>(num_out);
+
449  for (int k = 0; k < num_out; k++) {
+
450  W[i][k] = std::valarray<double>(features);
+
451 #ifdef _OPENMP
+
452 #pragma omp for
+
453 #endif
+
454  for (j = 0; j < features; j++)
+
455  // preallocate with random initial weights
+
456  W[i][k][j] = _random(-10, 10);
+
457  }
+
458  }
+
459  }
+
460 
+
461  test_3d_classes1(&X); // create test data around circumference of a circle
+
462  save_2d_data("test2.csv", X); // save test data points
+
463  save_u_matrix("w21.csv", W); // save initial random weights
+
464  kohonen_som(X, &W, 1e-4); // train the SOM
+
465  save_u_matrix("w22.csv", W); // save the resultant weights
+
466 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test3()

+ +
+
+ + + + + + + +
void test3 ()
+
+

Test that creates a random set of points distributed in eight clusters in 3D space and trains an SOM that finds the topological pattern. The following CSV files are created to validate the execution:

    +
  • test3.csv: random test samples points with a circular pattern
  • +
  • w31.csv: initial random map
  • +
  • w32.csv: trained SOM map
  • +
+
521  {
+
522  int j, N = 500;
+
523  int features = 3;
+
524  int num_out = 30;
+ + +
527  for (int i = 0; i < std::max(num_out, N); i++) {
+
528  // loop till max(N, num_out)
+
529  if (i < N) // only add new arrays if i < N
+
530  X[i] = std::valarray<double>(features);
+
531  if (i < num_out) { // only add new arrays if i < num_out
+
532  W[i] = std::vector<std::valarray<double>>(num_out);
+
533  for (int k = 0; k < num_out; k++) {
+
534  W[i][k] = std::valarray<double>(features);
+
535 #ifdef _OPENMP
+
536 #pragma omp for
+
537 #endif
+
538  for (j = 0; j < features; j++)
+
539  // preallocate with random initial weights
+
540  W[i][k][j] = _random(-10, 10);
+
541  }
+
542  }
+
543  }
+
544 
+
545  test_3d_classes2(&X); // create test data around circumference of a circle
+
546  save_2d_data("test3.csv", X); // save test data points
+
547  save_u_matrix("w31.csv", W); // save initial random weights
+
548  kohonen_som(X, &W, 1e-4); // train the SOM
+
549  save_u_matrix("w32.csv", W); // save the resultant weights
+
550 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_2d_classes()

+ +
+
+ + + + + + + + +
void test_2d_classes (std::vector< std::valarray< double >> * data)
+
+

Creates a random set of points distributed in four clusters in 3D space with centroids at the points

    +
  • \((0,5, 0.5, 0.5)\)
  • +
  • \((0,5,-0.5, -0.5)\)
  • +
  • \((-0,5, 0.5, 0.5)\)
  • +
  • \((-0,5,-0.5, -0.5)\)
  • +
+
Parameters
+ + +
[out]datamatrix to store data in
+
+
+
318  {
+
319  const int N = data->size();
+
320  const double R = 0.3; // radius of cluster
+
321  int i;
+
322  const int num_classes = 4;
+
323  const double centres[][2] = {
+
324  // centres of each class cluster
+
325  {.5, .5}, // centre of class 1
+
326  {.5, -.5}, // centre of class 2
+
327  {-.5, .5}, // centre of class 3
+
328  {-.5, -.5} // centre of class 4
+
329  };
+
330 
+
331 #ifdef _OPENMP
+
332 #pragma omp for
+
333 #endif
+
334  for (i = 0; i < N; i++) {
+
335  // select a random class for the point
+
336  int cls = std::rand() % num_classes;
+
337 
+
338  // create random coordinates (x,y,z) around the centre of the class
+
339  data[0][i][0] = _random(centres[cls][0] - R, centres[cls][0] + R);
+
340  data[0][i][1] = _random(centres[cls][1] - R, centres[cls][1] + R);
+
341 
+
342  /* The follosing can also be used
+
343  for (int j = 0; j < 2; j++)
+
344  data[i][j] = _random(centres[class][j] - R, centres[class][j] + R);
+
345  */
+
346  }
+
347 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_3d_classes1()

+ +
+
+ + + + + + + + +
void test_3d_classes1 (std::vector< std::valarray< double >> * data)
+
+

Creates a random set of points distributed in four clusters in 3D space with centroids at the points

    +
  • \((0,5, 0.5, 0.5)\)
  • +
  • \((0,5,-0.5, -0.5)\)
  • +
  • \((-0,5, 0.5, 0.5)\)
  • +
  • \((-0,5,-0.5, -0.5)\)
  • +
+
Parameters
+ + +
[out]datamatrix to store data in
+
+
+
397  {
+
398  const int N = data->size();
+
399  const double R = 0.3; // radius of cluster
+
400  int i;
+
401  const int num_classes = 4;
+
402  const double centres[][3] = {
+
403  // centres of each class cluster
+
404  {.5, .5, .5}, // centre of class 1
+
405  {.5, -.5, -.5}, // centre of class 2
+
406  {-.5, .5, .5}, // centre of class 3
+
407  {-.5, -.5 - .5} // centre of class 4
+
408  };
+
409 
+
410 #ifdef _OPENMP
+
411 #pragma omp for
+
412 #endif
+
413  for (i = 0; i < N; i++) {
+
414  // select a random class for the point
+
415  int cls = std::rand() % num_classes;
+
416 
+
417  // create random coordinates (x,y,z) around the centre of the class
+
418  data[0][i][0] = _random(centres[cls][0] - R, centres[cls][0] + R);
+
419  data[0][i][1] = _random(centres[cls][1] - R, centres[cls][1] + R);
+
420  data[0][i][2] = _random(centres[cls][2] - R, centres[cls][2] + R);
+
421 
+
422  /* The follosing can also be used
+
423  for (int j = 0; j < 3; j++)
+
424  data[i][j] = _random(centres[class][j] - R, centres[class][j] + R);
+
425  */
+
426  }
+
427 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_3d_classes2()

+ +
+
+ + + + + + + + +
void test_3d_classes2 (std::vector< std::valarray< double >> * data)
+
+

Creates a random set of points distributed in four clusters in 3D space with centroids at the points

    +
  • \((0,5, 0.5, 0.5)\)
  • +
  • \((0,5,-0.5, -0.5)\)
  • +
  • \((-0,5, 0.5, 0.5)\)
  • +
  • \((-0,5,-0.5, -0.5)\)
  • +
+
Parameters
+ + +
[out]datamatrix to store data in
+
+
+
477  {
+
478  const int N = data->size();
+
479  const double R = 0.2; // radius of cluster
+
480  int i;
+
481  const int num_classes = 8;
+
482  const double centres[][3] = {
+
483  // centres of each class cluster
+
484  {.5, .5, .5}, // centre of class 1
+
485  {.5, .5, -.5}, // centre of class 2
+
486  {.5, -.5, .5}, // centre of class 3
+
487  {.5, -.5, -.5}, // centre of class 4
+
488  {-.5, .5, .5}, // centre of class 5
+
489  {-.5, .5, -.5}, // centre of class 6
+
490  {-.5, -.5, .5}, // centre of class 7
+
491  {-.5, -.5, -.5} // centre of class 8
+
492  };
+
493 
+
494 #ifdef _OPENMP
+
495 #pragma omp for
+
496 #endif
+
497  for (i = 0; i < N; i++) {
+
498  // select a random class for the point
+
499  int cls = std::rand() % num_classes;
+
500 
+
501  // create random coordinates (x,y,z) around the centre of the class
+
502  data[0][i][0] = _random(centres[cls][0] - R, centres[cls][0] + R);
+
503  data[0][i][1] = _random(centres[cls][1] - R, centres[cls][1] + R);
+
504  data[0][i][2] = _random(centres[cls][2] - R, centres[cls][2] + R);
+
505 
+
506  /* The follosing can also be used
+
507  for (int j = 0; j < 3; j++)
+
508  data[i][j] = _random(centres[class][j] - R, centres[class][j] + R);
+
509  */
+
510  }
+
511 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T srand(T... args)
+ +
STL class.
+
void test1()
Definition: kohonen_som_topology.cpp:357
+
T clock(T... args)
+
void test3()
Definition: kohonen_som_topology.cpp:521
+ +
ll k
Definition: matrix_exponentiation.cpp:48
+
STL class.
+
void test_3d_classes1(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:397
+
void test2()
Definition: kohonen_som_topology.cpp:437
+
T rand(T... args)
+
int save_2d_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_topology.cpp:60
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
int save_u_matrix(const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
Definition: kohonen_som_topology.cpp:133
+
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_topology.cpp:559
+
T time(T... args)
+
T max(T... args)
+
void test_2d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:318
+
void kohonen_som(const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
Definition: kohonen_som_topology.cpp:259
+
void test_3d_classes2(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_topology.cpp:477
+
double _random(double a, double b)
Definition: kohonen_som_topology.cpp:48
+ + + + diff --git a/d4/def/kohonen__som__topology_8cpp.js b/d4/def/kohonen__som__topology_8cpp.js new file mode 100644 index 000000000..11d9f207e --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp.js @@ -0,0 +1,19 @@ +var kohonen__som__topology_8cpp = +[ + [ "_USE_MATH_DEFINES", "d9/d66/group__machine__learning.html#ga525335710b53cb064ca56b936120431e", null ], + [ "MIN_DISTANCE", "d4/def/kohonen__som__topology_8cpp.html#a549d41dcf9444ed7d6df1da3c73e7d16", null ], + [ "_random", "d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485", null ], + [ "get_clock_diff", "d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908", null ], + [ "get_min_2d", "d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f", null ], + [ "kohonen_som", "d4/def/kohonen__som__topology_8cpp.html#adc731720947b4bc2ab047c141e7d0299", null ], + [ "main", "d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "save_2d_data", "d9/d66/group__machine__learning.html#ga6c606bc85a3e9fd9d010f874ad760336", null ], + [ "save_u_matrix", "d4/def/kohonen__som__topology_8cpp.html#a1d577f5d95b774ae97eb6838852d0df5", null ], + [ "test1", "d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", null ], + [ "test2", "d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ], + [ "test3", "d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e", null ], + [ "test_2d_classes", "d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755", null ], + [ "test_3d_classes1", "d4/def/kohonen__som__topology_8cpp.html#ab3081e021270ba21a9fd88646f6a6e26", null ], + [ "test_3d_classes2", "d4/def/kohonen__som__topology_8cpp.html#a0e7435446ed7c763f7de79a468add2e0", null ], + [ "update_weights", "d4/def/kohonen__som__topology_8cpp.html#ac4010fe3a52a74e8b5b1aaadfe38b46f", null ] +]; \ No newline at end of file diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map new file mode 100644 index 000000000..c6fb04c63 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -0,0 +1,25 @@ + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 new file mode 100644 index 000000000..9ebdd8d8f --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 @@ -0,0 +1 @@ +2212341558ef92b106f3c22b810aefd9 \ No newline at end of file diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg new file mode 100644 index 000000000..c4cee394c --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -0,0 +1,466 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen_som + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_2d_data + + + + + +Node1->Node14 + + + + + +Node18 + + +machine_learning::save +_u_matrix + + + + + +Node1->Node18 + + + + + +Node22 + + +test_3d_classes1 + + + + + +Node1->Node22 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node13 + + + + + +Node18->Node15 + + + + + +Node19 + + +std::perror + + + + + +Node18->Node19 + + + + + +Node20 + + +std::pow + + + + + +Node18->Node20 + + + + + +Node21 + + +std::snprintf + + + + + +Node18->Node21 + + + + + +Node22->Node2 + + + + + +Node23 + + +std::rand + + + + + +Node22->Node23 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg new file mode 100644 index 000000000..6532132a0 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -0,0 +1,378 @@ + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen_som + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_2d_data + + + + + +Node1->Node14 + + + + + +Node18 + + +machine_learning::save +_u_matrix + + + + + +Node1->Node18 + + + + + +Node22 + + +test_3d_classes1 + + + + + +Node1->Node22 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node13 + + + + + +Node18->Node15 + + + + + +Node19 + + +std::perror + + + + + +Node18->Node19 + + + + + +Node20 + + +std::pow + + + + + +Node18->Node20 + + + + + +Node21 + + +std::snprintf + + + + + +Node18->Node21 + + + + + +Node22->Node2 + + + + + +Node23 + + +std::rand + + + + + +Node22->Node23 + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map new file mode 100644 index 000000000..c66f43392 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.md5 new file mode 100644 index 000000000..97e5dd59b --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.md5 @@ -0,0 +1 @@ +b88cf6ab42c98e33a2a6b6263d3379c3 \ No newline at end of file diff --git a/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg new file mode 100644 index 000000000..f74b53d91 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a0e7435446ed7c763f7de79a468add2e0_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +test_3d_classes2 + + + +Node1 + + +test_3d_classes2 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +std::rand + + + + + +Node1->Node3 + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map new file mode 100644 index 000000000..8f20f0952 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map @@ -0,0 +1,25 @@ + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 new file mode 100644 index 000000000..6a99a748a --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 @@ -0,0 +1 @@ +244b6433450f7a6dfcf4edcfb0b19853 \ No newline at end of file diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg new file mode 100644 index 000000000..a92dd8a96 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -0,0 +1,466 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen_som + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_2d_data + + + + + +Node1->Node14 + + + + + +Node18 + + +machine_learning::save +_u_matrix + + + + + +Node1->Node18 + + + + + +Node22 + + +test_2d_classes + + + + + +Node1->Node22 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node13 + + + + + +Node18->Node15 + + + + + +Node19 + + +std::perror + + + + + +Node18->Node19 + + + + + +Node20 + + +std::pow + + + + + +Node18->Node20 + + + + + +Node21 + + +std::snprintf + + + + + +Node18->Node21 + + + + + +Node22->Node2 + + + + + +Node23 + + +std::rand + + + + + +Node22->Node23 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg new file mode 100644 index 000000000..9e2038040 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -0,0 +1,378 @@ + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen_som + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_2d_data + + + + + +Node1->Node14 + + + + + +Node18 + + +machine_learning::save +_u_matrix + + + + + +Node1->Node18 + + + + + +Node22 + + +test_2d_classes + + + + + +Node1->Node22 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node13 + + + + + +Node18->Node15 + + + + + +Node19 + + +std::perror + + + + + +Node18->Node19 + + + + + +Node20 + + +std::pow + + + + + +Node18->Node20 + + + + + +Node21 + + +std::snprintf + + + + + +Node18->Node21 + + + + + +Node22->Node2 + + + + + +Node23 + + +std::rand + + + + + +Node22->Node23 + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map new file mode 100644 index 000000000..0f52ca1cb --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map @@ -0,0 +1,34 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 new file mode 100644 index 000000000..2bbe7c675 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 @@ -0,0 +1 @@ +955081ca737810043903e417b4ddcfff \ No newline at end of file diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg new file mode 100644 index 000000000..4ffbe3719 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -0,0 +1,685 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +get_clock_diff + + + + + +Node1->Node3 + + + + + +Node4 + + +std::srand + + + + + +Node1->Node4 + + + + + +Node5 + + +test1 + + + + + +Node1->Node5 + + + + + +Node28 + + +test2 + + + + + +Node1->Node28 + + + + + +Node30 + + +test3 + + + + + +Node1->Node30 + + + + + +Node32 + + +std::time + + + + + +Node1->Node32 + + + + + +Node6 + + +_random + + + + + +Node5->Node6 + + + + + +Node7 + + +machine_learning::kohonen_som + + + + + +Node5->Node7 + + + + + +Node15 + + +std::max + + + + + +Node5->Node15 + + + + + +Node18 + + +save_2d_data + + + + + +Node5->Node18 + + + + + +Node22 + + +machine_learning::save +_u_matrix + + + + + +Node5->Node22 + + + + + +Node26 + + +test_2d_classes + + + + + +Node5->Node26 + + + + + +Node8 + + +machine_learning::update +_weights + + + + + +Node7->Node8 + + + + + +Node9 + + +std::exp + + + + + +Node8->Node9 + + + + + +Node10 + + +get_min_2d + + + + + +Node8->Node10 + + + + + +Node8->Node15 + + + + + +Node16 + + +std::min + + + + + +Node8->Node16 + + + + + +Node17 + + +std::sqrt + + + + + +Node8->Node17 + + + + + +Node11 + + +std::begin + + + + + +Node10->Node11 + + + + + +Node12 + + +std::distance + + + + + +Node10->Node12 + + + + + +Node13 + + +std::end + + + + + +Node10->Node13 + + + + + +Node14 + + +std::min_element + + + + + +Node10->Node14 + + + + + +Node19 + + +std::ofstream::close + + + + + +Node18->Node19 + + + + + +Node20 + + +std::ofstream::is_open + + + + + +Node18->Node20 + + + + + +Node21 + + +std::ofstream::open + + + + + +Node18->Node21 + + + + + +Node22->Node17 + + + + + +Node22->Node19 + + + + + +Node23 + + +std::perror + + + + + +Node22->Node23 + + + + + +Node24 + + +std::pow + + + + + +Node22->Node24 + + + + + +Node25 + + +std::snprintf + + + + + +Node22->Node25 + + + + + +Node26->Node6 + + + + + +Node27 + + +std::rand + + + + + +Node26->Node27 + + + + + +Node28->Node6 + + + + + +Node28->Node7 + + + + + +Node28->Node15 + + + + + +Node28->Node18 + + + + + +Node28->Node22 + + + + + +Node29 + + +test_3d_classes1 + + + + + +Node28->Node29 + + + + + +Node29->Node6 + + + + + +Node29->Node27 + + + + + +Node30->Node6 + + + + + +Node30->Node7 + + + + + +Node30->Node15 + + + + + +Node30->Node18 + + + + + +Node30->Node22 + + + + + +Node31 + + +test_3d_classes2 + + + + + +Node30->Node31 + + + + + +Node31->Node6 + + + + + +Node31->Node27 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg new file mode 100644 index 000000000..bfb012f64 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -0,0 +1,597 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +get_clock_diff + + + + + +Node1->Node3 + + + + + +Node4 + + +std::srand + + + + + +Node1->Node4 + + + + + +Node5 + + +test1 + + + + + +Node1->Node5 + + + + + +Node28 + + +test2 + + + + + +Node1->Node28 + + + + + +Node30 + + +test3 + + + + + +Node1->Node30 + + + + + +Node32 + + +std::time + + + + + +Node1->Node32 + + + + + +Node6 + + +_random + + + + + +Node5->Node6 + + + + + +Node7 + + +machine_learning::kohonen_som + + + + + +Node5->Node7 + + + + + +Node15 + + +std::max + + + + + +Node5->Node15 + + + + + +Node18 + + +save_2d_data + + + + + +Node5->Node18 + + + + + +Node22 + + +machine_learning::save +_u_matrix + + + + + +Node5->Node22 + + + + + +Node26 + + +test_2d_classes + + + + + +Node5->Node26 + + + + + +Node8 + + +machine_learning::update +_weights + + + + + +Node7->Node8 + + + + + +Node9 + + +std::exp + + + + + +Node8->Node9 + + + + + +Node10 + + +get_min_2d + + + + + +Node8->Node10 + + + + + +Node8->Node15 + + + + + +Node16 + + +std::min + + + + + +Node8->Node16 + + + + + +Node17 + + +std::sqrt + + + + + +Node8->Node17 + + + + + +Node11 + + +std::begin + + + + + +Node10->Node11 + + + + + +Node12 + + +std::distance + + + + + +Node10->Node12 + + + + + +Node13 + + +std::end + + + + + +Node10->Node13 + + + + + +Node14 + + +std::min_element + + + + + +Node10->Node14 + + + + + +Node19 + + +std::ofstream::close + + + + + +Node18->Node19 + + + + + +Node20 + + +std::ofstream::is_open + + + + + +Node18->Node20 + + + + + +Node21 + + +std::ofstream::open + + + + + +Node18->Node21 + + + + + +Node22->Node17 + + + + + +Node22->Node19 + + + + + +Node23 + + +std::perror + + + + + +Node22->Node23 + + + + + +Node24 + + +std::pow + + + + + +Node22->Node24 + + + + + +Node25 + + +std::snprintf + + + + + +Node22->Node25 + + + + + +Node26->Node6 + + + + + +Node27 + + +std::rand + + + + + +Node26->Node27 + + + + + +Node28->Node6 + + + + + +Node28->Node7 + + + + + +Node28->Node15 + + + + + +Node28->Node18 + + + + + +Node28->Node22 + + + + + +Node29 + + +test_3d_classes1 + + + + + +Node28->Node29 + + + + + +Node29->Node6 + + + + + +Node29->Node27 + + + + + +Node30->Node6 + + + + + +Node30->Node7 + + + + + +Node30->Node15 + + + + + +Node30->Node18 + + + + + +Node30->Node22 + + + + + +Node31 + + +test_3d_classes2 + + + + + +Node30->Node31 + + + + + +Node31->Node6 + + + + + +Node31->Node27 + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.map new file mode 100644 index 000000000..f0b545590 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.md5 new file mode 100644 index 000000000..66b73a5e4 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.md5 @@ -0,0 +1 @@ +3e030538f835f5236201c24a8ade6fc1 \ No newline at end of file diff --git a/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg new file mode 100644 index 000000000..09c64cef4 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a6b5e744876fd980a3451cbb385d4e755_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +test_2d_classes + + + +Node1 + + +test_2d_classes + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +std::rand + + + + + +Node1->Node3 + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map new file mode 100644 index 000000000..921c76736 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map @@ -0,0 +1,25 @@ + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 new file mode 100644 index 000000000..0f07023f9 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 @@ -0,0 +1 @@ +2dd729dcb1c0d3d338426f92d735d1e9 \ No newline at end of file diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg new file mode 100644 index 000000000..cf1fdabb0 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg @@ -0,0 +1,466 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test3 + + + +Node1 + + +test3 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen_som + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_2d_data + + + + + +Node1->Node14 + + + + + +Node18 + + +machine_learning::save +_u_matrix + + + + + +Node1->Node18 + + + + + +Node22 + + +test_3d_classes2 + + + + + +Node1->Node22 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node13 + + + + + +Node18->Node15 + + + + + +Node19 + + +std::perror + + + + + +Node18->Node19 + + + + + +Node20 + + +std::pow + + + + + +Node18->Node20 + + + + + +Node21 + + +std::snprintf + + + + + +Node18->Node21 + + + + + +Node22->Node2 + + + + + +Node23 + + +std::rand + + + + + +Node22->Node23 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg new file mode 100644 index 000000000..e482cd6a5 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -0,0 +1,378 @@ + + + + + + +test3 + + + +Node1 + + +test3 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen_som + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_2d_data + + + + + +Node1->Node14 + + + + + +Node18 + + +machine_learning::save +_u_matrix + + + + + +Node1->Node18 + + + + + +Node22 + + +test_3d_classes2 + + + + + +Node1->Node22 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node13 + + + + + +Node18->Node15 + + + + + +Node19 + + +std::perror + + + + + +Node18->Node19 + + + + + +Node20 + + +std::pow + + + + + +Node18->Node20 + + + + + +Node21 + + +std::snprintf + + + + + +Node18->Node21 + + + + + +Node22->Node2 + + + + + +Node23 + + +std::rand + + + + + +Node22->Node23 + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.map b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.map new file mode 100644 index 000000000..9efd2bd2e --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.md5 b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.md5 new file mode 100644 index 000000000..0b0eba333 --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.md5 @@ -0,0 +1 @@ +246e70d9ccd7a6bbfdd3e197979233e9 \ No newline at end of file diff --git a/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg new file mode 100644 index 000000000..e668bbc3c --- /dev/null +++ b/d4/def/kohonen__som__topology_8cpp_ab3081e021270ba21a9fd88646f6a6e26_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +test_3d_classes1 + + + +Node1 + + +test_3d_classes1 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +std::rand + + + + + +Node1->Node3 + + + + + diff --git a/d4/df8/prime__numbers_8cpp__incl.map b/d4/df8/prime__numbers_8cpp__incl.map new file mode 100644 index 000000000..d5a4d6631 --- /dev/null +++ b/d4/df8/prime__numbers_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d4/df8/prime__numbers_8cpp__incl.md5 b/d4/df8/prime__numbers_8cpp__incl.md5 new file mode 100644 index 000000000..77e3172a3 --- /dev/null +++ b/d4/df8/prime__numbers_8cpp__incl.md5 @@ -0,0 +1 @@ +3bbb4098a01d35ff40f1af5d62fd207c \ No newline at end of file diff --git a/d4/df8/prime__numbers_8cpp__incl.svg b/d4/df8/prime__numbers_8cpp__incl.svg new file mode 100644 index 000000000..af57e8558 --- /dev/null +++ b/d4/df8/prime__numbers_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/prime_numbers.cpp + + + +Node1 + + +math/prime_numbers.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + + + diff --git a/d5/d15/classcll.html b/d5/d15/classcll.html new file mode 100644 index 000000000..d744d06ff --- /dev/null +++ b/d5/d15/classcll.html @@ -0,0 +1,157 @@ + + + + + + + +Algorithms_in_C++: cll Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for cll:
+
+
+
+
[legend]
+ + + + + + + + + + + + + + + + +

+Public Member Functions

+void display ()
 
+void insert_front (int new_data)
 
+void insert_tail (int new_data)
 
+int get_size ()
 
+bool find_item (int item_to_find)
 
+int operator* ()
 
+void operator++ ()
 
+ + + + + +

+Protected Attributes

+nodehead
 
+int total
 
+
The documentation for this class was generated from the following files:
    +
  • data_structures/cll/cll.h
  • +
  • data_structures/cll/cll.cpp
  • +
+
+
+ + + + diff --git a/d5/d15/classcll.js b/d5/d15/classcll.js new file mode 100644 index 000000000..d2972c0ab --- /dev/null +++ b/d5/d15/classcll.js @@ -0,0 +1,14 @@ +var classcll = +[ + [ "cll", "d5/d15/classcll.html#a3f09a4ec2bc5a211a8409693b4cab4f8", null ], + [ "~cll", "d5/d15/classcll.html#a239fa940a9ca1defdecfeeb07cad351b", null ], + [ "display", "d5/d15/classcll.html#ae957a9434f6d1ffef7461ea4d7c9a8fe", null ], + [ "find_item", "d5/d15/classcll.html#abb6fb5834563d077a4eaff1b7fdc5b44", null ], + [ "get_size", "d5/d15/classcll.html#a04b61bb736525f28b8042c6145e1a265", null ], + [ "insert_front", "d5/d15/classcll.html#a9434bf2d7deca6d7fe1efe06c5341df0", null ], + [ "insert_tail", "d5/d15/classcll.html#a2eb66b7c9d059dcf75090248fa521262", null ], + [ "operator*", "d5/d15/classcll.html#a3665c1dd793c23873f4d8238b86c2021", null ], + [ "operator++", "d5/d15/classcll.html#a1b49e807e33b6f11b2ea151df61a9f2f", null ], + [ "head", "d5/d15/classcll.html#a852ab0b4ec38b8462df3f32ee6f11290", null ], + [ "total", "d5/d15/classcll.html#a23cbc56c51dafc17bd16cecd0f491731", null ] +]; \ No newline at end of file diff --git a/d5/d29/struct_min_heap_node.html b/d5/d29/struct_min_heap_node.html new file mode 100644 index 000000000..66454fa3c --- /dev/null +++ b/d5/d29/struct_min_heap_node.html @@ -0,0 +1,144 @@ + + + + + + + +Algorithms_in_C++: MinHeapNode Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
MinHeapNode Struct Reference
+
+
+
+Collaboration diagram for MinHeapNode:
+
+
+
+
[legend]
+ + + + +

+Public Member Functions

MinHeapNode (char data, unsigned freq)
 
+ + + + + + + + + +

+Public Attributes

+char data
 
+unsigned freq
 
+MinHeapNodeleft
 
+MinHeapNoderight
 
+
The documentation for this struct was generated from the following file:
    +
  • greedy_algorithms/huffman.cpp
  • +
+
+
+ + + + diff --git a/d5/d29/struct_min_heap_node.js b/d5/d29/struct_min_heap_node.js new file mode 100644 index 000000000..74f379906 --- /dev/null +++ b/d5/d29/struct_min_heap_node.js @@ -0,0 +1,8 @@ +var struct_min_heap_node = +[ + [ "MinHeapNode", "d5/d29/struct_min_heap_node.html#a41f73e87e4ddf1fbe72ae0db2b4e674e", null ], + [ "data", "d5/d29/struct_min_heap_node.html#a3d422a54a6e8f8ebc7e386125a09d8e8", null ], + [ "freq", "d5/d29/struct_min_heap_node.html#a3b604fe2d4f56fcb78f8e0e02b0458fd", null ], + [ "left", "d5/d29/struct_min_heap_node.html#ad06549be842d9a2cacdb3e55b019e68c", null ], + [ "right", "d5/d29/struct_min_heap_node.html#a6df054c3211ae8a8ec15a21e7d18343a", null ] +]; \ No newline at end of file diff --git a/d5/d67/bayes__theorem_8cpp.html b/d5/d67/bayes__theorem_8cpp.html new file mode 100644 index 000000000..07f79aa6b --- /dev/null +++ b/d5/d67/bayes__theorem_8cpp.html @@ -0,0 +1,249 @@ + + + + + + + +Algorithms_in_C++: probability/bayes_theorem.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
bayes_theorem.cpp File Reference
+
+
+ +

Bayes' theorem +More...

+
#include <iostream>
+
+Include dependency graph for bayes_theorem.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

double bayes_AgivenB (double BgivenA, double A, double B)
 
double bayes_BgivenA (double AgivenB, double A, double B)
 
int main ()
 
+

Detailed Description

+

Bayes' theorem

+

Bayes' theorem allows one to find \(P(A|B)\) given \(P(B|A)\) or \(P(B|A)\) given \(P(A|B)\) and \(P(A)\) and \(P(B)\).
+Note that \(P(A|B)\) is read 'The probability of A given that the event B has occured'.

+

Function Documentation

+ +

◆ bayes_AgivenB()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
double bayes_AgivenB (double BgivenA,
double A,
double B 
)
+
+

returns P(A|B)

+
14  {
+
15  return (BgivenA * A) / B;
+
16 }
+
+
+
+ +

◆ bayes_BgivenA()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
double bayes_BgivenA (double AgivenB,
double A,
double B 
)
+
+

returns P(B|A)

+
20  {
+
21  return (AgivenB * B) / A;
+
22 }
+
+
+
+ +

◆ main()

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

Main function

+
26  {
+
27  double A = 0.01;
+
28  double B = 0.1;
+
29  double BgivenA = 0.9;
+
30  double AgivenB = bayes_AgivenB(BgivenA, A, B);
+
31  std::cout << "A given B = " << AgivenB << std::endl;
+
32  std::cout << "B given A = " << bayes_BgivenA(AgivenB, A, B) << std::endl;
+
33  return 0;
+
34 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
double bayes_BgivenA(double AgivenB, double A, double B)
Definition: bayes_theorem.cpp:20
+
T endl(T... args)
+
double bayes_AgivenB(double BgivenA, double A, double B)
Definition: bayes_theorem.cpp:14
+ + + + diff --git a/d5/d67/bayes__theorem_8cpp.js b/d5/d67/bayes__theorem_8cpp.js new file mode 100644 index 000000000..71cc745e7 --- /dev/null +++ b/d5/d67/bayes__theorem_8cpp.js @@ -0,0 +1,6 @@ +var bayes__theorem_8cpp = +[ + [ "bayes_AgivenB", "d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba", null ], + [ "bayes_BgivenA", "d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f", null ], + [ "main", "d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..f78c6528c --- /dev/null +++ b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..c86d21849 --- /dev/null +++ b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +718425e2eede875e538fb847db93f736 \ No newline at end of file diff --git a/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..d216d280d --- /dev/null +++ b/d5/d67/bayes__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +bayes_AgivenB + + + + + +Node1->Node2 + + + + + +Node3 + + +bayes_BgivenA + + + + + +Node1->Node3 + + + + + +Node4 + + +std::endl + + + + + +Node1->Node4 + + + + + diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html new file mode 100644 index 000000000..b4312d016 --- /dev/null +++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html @@ -0,0 +1,372 @@ + + + + + + + +Algorithms_in_C++: List of all files + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
List of all files
+
+
+

+Backtracking

+ +

+Data Structures

+ +

+Dynamic Programming

+ +

+Geometry

+ +

+Graph

+ +

+Greedy Algorithms

+ +

+Hashing

+ +

+Machine Learning

+ +

+Math

+ +

+Numerical Methods

+ +

+Operations On Datastructures

+ +

+Others

+ +

+Probability

+ +

+Range Queries

+ +

+Search

+ +

+Sorting

+ +

+Strings

+ +
+
+
+ + + + diff --git a/d5/d8b/least__common__multiple_8cpp__incl.map b/d5/d8b/least__common__multiple_8cpp__incl.map new file mode 100644 index 000000000..83c053e15 --- /dev/null +++ b/d5/d8b/least__common__multiple_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d5/d8b/least__common__multiple_8cpp__incl.md5 b/d5/d8b/least__common__multiple_8cpp__incl.md5 new file mode 100644 index 000000000..96095fe96 --- /dev/null +++ b/d5/d8b/least__common__multiple_8cpp__incl.md5 @@ -0,0 +1 @@ +d4fba7214129761f4d2eac8f32cdd94a \ No newline at end of file diff --git a/d5/d8b/least__common__multiple_8cpp__incl.svg b/d5/d8b/least__common__multiple_8cpp__incl.svg new file mode 100644 index 000000000..201234857 --- /dev/null +++ b/d5/d8b/least__common__multiple_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/least_common_multiple.cpp + + + +Node1 + + +math/least_common_multiple.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/d5/d91/namespacesorting.html b/d5/d91/namespacesorting.html new file mode 100644 index 000000000..c159ba0c4 --- /dev/null +++ b/d5/d91/namespacesorting.html @@ -0,0 +1,606 @@ + + + + + + + +Algorithms_in_C++: sorting Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
sorting Namespace Reference
+
+
+ +

Sorting algorithms. +More...

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<class Iterator >
void merge (Iterator l, Iterator r, const Iterator e, char b[])
 merges 2 sorted adjacent segments into a larger sorted segment More...
 
template<class Iterator >
void non_recursive_merge_sort (const Iterator first, const Iterator last, const size_t n)
 bottom-up merge sort which sorts elements in a non-decreasing order More...
 
template<class Iterator >
void non_recursive_merge_sort (const Iterator first, const size_t n)
 bottom-up merge sort which sorts elements in a non-decreasing order More...
 
template<class Iterator >
void non_recursive_merge_sort (const Iterator first, const Iterator last)
 bottom-up merge sort which sorts elements in a non-decreasing order More...
 
int partition (int arr[], int low, int high)
 
void quickSort (int arr[], int low, int high)
 
template<typename T >
void shell_sort (T *arr, size_t LEN)
 
template<typename T , size_t N>
void shell_sort (T(&arr)[N])
 
template<typename T >
void shell_sort (std::vector< T > *arr)
 
+

Detailed Description

+

Sorting algorithms.

+

Function Documentation

+ +

◆ merge()

+ +
+
+
+template<class Iterator >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void sorting::merge (Iterator l,
Iterator r,
const Iterator e,
char b[] 
)
+
+ +

merges 2 sorted adjacent segments into a larger sorted segment

+

best-case = worst-case = O(n)

Parameters
+ + + + + +
lpoints to the left part
rpoints to the right part, end of left part
epoints to end of right part
bpoints at the buffer
+
+
+
57  {
+
58  // create 2 pointers to point at the buffer
+
59  auto p(reinterpret_cast<std::remove_reference_t<decltype(*l)>*>(b)), c(p);
+
60  // move the left part of the segment
+
61  for (Iterator t(l); r != t; ++t) *p++ = std::move(*t);
+
62  // while neither the buffer nor the right part has been exhausted
+
63  // move the smallest element of the two back to the container
+
64  while (e != r && c != p) *l++ = std::move(*r < *c ? *r++ : *c++);
+
65  // notice only one of the two following loops will be executed
+
66  // while the right part hasn't bee exhausted, move it back
+
67  while (e != r) *l++ = std::move(*r++);
+
68  // while the buffer hasn't bee exhausted, move it back
+
69  while (c != p) *l++ = std::move(*c++);
+
70 }
+
+
+
+ +

◆ non_recursive_merge_sort() [1/3]

+ +
+
+
+template<class Iterator >
+ + + + + + + + + + + + + + + + + + +
void sorting::non_recursive_merge_sort (const Iterator first,
const Iterator last 
)
+
+ +

bottom-up merge sort which sorts elements in a non-decreasing order

+
Parameters
+ + + +
firstpoints to the first element
lastpoints to 1-step past the last element
+
+
+
86  {
+
87  non_recursive_merge_sort(first, last, last - first);
+
88 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ non_recursive_merge_sort() [2/3]

+ +
+
+
+template<class Iterator >
+ + + + + + + + + + + + + + + + + + + + + + + + +
void sorting::non_recursive_merge_sort (const Iterator first,
const Iterator last,
const size_t n 
)
+
+ +

bottom-up merge sort which sorts elements in a non-decreasing order

+

sorts elements non-recursively by breaking them into small segments, merging adjacent segments into larger sorted segments, then increasing the sizes of segments by factors of 2 and repeating the same process. best-case = worst-case = O(n log(n))

Parameters
+ + + + +
firstpoints to the first element
lastpoints to 1-step past the last element
nthe number of elements
+
+
+
26  {
+
27  // create a buffer large enough to store all elements
+
28  // dynamically allocated to comply with cpplint
+
29  char* buffer = new char[n * sizeof(*first)];
+
30  // buffer size can be optimized to largest power of 2 less than n
+
31  // elements divide the container into equally-sized segments whose
+
32  // length start at 1 and keeps increasing by factors of 2
+
33  for (size_t length(1); length < n; length <<= 1) {
+
34  // merge adjacent segments whose number is n / (length * 2)
+
35  Iterator left(first);
+
36  for (size_t counter(n / (length << 1)); counter; --counter) {
+
37  Iterator right(left + length), end(right + length);
+
38  merge(left, right, end, buffer);
+
39  left = end;
+
40  }
+
41  // if the number of remaining elements (n * 2 % length) is longer
+
42  // than a segment, merge the remaining elements
+
43  if ((n & ((length << 1) - 1)) > length)
+
44  merge(left, left + length, last, buffer);
+
45  }
+
46  delete[] buffer;
+
47 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ non_recursive_merge_sort() [3/3]

+ +
+
+
+template<class Iterator >
+ + + + + + + + + + + + + + + + + + +
void sorting::non_recursive_merge_sort (const Iterator first,
const size_t n 
)
+
+ +

bottom-up merge sort which sorts elements in a non-decreasing order

+
Parameters
+ + + +
firstpoints to the first element
nthe number of elements
+
+
+
77  {
+
78  non_recursive_merge_sort(first, first + n, n);
+
79 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ partition()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int sorting::partition (int arr[],
int low,
int high 
)
+
+

This function takes last element as pivot, places the pivot element at its correct position in sorted array, and places all smaller (smaller than pivot) to left of pivot and all greater elements to right of pivot

+
37  {
+
38  int pivot = arr[high]; // taking the last element as pivot
+
39  int i = (low - 1); // Index of smaller element
+
40 
+
41  for (int j = low; j < high; j++) {
+
42  // If current element is smaller than or
+
43  // equal to pivot
+
44  if (arr[j] <= pivot) {
+
45  i++; // increment index of smaller element
+
46  int temp = arr[i];
+
47  arr[i] = arr[j];
+
48  arr[j] = temp;
+
49  }
+
50  }
+
51  int temp = arr[i + 1];
+
52  arr[i + 1] = arr[high];
+
53  arr[high] = temp;
+
54  return (i + 1);
+
55 }
+
+
+
+ +

◆ quickSort()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void sorting::quickSort (int arr[],
int low,
int high 
)
+
+

The main function that implements QuickSort arr[] --> Array to be sorted, low --> Starting index, high --> Ending index

+
63  {
+
64  if (low < high) {
+
65  int p = partition(arr, low, high);
+
66  quickSort(arr, low, p - 1);
+
67  quickSort(arr, p + 1, high);
+
68  }
+
69 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ shell_sort() [1/3]

+ +
+
+
+template<typename T >
+ + + + + + + + +
void sorting::shell_sort (std::vector< T > * arr)
+
+

function overload - when input array is of type std::vector, simply send the data content and the data length to the above function.

+
75  {
+
76  shell_sort(arr->data(), arr->size());
+
77 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ shell_sort() [2/3]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
void sorting::shell_sort (T * arr,
size_t LEN 
)
+
+

Optimized algorithm - takes half the time by utilizing Mar

+
45  {
+
46  const unsigned int gaps[] = {701, 301, 132, 57, 23, 10, 4, 1};
+
47  const unsigned int gap_len = 8;
+
48  size_t i, j, g;
+
49 
+
50  for (g = 0; g < gap_len; g++) {
+
51  unsigned int gap = gaps[g];
+
52  for (i = gap; i < LEN; i++) {
+
53  T tmp = arr[i];
+
54 
+
55  for (j = i; j >= gap && (arr[j - gap] - tmp) > 0; j -= gap) {
+
56  arr[j] = arr[j - gap];
+
57  }
+
58 
+
59  arr[j] = tmp;
+
60  }
+
61  }
+
62 }
+
+
+
+ +

◆ shell_sort() [3/3]

+ +
+
+
+template<typename T , size_t N>
+ + + + + + + + +
void sorting::shell_sort (T(&) arr[N])
+
+

function overload - when input array is of a known length array type

+
67  {
+
68  shell_sort(arr, N);
+
69 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T move(T... args)
+
int partition(int arr[], int low, int high)
Definition: quick_sort.cpp:37
+
void merge(Iterator, Iterator, const Iterator, char[])
merges 2 sorted adjacent segments into a larger sorted segment
Definition: non_recursive_merge_sort.cpp:57
+
void non_recursive_merge_sort(const Iterator first, const Iterator last)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition: non_recursive_merge_sort.cpp:86
+
T left(T... args)
+
T end(T... args)
+
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
+
void shell_sort(std::vector< T > *arr)
Definition: shell_sort2.cpp:75
+ + + + diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map new file mode 100644 index 000000000..e074b63a2 --- /dev/null +++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 new file mode 100644 index 000000000..34493823b --- /dev/null +++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.md5 @@ -0,0 +1 @@ +2c67bfbae0f7a99a140344c2e6377117 \ No newline at end of file diff --git a/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg new file mode 100644 index 000000000..e8d7a00e2 --- /dev/null +++ b/d5/d91/namespacesorting_a140d913e42fb94176a0b2c8b29a80420_cgraph.svg @@ -0,0 +1,38 @@ + + + + + + +sorting::non_recursive_merge_sort + + + +Node1 + + +sorting::non_recursive +_merge_sort + + + + + +Node2 + + +sorting::merge + + + + + +Node1->Node2 + + + + + diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map new file mode 100644 index 000000000..0e7bb9b94 --- /dev/null +++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 new file mode 100644 index 000000000..9a973be86 --- /dev/null +++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.md5 @@ -0,0 +1 @@ +0a7657a7dba6aa5f59c7d53ff282bea7 \ No newline at end of file diff --git a/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg new file mode 100644 index 000000000..38af1823f --- /dev/null +++ b/d5/d91/namespacesorting_a27236b8d3df3832e1f1225576a122534_cgraph.svg @@ -0,0 +1,54 @@ + + + + + + +sorting::non_recursive_merge_sort + + + +Node1 + + +sorting::non_recursive +_merge_sort + + + + + +Node2 + + +sorting::non_recursive +_merge_sort + + + + + +Node1->Node2 + + + + + +Node3 + + +sorting::merge + + + + + +Node2->Node3 + + + + + diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map new file mode 100644 index 000000000..8259bb9a1 --- /dev/null +++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 new file mode 100644 index 000000000..9ff4dceb7 --- /dev/null +++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.md5 @@ -0,0 +1 @@ +b684df4aa9e5be54b7a23a1903a92e66 \ No newline at end of file diff --git a/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg new file mode 100644 index 000000000..06679387e --- /dev/null +++ b/d5/d91/namespacesorting_a4d76603c54d3dc56146e92d10a043924_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +sorting::shell_sort + + + +Node1 + + +sorting::shell_sort + + + + + +Node2 + + +sorting::shell_sort + + + + + +Node1->Node2 + + + + + diff --git a/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.map b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.map new file mode 100644 index 000000000..a0da5b50f --- /dev/null +++ b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.md5 b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.md5 new file mode 100644 index 000000000..8715ffdc6 --- /dev/null +++ b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.md5 @@ -0,0 +1 @@ +bd47edf295ad452b0aba2ed1b14bc86a \ No newline at end of file diff --git a/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.svg b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.svg new file mode 100644 index 000000000..63b698316 --- /dev/null +++ b/d5/d91/namespacesorting_a50b66a1c652291b9a346ec7342967178_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +sorting::quickSort + + + +Node1 + + +sorting::quickSort + + + + + +Node2 + + +sorting::partition + + + + + +Node1->Node2 + + + + + diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map new file mode 100644 index 000000000..0e7bb9b94 --- /dev/null +++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 new file mode 100644 index 000000000..9a973be86 --- /dev/null +++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.md5 @@ -0,0 +1 @@ +0a7657a7dba6aa5f59c7d53ff282bea7 \ No newline at end of file diff --git a/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg new file mode 100644 index 000000000..38af1823f --- /dev/null +++ b/d5/d91/namespacesorting_ae97f4dd815654c4682f564afd718e824_cgraph.svg @@ -0,0 +1,54 @@ + + + + + + +sorting::non_recursive_merge_sort + + + +Node1 + + +sorting::non_recursive +_merge_sort + + + + + +Node2 + + +sorting::non_recursive +_merge_sort + + + + + +Node1->Node2 + + + + + +Node3 + + +sorting::merge + + + + + +Node2->Node3 + + + + + diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map new file mode 100644 index 000000000..8259bb9a1 --- /dev/null +++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 new file mode 100644 index 000000000..9ff4dceb7 --- /dev/null +++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.md5 @@ -0,0 +1 @@ +b684df4aa9e5be54b7a23a1903a92e66 \ No newline at end of file diff --git a/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg new file mode 100644 index 000000000..06679387e --- /dev/null +++ b/d5/d91/namespacesorting_af2c5b92cbfe73f63f6074c61b0a45331_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +sorting::shell_sort + + + +Node1 + + +sorting::shell_sort + + + + + +Node2 + + +sorting::shell_sort + + + + + +Node1->Node2 + + + + + diff --git a/d5/da1/structnode.html b/d5/da1/structnode.html new file mode 100644 index 000000000..561033c55 --- /dev/null +++ b/d5/da1/structnode.html @@ -0,0 +1,197 @@ + + + + + + + +Algorithms_in_C++: node< Kind > Class Template Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
node< Kind > Class Template Reference
+
+
+ +

#include <queue.h>

+
+Collaboration diagram for node< Kind >:
+
+
+
+
[legend]
+ + + + +

+Public Member Functions

node (int d)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Attributes

+int data
 
+int height
 
+struct nodeleft
 
+struct noderight
 
+int val
 
+nodeleft
 
+noderight
 
+struct nodenext
 
+nodenext
 
+nodeprev
 
+Kind data
 
+node< Kind > * next
 
+Type data
 
+node< Type > * next
 
+nodelink
 
+

Detailed Description

+

template<class Kind>
+class node< Kind >

+ +

Definition of the node

+

The documentation for this class was generated from the following files:
    +
  • data_structures/avltree.cpp
  • +
  • data_structures/binary_search_tree.cpp
  • +
  • data_structures/circular_queue_using_linked_list.cpp
  • +
  • data_structures/cll/cll.h
  • +
  • data_structures/doubly_linked_list.cpp
  • +
  • data_structures/linked_list.cpp
  • +
  • data_structures/queue.h
  • +
  • data_structures/queue_using_linked_list.cpp
  • +
  • data_structures/stack.h
  • +
  • data_structures/stack_using_linked_list.cpp
  • +
  • data_structures/tree.cpp
  • +
  • operations_on_datastructures/circular_linked_list.cpp
  • +
  • operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp
  • +
  • operations_on_datastructures/selectionsortlinkedlist.cpp
  • +
+
+
+ + + + diff --git a/d5/da1/structnode.js b/d5/da1/structnode.js new file mode 100644 index 000000000..320cbf44d --- /dev/null +++ b/d5/da1/structnode.js @@ -0,0 +1,19 @@ +var structnode = +[ + [ "node", "d5/da1/structnode.html#ae25177a73e691793d09907d55425393d", null ], + [ "data", "d5/da1/structnode.html#ae18516310e75fbce2d5835a22fcbd46e", null ], + [ "data", "d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37", null ], + [ "data", "d5/da1/structnode.html#aa471ccc9ddefb54fe75d5c1137600465", null ], + [ "height", "d5/da1/structnode.html#a0d4a5d1d3d77036ea6640f34b17b6554", null ], + [ "left", "d5/da1/structnode.html#ada2fb2ea1c35a4ab2881d1a4207eed53", null ], + [ "left", "d5/da1/structnode.html#a063635bc4e984d971d1efeb4230b0515", null ], + [ "link", "d5/da1/structnode.html#adc3502aef8ccd478919b7103dba81369", null ], + [ "next", "d5/da1/structnode.html#a53aa12087003fd7645f2a0480d97349f", null ], + [ "next", "d5/da1/structnode.html#a135f25acadfbba644f848f1aa18d8350", null ], + [ "next", "d5/da1/structnode.html#a0ff89d3a408eee8a4ce6a69bfe0ddecf", null ], + [ "next", "d5/da1/structnode.html#a7fae5430b43b30b3d1a546c05a678dfb", null ], + [ "prev", "d5/da1/structnode.html#aa459f7bd84bc2bf0cb7ce32334651dda", null ], + [ "right", "d5/da1/structnode.html#aba5018249a25d1f007685eccc9f1dba8", null ], + [ "right", "d5/da1/structnode.html#a60d8451d06575ab0837739477506ef24", null ], + [ "val", "d5/da1/structnode.html#a7ced285cc21c3454de45ff1965e1eb78", null ] +]; \ No newline at end of file diff --git a/d5/db0/adaline__learning_8cpp.html b/d5/db0/adaline__learning_8cpp.html new file mode 100644 index 000000000..27aa4383d --- /dev/null +++ b/d5/db0/adaline__learning_8cpp.html @@ -0,0 +1,434 @@ + + + + + + + +Algorithms_in_C++: machine_learning/adaline_learning.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
adaline_learning.cpp File Reference
+
+
+ +

Adaptive Linear Neuron (ADALINE) implementation +More...

+
#include <cassert>
+#include <climits>
+#include <cmath>
+#include <cstdlib>
+#include <ctime>
+#include <iostream>
+#include <numeric>
+#include <vector>
+
+Include dependency graph for adaline_learning.cpp:
+
+
+
+
+
+ + + +

+Classes

class  machine_learning::adaline
 
+ + + + +

+Namespaces

 machine_learning
 Machine learning algorithms.
 
+ + + +

+Macros

+#define MAX_ITER   500
 
+ + + + + + + + + +

+Functions

void test1 (double eta=0.01)
 
void test2 (double eta=0.01)
 
void test3 (double eta=0.01)
 
int main (int argc, char **argv)
 
+

Detailed Description

+

Adaptive Linear Neuron (ADALINE) implementation

+
Author
Krishna Vedala
+

source ADALINE is one of the first and simplest single layer artificial neural network. The algorithm essentially implements a linear function

+\[ f\left(x_0,x_1,x_2,\ldots\right) = \sum_j x_jw_j+\theta \] +

+

where \(x_j\) are the input features of a sample, \(w_j\) are the coefficients of the linear function and \(\theta\) is a constant. If we know the \(w_j\), then for any given set of features, \(y\) can be computed. Computing the \(w_j\) is a supervised learning algorithm wherein a set of features and their corresponding outputs are given and weights are computed using stochastic gradient descent method.

+

Function Documentation

+ +

◆ main()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int main (int argc,
char ** argv 
)
+
+

Main function

+
331  {
+
332  std::srand(std::time(nullptr)); // initialize random number generator
+
333 
+
334  double eta = 0.1; // default value of eta
+
335  if (argc == 2) // read eta value from commandline argument if present
+
336  eta = strtof(argv[1], nullptr);
+
337 
+
338  test1(eta);
+
339 
+
340  std::cout << "Press ENTER to continue..." << std::endl;
+
341  std::cin.get();
+
342 
+
343  test2(eta);
+
344 
+
345  std::cout << "Press ENTER to continue..." << std::endl;
+
346  std::cin.get();
+
347 
+
348  test3(eta);
+
349 
+
350  return 0;
+
351 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test1()

+ +
+
+ + + + + + + + +
void test1 (double eta = 0.01)
+
+

test function to predict points in a 2D coordinate system above the line \(x=y\) as +1 and others as -1. Note that each point is defined by 2 values or 2 features.

Parameters
+ + +
[in]etalearning rate (optional, default=0.01)
+
+
+
202  {
+
203  adaline ada(2, eta); // 2 features
+
204 
+
205  const int N = 10; // number of sample points
+
206 
+
207  std::vector<double> X[N] = {{0, 1}, {1, -2}, {2, 3}, {3, -1},
+
208  {4, 1}, {6, -5}, {-7, -3}, {-8, 5},
+
209  {-9, 2}, {-10, -15}};
+
210  int y[] = {1, -1, 1, -1, -1, -1, 1, 1, 1, -1}; // corresponding y-values
+
211 
+
212  std::cout << "------- Test 1 -------" << std::endl;
+
213  std::cout << "Model before fit: " << ada << std::endl;
+
214 
+
215  ada.fit(X, y);
+
216  std::cout << "Model after fit: " << ada << std::endl;
+
217 
+
218  int predict = ada.predict({5, -3});
+
219  std::cout << "Predict for x=(5,-3): " << predict;
+
220  assert(predict == -1);
+
221  std::cout << " ...passed" << std::endl;
+
222 
+
223  predict = ada.predict({5, 8});
+
224  std::cout << "Predict for x=(5,8): " << predict;
+
225  assert(predict == 1);
+
226  std::cout << " ...passed" << std::endl;
+
227 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test2()

+ +
+
+ + + + + + + + +
void test2 (double eta = 0.01)
+
+

test function to predict points in a 2D coordinate system above the line \(x+3y=-1\) as +1 and others as -1. Note that each point is defined by 2 values or 2 features. The function will create random sample points for training and test purposes.

Parameters
+ + +
[in]etalearning rate (optional, default=0.01)
+
+
+
236  {
+
237  adaline ada(2, eta); // 2 features
+
238 
+
239  const int N = 50; // number of sample points
+
240 
+
241  std::vector<double> X[N];
+
242  int Y[N]; // corresponding y-values
+
243 
+
244  // generate sample points in the interval
+
245  // [-range2/100 , (range2-1)/100]
+
246  int range = 500; // sample points full-range
+
247  int range2 = range >> 1; // sample points half-range
+
248  for (int i = 0; i < N; i++) {
+
249  double x0 = ((std::rand() % range) - range2) / 100.f;
+
250  double x1 = ((std::rand() % range) - range2) / 100.f;
+
251  X[i] = {x0, x1};
+
252  Y[i] = (x0 + 3. * x1) > -1 ? 1 : -1;
+
253  }
+
254 
+
255  std::cout << "------- Test 2 -------" << std::endl;
+
256  std::cout << "Model before fit: " << ada << std::endl;
+
257 
+
258  ada.fit(X, Y);
+
259  std::cout << "Model after fit: " << ada << std::endl;
+
260 
+
261  int N_test_cases = 5;
+
262  for (int i = 0; i < N_test_cases; i++) {
+
263  double x0 = ((std::rand() % range) - range2) / 100.f;
+
264  double x1 = ((std::rand() % range) - range2) / 100.f;
+
265 
+
266  int predict = ada.predict({x0, x1});
+
267 
+
268  std::cout << "Predict for x=(" << x0 << "," << x1 << "): " << predict;
+
269 
+
270  int expected_val = (x0 + 3. * x1) > -1 ? 1 : -1;
+
271  assert(predict == expected_val);
+
272  std::cout << " ...passed" << std::endl;
+
273  }
+
274 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test3()

+ +
+
+ + + + + + + + +
void test3 (double eta = 0.01)
+
+

test function to predict points in a 3D coordinate system lying within the sphere of radius 1 and centre at origin as +1 and others as -1. Note that each point is defined by 3 values but we use 6 features. The function will create random sample points for training and test purposes. The sphere centred at origin and radius 1 is defined as: \(x^2+y^2+z^2=r^2=1\) and if the \(r^2<1\), point lies within the sphere else, outside.

+
Parameters
+ + +
[in]etalearning rate (optional, default=0.01)
+
+
+
287  {
+
288  adaline ada(6, eta); // 2 features
+
289 
+
290  const int N = 100; // number of sample points
+
291 
+
292  std::vector<double> X[N];
+
293  int Y[N]; // corresponding y-values
+
294 
+
295  // generate sample points in the interval
+
296  // [-range2/100 , (range2-1)/100]
+
297  int range = 200; // sample points full-range
+
298  int range2 = range >> 1; // sample points half-range
+
299  for (int i = 0; i < N; i++) {
+
300  double x0 = ((std::rand() % range) - range2) / 100.f;
+
301  double x1 = ((std::rand() % range) - range2) / 100.f;
+
302  double x2 = ((std::rand() % range) - range2) / 100.f;
+
303  X[i] = {x0, x1, x2, x0 * x0, x1 * x1, x2 * x2};
+
304  Y[i] = ((x0 * x0) + (x1 * x1) + (x2 * x2)) <= 1.f ? 1 : -1;
+
305  }
+
306 
+
307  std::cout << "------- Test 3 -------" << std::endl;
+
308  std::cout << "Model before fit: " << ada << std::endl;
+
309 
+
310  ada.fit(X, Y);
+
311  std::cout << "Model after fit: " << ada << std::endl;
+
312 
+
313  int N_test_cases = 5;
+
314  for (int i = 0; i < N_test_cases; i++) {
+
315  double x0 = ((std::rand() % range) - range2) / 100.f;
+
316  double x1 = ((std::rand() % range) - range2) / 100.f;
+
317  double x2 = ((std::rand() % range) - range2) / 100.f;
+
318 
+
319  int predict = ada.predict({x0, x1, x2, x0 * x0, x1 * x1, x2 * x2});
+
320 
+
321  std::cout << "Predict for x=(" << x0 << "," << x1 << "," << x2
+
322  << "): " << predict;
+
323 
+
324  int expected_val = ((x0 * x0) + (x1 * x1) + (x2 * x2)) <= 1.f ? 1 : -1;
+
325  assert(predict == expected_val);
+
326  std::cout << " ...passed" << std::endl;
+
327  }
+
328 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T srand(T... args)
+ +
void test1(double eta=0.01)
Definition: adaline_learning.cpp:202
+ +
T rand(T... args)
+
T endl(T... args)
+
T strtof(T... args)
+
T time(T... args)
+ +
void test2(double eta=0.01)
Definition: adaline_learning.cpp:236
+
void test3(double eta=0.01)
Definition: adaline_learning.cpp:287
+
Definition: adaline_learning.cpp:42
+ + + + diff --git a/d5/db0/adaline__learning_8cpp.js b/d5/db0/adaline__learning_8cpp.js new file mode 100644 index 000000000..0f463d7d1 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp.js @@ -0,0 +1,9 @@ +var adaline__learning_8cpp = +[ + [ "adaline", "d6/d30/classmachine__learning_1_1adaline.html", "d6/d30/classmachine__learning_1_1adaline" ], + [ "MAX_ITER", "d9/d66/group__machine__learning.html#gacd517c6f195c75b9dd0f3aad65326f3b", null ], + [ "main", "d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "test1", "d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499", null ], + [ "test2", "d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82", null ], + [ "test3", "d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9", null ] +]; \ No newline at end of file diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map new file mode 100644 index 000000000..3dd87fab6 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.map @@ -0,0 +1,13 @@ + + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5 new file mode 100644 index 000000000..941f17397 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.md5 @@ -0,0 +1 @@ +870bd22c77bc2127b72dd097a9637e2e \ No newline at end of file diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg new file mode 100644 index 000000000..e0ad8a8f0 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph.svg @@ -0,0 +1,286 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::adaline::fit + + + + + +Node1->Node3 + + + + + +Node6 + + +machine_learning::adaline +::predict + + + + + +Node1->Node6 + + + + + +Node11 + + +std::rand + + + + + +Node1->Node11 + + + + + +Node4 + + +machine_learning::adaline +::check_size_match + + + + + +Node3->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node3->Node5 + + + + + +Node3->Node6 + + + + + +Node4->Node2 + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node7 + + +std::vector::back + + + + + +Node6->Node7 + + + + + +Node8 + + +std::vector::begin + + + + + +Node6->Node8 + + + + + +Node9 + + +std::vector::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::inner_product + + + + + +Node6->Node10 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg new file mode 100644 index 000000000..b6a46d97b --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a379f7488a305f2571f2932b319931f82_cgraph_org.svg @@ -0,0 +1,198 @@ + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::adaline::fit + + + + + +Node1->Node3 + + + + + +Node6 + + +machine_learning::adaline +::predict + + + + + +Node1->Node6 + + + + + +Node11 + + +std::rand + + + + + +Node1->Node11 + + + + + +Node4 + + +machine_learning::adaline +::check_size_match + + + + + +Node3->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node3->Node5 + + + + + +Node3->Node6 + + + + + +Node4->Node2 + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node7 + + +std::vector::back + + + + + +Node6->Node7 + + + + + +Node8 + + +std::vector::begin + + + + + +Node6->Node8 + + + + + +Node9 + + +std::vector::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::inner_product + + + + + +Node6->Node10 + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map new file mode 100644 index 000000000..e2f669efd --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map @@ -0,0 +1,18 @@ + + + + + + + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 new file mode 100644 index 000000000..e458dc7e7 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 @@ -0,0 +1 @@ +d1457a6c2ab59fcbea73ce2ef9e7ac3b \ No newline at end of file diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg new file mode 100644 index 000000000..85752cc52 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -0,0 +1,409 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::srand + + + + + +Node1->Node3 + + + + + +Node4 + + +test1 + + + + + +Node1->Node4 + + + + + +Node13 + + +test2 + + + + + +Node1->Node13 + + + + + +Node15 + + +test3 + + + + + +Node1->Node15 + + + + + +Node16 + + +std::time + + + + + +Node1->Node16 + + + + + +Node4->Node2 + + + + + +Node5 + + +machine_learning::adaline::fit + + + + + +Node4->Node5 + + + + + +Node8 + + +machine_learning::adaline +::predict + + + + + +Node4->Node8 + + + + + +Node6 + + +machine_learning::adaline +::check_size_match + + + + + +Node5->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node5->Node7 + + + + + +Node5->Node8 + + + + + +Node6->Node2 + + + + + +Node6->Node7 + + + + + +Node8->Node6 + + + + + +Node9 + + +std::vector::back + + + + + +Node8->Node9 + + + + + +Node10 + + +std::vector::begin + + + + + +Node8->Node10 + + + + + +Node11 + + +std::vector::end + + + + + +Node8->Node11 + + + + + +Node12 + + +std::inner_product + + + + + +Node8->Node12 + + + + + +Node13->Node2 + + + + + +Node13->Node5 + + + + + +Node13->Node8 + + + + + +Node14 + + +std::rand + + + + + +Node13->Node14 + + + + + +Node15->Node2 + + + + + +Node15->Node5 + + + + + +Node15->Node8 + + + + + +Node15->Node14 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg new file mode 100644 index 000000000..4cfcc538d --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -0,0 +1,321 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::srand + + + + + +Node1->Node3 + + + + + +Node4 + + +test1 + + + + + +Node1->Node4 + + + + + +Node13 + + +test2 + + + + + +Node1->Node13 + + + + + +Node15 + + +test3 + + + + + +Node1->Node15 + + + + + +Node16 + + +std::time + + + + + +Node1->Node16 + + + + + +Node4->Node2 + + + + + +Node5 + + +machine_learning::adaline::fit + + + + + +Node4->Node5 + + + + + +Node8 + + +machine_learning::adaline +::predict + + + + + +Node4->Node8 + + + + + +Node6 + + +machine_learning::adaline +::check_size_match + + + + + +Node5->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node5->Node7 + + + + + +Node5->Node8 + + + + + +Node6->Node2 + + + + + +Node6->Node7 + + + + + +Node8->Node6 + + + + + +Node9 + + +std::vector::back + + + + + +Node8->Node9 + + + + + +Node10 + + +std::vector::begin + + + + + +Node8->Node10 + + + + + +Node11 + + +std::vector::end + + + + + +Node8->Node11 + + + + + +Node12 + + +std::inner_product + + + + + +Node8->Node12 + + + + + +Node13->Node2 + + + + + +Node13->Node5 + + + + + +Node13->Node8 + + + + + +Node14 + + +std::rand + + + + + +Node13->Node14 + + + + + +Node15->Node2 + + + + + +Node15->Node5 + + + + + +Node15->Node8 + + + + + +Node15->Node14 + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map new file mode 100644 index 000000000..36b9c80fa --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 new file mode 100644 index 000000000..d1eb81bf0 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.md5 @@ -0,0 +1 @@ +75b4ea7b8a6baaa087a653221e9b3676 \ No newline at end of file diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg new file mode 100644 index 000000000..6a5fd561c --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph.svg @@ -0,0 +1,271 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::adaline::fit + + + + + +Node1->Node3 + + + + + +Node6 + + +machine_learning::adaline +::predict + + + + + +Node1->Node6 + + + + + +Node4 + + +machine_learning::adaline +::check_size_match + + + + + +Node3->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node3->Node5 + + + + + +Node3->Node6 + + + + + +Node4->Node2 + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node7 + + +std::vector::back + + + + + +Node6->Node7 + + + + + +Node8 + + +std::vector::begin + + + + + +Node6->Node8 + + + + + +Node9 + + +std::vector::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::inner_product + + + + + +Node6->Node10 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg new file mode 100644 index 000000000..20bb168c4 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a52053d88ea1bcbbed9aca67ab4eeb499_cgraph_org.svg @@ -0,0 +1,183 @@ + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::adaline::fit + + + + + +Node1->Node3 + + + + + +Node6 + + +machine_learning::adaline +::predict + + + + + +Node1->Node6 + + + + + +Node4 + + +machine_learning::adaline +::check_size_match + + + + + +Node3->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node3->Node5 + + + + + +Node3->Node6 + + + + + +Node4->Node2 + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node7 + + +std::vector::back + + + + + +Node6->Node7 + + + + + +Node8 + + +std::vector::begin + + + + + +Node6->Node8 + + + + + +Node9 + + +std::vector::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::inner_product + + + + + +Node6->Node10 + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map new file mode 100644 index 000000000..75584488c --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.map @@ -0,0 +1,13 @@ + + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 new file mode 100644 index 000000000..f0a16af9d --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.md5 @@ -0,0 +1 @@ +f99ca4112f36532975fad1fb18a1867f \ No newline at end of file diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg new file mode 100644 index 000000000..b608d4cbb --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph.svg @@ -0,0 +1,286 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test3 + + + +Node1 + + +test3 + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::adaline::fit + + + + + +Node1->Node3 + + + + + +Node6 + + +machine_learning::adaline +::predict + + + + + +Node1->Node6 + + + + + +Node11 + + +std::rand + + + + + +Node1->Node11 + + + + + +Node4 + + +machine_learning::adaline +::check_size_match + + + + + +Node3->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node3->Node5 + + + + + +Node3->Node6 + + + + + +Node4->Node2 + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node7 + + +std::vector::back + + + + + +Node6->Node7 + + + + + +Node8 + + +std::vector::begin + + + + + +Node6->Node8 + + + + + +Node9 + + +std::vector::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::inner_product + + + + + +Node6->Node10 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg new file mode 100644 index 000000000..2a70b6c52 --- /dev/null +++ b/d5/db0/adaline__learning_8cpp_a992bdf1fdb0b9d414bcf7981d2d87aa9_cgraph_org.svg @@ -0,0 +1,198 @@ + + + + + + +test3 + + + +Node1 + + +test3 + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::adaline::fit + + + + + +Node1->Node3 + + + + + +Node6 + + +machine_learning::adaline +::predict + + + + + +Node1->Node6 + + + + + +Node11 + + +std::rand + + + + + +Node1->Node11 + + + + + +Node4 + + +machine_learning::adaline +::check_size_match + + + + + +Node3->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node3->Node5 + + + + + +Node3->Node6 + + + + + +Node4->Node2 + + + + + +Node4->Node5 + + + + + +Node6->Node4 + + + + + +Node7 + + +std::vector::back + + + + + +Node6->Node7 + + + + + +Node8 + + +std::vector::begin + + + + + +Node6->Node8 + + + + + +Node9 + + +std::vector::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::inner_product + + + + + +Node6->Node10 + + + + + diff --git a/d5/dc2/structlca-members.html b/d5/dc2/structlca-members.html new file mode 100644 index 000000000..e8f0616a7 --- /dev/null +++ b/d5/dc2/structlca-members.html @@ -0,0 +1,120 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
lca Member List
+
+
+ +

This is the complete list of members for lca, including all inherited members.

+ + + + + + + + + + +
adj (defined in lca)lca
build() (defined in lca)lcainline
dfs(int node, int par) (defined in lca)lcainline
lca(int n_) (defined in lca)lcainline
level (defined in lca)lca
n (defined in lca)lca
query(int u, int v) (defined in lca)lcainline
up (defined in lca)lca
verify() (defined in lca)lcainline
+
+ + + + diff --git a/d5/dca/vector__important__functions_8cpp__incl.map b/d5/dca/vector__important__functions_8cpp__incl.map new file mode 100644 index 000000000..1e77843b9 --- /dev/null +++ b/d5/dca/vector__important__functions_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d5/dca/vector__important__functions_8cpp__incl.md5 b/d5/dca/vector__important__functions_8cpp__incl.md5 new file mode 100644 index 000000000..5cb3d86f5 --- /dev/null +++ b/d5/dca/vector__important__functions_8cpp__incl.md5 @@ -0,0 +1 @@ +1a36f892a12a3814bd6e00b0a3cb3fbb \ No newline at end of file diff --git a/d5/dca/vector__important__functions_8cpp__incl.svg b/d5/dca/vector__important__functions_8cpp__incl.svg new file mode 100644 index 000000000..6430a9724 --- /dev/null +++ b/d5/dca/vector__important__functions_8cpp__incl.svg @@ -0,0 +1,83 @@ + + + + + + +others/vector_important_functions.cpp + + + +Node1 + + +others/vector_important +_functions.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +numeric + + + + + +Node1->Node4 + + + + + +Node5 + + +vector + + + + + +Node1->Node5 + + + + + diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl.map b/d5/dcd/kohonen__som__topology_8cpp__incl.map new file mode 100644 index 000000000..484f33a8b --- /dev/null +++ b/d5/dcd/kohonen__som__topology_8cpp__incl.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl.md5 b/d5/dcd/kohonen__som__topology_8cpp__incl.md5 new file mode 100644 index 000000000..9f72bd49d --- /dev/null +++ b/d5/dcd/kohonen__som__topology_8cpp__incl.md5 @@ -0,0 +1 @@ +67a3c667ee0103bb03c5d5c8cdf3b1e5 \ No newline at end of file diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl.svg b/d5/dcd/kohonen__som__topology_8cpp__incl.svg new file mode 100644 index 000000000..a416991a4 --- /dev/null +++ b/d5/dcd/kohonen__som__topology_8cpp__incl.svg @@ -0,0 +1,231 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +machine_learning/kohonen_som_topology.cpp + + + +Node1 + + +machine_learning/kohonen +_som_topology.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +cstdlib + + + + + +Node1->Node4 + + + + + +Node5 + + +ctime + + + + + +Node1->Node5 + + + + + +Node6 + + +fstream + + + + + +Node1->Node6 + + + + + +Node7 + + +iostream + + + + + +Node1->Node7 + + + + + +Node8 + + +valarray + + + + + +Node1->Node8 + + + + + +Node9 + + +vector + + + + + +Node1->Node9 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg new file mode 100644 index 000000000..99ef94113 --- /dev/null +++ b/d5/dcd/kohonen__som__topology_8cpp__incl_org.svg @@ -0,0 +1,143 @@ + + + + + + +machine_learning/kohonen_som_topology.cpp + + + +Node1 + + +machine_learning/kohonen +_som_topology.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +cstdlib + + + + + +Node1->Node4 + + + + + +Node5 + + +ctime + + + + + +Node1->Node5 + + + + + +Node6 + + +fstream + + + + + +Node1->Node6 + + + + + +Node7 + + +iostream + + + + + +Node1->Node7 + + + + + +Node8 + + +valarray + + + + + +Node1->Node8 + + + + + +Node9 + + +vector + + + + + +Node1->Node9 + + + + + diff --git a/d5/ddf/struct_btree-members.html b/d5/ddf/struct_btree-members.html new file mode 100644 index 000000000..2734080bd --- /dev/null +++ b/d5/ddf/struct_btree-members.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Btree Member List
+
+
+ +

This is the complete list of members for Btree, including all inherited members.

+ + + + +
data (defined in Btree)Btree
left (defined in Btree)Btree
right (defined in Btree)Btree
+
+ + + + diff --git a/d5/de2/structtower-members.html b/d5/de2/structtower-members.html new file mode 100644 index 000000000..6917a8e4b --- /dev/null +++ b/d5/de2/structtower-members.html @@ -0,0 +1,113 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
tower Member List
+
+
+ +

This is the complete list of members for tower, including all inherited members.

+ + + +
toptower
valuestower
+
+ + + + diff --git a/d5/def/stairs__pattern_8cpp.html b/d5/def/stairs__pattern_8cpp.html new file mode 100644 index 000000000..896f8117d --- /dev/null +++ b/d5/def/stairs__pattern_8cpp.html @@ -0,0 +1,185 @@ + + + + + + + +Algorithms_in_C++: others/stairs_pattern.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
stairs_pattern.cpp File Reference
+
+
+ +

This program is use to print the following pattern. +More...

+
#include <iostream>
+
+Include dependency graph for stairs_pattern.cpp:
+
+
+
+
+
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

This program is use to print the following pattern.

+
+   \*\*
+   \*\*
+  \*\*\*\*
+  \*\*\*\*
+ \*\*\*\*\*\*
+ \*\*\*\*\*\*
+\*\*\*\*\*\*\*\*
+        

where number of pairs line is given by user

+

Function Documentation

+ +

◆ main()

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

main function

+
17  {
+
18  int l, st = 2, x, r, z, n, sp;
+
19  std::cout << "enter Index ";
+
20  std::cin >> x;
+
21  z = x;
+
22  for (r = 1; r <= x; r++) {
+
23  z = z - 1;
+
24  for (n = 1; n <= 2; n++) {
+
25  for (sp = 1; sp <= z; sp++) {
+
26  std::cout << " ";
+
27  }
+
28  for (l = 1; l <= st; l++) {
+
29  std::cout << "*";
+
30  }
+ +
32  }
+
33  st = st + 2;
+
34  }
+
35 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T endl(T... args)
+ + + + + diff --git a/d5/def/stairs__pattern_8cpp.js b/d5/def/stairs__pattern_8cpp.js new file mode 100644 index 000000000..963537eac --- /dev/null +++ b/d5/def/stairs__pattern_8cpp.js @@ -0,0 +1,4 @@ +var stairs__pattern_8cpp = +[ + [ "main", "d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..6da7ad474 --- /dev/null +++ b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..86a68ba5f --- /dev/null +++ b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +7b66b13cd9e906646a781de5e20f13d9 \ No newline at end of file diff --git a/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..01ecc6aea --- /dev/null +++ b/d5/def/stairs__pattern_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d6/d1d/bubble__sort_8cpp__incl.map b/d6/d1d/bubble__sort_8cpp__incl.map new file mode 100644 index 000000000..ac3f1fb38 --- /dev/null +++ b/d6/d1d/bubble__sort_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d6/d1d/bubble__sort_8cpp__incl.md5 b/d6/d1d/bubble__sort_8cpp__incl.md5 new file mode 100644 index 000000000..5f765f3d2 --- /dev/null +++ b/d6/d1d/bubble__sort_8cpp__incl.md5 @@ -0,0 +1 @@ +46c7b538076e2baa5479f627961925d9 \ No newline at end of file diff --git a/d6/d1d/bubble__sort_8cpp__incl.svg b/d6/d1d/bubble__sort_8cpp__incl.svg new file mode 100644 index 000000000..afefb3323 --- /dev/null +++ b/d6/d1d/bubble__sort_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +sorting/bubble_sort.cpp + + + +Node1 + + +sorting/bubble_sort.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline.html b/d6/d30/classmachine__learning_1_1adaline.html new file mode 100644 index 000000000..df7489d9b --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline.html @@ -0,0 +1,558 @@ + + + + + + + +Algorithms_in_C++: machine_learning::adaline Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
machine_learning::adaline Class Reference
+
+
+
+Collaboration diagram for machine_learning::adaline:
+
+
+
+
[legend]
+ + + + + + + + + + + + + +

+Public Member Functions

 adaline (int num_features, const double eta=0.01f, const double accuracy=1e-5)
 
int predict (const std::vector< double > &x, double *out=nullptr)
 
double fit (const std::vector< double > &x, const int &y)
 
template<int N>
void fit (std::vector< double > const (&X)[N], const int *y)
 
+int activation (double x)
 
+ + + +

+Private Member Functions

bool check_size_match (const std::vector< double > &x)
 
+ + + + + + + + + + +

+Private Attributes

+const double eta
 learning rate of the algorithm
 
+const double accuracy
 model fit convergence accuracy
 
+std::vector< double > weights
 weights of the neural network
 
+ + + +

+Friends

std::ostreamoperator<< (std::ostream &out, const adaline &ada)
 
+

Constructor & Destructor Documentation

+ +

◆ adaline()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
machine_learning::adaline::adaline (int num_features,
const double eta = 0.01f,
const double accuracy = 1e-5 
)
+
+inline
+
+

Default constructor

Parameters
+ + + + +
[in]num_featuresnumber of features present
[in]etalearning rate (optional, default=0.1)
[in]convergenceaccuracy (optional, default= \(1\times10^{-5}\))
+
+
+
53  : eta(eta), accuracy(accuracy) {
+
54  if (eta <= 0) {
+
55  std::cerr << "learning rate should be positive and nonzero"
+
56  << std::endl;
+
57  std::exit(EXIT_FAILURE);
+
58  }
+
59 
+ +
61  num_features +
+
62  1); // additional weight is for the constant bias term
+
63 
+
64  // initialize with random weights in the range [-50, 49]
+
65  for (int i = 0; i < weights.size(); i++) weights[i] = 1.f;
+
66  // weights[i] = (static_cast<double>(std::rand() % 100) - 50);
+
67  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+

Member Function Documentation

+ +

◆ check_size_match()

+ +
+
+ + + + + +
+ + + + + + + + +
bool machine_learning::adaline::check_size_match (const std::vector< double > & x)
+
+inlineprivate
+
+

convenient function to check if input feature vector size matches the model weights size

Parameters
+ + +
[in]xfecture vector to check
+
+
+
Returns
true size matches
+
+false size does not match
+
174  {
+
175  if (x.size() != (weights.size() - 1)) {
+
176  std::cerr << __func__ << ": "
+
177  << "Number of features in x does not match the feature "
+
178  "dimension in model!"
+
179  << std::endl;
+
180  return false;
+
181  }
+
182  return true;
+
183  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ fit() [1/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
double machine_learning::adaline::fit (const std::vector< double > & x,
const int & y 
)
+
+inline
+
+

Update the weights of the model using supervised learning for one feature vector

Parameters
+ + + +
[in]xfeature vector
[in]yknown output value
+
+
+
Returns
correction factor
+
110  {
+
111  if (!check_size_match(x))
+
112  return 0;
+
113 
+
114  /* output of the model with current weights */
+
115  int p = predict(x);
+
116  int prediction_error = y - p; // error in estimation
+
117  double correction_factor = eta * prediction_error;
+
118 
+
119  /* update each weight, the last weight is the bias term */
+
120  for (int i = 0; i < x.size(); i++) {
+
121  weights[i] += correction_factor * x[i];
+
122  }
+
123  weights[x.size()] += correction_factor; // update bias
+
124 
+
125  return correction_factor;
+
126  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ fit() [2/2]

+ +
+
+
+template<int N>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void machine_learning::adaline::fit (std::vector< double > const (&) X[N],
const int * y 
)
+
+inline
+
+

Update the weights of the model using supervised learning for an array of vectors.

Parameters
+ + + +
[in]Xarray of feature vector
[in]yknown output value for each feature vector
+
+
+
134  {
+
135  double avg_pred_error = 1.f;
+
136 
+
137  int iter;
+
138  for (iter = 0; (iter < MAX_ITER) && (avg_pred_error > accuracy);
+
139  iter++) {
+
140  avg_pred_error = 0.f;
+
141 
+
142  // perform fit for each sample
+
143  for (int i = 0; i < N; i++) {
+
144  double err = fit(X[i], y[i]);
+
145  avg_pred_error += std::abs(err);
+
146  }
+
147  avg_pred_error /= N;
+
148 
+
149  // Print updates every 200th iteration
+
150  // if (iter % 100 == 0)
+
151  std::cout << "\tIter " << iter << ": Training weights: " << *this
+
152  << "\tAvg error: " << avg_pred_error << std::endl;
+
153  }
+
154 
+
155  if (iter < MAX_ITER)
+
156 
+
157  std::cout << "Converged after " << iter << " iterations."
+
158  << std::endl;
+
159  else
+
160  std::cout << "Did not converge after " << iter << " iterations."
+
161  << std::endl;
+
162  }
+
+
+
+ +

◆ predict()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
int machine_learning::adaline::predict (const std::vector< double > & x,
double * out = nullptr 
)
+
+inline
+
+

predict the output of the model for given set of features

Parameters
+ + + +
[in]xinput vector
[out]outoptional argument to return neuron output before applying activation function (optional, nullptr to ignore)
+
+
+
Returns
model prediction output
+
90  {
+
91  if (!check_size_match(x))
+
92  return 0;
+
93 
+
94  double y = weights.back(); // assign bias value
+
95 
+
96  // for (int i = 0; i < x.size(); i++) y += x[i] * weights[i];
+
97  y = std::inner_product(x.begin(), x.end(), weights.begin(), y);
+
98 
+
99  if (out != nullptr) // if out variable is provided
+
100  *out = y;
+
101 
+
102  return activation(y); // quantizer: apply ADALINE threshold function
+
103  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+

Friends And Related Function Documentation

+ +

◆ operator<<

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
std::ostream& operator<< (std::ostreamout,
const adalineada 
)
+
+friend
+
+

Operator to print the weights of the model

+
72  {
+
73  out << "<";
+
74  for (int i = 0; i < ada.weights.size(); i++) {
+
75  out << ada.weights[i];
+
76  if (i < ada.weights.size() - 1)
+
77  out << ", ";
+
78  }
+
79  out << ">";
+
80  return out;
+
81  }
+
+
+
+
The documentation for this class was generated from the following file: +
+
+
T inner_product(T... args)
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+ +
T size(T... args)
+
double fit(const std::vector< double > &x, const int &y)
Definition: adaline_learning.cpp:110
+
T back(T... args)
+
int predict(const std::vector< double > &x, double *out=nullptr)
Definition: adaline_learning.cpp:90
+
bool check_size_match(const std::vector< double > &x)
Definition: adaline_learning.cpp:174
+ +
const double eta
learning rate of the algorithm
Definition: adaline_learning.cpp:185
+
std::vector< double > weights
weights of the neural network
Definition: adaline_learning.cpp:187
+
T endl(T... args)
+
T begin(T... args)
+
T end(T... args)
+
const double accuracy
model fit convergence accuracy
Definition: adaline_learning.cpp:186
+
T exit(T... args)
+ + + + diff --git a/d6/d30/classmachine__learning_1_1adaline.js b/d6/d30/classmachine__learning_1_1adaline.js new file mode 100644 index 000000000..13fddc755 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline.js @@ -0,0 +1,13 @@ +var classmachine__learning_1_1adaline = +[ + [ "adaline", "d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c", null ], + [ "activation", "d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325", null ], + [ "check_size_match", "d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56", null ], + [ "fit", "d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5", null ], + [ "fit", "d6/d30/classmachine__learning_1_1adaline.html#a9f1c7cd34252a9ece5bbe7ba36799044", null ], + [ "predict", "d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3", null ], + [ "operator<<", "d6/d30/classmachine__learning_1_1adaline.html#a1d821a24e1503d468c95d4acedca58b3", null ], + [ "accuracy", "d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3", null ], + [ "eta", "d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda", null ], + [ "weights", "d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492", null ] +]; \ No newline at end of file diff --git a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map new file mode 100644 index 000000000..2b659170d --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5 new file mode 100644 index 000000000..fb7a85a56 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.md5 @@ -0,0 +1 @@ +48ac07b4b534689340efb3657b248b78 \ No newline at end of file diff --git a/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg new file mode 100644 index 000000000..ac0e14de0 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_a0acbe32aaab897e7939e5b0454035b8c_cgraph.svg @@ -0,0 +1,68 @@ + + + + + + +machine_learning::adaline::adaline + + + +Node1 + + +machine_learning::adaline +::adaline + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::exit + + + + + +Node1->Node3 + + + + + +Node4 + + +std::vector::size + + + + + +Node1->Node4 + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map new file mode 100644 index 000000000..4b82e5b85 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5 new file mode 100644 index 000000000..254889b5c --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.md5 @@ -0,0 +1 @@ +6eb9bb42f542e5e4e0d91d2673f3e103 \ No newline at end of file diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg new file mode 100644 index 000000000..ce7b9ceab --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph.svg @@ -0,0 +1,244 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +machine_learning::adaline::fit + + + +Node1 + + +machine_learning::adaline::fit + + + + + +Node2 + + +machine_learning::adaline +::check_size_match + + + + + +Node1->Node2 + + + + + +Node4 + + +std::vector::size + + + + + +Node1->Node4 + + + + + +Node5 + + +machine_learning::adaline +::predict + + + + + +Node1->Node5 + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + +Node2->Node4 + + + + + +Node5->Node2 + + + + + +Node6 + + +std::vector::back + + + + + +Node5->Node6 + + + + + +Node7 + + +std::vector::begin + + + + + +Node5->Node7 + + + + + +Node8 + + +std::vector::end + + + + + +Node5->Node8 + + + + + +Node9 + + +std::inner_product + + + + + +Node5->Node9 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg new file mode 100644 index 000000000..fd9f320ec --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_a74e3c6c037b67895014414c5d75465e5_cgraph_org.svg @@ -0,0 +1,156 @@ + + + + + + +machine_learning::adaline::fit + + + +Node1 + + +machine_learning::adaline::fit + + + + + +Node2 + + +machine_learning::adaline +::check_size_match + + + + + +Node1->Node2 + + + + + +Node4 + + +std::vector::size + + + + + +Node1->Node4 + + + + + +Node5 + + +machine_learning::adaline +::predict + + + + + +Node1->Node5 + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + +Node2->Node4 + + + + + +Node5->Node2 + + + + + +Node6 + + +std::vector::back + + + + + +Node5->Node6 + + + + + +Node7 + + +std::vector::begin + + + + + +Node5->Node7 + + + + + +Node8 + + +std::vector::end + + + + + +Node5->Node8 + + + + + +Node9 + + +std::inner_product + + + + + +Node5->Node9 + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map new file mode 100644 index 000000000..5a91d4c79 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 new file mode 100644 index 000000000..6b6a18c93 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.md5 @@ -0,0 +1 @@ +8db2fedc269fc8cbc0b217f6f0c65b67 \ No newline at end of file diff --git a/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg new file mode 100644 index 000000000..2c27d70b0 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_ab11242d9ad5b03a75911e29b04f78fd3_cgraph.svg @@ -0,0 +1,129 @@ + + + + + + +machine_learning::adaline::predict + + + +Node1 + + +machine_learning::adaline +::predict + + + + + +Node2 + + +std::vector::back + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::begin + + + + + +Node1->Node3 + + + + + +Node4 + + +machine_learning::adaline +::check_size_match + + + + + +Node1->Node4 + + + + + +Node7 + + +std::vector::end + + + + + +Node1->Node7 + + + + + +Node8 + + +std::inner_product + + + + + +Node1->Node8 + + + + + +Node5 + + +std::endl + + + + + +Node4->Node5 + + + + + +Node6 + + +std::vector::size + + + + + +Node4->Node6 + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map new file mode 100644 index 000000000..aa183e7f0 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 new file mode 100644 index 000000000..8a44e40e6 --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.md5 @@ -0,0 +1 @@ +6446f3f1dd1fd9a11b5e0e220cdbaffc \ No newline at end of file diff --git a/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg new file mode 100644 index 000000000..68b77b9ab --- /dev/null +++ b/d6/d30/classmachine__learning_1_1adaline_ac8a9c2aaaa63b0f27ea176857e1e7d56_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +machine_learning::adaline::check_size_match + + + +Node1 + + +machine_learning::adaline +::check_size_match + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::size + + + + + +Node1->Node3 + + + + + diff --git a/d6/d38/newton__raphson__method_8cpp__incl.map b/d6/d38/newton__raphson__method_8cpp__incl.map new file mode 100644 index 000000000..5e1261548 --- /dev/null +++ b/d6/d38/newton__raphson__method_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d6/d38/newton__raphson__method_8cpp__incl.md5 b/d6/d38/newton__raphson__method_8cpp__incl.md5 new file mode 100644 index 000000000..531735aea --- /dev/null +++ b/d6/d38/newton__raphson__method_8cpp__incl.md5 @@ -0,0 +1 @@ +b9a31984a7cfea3d2f70ff187a3eb6b1 \ No newline at end of file diff --git a/d6/d38/newton__raphson__method_8cpp__incl.svg b/d6/d38/newton__raphson__method_8cpp__incl.svg new file mode 100644 index 000000000..105f1eab1 --- /dev/null +++ b/d6/d38/newton__raphson__method_8cpp__incl.svg @@ -0,0 +1,83 @@ + + + + + + +numerical_methods/newton_raphson_method.cpp + + + +Node1 + + +numerical_methods/newton +_raphson_method.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +ctime + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +limits + + + + + +Node1->Node5 + + + + + diff --git a/d6/d48/structtrie-members.html b/d6/d48/structtrie-members.html new file mode 100644 index 000000000..e49fdf24c --- /dev/null +++ b/d6/d48/structtrie-members.html @@ -0,0 +1,113 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
trie Member List
+
+
+ +

This is the complete list of members for trie, including all inherited members.

+ + + +
arr (defined in trie)trie
isEndofWord (defined in trie)trie
+
+ + + + diff --git a/d6/d4a/addition__rule_8cpp.html b/d6/d4a/addition__rule_8cpp.html new file mode 100644 index 000000000..bc5dcb7b4 --- /dev/null +++ b/d6/d4a/addition__rule_8cpp.html @@ -0,0 +1,245 @@ + + + + + + + +Algorithms_in_C++: probability/addition_rule.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
addition_rule.cpp File Reference
+
+
+ +

Addition rule of probabilities. +More...

+
#include <iostream>
+
+Include dependency graph for addition_rule.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

double addition_rule_independent (double A, double B)
 
double addition_rule_dependent (double A, double B, double B_given_A)
 
int main ()
 
+

Detailed Description

+

Addition rule of probabilities.

+

Function Documentation

+ +

◆ addition_rule_dependent()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
double addition_rule_dependent (double A,
double B,
double B_given_A 
)
+
+

Calculates the probability of the events A or B for dependent events note that if value of B_given_A is unknown, use chainrule to find it \parama [in] A probability of event A \parama [in] B probability of event B \parama [in] B_given_A probability of event B condition A

Returns
probability of A and B
+
25  {
+
26  return (A + B) - (A * B_given_A);
+
27 }
+
+
+
+ +

◆ addition_rule_independent()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double addition_rule_independent (double A,
double B 
)
+
+

calculates the probability of the independent events A or B for independent events \parama [in] A probability of event A \parama [in] B probability of event B

Returns
probability of A and B
+
14  {
+
15  return (A + B) - (A * B);
+
16 }
+
+
+
+ +

◆ main()

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

Main function

+
30  {
+
31  double A = 0.5;
+
32  double B = 0.25;
+
33  double B_given_A = 0.05;
+
34 
+
35  std::cout << "independent P(A or B) = " << addition_rule_independent(A, B)
+
36  << std::endl;
+
37 
+
38  std::cout << "dependent P(A or B) = "
+
39  << addition_rule_dependent(A, B, B_given_A) << std::endl;
+
40 
+
41  return 0;
+
42 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
double addition_rule_dependent(double A, double B, double B_given_A)
Definition: addition_rule.cpp:25
+ +
T endl(T... args)
+
double addition_rule_independent(double A, double B)
Definition: addition_rule.cpp:14
+ + + + diff --git a/d6/d4a/addition__rule_8cpp.js b/d6/d4a/addition__rule_8cpp.js new file mode 100644 index 000000000..039c05aea --- /dev/null +++ b/d6/d4a/addition__rule_8cpp.js @@ -0,0 +1,6 @@ +var addition__rule_8cpp = +[ + [ "addition_rule_dependent", "d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0", null ], + [ "addition_rule_independent", "d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d", null ], + [ "main", "d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..64029fccc --- /dev/null +++ b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..abb5cdfd8 --- /dev/null +++ b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +70fde2597a9c89ac7fce0429aae12473 \ No newline at end of file diff --git a/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..065805981 --- /dev/null +++ b/d6/d4a/addition__rule_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +addition_rule_dependent + + + + + +Node1->Node2 + + + + + +Node3 + + +addition_rule_independent + + + + + +Node1->Node3 + + + + + +Node4 + + +std::endl + + + + + +Node1->Node4 + + + + + diff --git a/d6/d4c/gcd__recursive__euclidean_8cpp__incl.map b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.map new file mode 100644 index 000000000..81db51b57 --- /dev/null +++ b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d6/d4c/gcd__recursive__euclidean_8cpp__incl.md5 b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.md5 new file mode 100644 index 000000000..870f57181 --- /dev/null +++ b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.md5 @@ -0,0 +1 @@ +3143fa2df861ad609e353175d5bd4fe3 \ No newline at end of file diff --git a/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg new file mode 100644 index 000000000..54e25f0f6 --- /dev/null +++ b/d6/d4c/gcd__recursive__euclidean_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +math/gcd_recursive_euclidean.cpp + + + +Node1 + + +math/gcd_recursive +_euclidean.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d6/d60/group__ode.html b/d6/d60/group__ode.html new file mode 100644 index 000000000..391e8575f --- /dev/null +++ b/d6/d60/group__ode.html @@ -0,0 +1,659 @@ + + + + + + + +Algorithms_in_C++: Ordinary Differential Equations + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
Ordinary Differential Equations
+
+
+ + + + + + + + + + + + + + + + + + + + +

+Functions

void forward_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Compute next step approximation using the forward-Euler method. More...
 
double forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
 Compute approximation using the forward-Euler method in the given limits. More...
 
void midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Compute next step approximation using the midpoint-Euler method. More...
 
double midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
 Compute approximation using the midpoint-Euler method in the given limits. More...
 
void semi_implicit_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Compute next step approximation using the semi-implicit-Euler method. More...
 
double semi_implicit_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
 Compute approximation using the semi-implicit-Euler method in the given limits. More...
 
+

Detailed Description

+

Integration functions for implementations with solving ordinary differential equations (ODEs) of any order and and any number of independent variables.

+

Function Documentation

+ +

◆ forward_euler()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double forward_euler (double dx,
double x0,
double x_max,
std::valarray< double > * y,
bool save_to_file = false 
)
+
+ +

Compute approximation using the forward-Euler method in the given limits.

+
Parameters
+ + + + + + +
[in]dxstep size
[in]x0initial value of independent variable
[in]x_maxfinal value of independent variable
[in,out]ytake \(y_n\) and compute \(y_{n+1}\)
[in]save_to_fileflag to save results to a CSV file (1) or not (0)
+
+
+
Returns
time taken for computation in seconds
+
103  {
+
104  std::valarray<double> dy = y[0];
+
105 
+
106  std::ofstream fp;
+
107  if (save_to_file) {
+
108  fp.open("forward_euler.csv", std::ofstream::out);
+
109  if (!fp.is_open()) {
+
110  std::perror("Error! ");
+
111  }
+
112  }
+
113 
+
114  std::size_t L = y->size();
+
115 
+
116  /* start integration */
+
117  std::clock_t t1 = std::clock();
+
118  double x = x0;
+
119 
+
120  do { // iterate for each step of independent variable
+
121  if (save_to_file && fp.is_open()) {
+
122  // write to file
+
123  fp << x << ",";
+
124  for (int i = 0; i < L - 1; i++) {
+
125  fp << y[0][i] << ",";
+
126  }
+
127  fp << y[0][L - 1] << "\n";
+
128  }
+
129 
+
130  forward_euler_step(dx, x, y, &dy); // perform integration
+
131  x += dx; // update step
+
132  } while (x <= x_max); // till upper limit of independent variable
+
133  /* end of integration */
+
134  std::clock_t t2 = std::clock();
+
135 
+
136  if (fp.is_open())
+
137  fp.close();
+
138 
+
139  return static_cast<double>(t2 - t1) / CLOCKS_PER_SEC;
+
140 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ forward_euler_step()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void forward_euler_step (const double dx,
const double & x,
std::valarray< double > * y,
std::valarray< double > * dy 
)
+
+ +

Compute next step approximation using the forward-Euler method.

+

+\[y_{n+1}=y_n + dx\cdot f\left(x_n,y_n\right)\] +

+
Parameters
+ + + + + +
[in]dxstep size
[in]xtake \(x_n\) and compute \(x_{n+1}\)
[in,out]ytake \(y_n\) and compute \(y_{n+1}\)
[in,out]dycompute \(f\left(x_n,y_n\right)\)
+
+
+
87  {
+
88  problem(x, y, dy);
+
89  y[0] += dy[0] * dx;
+
90 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ midpoint_euler()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double midpoint_euler (double dx,
double x0,
double x_max,
std::valarray< double > * y,
bool save_to_file = false 
)
+
+ +

Compute approximation using the midpoint-Euler method in the given limits.

+
Parameters
+ + + + + + +
[in]dxstep size
[in]x0initial value of independent variable
[in]x_maxfinal value of independent variable
[in,out]ytake \(y_n\) and compute \(y_{n+1}\)
[in]save_to_fileflag to save results to a CSV file (1) or not (0)
+
+
+
Returns
time taken for computation in seconds
+
108  {
+
109  std::valarray<double> dy = y[0];
+
110 
+
111  std::ofstream fp;
+
112  if (save_to_file) {
+
113  fp.open("midpoint_euler.csv", std::ofstream::out);
+
114  if (!fp.is_open()) {
+
115  std::perror("Error! ");
+
116  }
+
117  }
+
118 
+
119  std::size_t L = y->size();
+
120 
+
121  /* start integration */
+
122  std::clock_t t1 = std::clock();
+
123  double x = x0;
+
124  do { // iterate for each step of independent variable
+
125  if (save_to_file && fp.is_open()) {
+
126  // write to file
+
127  fp << x << ",";
+
128  for (int i = 0; i < L - 1; i++) {
+
129  fp << y[0][i] << ",";
+
130  }
+
131  fp << y[0][L - 1] << "\n";
+
132  }
+
133 
+
134  midpoint_euler_step(dx, x, y, &dy); // perform integration
+
135  x += dx; // update step
+
136  } while (x <= x_max); // till upper limit of independent variable
+
137  /* end of integration */
+
138  std::clock_t t2 = std::clock();
+
139 
+
140  if (fp.is_open())
+
141  fp.close();
+
142 
+
143  return static_cast<double>(t2 - t1) / CLOCKS_PER_SEC;
+
144 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ midpoint_euler_step()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void midpoint_euler_step (const double dx,
const double & x,
std::valarray< double > * y,
std::valarray< double > * dy 
)
+
+ +

Compute next step approximation using the midpoint-Euler method.

+

+\[y_{n+1} = y_n + dx\, f\left(x_n+\frac{1}{2}dx, y_n + \frac{1}{2}dx\,f\left(x_n,y_n\right)\right)\] +

+
Parameters
+ + + + + +
[in]dxstep size
[in]xtake \(x_n\) and compute \(x_{n+1}\)
[in,out]ytake \(y_n\) and compute \(y_{n+1}\)
[in,out]dycompute \(f\left(x_n,y_n\right)\)
+
+
+
86  {
+
87  problem(x, y, dy);
+
88  double tmp_x = x + 0.5 * dx;
+
89 
+
90  std::valarray<double> tmp_y = y[0] + dy[0] * (0.5 * dx);
+
91 
+
92  problem(tmp_x, &tmp_y, dy);
+
93 
+
94  y[0] += dy[0] * dx;
+
95 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ semi_implicit_euler()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double semi_implicit_euler (double dx,
double x0,
double x_max,
std::valarray< double > * y,
bool save_to_file = false 
)
+
+ +

Compute approximation using the semi-implicit-Euler method in the given limits.

+
Parameters
+ + + + + + +
[in]dxstep size
[in]x0initial value of independent variable
[in]x_maxfinal value of independent variable
[in,out]ytake \(y_n\) and compute \(y_{n+1}\)
[in]save_to_fileflag to save results to a CSV file (1) or not (0)
+
+
+
Returns
time taken for computation in seconds
+
105  {
+
106  std::valarray<double> dy = y[0];
+
107 
+
108  std::ofstream fp;
+
109  if (save_to_file) {
+
110  fp.open("semi_implicit_euler.csv", std::ofstream::out);
+
111  if (!fp.is_open()) {
+
112  std::perror("Error! ");
+
113  }
+
114  }
+
115 
+
116  std::size_t L = y->size();
+
117 
+
118  /* start integration */
+
119  std::clock_t t1 = std::clock();
+
120  double x = x0;
+
121  do { // iterate for each step of independent variable
+
122  if (save_to_file && fp.is_open()) {
+
123  // write to file
+
124  fp << x << ",";
+
125  for (int i = 0; i < L - 1; i++) {
+
126  fp << y[0][i] << ",";
+
127  }
+
128  fp << y[0][L - 1] << "\n";
+
129  }
+
130 
+
131  semi_implicit_euler_step(dx, x, y, &dy); // perform integration
+
132  x += dx; // update step
+
133  } while (x <= x_max); // till upper limit of independent variable
+
134  /* end of integration */
+
135  std::clock_t t2 = std::clock();
+
136 
+
137  if (fp.is_open())
+
138  fp.close();
+
139 
+
140  return static_cast<double>(t2 - t1) / CLOCKS_PER_SEC;
+
141 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ semi_implicit_euler_step()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void semi_implicit_euler_step (const double dx,
const double & x,
std::valarray< double > * y,
std::valarray< double > * dy 
)
+
+ +

Compute next step approximation using the semi-implicit-Euler method.

+

+\[y_{n+1}=y_n + dx\cdot f\left(x_n,y_n\right)\] +

+
Parameters
+ + + + + +
[in]dxstep size
[in]xtake \(x_n\) and compute \(x_{n+1}\)
[in,out]ytake \(y_n\) and compute \(y_{n+1}\)
[in,out]dycompute \(f\left(x_n,y_n\right)\)
+
+
+
84  {
+
85  problem(x, y, dy); // update dy once
+
86  y[0][0] += dx * dy[0][0]; // update y0
+
87  problem(x, y, dy); // update dy once more
+
88 
+
89  dy[0][0] = 0.f; // ignore y0
+
90  y[0] += dy[0] * dx; // update remaining using new dy
+
91 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
void semi_implicit_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the semi-implicit-Euler method.
Definition: ode_semi_implicit_euler.cpp:82
+ +
void midpoint_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the midpoint-Euler method.
Definition: ode_midpoint_euler.cpp:85
+
void forward_euler_step(const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Compute next step approximation using the forward-Euler method.
Definition: ode_forward_euler.cpp:86
+
T clock(T... args)
+
STL class.
+
T close(T... args)
+
T perror(T... args)
+
STL class.
+
T open(T... args)
+
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_semi_implicit_euler.cpp:53
+
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_forward_euler.cpp:54
+
void problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy)
Problem statement for a system with first-order differential equations. Updates the system differenti...
Definition: ode_midpoint_euler.cpp:53
+ +
T is_open(T... args)
+ + + + diff --git a/d6/d60/group__ode.js b/d6/d60/group__ode.js new file mode 100644 index 000000000..afb003026 --- /dev/null +++ b/d6/d60/group__ode.js @@ -0,0 +1,9 @@ +var group__ode = +[ + [ "forward_euler", "d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9", null ], + [ "forward_euler_step", "d6/d60/group__ode.html#gaa197c6b7085ac9ea71abc4c063e6f52f", null ], + [ "midpoint_euler", "d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985", null ], + [ "midpoint_euler_step", "d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812", null ], + [ "semi_implicit_euler", "d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089", null ], + [ "semi_implicit_euler_step", "d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f", null ] +]; \ No newline at end of file diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map new file mode 100644 index 000000000..fcd0334b5 --- /dev/null +++ b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5 b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5 new file mode 100644 index 000000000..6e22ec1f4 --- /dev/null +++ b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.md5 @@ -0,0 +1 @@ +a248f6012e474f29ac195e140a8405e9 \ No newline at end of file diff --git a/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg new file mode 100644 index 000000000..b3de4f4ac --- /dev/null +++ b/d6/d60/group__ode_ga36ff0710861ca39d957046c0b09b2985_cgraph.svg @@ -0,0 +1,127 @@ + + + + + + +midpoint_euler + + + +Node1 + + +midpoint_euler + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::ofstream::close + + + + + +Node1->Node3 + + + + + +Node4 + + +std::ofstream::is_open + + + + + +Node1->Node4 + + + + + +Node5 + + +midpoint_euler_step + + + + + +Node1->Node5 + + + + + +Node7 + + +std::ofstream::open + + + + + +Node1->Node7 + + + + + +Node8 + + +std::perror + + + + + +Node1->Node8 + + + + + +Node6 + + +problem + + + + + +Node5->Node6 + + + + + diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map new file mode 100644 index 000000000..37cff0395 --- /dev/null +++ b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5 b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5 new file mode 100644 index 000000000..86cbff09a --- /dev/null +++ b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.md5 @@ -0,0 +1 @@ +c8b8ed3819f3d5229448adab5a475143 \ No newline at end of file diff --git a/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg new file mode 100644 index 000000000..3533609a6 --- /dev/null +++ b/d6/d60/group__ode_ga3874d294ab00fe9ce8731c5b7991a089_cgraph.svg @@ -0,0 +1,127 @@ + + + + + + +semi_implicit_euler + + + +Node1 + + +semi_implicit_euler + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::ofstream::close + + + + + +Node1->Node3 + + + + + +Node4 + + +std::ofstream::is_open + + + + + +Node1->Node4 + + + + + +Node5 + + +std::ofstream::open + + + + + +Node1->Node5 + + + + + +Node6 + + +std::perror + + + + + +Node1->Node6 + + + + + +Node7 + + +semi_implicit_euler_step + + + + + +Node1->Node7 + + + + + +Node8 + + +problem + + + + + +Node7->Node8 + + + + + diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map new file mode 100644 index 000000000..881a7d493 --- /dev/null +++ b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5 b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5 new file mode 100644 index 000000000..2b4d4cef5 --- /dev/null +++ b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.md5 @@ -0,0 +1 @@ +a153ca0757d2bcac00fb6a95102a1cad \ No newline at end of file diff --git a/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg new file mode 100644 index 000000000..ca857e17c --- /dev/null +++ b/d6/d60/group__ode_ga827bf009831ddc477c5fa8891d5cb35f_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +semi_implicit_euler_step + + + +Node1 + + +semi_implicit_euler_step + + + + + +Node2 + + +problem + + + + + +Node1->Node2 + + + + + diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map new file mode 100644 index 000000000..52add241d --- /dev/null +++ b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5 b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5 new file mode 100644 index 000000000..cc2d0da2b --- /dev/null +++ b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.md5 @@ -0,0 +1 @@ +52c5de426248663ee449e4e163707034 \ No newline at end of file diff --git a/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg new file mode 100644 index 000000000..9e2e57425 --- /dev/null +++ b/d6/d60/group__ode_ga8c319db420c3d97a83e9dcca803b6812_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +midpoint_euler_step + + + +Node1 + + +midpoint_euler_step + + + + + +Node2 + + +problem + + + + + +Node1->Node2 + + + + + diff --git a/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.map b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.map new file mode 100644 index 000000000..8afd162d8 --- /dev/null +++ b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5 b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5 new file mode 100644 index 000000000..b580420dc --- /dev/null +++ b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.md5 @@ -0,0 +1 @@ +cc0ffdf7d4a5a24834d33f3aff44f5e5 \ No newline at end of file diff --git a/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg new file mode 100644 index 000000000..2b21d0643 --- /dev/null +++ b/d6/d60/group__ode_gaa197c6b7085ac9ea71abc4c063e6f52f_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +forward_euler_step + + + +Node1 + + +forward_euler_step + + + + + +Node2 + + +problem + + + + + +Node1->Node2 + + + + + diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map new file mode 100644 index 000000000..122fee8d5 --- /dev/null +++ b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 new file mode 100644 index 000000000..7c2d1ef3c --- /dev/null +++ b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.md5 @@ -0,0 +1 @@ +ec156c3bc23a477627ca84fc592670e4 \ No newline at end of file diff --git a/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg new file mode 100644 index 000000000..e5b715b8a --- /dev/null +++ b/d6/d60/group__ode_gae0509f8843e2bc42de2abbd00a14b7b9_cgraph.svg @@ -0,0 +1,127 @@ + + + + + + +forward_euler + + + +Node1 + + +forward_euler + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::ofstream::close + + + + + +Node1->Node3 + + + + + +Node4 + + +forward_euler_step + + + + + +Node1->Node4 + + + + + +Node6 + + +std::ofstream::is_open + + + + + +Node1->Node6 + + + + + +Node7 + + +std::ofstream::open + + + + + +Node1->Node7 + + + + + +Node8 + + +std::perror + + + + + +Node1->Node8 + + + + + +Node5 + + +problem + + + + + +Node4->Node5 + + + + + diff --git a/d6/d93/large__number_8h__dep__incl.map b/d6/d93/large__number_8h__dep__incl.map new file mode 100644 index 000000000..6d8002ecf --- /dev/null +++ b/d6/d93/large__number_8h__dep__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d6/d93/large__number_8h__dep__incl.md5 b/d6/d93/large__number_8h__dep__incl.md5 new file mode 100644 index 000000000..3a4462d67 --- /dev/null +++ b/d6/d93/large__number_8h__dep__incl.md5 @@ -0,0 +1 @@ +dcd60cfec5046d70ce2d9c7b127f62e7 \ No newline at end of file diff --git a/d6/d93/large__number_8h__dep__incl.svg b/d6/d93/large__number_8h__dep__incl.svg new file mode 100644 index 000000000..6575c4f1d --- /dev/null +++ b/d6/d93/large__number_8h__dep__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/large_number.h + + + +Node1 + + +math/large_number.h + + + + + +Node2 + + +math/fibonacci_large.cpp + + + + + +Node1->Node2 + + + + + +Node3 + + +math/large_factorial.cpp + + + + + +Node1->Node3 + + + + + diff --git a/d6/d9d/large__factorial_8cpp.html b/d6/d9d/large__factorial_8cpp.html new file mode 100644 index 000000000..e77463312 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp.html @@ -0,0 +1,328 @@ + + + + + + + +Algorithms_in_C++: math/large_factorial.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
large_factorial.cpp File Reference
+
+
+ +

Compute factorial of any arbitratily large number/. +More...

+
#include <cstring>
+#include <ctime>
+#include <iostream>
+#include "./large_number.h"
+
+Include dependency graph for large_factorial.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

bool test1 ()
 
bool test2 ()
 
int main (int argc, char *argv[])
 
+

Detailed Description

+

Compute factorial of any arbitratily large number/.

+
Author
Krishna Vedala
+
See also
factorial.cpp
+

Function Documentation

+ +

◆ main()

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

Main program

+
89  {
+
90  int number, i;
+
91 
+
92  if (argc == 2) {
+
93  number = atoi(argv[1]);
+
94  } else {
+
95  std::cout << "Enter the value of n(n starts from 0 ): ";
+
96  std::cin >> number;
+
97  }
+
98 
+
99  large_number result;
+
100 
+
101  std::clock_t start_time = std::clock();
+
102  for (i = 2; i <= number; i++) /* Multiply every number from 2 thru N */
+
103  result *= i;
+
104  std::clock_t end_time = std::clock();
+
105  double time_taken =
+
106  static_cast<double>(end_time - start_time) / CLOCKS_PER_SEC;
+
107 
+
108  std::cout << number << "! = " << result << std::endl
+
109  << "Number of digits: " << result.num_digits() << std::endl
+
110  << "Time taken: " << std::scientific << time_taken << " s"
+
111  << std::endl;
+
112 
+
113  test1();
+
114  test2();
+
115  result.test();
+
116 
+
117  return 0;
+
118 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test1()

+ +
+
+ + + + + + + +
bool test1 ()
+
+

Test implementation for 10! Result must be 3628800.

Returns
True if test pass else False
+
17  {
+
18  std::cout << "---- Check 1\t";
+
19  unsigned int i, number = 10;
+
20  large_number result;
+
21  for (i = 2; i <= number; i++) /* Multiply every number from 2 thru N */
+
22  result *= i;
+
23 
+
24  const char *known_reslt = "3628800";
+
25 
+
26  /* check 1 */
+
27  if (strlen(known_reslt) != result.num_digits()) {
+
28  std::cerr << "Result lengths dont match! " << strlen(known_reslt)
+
29  << " != " << result.num_digits() << std::endl;
+
30  return false;
+
31  }
+
32 
+
33  const size_t N = result.num_digits();
+
34  for (i = 0; i < N; i++) {
+
35  if (known_reslt[i] != result.digit_char(i)) {
+
36  std::cerr << i << "^th digit mismatch! " << known_reslt[i]
+
37  << " != " << result.digit_char(i) << std::endl;
+
38  return false;
+
39  }
+
40  }
+
41 
+
42  std::cout << "Passed!" << std::endl;
+
43  return true;
+
44 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test2()

+ +
+
+ + + + + + + +
bool test2 ()
+
+

Test implementation for 100! The result is the 156 digit number:

9332621544394415268169923885626670049071596826438162146859296389521759
+
9993229915608941463976156518286253697920827223758251185210916864000000
+
000000000000000000
+
Returns
True if test pass else False
+
54  {
+
55  std::cout << "---- Check 2\t";
+
56  unsigned int i, number = 100;
+
57  large_number result;
+
58  for (i = 2; i <= number; i++) /* Multiply every number from 2 thru N */
+
59  result *= i;
+
60 
+
61  const char *known_reslt =
+
62  "9332621544394415268169923885626670049071596826438162146859296389521759"
+
63  "9993229915608941463976156518286253697920827223758251185210916864000000"
+
64  "000000000000000000";
+
65 
+
66  /* check 1 */
+
67  if (strlen(known_reslt) != result.num_digits()) {
+
68  std::cerr << "Result lengths dont match! " << strlen(known_reslt)
+
69  << " != " << result.num_digits() << std::endl;
+
70  return false;
+
71  }
+
72 
+
73  const size_t N = result.num_digits();
+
74  for (i = 0; i < N; i++) {
+
75  if (known_reslt[i] != result.digit_char(i)) {
+
76  std::cerr << i << "^th digit mismatch! " << known_reslt[i]
+
77  << " != " << result.digit_char(i) << std::endl;
+
78  return false;
+
79  }
+
80  }
+
81 
+
82  std::cout << "Passed!" << std::endl;
+
83  return true;
+
84 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T strlen(T... args)
+
bool test1()
Definition: large_factorial.cpp:17
+ +
Definition: large_number.h:24
+
const char digit_char(size_t i) const
Definition: large_number.h:248
+
const size_t num_digits() const
Definition: large_number.h:130
+
T clock(T... args)
+ +
T atoi(T... args)
+
bool test2()
Definition: large_factorial.cpp:54
+
static bool test()
Definition: large_number.h:65
+
T endl(T... args)
+
T scientific(T... args)
+ + + + + diff --git a/d6/d9d/large__factorial_8cpp.js b/d6/d9d/large__factorial_8cpp.js new file mode 100644 index 000000000..41477b057 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp.js @@ -0,0 +1,6 @@ +var large__factorial_8cpp = +[ + [ "main", "d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "test1", "d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8", null ], + [ "test2", "d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa", null ] +]; \ No newline at end of file diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map new file mode 100644 index 000000000..fe4765cd5 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map @@ -0,0 +1,14 @@ + + + + + + + + + + + + + + diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 new file mode 100644 index 000000000..80f066ff3 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 @@ -0,0 +1 @@ +429968bbb93801a3d9a43513416807e5 \ No newline at end of file diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg new file mode 100644 index 000000000..39dcfc561 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -0,0 +1,318 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node4 + + +large_number::num_digits + + + + + +Node1->Node4 + + + + + +Node6 + + +std::scientific + + + + + +Node1->Node6 + + + + + +Node7 + + +large_number::test + + + + + +Node1->Node7 + + + + + +Node10 + + +test1 + + + + + +Node1->Node10 + + + + + +Node12 + + +test2 + + + + + +Node1->Node12 + + + + + +Node5 + + +std::vector::size + + + + + +Node4->Node5 + + + + + +Node7->Node3 + + + + + +Node8 + + +large_number::large +_number + + + + + +Node7->Node8 + + + + + +Node9 + + +std::vector::push_back + + + + + +Node8->Node9 + + + + + +Node10->Node3 + + + + + +Node10->Node4 + + + + + +Node11 + + +large_number::digit_char + + + + + +Node10->Node11 + + + + + +Node11->Node4 + + + + + +Node12->Node3 + + + + + +Node12->Node4 + + + + + +Node12->Node11 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg new file mode 100644 index 000000000..6ab613552 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg @@ -0,0 +1,230 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node4 + + +large_number::num_digits + + + + + +Node1->Node4 + + + + + +Node6 + + +std::scientific + + + + + +Node1->Node6 + + + + + +Node7 + + +large_number::test + + + + + +Node1->Node7 + + + + + +Node10 + + +test1 + + + + + +Node1->Node10 + + + + + +Node12 + + +test2 + + + + + +Node1->Node12 + + + + + +Node5 + + +std::vector::size + + + + + +Node4->Node5 + + + + + +Node7->Node3 + + + + + +Node8 + + +large_number::large +_number + + + + + +Node7->Node8 + + + + + +Node9 + + +std::vector::push_back + + + + + +Node8->Node9 + + + + + +Node10->Node3 + + + + + +Node10->Node4 + + + + + +Node11 + + +large_number::digit_char + + + + + +Node10->Node11 + + + + + +Node11->Node4 + + + + + +Node12->Node3 + + + + + +Node12->Node4 + + + + + +Node12->Node11 + + + + + diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map new file mode 100644 index 000000000..c570ae9c6 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5 new file mode 100644 index 000000000..66098fec5 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.md5 @@ -0,0 +1 @@ +291b8e868fe6c68650d9a09586069020 \ No newline at end of file diff --git a/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg new file mode 100644 index 000000000..0e0c576fe --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a3f93b60e229b6683e24c4754a7106ee8_cgraph.svg @@ -0,0 +1,88 @@ + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +large_number::digit_char + + + + + +Node1->Node2 + + + + + +Node3 + + +large_number::num_digits + + + + + +Node1->Node3 + + + + + +Node5 + + +std::endl + + + + + +Node1->Node5 + + + + + +Node2->Node3 + + + + + +Node4 + + +std::vector::size + + + + + +Node3->Node4 + + + + + diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map new file mode 100644 index 000000000..a5a98fb45 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 new file mode 100644 index 000000000..295d1025e --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.md5 @@ -0,0 +1 @@ +5ad0332dba2cbed8d628f757cc670c56 \ No newline at end of file diff --git a/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg new file mode 100644 index 000000000..05bc5b4c6 --- /dev/null +++ b/d6/d9d/large__factorial_8cpp_a76aae4778fbe89a3d59fd61fbc050cfa_cgraph.svg @@ -0,0 +1,88 @@ + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +large_number::digit_char + + + + + +Node1->Node2 + + + + + +Node3 + + +large_number::num_digits + + + + + +Node1->Node3 + + + + + +Node5 + + +std::endl + + + + + +Node1->Node5 + + + + + +Node2->Node3 + + + + + +Node4 + + +std::vector::size + + + + + +Node3->Node4 + + + + + diff --git a/d6/db0/binomial__dist_8cpp.html b/d6/db0/binomial__dist_8cpp.html new file mode 100644 index 000000000..fada93b99 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp.html @@ -0,0 +1,468 @@ + + + + + + + +Algorithms_in_C++: probability/binomial_dist.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
binomial_dist.cpp File Reference
+
+
+ +

Binomial distribution example +More...

+
#include <cmath>
+#include <iostream>
+
+Include dependency graph for binomial_dist.cpp:
+
+
+
+
+
+ + + + + + + + + + + + + + + +

+Functions

double binomial_expected (double n, double p)
 
double binomial_variance (double n, double p)
 
double binomial_standard_deviation (double n, double p)
 
double nCr (double n, double r)
 
double binomial_x_successes (double n, double p, double x)
 
double binomial_range_successes (double n, double p, double lower_bound, double upper_bound)
 
int main ()
 
+

Detailed Description

+

Binomial distribution example

+

The binomial distribution models the number of successes in a sequence of n independent events

+

Summary of variables used:

    +
  • n : number of trials
  • +
  • p : probability of success
  • +
  • x : desired successes
  • +
+

Function Documentation

+ +

◆ binomial_expected()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double binomial_expected (double n,
double p 
)
+
+

finds the expected value of a binomial distribution

Parameters
+ + + +
[in]n
[in]p
+
+
+
Returns
\(\mu=np\)
+
22 { return n * p; }
+
+
+
+ +

◆ binomial_range_successes()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double binomial_range_successes (double n,
double p,
double lower_bound,
double upper_bound 
)
+
+

calculates the probability of a result within a range (inclusive, inclusive)

Returns
\(\displaystyle \left.P(n,p)\right|_{x_0}^{x_1} = \sum_{i=x_0}^{x_1} P(i) =\sum_{i=x_0}^{x_1} {n\choose i} p^i (1-p)^{n-i}\)
+
75  {
+
76  double probability = 0;
+
77  for (int i = lower_bound; i <= upper_bound; i++) {
+
78  probability += nCr(n, i) * std::pow(p, i) * std::pow(1 - p, n - i);
+
79  }
+
80  return probability;
+
81 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ binomial_standard_deviation()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double binomial_standard_deviation (double n,
double p 
)
+
+

finds the standard deviation of the binomial distribution

Parameters
+ + + +
[in]n
[in]p
+
+
+
Returns
\(\sigma = \sqrt{\sigma^2} = \sqrt{n\cdot p\cdot (1-p)}\)
+
36  {
+
37  return std::sqrt(binomial_variance(n, p));
+
38 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ binomial_variance()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double binomial_variance (double n,
double p 
)
+
+

finds the variance of the binomial distribution

Parameters
+ + + +
[in]n
[in]p
+
+
+
Returns
\(\sigma^2 = n\cdot p\cdot (1-p)\)
+
29 { return n * p * (1 - p); }
+
+
+
+ +

◆ binomial_x_successes()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
double binomial_x_successes (double n,
double p,
double x 
)
+
+

calculates the probability of exactly x successes

Returns
\(\displaystyle P(n,p,x) = {n\choose x} p^x (1-p)^{n-x}\)
+
65  {
+
66  return nCr(n, x) * std::pow(p, x) * std::pow(1 - p, n - x);
+
67 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

main function

+
84  {
+
85  std::cout << "expected value : " << binomial_expected(100, 0.5)
+
86  << std::endl;
+
87 
+
88  std::cout << "variance : " << binomial_variance(100, 0.5) << std::endl;
+
89 
+
90  std::cout << "standard deviation : "
+
91  << binomial_standard_deviation(100, 0.5) << std::endl;
+
92 
+
93  std::cout << "exactly 30 successes : " << binomial_x_successes(100, 0.5, 30)
+
94  << std::endl;
+
95 
+
96  std::cout << "45 or more successes : "
+
97  << binomial_range_successes(100, 0.5, 45, 100) << std::endl;
+
98 
+
99  return 0;
+
100 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ nCr()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double nCr (double n,
double r 
)
+
+

Computes n choose r

Parameters
+ + + +
[in]n
[in]r
+
+
+
Returns
\(\displaystyle {n\choose r} = \frac{n!}{r!(n-r)!} = \frac{n\times(n-1)\times(n-2)\times\cdots(n-r)}{r!} \)
+
47  {
+
48  double numerator = n;
+
49  double denominator = r;
+
50 
+
51  for (int i = n - 1; i >= ((n - r) + 1); i--) {
+
52  numerator *= i;
+
53  }
+
54 
+
55  for (int i = 1; i < r; i++) {
+
56  denominator *= i;
+
57  }
+
58 
+
59  return numerator / denominator;
+
60 }
+
+
+
+
+
+
T sqrt(T... args)
+ +
double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)
Definition: binomial_dist.cpp:74
+
double binomial_standard_deviation(double n, double p)
Definition: binomial_dist.cpp:36
+
double binomial_x_successes(double n, double p, double x)
Definition: binomial_dist.cpp:65
+
T upper_bound(T... args)
+
double binomial_expected(double n, double p)
Definition: binomial_dist.cpp:22
+
T endl(T... args)
+
double nCr(double n, double r)
Definition: binomial_dist.cpp:47
+
double binomial_variance(double n, double p)
Definition: binomial_dist.cpp:29
+
T pow(T... args)
+ + + + diff --git a/d6/db0/binomial__dist_8cpp.js b/d6/db0/binomial__dist_8cpp.js new file mode 100644 index 000000000..8b4b41366 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp.js @@ -0,0 +1,10 @@ +var binomial__dist_8cpp = +[ + [ "binomial_expected", "d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813", null ], + [ "binomial_range_successes", "d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25", null ], + [ "binomial_standard_deviation", "d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc", null ], + [ "binomial_variance", "d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861", null ], + [ "binomial_x_successes", "d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76", null ], + [ "main", "d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "nCr", "d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a", null ] +]; \ No newline at end of file diff --git a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map new file mode 100644 index 000000000..fefabdc25 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 new file mode 100644 index 000000000..4641dc853 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.md5 @@ -0,0 +1 @@ +e0cc18349496dd50d202156c80b67c0f \ No newline at end of file diff --git a/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg new file mode 100644 index 000000000..c948a6676 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_a19ae0a6a2bd200fd1eb0e31b2bf4cc76_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +binomial_x_successes + + + +Node1 + + +binomial_x_successes + + + + + +Node2 + + +nCr + + + + + +Node1->Node2 + + + + + +Node3 + + +std::pow + + + + + +Node1->Node3 + + + + + diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map new file mode 100644 index 000000000..15be69911 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5 b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5 new file mode 100644 index 000000000..868021649 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.md5 @@ -0,0 +1 @@ +dabea74f3b6141980067c46e44533798 \ No newline at end of file diff --git a/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg new file mode 100644 index 000000000..2a5127e60 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_a76ed6ce71415fb400b65f0656cef3d25_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +binomial_range_successes + + + +Node1 + + +binomial_range_successes + + + + + +Node2 + + +nCr + + + + + +Node1->Node2 + + + + + +Node3 + + +std::pow + + + + + +Node1->Node3 + + + + + diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..3d18f78b8 --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..769e6d02b --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +241176135fb2f4772775a627fcb843ed \ No newline at end of file diff --git a/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..23d63426d --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,175 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +binomial_expected + + + + + +Node1->Node2 + + + + + +Node3 + + +binomial_range_successes + + + + + +Node1->Node3 + + + + + +Node6 + + +binomial_standard_deviation + + + + + +Node1->Node6 + + + + + +Node7 + + +binomial_variance + + + + + +Node1->Node7 + + + + + +Node9 + + +binomial_x_successes + + + + + +Node1->Node9 + + + + + +Node10 + + +std::endl + + + + + +Node1->Node10 + + + + + +Node4 + + +nCr + + + + + +Node3->Node4 + + + + + +Node5 + + +std::pow + + + + + +Node3->Node5 + + + + + +Node6->Node7 + + + + + +Node8 + + +std::sqrt + + + + + +Node6->Node8 + + + + + +Node9->Node4 + + + + + +Node9->Node5 + + + + + diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map new file mode 100644 index 000000000..dd635b2df --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5 b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5 new file mode 100644 index 000000000..0849edb5c --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.md5 @@ -0,0 +1 @@ +55746bfa32fb1b0920a0b917aa81b1a4 \ No newline at end of file diff --git a/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg new file mode 100644 index 000000000..6734af72f --- /dev/null +++ b/d6/db0/binomial__dist_8cpp_af09e51f513cee647d41192ab0a872cdc_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +binomial_standard_deviation + + + +Node1 + + +binomial_standard_deviation + + + + + +Node2 + + +binomial_variance + + + + + +Node1->Node2 + + + + + +Node3 + + +std::sqrt + + + + + +Node1->Node3 + + + + + diff --git a/d6/db4/ode__semi__implicit__euler_8cpp__incl.map b/d6/db4/ode__semi__implicit__euler_8cpp__incl.map new file mode 100644 index 000000000..d6187b2c4 --- /dev/null +++ b/d6/db4/ode__semi__implicit__euler_8cpp__incl.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d6/db4/ode__semi__implicit__euler_8cpp__incl.md5 b/d6/db4/ode__semi__implicit__euler_8cpp__incl.md5 new file mode 100644 index 000000000..7d87b95c5 --- /dev/null +++ b/d6/db4/ode__semi__implicit__euler_8cpp__incl.md5 @@ -0,0 +1 @@ +0f917f6af8ca086e4a9ebac5f2c84f7c \ No newline at end of file diff --git a/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg b/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg new file mode 100644 index 000000000..56e2f68cd --- /dev/null +++ b/d6/db4/ode__semi__implicit__euler_8cpp__incl.svg @@ -0,0 +1,98 @@ + + + + + + +numerical_methods/ode_semi_implicit_euler.cpp + + + +Node1 + + +numerical_methods/ode +_semi_implicit_euler.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +ctime + + + + + +Node1->Node3 + + + + + +Node4 + + +fstream + + + + + +Node1->Node4 + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + +Node6 + + +valarray + + + + + +Node1->Node6 + + + + + diff --git a/d6/dbc/sparse__matrix_8cpp__incl.map b/d6/dbc/sparse__matrix_8cpp__incl.map new file mode 100644 index 000000000..dbc8d961e --- /dev/null +++ b/d6/dbc/sparse__matrix_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d6/dbc/sparse__matrix_8cpp__incl.md5 b/d6/dbc/sparse__matrix_8cpp__incl.md5 new file mode 100644 index 000000000..46c1fd3ac --- /dev/null +++ b/d6/dbc/sparse__matrix_8cpp__incl.md5 @@ -0,0 +1 @@ +a697780e187885f80c0ad3662deb53cd \ No newline at end of file diff --git a/d6/dbc/sparse__matrix_8cpp__incl.svg b/d6/dbc/sparse__matrix_8cpp__incl.svg new file mode 100644 index 000000000..a1d8d9d4f --- /dev/null +++ b/d6/dbc/sparse__matrix_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/sparse_matrix.cpp + + + +Node1 + + +others/sparse_matrix.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d6/dbd/jump__search_8cpp__incl.map b/d6/dbd/jump__search_8cpp__incl.map new file mode 100644 index 000000000..eff4eb05e --- /dev/null +++ b/d6/dbd/jump__search_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d6/dbd/jump__search_8cpp__incl.md5 b/d6/dbd/jump__search_8cpp__incl.md5 new file mode 100644 index 000000000..eed675e5a --- /dev/null +++ b/d6/dbd/jump__search_8cpp__incl.md5 @@ -0,0 +1 @@ +dde2efbf90aec32b749f0d88400e8ee1 \ No newline at end of file diff --git a/d6/dbd/jump__search_8cpp__incl.svg b/d6/dbd/jump__search_8cpp__incl.svg new file mode 100644 index 000000000..6af372952 --- /dev/null +++ b/d6/dbd/jump__search_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +search/jump_search.cpp + + + +Node1 + + +search/jump_search.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + diff --git a/d6/dc0/interpolation__search2_8cpp__incl.map b/d6/dc0/interpolation__search2_8cpp__incl.map new file mode 100644 index 000000000..256e36895 --- /dev/null +++ b/d6/dc0/interpolation__search2_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d6/dc0/interpolation__search2_8cpp__incl.md5 b/d6/dc0/interpolation__search2_8cpp__incl.md5 new file mode 100644 index 000000000..69fb8c659 --- /dev/null +++ b/d6/dc0/interpolation__search2_8cpp__incl.md5 @@ -0,0 +1 @@ +235c2a71c502fc4e41a01cc1ac9b3c97 \ No newline at end of file diff --git a/d6/dc0/interpolation__search2_8cpp__incl.svg b/d6/dc0/interpolation__search2_8cpp__incl.svg new file mode 100644 index 000000000..62ca0b2a8 --- /dev/null +++ b/d6/dc0/interpolation__search2_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +search/interpolation_search2.cpp + + + +Node1 + + +search/interpolation +_search2.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html new file mode 100644 index 000000000..cfa7dc8ce --- /dev/null +++ b/d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html @@ -0,0 +1,215 @@ + + + + + + + +Algorithms_in_C++: CONTRIBUTION GUIDELINES + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
CONTRIBUTION GUIDELINES
+
+
+

+Before contributing

+

Welcome to TheAlgorithms/C-Plus-Plus! Before submitting pull requests, please make sure that you have read the whole guidelines. If you have any doubts about this contribution guide, please open an issue and clearly state your concerns.

+

+Contributing

+

+Contributor

+

We are very happy that you consider implementing algorithms and data structures for others! This repository is referred to and used by learners from around the globe. Being one of our contributors, you agree and confirm that:

    +
  • You did your own work.
      +
    • No plagiarism allowed. Any plagiarized work will not be merged.
    • +
    +
  • +
  • Your work will be distributed under [MIT License](License) once your pull request has been merged.
  • +
  • You submitted work fulfils or mostly fulfils our styles and standards.
  • +
+

New implementation New implementation are welcome!

+

Improving comments and adding tests to existing algorithms are much appreciated.

+

Issues Please avoid opening issues asking to be "assigned” to a particular algorithm. This merely creates unnecessary noise for maintainers. Instead, please submit your implementation in a pull request and it will be evaluated by project maintainers.

+

+Making Changes

+

+Code

+
    +
  • Please use the directory structure of the repository.
  • +
  • File extension for code should be *.h *.cpp.
  • +
  • Don't use bits/stdc++.h because this is quite Linux specific and slows down the compilation process.
  • +
  • Avoid using struct and instead use the class keyword.
  • +
  • You can suggest reasonable changes to existing algorithms.
  • +
  • Strictly use snake_case (underscore_separated) in filenames.
  • +
  • If you have added or modified code, please make sure the code compiles before submitting.
  • +
  • Our automated testing runs cpplint on all pull requests so please be sure that your code passes before submitting.
  • +
  • Be consistent in use of these guidelines.
  • +
+

+New File Name guidelines

+
    +
  • Use lowercase words with "_" as separator
  • +
  • For instance
    MyNewCppClass.CPP is incorrect
    +
    my_new_cpp_class.cpp is correct format
    +
  • +
  • It will be used to dynamically create a directory of files and implementation.
  • +
  • File name validation will run on docker to ensure the validity.
  • +
+

+New Directory guidelines

+
    +
  • We recommend adding files to existing directories as much as possible.
  • +
  • Use lowercase words with "_" as separator ( no spaces or "-" allowed )
  • +
  • For instance
    SomeNew Fancy-Category is incorrect
    +
    some_new_fancy_category is correct
    +
  • +
  • Filepaths will be used to dynamically create a directory of our algorithms.
  • +
  • Filepath validation will run on GitHub Actions to ensure compliance.
  • +
+

+Commit Guidelines

+
    +
  • It is recommended to keep your changes grouped logically within individual commits. Maintainers find it easier to understand changes that are logically spilt across multiple commits. Try to modify just one or two files in the same directory. Pull requests that span multiple directories are often rejected.
    git add file_xyz.cpp
    +
    git commit -m "your message"
    +
  • +
+

Examples of commit messages with semantic prefixes:

fix: xyz algorithm bug
+
feat: add xyx algorithm, class xyz
+
test: add test for xyz algorithm
+
docs: add comments and explanation to xyz algorithm
+

Common prefixes:

    +
  • fix: A bug fix
  • +
  • feat: A new feature
  • +
  • docs: Documentation changes
  • +
  • test: Correct existing tests or add new ones
  • +
+

+Documentation

+
    +
  • Make sure you put useful comments in your code. Do not comment things that are obvious.
  • +
  • Please avoid creating new directories if at all possible. Try to fit your work into the existing directory structure. If you want to create a new directory, then please check if a similar category has been recently suggested or created by other pull requests.
  • +
  • If you have modified/added documentation, please ensure that your language is concise and contains no grammar errors.
  • +
  • Do not update README.md along with other changes, first create an issue and then link to that issue in your pull request to suggest specific changes required to README.md
  • +
+

+Test

+
    +
  • Make sure to add examples and test cases in your main() function.
  • +
  • If you find any algorithm or document without tests, please feel free to create a pull request or issue describing suggested changes.
  • +
+

+Pull Requests

+ +

+cpplint

+

To see if cpplint is already installed, do:

    +
  • cpplint --version # currently returns "cpplint 1.4.4" If cpplint is ___not___ installed then do:
  • +
  • python3 -m pip install cpplint # If that does not work then try...
  • +
  • py -m pip install cpplint # If that does not work then try...
  • +
  • pip install cpplint Once cpplint is installed, test your file(s) with:
  • +
  • cpplint --filter=-legal my_file.cpp my_other_file.cpp # Fix any issues and try again.
  • +
+

The clang-format tool can fix whitespace related cpplint issues.

    +
  • On Macs only: brew install clang-format # Only needs to be installed once.
  • +
  • All platforms: clang-format -i -style="{IndentWidth: 4}" my_file.cpp
  • +
+

Most importantly,

    +
  • Happy coding!
  • +
+
+
+
+ + + + diff --git a/d6/dce/rabin__karp_8cpp.html b/d6/dce/rabin__karp_8cpp.html new file mode 100644 index 000000000..f19b0b413 --- /dev/null +++ b/d6/dce/rabin__karp_8cpp.html @@ -0,0 +1,189 @@ + + + + + + + +Algorithms_in_C++: strings/rabin_karp.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
rabin_karp.cpp File Reference
+
+
+ +

The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m) +More...

+
#include <cassert>
+#include <cmath>
+#include <iostream>
+#include <cstring>
+
+Include dependency graph for rabin_karp.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 
+ + + + +

+Macros

+#define PRIME   5
 Prime modulus for hash functions.
 
+ + + + + + + + + + + +

+Functions

int64_t string_search::create_hash (const std::string &s, int n)
 
int64_t string_search::recalculate_hash (const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)
 
bool string_search::check_if_equal (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)
 
int string_search::rabin_karp (const std::string &str, const std::string &pat)
 
int main (void)
 
+

Detailed Description

+

The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m)

+

Function Documentation

+ +

◆ main()

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

Main function

+
105  {
+
106  assert(rabin_karp("helloWorld", "world") == -1);
+
107  assert(rabin_karp("helloWorld", "World") == 5);
+
108  assert(rabin_karp("this_is_c++", "c++") == 8);
+
109  assert(rabin_karp("happy_coding", "happy") == 0);
+
110  return 0;
+
111 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
int rabin_karp(const std::string &str, const std::string &pat)
Definition: rabin_karp.cpp:83
+ + + + diff --git a/d6/dce/rabin__karp_8cpp.js b/d6/dce/rabin__karp_8cpp.js new file mode 100644 index 000000000..70bb7a5fb --- /dev/null +++ b/d6/dce/rabin__karp_8cpp.js @@ -0,0 +1,9 @@ +var rabin__karp_8cpp = +[ + [ "PRIME", "d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8", null ], + [ "check_if_equal", "d6/dce/rabin__karp_8cpp.html#aebe07cea289a13142503d98be7df11fd", null ], + [ "create_hash", "d6/dce/rabin__karp_8cpp.html#a8fb0bc932ba8b582c9f4c71338d050f8", null ], + [ "main", "d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe", null ], + [ "rabin_karp", "d6/dce/rabin__karp_8cpp.html#a21c673d56cbf67b1d2ee4d869185b7d9", null ], + [ "recalculate_hash", "d6/dce/rabin__karp_8cpp.html#aed769d565b705a9b3e0eb1ec74088893", null ] +]; \ No newline at end of file diff --git a/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map new file mode 100644 index 000000000..9576e710f --- /dev/null +++ b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 new file mode 100644 index 000000000..9c8c5fd1b --- /dev/null +++ b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 @@ -0,0 +1 @@ +6de677024932aff75bca7d32e548553d \ No newline at end of file diff --git a/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg new file mode 100644 index 000000000..85f82291f --- /dev/null +++ b/d6/dce/rabin__karp_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg @@ -0,0 +1,98 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +string_search::rabin_karp + + + + + +Node1->Node2 + + + + + +Node3 + + +string_search::check +_if_equal + + + + + +Node2->Node3 + + + + + +Node4 + + +string_search::create_hash + + + + + +Node2->Node4 + + + + + +Node5 + + +string_search::recalculate_hash + + + + + +Node2->Node5 + + + + + +Node6 + + +std::string::size + + + + + +Node2->Node6 + + + + + diff --git a/d6/dd3/ode__midpoint__euler_8cpp.html b/d6/dd3/ode__midpoint__euler_8cpp.html new file mode 100644 index 000000000..3fb3a30c6 --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp.html @@ -0,0 +1,414 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/ode_midpoint_euler.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
ode_midpoint_euler.cpp File Reference
+
+
+ +

Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method +More...

+
#include <cmath>
+#include <ctime>
+#include <fstream>
+#include <iostream>
+#include <valarray>
+
+Include dependency graph for ode_midpoint_euler.cpp:
+
+
+
+
+
+ + + + + + + + + + + + + + + + + +

+Functions

void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Problem statement for a system with first-order differential equations. Updates the system differential variables. More...
 
void exact_solution (const double &x, std::valarray< double > *y)
 Exact solution of the problem. Used for solution comparison. More...
 
void midpoint_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Compute next step approximation using the midpoint-Euler method. More...
 
double midpoint_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
 Compute approximation using the midpoint-Euler method in the given limits. More...
 
void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
 
int main (int argc, char *argv[])
 
+

Detailed Description

+

Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method

+
Authors
Krishna Vedala
+

The ODE being solved is:

+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*} +

+

The exact solution for the above problem is:

+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*} +

+

The computation results are stored to a text file midpoint_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

+

To implement Van der Pol oscillator, change the problem function to:

const double mu = 2.0;
+
dy[0] = y[1];
+
dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
+
See also
ode_forward_euler.cpp, ode_semi_implicit_euler.cpp
+

Function Documentation

+ +

◆ exact_solution()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void exact_solution (const double & x,
std::valarray< double > * y 
)
+
+ +

Exact solution of the problem. Used for solution comparison.

+
Parameters
+ + + +
[in]xindependent variable
[in,out]ydependent variable
+
+
+
66  {
+
67  y[0][0] = std::cos(x);
+
68  y[0][1] = -std::sin(x);
+
69 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main Function

+
192  {
+
193  double X0 = 0.f; /* initial value of x0 */
+
194  double X_MAX = 10.F; /* upper limit of integration */
+
195  std::valarray<double> Y0 = {1.f, 0.f}; /* initial value Y = y(x = x_0) */
+
196  double step_size;
+
197 
+
198  if (argc == 1) {
+
199  std::cout << "\nEnter the step size: ";
+
200  std::cin >> step_size;
+
201  } else {
+
202  // use commandline argument as independent variable step size
+
203  step_size = std::atof(argv[1]);
+
204  }
+
205 
+
206  // get approximate solution
+
207  double total_time = midpoint_euler(step_size, X0, X_MAX, &Y0, true);
+
208  std::cout << "\tTime = " << total_time << " ms\n";
+
209 
+
210  /* compute exact solution for comparion */
+
211  save_exact_solution(X0, X_MAX, step_size, Y0);
+
212 
+
213  return 0;
+
214 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ problem()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void problem (const double & x,
std::valarray< double > * y,
std::valarray< double > * dy 
)
+
+ +

Problem statement for a system with first-order differential equations. Updates the system differential variables.

+
Note
This function can be updated to and ode of any order.
+
Parameters
+ + + + +
[in]xindependent variable(s)
[in,out]ydependent variable(s)
[in,out]dyfirst-derivative of dependent variable(s)
+
+
+
54  {
+
55  const double omega = 1.F; // some const for the problem
+
56  dy[0][0] = y[0][1]; // x dot
+
57  dy[0][1] = -omega * omega * y[0][0]; // y dot
+
58 }
+
+
+
+ +

◆ save_exact_solution()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void save_exact_solution (const double & X0,
const double & X_MAX,
const double & step_size,
const std::valarray< double > & Y0 
)
+
+

Function to compute and save exact solution for comparison

+
Parameters
+ + + + + +
[in]X0initial value of independent variable
[in]X_MAXfinal value of independent variable
[in]step_sizeindependent variable step size
[in]Y0initial values of dependent variables
+
+
+
158  {
+
159  double x = X0;
+
160  std::valarray<double> y = Y0;
+
161 
+
162  std::ofstream fp("exact.csv", std::ostream::out);
+
163  if (!fp.is_open()) {
+
164  std::perror("Error! ");
+
165  return;
+
166  }
+
167  std::cout << "Finding exact solution\n";
+
168 
+
169  std::clock_t t1 = std::clock();
+
170  do {
+
171  fp << x << ",";
+
172  for (int i = 0; i < y.size() - 1; i++) {
+
173  fp << y[i] << ",";
+
174  }
+
175  fp << y[y.size() - 1] << "\n";
+
176 
+
177  exact_solution(x, &y);
+
178 
+
179  x += step_size;
+
180  } while (x <= X_MAX);
+
181 
+
182  std::clock_t t2 = std::clock();
+
183  double total_time = static_cast<double>(t2 - t1) / CLOCKS_PER_SEC;
+
184  std::cout << "\tTime = " << total_time << " ms\n";
+
185 
+
186  fp.close();
+
187 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_midpoint_euler.cpp:156
+ +
T cos(T... args)
+
T atof(T... args)
+
T clock(T... args)
+ +
STL class.
+
T perror(T... args)
+
STL class.
+
T sin(T... args)
+
double midpoint_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the midpoint-Euler method in the given limits.
Definition: ode_midpoint_euler.cpp:107
+ +
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_midpoint_euler.cpp:66
+ + + + diff --git a/d6/dd3/ode__midpoint__euler_8cpp.js b/d6/dd3/ode__midpoint__euler_8cpp.js new file mode 100644 index 000000000..b2f164632 --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp.js @@ -0,0 +1,9 @@ +var ode__midpoint__euler_8cpp = +[ + [ "exact_solution", "d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b", null ], + [ "main", "d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "midpoint_euler", "d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985", null ], + [ "midpoint_euler_step", "d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812", null ], + [ "problem", "d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe", null ], + [ "save_exact_solution", "d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f", null ] +]; \ No newline at end of file diff --git a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map new file mode 100644 index 000000000..f83f2ff13 --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map @@ -0,0 +1,16 @@ + + + + + + + + + + + + + + + + diff --git a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 new file mode 100644 index 000000000..f746eb196 --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 @@ -0,0 +1 @@ +179f2373f41150d290344eb4693b0e36 \ No newline at end of file diff --git a/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg new file mode 100644 index 000000000..3ea2d0dc5 --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -0,0 +1,241 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::atof + + + + + +Node1->Node2 + + + + + +Node3 + + +midpoint_euler + + + + + +Node1->Node3 + + + + + +Node11 + + +save_exact_solution + + + + + +Node1->Node11 + + + + + +Node4 + + +std::clock + + + + + +Node3->Node4 + + + + + +Node5 + + +std::ofstream::close + + + + + +Node3->Node5 + + + + + +Node6 + + +std::ofstream::is_open + + + + + +Node3->Node6 + + + + + +Node7 + + +midpoint_euler_step + + + + + +Node3->Node7 + + + + + +Node9 + + +std::ofstream::open + + + + + +Node3->Node9 + + + + + +Node10 + + +std::perror + + + + + +Node3->Node10 + + + + + +Node8 + + +problem + + + + + +Node7->Node8 + + + + + +Node11->Node4 + + + + + +Node11->Node5 + + + + + +Node11->Node6 + + + + + +Node11->Node10 + + + + + +Node12 + + +exact_solution + + + + + +Node11->Node12 + + + + + +Node13 + + +std::cos + + + + + +Node12->Node13 + + + + + +Node14 + + +std::sin + + + + + +Node12->Node14 + + + + + diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map new file mode 100644 index 000000000..bcb6bdc60 --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 new file mode 100644 index 000000000..361c0aa64 --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 @@ -0,0 +1 @@ +ee2dd8e73a9acf5670fad571ee16575e \ No newline at end of file diff --git a/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg new file mode 100644 index 000000000..ad9eed8d3 --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg @@ -0,0 +1,127 @@ + + + + + + +save_exact_solution + + + +Node1 + + +save_exact_solution + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::ofstream::close + + + + + +Node1->Node3 + + + + + +Node4 + + +exact_solution + + + + + +Node1->Node4 + + + + + +Node7 + + +std::ofstream::is_open + + + + + +Node1->Node7 + + + + + +Node8 + + +std::perror + + + + + +Node1->Node8 + + + + + +Node5 + + +std::cos + + + + + +Node4->Node5 + + + + + +Node6 + + +std::sin + + + + + +Node4->Node6 + + + + + diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map new file mode 100644 index 000000000..fbb37ebae --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 new file mode 100644 index 000000000..53dab073e --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 @@ -0,0 +1 @@ +28f68d690a34e83ed529b0e7cf875a9c \ No newline at end of file diff --git a/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg new file mode 100644 index 000000000..6b0aebf2e --- /dev/null +++ b/d6/dd3/ode__midpoint__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +exact_solution + + + +Node1 + + +exact_solution + + + + + +Node2 + + +std::cos + + + + + +Node1->Node2 + + + + + +Node3 + + +std::sin + + + + + +Node1->Node3 + + + + + diff --git a/d7/d1f/realtime__stats_8cpp__incl.map b/d7/d1f/realtime__stats_8cpp__incl.map new file mode 100644 index 000000000..95dfd3df2 --- /dev/null +++ b/d7/d1f/realtime__stats_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d7/d1f/realtime__stats_8cpp__incl.md5 b/d7/d1f/realtime__stats_8cpp__incl.md5 new file mode 100644 index 000000000..e83a6940e --- /dev/null +++ b/d7/d1f/realtime__stats_8cpp__incl.md5 @@ -0,0 +1 @@ +b3b7df6f5ed3158b2bb6313ff48c1e0d \ No newline at end of file diff --git a/d7/d1f/realtime__stats_8cpp__incl.svg b/d7/d1f/realtime__stats_8cpp__incl.svg new file mode 100644 index 000000000..51e874ead --- /dev/null +++ b/d7/d1f/realtime__stats_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +math/realtime_stats.cpp + + + +Node1 + + +math/realtime_stats.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + diff --git a/d7/d21/classstack__linked_list-members.html b/d7/d21/classstack__linked_list-members.html new file mode 100644 index 000000000..c84a40d0b --- /dev/null +++ b/d7/d21/classstack__linked_list-members.html @@ -0,0 +1,117 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
stack_linkedList Member List
+
+
+ +

This is the complete list of members for stack_linkedList, including all inherited members.

+ + + + + + + +
dequeue() (defined in stack_linkedList)stack_linkedList
display() (defined in stack_linkedList)stack_linkedList
enqueue(int) (defined in stack_linkedList)stack_linkedList
front (defined in stack_linkedList)stack_linkedList
rear (defined in stack_linkedList)stack_linkedList
stack_linkedList() (defined in stack_linkedList)stack_linkedListinline
+
+ + + + diff --git a/d7/d2e/avltree_8cpp__incl.map b/d7/d2e/avltree_8cpp__incl.map new file mode 100644 index 000000000..29607f642 --- /dev/null +++ b/d7/d2e/avltree_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d7/d2e/avltree_8cpp__incl.md5 b/d7/d2e/avltree_8cpp__incl.md5 new file mode 100644 index 000000000..5103045a0 --- /dev/null +++ b/d7/d2e/avltree_8cpp__incl.md5 @@ -0,0 +1 @@ +e94afef857b532e8135f60ebca3d7126 \ No newline at end of file diff --git a/d7/d2e/avltree_8cpp__incl.svg b/d7/d2e/avltree_8cpp__incl.svg new file mode 100644 index 000000000..731180da3 --- /dev/null +++ b/d7/d2e/avltree_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +data_structures/avltree.cpp + + + +Node1 + + +data_structures/avltree.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +queue + + + + + +Node1->Node4 + + + + + diff --git a/d7/d35/matrix__exponentiation_8cpp.html b/d7/d35/matrix__exponentiation_8cpp.html new file mode 100644 index 000000000..314577976 --- /dev/null +++ b/d7/d35/matrix__exponentiation_8cpp.html @@ -0,0 +1,495 @@ + + + + + + + +Algorithms_in_C++: others/matrix_exponentiation.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
matrix_exponentiation.cpp File Reference
+
+
+ +

Matrix Exponentiation. +More...

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

+Macros

#define ll   int64_t
 
#define endl   std::endl
 
#define pb   push_back
 
+#define MOD   1000000007
 
+ + + + + + + + + + + +

+Functions

ll ab (ll x)
 
vector< vector< ll > > multiply (const vector< vector< ll >> &A, const vector< vector< ll >> &B)
 
vector< vector< ll > > power (const vector< vector< ll >> &A, ll p)
 
ll ans (ll n)
 
int main ()
 
+ + + + + + + + + +

+Variables

ll k
 
vector< lla
 
+vector< llb
 
+vector< llc
 
+

Detailed Description

+

Matrix Exponentiation.

+

The problem can be solved with DP but constraints are high.
+ \(a_i = b_i\) (for \(i <= k\))
+ \(a_i = c_1 a_{i-1} + c_2 a_{i-2} + ... + c_k a_{i-k}\) (for \(i > k\))
+Taking the example of Fibonacci series, \(k=2\)
+ \(b_1 = 1,\; b_2=1\)
+ \(c_1 = 1,\; c_2=1\)
+ \(a = \begin{bmatrix}0& 1& 1& 2& \ldots\end{bmatrix}\)
+This way you can find the \(10^{18}\) fibonacci numberMOD. I have given a general way to use it. The program takes the input of B and C matrix.

+

Steps for Matrix Expo

    +
  1. Create vector F1 : which is the copy of B.
  2. +
  3. Create transpose matrix (Learn more about it on the internet)
  4. +
  5. Perform \(T^{n-1}\) [transpose matrix to the power n-1]
  6. +
  7. Multiply with F to get the last matrix of size (1 \(\times\)k).
  8. +
+

The first element of this matrix is the required result.

+

Macro Definition Documentation

+ +

◆ endl

+ +
+
+ + + + +
#define endl   std::endl
+
+

shorthand definition for std::endl

+ +
+
+ +

◆ ll

+ +
+
+ + + + +
#define ll   int64_t
+
+

shorthand definition for int64_t

+ +
+
+ +

◆ pb

+ +
+
+ + + + +
#define pb   push_back
+
+

shorthand definition for int64_t

+ +
+
+

Function Documentation

+ +

◆ ab()

+ +
+
+ + + + + +
+ + + + + + + + +
ll ab (ll x)
+
+inline
+
+

returns absolute value

+
43 { return x > 0LL ? x : -x; }
+
+
+
+ +

◆ ans()

+ +
+
+ + + + + + + + +
ll ans (ll n)
+
+

Wrapper for Fibonacci

Parameters
+ + +
[in]n\(n^\text{th}\) Fibonacci number
+
+
+
Returns
\(n^\text{th}\) Fibonacci number
+
94  {
+
95  if (n == 0)
+
96  return 0;
+
97  if (n <= k)
+
98  return b[n - 1];
+
99  // F1
+
100  vector<ll> F1(k + 1);
+
101  for (ll i = 1; i <= k; i++) F1[i] = b[i - 1];
+
102 
+
103  // Transpose matrix
+
104  vector<vector<ll>> T(k + 1, vector<ll>(k + 1));
+
105  for (ll i = 1; i <= k; i++) {
+
106  for (ll j = 1; j <= k; j++) {
+
107  if (i < k) {
+
108  if (j == i + 1)
+
109  T[i][j] = 1;
+
110  else
+
111  T[i][j] = 0;
+
112  continue;
+
113  }
+
114  T[i][j] = c[k - j];
+
115  }
+
116  }
+
117  // T^n-1
+
118  T = power(T, n - 1);
+
119 
+
120  // T*F1
+
121  ll res = 0;
+
122  for (ll i = 1; i <= k; i++) {
+
123  res = (res + (T[1][i] * F1[i]) % MOD) % MOD;
+
124  }
+
125  return res;
+
126 }
+
+
+
+ +

◆ main()

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

Main function

+
129  {
+
130  cin.tie(0);
+
131  cout.tie(0);
+
132  ll t;
+
133  cin >> t;
+
134  ll i, j, x;
+
135  while (t--) {
+
136  cin >> k;
+
137  for (i = 0; i < k; i++) {
+
138  cin >> x;
+
139  b.pb(x);
+
140  }
+
141  for (i = 0; i < k; i++) {
+
142  cin >> x;
+
143  c.pb(x);
+
144  }
+
145  cin >> x;
+
146  cout << ans(x) << endl;
+
147  b.clear();
+
148  c.clear();
+
149  }
+
150  return 0;
+
151 }
+
+
+
+ +

◆ multiply()

+ +
+
+ + + + + + + + + + + + + + + + + + +
vector<vector<ll> > multiply (const vector< vector< ll >> & A,
const vector< vector< ll >> & B 
)
+
+

To multiply 2 matrices

Parameters
+ + + +
[in]Amatrix 1 of size (m \(\times\)n)
[in]Bmatrix 2 of size (p \(\times\)q)
+
+
+
+
Note
\(p=n\)
+
Returns
matrix of dimension (m \(\times\)q)
+
61  {
+
62  vector<vector<ll>> C(k + 1, vector<ll>(k + 1));
+
63  for (ll i = 1; i <= k; i++) {
+
64  for (ll j = 1; j <= k; j++) {
+
65  for (ll z = 1; z <= k; z++) {
+
66  C[i][j] = (C[i][j] + (A[i][z] * B[z][j]) % MOD) % MOD;
+
67  }
+
68  }
+
69  }
+
70  return C;
+
71 }
+
+
+
+ +

◆ power()

+ +
+
+ + + + + + + + + + + + + + + + + + +
vector<vector<ll> > power (const vector< vector< ll >> & A,
ll p 
)
+
+

computing integer power of a matrix using recursive multiplication.

Note
A must be a square matrix for this algorithm.
+
Parameters
+ + + +
[in]Abase matrix
[in]pexponent
+
+
+
Returns
matrix of same dimension as A
+
79  {
+
80  if (p == 1)
+
81  return A;
+
82  if (p % 2 == 1) {
+
83  return multiply(A, power(A, p - 1));
+
84  } else {
+
85  vector<vector<ll>> X = power(A, p / 2);
+
86  return multiply(X, X);
+
87  }
+
88 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+

Variable Documentation

+ +

◆ a

+ +
+
+ + + + +
vector<ll> a
+
+

global vector variables

Todo:
@stepfencurryxiao add documetnation
+ +
+
+ +

◆ k

+ +
+
+ + + + +
ll k
+
+

global variable k

Todo:
@stepfencurryxiao add documetnation
+ +
+
+
+
+
STL class.
+
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
+
vector< vector< ll > > multiply(const vector< vector< ll >> &A, const vector< vector< ll >> &B)
Definition: matrix_exponentiation.cpp:60
+ +
ll k
Definition: matrix_exponentiation.cpp:48
+
#define endl
Definition: matrix_exponentiation.cpp:36
+
vector< vector< ll > > power(const vector< vector< ll >> &A, ll p)
Definition: matrix_exponentiation.cpp:79
+ + + + + diff --git a/d7/d35/matrix__exponentiation_8cpp.js b/d7/d35/matrix__exponentiation_8cpp.js new file mode 100644 index 000000000..9b3607f4f --- /dev/null +++ b/d7/d35/matrix__exponentiation_8cpp.js @@ -0,0 +1,16 @@ +var matrix__exponentiation_8cpp = +[ + [ "endl", "d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258", null ], + [ "ll", "d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba", null ], + [ "MOD", "d7/d35/matrix__exponentiation_8cpp.html#aca7d5718ab8c38506adb3bef2469b319", null ], + [ "pb", "d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b", null ], + [ "ab", "d7/d35/matrix__exponentiation_8cpp.html#a8bcf0bfddddfd7f6d0848703632d795d", null ], + [ "ans", "d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa", null ], + [ "main", "d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "multiply", "d7/d35/matrix__exponentiation_8cpp.html#ac62a499b83c7895dd0aa69da1b64c904", null ], + [ "power", "d7/d35/matrix__exponentiation_8cpp.html#a5769b745458157ef2679949155684f3b", null ], + [ "a", "d7/d35/matrix__exponentiation_8cpp.html#a9ecd98ce0064e2f7f97bb6a92f58ee72", null ], + [ "b", "d7/d35/matrix__exponentiation_8cpp.html#acf41e44dfa1536fb48606ff20770f92f", null ], + [ "c", "d7/d35/matrix__exponentiation_8cpp.html#ad54b52a703d277babd3f30d20d9d416d", null ], + [ "k", "d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0", null ] +]; \ No newline at end of file diff --git a/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.map b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.map new file mode 100644 index 000000000..ea7fc449b --- /dev/null +++ b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.md5 b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.md5 new file mode 100644 index 000000000..2705e60bc --- /dev/null +++ b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.md5 @@ -0,0 +1 @@ +bce3e1ffabf6cff3904bb1331eef0c1c \ No newline at end of file diff --git a/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.svg b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.svg new file mode 100644 index 000000000..fd744ec7b --- /dev/null +++ b/d7/d35/matrix__exponentiation_8cpp_a5769b745458157ef2679949155684f3b_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +power + + + +Node1 + + +power + + + + + +Node2 + + +multiply + + + + + +Node1->Node2 + + + + + diff --git a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.map b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.map new file mode 100644 index 000000000..adc667f31 --- /dev/null +++ b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.md5 b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.md5 new file mode 100644 index 000000000..a545c201a --- /dev/null +++ b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.md5 @@ -0,0 +1 @@ +3e4551f597c958e7473a1efec3b99929 \ No newline at end of file diff --git a/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg new file mode 100644 index 000000000..6943eb877 --- /dev/null +++ b/d7/d3e/linkedlist__implentation__usingarray_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +data_structures/linkedlist_implentation_usingarray.cpp + + + +Node1 + + +data_structures/linkedlist +_implentation_usingarray.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d7/d40/class_solution__coll__graph.map b/d7/d40/class_solution__coll__graph.map new file mode 100644 index 000000000..2f07ac662 --- /dev/null +++ b/d7/d40/class_solution__coll__graph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d7/d40/class_solution__coll__graph.md5 b/d7/d40/class_solution__coll__graph.md5 new file mode 100644 index 000000000..be5cef09c --- /dev/null +++ b/d7/d40/class_solution__coll__graph.md5 @@ -0,0 +1 @@ +ce60b53d466fcb7e2a8c37c433b4bd3c \ No newline at end of file diff --git a/d7/d40/class_solution__coll__graph.svg b/d7/d40/class_solution__coll__graph.svg new file mode 100644 index 000000000..b8c635966 --- /dev/null +++ b/d7/d40/class_solution__coll__graph.svg @@ -0,0 +1,73 @@ + + + + + + +Solution + + + +Node1 + + +Solution + + + + + +Node2 + + +std::vector< vector +< int > > + + + + + +Node2->Node1 + + + bridge +graph + + + +Node3 + + +std::vector< int > + + + + + +Node3->Node1 + + + out_time +in_time + + + +Node4 + + +std::vector< bool > + + + + + +Node4->Node1 + + + visited + + + diff --git a/d7/d41/struct_min_heap_node__coll__graph.map b/d7/d41/struct_min_heap_node__coll__graph.map new file mode 100644 index 000000000..a78d64432 --- /dev/null +++ b/d7/d41/struct_min_heap_node__coll__graph.map @@ -0,0 +1,3 @@ + + + diff --git a/d7/d41/struct_min_heap_node__coll__graph.md5 b/d7/d41/struct_min_heap_node__coll__graph.md5 new file mode 100644 index 000000000..49191aa25 --- /dev/null +++ b/d7/d41/struct_min_heap_node__coll__graph.md5 @@ -0,0 +1 @@ +7e7ea6ae4fdc104842f3dccad98d59f4 \ No newline at end of file diff --git a/d7/d41/struct_min_heap_node__coll__graph.svg b/d7/d41/struct_min_heap_node__coll__graph.svg new file mode 100644 index 000000000..db2c50f7d --- /dev/null +++ b/d7/d41/struct_min_heap_node__coll__graph.svg @@ -0,0 +1,30 @@ + + + + + + +MinHeapNode + + + +Node1 + + +MinHeapNode + + + + + +Node1->Node1 + + + right +left + + + diff --git a/d7/d4c/spiral__print_8cpp__incl.map b/d7/d4c/spiral__print_8cpp__incl.map new file mode 100644 index 000000000..e54d263c6 --- /dev/null +++ b/d7/d4c/spiral__print_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d7/d4c/spiral__print_8cpp__incl.md5 b/d7/d4c/spiral__print_8cpp__incl.md5 new file mode 100644 index 000000000..b8058267e --- /dev/null +++ b/d7/d4c/spiral__print_8cpp__incl.md5 @@ -0,0 +1 @@ +ff926f0d205e560434ae25a2a6f68d1e \ No newline at end of file diff --git a/d7/d4c/spiral__print_8cpp__incl.svg b/d7/d4c/spiral__print_8cpp__incl.svg new file mode 100644 index 000000000..648a8589b --- /dev/null +++ b/d7/d4c/spiral__print_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/spiral_print.cpp + + + +Node1 + + +others/spiral_print.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d7/d6a/bisection__method_8cpp.html b/d7/d6a/bisection__method_8cpp.html new file mode 100644 index 000000000..765778a5d --- /dev/null +++ b/d7/d6a/bisection__method_8cpp.html @@ -0,0 +1,277 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/bisection_method.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
bisection_method.cpp File Reference
+
+
+ +

Solve the equation \(f(x)=0\) using bisection method +More...

+
#include <cmath>
+#include <iostream>
+#include <limits>
+
+Include dependency graph for bisection_method.cpp:
+
+
+
+
+
+ + + + + + +

+Macros

+#define EPSILON   1e-6
 
+#define MAX_ITERATIONS   50000
 Maximum number of iterations to check.
 
+ + + + + + + + +

+Functions

static double eq (double i)
 
template<typename T >
int sgn (T val)
 
int main ()
 
+

Detailed Description

+

Solve the equation \(f(x)=0\) using bisection method

+

Given two points \(a\) and \(b\) such that \(f(a)<0\) and \(f(b)>0\), then the \((i+1)^\text{th}\) approximation is given by:

+\[ x_{i+1} = \frac{a_i+b_i}{2} \] +

+

For the next iteration, the interval is selected as: \([a,x]\) if \(x>0\) or \([x,b]\) if \(x<0\). The Process is continued till a close enough approximation is achieved.

+
See also
newton_raphson_method.cpp, false_position.cpp, secant_method.cpp
+

Function Documentation

+ +

◆ eq()

+ +
+
+ + + + + +
+ + + + + + + + +
static double eq (double i)
+
+static
+
+

define \(f(x)\) to find root for

+
26  {
+
27  return (std::pow(i, 3) - (4 * i) - 9); // original equation
+
28 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

main function

+
37  {
+
38  double a = -1, b = 1, x, z;
+
39  int i;
+
40 
+
41  // loop to find initial intervals a, b
+
42  for (int i = 0; i < MAX_ITERATIONS; i++) {
+
43  z = eq(a);
+
44  x = eq(b);
+
45  if (sgn(z) == sgn(x)) { // same signs, increase interval
+
46  b++;
+
47  a--;
+
48  } else { // if opposite signs, we got our interval
+
49  break;
+
50  }
+
51  }
+
52 
+
53  std::cout << "\nFirst initial: " << a;
+
54  std::cout << "\nSecond initial: " << b;
+
55 
+
56  // start iterations
+
57  for (i = 0; i < MAX_ITERATIONS; i++) {
+
58  x = (a + b) / 2;
+
59  z = eq(x);
+
60  std::cout << "\n\nz: " << z << "\t[" << a << " , " << b
+
61  << " | Bisect: " << x << "]";
+
62 
+
63  if (z < 0) {
+
64  a = x;
+
65  } else {
+
66  b = x;
+
67  }
+
68 
+
69  if (std::abs(z) < EPSILON) // stoping criteria
+
70  break;
+
71  }
+
72 
+
73  std::cout << "\n\nRoot: " << x << "\t\tSteps: " << i << std::endl;
+
74  return 0;
+
75 }
+
+
+
+ +

◆ sgn()

+ +
+
+
+template<typename T >
+ + + + + + + + +
int sgn (val)
+
+

get the sign of any given number

+
32  {
+
33  return (T(0) < val) - (val < T(0));
+
34 }
+
+
+
+
+
+
int sgn(T val)
Definition: bisection_method.cpp:32
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: bisection_method.cpp:22
+
static double eq(double i)
Definition: bisection_method.cpp:26
+
T pow(T... args)
+ + + + diff --git a/d7/d6a/bisection__method_8cpp.js b/d7/d6a/bisection__method_8cpp.js new file mode 100644 index 000000000..c56ad1f3a --- /dev/null +++ b/d7/d6a/bisection__method_8cpp.js @@ -0,0 +1,8 @@ +var bisection__method_8cpp = +[ + [ "EPSILON", "d7/d6a/bisection__method_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70", null ], + [ "MAX_ITERATIONS", "d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14", null ], + [ "eq", "d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d", null ], + [ "main", "d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "sgn", "d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2", null ] +]; \ No newline at end of file diff --git a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map new file mode 100644 index 000000000..f584df02e --- /dev/null +++ b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 new file mode 100644 index 000000000..ecfa65278 --- /dev/null +++ b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 @@ -0,0 +1 @@ +ebb04cd15e67d7a7b151a478105c7fad \ No newline at end of file diff --git a/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg new file mode 100644 index 000000000..c3eea1476 --- /dev/null +++ b/d7/d6a/bisection__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +eq + + + +Node1 + + +eq + + + + + +Node2 + + +std::pow + + + + + +Node1->Node2 + + + + + diff --git a/d7/d77/class_edge.html b/d7/d77/class_edge.html new file mode 100644 index 000000000..5a25a63f6 --- /dev/null +++ b/d7/d77/class_edge.html @@ -0,0 +1,202 @@ + + + + + + + +Algorithms_in_C++: Edge Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+ + + + + + + + + + + + +

+Public Member Functions

Edge (Edge &&)=default
 
+Edgeoperator= (Edge &&)=default
 
Edge (Edge const &)=default
 
+Edgeoperator= (Edge const &)=default
 
 Edge (unsigned int source, unsigned int destination)
 
+ + + + + + + + + + + +

+Public Attributes

+int src
 
+int dst
 
+int weight
 
+unsigned int src
 
+unsigned int dest
 
+

Detailed Description

+

Implementation of non-weighted directed edge of a graph.

+

The source vertex of the edge is labelled "src" and destination vertex is labelled "dest".

+

Constructor & Destructor Documentation

+ +

◆ Edge()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Edge::Edge (unsigned int source,
unsigned int destination 
)
+
+inline
+
+

Set the source and destination of the vertex.

+
Parameters
+ + + +
sourceis the source vertex of the edge.
destinationis the destination vertex of the edge.
+
+
+
43  : src(source), dest(destination) {}
+
+
+
+
The documentation for this struct was generated from the following files:
    +
  • dynamic_programming/bellman_ford.cpp
  • +
  • graph/cycle_check_directed_graph.cpp
  • +
+
+
+ + + + diff --git a/d7/d77/class_edge.js b/d7/d77/class_edge.js new file mode 100644 index 000000000..63bf5af4b --- /dev/null +++ b/d7/d77/class_edge.js @@ -0,0 +1,15 @@ +var class_edge = +[ + [ "Edge", "d7/d77/class_edge.html#a0bc08bf5da251d66412a7dc3e50c6605", null ], + [ "~Edge", "d7/d77/class_edge.html#a4c8114f37c7eb3095557048ad42d3cd5", null ], + [ "Edge", "d7/d77/class_edge.html#aa8424b8e14b8a5a19d4b5821db85e9ef", null ], + [ "Edge", "d7/d77/class_edge.html#ac60e5bfb447fbb47de2e60a5dd05a7ec", null ], + [ "Edge", "d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980", null ], + [ "operator=", "d7/d77/class_edge.html#a26c0b79bfb231f0994853a25ba703a68", null ], + [ "operator=", "d7/d77/class_edge.html#a0a5b6510bcbe63028818f4dc417ba962", null ], + [ "dest", "d7/d77/class_edge.html#ae017097dd21663a9dc3387c23789c92e", null ], + [ "dst", "d7/d77/class_edge.html#a2449478938136b5ab7ef0e7d92e6990b", null ], + [ "src", "d7/d77/class_edge.html#a9a415f211c059647d1b3af8fcf7a0e30", null ], + [ "src", "d7/d77/class_edge.html#aadbbb85298a21ecc2c17eeeadea65b01", null ], + [ "weight", "d7/d77/class_edge.html#a4d58e1f4de38fa55549497175981ebab", null ] +]; \ No newline at end of file diff --git a/d7/d7c/classstatistics_1_1stats__computer1.html b/d7/d7c/classstatistics_1_1stats__computer1.html new file mode 100644 index 000000000..4b9b2a648 --- /dev/null +++ b/d7/d7c/classstatistics_1_1stats__computer1.html @@ -0,0 +1,340 @@ + + + + + + + +Algorithms_in_C++: statistics::stats_computer1< T > Class Template Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
statistics::stats_computer1< T > Class Template Reference
+
+
+ + + + + + + + + + +

+Public Member Functions

void new_val (T x)
 
double mean () const
 
double variance () const
 
double std () const
 
+ + + + + + + + + +

+Private Attributes

+unsigned int n = 0
 
+double Ex
 
+double Ex2
 
+T K
 
+ + + +

+Friends

std::istreamoperator>> (std::istream &input, stats_computer1 &stat)
 
+

Detailed Description

+

template<typename T>
+class statistics::stats_computer1< T >

+ +

continuous mean and variance computance using first value as an approximation for the mean. If the first number is much far form the mean, the algorithm becomes very inaccurate to compute variance and standard deviation.

+

Member Function Documentation

+ +

◆ mean()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
double statistics::stats_computer1< T >::mean () const
+
+inline
+
+

return sample mean computed till last sample

+
42 { return K + Ex / n; }
+
+
+
+ +

◆ new_val()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void statistics::stats_computer1< T >::new_val (x)
+
+inline
+
+

Constructor

Parameters
+ + +
[in]xnew data sample
+
+
+
32  {
+
33  if (n == 0)
+
34  K = x;
+
35  n++;
+
36  T tmp = x - K;
+
37  Ex += tmp;
+
38  Ex2 += tmp * tmp;
+
39  }
+
+
+
+ +

◆ std()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
double statistics::stats_computer1< T >::std () const
+
+inline
+
+

return sample standard deviation computed till last sample

+
48 { return std::sqrt(this->variance()); }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ variance()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
double statistics::stats_computer1< T >::variance () const
+
+inline
+
+

return data variance computed till last sample

+
45 { return (Ex2 - (Ex * Ex) / n) / (n - 1); }
+
+
+
+

Friends And Related Function Documentation

+ +

◆ operator>>

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
std::istream& operator>> (std::istreaminput,
stats_computer1< T > & stat 
)
+
+friend
+
+

short-hand operator to read new sample from input stream
+ e.g.: std::cin >> stats1;

+
54  {
+
55  T val;
+
56  input >> val;
+
57  stat.new_val(val);
+
58  return input;
+
59  }
+
+
+
+
The documentation for this class was generated from the following file: +
+
+
T sqrt(T... args)
+
void new_val(T x)
Definition: realtime_stats.cpp:32
+
double variance() const
Definition: realtime_stats.cpp:45
+ + + + diff --git a/d7/d7c/classstatistics_1_1stats__computer1.js b/d7/d7c/classstatistics_1_1stats__computer1.js new file mode 100644 index 000000000..c1cad7ee4 --- /dev/null +++ b/d7/d7c/classstatistics_1_1stats__computer1.js @@ -0,0 +1,12 @@ +var classstatistics_1_1stats__computer1 = +[ + [ "mean", "d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b", null ], + [ "new_val", "d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2", null ], + [ "std", "d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1", null ], + [ "variance", "d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92", null ], + [ "operator>>", "d7/d7c/classstatistics_1_1stats__computer1.html#ab5b4bfecdf391cae7edb1fe98548b846", null ], + [ "Ex", "d7/d7c/classstatistics_1_1stats__computer1.html#a2a097b80909181880f13b54a264ed337", null ], + [ "Ex2", "d7/d7c/classstatistics_1_1stats__computer1.html#a8ab2b14d5650b14e46b70b412573f60a", null ], + [ "K", "d7/d7c/classstatistics_1_1stats__computer1.html#a48c03a44c784eb6913ad186d34c302db", null ], + [ "n", "d7/d7c/classstatistics_1_1stats__computer1.html#ab2e69e75fe0da096bf61fa13420b43eb", null ] +]; \ No newline at end of file diff --git a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map new file mode 100644 index 000000000..a82802c27 --- /dev/null +++ b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 new file mode 100644 index 000000000..c18808d80 --- /dev/null +++ b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.md5 @@ -0,0 +1 @@ +bbccf549f6b3cbeb289f6fb78a720683 \ No newline at end of file diff --git a/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg new file mode 100644 index 000000000..da5a92c25 --- /dev/null +++ b/d7/d7c/classstatistics_1_1stats__computer1_af57e942d49f4fd70f059f224b4ac07e1_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +statistics::stats_computer1::std + + + +Node1 + + +statistics::stats_computer1::std + + + + + +Node2 + + +std::sqrt + + + + + +Node1->Node2 + + + + + +Node3 + + +statistics::stats_computer1 +::variance + + + + + +Node1->Node3 + + + + + diff --git a/d7/d7f/section.html b/d7/d7f/section.html new file mode 100644 index 000000000..6cceddf93 --- /dev/null +++ b/d7/d7f/section.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: Prime factorization + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Prime factorization
+
+
+

Prime Factorization is a very important and useful technique to factorize any number into its prime factors. It has various applications in the field of number theory.

+

The method of prime factorization involves two function calls. First: Calculating all the prime number up till a certain range using the standard Sieve of Eratosthenes.

+

Second: Using the prime numbers to reduce the the given number and thus find all its prime factors.

+

The complexity of the solution involves approx. O(n logn) in calculating sieve of eratosthenes O(log n) in calculating the prime factors of the number. So in total approx. O(n logn).

+

Requirements: For compile you need the compiler flag for C++ 11

+
+
+
+ + + + diff --git a/d7/d89/double__factorial_8cpp.html b/d7/d89/double__factorial_8cpp.html new file mode 100644 index 000000000..ed1ba9b4d --- /dev/null +++ b/d7/d89/double__factorial_8cpp.html @@ -0,0 +1,193 @@ + + + + + + + +Algorithms_in_C++: math/double_factorial.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
double_factorial.cpp File Reference
+
+
+ +

Compute double factorial: \(n!!\). +More...

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

+Functions

uint64_t double_factorial_iterative (uint64_t n)
 
uint64_t double_factorial_recursive (uint64_t n)
 
+int main ()
 main function
 
+

Detailed Description

+

Compute double factorial: \(n!!\).

+

Double factorial of a non-negative integer n, is defined as the product of all the integers from 1 to n that have the same parity (odd or even) as n.
+It is also called as semifactorial of a number and is denoted by \(n!!\)

+

Function Documentation

+ +

◆ double_factorial_iterative()

+ +
+
+ + + + + + + + +
uint64_t double_factorial_iterative (uint64_t n)
+
+

Compute double factorial using iterative method

+
16  {
+
17  uint64_t res = 1;
+
18  for (uint64_t i = n;; i -= 2) {
+
19  if (i == 0 || i == 1)
+
20  return res;
+
21  res *= i;
+
22  }
+
23  return res;
+
24 }
+
+
+
+ +

◆ double_factorial_recursive()

+ +
+
+ + + + + + + + +
uint64_t double_factorial_recursive (uint64_t n)
+
+

Compute double factorial using resursive method.
+Recursion can be costly for large numbers.

+
29  {
+
30  if (n <= 1)
+
31  return 1;
+
32  return n * double_factorial_recursive(n - 2);
+
33 }
+
+
+
+
+
+
uint64_t double_factorial_recursive(uint64_t n)
Definition: double_factorial.cpp:29
+ + + + diff --git a/d7/d89/double__factorial_8cpp.js b/d7/d89/double__factorial_8cpp.js new file mode 100644 index 000000000..7d35f52c2 --- /dev/null +++ b/d7/d89/double__factorial_8cpp.js @@ -0,0 +1,6 @@ +var double__factorial_8cpp = +[ + [ "double_factorial_iterative", "d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26", null ], + [ "double_factorial_recursive", "d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d", null ], + [ "main", "d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d7/d8e/power__for__huge__numbers_8cpp__incl.map b/d7/d8e/power__for__huge__numbers_8cpp__incl.map new file mode 100644 index 000000000..5f8646510 --- /dev/null +++ b/d7/d8e/power__for__huge__numbers_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d7/d8e/power__for__huge__numbers_8cpp__incl.md5 b/d7/d8e/power__for__huge__numbers_8cpp__incl.md5 new file mode 100644 index 000000000..f676f11d9 --- /dev/null +++ b/d7/d8e/power__for__huge__numbers_8cpp__incl.md5 @@ -0,0 +1 @@ +a65d1bd06b60f159a2fc8d1439430277 \ No newline at end of file diff --git a/d7/d8e/power__for__huge__numbers_8cpp__incl.svg b/d7/d8e/power__for__huge__numbers_8cpp__incl.svg new file mode 100644 index 000000000..dd5b93f6a --- /dev/null +++ b/d7/d8e/power__for__huge__numbers_8cpp__incl.svg @@ -0,0 +1,38 @@ + + + + + + +math/power_for_huge_numbers.cpp + + + +Node1 + + +math/power_for_huge +_numbers.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d7/da7/adaline__learning_8cpp__incl.map b/d7/da7/adaline__learning_8cpp__incl.map new file mode 100644 index 000000000..91df185f9 --- /dev/null +++ b/d7/da7/adaline__learning_8cpp__incl.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d7/da7/adaline__learning_8cpp__incl.md5 b/d7/da7/adaline__learning_8cpp__incl.md5 new file mode 100644 index 000000000..cedf8bf65 --- /dev/null +++ b/d7/da7/adaline__learning_8cpp__incl.md5 @@ -0,0 +1 @@ +2c460f64cc40edc34dfb964b2ad9d6ed \ No newline at end of file diff --git a/d7/da7/adaline__learning_8cpp__incl.svg b/d7/da7/adaline__learning_8cpp__incl.svg new file mode 100644 index 000000000..7d011e50e --- /dev/null +++ b/d7/da7/adaline__learning_8cpp__incl.svg @@ -0,0 +1,231 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +machine_learning/adaline_learning.cpp + + + +Node1 + + +machine_learning/adaline +_learning.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +climits + + + + + +Node1->Node3 + + + + + +Node4 + + +cmath + + + + + +Node1->Node4 + + + + + +Node5 + + +cstdlib + + + + + +Node1->Node5 + + + + + +Node6 + + +ctime + + + + + +Node1->Node6 + + + + + +Node7 + + +iostream + + + + + +Node1->Node7 + + + + + +Node8 + + +numeric + + + + + +Node1->Node8 + + + + + +Node9 + + +vector + + + + + +Node1->Node9 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d7/da7/adaline__learning_8cpp__incl_org.svg b/d7/da7/adaline__learning_8cpp__incl_org.svg new file mode 100644 index 000000000..efd92d715 --- /dev/null +++ b/d7/da7/adaline__learning_8cpp__incl_org.svg @@ -0,0 +1,143 @@ + + + + + + +machine_learning/adaline_learning.cpp + + + +Node1 + + +machine_learning/adaline +_learning.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +climits + + + + + +Node1->Node3 + + + + + +Node4 + + +cmath + + + + + +Node1->Node4 + + + + + +Node5 + + +cstdlib + + + + + +Node1->Node5 + + + + + +Node6 + + +ctime + + + + + +Node1->Node6 + + + + + +Node7 + + +iostream + + + + + +Node1->Node7 + + + + + +Node8 + + +numeric + + + + + +Node1->Node8 + + + + + +Node9 + + +vector + + + + + +Node1->Node9 + + + + + diff --git a/d7/dae/decimal__to__binary_8cpp__incl.map b/d7/dae/decimal__to__binary_8cpp__incl.map new file mode 100644 index 000000000..995176dd2 --- /dev/null +++ b/d7/dae/decimal__to__binary_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d7/dae/decimal__to__binary_8cpp__incl.md5 b/d7/dae/decimal__to__binary_8cpp__incl.md5 new file mode 100644 index 000000000..fabfa8574 --- /dev/null +++ b/d7/dae/decimal__to__binary_8cpp__incl.md5 @@ -0,0 +1 @@ +b8a280bcd9ccc6b135af936b4a3a689f \ No newline at end of file diff --git a/d7/dae/decimal__to__binary_8cpp__incl.svg b/d7/dae/decimal__to__binary_8cpp__incl.svg new file mode 100644 index 000000000..0ddad5f8f --- /dev/null +++ b/d7/dae/decimal__to__binary_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/decimal_to_binary.cpp + + + +Node1 + + +others/decimal_to_binary.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d7/dba/cll_8h_source.html b/d7/dba/cll_8h_source.html new file mode 100644 index 000000000..85e198fba --- /dev/null +++ b/d7/dba/cll_8h_source.html @@ -0,0 +1,198 @@ + + + + + + + +Algorithms_in_C++: data_structures/cll/cll.h Source File + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
cll.h
+
+
+
1 /*
+
2  * Simple data structure CLL (Cicular Linear Linked List)
+
3  * */
+
4 #include <cctype>
+
5 #include <cstdlib>
+
6 #include <cstring>
+
7 #include <iostream>
+
8 
+
9 #ifndef CLL_H
+
10 #define CLL_H
+
11 /*The data structure is a linear linked list of integers */
+
12 struct node {
+
13  int data;
+
14  node* next;
+
15 };
+
16 
+
17 class cll {
+
18  public:
+
19  cll(); /* Construct without parameter */
+
20  ~cll();
+
21  void display(); /* Show the list */
+
22 
+
23  /******************************************************
+
24  * Useful method for list
+
25  *******************************************************/
+
26  void insert_front(int new_data); /* Insert a new value at head */
+
27  void insert_tail(int new_data); /* Insert a new value at tail */
+
28  int get_size(); /* Get total element in list */
+
29  bool find_item(int item_to_find); /* Find an item in list */
+
30 
+
31  /******************************************************
+
32  * Overloading method for list
+
33  *******************************************************/
+
34  int operator*(); /* Returns the info contained in head */
+
35  /* Overload the pre-increment operator.
+
36  The iterator is advanced to the next node. */
+
37  void operator++();
+
38 
+
39  protected:
+
40  node* head;
+
41  int total; /* Total element in a list */
+
42 };
+
43 #endif
+
+
+
void mov(tower *From, tower *To)
Definition: tower_of_hanoi.cpp:39
+
MinHeap(int capacity)
Definition: binaryheap.cpp:50
+
Definition: bfs.cpp:3
+
STL class.
+
node * deleteNode(node *root, int key)
Definition: avltree.cpp:88
+
T size(T... args)
+
void deleteKey(int i)
Definition: binaryheap.cpp:107
+
Definition: binaryheap.cpp:10
+
int heap_size
Current number of elements in min heap.
Definition: binaryheap.cpp:13
+
Definition: avltree.cpp:13
+
struct list node
+
void decreaseKey(int i, int new_val)
Definition: binaryheap.cpp:78
+
void levelOrder(node *root)
Definition: avltree.cpp:119
+
STL class.
+
Definition: binary_search_tree.cpp:17
+
void insertKey(int k)
Definition: binaryheap.cpp:57
+
node * createNode(int data)
Definition: avltree.cpp:21
+
Definition: cll.h:17
+
int capacity
maximum possible size of min heap
Definition: binaryheap.cpp:12
+
node * insert(node *root, int item)
Definition: avltree.cpp:66
+
T printf(T... args)
+ +
int h(int key)
Definition: hash_search.cpp:45
+
ll k
Definition: matrix_exponentiation.cpp:48
+
int * harr
pointer to array of elements in heap
Definition: binaryheap.cpp:11
+
void MinHeapify(int)
Definition: binaryheap.cpp:115
+
int height(node *root)
Definition: avltree.cpp:31
+
node * rightRotate(node *root)
Definition: avltree.cpp:41
+
#define endl
Definition: matrix_exponentiation.cpp:36
+
int left(int i)
Definition: binaryheap.cpp:28
+
T swap(T... args)
+
T min(T... args)
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
node * minValue(node *root)
Definition: avltree.cpp:59
+
T endl(T... args)
+
STL namespace.
+
int main()
Definition: avltree.cpp:134
+
T max(T... args)
+
node * leftRotate(node *root)
Definition: avltree.cpp:50
+
Definition: circular_queue_using_linked_list.cpp:7
+ +
int getMin()
Definition: binaryheap.cpp:40
+
T data(T... args)
+
int getBalance(node *root)
Definition: avltree.cpp:38
+
int extractMin()
Definition: binaryheap.cpp:87
+
int right(int i)
Definition: binaryheap.cpp:31
+ + + + diff --git a/d7/de0/stack_8h_source.html b/d7/de0/stack_8h_source.html new file mode 100644 index 000000000..72bc8d60e --- /dev/null +++ b/d7/de0/stack_8h_source.html @@ -0,0 +1,246 @@ + + + + + + + +Algorithms_in_C++: data_structures/stack.h Source File + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
stack.h
+
+
+
1 /* This class specifies the basic operation on a stack as a linked list */
+
2 #ifndef DATA_STRUCTURES_STACK_H_
+
3 #define DATA_STRUCTURES_STACK_H_
+
4 
+
5 #include <cassert>
+
6 #include <iostream>
+
7 
+
8 /* Definition of the node */
+
9 template <class Type>
+
10 struct node {
+
11  Type data;
+
12  node<Type> *next;
+
13 };
+
14 
+
15 /* Definition of the stack class */
+
16 template <class Type>
+
17 class stack {
+
18  public:
+
19  /** Show stack */
+
20  void display() {
+
21  node<Type> *current = stackTop;
+
22  std::cout << "Top --> ";
+
23  while (current != NULL) {
+
24  std::cout << current->data << " ";
+
25  current = current->next;
+
26  }
+ +
28  std::cout << "Size of stack: " << size << std::endl;
+
29  }
+
30 
+
31  /** Default constructor*/
+
32  stack() {
+
33  stackTop = NULL;
+
34  size = 0;
+
35  }
+
36 
+
37  /** Destructor */
+
38  ~stack() {}
+
39 
+
40  /** Determine whether the stack is empty */
+
41  bool isEmptyStack() { return (stackTop == NULL); }
+
42 
+
43  /** Add new item to the stack */
+
44  void push(Type item) {
+
45  node<Type> *newNode;
+
46  newNode = new node<Type>;
+
47  newNode->data = item;
+
48  newNode->next = stackTop;
+
49  stackTop = newNode;
+
50  size++;
+
51  }
+
52 
+
53  /** Return the top element of the stack */
+
54  Type top() {
+
55  assert(stackTop != NULL);
+
56  return stackTop->data;
+
57  }
+
58 
+
59  /** Remove the top element of the stack */
+
60  void pop() {
+
61  node<Type> *temp;
+
62  if (!isEmptyStack()) {
+
63  temp = stackTop;
+
64  stackTop = stackTop->next;
+
65  delete temp;
+
66  size--;
+
67  } else {
+
68  std::cout << "Stack is empty !" << std::endl;
+
69  }
+
70  }
+
71 
+
72  /** Clear stack */
+
73  void clear() { stackTop = NULL; }
+
74 
+
75  /** Overload "=" the assignment operator */
+
76  stack<Type> &operator=(const stack<Type> &otherStack) {
+
77  node<Type> *newNode, *current, *last;
+
78 
+
79  /* If stack is no empty, make it empty */
+
80  if (stackTop != NULL) {
+
81  stackTop = NULL;
+
82  }
+
83  if (otherStack.stackTop == NULL) {
+
84  stackTop = NULL;
+
85  } else {
+
86  current = otherStack.stackTop;
+
87  stackTop = new node<Type>;
+
88  stackTop->data = current->data;
+
89  stackTop->next = NULL;
+
90  last = stackTop;
+
91  current = current->next;
+
92  /* Copy the remaining stack */
+
93  while (current != NULL) {
+
94  newNode = new node<Type>;
+
95  newNode->data = current->data;
+
96  newNode->next = NULL;
+
97  last->next = newNode;
+
98  last = newNode;
+
99  current = current->next;
+
100  }
+
101  }
+
102  size = otherStack.size;
+
103  return *this;
+
104  }
+
105 
+
106  private:
+
107  node<Type> *stackTop; /**< Pointer to the stack */
+
108  int size;
+
109 };
+
110 
+
111 #endif // DATA_STRUCTURES_STACK_H_
+
+
+
void pop()
Definition: stack.h:60
+
Definition: avltree.cpp:13
+
struct list node
+
STL class.
+ +
Definition: queue_using_linkedlist.cpp:10
+
Definition: queue_using_linkedlist.cpp:6
+
void push(Type item)
Definition: stack.h:44
+
Type top()
Definition: stack.h:54
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
T endl(T... args)
+
stack()
Definition: stack.h:32
+
stack< Type > & operator=(const stack< Type > &otherStack)
Definition: stack.h:76
+
STL namespace.
+
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
+
int main()
Definition: avltree.cpp:134
+
Definition: stack.h:17
+
Definition: queue_using_array.cpp:13
+
void display()
Definition: stack.h:20
+
bool isEmptyStack()
Definition: stack.h:41
+
node< Type > * stackTop
Definition: stack.h:107
+
~stack()
Definition: stack.h:38
+ +
T exit(T... args)
+
void clear()
Definition: stack.h:73
+
T next(T... args)
+ + + + diff --git a/d8/d01/struct_item-members.html b/d8/d01/struct_item-members.html new file mode 100644 index 000000000..7d0f6c450 --- /dev/null +++ b/d8/d01/struct_item-members.html @@ -0,0 +1,113 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Item Member List
+
+
+ +

This is the complete list of members for Item, including all inherited members.

+ + + +
profit (defined in Item)Item
weight (defined in Item)Item
+
+ + + + diff --git a/d8/d10/structlist.html b/d8/d10/structlist.html new file mode 100644 index 000000000..f72b2f76f --- /dev/null +++ b/d8/d10/structlist.html @@ -0,0 +1,170 @@ + + + + + + + +Algorithms_in_C++: list Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for list:
+
+
+
+
[legend]
+ + + + + + + + + + + + + + + + +

+Public Member Functions

+int BinarySearch (int *array, int first, int last, int x)
 
+int LinarSearch (int *array, int x)
 
+int Search (int x)
 
+void Sort ()
 
+void insert (int x)
 
+void Remove (int x)
 
+void Show ()
 
+ + + + + + + + + + + + + +

+Public Attributes

+int data [50]
 
+int top = 0
 
+bool isSorted = false
 
+int key
 key value for node
 
+struct listnext
 pointer to next link in the chain
 
+

Detailed Description

+

a one-way linked list

+

The documentation for this struct was generated from the following files: +
+
+ + + + diff --git a/d8/d10/structlist.js b/d8/d10/structlist.js new file mode 100644 index 000000000..8fafaacda --- /dev/null +++ b/d8/d10/structlist.js @@ -0,0 +1,15 @@ +var structlist = +[ + [ "BinarySearch", "d8/d10/structlist.html#a4227479f0d8135e889e0a33fd4dbfc2e", null ], + [ "insert", "d8/d10/structlist.html#ad21e95792529f165f01361f9f42505b3", null ], + [ "LinarSearch", "d8/d10/structlist.html#a4c9cbc39d07f49b44700f6decd0978b4", null ], + [ "Remove", "d8/d10/structlist.html#a8c0c536c5db7dd69ff470c4b0445ca09", null ], + [ "Search", "d8/d10/structlist.html#ac75c5419552b0a4d506c3fdbcdb89311", null ], + [ "Show", "d8/d10/structlist.html#a1dfa9c59c5038a9e1bea0bb7f4c35178", null ], + [ "Sort", "d8/d10/structlist.html#a959d0064283c4c04a9504161fed936da", null ], + [ "data", "d8/d10/structlist.html#aec0e6f9f6cbe56458c69dedd4044feec", null ], + [ "isSorted", "d8/d10/structlist.html#a02290e44ad1bce31911fd995c65613ec", null ], + [ "key", "d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c", null ], + [ "next", "d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f", null ], + [ "top", "d8/d10/structlist.html#a3c852e1981fe1d68e02deecb0b72e3a4", null ] +]; \ No newline at end of file diff --git a/d8/d13/bubble__sort_8cpp.html b/d8/d13/bubble__sort_8cpp.html new file mode 100644 index 000000000..f01ebd9cb --- /dev/null +++ b/d8/d13/bubble__sort_8cpp.html @@ -0,0 +1,139 @@ + + + + + + + +Algorithms_in_C++: sorting/bubble_sort.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
bubble_sort.cpp File Reference
+
+
+ +

Bubble sort algorithm. +More...

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

+Functions

+int main ()
 
+

Detailed Description

+

Bubble sort algorithm.

+

The working principle of the Bubble sort algorithm:

+

Bubble sort algorithm is the bubble sorting algorithm. The most important reason for calling the bubble is that the largest number is thrown at the end of this algorithm. This is all about the logic. In each iteration, the largest number is expired and when iterations are completed, the sorting takes place.

+

What is Swap?

+

Swap in the software means that two variables are displaced. An additional variable is required for this operation. x = 5, y = 10. We want x = 10, y = 5. Here we create the most variable to do it.

+

int z; z = x; x = y; y = z;

+

The above process is a typical displacement process. When x assigns the value to x, the old value of x is lost. That's why we created a variable z to create the first value of the value of x, and finally, we have assigned to y.

+

Bubble Sort Algorithm Analysis (Best Case - Worst Case - Average Case)

+

Bubble Sort Worst Case Performance is O (n²). Why is that? Because if you remember Big O Notation, we were calculating the complexity of the algorithms in the nested loops. The n * (n - 1) product gives us O (n²) performance. In the worst case all the steps of the cycle will occur. Bubble Sort (Avarage Case) Performance. Bubble Sort is not an optimal algorithm. in average, O (n²) performance is taken. Bubble Sort Best Case Performance. O (n). However, you can't get the best status in the code we shared above. This happens on the optimized bubble sort algorithm. It's right down there.

+
+
+ + + + diff --git a/d8/d13/bubble__sort_8cpp.js b/d8/d13/bubble__sort_8cpp.js new file mode 100644 index 000000000..a38b3d9a0 --- /dev/null +++ b/d8/d13/bubble__sort_8cpp.js @@ -0,0 +1,4 @@ +var bubble__sort_8cpp = +[ + [ "main", "d8/d13/bubble__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d8/d38/queue_8h_source.html b/d8/d38/queue_8h_source.html new file mode 100644 index 000000000..89281adf4 --- /dev/null +++ b/d8/d38/queue_8h_source.html @@ -0,0 +1,244 @@ + + + + + + + +Algorithms_in_C++: data_structures/queue.h Source File + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
queue.h
+
+
+
1 /* This class specifies the basic operation on a queue as a linked list */
+
2 #ifndef DATA_STRUCTURES_QUEUE_H_
+
3 #define DATA_STRUCTURES_QUEUE_H_
+
4 
+
5 #include <cassert>
+
6 #include <iostream>
+
7 
+
8 /** Definition of the node */
+
9 template <class Kind>
+
10 struct node {
+
11  Kind data;
+
12  node<Kind> *next;
+
13 };
+
14 
+
15 /** Definition of the queue class */
+
16 template <class Kind>
+
17 class queue {
+
18  public:
+
19  /** Show queue */
+
20  void display() {
+
21  node<Kind> *current = queueFront;
+
22  std::cout << "Front --> ";
+
23  while (current != NULL) {
+
24  std::cout << current->data << " ";
+
25  current = current->next;
+
26  }
+ +
28  std::cout << "Size of queue: " << size << std::endl;
+
29  }
+
30 
+
31  /** Default constructor*/
+
32  queue() {
+
33  queueFront = NULL;
+
34  queueRear = NULL;
+
35  size = 0;
+
36  }
+
37 
+
38  /** Destructor */
+
39  ~queue() {}
+
40 
+
41  /** Determine whether the queue is empty */
+
42  bool isEmptyQueue() { return (queueFront == NULL); }
+
43 
+
44  /** Add new item to the queue */
+
45  void enQueue(Kind item) {
+
46  node<Kind> *newNode;
+
47  newNode = new node<Kind>;
+
48  newNode->data = item;
+
49  newNode->next = NULL;
+
50  if (queueFront == NULL) {
+
51  queueFront = newNode;
+
52  queueRear = newNode;
+
53  } else {
+
54  queueRear->next = newNode;
+
55  queueRear = queueRear->next;
+
56  }
+
57  size++;
+
58  }
+
59 
+
60  /** Return the first element of the queue */
+
61  Kind front() {
+
62  assert(queueFront != NULL);
+
63  return queueFront->data;
+
64  }
+
65 
+
66  /** Remove the top element of the queue */
+
67  void deQueue() {
+
68  node<Kind> *temp;
+
69  if (!isEmptyQueue()) {
+
70  temp = queueFront;
+
71  queueFront = queueFront->next;
+
72  delete temp;
+
73  size--;
+
74  } else {
+
75  std::cout << "Queue is empty !" << std::endl;
+
76  }
+
77  }
+
78 
+
79  /** Clear queue */
+
80  void clear() { queueFront = NULL; }
+
81 
+
82  private:
+
83  node<Kind> *queueFront; /**< Pointer to the front of the queue */
+
84  node<Kind> *queueRear; /**< Pointer to the rear of the queue */
+
85  int size;
+
86 };
+
87 
+
88 #endif // DATA_STRUCTURES_QUEUE_H_
+
+
+
STL class.
+
void deQueue()
Definition: queue.h:67
+
STL class.
+
Definition: avltree.cpp:13
+
T search(T... args)
+
struct list node
+
node< Kind > * queueRear
Definition: queue.h:84
+
int main()
Definition: linkedlist_implentation_usingarray.cpp:79
+
T reverse(T... args)
+
Kind front()
Definition: queue.h:61
+
~queue()
Definition: queue.h:39
+
STL class.
+
T front(T... args)
+
Definition: linkedlist_implentation_usingarray.cpp:14
+
Definition: binary_search_tree.cpp:17
+
int top
pointer to track stack index
Definition: paranthesis_matching.cpp:23
+
Definition: cll.h:17
+
void clear()
Definition: queue.h:80
+
node * insert(node *root, int item)
Definition: avltree.cpp:66
+ +
T pop(T... args)
+
queue()
Definition: queue.h:32
+
STL class.
+
void insertAtTheBeginning(int data)
Definition: linkedlist_implentation_usingarray.cpp:50
+
T remove(T... args)
+
#define endl
Definition: matrix_exponentiation.cpp:36
+
bool isEmptyQueue()
Definition: queue.h:42
+
int getnode()
Definition: linkedlist_implentation_usingarray.cpp:32
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
node< Kind > * queueFront
Definition: queue.h:83
+
T min(T... args)
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
T endl(T... args)
+
void display()
Definition: queue.h:20
+
T left(T... args)
+
STL namespace.
+
T insert(T... args)
+
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
+
int main()
Definition: avltree.cpp:134
+
void freeNode(int nodeToBeDeleted)
Definition: linkedlist_implentation_usingarray.cpp:42
+
T empty(T... args)
+
T push(T... args)
+
void enQueue(Kind item)
Definition: queue.h:45
+ +
Definition: morrisinorder.cpp:10
+
Definition: doubly_linked_list.cpp:11
+
Node AvailArray[100]
array that will act as nodes of a linked list.
Definition: linkedlist_implentation_usingarray.cpp:19
+ + + + diff --git a/d8/d38/structquery-members.html b/d8/d38/structquery-members.html new file mode 100644 index 000000000..0a6f14b86 --- /dev/null +++ b/d8/d38/structquery-members.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
query Member List
+
+
+ +

This is the complete list of members for query, including all inherited members.

+ + + + +
i (defined in query)query
l (defined in query)query
r (defined in query)query
+
+ + + + diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html new file mode 100644 index 000000000..e89c20e62 --- /dev/null +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.html @@ -0,0 +1,280 @@ + + + + + + + +Algorithms_in_C++: math/modular_inverse_fermat_little_theorem.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
modular_inverse_fermat_little_theorem.cpp File Reference
+
+
+ +

C++ Program to find the modular inverse using Fermat's Little Theorem +More...

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

+Functions

int64_t binExpo (int64_t a, int64_t b, int64_t m)
 
bool isPrime (int64_t m)
 
int main ()
 
+

Detailed Description

+

C++ Program to find the modular inverse using Fermat's Little Theorem

+

Fermat's Little Theorem state that

+\[ϕ(m) = m-1\] +

+

where \(m\) is a prime number.

+\begin{eqnarray*} a \cdot x &≡& 1 \;\text{mod}\; m\\ x &≡& a^{-1} \;\text{mod}\; m \end{eqnarray*} +

+

Using Euler's theorem we can modify the equation.

+\[ a^{ϕ(m)} ≡ 1 \;\text{mod}\; m \] +

+

(Where '^' denotes the exponent operator)

+

Here 'ϕ' is Euler's Totient Function. For modular inverse existence 'a' and 'm' must be relatively primes numbers. To apply Fermat's Little Theorem is necessary that 'm' must be a prime number. Generally in many competitive programming competitions 'm' is either 1000000007 (1e9+7) or 998244353.

+

We considered m as large prime (1e9+7). \(a^{ϕ(m)} ≡ 1 \;\text{mod}\; m\) (Using Euler's Theorem) \(ϕ(m) = m-1\) using Fermat's Little Theorem. \(a^{m-1} ≡ 1 \;\text{mod}\; m\) Now multiplying both side by \(a^{-1}\).

+\begin{eqnarray*} a^{m-1} \cdot a^{-1} &≡& a^{-1} \;\text{mod}\; m\\ a^{m-2} &≡& a^{-1} \;\text{mod}\; m \end{eqnarray*} +

+

We will find the exponent using binary exponentiation. Such that the algorithm works in \(O(\log m)\) time.

+

Examples: -

    +
  • a = 3 and m = 7
  • +
  • \(a^{-1} \;\text{mod}\; m\) is equivalent to \(a^{m-2} \;\text{mod}\; m\)
  • +
  • \(3^5 \;\text{mod}\; 7 = 243 \;\text{mod}\; 7 = 5\)
    +Hence, \(3^{-1} \;\text{mod}\; 7 = 5\) or \(3 \times 5 \;\text{mod}\; 7 = 1 \;\text{mod}\; 7\) (as \(a\times a^{-1} = 1\))
  • +
+

Function Documentation

+ +

◆ binExpo()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int64_t binExpo (int64_t a,
int64_t b,
int64_t m 
)
+
+

Recursive function to calculate exponent in \(O(\log n)\) using binary exponent.

+
52  {
+
53  a %= m;
+
54  int64_t res = 1;
+
55  while (b > 0) {
+
56  if (b % 2) {
+
57  res = res * a % m;
+
58  }
+
59  a = a * a % m;
+
60  // Dividing b by 2 is similar to right shift.
+
61  b >>= 1;
+
62  }
+
63  return res;
+
64 }
+
+
+
+ +

◆ isPrime()

+ +
+
+ + + + + + + + +
bool isPrime (int64_t m)
+
+

Prime check in \(O(\sqrt{m})\) time.

+
68  {
+
69  if (m <= 1) {
+
70  return false;
+
71  } else {
+
72  for (int64_t i = 2; i * i <= m; i++) {
+
73  if (m % i == 0) {
+
74  return false;
+
75  }
+
76  }
+
77  }
+
78  return true;
+
79 }
+
+
+
+ +

◆ main()

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

Main function

+
84  {
+
85  int64_t a, m;
+
86  // Take input of a and m.
+
87  std::cout << "Computing ((a^(-1))%(m)) using Fermat's Little Theorem";
+ +
89  std::cout << "Give input 'a' and 'm' space separated : ";
+
90  std::cin >> a >> m;
+
91  if (isPrime(m)) {
+
92  std::cout << "The modular inverse of a with mod m is (a^(m-2)) : ";
+
93  std::cout << binExpo(a, m - 2, m) << std::endl;
+
94  } else {
+
95  std::cout << "m must be a prime number.";
+ +
97  }
+
98 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
int64_t binExpo(int64_t a, int64_t b, int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:52
+
T endl(T... args)
+ +
bool isPrime(int64_t m)
Definition: modular_inverse_fermat_little_theorem.cpp:68
+ + + + diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp.js b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.js new file mode 100644 index 000000000..c9d83f270 --- /dev/null +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp.js @@ -0,0 +1,6 @@ +var modular__inverse__fermat__little__theorem_8cpp = +[ + [ "binExpo", "d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4", null ], + [ "isPrime", "d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd", null ], + [ "main", "d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..7a8e1918f --- /dev/null +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..d034c3d15 --- /dev/null +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +6d147c073aa061ad9d2b2b862712d793 \ No newline at end of file diff --git a/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..497926522 --- /dev/null +++ b/d8/d53/modular__inverse__fermat__little__theorem_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +binExpo + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node4 + + +isPrime + + + + + +Node1->Node4 + + + + + diff --git a/d8/d55/class_cycle_check-members.html b/d8/d55/class_cycle_check-members.html new file mode 100644 index 000000000..cd7390075 --- /dev/null +++ b/d8/d55/class_cycle_check-members.html @@ -0,0 +1,118 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
CycleCheck Member List
+
+
+ +

This is the complete list of members for CycleCheck, including all inherited members.

+ + + + + + + + +
in_stack enum value (defined in CycleCheck)CycleCheckprivate
isCyclicBFS(Graph const &graph)CycleCheckinlinestatic
isCyclicDFS(Graph const &graph)CycleCheckinlinestatic
isCyclicDFSHelper(AdjList const &adjList, std::vector< nodeStates > *state, unsigned int node)CycleCheckinlineprivatestatic
nodeStates enum name (defined in CycleCheck)CycleCheckprivate
not_visited enum value (defined in CycleCheck)CycleCheckprivate
visited enum value (defined in CycleCheck)CycleCheckprivate
+
+ + + + diff --git a/d8/d61/class_trie__coll__graph.map b/d8/d61/class_trie__coll__graph.map new file mode 100644 index 000000000..8e7bcf0e8 --- /dev/null +++ b/d8/d61/class_trie__coll__graph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d8/d61/class_trie__coll__graph.md5 b/d8/d61/class_trie__coll__graph.md5 new file mode 100644 index 000000000..9d1a0631b --- /dev/null +++ b/d8/d61/class_trie__coll__graph.md5 @@ -0,0 +1 @@ +55078045c550e8d22987b0668eeeda56 \ No newline at end of file diff --git a/d8/d61/class_trie__coll__graph.svg b/d8/d61/class_trie__coll__graph.svg new file mode 100644 index 000000000..ee1fbdf5f --- /dev/null +++ b/d8/d61/class_trie__coll__graph.svg @@ -0,0 +1,62 @@ + + + + + + +Trie + + + +Node1 + + +Trie + + + + + +Node2 + + +std::shared_ptr< Trie +::TrieNode > + + + + + +Node2->Node1 + + + m_root + + + +Node3 + + +Trie::TrieNode + + + + + +Node2->Node3 + + + character + + + +Node3->Node2 + + + ptr + + + diff --git a/d8/d6c/line__segment__intersection_8cpp.html b/d8/d6c/line__segment__intersection_8cpp.html new file mode 100644 index 000000000..0715e49f0 --- /dev/null +++ b/d8/d6c/line__segment__intersection_8cpp.html @@ -0,0 +1,183 @@ + + + + + + + +Algorithms_in_C++: geometry/line_segment_intersection.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
line_segment_intersection.cpp File Reference
+
+
+ +

check whether two line segments intersect each other or not. +More...

+
#include <algorithm>
+#include <iostream>
+
+Include dependency graph for line_segment_intersection.cpp:
+
+
+
+
+
+ + + + + +

+Classes

struct  Point
 
struct  SegmentIntersection
 
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

check whether two line segments intersect each other or not.

+

Function Documentation

+ +

◆ main()

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

This is the main function to test whether the algorithm is working well.

+
92  {
+
93  SegmentIntersection segment;
+
94  Point first_point, second_point, third_point, forth_point;
+
95 
+
96  std::cin >> first_point.x >> first_point.y;
+
97  std::cin >> second_point.x >> second_point.y;
+
98  std::cin >> third_point.x >> third_point.y;
+
99  std::cin >> forth_point.x >> forth_point.y;
+
100 
+
101  printf("%d", segment.intersect(first_point, second_point, third_point,
+
102  forth_point));
+
103  std::cout << std::endl;
+
104 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
+
T printf(T... args)
+ +
Definition: line_segment_intersection.cpp:22
+
T endl(T... args)
+
Definition: line_segment_intersection.cpp:12
+ + + + + diff --git a/d8/d6c/line__segment__intersection_8cpp.js b/d8/d6c/line__segment__intersection_8cpp.js new file mode 100644 index 000000000..7aeae1ce2 --- /dev/null +++ b/d8/d6c/line__segment__intersection_8cpp.js @@ -0,0 +1,6 @@ +var line__segment__intersection_8cpp = +[ + [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ], + [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], + [ "main", "d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..6da7ad474 --- /dev/null +++ b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..86a68ba5f --- /dev/null +++ b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +7b66b13cd9e906646a781de5e20f13d9 \ No newline at end of file diff --git a/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..01ecc6aea --- /dev/null +++ b/d8/d6c/line__segment__intersection_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d8/d77/namespacemachine__learning.html b/d8/d77/namespacemachine__learning.html new file mode 100644 index 000000000..7a3448d75 --- /dev/null +++ b/d8/d77/namespacemachine__learning.html @@ -0,0 +1,626 @@ + + + + + + + +Algorithms_in_C++: machine_learning Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
machine_learning Namespace Reference
+
+
+ +

Machine learning algorithms. +More...

+ + + + +

+Classes

class  adaline
 
+ + + + + + + + + + + +

+Functions

int save_u_matrix (const char *fname, const std::vector< std::vector< std::valarray< double >>> &W)
 
double update_weights (const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)
 
void kohonen_som (const std::vector< std::valarray< double >> &X, std::vector< std::vector< std::valarray< double >>> *W, double alpha_min)
 
void update_weights (const std::valarray< double > &x, std::vector< std::valarray< double >> *W, std::valarray< double > *D, double alpha, int R)
 
void kohonen_som_tracer (const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)
 
+

Detailed Description

+

Machine learning algorithms.

+

Function Documentation

+ +

◆ kohonen_som()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void machine_learning::kohonen_som (const std::vector< std::valarray< double >> & X,
std::vector< std::vector< std::valarray< double >>> * W,
double alpha_min 
)
+
+

Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given datset.

+
Parameters
+ + + + +
[in]Xdata set
[in,out]Wweights matrix
[in]alpha_minterminal value of alpha
+
+
+
261  {
+
262  int num_samples = X.size(); // number of rows
+
263  int num_features = X[0].size(); // number of columns
+
264  int num_out = W->size(); // output matrix size
+
265  int R = num_out >> 2, iter = 0;
+
266  double alpha = 1.f;
+
267 
+ +
269  for (int i = 0; i < num_out; i++) D[i] = std::valarray<double>(num_out);
+
270 
+
271  double dmin = 1.f; // average minimum distance of all samples
+
272  double past_dmin = 1.f; // average minimum distance of all samples
+
273  double dmin_ratio = 1.f; // change per step
+
274 
+
275  // Loop alpha from 1 to slpha_min
+
276  for (; alpha > 0 && dmin_ratio > 1e-5; alpha -= 1e-4, iter++) {
+
277  // Loop for each sample pattern in the data set
+
278  for (int sample = 0; sample < num_samples; sample++) {
+
279  // update weights for the current input pattern sample
+
280  dmin += update_weights(X[sample], W, &D, alpha, R);
+
281  }
+
282 
+
283  // every 100th iteration, reduce the neighborhood range
+
284  if (iter % 300 == 0 && R > 1)
+
285  R--;
+
286 
+
287  dmin /= num_samples;
+
288 
+
289  // termination condition variable -> % change in minimum distance
+
290  dmin_ratio = (past_dmin - dmin) / past_dmin;
+
291  if (dmin_ratio < 0)
+
292  dmin_ratio = 1.f;
+
293  past_dmin = dmin;
+
294 
+
295  std::cout << "iter: " << iter << "\t alpha: " << alpha << "\t R: " << R
+
296  << "\t d_min: " << dmin_ratio << "\r";
+
297  }
+
298 
+
299  std::cout << "\n";
+
300 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ kohonen_som_tracer()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void machine_learning::kohonen_som_tracer (const std::vector< std::valarray< double >> & X,
std::vector< std::valarray< double >> * W,
double alpha_min 
)
+
+

Apply incremental algorithm with updating neighborhood and learning rates on all samples in the given datset.

+
Parameters
+ + + + +
[in]Xdata set
[in,out]Wweights matrix
[in]alpha_minterminal value of alpha
+
+
+
147  {
+
148  int num_samples = X.size(); // number of rows
+
149  int num_features = X[0].size(); // number of columns
+
150  int num_out = W->size(); // number of rows
+
151  int R = num_out >> 2, iter = 0;
+
152  double alpha = 1.f;
+
153 
+
154  std::valarray<double> D(num_out);
+
155 
+
156  // Loop alpha from 1 to slpha_min
+
157  for (; alpha > alpha_min; alpha -= 0.01, iter++) {
+
158  // Loop for each sample pattern in the data set
+
159  for (int sample = 0; sample < num_samples; sample++) {
+
160  // update weights for the current input pattern sample
+
161  update_weights(X[sample], W, &D, alpha, R);
+
162  }
+
163 
+
164  // every 10th iteration, reduce the neighborhood range
+
165  if (iter % 10 == 0 && R > 1)
+
166  R--;
+
167  }
+
168 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ save_u_matrix()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int machine_learning::save_u_matrix (const char * fname,
const std::vector< std::vector< std::valarray< double >>> & W 
)
+
+

Create the distance matrix or U-matrix from the trained 3D weiths matrix and save to disk.

+
Parameters
+ + + +
[in]fnamefilename to save in (gets overwriten without confirmation)
[in]Wmodel matrix to save
+
+
+
Returns
0 if all ok
+
+-1 if file creation failed
+
134  {
+
135  std::ofstream fp(fname);
+
136  if (!fp) { // error with fopen
+
137  char msg[120];
+
138  std::snprintf(msg, sizeof(msg), "File error (%s): ", fname);
+
139  std::perror(msg);
+
140  return -1;
+
141  }
+
142 
+
143  // neighborhood range
+
144  unsigned int R = 1;
+
145 
+
146  for (int i = 0; i < W.size(); i++) { // for each x
+
147  for (int j = 0; j < W[0].size(); j++) { // for each y
+
148  double distance = 0.f;
+
149 
+
150  int from_x = std::max<int>(0, i - R);
+
151  int to_x = std::min<int>(W.size(), i + R + 1);
+
152  int from_y = std::max<int>(0, j - R);
+
153  int to_y = std::min<int>(W[0].size(), j + R + 1);
+
154  int l, m;
+
155 #ifdef _OPENMP
+
156 #pragma omp parallel for reduction(+ : distance)
+
157 #endif
+
158  for (l = from_x; l < to_x; l++) { // scan neighborhoor in x
+
159  for (m = from_y; m < to_y; m++) { // scan neighborhood in y
+
160  auto d = W[i][j] - W[l][m];
+
161  double d2 = std::pow(d, 2).sum();
+
162  distance += std::sqrt(d2);
+
163  // distance += d2;
+
164  }
+
165  }
+
166 
+
167  distance /= R * R; // mean distance from neighbors
+
168  fp << distance; // print the mean separation
+
169  if (j < W[0].size() - 1) { // if not the last column
+
170  fp << ','; // suffix comma
+
171  }
+
172  }
+
173  if (i < W.size() - 1) // if not the last row
+
174  fp << '\n'; // start a new line
+
175  }
+
176 
+
177  fp.close();
+
178  return 0;
+
179 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ update_weights() [1/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void machine_learning::update_weights (const std::valarray< double > & x,
std::vector< std::valarray< double >> * W,
std::valarray< double > * D,
double alpha,
int R 
)
+
+

Update weights of the SOM using Kohonen algorithm

+
Parameters
+ + + + + + +
[in]Xdata point
[in,out]Wweights matrix
[in,out]Dtemporary vector to store distances
[in]alphalearning rate \(0<\alpha\le1\)
[in]Rneighborhood range
+
+
+
102  {
+
103  int j, k;
+
104  int num_out = W->size(); // number of SOM output nodes
+
105  int num_features = x.size(); // number of data features
+
106 
+
107 #ifdef _OPENMP
+
108 #pragma omp for
+
109 #endif
+
110  // step 1: for each output point
+
111  for (j = 0; j < num_out; j++) {
+
112  // compute Euclidian distance of each output
+
113  // point from the current sample
+
114  (*D)[j] = (((*W)[j] - x) * ((*W)[j] - x)).sum();
+
115  }
+
116 
+
117  // step 2: get closest node i.e., node with snallest Euclidian distance to
+
118  // the current pattern
+
119  auto result = std::min_element(std::begin(*D), std::end(*D));
+
120  double d_min = *result;
+
121  int d_min_idx = std::distance(std::begin(*D), result);
+
122 
+
123  // step 3a: get the neighborhood range
+
124  int from_node = std::max(0, d_min_idx - R);
+
125  int to_node = std::min(num_out, d_min_idx + R + 1);
+
126 
+
127  // step 3b: update the weights of nodes in the
+
128  // neighborhood
+
129 #ifdef _OPENMP
+
130 #pragma omp for
+
131 #endif
+
132  for (j = from_node; j < to_node; j++)
+
133  // update weights of nodes in the neighborhood
+
134  (*W)[j] += alpha * (x - (*W)[j]);
+
135 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ update_weights() [2/2]

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
double machine_learning::update_weights (const std::valarray< double > & X,
std::vector< std::vector< std::valarray< double >>> * W,
std::vector< std::valarray< double >> * D,
double alpha,
int R 
)
+
+

Update weights of the SOM using Kohonen algorithm

+
Parameters
+ + + + + + +
[in]Xdata point - N features
[in,out]Wweights matrix - PxQxN
[in,out]Dtemporary vector to store distances PxQ
[in]alphalearning rate \(0<\alpha\le1\)
[in]Rneighborhood range
+
+
+
Returns
minimum distance of sample and trained weights
+
194  {
+
195  int x, y;
+
196  int num_out_x = static_cast<int>(W->size()); // output nodes - in X
+
197  int num_out_y = static_cast<int>(W[0][0].size()); // output nodes - in Y
+
198  int num_features = static_cast<int>(W[0][0][0].size()); // features = in Z
+
199  double d_min = 0.f;
+
200 
+
201 #ifdef _OPENMP
+
202 #pragma omp for
+
203 #endif
+
204  // step 1: for each output point
+
205  for (x = 0; x < num_out_x; x++) {
+
206  for (y = 0; y < num_out_y; y++) {
+
207  (*D)[x][y] = 0.f;
+
208  // compute Euclidian distance of each output
+
209  // point from the current sample
+
210  auto d = ((*W)[x][y] - X);
+
211  (*D)[x][y] = (d * d).sum();
+
212  (*D)[x][y] = std::sqrt((*D)[x][y]);
+
213  }
+
214  }
+
215 
+
216  // step 2: get closest node i.e., node with snallest Euclidian distance
+
217  // to the current pattern
+
218  int d_min_x, d_min_y;
+
219  get_min_2d(*D, &d_min, &d_min_x, &d_min_y);
+
220 
+
221  // step 3a: get the neighborhood range
+
222  int from_x = std::max(0, d_min_x - R);
+
223  int to_x = std::min(num_out_x, d_min_x + R + 1);
+
224  int from_y = std::max(0, d_min_y - R);
+
225  int to_y = std::min(num_out_y, d_min_y + R + 1);
+
226 
+
227  // step 3b: update the weights of nodes in the
+
228  // neighborhood
+
229 #ifdef _OPENMP
+
230 #pragma omp for
+
231 #endif
+
232  for (x = from_x; x < to_x; x++) {
+
233  for (y = from_y; y < to_y; y++) {
+
234  /* you can enable the following normalization if needed.
+
235  personally, I found it detrimental to convergence */
+
236  // const double s2pi = sqrt(2.f * M_PI);
+
237  // double normalize = 1.f / (alpha * s2pi);
+
238 
+
239  /* apply scaling inversely proportional to distance from the
+
240  current node */
+
241  double d2 =
+
242  (d_min_x - x) * (d_min_x - x) + (d_min_y - y) * (d_min_y - y);
+
243  double scale_factor = std::exp(-d2 / (2.f * alpha * alpha));
+
244 
+
245  (*W)[x][y] += (X - (*W)[x][y]) * alpha * scale_factor;
+
246  }
+
247  }
+
248  return d_min;
+
249 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+
void update_weights(const std::valarray< double > &x, std::vector< std::valarray< double >> *W, std::valarray< double > *D, double alpha, int R)
Definition: kohonen_som_trace.cpp:100
+
STL class.
+
T size(T... args)
+
T distance(T... args)
+
double update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)
Definition: kohonen_som_topology.cpp:191
+
void get_min_2d(const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx)
Definition: kohonen_som_topology.cpp:97
+
T sqrt(T... args)
+
T snprintf(T... args)
+ +
STL class.
+
ll k
Definition: matrix_exponentiation.cpp:48
+
T min_element(T... args)
+
T perror(T... args)
+
STL class.
+
T min(T... args)
+
T exp(T... args)
+
T begin(T... args)
+
T end(T... args)
+
T max(T... args)
+
T pow(T... args)
+ + + + diff --git a/d8/d77/namespacemachine__learning.js b/d8/d77/namespacemachine__learning.js new file mode 100644 index 000000000..3e13ccbee --- /dev/null +++ b/d8/d77/namespacemachine__learning.js @@ -0,0 +1,4 @@ +var namespacemachine__learning = +[ + [ "adaline", "d6/d30/classmachine__learning_1_1adaline.html", "d6/d30/classmachine__learning_1_1adaline" ] +]; \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.map b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.map new file mode 100644 index 000000000..4b0729cda --- /dev/null +++ b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.md5 b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.md5 new file mode 100644 index 000000000..029a8d809 --- /dev/null +++ b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.md5 @@ -0,0 +1 @@ +45183b2b0fef8fa06469ab0e321c628d \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.svg b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.svg new file mode 100644 index 000000000..6a1eda3a9 --- /dev/null +++ b/d8/d77/namespacemachine__learning_a1d577f5d95b774ae97eb6838852d0df5_cgraph.svg @@ -0,0 +1,98 @@ + + + + + + +machine_learning::save_u_matrix + + + +Node1 + + +machine_learning::save +_u_matrix + + + + + +Node2 + + +std::ofstream::close + + + + + +Node1->Node2 + + + + + +Node3 + + +std::perror + + + + + +Node1->Node3 + + + + + +Node4 + + +std::pow + + + + + +Node1->Node4 + + + + + +Node5 + + +std::snprintf + + + + + +Node1->Node5 + + + + + +Node6 + + +std::sqrt + + + + + +Node1->Node6 + + + + + diff --git a/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.map b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.map new file mode 100644 index 000000000..38eb4c37b --- /dev/null +++ b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.md5 b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.md5 new file mode 100644 index 000000000..13cd9ef9c --- /dev/null +++ b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.md5 @@ -0,0 +1 @@ +ed493e1a4a07814d02bc38c450f202a4 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.svg b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.svg new file mode 100644 index 000000000..72182376a --- /dev/null +++ b/d8/d77/namespacemachine__learning_a361674452869413536ee501f053129a8_cgraph.svg @@ -0,0 +1,113 @@ + + + + + + +machine_learning::update_weights + + + +Node1 + + +machine_learning::update +_weights + + + + + +Node2 + + +std::begin + + + + + +Node1->Node2 + + + + + +Node3 + + +std::distance + + + + + +Node1->Node3 + + + + + +Node4 + + +std::end + + + + + +Node1->Node4 + + + + + +Node5 + + +std::max + + + + + +Node1->Node5 + + + + + +Node6 + + +std::min + + + + + +Node1->Node6 + + + + + +Node7 + + +std::min_element + + + + + +Node1->Node7 + + + + + diff --git a/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map new file mode 100644 index 000000000..e401ec294 --- /dev/null +++ b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5 b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5 new file mode 100644 index 000000000..990c858cf --- /dev/null +++ b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.md5 @@ -0,0 +1 @@ +745cd27ee4af204db9bd55e95dbe0829 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg new file mode 100644 index 000000000..dcecabb24 --- /dev/null +++ b/d8/d77/namespacemachine__learning_ac4010fe3a52a74e8b5b1aaadfe38b46f_cgraph.svg @@ -0,0 +1,158 @@ + + + + + + +machine_learning::update_weights + + + +Node1 + + +machine_learning::update +_weights + + + + + +Node2 + + +std::exp + + + + + +Node1->Node2 + + + + + +Node3 + + +get_min_2d + + + + + +Node1->Node3 + + + + + +Node8 + + +std::max + + + + + +Node1->Node8 + + + + + +Node9 + + +std::min + + + + + +Node1->Node9 + + + + + +Node10 + + +std::sqrt + + + + + +Node1->Node10 + + + + + +Node4 + + +std::begin + + + + + +Node3->Node4 + + + + + +Node5 + + +std::distance + + + + + +Node3->Node5 + + + + + +Node6 + + +std::end + + + + + +Node3->Node6 + + + + + +Node7 + + +std::min_element + + + + + +Node3->Node7 + + + + + diff --git a/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.map b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.map new file mode 100644 index 000000000..b44f92931 --- /dev/null +++ b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.map @@ -0,0 +1,13 @@ + + + + + + + + + + + + + diff --git a/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.md5 b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.md5 new file mode 100644 index 000000000..a7fee8189 --- /dev/null +++ b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.md5 @@ -0,0 +1 @@ +cce5a96e39b75c6843cbd82344be3fa3 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.svg b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.svg new file mode 100644 index 000000000..84234f758 --- /dev/null +++ b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph.svg @@ -0,0 +1,262 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +machine_learning::kohonen_som_tracer + + + +Node1 + + +machine_learning::kohonen +_som_tracer + + + + + +Node2 + + +machine_learning::update +_weights + + + + + +Node1->Node2 + + + + + +Node3 + + +std::exp + + + + + +Node2->Node3 + + + + + +Node4 + + +get_min_2d + + + + + +Node2->Node4 + + + + + +Node9 + + +std::max + + + + + +Node2->Node9 + + + + + +Node10 + + +std::min + + + + + +Node2->Node10 + + + + + +Node11 + + +std::sqrt + + + + + +Node2->Node11 + + + + + +Node5 + + +std::begin + + + + + +Node4->Node5 + + + + + +Node6 + + +std::distance + + + + + +Node4->Node6 + + + + + +Node7 + + +std::end + + + + + +Node4->Node7 + + + + + +Node8 + + +std::min_element + + + + + +Node4->Node8 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph_org.svg b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph_org.svg new file mode 100644 index 000000000..1efe4207d --- /dev/null +++ b/d8/d77/namespacemachine__learning_acc6a28f40512dbda75ab1a3969248898_cgraph_org.svg @@ -0,0 +1,174 @@ + + + + + + +machine_learning::kohonen_som_tracer + + + +Node1 + + +machine_learning::kohonen +_som_tracer + + + + + +Node2 + + +machine_learning::update +_weights + + + + + +Node1->Node2 + + + + + +Node3 + + +std::exp + + + + + +Node2->Node3 + + + + + +Node4 + + +get_min_2d + + + + + +Node2->Node4 + + + + + +Node9 + + +std::max + + + + + +Node2->Node9 + + + + + +Node10 + + +std::min + + + + + +Node2->Node10 + + + + + +Node11 + + +std::sqrt + + + + + +Node2->Node11 + + + + + +Node5 + + +std::begin + + + + + +Node4->Node5 + + + + + +Node6 + + +std::distance + + + + + +Node4->Node6 + + + + + +Node7 + + +std::end + + + + + +Node4->Node7 + + + + + +Node8 + + +std::min_element + + + + + +Node4->Node8 + + + + + diff --git a/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.map b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.map new file mode 100644 index 000000000..78137ffac --- /dev/null +++ b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.map @@ -0,0 +1,13 @@ + + + + + + + + + + + + + diff --git a/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.md5 b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.md5 new file mode 100644 index 000000000..c0d7c2599 --- /dev/null +++ b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.md5 @@ -0,0 +1 @@ +a59dc7902a4c1fd45aae7ab506a40101 \ No newline at end of file diff --git a/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.svg b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.svg new file mode 100644 index 000000000..a22cd6273 --- /dev/null +++ b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph.svg @@ -0,0 +1,261 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +machine_learning::kohonen_som + + + +Node1 + + +machine_learning::kohonen_som + + + + + +Node2 + + +machine_learning::update +_weights + + + + + +Node1->Node2 + + + + + +Node3 + + +std::exp + + + + + +Node2->Node3 + + + + + +Node4 + + +get_min_2d + + + + + +Node2->Node4 + + + + + +Node9 + + +std::max + + + + + +Node2->Node9 + + + + + +Node10 + + +std::min + + + + + +Node2->Node10 + + + + + +Node11 + + +std::sqrt + + + + + +Node2->Node11 + + + + + +Node5 + + +std::begin + + + + + +Node4->Node5 + + + + + +Node6 + + +std::distance + + + + + +Node4->Node6 + + + + + +Node7 + + +std::end + + + + + +Node4->Node7 + + + + + +Node8 + + +std::min_element + + + + + +Node4->Node8 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph_org.svg b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph_org.svg new file mode 100644 index 000000000..6ff953295 --- /dev/null +++ b/d8/d77/namespacemachine__learning_adc731720947b4bc2ab047c141e7d0299_cgraph_org.svg @@ -0,0 +1,173 @@ + + + + + + +machine_learning::kohonen_som + + + +Node1 + + +machine_learning::kohonen_som + + + + + +Node2 + + +machine_learning::update +_weights + + + + + +Node1->Node2 + + + + + +Node3 + + +std::exp + + + + + +Node2->Node3 + + + + + +Node4 + + +get_min_2d + + + + + +Node2->Node4 + + + + + +Node9 + + +std::max + + + + + +Node2->Node9 + + + + + +Node10 + + +std::min + + + + + +Node2->Node10 + + + + + +Node11 + + +std::sqrt + + + + + +Node2->Node11 + + + + + +Node5 + + +std::begin + + + + + +Node4->Node5 + + + + + +Node6 + + +std::distance + + + + + +Node4->Node6 + + + + + +Node7 + + +std::end + + + + + +Node4->Node7 + + + + + +Node8 + + +std::min_element + + + + + +Node4->Node8 + + + + + diff --git a/d8/d8a/exponential__search_8cpp.html b/d8/d8a/exponential__search_8cpp.html new file mode 100644 index 000000000..de13c68ef --- /dev/null +++ b/d8/d8a/exponential__search_8cpp.html @@ -0,0 +1,304 @@ + + + + + + + +Algorithms_in_C++: search/exponential_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
exponential_search.cpp File Reference
+
+
+ +

Exponential search algorithm +More...

+
#include <cassert>
+#include <cmath>
+#include <iostream>
+#include <cstring>
+
+Include dependency graph for exponential_search.cpp:
+
+
+
+
+
+ + + + + + + + + +

+Functions

template<class Type >
Type * binary_s (Type *array, size_t size, Type key)
 
template<class Type >
Type * struzik_search (Type *array, size_t size, Type key)
 
int main ()
 
+

Detailed Description

+

Exponential search algorithm

+ +

The algorithm try to search the range where the key should be. If it has been found we do a binary search there. The range of the search grows by exponential every time. If the key is larger than the last element of array, the start of block(block_front) will be equal to the end of block(block_size) and the algorithm return null ponter, every other cases the algoritm return fom the loop.

+

Function Documentation

+ +

◆ binary_s()

+ +
+
+
+template<class Type >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
Type* binary_s (Type * array,
size_t size,
Type key 
)
+
+inline
+
+

Binary Search Algorithm (used by struzik_search)
+

    +
  • Time Complexity O(log n) where 'n' is the number of elements
  • +
  • Worst Time Complexity O(log n)
  • +
  • Best Time Complexity Ω(1)
  • +
  • Space Complexity O(1)
  • +
  • Auxiliary Space Complexity O(1)
    Returns
    pointer to value in the array
    +
    +nullptr if value not found
    +
  • +
+
34  {
+
35  int32_t lower_index(0), upper_index(size - 1), middle_index;
+
36 
+
37  while (lower_index <= upper_index) {
+
38  middle_index = std::floor((lower_index + upper_index) / 2);
+
39 
+
40  if (*(array + middle_index) < key)
+
41  lower_index = (middle_index + 1);
+
42  else if (*(array + middle_index) > key)
+
43  upper_index = (middle_index - 1);
+
44  else
+
45  return (array + middle_index);
+
46  }
+
47 
+
48  return nullptr;
+
49 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main function

+
74  {
+
75  // TEST CASES
+
76  int* sorted_array = new int[7]{7, 10, 15, 23, 70, 105, 203};
+
77  assert(struzik_search<int>(sorted_array, 7, 0) == nullptr);
+
78  assert(struzik_search<int>(sorted_array, 7, 1000) == nullptr);
+
79  assert(struzik_search<int>(sorted_array, 7, 50) == nullptr);
+
80  assert(struzik_search<int>(sorted_array, 7, 7) == sorted_array);
+
81  // TEST CASES
+
82  delete[] sorted_array;
+
83  return 0;
+
84 }
+
+
+
+ +

◆ struzik_search()

+ +
+
+
+template<class Type >
+ + + + + + + + + + + + + + + + + + + + + + + + +
Type* struzik_search (Type * array,
size_t size,
Type key 
)
+
+

Struzik Search Algorithm(Exponential)

    +
  • Time Complexity O(log i) where i is the position of search key in the list
  • +
  • Worst Time Complexity O(log i)
  • +
  • Best Time Complexity Ω(1)
  • +
  • Space Complexity O(1)
  • +
  • Auxiliary Space Complexity O(1)
  • +
+
59  {
+
60  uint32_t block_front(0), block_size = size == 0 ? 0 : 1;
+
61  while (block_front != block_size) {
+
62  if (*(array + block_size - 1) < key) {
+
63  block_front = block_size;
+
64  (block_size * 2 - 1 < size) ? (block_size *= 2) : block_size = size;
+
65  continue;
+
66  }
+
67  return binary_s<Type>(array + block_front, (block_size - block_front),
+
68  key);
+
69  }
+
70  return nullptr;
+
71 }
+
+
+
+
+
+
T floor(T... args)
+ + + + diff --git a/d8/d8a/exponential__search_8cpp.js b/d8/d8a/exponential__search_8cpp.js new file mode 100644 index 000000000..0c0aa7819 --- /dev/null +++ b/d8/d8a/exponential__search_8cpp.js @@ -0,0 +1,6 @@ +var exponential__search_8cpp = +[ + [ "binary_s", "d8/d8a/exponential__search_8cpp.html#a0f697e2a3b5193324ab84bd4045088f7", null ], + [ "main", "d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "struzik_search", "d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d", null ] +]; \ No newline at end of file diff --git a/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.map b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.map new file mode 100644 index 000000000..a14d21e6c --- /dev/null +++ b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.md5 b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.md5 new file mode 100644 index 000000000..d6913869c --- /dev/null +++ b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.md5 @@ -0,0 +1 @@ +425710bf52e8fe2151fcea2c313b3694 \ No newline at end of file diff --git a/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.svg b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.svg new file mode 100644 index 000000000..594c60ace --- /dev/null +++ b/d8/d8a/exponential__search_8cpp_a0f697e2a3b5193324ab84bd4045088f7_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +binary_s + + + +Node1 + + +binary_s + + + + + +Node2 + + +std::floor + + + + + +Node1->Node2 + + + + + diff --git a/d8/d8e/struct_node-members.html b/d8/d8e/struct_node-members.html new file mode 100644 index 000000000..17c7612b2 --- /dev/null +++ b/d8/d8e/struct_node-members.html @@ -0,0 +1,117 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Node Member List
+
+
+ +

This is the complete list of members for Node, including all inherited members.

+ + + + + + + +
data (defined in Node)Node
next (defined in Node)Node
next (defined in Node)Node
next (defined in Node)Node
Node(int v, Node *n) (defined in Node)Nodeinline
val (defined in Node)Node
+
+ + + + diff --git a/d8/d9b/classgraph-members.html b/d8/d9b/classgraph-members.html new file mode 100644 index 000000000..c6cf7c9a5 --- /dev/null +++ b/d8/d9b/classgraph-members.html @@ -0,0 +1,124 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
graph Member List
+
+
+ +

This is the complete list of members for graph, including all inherited members.

+ + + + + + + + + + + + + + +
addedge(int src, int dest) (defined in graph)graph
addEdge(int, int) (defined in graph)graph
adj (defined in graph)graphprivate
adj (defined in graph)graphprivate
bfs(int s) (defined in graph)graph
connected_components (defined in graph)graphprivate
depth_first_search() (defined in graph)graphprivate
explore(int, vector< bool > &) (defined in graph)graphprivate
getConnectedComponents() (defined in graph)graphinline
graph(int v) (defined in graph)graph
graph(int n) (defined in graph)graphinlineexplicit
printgraph() (defined in graph)graph
v (defined in graph)graphprivate
+
+ + + + diff --git a/d8/dab/classstatistics_1_1stats__computer2.html b/d8/dab/classstatistics_1_1stats__computer2.html new file mode 100644 index 000000000..abc3024c3 --- /dev/null +++ b/d8/dab/classstatistics_1_1stats__computer2.html @@ -0,0 +1,339 @@ + + + + + + + +Algorithms_in_C++: statistics::stats_computer2< T > Class Template Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
statistics::stats_computer2< T > Class Template Reference
+
+
+ + + + + + + + + + +

+Public Member Functions

void new_val (T x)
 
double mean () const
 
double variance () const
 
double std () const
 
+ + + + + + + + + +

+Private Attributes

+unsigned int n = 0
 
+double mu = 0
 
+double var = 0
 
+double M = 0
 
+ + + +

+Friends

std::istreamoperator>> (std::istream &input, stats_computer2 &stat)
 
+

Detailed Description

+

template<typename T>
+class statistics::stats_computer2< T >

+ +

continuous mean and variance computance using Welford's algorithm (very accurate)

+

Member Function Documentation

+ +

◆ mean()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
double statistics::stats_computer2< T >::mean () const
+
+inline
+
+

return sample mean computed till last sample

+
86 { return mu; }
+
+
+
+ +

◆ new_val()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
void statistics::stats_computer2< T >::new_val (x)
+
+inline
+
+

Constructor

Parameters
+ + +
[in]xnew data sample
+
+
+
77  {
+
78  n++;
+
79  double delta = x - mu;
+
80  mu += delta / n;
+
81  double delta2 = x - mu;
+
82  M += delta * delta2;
+
83  }
+
+
+
+ +

◆ std()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
double statistics::stats_computer2< T >::std () const
+
+inline
+
+

return sample standard deviation computed till last sample

+
92 { return std::sqrt(this->variance()); }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ variance()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + +
double statistics::stats_computer2< T >::variance () const
+
+inline
+
+

return data variance computed till last sample

+
89 { return M / n; }
+
+
+
+

Friends And Related Function Documentation

+ +

◆ operator>>

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
std::istream& operator>> (std::istreaminput,
stats_computer2< T > & stat 
)
+
+friend
+
+

short-hand operator to read new sample from input stream
+ e.g.: std::cin >> stats1;

+
98  {
+
99  T val;
+
100  input >> val;
+
101  stat.new_val(val);
+
102  return input;
+
103  }
+
+
+
+
The documentation for this class was generated from the following file: +
+
+
T sqrt(T... args)
+
double variance() const
Definition: realtime_stats.cpp:89
+
void new_val(T x)
Definition: realtime_stats.cpp:77
+ + + + diff --git a/d8/dab/classstatistics_1_1stats__computer2.js b/d8/dab/classstatistics_1_1stats__computer2.js new file mode 100644 index 000000000..2e3c9679b --- /dev/null +++ b/d8/dab/classstatistics_1_1stats__computer2.js @@ -0,0 +1,12 @@ +var classstatistics_1_1stats__computer2 = +[ + [ "mean", "d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e", null ], + [ "new_val", "d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534", null ], + [ "std", "d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e", null ], + [ "variance", "d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555", null ], + [ "operator>>", "d8/dab/classstatistics_1_1stats__computer2.html#a7e7a1a2b0a03df0a70cac40d193421d2", null ], + [ "M", "d8/dab/classstatistics_1_1stats__computer2.html#a8daf58bdecd775b8a83ce9ad70c014c4", null ], + [ "mu", "d8/dab/classstatistics_1_1stats__computer2.html#a0acea0729769f430f2dc56260d179745", null ], + [ "n", "d8/dab/classstatistics_1_1stats__computer2.html#a80099005c6e5f9569b75da0e49b14cf6", null ], + [ "var", "d8/dab/classstatistics_1_1stats__computer2.html#ae1bfd81bd7bbbd4b0d51d7d956e532d2", null ] +]; \ No newline at end of file diff --git a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map new file mode 100644 index 000000000..dd669afee --- /dev/null +++ b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5 b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5 new file mode 100644 index 000000000..7471fbbba --- /dev/null +++ b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.md5 @@ -0,0 +1 @@ +3b0c87070f2a479b0ed844a0d90ef929 \ No newline at end of file diff --git a/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg new file mode 100644 index 000000000..f72c1d80d --- /dev/null +++ b/d8/dab/classstatistics_1_1stats__computer2_acf2e84df4fc386bb3295016ef8fd156e_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +statistics::stats_computer2::std + + + +Node1 + + +statistics::stats_computer2::std + + + + + +Node2 + + +std::sqrt + + + + + +Node1->Node2 + + + + + +Node3 + + +statistics::stats_computer2 +::variance + + + + + +Node1->Node3 + + + + + diff --git a/d8/db9/structcompare-members.html b/d8/db9/structcompare-members.html new file mode 100644 index 000000000..9e6340fa5 --- /dev/null +++ b/d8/db9/structcompare-members.html @@ -0,0 +1,112 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
compare Member List
+
+
+ +

This is the complete list of members for compare, including all inherited members.

+ + +
operator()(MinHeapNode *l, MinHeapNode *r) (defined in compare)compareinline
+
+ + + + diff --git a/d8/dc8/struct_point.html b/d8/dc8/struct_point.html new file mode 100644 index 000000000..2e5d97c49 --- /dev/null +++ b/d8/dc8/struct_point.html @@ -0,0 +1,221 @@ + + + + + + + +Algorithms_in_C++: Point Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
Point Struct Reference
+
+
+ + + + +

+Public Member Functions

 Point (double a=0.f, double b=0.f)
 
+ + + + + + + + + + +

+Public Attributes

+int x
 
+int y
 Point respect to x coordinate.
 
double x
 
double y
 
+

Detailed Description

+

Define a Point.

+

Define a point

+

Constructor & Destructor Documentation

+ +

◆ Point()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Point::Point (double a = 0.f,
double b = 0.f 
)
+
+inlineexplicit
+
+

construct a point

Parameters
+ + + +
[in]aabsicca (default = 0.0)
[in]bordinate (default = 0.0)
+
+
+
23  {
+
24  x = a;
+
25  y = b;
+
26  }
+
+
+
+

Member Data Documentation

+ +

◆ x

+ +
+
+ + + + +
double Point::x
+
+

abscissa

+ +
+
+ +

◆ y

+ +
+
+ + + + +
double Point::y
+
+

ordinate

+ +
+
+
The documentation for this struct was generated from the following files: +
+
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+ + + + diff --git a/d8/dc8/struct_point.js b/d8/dc8/struct_point.js new file mode 100644 index 000000000..14ace42c9 --- /dev/null +++ b/d8/dc8/struct_point.js @@ -0,0 +1,8 @@ +var struct_point = +[ + [ "Point", "d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a", null ], + [ "x", "d8/dc8/struct_point.html#a8c779e11e694b20e0946105a9f5de842", null ], + [ "x", "d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7", null ], + [ "y", "d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7", null ], + [ "y", "d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8", null ] +]; \ No newline at end of file diff --git a/d8/dcc/namespacestd.html b/d8/dcc/namespacestd.html new file mode 100644 index 000000000..aba5e8e0f --- /dev/null +++ b/d8/dcc/namespacestd.html @@ -0,0 +1,2734 @@ + + + + + + + +Algorithms_in_C++: std Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
std Namespace Reference
+
+
+ +

STL namespace. +More...

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Classes

class  add_const
 
class  add_cv
 
class  add_lvalue_reference
 
class  add_pointer
 
class  add_rvalue_reference
 
class  add_volatile
 
class  adopt_lock_t
 
class  aligned_storage
 
class  aligned_union
 
class  alignment_of
 
class  allocator
 STL class.
 
class  allocator_arg_t
 
class  allocator_traits
 
class  array
 STL class.
 
class  atomic
 STL class.
 
class  atomic_flag
 
class  atomic_ref
 STL class.
 
class  auto_ptr
 STL class.
 
class  back_insert_iterator
 
class  bad_alloc
 STL class.
 
class  bad_array_length
 
class  bad_array_new_length
 
class  bad_cast
 STL class.
 
class  bad_exception
 STL class.
 
class  bad_function_call
 
class  bad_optional_access
 
class  bad_typeid
 STL class.
 
class  bad_weak_ptr
 
class  basic_filebuf
 
class  basic_fstream
 STL class.
 
class  basic_ifstream
 STL class.
 
class  basic_ios
 STL class.
 
class  basic_iostream
 STL class.
 
class  basic_istream
 STL class.
 
class  basic_istringstream
 STL class.
 
class  basic_ofstream
 STL class.
 
class  basic_ostream
 STL class.
 
class  basic_ostringstream
 STL class.
 
class  basic_regex
 
class  basic_streambuf
 
class  basic_string
 STL class.
 
class  basic_string_view
 STL class.
 
class  basic_stringbuf
 
class  basic_stringstream
 STL class.
 
class  bernoulli_distribution
 
class  bidirectional_iterator_tag
 
class  binary_function
 
class  binary_negate
 
class  binomial_distribution
 
class  bit_and
 
class  bit_not
 
class  bit_or
 
class  bitset
 STL class.
 
class  cauchy_distribution
 
class  centi
 
class  cerr
 
class  char_traits
 
class  chi_squared_distribution
 
class  cin
 
class  clock_t
 
class  clog
 
class  cmatch
 
class  codecvt
 
class  codecvt_base
 
class  codecvt_byname
 
class  codecvt_utf16
 
class  codecvt_utf8
 
class  codecvt_utf8_utf16
 
class  collate
 
class  collate_byname
 
class  common_type
 
class  complex
 STL class.
 
class  condition_variable
 
class  condition_variable_any
 
class  conditional
 
class  cout
 
class  cregex_iterator
 
class  cregex_token_iterator
 
class  csub_match
 
class  ctype
 
class  ctype_base
 
class  ctype_byname
 
class  deca
 
class  decay
 
class  deci
 
class  default_delete
 
class  default_random_engine
 
class  defer_lock_t
 
class  deque
 STL class.
 
class  discard_block_engine
 
class  discrete_distribution
 
class  divides
 
class  domain_error
 STL class.
 
class  dynarray
 
class  enable_if
 
class  enable_shared_from_this
 
class  equal_to
 
class  errc
 
class  error_category
 STL class.
 
class  error_code
 STL class.
 
class  error_condition
 STL class.
 
class  exa
 
class  exception
 STL class.
 
class  exception_ptr
 
class  exponential_distribution
 
class  extent
 
class  extreme_value_distribution
 
class  false_type
 
class  femto
 
class  FILE
 
class  filebuf
 
class  fisher_f_distribution
 
class  forward_iterator_tag
 
class  forward_list
 STL class.
 
class  fpos
 
class  fpos_t
 
class  front_insert_iterator
 
class  fstream
 STL class.
 
class  function
 
class  future
 
class  future_error
 
class  gamma_distribution
 
class  geometric_distribution
 
class  giga
 
class  greater
 
class  greater_equal
 
class  has_virtual_destructor
 
class  hash
 
class  hecto
 
class  ifstream
 STL class.
 
class  independent_bits_engine
 
class  initializer_list
 
class  input_iterator_tag
 
class  insert_iterator
 
class  int16_t
 
class  int32_t
 
class  int64_t
 
class  int8_t
 
class  int_fast16_t
 
class  int_fast32_t
 
class  int_fast64_t
 
class  int_fast8_t
 
class  int_least16_t
 
class  int_least32_t
 
class  int_least64_t
 
class  int_least8_t
 
class  integer_sequence
 
class  integral_constant
 
class  intmax_t
 
class  intptr_t
 
class  invalid_argument
 STL class.
 
class  ios
 STL class.
 
class  ios_base
 STL class.
 
class  iostream
 
class  is_abstract
 
class  is_arithmetic
 
class  is_array
 
class  is_assignable
 
class  is_base_of
 
class  is_bind_expression
 
class  is_class
 
class  is_compound
 
class  is_const
 
class  is_constructible
 
class  is_convertible
 
class  is_copy_assignable
 
class  is_copy_constructible
 
class  is_default_constructible
 
class  is_destructible
 
class  is_empty
 
class  is_enum
 
class  is_error_code_enum
 
class  is_error_condition_enum
 
class  is_floating_point
 
class  is_function
 
class  is_fundamental
 
class  is_integral
 
class  is_literal_type
 
class  is_lvalue_reference
 
class  is_member_function_pointer
 
class  is_member_object_pointer
 
class  is_member_pointer
 
class  is_move_assignable
 
class  is_move_constructible
 
class  is_nothrow_assignable
 
class  is_nothrow_constructible
 
class  is_nothrow_copy_assignable
 
class  is_nothrow_copy_constructible
 
class  is_nothrow_default_constructible
 
class  is_nothrow_destructible
 
class  is_nothrow_move_assignable
 
class  is_nothrow_move_constructible
 
class  is_object
 
class  is_placeholder
 
class  is_pod
 
class  is_pointer
 
class  is_polymorphic
 
class  is_reference
 
class  is_rvalue_reference
 
class  is_same
 
class  is_scalar
 
class  is_signed
 
class  is_standard_layout
 
class  is_trivial
 
class  is_trivially_assignable
 
class  is_trivially_constructible
 
class  is_trivially_copy_assignable
 
class  is_trivially_copy_constructible
 
class  is_trivially_copyable
 
class  is_trivially_default_constructible
 
class  is_trivially_destructible
 
class  is_trivially_move_assignable
 
class  is_trivially_move_constructible
 
class  is_union
 
class  is_unsigned
 
class  is_void
 
class  is_volatile
 
class  istream
 STL class.
 
class  istream_iterator
 
class  istreambuf_iterator
 
class  istringstream
 STL class.
 
class  istrstream
 
class  iterator
 
class  iterator_traits
 
class  jmp_buf
 
class  jthread
 STL class.
 
class  kilo
 
class  knuth_b
 
class  lconv
 
class  length_error
 STL class.
 
class  less
 
class  less_equal
 
class  linear_congruential_engine
 
class  list
 STL class.
 
class  locale
 
class  lock_guard
 STL class.
 
class  logic_error
 STL class.
 
class  logical_and
 
class  logical_not
 
class  logical_or
 
class  lognormal_distribution
 
class  make_signed
 
class  make_unsigned
 
class  map
 STL class.
 
class  match_results
 
class  max_align_t
 
class  mbstate_t
 
class  mega
 
class  mersenne_twister_engine
 
class  messages
 
class  messages_base
 
class  messages_byname
 
class  micro
 
class  milli
 
class  minstd_rand
 
class  minstd_rand0
 
class  minus
 
class  modulus
 
class  money_base
 
class  money_get
 
class  money_put
 
class  moneypunct
 
class  moneypunct_byname
 
class  move_iterator
 
class  mt19937
 
class  mt19937_64
 
class  multimap
 STL class.
 
class  multiplies
 
class  multiset
 STL class.
 
class  mutex
 STL class.
 
class  nano
 
class  negate
 
class  negative_binomial_distribution
 
class  nested_exception
 
class  new_handler
 
class  normal_distribution
 
class  not_equal_to
 
class  nothrow_t
 
class  nullptr_t
 
class  num_get
 
class  num_put
 
class  numeric_limits
 
class  numpunct
 
class  numpunct_byname
 
class  ofstream
 STL class.
 
class  once_flag
 
class  ostream
 STL class.
 
class  ostream_iterator
 
class  ostreambuf_iterator
 
class  ostringstream
 STL class.
 
class  ostrstream
 
class  out_of_range
 STL class.
 
class  output_iterator_tag
 
class  overflow_error
 STL class.
 
class  owner_less
 
class  packaged_task
 
class  pair
 
class  peta
 
class  pico
 
class  piecewise_constant_distribution
 
class  piecewise_construct_t
 
class  piecewise_linear_distribution
 
class  placeholders
 
class  plus
 
class  pointer_safety
 
class  pointer_traits
 
class  poisson_distribution
 
class  priority_queue
 STL class.
 
class  promise
 
class  ptrdiff_t
 
class  queue
 STL class.
 
class  random_access_iterator_tag
 
class  random_device
 
class  range_error
 STL class.
 
class  rank
 
class  ranlux24
 
class  ranlux24_base
 
class  ranlux48
 
class  ranlux48_base
 
class  ratio
 
class  ratio_add
 
class  ratio_divide
 
class  ratio_equal
 
class  ratio_greater
 
class  ratio_greater_equal
 
class  ratio_less
 
class  ratio_less_equal
 
class  ratio_multiply
 
class  ratio_not_equal
 
class  ratio_subtract
 
class  raw_storage_iterator
 
class  recursive_mutex
 STL class.
 
class  recursive_timed_mutex
 STL class.
 
class  reference_wrapper
 
class  regex
 
class  regex_error
 
class  regex_iterator
 
class  regex_token_iterator
 
class  regex_traits
 
class  remove_all_extents
 
class  remove_const
 
class  remove_cv
 
class  remove_extent
 
class  remove_pointer
 
class  remove_reference
 
class  remove_volatile
 
class  result_of
 
class  reverse_iterator
 
class  runtime_error
 STL class.
 
class  scoped_allocator_adaptor
 
class  seed_seq
 
class  set
 STL class.
 
class  shared_future
 
class  shared_lock
 STL class.
 
class  shared_mutex
 STL class.
 
class  shared_ptr
 STL class.
 
class  shared_timed_mutex
 STL class.
 
class  shuffle_order_engine
 
class  sig_atomic_t
 
class  size_t
 
class  smart_ptr
 STL class.
 
class  smatch
 
class  span
 STL class.
 
class  sregex_iterator
 
class  sregex_token_iterator
 
class  ssub_match
 
class  stack
 STL class.
 
class  streambuf
 
class  streamoff
 
class  streampos
 
class  streamsize
 
class  string
 STL class.
 
class  string_view
 STL class.
 
class  stringbuf
 
class  stringstream
 STL class.
 
class  strstream
 
class  strstreambuf
 
class  student_t_distribution
 
class  sub_match
 
class  subtract_with_carry_engine
 
class  system_error
 STL class.
 
class  tera
 
class  terminate_handler
 
class  thread
 STL class.
 
class  time_base
 
class  time_get
 
class  time_get_byname
 
class  time_put
 
class  time_put_byname
 
class  time_t
 
class  timed_mutex
 STL class.
 
class  tm
 
class  true_type
 
class  try_to_lock_t
 
class  tuple
 
class  type_index
 
class  type_info
 
class  u16streampos
 
class  u16string
 STL class.
 
class  u16string_view
 STL class.
 
class  u32streampos
 
class  u32string
 STL class.
 
class  u32string_view
 STL class.
 
class  u8string
 STL class.
 
class  u8string_view
 STL class.
 
class  uint16_t
 
class  uint32_t
 
class  uint64_t
 
class  uint8_t
 
class  uint_fast16_t
 
class  uint_fast32_t
 
class  uint_fast64_t
 
class  uint_fast8_t
 
class  uint_least16_t
 
class  uint_least32_t
 
class  uint_least64_t
 
class  uint_least8_t
 
class  uintmax_t
 
class  uintptr_t
 
class  unary_function
 
class  unary_negate
 
class  underflow_error
 STL class.
 
class  underlying_type
 
class  unexpected_handler
 
class  uniform_int_distribution
 
class  uniform_real_distribution
 
class  unique_lock
 STL class.
 
class  unique_ptr
 STL class.
 
class  unordered_map
 STL class.
 
class  unordered_multimap
 STL class.
 
class  unordered_multiset
 STL class.
 
class  unordered_set
 STL class.
 
class  uses_allocator
 
class  valarray
 STL class.
 
class  vector
 STL class.
 
class  wbuffer_convert
 
class  wcerr
 
class  wcin
 
class  wclog
 
class  wcmatch
 
class  wcout
 
class  wcregex_iterator
 
class  wcregex_token_iterator
 
class  wcsub_match
 
class  weak_ptr
 STL class.
 
class  weibull_distribution
 
class  wfilebuf
 
class  wfstream
 STL class.
 
class  wifstream
 STL class.
 
class  wios
 STL class.
 
class  wiostream
 
class  wistream
 STL class.
 
class  wistringstream
 STL class.
 
class  wofstream
 STL class.
 
class  wostream
 STL class.
 
class  wostringstream
 STL class.
 
class  wregex
 
class  wsmatch
 
class  wsregex_iterator
 
class  wsregex_token_iterator
 
class  wssub_match
 
class  wstreambuf
 
class  wstreampos
 
class  wstring
 STL class.
 
class  wstring_convert
 
class  wstring_view
 STL class.
 
class  wstringbuf
 
class  wstringstream
 STL class.
 
class  yocto
 
class  yotta
 
class  zetta
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

+T atomic_fetch_and_explicit (T... args)
 
+T atomic_fetch_xor_explicit (T... args)
 
+T set_unexpected (T... args)
 
+T fputs (T... args)
 
+T modf (T... args)
 
+T not2 (T... args)
 
+T strlen (T... args)
 
+T exp2 (T... args)
 
+T setiosflags (T... args)
 
+T adjacent_difference (T... args)
 
+T cos (T... args)
 
+T fwscanf (T... args)
 
+T atomic_init (T... args)
 
+T forward_as_tuple (T... args)
 
+T abort (T... args)
 
+T wcsncmp (T... args)
 
+T set_intersection (T... args)
 
+T atomic_signal_fence (T... args)
 
+T llabs (T... args)
 
+T make_move_iterator (T... args)
 
+T scanf (T... args)
 
+T nextafter (T... args)
 
+T stol (T... args)
 
+T strcspn (T... args)
 
+T ungetwc (T... args)
 
+T transform (T... args)
 
+T putc (T... args)
 
+T iswdigit (T... args)
 
+T rint (T... args)
 
+T memset (T... args)
 
+T isgraph (T... args)
 
+T replace_copy_if (T... args)
 
+T scalbn (T... args)
 
+T partial_sort_copy (T... args)
 
+T make_exception_ptr (T... args)
 
+T frexp (T... args)
 
+T isxdigit (T... args)
 
+T atomic_exchange_explicit (T... args)
 
+T wprintf (T... args)
 
+T fdim (T... args)
 
+T wctype (T... args)
 
+T mbrtoc32 (T... args)
 
+T setw (T... args)
 
+T get_temporary_buffer (T... args)
 
+T fmax (T... args)
 
+T atomic_thread_fence (T... args)
 
+T atomic_exchange (T... args)
 
+T fgetwc (T... args)
 
+T swprintf (T... args)
 
+T prev_permutation (T... args)
 
+T max_element (T... args)
 
+T set_symmetric_difference (T... args)
 
+T wcscpy (T... args)
 
+T const_pointer_cast (T... args)
 
+T minmax_element (T... args)
 
+T wcstok (T... args)
 
+T ref (T... args)
 
+T feupdateenv (T... args)
 
+T endl (T... args)
 
+T end (T... args)
 
+T wmemmove (T... args)
 
+T fmin (T... args)
 
+T uninitialized_fill_n (T... args)
 
+T nouppercase (T... args)
 
+T noshowpos (T... args)
 
+T ctime (T... args)
 
+T wmemset (T... args)
 
+T iswpunct (T... args)
 
+T pop_heap (T... args)
 
+T sprintf (T... args)
 
+T fixed (T... args)
 
+T make_shared (T... args)
 
+T make_heap (T... args)
 
+T fmod (T... args)
 
+T atol (T... args)
 
+T uninitialized_copy (T... args)
 
+T dynamic_pointer_cast (T... args)
 
+T set_union (T... args)
 
+T hexfloat (T... args)
 
+T vswprintf (T... args)
 
+T asctime (T... args)
 
+T iswspace (T... args)
 
+T nan (T... args)
 
+T sort (T... args)
 
+T quick_exit (T... args)
 
+T log10 (T... args)
 
+T mbstowcs (T... args)
 
+T isspace (T... args)
 
+T strncat (T... args)
 
+T isinf (T... args)
 
+T atof (T... args)
 
+T erf (T... args)
 
+T is_sorted_until (T... args)
 
+T cbrt (T... args)
 
+T log1p (T... args)
 
+T return_temporary_buffer (T... args)
 
+T mbsrtowcs (T... args)
 
+T feraiseexcept (T... args)
 
+T fseek (T... args)
 
+T atomic_fetch_or_explicit (T... args)
 
+T log (T... args)
 
+T putchar (T... args)
 
+T make_tuple (T... args)
 
+T expm1 (T... args)
 
+T fma (T... args)
 
+T remove_copy_if (T... args)
 
+T showpoint (T... args)
 
+T fscanf (T... args)
 
+T stable_partition (T... args)
 
+T fill_n (T... args)
 
+T remove_copy (T... args)
 
+T atomic_compare_exchange_strong_explicit (T... args)
 
+T wctomb (T... args)
 
+T fgets (T... args)
 
+T remainder (T... args)
 
+T allocate_shared (T... args)
 
+T unique (T... args)
 
+T includes (T... args)
 
+T iswalnum (T... args)
 
+T exit (T... args)
 
+T put_time (T... args)
 
+T to_string (T... args)
 
+T is_heap_until (T... args)
 
+T wcstold (T... args)
 
+T stold (T... args)
 
+T ftell (T... args)
 
+T copy_backward (T... args)
 
+T wcstoll (T... args)
 
+T perror (T... args)
 
+T vwscanf (T... args)
 
+T stable_sort (T... args)
 
+T generic_category (T... args)
 
+T abs(int) (T... args)
 
+T fgetws (T... args)
 
+T showpos (T... args)
 
+T exp (T... args)
 
+T fill (T... args)
 
+T isalpha (T... args)
 
+T lgamma (T... args)
 
+T feclearexcept (T... args)
 
+T wcsncpy (T... args)
 
+T undeclare_reachable (T... args)
 
+T oct (T... args)
 
+T strspn (T... args)
 
+T realloc (T... args)
 
+T copy (T... args)
 
+T binary_search (T... args)
 
+T system_category (T... args)
 
+T mbrtowc (T... args)
 
+T strtof (T... args)
 
+T mem_fn (T... args)
 
+T distance (T... args)
 
+T lock (T... args)
 
+T strcmp (T... args)
 
+T tmpfile (T... args)
 
+T hypot (T... args)
 
+T getenv (T... args)
 
+T strrchr (T... args)
 
+T count (T... args)
 
+T tan (T... args)
 
+T strftime (T... args)
 
+T stod (T... args)
 
+T towupper (T... args)
 
+T atoll (T... args)
 
+T atomic_store (T... args)
 
+T stoi (T... args)
 
+T rethrow_exception (T... args)
 
+T sin (T... args)
 
+T atomic_fetch_sub_explicit (T... args)
 
+T unexpected (T... args)
 
+T mbtowc (T... args)
 
+T get_time (T... args)
 
+T partition (T... args)
 
+T next (T... args)
 
+T isfinite (T... args)
 
+T boolalpha (T... args)
 
+T fetestexcept (T... args)
 
+T mbrlen (T... args)
 
+T iswgraph (T... args)
 
+T time (T... args)
 
+T atomic_compare_exchange_strong (T... args)
 
+T wcschr (T... args)
 
+T uppercase (T... args)
 
+T lower_bound (T... args)
 
+T copy_if (T... args)
 
+T isnan (T... args)
 
+T has_facet (T... args)
 
+T kill_dependency (T... args)
 
+T uninitialized_copy_n (T... args)
 
+T feholdexcept (T... args)
 
+T div (T... args)
 
+T at_quick_exit (T... args)
 
+T wcspbrk (T... args)
 
+T search (T... args)
 
+T find_first_of (T... args)
 
+T iota (T... args)
 
+T declare_reachable (T... args)
 
+T atomic_compare_exchange_weak (T... args)
 
+T strtod (T... args)
 
+T accumulate (T... args)
 
+T wcsrchr (T... args)
 
+T min_element (T... args)
 
+T clearerr (T... args)
 
+T random_shuffle (T... args)
 
+T iswalpha (T... args)
 
+T atomic_fetch_and (T... args)
 
+T wmemchr (T... args)
 
+T bsearch (T... args)
 
+T ilogb (T... args)
 
+T unique_copy (T... args)
 
+T _Exit (T... args)
 
+T move (T... args)
 
+T find_end (T... args)
 
+T fesetexceptflag (T... args)
 
+T nth_element (T... args)
 
+T gets (T... args)
 
+T lexicographical_compare (T... args)
 
+T nearbyint (T... args)
 
+T memcpy (T... args)
 
+T fwrite (T... args)
 
+T unitbuf (T... args)
 
+T iswlower (T... args)
 
+T mblen (T... args)
 
+T swscanf (T... args)
 
+T wcstoimax (T... args)
 
+T fprintf (T... args)
 
+T find_if (T... args)
 
+T strtoimax (T... args)
 
+T isalnum (T... args)
 
+T atomic_fetch_add_explicit (T... args)
 
+T push_heap (T... args)
 
+T min (T... args)
 
+T fwprintf (T... args)
 
+T uncaught_exception (T... args)
 
+T strtoll (T... args)
 
+T throw_with_nested (T... args)
 
+T shuffle (T... args)
 
+T isprint (T... args)
 
+T get_new_handler (T... args)
 
+T call_once (T... args)
 
+T trunc (T... args)
 
+T wcscspn (T... args)
 
+T mbrtoc16 (T... args)
 
+T lround (T... args)
 
+T pow (T... args)
 
+T tgamma (T... args)
 
+T erfc (T... args)
 
+T llround (T... args)
 
+T abs(float) (T... args)
 
+T asinh (T... args)
 
+T feof (T... args)
 
+T noskipws (T... args)
 
+T find (T... args)
 
+T atoi (T... args)
 
+T not1 (T... args)
 
+T vfscanf (T... args)
 
+T stof (T... args)
 
+T regex_search (T... args)
 
+T rotate_copy (T... args)
 
+T set_new_handler (T... args)
 
+T undeclare_no_pointers (T... args)
 
+T async (T... args)
 
+T partition_point (T... args)
 
+T vsscanf (T... args)
 
+T fesetround (T... args)
 
+T atomic_is_lock_free (T... args)
 
+T tanh (T... args)
 
+T ldiv (T... args)
 
+T setbase (T... args)
 
+T remove (T... args)
 
+T strtol (T... args)
 
+T strpbrk (T... args)
 
+T signbit (T... args)
 
+T wcsncat (T... args)
 
+T get_money (T... args)
 
+T set_difference (T... args)
 
+T cref (T... args)
 
+T getline (T... args)
 
+T to_wstring (T... args)
 
+T system (T... args)
 
+T static_pointer_cast (T... args)
 
+T wcstoumax (T... args)
 
+T memmove (T... args)
 
+T getwchar (T... args)
 
+T scientific (T... args)
 
+T wcsftime (T... args)
 
+T begin (T... args)
 
+T ceil (T... args)
 
+T sinh (T... args)
 
+T is_permutation (T... args)
 
+T generate_n (T... args)
 
+T acosh (T... args)
 
+T advance (T... args)
 
+T flush (T... args)
 
+T atomic_fetch_xor (T... args)
 
+T ws (T... args)
 
+T signal (T... args)
 
+T noshowbase (T... args)
 
+T generate (T... args)
 
+T ldexp (T... args)
 
+T vsnprintf (T... args)
 
+T remove_if (T... args)
 
+T stoull (T... args)
 
+T fegetexceptflag (T... args)
 
+T find_if_not (T... args)
 
+T merge (T... args)
 
+T free (T... args)
 
+T count_if (T... args)
 
+T clock (T... args)
 
+T mktime (T... args)
 
+T inserter (T... args)
 
+T puts (T... args)
 
+T asin (T... args)
 
+T iscntrl (T... args)
 
+T difftime (T... args)
 
+T terminate (T... args)
 
+T memcmp (T... args)
 
+T uninitialized_fill (T... args)
 
+T hex (T... args)
 
+T tie (T... args)
 
+T back_inserter (T... args)
 
+T upper_bound (T... args)
 
+T adjacent_find (T... args)
 
+T use_facet (T... args)
 
+T vfwprintf (T... args)
 
+T atomic_fetch_add (T... args)
 
+T fsetpos (T... args)
 
+T malloc (T... args)
 
+T localtime (T... args)
 
+T wcscmp (T... args)
 
+T c32rtomb (T... args)
 
+T isupper (T... args)
 
+T wcstod (T... args)
 
+T tolower (T... args)
 
+T sort_heap (T... args)
 
+T isdigit (T... args)
 
+T wcslen (T... args)
 
+T wmemcmp (T... args)
 
+T move_if_noexcept (T... args)
 
+T declval (T... args)
 
+T fpclassify (T... args)
 
+T iswupper (T... args)
 
+T rand (T... args)
 
+T atomic_compare_exchange_weak_explicit (T... args)
 
+T partial_sort (T... args)
 
+T llrint (T... args)
 
+T fclose (T... args)
 
+T reverse (T... args)
 
+T partial_sum (T... args)
 
+T showbase (T... args)
 
+T vswscanf (T... args)
 
+T atan (T... args)
 
+T atanh (T... args)
 
+T iter_swap (T... args)
 
+T scalbln (T... args)
 
+T reverse_copy (T... args)
 
+T forward (T... args)
 
+T getc (T... args)
 
+T equal_range (T... args)
 
+T atomic_fetch_sub (T... args)
 
+T is_partitioned (T... args)
 
+T next_permutation (T... args)
 
+T isblank (T... args)
 
+T noshowpoint (T... args)
 
+T atan2 (T... args)
 
+T nanf (T... args)
 
+T towctrans (T... args)
 
+T right (T... args)
 
+T fputwc (T... args)
 
+T strtoul (T... args)
 
+T is_heap (T... args)
 
+T fflush (T... args)
 
+T strtoumax (T... args)
 
+T nexttoward (T... args)
 
+T nounitbuf (T... args)
 
+T ispunct (T... args)
 
+T noboolalpha (T... args)
 
+T make_pair (T... args)
 
+T iswctype (T... args)
 
+T srand (T... args)
 
+T replace_copy (T... args)
 
+T future_category (T... args)
 
+T resetiosflags (T... args)
 
+T vprintf (T... args)
 
+T gmtime (T... args)
 
+T align (T... args)
 
+T tuple_cat (T... args)
 
+T ends (T... args)
 
+T set_terminate (T... args)
 
+T lrint (T... args)
 
+T none_of (T... args)
 
+T wscanf (T... args)
 
+T fputc (T... args)
 
+T dec (T... args)
 
+T strcat (T... args)
 
+T raise (T... args)
 
+T wcsspn (T... args)
 
+T fabs (T... args)
 
+T wmemcpy (T... args)
 
+T copy_n (T... args)
 
+T rethrow_if_nested (T... args)
 
+T setlocale (T... args)
 
+T addressof (T... args)
 
+T calloc (T... args)
 
+T strerror (T... args)
 
+T strcpy (T... args)
 
+T wcstoull (T... args)
 
+T c16rtomb (T... args)
 
+T generate_canonical (T... args)
 
+T vfprintf (T... args)
 
+T notify_all_at_thread_exit (T... args)
 
+T rotate (T... args)
 
+T current_exception (T... args)
 
+T strtok (T... args)
 
+T wcscat (T... args)
 
+T strncpy (T... args)
 
+T towlower (T... args)
 
+T floor (T... args)
 
+T left (T... args)
 
+T ferror (T... args)
 
+T atomic_load_explicit (T... args)
 
+T swap (T... args)
 
+T acos (T... args)
 
+T wcscoll (T... args)
 
+T sqrt (T... args)
 
+T mbsinit (T... args)
 
+T qsort (T... args)
 
+T stoll (T... args)
 
+T put_money (T... args)
 
+T wcstoul (T... args)
 
+T wcstol (T... args)
 
+T atexit (T... args)
 
+T atomic_fetch_or (T... args)
 
+T rewind (T... args)
 
+T wcsxfrm (T... args)
 
+T round (T... args)
 
+T vwprintf (T... args)
 
+T all_of (T... args)
 
+T replace (T... args)
 
+T remquo (T... args)
 
+T setbuf (T... args)
 
+T strncmp (T... args)
 
+T localeconv (T... args)
 
+T wctrans (T... args)
 
+T any_of (T... args)
 
+T equal (T... args)
 
+T max (T... args)
 
+T strxfrm (T... args)
 
+T iswxdigit (T... args)
 
+T labs (T... args)
 
+T regex_match (T... args)
 
+T fputws (T... args)
 
+T wcrtomb (T... args)
 
+T setprecision (T... args)
 
+T setvbuf (T... args)
 
+T regex_replace (T... args)
 
+T freopen (T... args)
 
+T logb (T... args)
 
+T wctob (T... args)
 
+T atomic_load (T... args)
 
+T search_n (T... args)
 
+T toupper (T... args)
 
+T move_backward (T... args)
 
+T is_sorted (T... args)
 
+T strtoull (T... args)
 
+T iswblank (T... args)
 
+T get_pointer_safety (T... args)
 
+T get_unexpected (T... args)
 
+T sscanf (T... args)
 
+T fesetenv (T... args)
 
+T atomic_store_explicit (T... args)
 
+T strtold (T... args)
 
+T fread (T... args)
 
+T memchr (T... args)
 
+T btowc (T... args)
 
+T replace_if (T... args)
 
+T strcoll (T... args)
 
+T vsprintf (T... args)
 
+T mismatch (T... args)
 
+T getchar (T... args)
 
+T islower (T... args)
 
+T tmpnam (T... args)
 
+T nanl (T... args)
 
+T fopen (T... args)
 
+T for_each (T... args)
 
+T fegetround (T... args)
 
+T ungetc (T... args)
 
+T internal (T... args)
 
+T vfwscanf (T... args)
 
+T fgetc (T... args)
 
+T wcstof (T... args)
 
+T bind (T... args)
 
+T skipws (T... args)
 
+T iswprint (T... args)
 
+T wcstombs (T... args)
 
+T inplace_merge (T... args)
 
+T copysign (T... args)
 
+T putwchar (T... args)
 
+T wcsstr (T... args)
 
+T fegetenv (T... args)
 
+T longjmp (T... args)
 
+T iswcntrl (T... args)
 
+T declare_no_pointers (T... args)
 
+T isnormal (T... args)
 
+T swap_ranges (T... args)
 
+T minmax (T... args)
 
+T defaultfloat (T... args)
 
+T rename (T... args)
 
+T snprintf (T... args)
 
+T try_lock (T... args)
 
+T stoul (T... args)
 
+T fgetpos (T... args)
 
+T partition_copy (T... args)
 
+T vscanf (T... args)
 
+T front_inserter (T... args)
 
+T get_terminate (T... args)
 
+T cosh (T... args)
 
+T prev (T... args)
 
+T strchr (T... args)
 
+T strstr (T... args)
 
+T printf (T... args)
 
+T setfill (T... args)
 
+T inner_product (T... args)
 
+

Detailed Description

+

STL namespace.

+
+
+ + + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp.html b/d8/ddf/sieve__of__eratosthenes_8cpp.html new file mode 100644 index 000000000..adc30f607 --- /dev/null +++ b/d8/ddf/sieve__of__eratosthenes_8cpp.html @@ -0,0 +1,307 @@ + + + + + + + +Algorithms_in_C++: math/sieve_of_eratosthenes.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
sieve_of_eratosthenes.cpp File Reference
+
+
+ +

Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main). +More...

+
#include <iostream>
+
+Include dependency graph for sieve_of_eratosthenes.cpp:
+
+
+
+
+
+ + + +

+Macros

#define MAX   10000000
 
+ + + + + + + + + +

+Functions

void sieve (uint32_t N)
 
void print (uint32_t N)
 
void init ()
 
int main ()
 
+ + + +

+Variables

bool isprime [MAX]
 
+

Detailed Description

+

Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main).

+

Time Complexity : \(O(N \cdot\log N)\)
+Space Complexity : \(O(N)\)

+
See also
primes_up_to_billion.cpp prime_numbers.cpp
+

Macro Definition Documentation

+ +

◆ MAX

+ +
+
+ + + + +
#define MAX   10000000
+
+

Maximum number of primes

+ +
+
+

Function Documentation

+ +

◆ init()

+ +
+
+ + + + + + + +
void init ()
+
+

Initialize the array

+
52  {
+
53  for (uint32_t i = 1; i < MAX; i++) {
+
54  isprime[i] = true;
+
55  }
+
56 }
+
+
+
+ +

◆ main()

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

main function

+
59  {
+
60  uint32_t N = 100;
+
61  init();
+
62  sieve(N);
+
63  print(N);
+
64  return 0;
+
65 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ print()

+ +
+
+ + + + + + + + +
void print (uint32_t N)
+
+

This function prints out the primes to STDOUT

+
40  {
+
41  for (uint32_t i = 1; i <= N; i++) {
+
42  if (isprime[i]) {
+
43  std::cout << i << ' ';
+
44  }
+
45  }
+ +
47 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ sieve()

+ +
+
+ + + + + + + + +
void sieve (uint32_t N)
+
+

This is the function that finds the primes and eliminates the multiples.

+
25  {
+
26  isprime[0] = false;
+
27  isprime[1] = false;
+
28  for (uint32_t i = 2; i <= N; i++) {
+
29  if (isprime[i]) {
+
30  for (uint32_t j = (i << 1); j <= N; j += i) {
+
31  isprime[j] = false;
+
32  }
+
33  }
+
34  }
+
35 }
+
+
+
+

Variable Documentation

+ +

◆ isprime

+ +
+
+ + + + +
bool isprime[MAX]
+
+

array to store the primes

+ +
+
+
+
+
void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
+
void init()
Definition: sieve_of_eratosthenes.cpp:52
+ +
void sieve(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:25
+
#define MAX
Definition: sieve_of_eratosthenes.cpp:16
+
T endl(T... args)
+
bool isprime[MAX]
Definition: sieve_of_eratosthenes.cpp:19
+ + + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp.js b/d8/ddf/sieve__of__eratosthenes_8cpp.js new file mode 100644 index 000000000..e562481c2 --- /dev/null +++ b/d8/ddf/sieve__of__eratosthenes_8cpp.js @@ -0,0 +1,9 @@ +var sieve__of__eratosthenes_8cpp = +[ + [ "MAX", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326", null ], + [ "init", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947", null ], + [ "main", "d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "print", "d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46", null ], + [ "sieve", "d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8", null ], + [ "isprime", "d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22", null ] +]; \ No newline at end of file diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..57671a228 --- /dev/null +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..61a54470b --- /dev/null +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +20f3afa0e5ef765cc0fe353ecbbc11e9 \ No newline at end of file diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..4d55310fb --- /dev/null +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +init + + + + + +Node1->Node2 + + + + + +Node3 + + +print + + + + + +Node1->Node3 + + + + + +Node5 + + +sieve + + + + + +Node1->Node5 + + + + + +Node4 + + +std::endl + + + + + +Node3->Node4 + + + + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.map b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.map new file mode 100644 index 000000000..615c8eacf --- /dev/null +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5 b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5 new file mode 100644 index 000000000..993be0a37 --- /dev/null +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.md5 @@ -0,0 +1 @@ +378023a270fb78cab268e7031a2dcf23 \ No newline at end of file diff --git a/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg new file mode 100644 index 000000000..a4f589da6 --- /dev/null +++ b/d8/ddf/sieve__of__eratosthenes_8cpp_af50a5c87d27cfd3462745b37fb9b0f46_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +print + + + +Node1 + + +print + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/d8/dee/avltree_8cpp.html b/d8/dee/avltree_8cpp.html new file mode 100644 index 000000000..4f228eedd --- /dev/null +++ b/d8/dee/avltree_8cpp.html @@ -0,0 +1,736 @@ + + + + + + + +Algorithms_in_C++: data_structures/avltree.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
avltree.cpp File Reference
+
+
+ +

A simple tree implementation using nodes. +More...

+
#include <algorithm>
+#include <iostream>
+#include <queue>
+
+Include dependency graph for avltree.cpp:
+
+
+
+
+
+ + + +

+Classes

class  node< Kind >
 
+ + + +

+Typedefs

+typedef struct node node
 
+ + + + + + + + + + + + + + + + + + + + + +

+Functions

nodecreateNode (int data)
 
int height (node *root)
 
int getBalance (node *root)
 
noderightRotate (node *root)
 
nodeleftRotate (node *root)
 
nodeminValue (node *root)
 
nodeinsert (node *root, int item)
 
nodedeleteNode (node *root, int key)
 
void levelOrder (node *root)
 
int main ()
 
+

Detailed Description

+

A simple tree implementation using nodes.

+
Todo:
update code to use C++ STL library features and OO structure
+
Warning
This program is a poor implementation and does not utilize any of the C++ STL features.
+

Function Documentation

+ +

◆ createNode()

+ +
+
+ + + + + + + + +
node* createNode (int data)
+
+

Create and return a new Node

+
21  {
+
22  node *nn = new node();
+
23  nn->data = data;
+
24  nn->height = 0;
+
25  nn->left = NULL;
+
26  nn->right = NULL;
+
27  return nn;
+
28 }
+
+
+
+ +

◆ deleteNode()

+ +
+
+ + + + + + + + + + + + + + + + + + +
node* deleteNode (noderoot,
int key 
)
+
+

Balanced Deletion

+
88  {
+
89  if (root == NULL)
+
90  return root;
+
91  if (key < root->data)
+
92  root->left = deleteNode(root->left, key);
+
93  else if (key > root->data)
+
94  root->right = deleteNode(root->right, key);
+
95 
+
96  else {
+
97  // Node to be deleted is leaf node or have only one Child
+
98  if (!root->right) {
+
99  node *temp = root->left;
+
100  delete (root);
+
101  root = NULL;
+
102  return temp;
+
103  } else if (!root->left) {
+
104  node *temp = root->right;
+
105  delete (root);
+
106  root = NULL;
+
107  return temp;
+
108  }
+
109  // Node to be deleted have both left and right subtrees
+
110  node *temp = minValue(root->right);
+
111  root->data = temp->data;
+
112  root->right = deleteNode(root->right, temp->data);
+
113  }
+
114  // Balancing Tree after deletion
+
115  return root;
+
116 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ getBalance()

+ +
+
+ + + + + + + + +
int getBalance (noderoot)
+
+

Returns difference between height of left and right subtree

+
38 { return height(root->left) - height(root->right); }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ height()

+ +
+
+ + + + + + + + +
int height (noderoot)
+
+

Returns height of tree

+
31  {
+
32  if (root == NULL)
+
33  return 0;
+
34  return 1 + std::max(height(root->left), height(root->right));
+
35 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ insert()

+ +
+
+ + + + + + + + + + + + + + + + + + +
node* insert (noderoot,
int item 
)
+
+

Balanced Insertion

+
66  {
+
67  node *nn = createNode(item);
+
68  if (root == NULL)
+
69  return nn;
+
70  if (item < root->data)
+
71  root->left = insert(root->left, item);
+
72  else
+
73  root->right = insert(root->right, item);
+
74  int b = getBalance(root);
+
75  if (b > 1) {
+
76  if (getBalance(root->left) < 0)
+
77  root->left = leftRotate(root->left); // Left-Right Case
+
78  return rightRotate(root); // Left-Left Case
+
79  } else if (b < -1) {
+
80  if (getBalance(root->right) > 0)
+
81  root->right = rightRotate(root->right); // Right-Left Case
+
82  return leftRotate(root); // Right-Right Case
+
83  }
+
84  return root;
+
85 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ leftRotate()

+ +
+
+ + + + + + + + +
node* leftRotate (noderoot)
+
+

Returns Node after Left Rotation

+
50  {
+
51  node *t = root->right;
+
52  node *u = t->left;
+
53  t->left = root;
+
54  root->right = u;
+
55  return t;
+
56 }
+
+
+
+ +

◆ levelOrder()

+ +
+
+ + + + + + + + +
void levelOrder (noderoot)
+
+

LevelOrder (Breadth First Search)

+
119  {
+ +
121  q.push(root);
+
122  while (!q.empty()) {
+
123  root = q.front();
+
124  std::cout << root->data << " ";
+
125  q.pop();
+
126  if (root->left)
+
127  q.push(root->left);
+
128  if (root->right)
+
129  q.push(root->right);
+
130  }
+
131 }
+
+
+
+ +

◆ main()

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

Main function

+
134  {
+
135  // Testing AVL Tree
+
136  node *root = NULL;
+
137  int i;
+
138  for (i = 1; i <= 7; i++) root = insert(root, i);
+
139  std::cout << "LevelOrder: ";
+
140  levelOrder(root);
+
141  root = deleteNode(root, 1); // Deleting key with value 1
+
142  std::cout << "\nLevelOrder: ";
+
143  levelOrder(root);
+
144  root = deleteNode(root, 4); // Deletin key with value 4
+
145  std::cout << "\nLevelOrder: ";
+
146  levelOrder(root);
+
147  return 0;
+
148 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ minValue()

+ +
+
+ + + + + + + + +
node* minValue (noderoot)
+
+

Returns node with minimum value in the tree

+
59  {
+
60  if (root->left == NULL)
+
61  return root;
+
62  return minValue(root->left);
+
63 }
+
+
+
+ +

◆ rightRotate()

+ +
+
+ + + + + + + + +
node* rightRotate (noderoot)
+
+

Returns Node after Right Rotation

+
41  {
+
42  node *t = root->left;
+
43  node *u = t->right;
+
44  t->right = root;
+
45  root->left = u;
+
46  return t;
+
47 }
+
+
+
+
+
+
void mov(tower *From, tower *To)
Definition: tower_of_hanoi.cpp:39
+
T srand(T... args)
+
int main()
Definition: knuth_morris_pratt.cpp:76
+
void ternary_search(int N, int A[], int target)
Definition: ternary_search.cpp:127
+
T floor(T... args)
+
void test3()
Definition: smallest_circle.cpp:188
+
int main(void)
Definition: decimal_to_hexadecimal.cpp:11
+
void method2(int number)
Definition: decimal_to_binary.cpp:27
+
int main()
Definition: exponential_search.cpp:74
+
int main()
Definition: stairs_pattern.cpp:17
+
int hash_search(int key, int *counter)
Definition: hash_search.cpp:76
+
STL class.
+
void shell_sort(T *arr, size_t LEN)
Definition: shell_sort2.cpp:45
+
std::string tolowerRoman(int n)
Definition: decimal_to_roman_numeral.cpp:24
+
void test_f(const int NUM_DATA)
Definition: shell_sort2.cpp:145
+
String search algorithms.
Definition: brute_force_string_searching.cpp:13
+
void show_data(T *arr, size_t LEN)
Definition: shell_sort2.cpp:18
+
STL class.
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+ +
T move(T... args)
+
int main()
Definition: binomial_dist.cpp:84
+
double addition_rule_dependent(double A, double B, double B_given_A)
Definition: addition_rule.cpp:25
+
void test2()
Definition: smallest_circle.cpp:173
+
Definition: bit.cpp:6
+ +
STL class.
+
node * deleteNode(node *root, int key)
Definition: avltree.cpp:88
+
T size(T... args)
+
double x
Definition: smallest_circle.cpp:16
+
int main()
Definition: decimal_to_roman_numeral.cpp:90
+
#define absolutePrecision
Definition: ternary_search.cpp:22
+
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
+
void print(uint32_t N)
Definition: sieve_of_eratosthenes.cpp:40
+
#define HASHMAX
Determines the length of the hash table.
Definition: hash_search.cpp:22
+
#define PRIME
Prime modulus for hash functions.
Definition: rabin_karp.cpp:16
+
int partition(int arr[], int low, int high)
Definition: quick_sort.cpp:37
+
T distance(T... args)
+
Type * binary_s(Type *array, size_t size, Type key)
Definition: exponential_search.cpp:34
+
Definition: avltree.cpp:13
+
double y
Definition: smallest_circle.cpp:17
+
T search(T... args)
+
struct list node
+
#define MAX
Determines how much data.
Definition: hash_search.cpp:21
+
int main()
Definition: pascal_triangle.cpp:52
+
int main()
Definition: bayes_theorem.cpp:26
+
T scanf(T... args)
+
vector< vector< ll > > multiply(const vector< vector< ll >> &A, const vector< vector< ll >> &B)
Definition: matrix_exponentiation.cpp:60
+
T reverse(T... args)
+
int main(void)
Definition: qr_decomposition.cpp:23
+
int main()
Definition: palindrome_of_number.cpp:19
+
Sorting algorithms.
Definition: non_recursive_merge_sort.cpp:11
+
void levelOrder(node *root)
Definition: avltree.cpp:119
+
int main()
Definition: vector_important_functions.cpp:11
+
STL class.
+
void merge(Iterator, Iterator, const Iterator, char[])
merges 2 sorted adjacent segments into a larger sorted segment
Definition: non_recursive_merge_sort.cpp:57
+
int main()
Definition: linear_search.cpp:27
+
static float eqd(float y)
Definition: successive_approximation.cpp:17
+
T sort(T... args)
+
std::string fill(char c, int n)
Definition: decimal_to_roman_numeral.cpp:15
+
void mat_mul(const std::valarray< std::valarray< double >> &A, const std::valarray< std::valarray< double >> &B, std::valarray< std::valarray< double >> *OUT)
Definition: qr_eigen_values.cpp:54
+
int64_t create_hash(const std::string &s, int n)
Definition: rabin_karp.cpp:25
+
T sqrt(T... args)
+
int main(int argc, char *argv[])
Definition: shell_sort2.cpp:183
+
int main()
Definition: interpolation_search2.cpp:32
+
int compare(const void *a, const void *b)
Definition: shell_sort2.cpp:87
+
int brute_force(const std::string &text, const std::string &pattern)
Definition: brute_force_string_searching.cpp:21
+
int main()
Definition: buzz_number.cpp:9
+
Functions to compute QR decomposition of any rectangular matrix.
+
void create_matrix(std::valarray< std::valarray< double >> *A)
Definition: qr_eigen_values.cpp:28
+
int main()
Definition: happy_number.cpp:29
+
Definition: mo.cpp:6
+
int main()
Definition: text_search.cpp:15
+
const std::vector< std::vector< std::string > > test_set
Definition: brute_force_string_searching.cpp:41
+
int rec_ternary_search(int left, int right, int A[], int target)
Definition: ternary_search.cpp:90
+
Definition: linkedlist_implentation_usingarray.cpp:14
+
T push_back(T... args)
+
int y
Point respect to x coordinate.
Definition: line_segment_intersection.cpp:14
+
std::valarray< double > eigen_values(std::valarray< std::valarray< double >> *A, bool print_intermediates=false)
Definition: qr_eigen_values.cpp:98
+
T clock(T... args)
+
int64_t recalculate_hash(const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)
Definition: rabin_karp.cpp:42
+
int main()
Definition: smallest_circle.cpp:198
+
int top
pointer to track stack index
Definition: paranthesis_matching.cpp:23
+
void test_int(const int NUM_DATA)
Definition: shell_sort2.cpp:105
+
node * createNode(int data)
Definition: avltree.cpp:21
+
int ** pascal_triangle(int **arr, int n)
Definition: pascal_triangle.cpp:36
+
node * insert(node *root, int item)
Definition: avltree.cpp:66
+
T printf(T... args)
+
int main()
Definition: matrix_exponentiation.cpp:129
+
int main()
Definition: fast_interger_input.cpp:39
+ +
Library functions to compute QR decomposition of a given matrix.
+
int h(int key)
Definition: hash_search.cpp:45
+
void non_recursive_merge_sort(const Iterator first, const Iterator last)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition: non_recursive_merge_sort.cpp:86
+
int main(int argc, char const *argv[])
Definition: binary_search.cpp:31
+
ll k
Definition: matrix_exponentiation.cpp:48
+
Definition: tower_of_hanoi.cpp:11
+
#define _target
Definition: ternary_search.cpp:27
+
int binary_search(int a[], int r, int key)
Definition: binary_search.cpp:15
+
char opening(char ch)
Definition: paranthesis_matching.cpp:36
+
bool is_happy(T n)
Definition: happy_number.cpp:14
+
bool check_if_equal(const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)
Definition: rabin_karp.cpp:60
+
int main()
Definition: median_search.cpp:38
+
int main()
Definition: ternary_search.cpp:134
+
double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)
Definition: binomial_dist.cpp:74
+
double LenghtLine(const Point &A, const Point &B)
Definition: smallest_circle.cpp:37
+
T qsort(T... args)
+
T to_string(T... args)
+
bool kmp(const std::string &pattern, const std::string &text)
Definition: knuth_morris_pratt.cpp:56
+
double poisson_range_successes(double expected, double lower, double upper)
Definition: poisson_dist.cpp:54
+
int main()
Definition: tower_of_hanoi.cpp:65
+
void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)
bottom-up merge sort which sorts elements in a non-decreasing order
Definition: non_recursive_merge_sort.cpp:25
+
#define ll
Definition: matrix_exponentiation.cpp:33
+
STL class.
+
double binomial_standard_deviation(double n, double p)
Definition: binomial_dist.cpp:36
+
int height(node *root)
Definition: avltree.cpp:31
+
double TriangleArea(const Point &A, const Point &B, const Point &C)
Definition: smallest_circle.cpp:54
+
int main()
Definition: brute_force_string_searching.cpp:47
+
node * rightRotate(node *root)
Definition: avltree.cpp:41
+
double binomial_x_successes(double n, double p, double x)
Definition: binomial_dist.cpp:65
+
void test2()
Definition: qr_eigen_values.cpp:210
+
T remove(T... args)
+
#define endl
Definition: matrix_exponentiation.cpp:36
+
struct list * link
pointer to nodes
+
void comp(X x, std::vector< int > *s1, std::vector< int > *s2, std::vector< int > *s3)
Definition: median_search.cpp:17
+
void spiralPrint(int **a, int r, int c)
Definition: spiral_print.cpp:29
+
double bayes_BgivenA(double AgivenB, double A, double B)
Definition: bayes_theorem.cpp:20
+
double poisson_rate(double events, double timeframe)
Definition: poisson_dist.cpp:17
+
int key
key value for node
Definition: hash_search.cpp:30
+
int main(int argc, char **argv)
Definition: qr_eigen_values.cpp:243
+
T ceil(T... args)
+
double circle(const std::vector< Point > &P)
Definition: smallest_circle.cpp:87
+
static float eq(float y)
Definition: successive_approximation.cpp:12
+
Type * struzik_search(Type *array, size_t size, Type key)
Definition: exponential_search.cpp:59
+
int main()
Definition: poisson_dist.cpp:65
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T rand(T... args)
+
T swap(T... args)
+
T min(T... args)
+
double binomial_expected(double n, double p)
Definition: binomial_dist.cpp:22
+
node hashtab[HASHMAX]
array of nodes
Definition: hash_search.cpp:35
+
T substr(T... args)
+
int it_ternary_search(int left, int right, int A[], int target)
Definition: ternary_search.cpp:48
+
int jumpSearch(int arr[], int x, int n)
Definition: jump_search.cpp:12
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
void method1(int number)
Definition: decimal_to_binary.cpp:11
+
void test1()
Definition: qr_eigen_values.cpp:177
+
node * minValue(node *root)
Definition: avltree.cpp:59
+
T lower_bound(T... args)
+
int main()
Definition: hash_search.cpp:99
+
T endl(T... args)
+
T left(T... args)
+
void create_list(int key)
Definition: hash_search.cpp:55
+
double fact(double x)
Definition: poisson_dist.cpp:30
+
T exp(T... args)
+
T begin(T... args)
+
T getline(T... args)
+
STL namespace.
+
double addition_rule_independent(double A, double B)
Definition: addition_rule.cpp:14
+
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
+
int main()
Definition: sparse_matrix.cpp:9
+
void test()
Definition: smallest_circle.cpp:158
+
Definition: huffman.cpp:28
+
int main()
Definition: spiral_print.cpp:69
+
int main()
Definition: avltree.cpp:134
+
#define MAX
Definition: paranthesis_matching.cpp:16
+
Definition: stack.h:17
+
vector< vector< ll > > power(const vector< vector< ll >> &A, ll p)
Definition: matrix_exponentiation.cpp:79
+
int main()
Definition: successive_approximation.cpp:20
+
T count(T... args)
+
int LinearSearch(int *array, int size, int key)
Definition: linear_search.cpp:16
+
const uint64_t MAX
Definition: fibonacci_fast.cpp:24
+
T assign(T... args)
+
bool IsPrime(int number)
Definition: primality_test.cpp:18
+
double nCr(double n, double r)
Definition: binomial_dist.cpp:47
+
int values[10]
Values in the tower.
Definition: tower_of_hanoi.cpp:13
+
void qr_decompose(const std::valarray< std::valarray< T >> &A, std::valarray< std::valarray< T >> *Q, std::valarray< std::valarray< T >> *R)
Definition: qr_decompose.h:146
+
void genArray(int **a, int r, int c)
Definition: spiral_print.cpp:12
+
int main()
Definition: interpolation_search.cpp:37
+
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
+
T time(T... args)
+
int main()
Definition: addition_rule.cpp:30
+
std::string toupperRoman(int n)
Definition: decimal_to_roman_numeral.cpp:58
+
#define LIMS
Definition: qr_eigen_values.cpp:20
+
T end(T... args)
+
double bayes_AgivenB(double BgivenA, double A, double B)
Definition: bayes_theorem.cpp:14
+
T setw(T... args)
+
int main()
Definition: quick_sort.cpp:82
+
T max(T... args)
+
Point(double a=0.f, double b=0.f)
Definition: smallest_circle.cpp:23
+
int main()
Definition: primality_test.cpp:31
+
node * leftRotate(node *root)
Definition: avltree.cpp:50
+
struct list * next
pointer to next link in the chain
Definition: hash_search.cpp:31
+
int top
top tower ID
Definition: tower_of_hanoi.cpp:15
+
Definition: line_segment_intersection.cpp:12
+
void TH(int n, tower *From, tower *Using, tower *To)
Definition: tower_of_hanoi.cpp:52
+
int interpolation_search(int arr[], int value, int len)
Definition: interpolation_search.cpp:15
+
void push(char ch)
push byte to stack variable
Definition: paranthesis_matching.cpp:26
+
char pop()
pop a byte out of stack variable
Definition: paranthesis_matching.cpp:29
+
int InterpolationSearch(int A[], int n, int x)
Definition: interpolation_search2.cpp:15
+ +
double poisson_expected(double rate, double time)
Definition: poisson_dist.cpp:25
+
double poisson_x_successes(double expected, double x)
Definition: poisson_dist.cpp:46
+
int main(void)
Definition: rabin_karp.cpp:105
+
void quickSort(int arr[], int low, int high)
Definition: quick_sort.cpp:63
+ +
T data(T... args)
+
std::vector< int > getFailureArray(const std::string &pattern)
Definition: knuth_morris_pratt.cpp:33
+
void show_pascal(int **arr, int n)
Definition: pascal_triangle.cpp:18
+
int rabin_karp(const std::string &str, const std::string &pat)
Definition: rabin_karp.cpp:83
+
void get_input()
Definition: ternary_search.cpp:36
+
bool PointInCircle(const std::vector< Point > &P, const Point &Center, double R)
Definition: smallest_circle.cpp:72
+
T getchar(T... args)
+
Definition: list_array.cpp:4
+
T memset(T... args)
+
int getBalance(node *root)
Definition: avltree.cpp:38
+
double binomial_variance(double n, double p)
Definition: binomial_dist.cpp:29
+
T next(T... args)
+
ll ab(ll x)
Definition: matrix_exponentiation.cpp:43
+
void shell_sort(std::vector< T > *arr)
Definition: shell_sort2.cpp:75
+
void fastinput(int *number)
Definition: fast_interger_input.cpp:11
+
T pow(T... args)
+ + + + diff --git a/d8/dee/avltree_8cpp.js b/d8/dee/avltree_8cpp.js new file mode 100644 index 000000000..45fea15e8 --- /dev/null +++ b/d8/dee/avltree_8cpp.js @@ -0,0 +1,15 @@ +var avltree_8cpp = +[ + [ "node", "d5/da1/structnode.html", "d5/da1/structnode" ], + [ "node", "d8/dee/avltree_8cpp.html#af4aeda155dbe167f1c1cf38cb65bf324", null ], + [ "createNode", "d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0", null ], + [ "deleteNode", "d8/dee/avltree_8cpp.html#a8286388b0743a716145639df3a33e541", null ], + [ "getBalance", "d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546", null ], + [ "height", "d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83", null ], + [ "insert", "d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a", null ], + [ "leftRotate", "d8/dee/avltree_8cpp.html#aed58f3cea338a9d7bdcb9a4cfc6c7a78", null ], + [ "levelOrder", "d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59", null ], + [ "main", "d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "minValue", "d8/dee/avltree_8cpp.html#adb8e952bf1c266bae84111b9d6a12015", null ], + [ "rightRotate", "d8/dee/avltree_8cpp.html#a4d93589966920b2756b84f8b92c54d1c", null ] +]; \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.map b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.map new file mode 100644 index 000000000..651183be1 --- /dev/null +++ b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.md5 b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.md5 new file mode 100644 index 000000000..c1b2ad78a --- /dev/null +++ b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.md5 @@ -0,0 +1 @@ +ab87f372bbc4be2ec5fa060b67adf4bd \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.svg b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.svg new file mode 100644 index 000000000..fe694ff59 --- /dev/null +++ b/d8/dee/avltree_8cpp_a8286388b0743a716145639df3a33e541_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +deleteNode + + + +Node1 + + +deleteNode + + + + + +Node2 + + +std::vector::data + + + + + +Node1->Node2 + + + + + +Node3 + + +minValue + + + + + +Node1->Node3 + + + + + diff --git a/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.map b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.map new file mode 100644 index 000000000..2d94f9462 --- /dev/null +++ b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.md5 b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.md5 new file mode 100644 index 000000000..040ad1c52 --- /dev/null +++ b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.md5 @@ -0,0 +1 @@ +b583733ba8367f7a242cea7974212db7 \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.svg b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.svg new file mode 100644 index 000000000..bd83706b5 --- /dev/null +++ b/d8/dee/avltree_8cpp_aa7cd8a68075fae1c33df41233c1bed6a_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +insert + + + +Node1 + + +insert + + + + + +Node2 + + +createNode + + + + + +Node1->Node2 + + + + + diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map new file mode 100644 index 000000000..eb87cfe62 --- /dev/null +++ b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5 b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5 new file mode 100644 index 000000000..fefb88072 --- /dev/null +++ b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.md5 @@ -0,0 +1 @@ +608ec33708cee9841b33d9f36ff6bb0d \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg new file mode 100644 index 000000000..9b134f78a --- /dev/null +++ b/d8/dee/avltree_8cpp_aaa457ffec24c9643f2768e7a65e96546_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +getBalance + + + +Node1 + + +getBalance + + + + + +Node2 + + +height + + + + + +Node1->Node2 + + + + + +Node3 + + +std::max + + + + + +Node2->Node3 + + + + + diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map new file mode 100644 index 000000000..e225950ab --- /dev/null +++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 new file mode 100644 index 000000000..348a5f442 --- /dev/null +++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.md5 @@ -0,0 +1 @@ +5d9d190cb9bb0a45e3bed989110a6a03 \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg new file mode 100644 index 000000000..ceb180cd5 --- /dev/null +++ b/d8/dee/avltree_8cpp_ae4a66d8b0c2b0d626aea45977e358c83_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +height + + + +Node1 + + +height + + + + + +Node2 + + +std::max + + + + + +Node1->Node2 + + + + + diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..4743445e5 --- /dev/null +++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..c50c3d754 --- /dev/null +++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +27e9cc3d3daf551946252ceaa155361c \ No newline at end of file diff --git a/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..b6b28662d --- /dev/null +++ b/d8/dee/avltree_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,112 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +deleteNode + + + + + +Node1->Node2 + + + + + +Node5 + + +insert + + + + + +Node1->Node5 + + + + + +Node7 + + +levelOrder + + + + + +Node1->Node7 + + + + + +Node3 + + +std::vector::data + + + + + +Node2->Node3 + + + + + +Node4 + + +minValue + + + + + +Node2->Node4 + + + + + +Node6 + + +createNode + + + + + +Node5->Node6 + + + + + diff --git a/d9/d00/factorial_8cpp.html b/d9/d00/factorial_8cpp.html new file mode 100644 index 000000000..0c4949054 --- /dev/null +++ b/d9/d00/factorial_8cpp.html @@ -0,0 +1,189 @@ + + + + + + + +Algorithms_in_C++: math/factorial.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
factorial.cpp File Reference
+
+
+ +

C++ program to find factorial of given number. +More...

+
#include <iostream>
+
+Include dependency graph for factorial.cpp:
+
+
+
+
+
+ + + + + +

+Functions

unsigned int factorial (unsigned int n)
 
int main ()
 
+

Detailed Description

+

C++ program to find factorial of given number.

+

Function Documentation

+ +

◆ factorial()

+ +
+
+ + + + + + + + +
unsigned int factorial (unsigned int n)
+
+

function to find factorial of given number

+
8  {
+
9  if (n == 0)
+
10  return 1;
+
11  return n * factorial(n - 1);
+
12 }
+
+
+
+ +

◆ main()

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

Main function

+
15  {
+
16  int num = 5;
+
17  std::cout << "Factorial of " << num << " is " << factorial(num)
+
18  << std::endl;
+
19  return 0;
+
20 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T endl(T... args)
+
unsigned int factorial(unsigned int n)
Definition: factorial.cpp:8
+ + + + diff --git a/d9/d00/factorial_8cpp.js b/d9/d00/factorial_8cpp.js new file mode 100644 index 000000000..064fe5dbc --- /dev/null +++ b/d9/d00/factorial_8cpp.js @@ -0,0 +1,5 @@ +var factorial_8cpp = +[ + [ "factorial", "d9/d00/factorial_8cpp.html#ae9945c15826a9c1b5c141db314b7f8b4", null ], + [ "main", "d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..ba70b600d --- /dev/null +++ b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..f849b6230 --- /dev/null +++ b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +4cf3055aba36edc2608079f8df9c7f1e \ No newline at end of file diff --git a/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..58103d605 --- /dev/null +++ b/d9/d00/factorial_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +factorial + + + + + +Node1->Node3 + + + + + diff --git a/d9/d02/linear__search_8cpp.html b/d9/d02/linear__search_8cpp.html new file mode 100644 index 000000000..2352ce043 --- /dev/null +++ b/d9/d02/linear__search_8cpp.html @@ -0,0 +1,240 @@ + + + + + + + +Algorithms_in_C++: search/linear_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
linear_search.cpp File Reference
+
+
+ +

Linear search algorithm +More...

+
#include <iostream>
+
+Include dependency graph for linear_search.cpp:
+
+
+
+
+
+ + + + + +

+Functions

int LinearSearch (int *array, int size, int key)
 
int main ()
 
+

Detailed Description

+

Function Documentation

+ +

◆ LinearSearch()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int LinearSearch (int * array,
int size,
int key 
)
+
+

Algorithm implementation

Parameters
+ + + + +
[in]arrayarray to search in
[in]sizelength of array
[in]keykey value to search for
+
+
+
Returns
index where the key-value occurs in the array
+
+-1 if key-value not found
+
16  {
+
17  for (int i = 0; i < size; ++i) {
+
18  if (array[i] == key) {
+
19  return i;
+
20  }
+
21  }
+
22 
+
23  return -1;
+
24 }
+
+
+
+ +

◆ main()

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

main function

+
27  {
+
28  int size;
+
29  std::cout << "\nEnter the size of the Array : ";
+
30  std::cin >> size;
+
31 
+
32  int *array = new int[size];
+
33  int key;
+
34 
+
35  // Input array
+
36  std::cout << "\nEnter the Array of " << size << " numbers : ";
+
37  for (int i = 0; i < size; i++) {
+
38  std::cin >> array[i];
+
39  }
+
40 
+
41  std::cout << "\nEnter the number to be searched : ";
+
42  std::cin >> key;
+
43 
+
44  int index = LinearSearch(array, size, key);
+
45  if (index != -1) {
+
46  std::cout << "\nNumber found at index : " << index;
+
47  } else {
+
48  std::cout << "\nNot found";
+
49  }
+
50 
+
51  delete[] array;
+
52  return 0;
+
53 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
int LinearSearch(int *array, int size, int key)
Definition: linear_search.cpp:16
+ + + + + diff --git a/d9/d02/linear__search_8cpp.js b/d9/d02/linear__search_8cpp.js new file mode 100644 index 000000000..240a85f43 --- /dev/null +++ b/d9/d02/linear__search_8cpp.js @@ -0,0 +1,5 @@ +var linear__search_8cpp = +[ + [ "LinearSearch", "d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84", null ], + [ "main", "d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..57fa4fdcd --- /dev/null +++ b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..827678108 --- /dev/null +++ b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +b48547af7712913b0051c43458c867d6 \ No newline at end of file diff --git a/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..d4848d4cc --- /dev/null +++ b/d9/d02/linear__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +LinearSearch + + + + + +Node1->Node2 + + + + + diff --git a/d9/d03/namespacestring__search.html b/d9/d03/namespacestring__search.html new file mode 100644 index 000000000..29fbec58a --- /dev/null +++ b/d9/d03/namespacestring__search.html @@ -0,0 +1,554 @@ + + + + + + + +Algorithms_in_C++: string_search Namespace Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
string_search Namespace Reference
+
+
+ +

String search algorithms. +More...

+ + + + + + + + + + + + + + + + +

+Functions

int brute_force (const std::string &text, const std::string &pattern)
 
std::vector< int > getFailureArray (const std::string &pattern)
 
bool kmp (const std::string &pattern, const std::string &text)
 
int64_t create_hash (const std::string &s, int n)
 
int64_t recalculate_hash (const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)
 
bool check_if_equal (const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)
 
int rabin_karp (const std::string &str, const std::string &pat)
 
+

Detailed Description

+

String search algorithms.

+

Function Documentation

+ +

◆ brute_force()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int string_search::brute_force (const std::stringtext,
const std::stringpattern 
)
+
+

Find a pattern in a string by comparing the pattern to every substring.

Parameters
+ + + +
textAny string that might contain the pattern.
patternString that we are searching for.
+
+
+
Returns
Index where the pattern starts in the text
+
+-1 if the pattern was not found.
+
21  {
+
22  size_t pat_l = pattern.length();
+
23  size_t txt_l = text.length();
+
24  int index = -1;
+
25  if (pat_l <= txt_l) {
+
26  for (size_t i = 0; i < txt_l - pat_l + 1; i++) {
+
27  std::string s = text.substr(i, pat_l);
+
28  if (s == pattern) {
+
29  index = i;
+
30  break;
+
31  }
+
32  }
+
33  }
+
34  return index;
+
35 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ check_if_equal()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
bool string_search::check_if_equal (const std::stringstr1,
const std::stringstr2,
int start1,
int end1,
int start2,
int end2 
)
+
+

compare if two sub-strings are equal

Parameters
+ + + + + +
[in]str1string pattern to search
[in]str2text in which to search
[in]start1,end1start and end indices for substring in str1
[in]start2,end2start and end indices for substring in str2
+
+
+
Returns
true if pattern was found
+
+false if pattern was not found
+
Note
can this be replaced by std::string::compare?
+
61  {
+
62  if (end1 - start1 != end2 - start2) {
+
63  return false;
+
64  }
+
65  while (start1 <= end1 && start2 <= end2) {
+
66  if (str1[start1] != str2[start2]) {
+
67  return false;
+
68  }
+
69  start1++;
+
70  start2++;
+
71  }
+
72  return true;
+
73 }
+
+
+
+ +

◆ create_hash()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int64_t string_search::create_hash (const std::strings,
int n 
)
+
+

convert a string to an intger - called as hashing function

Parameters
+ + + +
[in]ssource of string to hash
[in]nlength of substring to hash
+
+
+
Returns
hash integer
+
25  {
+
26  int64_t result = 0;
+
27  for (int i = 0; i < n; ++i) {
+
28  result += (int64_t)(s[i] * (int64_t)pow(PRIME, i));
+
29  }
+
30  return result;
+
31 }
+
+
+
+ +

◆ getFailureArray()

+ +
+
+ + + + + + + + +
std::vector<int> string_search::getFailureArray (const std::stringpattern)
+
+

Generate the partial match table aka failure function for a pattern to search.

Parameters
+ + +
[in]patterntext for which to create the partial match table
+
+
+
Returns
the partial match table as a vector array
+
33  {
+
34  int pattern_length = pattern.size();
+
35  std::vector<int> failure(pattern_length + 1);
+
36  failure[0] = -1;
+
37  int j = -1;
+
38 
+
39  for (int i = 0; i < pattern_length; i++) {
+
40  while (j != -1 && pattern[j] != pattern[i]) {
+
41  j = failure[j];
+
42  }
+
43  j++;
+
44  failure[i + 1] = j;
+
45  }
+
46  return failure;
+
47 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ kmp()

+ +
+
+ + + + + + + + + + + + + + + + + + +
bool string_search::kmp (const std::stringpattern,
const std::stringtext 
)
+
+

KMP algorithm to find a pattern in a text

Parameters
+ + + +
[in]patternstring pattern to search
[in]texttext in which to search
+
+
+
Returns
true if pattern was found
+
+false if pattern was not found
+
56  {
+
57  int text_length = text.size(), pattern_length = pattern.size();
+
58  std::vector<int> failure = getFailureArray(pattern);
+
59 
+
60  int k = 0;
+
61  for (int j = 0; j < text_length; j++) {
+
62  while (k != -1 && pattern[k] != text[j]) {
+
63  k = failure[k];
+
64  }
+
65  k++;
+
66  if (k == pattern_length)
+
67  return true;
+
68  }
+
69  return false;
+
70 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ rabin_karp()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int string_search::rabin_karp (const std::stringstr,
const std::stringpat 
)
+
+

Perform string pattern search using Rabin-Karp algorithm

Parameters
+ + + +
[in]strstring to search in
[in]patpattern to search for
+
+
+
Returns
index of first occurrence of pattern
+
+-1 if pattern not found
+
83  {
+
84  int64_t pat_hash = create_hash(pat, pat.size());
+
85  int64_t str_hash = create_hash(str, pat.size());
+
86  for (int i = 0; i <= str.size() - pat.size(); ++i) {
+
87  if (pat_hash == str_hash &&
+
88  check_if_equal(str, pat, i, i + pat.size() - 1, 0,
+
89  pat.size() - 1)) {
+
90  return i;
+
91  }
+
92  if (i < str.size() - pat.size()) {
+
93  str_hash =
+
94  recalculate_hash(str, i, i + pat.size(), str_hash, pat.size());
+
95  }
+
96  }
+
97  return -1; // return -1 if given pattern not found
+
98 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ recalculate_hash()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int64_t string_search::recalculate_hash (const std::strings,
int old_index,
int new_index,
int64_t old_hash,
int patLength 
)
+
+

re-hash a string using known existing hash

Parameters
+ + + + + + +
[in]ssource of string to hash
[in]old_indexprevious index of string
[in]new_indexnew index of string
[in]old_hashprevious hash of substring
[in]patLengthlength of substring to hash
+
+
+
Returns
new hash integer
+
43  {
+
44  int64_t new_hash = old_hash - s[old_index];
+
45  new_hash /= PRIME;
+
46  new_hash += (int64_t)(s[new_index] * (int64_t)pow(PRIME, patLength - 1));
+
47  return new_hash;
+
48 }
+
+
+
+
+
+
STL class.
+ +
T length(T... args)
+
#define PRIME
Prime modulus for hash functions.
Definition: rabin_karp.cpp:16
+
int64_t create_hash(const std::string &s, int n)
Definition: rabin_karp.cpp:25
+
int64_t recalculate_hash(const std::string &s, int old_index, int new_index, int64_t old_hash, int patLength)
Definition: rabin_karp.cpp:42
+
ll k
Definition: matrix_exponentiation.cpp:48
+
bool check_if_equal(const std::string &str1, const std::string &str2, int start1, int end1, int start2, int end2)
Definition: rabin_karp.cpp:60
+
T substr(T... args)
+
std::vector< int > getFailureArray(const std::string &pattern)
Definition: knuth_morris_pratt.cpp:33
+
T pow(T... args)
+ + + + diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map new file mode 100644 index 000000000..dda9e1b72 --- /dev/null +++ b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 new file mode 100644 index 000000000..377758e0f --- /dev/null +++ b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.md5 @@ -0,0 +1 @@ +6f4b42633378ecdfb7d5963098281228 \ No newline at end of file diff --git a/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg new file mode 100644 index 000000000..7b4fd131c --- /dev/null +++ b/d9/d03/namespacestring__search_a21c673d56cbf67b1d2ee4d869185b7d9_cgraph.svg @@ -0,0 +1,83 @@ + + + + + + +string_search::rabin_karp + + + +Node1 + + +string_search::rabin_karp + + + + + +Node2 + + +string_search::check +_if_equal + + + + + +Node1->Node2 + + + + + +Node3 + + +string_search::create_hash + + + + + +Node1->Node3 + + + + + +Node4 + + +string_search::recalculate_hash + + + + + +Node1->Node4 + + + + + +Node5 + + +std::string::size + + + + + +Node1->Node5 + + + + + diff --git a/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map new file mode 100644 index 000000000..2cbf3ca69 --- /dev/null +++ b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5 b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5 new file mode 100644 index 000000000..30ba36175 --- /dev/null +++ b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.md5 @@ -0,0 +1 @@ +8fa29a706e4eac747a1be68c37082dd9 \ No newline at end of file diff --git a/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg new file mode 100644 index 000000000..b43e97d8c --- /dev/null +++ b/d9/d03/namespacestring__search_a26a58225ce7d3fa9d4c2f5349a65ed93_cgraph.svg @@ -0,0 +1,59 @@ + + + + + + +string_search::kmp + + + +Node1 + + +string_search::kmp + + + + + +Node2 + + +string_search::getFailure +Array + + + + + +Node1->Node2 + + + + + +Node3 + + +std::string::size + + + + + +Node1->Node3 + + + + + +Node2->Node3 + + + + + diff --git a/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.map b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.map new file mode 100644 index 000000000..5fe5a63d6 --- /dev/null +++ b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.md5 b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.md5 new file mode 100644 index 000000000..726a28a5d --- /dev/null +++ b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.md5 @@ -0,0 +1 @@ +4f1b0be0f8b16f31249a7add179e9be1 \ No newline at end of file diff --git a/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.svg b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.svg new file mode 100644 index 000000000..28bc6cb4c --- /dev/null +++ b/d9/d03/namespacestring__search_aa422aab133d4ed5e5d6022a7f701271f_cgraph.svg @@ -0,0 +1,38 @@ + + + + + + +string_search::getFailureArray + + + +Node1 + + +string_search::getFailure +Array + + + + + +Node2 + + +std::string::size + + + + + +Node1->Node2 + + + + + diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map new file mode 100644 index 000000000..892362439 --- /dev/null +++ b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5 b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5 new file mode 100644 index 000000000..1e10cdff2 --- /dev/null +++ b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.md5 @@ -0,0 +1 @@ +47972070030315373c4de0ef1d34afa3 \ No newline at end of file diff --git a/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg new file mode 100644 index 000000000..4cec68fdf --- /dev/null +++ b/d9/d03/namespacestring__search_aeb2cd81064717aedd62bfb096b1a73d8_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +string_search::brute_force + + + +Node1 + + +string_search::brute +_force + + + + + +Node2 + + +std::string::length + + + + + +Node1->Node2 + + + + + +Node3 + + +std::string::substr + + + + + +Node1->Node3 + + + + + diff --git a/d9/d1d/structqueue-members.html b/d9/d1d/structqueue-members.html new file mode 100644 index 000000000..2b85546a2 --- /dev/null +++ b/d9/d1d/structqueue-members.html @@ -0,0 +1,125 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
queue< Kind > Member List
+
+
+ +

This is the complete list of members for queue< Kind >, including all inherited members.

+ + + + + + + + + + + + + + + +
clear()queue< Kind >inline
deQueue()queue< Kind >inline
display()queue< Kind >inline
enQueue(Kind item)queue< Kind >inline
front (defined in queue< Kind >)queue< Kind >
front()queue< Kind >inline
isEmptyQueue()queue< Kind >inline
queue()queue< Kind >inline
queueFrontqueue< Kind >private
queueRearqueue< Kind >private
rear (defined in queue< Kind >)queue< Kind >
size (defined in queue< Kind >)queue< Kind >private
t (defined in queue< Kind >)queue< Kind >
~queue()queue< Kind >inline
+
+ + + + diff --git a/d9/d21/classmachine__learning_1_1adaline-members.html b/d9/d21/classmachine__learning_1_1adaline-members.html new file mode 100644 index 000000000..2279591df --- /dev/null +++ b/d9/d21/classmachine__learning_1_1adaline-members.html @@ -0,0 +1,121 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
machine_learning::adaline Member List
+
+
+ +

This is the complete list of members for machine_learning::adaline, including all inherited members.

+ + + + + + + + + + + +
accuracymachine_learning::adalineprivate
activation(double x) (defined in machine_learning::adaline)machine_learning::adalineinline
adaline(int num_features, const double eta=0.01f, const double accuracy=1e-5)machine_learning::adalineinline
check_size_match(const std::vector< double > &x)machine_learning::adalineinlineprivate
etamachine_learning::adalineprivate
fit(const std::vector< double > &x, const int &y)machine_learning::adalineinline
fit(std::vector< double > const (&X)[N], const int *y)machine_learning::adalineinline
operator<<(std::ostream &out, const adaline &ada)machine_learning::adalinefriend
predict(const std::vector< double > &x, double *out=nullptr)machine_learning::adalineinline
weightsmachine_learning::adalineprivate
+
+ + + + diff --git a/d9/d24/poisson__dist_8cpp.html b/d9/d24/poisson__dist_8cpp.html new file mode 100644 index 000000000..4347ff4d2 --- /dev/null +++ b/d9/d24/poisson__dist_8cpp.html @@ -0,0 +1,375 @@ + + + + + + + +Algorithms_in_C++: probability/poisson_dist.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
poisson_dist.cpp File Reference
+
+
+ +

Poisson statistics +More...

+
#include <cmath>
+#include <iostream>
+
+Include dependency graph for poisson_dist.cpp:
+
+
+
+
+
+ + + + + + + + + + + + + +

+Functions

double poisson_rate (double events, double timeframe)
 
double poisson_expected (double rate, double time)
 
double fact (double x)
 
double poisson_x_successes (double expected, double x)
 
double poisson_range_successes (double expected, double lower, double upper)
 
int main ()
 
+

Detailed Description

+

Poisson statistics

+

The Poisson distribution counts how many events occur over a set time interval.

+

Function Documentation

+ +

◆ fact()

+ +
+
+ + + + + + + + +
double fact (double x)
+
+

Compute factorial of a given number

+
30  {
+
31  double x_fact = x;
+
32  for (int i = x - 1; i > 0; i--) {
+
33  x_fact *= i;
+
34  }
+
35 
+
36  if (x_fact <= 0) {
+
37  x_fact = 1;
+
38  }
+
39  return x_fact;
+
40 }
+
+
+
+ +

◆ main()

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

main function

+
65  {
+
66  double rate, expected;
+
67  rate = poisson_rate(3, 1);
+
68  std::cout << "Poisson rate : " << rate << std::endl;
+
69 
+
70  expected = poisson_expected(rate, 2);
+
71  std::cout << "Poisson expected : " << expected << std::endl;
+
72 
+
73  std::cout << "Poisson 0 successes : " << poisson_x_successes(expected, 0)
+
74  << std::endl;
+
75  std::cout << "Poisson 0-8 successes : "
+
76  << poisson_range_successes(expected, 0, 8) << std::endl;
+
77 
+
78  return 0;
+
79 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ poisson_expected()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double poisson_expected (double rate,
double time 
)
+
+

calculate the expected value over a time e.g rate of 2.5 over 10 mins = 2.5 x 10 = 25

+
25 { return rate * time; }
+
+
+
+ +

◆ poisson_range_successes()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
double poisson_range_successes (double expected,
double lower,
double upper 
)
+
+

probability of a success in range for Poisson dist (inclusive, inclusive)

+\[P = \sum_i p(\mu,i)\] +

+
54  {
+
55  double probability = 0;
+
56  for (int i = lower; i <= upper; i++) {
+
57  probability += poisson_x_successes(expected, i);
+
58  }
+
59  return probability;
+
60 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ poisson_rate()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double poisson_rate (double events,
double timeframe 
)
+
+

poisson rate:
+calculate the events per unit time
+e.g 5 dollars every 2 mins = 5 / 2 = 2.5

+
17  {
+
18  return events / timeframe;
+
19 }
+
+
+
+ +

◆ poisson_x_successes()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double poisson_x_successes (double expected,
double x 
)
+
+

Find the probability of x successes in a Poisson dist.

+\[p(\mu,x) = \frac{\mu^x e^{-\mu}}{x!}\] +

+
46  {
+
47  return (std::pow(expected, x) * std::exp(-expected)) / fact(x);
+
48 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
double poisson_range_successes(double expected, double lower, double upper)
Definition: poisson_dist.cpp:54
+
double poisson_rate(double events, double timeframe)
Definition: poisson_dist.cpp:17
+
T endl(T... args)
+
double fact(double x)
Definition: poisson_dist.cpp:30
+
T exp(T... args)
+
T time(T... args)
+
double poisson_expected(double rate, double time)
Definition: poisson_dist.cpp:25
+
double poisson_x_successes(double expected, double x)
Definition: poisson_dist.cpp:46
+
T pow(T... args)
+ + + + diff --git a/d9/d24/poisson__dist_8cpp.js b/d9/d24/poisson__dist_8cpp.js new file mode 100644 index 000000000..d498fe80d --- /dev/null +++ b/d9/d24/poisson__dist_8cpp.js @@ -0,0 +1,9 @@ +var poisson__dist_8cpp = +[ + [ "fact", "d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a", null ], + [ "main", "d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "poisson_expected", "d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71", null ], + [ "poisson_range_successes", "d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a", null ], + [ "poisson_rate", "d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8", null ], + [ "poisson_x_successes", "d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1", null ] +]; \ No newline at end of file diff --git a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map new file mode 100644 index 000000000..0d740da01 --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 new file mode 100644 index 000000000..6c75b52de --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.md5 @@ -0,0 +1 @@ +84e5ede0df4dda59b815b0445ae52411 \ No newline at end of file diff --git a/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg new file mode 100644 index 000000000..2ddbb7b7e --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_a69a136b32707bdc7950fb9057b5fa1e1_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +poisson_x_successes + + + +Node1 + + +poisson_x_successes + + + + + +Node2 + + +std::exp + + + + + +Node1->Node2 + + + + + +Node3 + + +fact + + + + + +Node1->Node3 + + + + + +Node4 + + +std::pow + + + + + +Node1->Node4 + + + + + diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map new file mode 100644 index 000000000..4b9815692 --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 new file mode 100644 index 000000000..045955e03 --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.md5 @@ -0,0 +1 @@ +48caf56af767bc775b0691e488ee80d2 \ No newline at end of file diff --git a/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg new file mode 100644 index 000000000..67cfc5529 --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_ad9c9e74079278ca10e3b97a8d5391c9a_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +poisson_range_successes + + + +Node1 + + +poisson_range_successes + + + + + +Node2 + + +poisson_x_successes + + + + + +Node1->Node2 + + + + + +Node3 + + +std::exp + + + + + +Node2->Node3 + + + + + +Node4 + + +fact + + + + + +Node2->Node4 + + + + + +Node5 + + +std::pow + + + + + +Node2->Node5 + + + + + diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..af35160ed --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..d32db93e6 --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +c4ffd1303f5775c61a1e19286e2fe968 \ No newline at end of file diff --git a/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..e9705e031 --- /dev/null +++ b/d9/d24/poisson__dist_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,148 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +poisson_expected + + + + + +Node1->Node3 + + + + + +Node4 + + +poisson_range_successes + + + + + +Node1->Node4 + + + + + +Node5 + + +poisson_x_successes + + + + + +Node1->Node5 + + + + + +Node9 + + +poisson_rate + + + + + +Node1->Node9 + + + + + +Node4->Node5 + + + + + +Node6 + + +std::exp + + + + + +Node5->Node6 + + + + + +Node7 + + +fact + + + + + +Node5->Node7 + + + + + +Node8 + + +std::pow + + + + + +Node5->Node8 + + + + + diff --git a/d9/d28/class_queue__coll__graph.map b/d9/d28/class_queue__coll__graph.map new file mode 100644 index 000000000..d7c5609d9 --- /dev/null +++ b/d9/d28/class_queue__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d28/class_queue__coll__graph.md5 b/d9/d28/class_queue__coll__graph.md5 new file mode 100644 index 000000000..517da02b7 --- /dev/null +++ b/d9/d28/class_queue__coll__graph.md5 @@ -0,0 +1 @@ +cd13353e82c5578f9a7878594349d7b5 \ No newline at end of file diff --git a/d9/d28/class_queue__coll__graph.svg b/d9/d28/class_queue__coll__graph.svg new file mode 100644 index 000000000..ae3786c62 --- /dev/null +++ b/d9/d28/class_queue__coll__graph.svg @@ -0,0 +1,50 @@ + + + + + + +Queue + + + +Node1 + + +Queue + + + + + +Node2 + + +node< Kind > + + + + + +Node2->Node1 + + + front +rear + + + +Node2->Node2 + + + prev +next +right +left +link + + + diff --git a/d9/d49/kohonen__som__trace_8cpp.html b/d9/d49/kohonen__som__trace_8cpp.html new file mode 100644 index 000000000..d4c446116 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp.html @@ -0,0 +1,662 @@ + + + + + + + +Algorithms_in_C++: machine_learning/kohonen_som_trace.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
kohonen_som_trace.cpp File Reference
+
+
+ +

Kohonen self organizing map (data tracing) +More...

+
#include <algorithm>
+#include <cmath>
+#include <cstdlib>
+#include <ctime>
+#include <fstream>
+#include <iostream>
+#include <valarray>
+#include <vector>
+
+Include dependency graph for kohonen_som_trace.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 machine_learning
 Machine learning algorithms.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

double _random (double a, double b)
 
int save_nd_data (const char *fname, const std::vector< std::valarray< double >> &X)
 
void machine_learning::update_weights (const std::valarray< double > &x, std::vector< std::valarray< double >> *W, std::valarray< double > *D, double alpha, int R)
 
void machine_learning::kohonen_som_tracer (const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)
 
void test_circle (std::vector< std::valarray< double >> *data)
 
void test1 ()
 
void test_lamniscate (std::vector< std::valarray< double >> *data)
 
void test2 ()
 
void test_3d_classes (std::vector< std::valarray< double >> *data)
 
void test3 ()
 
double get_clock_diff (clock_t start_t, clock_t end_t)
 
int main (int argc, char **argv)
 
+

Detailed Description

+

Kohonen self organizing map (data tracing)

+

This example implements a powerful self organizing map algorithm. The algorithm creates a connected network of weights that closely follows the given data points. This this creates a chain of nodes that resembles the given input shape.

+
Author
Krishna Vedala
+
Note
This C++ version of the program is considerable slower than its C counterpart
+
+The compiled code is much slower when compiled with MS Visual C++ 2019 than with GCC on windows
+
See also
kohonen_som_topology.cpp
+

Function Documentation

+ +

◆ get_clock_diff()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double get_clock_diff (clock_t start_t,
clock_t end_t 
)
+
+

Convert clock cycle difference to time in seconds

+
Parameters
+ + + +
[in]start_tstart clock
[in]end_tend clock
+
+
+
Returns
time difference in seconds
+
438  {
+
439  return static_cast<double>(end_t - start_t) / CLOCKS_PER_SEC;
+
440 }
+
+
+
+ +

◆ main()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int main (int argc,
char ** argv 
)
+
+

Main function

+
443  {
+
444 #ifdef _OPENMP
+
445  std::cout << "Using OpenMP based parallelization\n";
+
446 #else
+
447  std::cout << "NOT using OpenMP based parallelization\n";
+
448 #endif
+
449 
+
450  std::srand(std::time(nullptr));
+
451 
+
452  std::clock_t start_clk = std::clock();
+
453  test1();
+
454  auto end_clk = std::clock();
+
455  std::cout << "Test 1 completed in " << get_clock_diff(start_clk, end_clk)
+
456  << " sec\n";
+
457 
+
458  start_clk = std::clock();
+
459  test2();
+
460  end_clk = std::clock();
+
461  std::cout << "Test 2 completed in " << get_clock_diff(start_clk, end_clk)
+
462  << " sec\n";
+
463 
+
464  start_clk = std::clock();
+
465  test3();
+
466  end_clk = std::clock();
+
467  std::cout << "Test 3 completed in " << get_clock_diff(start_clk, end_clk)
+
468  << " sec\n";
+
469 
+
470  std::cout
+
471  << "(Note: Calculated times include: creating test sets, training "
+
472  "model and writing files to disk.)\n\n";
+
473  return 0;
+
474 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test1()

+ +
+
+ + + + + + + +
void test1 ()
+
+

Test that creates a random set of points distributed near the circumference of a circle and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:

    +
  • test1.csv: random test samples points with a circular pattern
  • +
  • w11.csv: initial random map
  • +
  • w12.csv: trained SOM map
  • +
+

The outputs can be readily plotted in gnuplot using the following snippet

set datafile separator ','
+
plot "test1.csv" title "original", \
+
"w11.csv" title "w1", \
+
"w12.csv" title "w2"
+

Sample execution
+output

+
225  {
+
226  int j, N = 500;
+
227  int features = 2;
+
228  int num_out = 50;
+ + +
231  for (int i = 0; i < std::max(num_out, N); i++) {
+
232  // loop till max(N, num_out)
+
233  if (i < N) // only add new arrays if i < N
+
234  X[i] = std::valarray<double>(features);
+
235  if (i < num_out) { // only add new arrays if i < num_out
+
236  W[i] = std::valarray<double>(features);
+
237 
+
238 #ifdef _OPENMP
+
239 #pragma omp for
+
240 #endif
+
241  for (j = 0; j < features; j++)
+
242  // preallocate with random initial weights
+
243  W[i][j] = _random(-1, 1);
+
244  }
+
245  }
+
246 
+
247  test_circle(&X); // create test data around circumference of a circle
+
248  save_nd_data("test1.csv", X); // save test data points
+
249  save_nd_data("w11.csv", W); // save initial random weights
+
250  kohonen_som_tracer(X, &W, 0.1); // train the SOM
+
251  save_nd_data("w12.csv", W); // save the resultant weights
+
252 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test2()

+ +
+
+ + + + + + + +
void test2 ()
+
+

Test that creates a random set of points distributed near the locus of the Lamniscate of Gerono and trains an SOM that finds that circular pattern. The following CSV files are created to validate the execution:

    +
  • test2.csv: random test samples points with a lamniscate pattern
  • +
  • w21.csv: initial random map
  • +
  • w22.csv: trained SOM map
  • +
+

The outputs can be readily plotted in gnuplot using the following snippet

set datafile separator ','
+
plot "test2.csv" title "original", \
+
"w21.csv" title "w1", \
+
"w22.csv" title "w2"
+

Sample execution
+output

+
305  {
+
306  int j, N = 500;
+
307  int features = 2;
+
308  int num_out = 20;
+ + +
311  for (int i = 0; i < std::max(num_out, N); i++) {
+
312  // loop till max(N, num_out)
+
313  if (i < N) // only add new arrays if i < N
+
314  X[i] = std::valarray<double>(features);
+
315  if (i < num_out) { // only add new arrays if i < num_out
+
316  W[i] = std::valarray<double>(features);
+
317 
+
318 #ifdef _OPENMP
+
319 #pragma omp for
+
320 #endif
+
321  for (j = 0; j < features; j++)
+
322  // preallocate with random initial weights
+
323  W[i][j] = _random(-1, 1);
+
324  }
+
325  }
+
326 
+
327  test_lamniscate(&X); // create test data around the lamniscate
+
328  save_nd_data("test2.csv", X); // save test data points
+
329  save_nd_data("w21.csv", W); // save initial random weights
+
330  kohonen_som_tracer(X, &W, 0.01); // train the SOM
+
331  save_nd_data("w22.csv", W); // save the resultant weights
+
332 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test3()

+ +
+
+ + + + + + + +
void test3 ()
+
+

Test that creates a random set of points distributed in six clusters in 3D space. The following CSV files are created to validate the execution:

    +
  • test3.csv: random test samples points with a circular pattern
  • +
  • w31.csv: initial random map
  • +
  • w32.csv: trained SOM map
  • +
+

The outputs can be readily plotted in gnuplot using the following snippet

set datafile separator ','
+
plot "test3.csv" title "original", \
+
"w31.csv" title "w1", \
+
"w32.csv" title "w2"
+

Sample execution
+output

+
402  {
+
403  int j, N = 200;
+
404  int features = 3;
+
405  int num_out = 20;
+ + +
408  for (int i = 0; i < std::max(num_out, N); i++) {
+
409  // loop till max(N, num_out)
+
410  if (i < N) // only add new arrays if i < N
+
411  X[i] = std::valarray<double>(features);
+
412  if (i < num_out) { // only add new arrays if i < num_out
+
413  W[i] = std::valarray<double>(features);
+
414 
+
415 #ifdef _OPENMP
+
416 #pragma omp for
+
417 #endif
+
418  for (j = 0; j < features; j++)
+
419  // preallocate with random initial weights
+
420  W[i][j] = _random(-1, 1);
+
421  }
+
422  }
+
423 
+
424  test_3d_classes(&X); // create test data around the lamniscate
+
425  save_nd_data("test3.csv", X); // save test data points
+
426  save_nd_data("w31.csv", W); // save initial random weights
+
427  kohonen_som_tracer(X, &W, 0.01); // train the SOM
+
428  save_nd_data("w32.csv", W); // save the resultant weights
+
429 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_3d_classes()

+ +
+
+ + + + + + + + +
void test_3d_classes (std::vector< std::valarray< double >> * data)
+
+

Creates a random set of points distributed in six clusters in 3D space with centroids at the points

    +
  • \({0.5, 0.5, 0.5}\)
  • +
  • \({0.5, 0.5, -0.5}\)
  • +
  • \({0.5, -0.5, 0.5}\)
  • +
  • \({0.5, -0.5, -0.5}\)
  • +
  • \({-0.5, 0.5, 0.5}\)
  • +
  • \({-0.5, 0.5, -0.5}\)
  • +
  • \({-0.5, -0.5, 0.5}\)
  • +
  • \({-0.5, -0.5, -0.5}\)
  • +
+
Parameters
+ + +
[out]datamatrix to store data in
+
+
+
347  {
+
348  const int N = data->size();
+
349  const double R = 0.1; // radius of cluster
+
350  int i;
+
351  const int num_classes = 8;
+
352  const double centres[][3] = {
+
353  // centres of each class cluster
+
354  {.5, .5, .5}, // centre of class 0
+
355  {.5, .5, -.5}, // centre of class 1
+
356  {.5, -.5, .5}, // centre of class 2
+
357  {.5, -.5, -.5}, // centre of class 3
+
358  {-.5, .5, .5}, // centre of class 4
+
359  {-.5, .5, -.5}, // centre of class 5
+
360  {-.5, -.5, .5}, // centre of class 6
+
361  {-.5, -.5, -.5} // centre of class 7
+
362  };
+
363 
+
364 #ifdef _OPENMP
+
365 #pragma omp for
+
366 #endif
+
367  for (i = 0; i < N; i++) {
+
368  int cls =
+
369  std::rand() % num_classes; // select a random class for the point
+
370 
+
371  // create random coordinates (x,y,z) around the centre of the class
+
372  data[0][i][0] = _random(centres[cls][0] - R, centres[cls][0] + R);
+
373  data[0][i][1] = _random(centres[cls][1] - R, centres[cls][1] + R);
+
374  data[0][i][2] = _random(centres[cls][2] - R, centres[cls][2] + R);
+
375 
+
376  /* The follosing can also be used
+
377  for (int j = 0; j < 3; j++)
+
378  data[0][i][j] = _random(centres[cls][j] - R, centres[cls][j] + R);
+
379  */
+
380  }
+
381 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_circle()

+ +
+
+ + + + + + + + +
void test_circle (std::vector< std::valarray< double >> * data)
+
+

Creates a random set of points distributed near the circumference of a circle and trains an SOM that finds that circular pattern. The generating function is

+\begin{eqnarray*} r &\in& [1-\delta r, 1+\delta r)\\ \theta &\in& [0, 2\pi)\\ x &=& r\cos\theta\\ y &=& r\sin\theta \end{eqnarray*} +

+
Parameters
+ + +
[out]datamatrix to store data in
+
+
+
188  {
+
189  const int N = data->size();
+
190  const double R = 0.75, dr = 0.3;
+
191  double a_t = 0., b_t = 2.f * M_PI; // theta random between 0 and 2*pi
+
192  double a_r = R - dr, b_r = R + dr; // radius random between R-dr and R+dr
+
193  int i;
+
194 
+
195 #ifdef _OPENMP
+
196 #pragma omp for
+
197 #endif
+
198  for (i = 0; i < N; i++) {
+
199  double r = _random(a_r, b_r); // random radius
+
200  double theta = _random(a_t, b_t); // random theta
+
201  data[0][i][0] = r * cos(theta); // convert from polar to cartesian
+
202  data[0][i][1] = r * sin(theta);
+
203  }
+
204 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test_lamniscate()

+ +
+
+ + + + + + + + +
void test_lamniscate (std::vector< std::valarray< double >> * data)
+
+

Creates a random set of points distributed near the locus of the Lamniscate of Gerono.

+\begin{eqnarray*} \delta r &=& 0.2\\ \delta x &\in& [-\delta r, \delta r)\\ \delta y &\in& [-\delta r, \delta r)\\ \theta &\in& [0, \pi)\\ x &=& \delta x + \cos\theta\\ y &=& \delta y + \frac{\sin(2\theta)}{2} \end{eqnarray*} +

+
Parameters
+ + +
[out]datamatrix to store data in
+
+
+
267  {
+
268  const int N = data->size();
+
269  const double dr = 0.2;
+
270  int i;
+
271 
+
272 #ifdef _OPENMP
+
273 #pragma omp for
+
274 #endif
+
275  for (i = 0; i < N; i++) {
+
276  double dx = _random(-dr, dr); // random change in x
+
277  double dy = _random(-dr, dr); // random change in y
+
278  double theta = _random(0, M_PI); // random theta
+
279  data[0][i][0] = dx + cos(theta); // convert from polar to cartesian
+
280  data[0][i][1] = dy + sin(2. * theta) / 2.f;
+
281  }
+
282 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T srand(T... args)
+ +
T cos(T... args)
+
STL class.
+
void test_3d_classes(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:347
+
int save_nd_data(const char *fname, const std::vector< std::valarray< double >> &X)
Definition: kohonen_som_trace.cpp:57
+
double get_clock_diff(clock_t start_t, clock_t end_t)
Definition: kohonen_som_trace.cpp:438
+
void test1()
Definition: kohonen_som_trace.cpp:225
+
T clock(T... args)
+ +
STL class.
+
void test2()
Definition: kohonen_som_trace.cpp:305
+
T rand(T... args)
+
void test_lamniscate(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:267
+
T sin(T... args)
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
void test3()
Definition: kohonen_som_trace.cpp:402
+
T time(T... args)
+
T max(T... args)
+
double _random(double a, double b)
Definition: kohonen_som_topology.cpp:48
+
void kohonen_som_tracer(const std::vector< std::valarray< double >> &X, std::vector< std::valarray< double >> *W, double alpha_min)
Definition: kohonen_som_trace.cpp:145
+
void test_circle(std::vector< std::valarray< double >> *data)
Definition: kohonen_som_trace.cpp:188
+ + + + diff --git a/d9/d49/kohonen__som__trace_8cpp.js b/d9/d49/kohonen__som__trace_8cpp.js new file mode 100644 index 000000000..d87b0c5cd --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp.js @@ -0,0 +1,16 @@ +var kohonen__som__trace_8cpp = +[ + [ "_USE_MATH_DEFINES", "d9/d66/group__machine__learning.html#ga525335710b53cb064ca56b936120431e", null ], + [ "_random", "d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485", null ], + [ "get_clock_diff", "d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908", null ], + [ "kohonen_som_tracer", "d9/d49/kohonen__som__trace_8cpp.html#acc6a28f40512dbda75ab1a3969248898", null ], + [ "main", "d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "save_nd_data", "d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa", null ], + [ "test1", "d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", null ], + [ "test2", "d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ], + [ "test3", "d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e", null ], + [ "test_3d_classes", "d9/d49/kohonen__som__trace_8cpp.html#a9ab8c79ffb674a63f151f282faeb723b", null ], + [ "test_circle", "d9/d49/kohonen__som__trace_8cpp.html#ab47fb569e63648bd76e7edfdacc02dbd", null ], + [ "test_lamniscate", "d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60", null ], + [ "update_weights", "d9/d49/kohonen__som__trace_8cpp.html#a361674452869413536ee501f053129a8", null ] +]; \ No newline at end of file diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map new file mode 100644 index 000000000..395019575 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -0,0 +1,20 @@ + + + + + + + + + + + + + + + + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 new file mode 100644 index 000000000..2a80f6910 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 @@ -0,0 +1 @@ +0a4a1b543dbdbd5edcbc0f5a6f98482d \ No newline at end of file diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg new file mode 100644 index 000000000..7ebb9b600 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -0,0 +1,379 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen +_som_tracer + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_nd_data + + + + + +Node1->Node14 + + + + + +Node18 + + +test_lamniscate + + + + + +Node1->Node18 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node2 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg new file mode 100644 index 000000000..387bdbfb4 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -0,0 +1,291 @@ + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen +_som_tracer + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_nd_data + + + + + +Node1->Node14 + + + + + +Node18 + + +test_lamniscate + + + + + +Node1->Node18 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node2 + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map new file mode 100644 index 000000000..0f06fe6d8 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map @@ -0,0 +1,20 @@ + + + + + + + + + + + + + + + + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 new file mode 100644 index 000000000..855cd9e52 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 @@ -0,0 +1 @@ +7a30421993cdd2e6bc5eb779c6a80bed \ No newline at end of file diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg new file mode 100644 index 000000000..9c3073f97 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -0,0 +1,379 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen +_som_tracer + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_nd_data + + + + + +Node1->Node14 + + + + + +Node18 + + +test_circle + + + + + +Node1->Node18 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node2 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg new file mode 100644 index 000000000..ce78667ad --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -0,0 +1,291 @@ + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen +_som_tracer + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_nd_data + + + + + +Node1->Node14 + + + + + +Node18 + + +test_circle + + + + + +Node1->Node18 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node2 + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map new file mode 100644 index 000000000..80945d421 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map @@ -0,0 +1,30 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 new file mode 100644 index 000000000..8857af679 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 @@ -0,0 +1 @@ +934891699247b65ef790f89ec18043d6 \ No newline at end of file diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg new file mode 100644 index 000000000..8455fe10d --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -0,0 +1,589 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +get_clock_diff + + + + + +Node1->Node3 + + + + + +Node4 + + +std::srand + + + + + +Node1->Node4 + + + + + +Node5 + + +test1 + + + + + +Node1->Node5 + + + + + +Node23 + + +test2 + + + + + +Node1->Node23 + + + + + +Node25 + + +test3 + + + + + +Node1->Node25 + + + + + +Node28 + + +std::time + + + + + +Node1->Node28 + + + + + +Node6 + + +_random + + + + + +Node5->Node6 + + + + + +Node7 + + +machine_learning::kohonen +_som_tracer + + + + + +Node5->Node7 + + + + + +Node15 + + +std::max + + + + + +Node5->Node15 + + + + + +Node18 + + +save_nd_data + + + + + +Node5->Node18 + + + + + +Node22 + + +test_circle + + + + + +Node5->Node22 + + + + + +Node8 + + +machine_learning::update +_weights + + + + + +Node7->Node8 + + + + + +Node9 + + +std::exp + + + + + +Node8->Node9 + + + + + +Node10 + + +get_min_2d + + + + + +Node8->Node10 + + + + + +Node8->Node15 + + + + + +Node16 + + +std::min + + + + + +Node8->Node16 + + + + + +Node17 + + +std::sqrt + + + + + +Node8->Node17 + + + + + +Node11 + + +std::begin + + + + + +Node10->Node11 + + + + + +Node12 + + +std::distance + + + + + +Node10->Node12 + + + + + +Node13 + + +std::end + + + + + +Node10->Node13 + + + + + +Node14 + + +std::min_element + + + + + +Node10->Node14 + + + + + +Node19 + + +std::ofstream::close + + + + + +Node18->Node19 + + + + + +Node20 + + +std::ofstream::is_open + + + + + +Node18->Node20 + + + + + +Node21 + + +std::ofstream::open + + + + + +Node18->Node21 + + + + + +Node22->Node6 + + + + + +Node23->Node6 + + + + + +Node23->Node7 + + + + + +Node23->Node15 + + + + + +Node23->Node18 + + + + + +Node24 + + +test_lamniscate + + + + + +Node23->Node24 + + + + + +Node24->Node6 + + + + + +Node25->Node6 + + + + + +Node25->Node7 + + + + + +Node25->Node15 + + + + + +Node25->Node18 + + + + + +Node26 + + +test_3d_classes + + + + + +Node25->Node26 + + + + + +Node26->Node6 + + + + + +Node27 + + +std::rand + + + + + +Node26->Node27 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg new file mode 100644 index 000000000..78e160481 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -0,0 +1,501 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +get_clock_diff + + + + + +Node1->Node3 + + + + + +Node4 + + +std::srand + + + + + +Node1->Node4 + + + + + +Node5 + + +test1 + + + + + +Node1->Node5 + + + + + +Node23 + + +test2 + + + + + +Node1->Node23 + + + + + +Node25 + + +test3 + + + + + +Node1->Node25 + + + + + +Node28 + + +std::time + + + + + +Node1->Node28 + + + + + +Node6 + + +_random + + + + + +Node5->Node6 + + + + + +Node7 + + +machine_learning::kohonen +_som_tracer + + + + + +Node5->Node7 + + + + + +Node15 + + +std::max + + + + + +Node5->Node15 + + + + + +Node18 + + +save_nd_data + + + + + +Node5->Node18 + + + + + +Node22 + + +test_circle + + + + + +Node5->Node22 + + + + + +Node8 + + +machine_learning::update +_weights + + + + + +Node7->Node8 + + + + + +Node9 + + +std::exp + + + + + +Node8->Node9 + + + + + +Node10 + + +get_min_2d + + + + + +Node8->Node10 + + + + + +Node8->Node15 + + + + + +Node16 + + +std::min + + + + + +Node8->Node16 + + + + + +Node17 + + +std::sqrt + + + + + +Node8->Node17 + + + + + +Node11 + + +std::begin + + + + + +Node10->Node11 + + + + + +Node12 + + +std::distance + + + + + +Node10->Node12 + + + + + +Node13 + + +std::end + + + + + +Node10->Node13 + + + + + +Node14 + + +std::min_element + + + + + +Node10->Node14 + + + + + +Node19 + + +std::ofstream::close + + + + + +Node18->Node19 + + + + + +Node20 + + +std::ofstream::is_open + + + + + +Node18->Node20 + + + + + +Node21 + + +std::ofstream::open + + + + + +Node18->Node21 + + + + + +Node22->Node6 + + + + + +Node23->Node6 + + + + + +Node23->Node7 + + + + + +Node23->Node15 + + + + + +Node23->Node18 + + + + + +Node24 + + +test_lamniscate + + + + + +Node23->Node24 + + + + + +Node24->Node6 + + + + + +Node25->Node6 + + + + + +Node25->Node7 + + + + + +Node25->Node15 + + + + + +Node25->Node18 + + + + + +Node26 + + +test_3d_classes + + + + + +Node25->Node26 + + + + + +Node26->Node6 + + + + + +Node27 + + +std::rand + + + + + +Node26->Node27 + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.map new file mode 100644 index 000000000..cb18034e1 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.md5 new file mode 100644 index 000000000..8a36ae90f --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.md5 @@ -0,0 +1 @@ +f21bc3dcf3fe76d08d20c0134b0aa0b8 \ No newline at end of file diff --git a/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.svg new file mode 100644 index 000000000..5445f398a --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a412b7afa156306b1f8788643c91a1c60_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +test_lamniscate + + + +Node1 + + +test_lamniscate + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map new file mode 100644 index 000000000..f6ebb95c2 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map @@ -0,0 +1,21 @@ + + + + + + + + + + + + + + + + + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 new file mode 100644 index 000000000..840bbe505 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 @@ -0,0 +1 @@ +07f9539d1bb469553d36294b4554c5f1 \ No newline at end of file diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg new file mode 100644 index 000000000..503416896 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg @@ -0,0 +1,394 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test3 + + + +Node1 + + +test3 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen +_som_tracer + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_nd_data + + + + + +Node1->Node14 + + + + + +Node18 + + +test_3d_classes + + + + + +Node1->Node18 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node2 + + + + + +Node19 + + +std::rand + + + + + +Node18->Node19 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg new file mode 100644 index 000000000..5ab343aa7 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -0,0 +1,306 @@ + + + + + + +test3 + + + +Node1 + + +test3 + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +machine_learning::kohonen +_som_tracer + + + + + +Node1->Node3 + + + + + +Node11 + + +std::max + + + + + +Node1->Node11 + + + + + +Node14 + + +save_nd_data + + + + + +Node1->Node14 + + + + + +Node18 + + +test_3d_classes + + + + + +Node1->Node18 + + + + + +Node4 + + +machine_learning::update +_weights + + + + + +Node3->Node4 + + + + + +Node5 + + +std::exp + + + + + +Node4->Node5 + + + + + +Node6 + + +get_min_2d + + + + + +Node4->Node6 + + + + + +Node4->Node11 + + + + + +Node12 + + +std::min + + + + + +Node4->Node12 + + + + + +Node13 + + +std::sqrt + + + + + +Node4->Node13 + + + + + +Node7 + + +std::begin + + + + + +Node6->Node7 + + + + + +Node8 + + +std::distance + + + + + +Node6->Node8 + + + + + +Node9 + + +std::end + + + + + +Node6->Node9 + + + + + +Node10 + + +std::min_element + + + + + +Node6->Node10 + + + + + +Node15 + + +std::ofstream::close + + + + + +Node14->Node15 + + + + + +Node16 + + +std::ofstream::is_open + + + + + +Node14->Node16 + + + + + +Node17 + + +std::ofstream::open + + + + + +Node14->Node17 + + + + + +Node18->Node2 + + + + + +Node19 + + +std::rand + + + + + +Node18->Node19 + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.map new file mode 100644 index 000000000..7f6aeeb1e --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.md5 new file mode 100644 index 000000000..0be77521c --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.md5 @@ -0,0 +1 @@ +8fb2c65461ab37f7cc7449fa32a12424 \ No newline at end of file diff --git a/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.svg new file mode 100644 index 000000000..2315188e6 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_a9ab8c79ffb674a63f151f282faeb723b_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +test_3d_classes + + + +Node1 + + +test_3d_classes + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + +Node3 + + +std::rand + + + + + +Node1->Node3 + + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.map b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.map new file mode 100644 index 000000000..f93972ef3 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.md5 b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.md5 new file mode 100644 index 000000000..e0554ea15 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.md5 @@ -0,0 +1 @@ +dd1ddac43d9c78c6ab8ac18ee5952db6 \ No newline at end of file diff --git a/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.svg b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.svg new file mode 100644 index 000000000..daf805909 --- /dev/null +++ b/d9/d49/kohonen__som__trace_8cpp_ab47fb569e63648bd76e7edfdacc02dbd_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +test_circle + + + +Node1 + + +test_circle + + + + + +Node2 + + +_random + + + + + +Node1->Node2 + + + + + diff --git a/d9/d57/structtrie__coll__graph.map b/d9/d57/structtrie__coll__graph.map new file mode 100644 index 000000000..e18450df2 --- /dev/null +++ b/d9/d57/structtrie__coll__graph.map @@ -0,0 +1,3 @@ + + + diff --git a/d9/d57/structtrie__coll__graph.md5 b/d9/d57/structtrie__coll__graph.md5 new file mode 100644 index 000000000..129051b4e --- /dev/null +++ b/d9/d57/structtrie__coll__graph.md5 @@ -0,0 +1 @@ +f502dd314fbfcefc3b2fcb099b7dfd66 \ No newline at end of file diff --git a/d9/d57/structtrie__coll__graph.svg b/d9/d57/structtrie__coll__graph.svg new file mode 100644 index 000000000..3d286df54 --- /dev/null +++ b/d9/d57/structtrie__coll__graph.svg @@ -0,0 +1,29 @@ + + + + + + +trie + + + +Node1 + + +trie + + + + + +Node1->Node1 + + + arr + + + diff --git a/d9/d5d/extended__euclid__algorithm_8cpp.html b/d9/d5d/extended__euclid__algorithm_8cpp.html new file mode 100644 index 000000000..a8c5a214e --- /dev/null +++ b/d9/d5d/extended__euclid__algorithm_8cpp.html @@ -0,0 +1,372 @@ + + + + + + + +Algorithms_in_C++: math/extended_euclid_algorithm.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
extended_euclid_algorithm.cpp File Reference
+
+
+ +

GCD using extended Euclid's algorithm +More...

+
#include <algorithm>
+#include <iostream>
+
+Include dependency graph for extended_euclid_algorithm.cpp:
+
+
+
+
+
+ + + + + + + + + + + + + +

+Functions

template<typename T , typename T2 >
void update_step (T *r, T *r0, const T2 quotient)
 
template<typename T1 , typename T2 >
void extendedEuclid_1 (T1 A, T1 B, T1 *GCD, T2 *x, T2 *y)
 
template<typename T , typename T2 >
void extendedEuclid (T A, T B, T *GCD, T2 *x, T2 *y)
 
+int main ()
 Main function.
 
+

Detailed Description

+

GCD using extended Euclid's algorithm

+

Finding coefficients of a and b ie x and y in Bézout's identity

+\[\text{gcd}(a, b) = a \times x + b \times y \] +

+

This is also used in finding Modular multiplicative inverse of a number. (A * B)M == 1 Here B is the MMI of A for given M, so extendedEuclid (A, M) gives B.

+

Function Documentation

+ +

◆ extendedEuclid()

+ +
+
+
+template<typename T , typename T2 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void extendedEuclid (A,
B,
T * GCD,
T2 * x,
T2 * y 
)
+
+

Implementation using recursive algorithm

+
Parameters
+ + + + + + +
[in]Aunsigned
[in]Bunsigned
[out]GCDunsigned
[in,out]xsigned
[in,out]ysigned
+
+
+
70  {
+
71  if (B > A)
+
72  std::swap(A, B); // Ensure that A >= B
+
73 
+
74  if (B == 0) {
+
75  *GCD = A;
+
76  *x = 1;
+
77  *y = 0;
+
78  } else {
+
79  extendedEuclid(B, A % B, GCD, x, y);
+
80  T2 temp = *x;
+
81  *x = *y;
+
82  *y = temp - (A / B) * (*y);
+
83  }
+
84 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ extendedEuclid_1()

+ +
+
+
+template<typename T1 , typename T2 >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void extendedEuclid_1 (T1 A,
T1 B,
T1 * GCD,
T2 * x,
T2 * y 
)
+
+

Implementation using iterative algorithm from Wikipedia

+
Parameters
+ + + + + + +
[in]Aunsigned
[in]Bunsigned
[out]GCDunsigned
[out]xsigned
[out]ysigned
+
+
+
41  {
+
42  if (B > A)
+
43  std::swap(A, B); // Ensure that A >= B
+
44 
+
45  T2 s = 0, s0 = 1;
+
46  T2 t = 1, t0 = 0;
+
47  T1 r = B, r0 = A;
+
48 
+
49  while (r != 0) {
+
50  T1 quotient = r0 / r;
+
51  update_step(&r, &r0, quotient);
+
52  update_step(&s, &s0, quotient);
+
53  update_step(&t, &t0, quotient);
+
54  }
+
55  *GCD = r0;
+
56  *x = s0;
+
57  *y = t0;
+
58 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ update_step()

+ +
+
+
+template<typename T , typename T2 >
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
void update_step (T * r,
T * r0,
const T2 quotient 
)
+
+inline
+
+

function to update the coefficients per iteration

+\[r_0,\,r = r,\, r_0 - \text{quotient}\times r\] +

+
Parameters
+ + + + +
[in,out]rsigned or unsigned
[in,out]r0signed or unsigned
[in]quotientunsigned
+
+
+
24  {
+
25  T temp = *r;
+
26  *r = *r0 - (quotient * temp);
+
27  *r0 = temp;
+
28 }
+
+
+
+
+
+
void update_step(T *r, T *r0, const T2 quotient)
Definition: extended_euclid_algorithm.cpp:24
+
T swap(T... args)
+
void extendedEuclid(T A, T B, T *GCD, T2 *x, T2 *y)
Definition: extended_euclid_algorithm.cpp:70
+ + + + diff --git a/d9/d5d/extended__euclid__algorithm_8cpp.js b/d9/d5d/extended__euclid__algorithm_8cpp.js new file mode 100644 index 000000000..c9bda2411 --- /dev/null +++ b/d9/d5d/extended__euclid__algorithm_8cpp.js @@ -0,0 +1,7 @@ +var extended__euclid__algorithm_8cpp = +[ + [ "extendedEuclid", "d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d", null ], + [ "extendedEuclid_1", "d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25", null ], + [ "main", "d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "update_step", "d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217", null ] +]; \ No newline at end of file diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map new file mode 100644 index 000000000..d05643f31 --- /dev/null +++ b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 new file mode 100644 index 000000000..b25b5784e --- /dev/null +++ b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.md5 @@ -0,0 +1 @@ +0b5961d519770c806e0bb949dea234cd \ No newline at end of file diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg new file mode 100644 index 000000000..120c0bf70 --- /dev/null +++ b/d9/d5d/extended__euclid__algorithm_8cpp_a1792ac7c33aaf26b860ab55f5652ab25_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +extendedEuclid_1 + + + +Node1 + + +extendedEuclid_1 + + + + + +Node2 + + +std::swap + + + + + +Node1->Node2 + + + + + +Node3 + + +update_step + + + + + +Node1->Node3 + + + + + diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map new file mode 100644 index 000000000..6a6eb281c --- /dev/null +++ b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 new file mode 100644 index 000000000..413d115e9 --- /dev/null +++ b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.md5 @@ -0,0 +1 @@ +fbb11d633d8b832d543750d20c5d3cb9 \ No newline at end of file diff --git a/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg new file mode 100644 index 000000000..2d94eb533 --- /dev/null +++ b/d9/d5d/extended__euclid__algorithm_8cpp_acba15ca55b3e7dcb91f3c65d72ba052d_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +extendedEuclid + + + +Node1 + + +extendedEuclid + + + + + +Node2 + + +std::swap + + + + + +Node1->Node2 + + + + + diff --git a/d9/d66/group__machine__learning.html b/d9/d66/group__machine__learning.html new file mode 100644 index 000000000..9db4cc182 --- /dev/null +++ b/d9/d66/group__machine__learning.html @@ -0,0 +1,432 @@ + + + + + + + +Algorithms_in_C++: Machine Learning Algorithms + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
Machine Learning Algorithms
+
+
+ + + + + + + + + + + +

+Files

file  adaline_learning.cpp
 Adaptive Linear Neuron (ADALINE) implementation
 
file  kohonen_som_topology.cpp
 Kohonen self organizing map (topological map)
 
file  kohonen_som_trace.cpp
 Kohonen self organizing map (data tracing)
 
+ + + + +

+Namespaces

 machine_learning
 Machine learning algorithms.
 
+ + + + + + + +

+Macros

+#define MAX_ITER   500
 
+#define _USE_MATH_DEFINES
 
+#define _USE_MATH_DEFINES
 
+ + + + + + + + + +

+Functions

double _random (double a, double b)
 
int save_2d_data (const char *fname, const std::vector< std::valarray< double >> &X)
 
void get_min_2d (const std::vector< std::valarray< double >> &X, double *val, int *x_idx, int *y_idx)
 
int save_nd_data (const char *fname, const std::vector< std::valarray< double >> &X)
 
+

Detailed Description

+

Function Documentation

+ +

◆ _random()

+ +
+
+ + + + + + + + + + + + + + + + + + +
double _random (double a,
double b 
)
+
+

Helper function to generate a random number in a given interval.
+ Steps:

    +
  1. r1 = rand() % 100 gets a random number between 0 and 99
  2. +
  3. r2 = r1 / 100 converts random number to be between 0 and 0.99
  4. +
  5. scale and offset the random number to given range of \([a,b]\)
  6. +
+
Parameters
+ + + +
[in]alower limit
[in]bupper limit
+
+
+
Returns
random number in the range \([a,b]\)
+
48  {
+
49  return ((b - a) * (std::rand() % 100) / 100.f) + a;
+
50 }
+
+
+
+ +

◆ get_min_2d()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void get_min_2d (const std::vector< std::valarray< double >> & X,
double * val,
int * x_idx,
int * y_idx 
)
+
+

Get minimum value and index of the value in a matrix

Parameters
+ + + + + + +
[in]Xmatrix to search
[in]Nnumber of points in the vector
[out]valminimum value found
[out]idx_xx-index where minimum value was found
[out]idx_yy-index where minimum value was found
+
+
+
98  {
+
99  val[0] = INFINITY; // initial min value
+
100  int N = X.size();
+
101 
+
102  for (int i = 0; i < N; i++) { // traverse each x-index
+
103  auto result = std::min_element(std::begin(X[i]), std::end(X[i]));
+
104  double d_min = *result;
+
105  int j = std::distance(std::begin(X[i]), result);
+
106 
+
107  if (d_min < val[0]) { // if a lower value is found
+
108  // save the value and its index
+
109  x_idx[0] = i;
+
110  y_idx[0] = j;
+
111  val[0] = d_min;
+
112  }
+
113  }
+
114 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ save_2d_data()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int save_2d_data (const char * fname,
const std::vector< std::valarray< double >> & X 
)
+
+

Save a given n-dimensional data martix to file.

+
Parameters
+ + + +
[in]fnamefilename to save in (gets overwriten without confirmation)
[in]Xmatrix to save
+
+
+
Returns
0 if all ok
+
+-1 if file creation failed
+
61  {
+
62  size_t num_points = X.size(); // number of rows
+
63  size_t num_features = X[0].size(); // number of columns
+
64 
+
65  std::ofstream fp;
+
66  fp.open(fname);
+
67  if (!fp.is_open()) {
+
68  // error with opening file to write
+
69  std::cerr << "Error opening file " << fname << "\n";
+
70  return -1;
+
71  }
+
72 
+
73  // for each point in the array
+
74  for (int i = 0; i < num_points; i++) {
+
75  // for each feature in the array
+
76  for (int j = 0; j < num_features; j++) {
+
77  fp << X[i][j]; // print the feature value
+
78  if (j < num_features - 1) // if not the last feature
+
79  fp << ","; // suffix comma
+
80  }
+
81  if (i < num_points - 1) // if not the last row
+
82  fp << "\n"; // start a new line
+
83  }
+
84 
+
85  fp.close();
+
86  return 0;
+
87 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ save_nd_data()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int save_nd_data (const char * fname,
const std::vector< std::valarray< double >> & X 
)
+
+

Save a given n-dimensional data martix to file.

+
Parameters
+ + + +
[in]fnamefilename to save in (gets overwriten without confirmation)
[in]Xmatrix to save
+
+
+
Returns
0 if all ok
+
+-1 if file creation failed
+
58  {
+
59  size_t num_points = X.size(); // number of rows
+
60  size_t num_features = X[0].size(); // number of columns
+
61 
+
62  std::ofstream fp;
+
63  fp.open(fname);
+
64  if (!fp.is_open()) {
+
65  // error with opening file to write
+
66  std::cerr << "Error opening file " << fname << "\n";
+
67  return -1;
+
68  }
+
69 
+
70  // for each point in the array
+
71  for (int i = 0; i < num_points; i++) {
+
72  // for each feature in the array
+
73  for (int j = 0; j < num_features; j++) {
+
74  fp << X[i][j]; // print the feature value
+
75  if (j < num_features - 1) // if not the last feature
+
76  fp << ","; // suffix comma
+
77  }
+
78  if (i < num_points - 1) // if not the last row
+
79  fp << "\n"; // start a new line
+
80  }
+
81 
+
82  fp.close();
+
83  return 0;
+
84 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+
T size(T... args)
+
T distance(T... args)
+ +
STL class.
+
T min_element(T... args)
+
T close(T... args)
+
T open(T... args)
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T rand(T... args)
+
T begin(T... args)
+
T end(T... args)
+
T is_open(T... args)
+ + + + diff --git a/d9/d66/group__machine__learning.js b/d9/d66/group__machine__learning.js new file mode 100644 index 000000000..ecd44e4a4 --- /dev/null +++ b/d9/d66/group__machine__learning.js @@ -0,0 +1,11 @@ +var group__machine__learning = +[ + [ "adaline_learning.cpp", "d5/db0/adaline__learning_8cpp.html", null ], + [ "kohonen_som_topology.cpp", "d4/def/kohonen__som__topology_8cpp.html", null ], + [ "kohonen_som_trace.cpp", "d9/d49/kohonen__som__trace_8cpp.html", null ], + [ "machine_learning", "d8/d77/namespacemachine__learning.html", null ], + [ "_random", "d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485", null ], + [ "get_min_2d", "d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f", null ], + [ "save_2d_data", "d9/d66/group__machine__learning.html#ga6c606bc85a3e9fd9d010f874ad760336", null ], + [ "save_nd_data", "d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa", null ] +]; \ No newline at end of file diff --git a/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.map b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.map new file mode 100644 index 000000000..971436eb4 --- /dev/null +++ b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.md5 b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.md5 new file mode 100644 index 000000000..fc02999eb --- /dev/null +++ b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.md5 @@ -0,0 +1 @@ +ea4755d0b258a0c44dd370d5fd895774 \ No newline at end of file diff --git a/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.svg b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.svg new file mode 100644 index 000000000..0cce4ec13 --- /dev/null +++ b/d9/d66/group__machine__learning_ga6c606bc85a3e9fd9d010f874ad760336_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +save_2d_data + + + +Node1 + + +save_2d_data + + + + + +Node2 + + +std::ofstream::close + + + + + +Node1->Node2 + + + + + +Node3 + + +std::ofstream::is_open + + + + + +Node1->Node3 + + + + + +Node4 + + +std::ofstream::open + + + + + +Node1->Node4 + + + + + diff --git a/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.map b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.map new file mode 100644 index 000000000..16587af97 --- /dev/null +++ b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.md5 b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.md5 new file mode 100644 index 000000000..65528be98 --- /dev/null +++ b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.md5 @@ -0,0 +1 @@ +4d255c94880b923cc5d8cd1a22280ced \ No newline at end of file diff --git a/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.svg b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.svg new file mode 100644 index 000000000..c75aa905b --- /dev/null +++ b/d9/d66/group__machine__learning_ga72699c805c19a6cc47a937a6f3378afa_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +save_nd_data + + + +Node1 + + +save_nd_data + + + + + +Node2 + + +std::ofstream::close + + + + + +Node1->Node2 + + + + + +Node3 + + +std::ofstream::is_open + + + + + +Node1->Node3 + + + + + +Node4 + + +std::ofstream::open + + + + + +Node1->Node4 + + + + + diff --git a/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.map b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.map new file mode 100644 index 000000000..a1915fc8e --- /dev/null +++ b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5 b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5 new file mode 100644 index 000000000..746824096 --- /dev/null +++ b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.md5 @@ -0,0 +1 @@ +3b1f452272b5d9c72e6997d348464573 \ No newline at end of file diff --git a/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg new file mode 100644 index 000000000..85990cd27 --- /dev/null +++ b/d9/d66/group__machine__learning_gab53c14440b2b2dd3172c66afc5c2f63f_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +get_min_2d + + + +Node1 + + +get_min_2d + + + + + +Node2 + + +std::begin + + + + + +Node1->Node2 + + + + + +Node3 + + +std::distance + + + + + +Node1->Node3 + + + + + +Node4 + + +std::end + + + + + +Node1->Node4 + + + + + +Node5 + + +std::min_element + + + + + +Node1->Node5 + + + + + diff --git a/d9/d69/median__search_8cpp.html b/d9/d69/median__search_8cpp.html new file mode 100644 index 000000000..48328f5c2 --- /dev/null +++ b/d9/d69/median__search_8cpp.html @@ -0,0 +1,274 @@ + + + + + + + +Algorithms_in_C++: search/median_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
median_search.cpp File Reference
+
+
+ +

Median search algorithm +More...

+
#include <algorithm>
+#include <iostream>
+#include <vector>
+
+Include dependency graph for median_search.cpp:
+
+
+
+
+
+ + + + + + + + +
+#define MAX_NUM   20
 maximum number of values to sort from
 
template<class X >
void comp (X x, std::vector< int > *s1, std::vector< int > *s2, std::vector< int > *s3)
 
int main ()
 
+

Detailed Description

+

Median search algorithm

+
Warning
This core is erroneous and gives invorrect answers. Tested using cases from here
+

Function Documentation

+ +

◆ comp()

+ +
+
+
+template<class X >
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void comp (x,
std::vector< int > * s1,
std::vector< int > * s2,
std::vector< int > * s3 
)
+
+
Todo:
add documentation
+
18  {
+
19  if (s1->size() >= x && s1->size() + s2->size() < x) {
+
20  std::cout << (*s2)[0] << " is the " << x + 1 << "th element from front";
+
21  } else if (s1->size() > x) {
+
22  std::sort(s1->begin(), s1->end());
+
23  std::cout << (*s1)[x] << " is the " << x + 1 << "th element from front";
+
24  } else if (s1->size() + s2->size() <= x && s3->size() > x) {
+
25  std::sort(s3->begin(), s3->end());
+
26  std::cout << (*s3)[x - s1->size() - s2->size()] << " is the " << x + 1
+
27  << "th element from front";
+
28  } else {
+
29  std::cout << x + 1 << " is invalid location";
+
30  }
+
31 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main function

+
38  {
+
39  std::vector<int> v{25, 21, 98, 100, 76, 22, 43, 60, 89, 87};
+ + + +
43 
+
44  // creates an array of random numbers
+
45  // for (int i = 0; i < MAX_NUM; i++) {
+
46  // int r = std::rand() % 1000;
+
47  // v.push_back(r);
+
48  // std::cout << r << " ";
+
49  // }
+
50  for (int r : v) std::cout << r << " ";
+
51 
+
52  int median = std::rand() % 1000; // initialize to a random numnber
+
53 
+
54  std::cout << "\nmedian=" << median << std::endl;
+
55  int avg1, avg2, avg3, sum1 = 0, sum2 = 0, sum3 = 0;
+
56 
+
57  for (int i = 0; i < v.size(); i++) { // iterate through all numbers
+
58  if (v.back() == v[median]) {
+
59  avg1 = sum1 + v.back();
+
60  s2.push_back(v.back());
+
61  } else if (v.back() < v[median]) {
+
62  avg2 = sum2 + v.back();
+
63  s1.push_back(v.back());
+
64  } else {
+
65  avg3 = sum3 + v.back();
+
66  s3.push_back(v.back());
+
67  }
+
68  v.pop_back();
+
69  }
+
70 
+
71  int x;
+
72  std::cout << "enter the no. to be searched form begining:- ";
+
73  std::cin >> x;
+
74  comp(x - 1, &s1, &s2, &s3);
+
75 
+
76  return 0;
+
77 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T size(T... args)
+
T sort(T... args)
+
T push_back(T... args)
+ +
void comp(X x, std::vector< int > *s1, std::vector< int > *s2, std::vector< int > *s3)
Definition: median_search.cpp:17
+
T rand(T... args)
+
T endl(T... args)
+
T begin(T... args)
+
T end(T... args)
+ + + + + diff --git a/d9/d69/median__search_8cpp.js b/d9/d69/median__search_8cpp.js new file mode 100644 index 000000000..7c2b8a171 --- /dev/null +++ b/d9/d69/median__search_8cpp.js @@ -0,0 +1,6 @@ +var median__search_8cpp = +[ + [ "MAX_NUM", "d9/d69/median__search_8cpp.html#a55bfdcfe7613d75fb48ec99c7bf4dd5e", null ], + [ "comp", "d9/d69/median__search_8cpp.html#a3a66390d0e407dce4fcbf63a169c6c8f", null ], + [ "main", "d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.map b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.map new file mode 100644 index 000000000..8fcbf2c93 --- /dev/null +++ b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5 b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5 new file mode 100644 index 000000000..9fcab6e19 --- /dev/null +++ b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.md5 @@ -0,0 +1 @@ +ffe873f0ea41b0d1591f9c6dca12a1bd \ No newline at end of file diff --git a/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg new file mode 100644 index 000000000..6705fab15 --- /dev/null +++ b/d9/d69/median__search_8cpp_a3a66390d0e407dce4fcbf63a169c6c8f_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +comp + + + +Node1 + + +comp + + + + + +Node2 + + +std::vector::begin + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::end + + + + + +Node1->Node3 + + + + + +Node4 + + +std::vector::size + + + + + +Node1->Node4 + + + + + +Node5 + + +std::sort + + + + + +Node1->Node5 + + + + + diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..fce1bb2f7 --- /dev/null +++ b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..73ced9d16 --- /dev/null +++ b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +5e4324f1c9b40fc1eb0cea21e20aaf71 \ No newline at end of file diff --git a/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..9625fa772 --- /dev/null +++ b/d9/d69/median__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,142 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +comp + + + + + +Node1->Node2 + + + + + +Node7 + + +std::endl + + + + + +Node1->Node7 + + + + + +Node8 + + +std::vector::push_back + + + + + +Node1->Node8 + + + + + +Node9 + + +std::rand + + + + + +Node1->Node9 + + + + + +Node3 + + +std::vector::begin + + + + + +Node2->Node3 + + + + + +Node4 + + +std::vector::end + + + + + +Node2->Node4 + + + + + +Node5 + + +std::vector::size + + + + + +Node2->Node5 + + + + + +Node6 + + +std::sort + + + + + +Node2->Node6 + + + + + diff --git a/d9/d78/factorial_8cpp__incl.map b/d9/d78/factorial_8cpp__incl.map new file mode 100644 index 000000000..ddb004d6d --- /dev/null +++ b/d9/d78/factorial_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d78/factorial_8cpp__incl.md5 b/d9/d78/factorial_8cpp__incl.md5 new file mode 100644 index 000000000..5158a37ae --- /dev/null +++ b/d9/d78/factorial_8cpp__incl.md5 @@ -0,0 +1 @@ +bfde82a4fcfc96f2b0afdb174fb9ba9c \ No newline at end of file diff --git a/d9/d78/factorial_8cpp__incl.svg b/d9/d78/factorial_8cpp__incl.svg new file mode 100644 index 000000000..f2ac8a81b --- /dev/null +++ b/d9/d78/factorial_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +math/factorial.cpp + + + +Node1 + + +math/factorial.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d9/d7d/primality__test_8cpp__incl.map b/d9/d7d/primality__test_8cpp__incl.map new file mode 100644 index 000000000..5dc4ce98c --- /dev/null +++ b/d9/d7d/primality__test_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/d7d/primality__test_8cpp__incl.md5 b/d9/d7d/primality__test_8cpp__incl.md5 new file mode 100644 index 000000000..72571c941 --- /dev/null +++ b/d9/d7d/primality__test_8cpp__incl.md5 @@ -0,0 +1 @@ +e1f3170057b0757766eb5fd481b90b26 \ No newline at end of file diff --git a/d9/d7d/primality__test_8cpp__incl.svg b/d9/d7d/primality__test_8cpp__incl.svg new file mode 100644 index 000000000..9343bf7f7 --- /dev/null +++ b/d9/d7d/primality__test_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/primality_test.cpp + + + +Node1 + + +others/primality_test.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d9/d89/fibonacci_8cpp.html b/d9/d89/fibonacci_8cpp.html new file mode 100644 index 000000000..00754b4a0 --- /dev/null +++ b/d9/d89/fibonacci_8cpp.html @@ -0,0 +1,168 @@ + + + + + + + +Algorithms_in_C++: math/fibonacci.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
fibonacci.cpp File Reference
+
+
+ +

Generate fibonacci sequence. +More...

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

+Functions

int fibonacci (unsigned int n)
 
+int main ()
 Main function.
 
+

Detailed Description

+

Generate fibonacci sequence.

+

Calculate the the value on Fibonacci's sequence given an integer as input.

+\[\text{fib}(n) = \text{fib}(n-1) + \text{fib}(n-2)\] +

+
See also
fibonacci_large.cpp, fibonacci_fast.cpp, string_fibonacci.cpp
+

Function Documentation

+ +

◆ fibonacci()

+ +
+
+ + + + + + + + +
int fibonacci (unsigned int n)
+
+

Recursively compute sequences

+
17  {
+
18  /* If the input is 0 or 1 just return the same
+
19  This will set the first 2 values of the sequence */
+
20  if (n <= 1)
+
21  return n;
+
22 
+
23  /* Add the last 2 values of the sequence to get next */
+
24  return fibonacci(n - 1) + fibonacci(n - 2);
+
25 }
+
+
+
+
+
+
int fibonacci(unsigned int n)
Definition: fibonacci.cpp:17
+ + + + diff --git a/d9/d89/fibonacci_8cpp.js b/d9/d89/fibonacci_8cpp.js new file mode 100644 index 000000000..6d421f36f --- /dev/null +++ b/d9/d89/fibonacci_8cpp.js @@ -0,0 +1,5 @@ +var fibonacci_8cpp = +[ + [ "fibonacci", "d9/d89/fibonacci_8cpp.html#a4bc27e88a3da5cc590f1f78622019a7b", null ], + [ "main", "d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d9/d90/struct_btree.html b/d9/d90/struct_btree.html new file mode 100644 index 000000000..86f1d60e0 --- /dev/null +++ b/d9/d90/struct_btree.html @@ -0,0 +1,134 @@ + + + + + + + +Algorithms_in_C++: Btree Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
Btree Struct Reference
+
+
+
+Collaboration diagram for Btree:
+
+
+
+
[legend]
+ + + + + + + + +

+Public Attributes

+int data
 
+struct Btreeleft
 
+struct Btreeright
 
+
The documentation for this struct was generated from the following file:
    +
  • data_structures/morrisinorder.cpp
  • +
+
+
+ + + + diff --git a/d9/d90/struct_btree.js b/d9/d90/struct_btree.js new file mode 100644 index 000000000..8201c81bf --- /dev/null +++ b/d9/d90/struct_btree.js @@ -0,0 +1,6 @@ +var struct_btree = +[ + [ "data", "d9/d90/struct_btree.html#a8377267e55cdc8b366ccb332312427cd", null ], + [ "left", "d9/d90/struct_btree.html#a1e8d38ee6254e3fe11dde3540ce7301e", null ], + [ "right", "d9/d90/struct_btree.html#a87e9234afb3e704333af3a2da6b905d3", null ] +]; \ No newline at end of file diff --git a/d9/dbf/brute__force__string__searching_8cpp__incl.map b/d9/dbf/brute__force__string__searching_8cpp__incl.map new file mode 100644 index 000000000..f9edca3b5 --- /dev/null +++ b/d9/dbf/brute__force__string__searching_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d9/dbf/brute__force__string__searching_8cpp__incl.md5 b/d9/dbf/brute__force__string__searching_8cpp__incl.md5 new file mode 100644 index 000000000..1ce544ba0 --- /dev/null +++ b/d9/dbf/brute__force__string__searching_8cpp__incl.md5 @@ -0,0 +1 @@ +d6b23ef52c7bc9c6d2e62d9dd866eeb7 \ No newline at end of file diff --git a/d9/dbf/brute__force__string__searching_8cpp__incl.svg b/d9/dbf/brute__force__string__searching_8cpp__incl.svg new file mode 100644 index 000000000..a757ce054 --- /dev/null +++ b/d9/dbf/brute__force__string__searching_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +strings/brute_force_string_searching.cpp + + + +Node1 + + +strings/brute_force +_string_searching.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +cstring + + + + + +Node1->Node3 + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + diff --git a/d9/dd7/interpolation__search_8cpp.html b/d9/dd7/interpolation__search_8cpp.html new file mode 100644 index 000000000..278934a49 --- /dev/null +++ b/d9/dd7/interpolation__search_8cpp.html @@ -0,0 +1,250 @@ + + + + + + + +Algorithms_in_C++: search/interpolation_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
interpolation_search.cpp File Reference
+
+
+ +

Interpolation search algorithm +More...

+
#include <iostream>
+
+Include dependency graph for interpolation_search.cpp:
+
+
+
+
+
+ + + + + +

+Functions

int interpolation_search (int arr[], int value, int len)
 
int main ()
 
+

Detailed Description

+

Function Documentation

+ +

◆ interpolation_search()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int interpolation_search (int arr[],
int value,
int len 
)
+
+

function to search the value in an array using interpolation search

Parameters
+ + + + +
[in]arrarray to search in
[in]valuevalue to search for
[in]lenlength of array
+
+
+
Returns
index where the value is found
+
+0 if not found
+
15  {
+
16  int low = 0, high, mid;
+
17  high = len - 1;
+
18 
+
19  while (arr[low] <= value && arr[high] >= value) {
+
20  mid = (low +
+
21  ((value - arr[low]) * (high - low)) / (arr[high] - arr[low]));
+
22  if (arr[mid] > value)
+
23  high = mid - 1;
+
24  else if (arr[mid] < value)
+
25  low = mid + 1;
+
26  else
+
27  return mid;
+
28  }
+
29 
+
30  if (arr[low] == value)
+
31  return low;
+
32 
+
33  return -1;
+
34 }
+
+
+
+ +

◆ main()

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

main function

+
37  {
+
38  int n, value, re;
+
39 
+
40  std::cout << "Enter the size of array(less than 100) : ";
+
41  std::cin >> n;
+
42 
+
43  int *array = new int[n];
+
44 
+
45  std::cout << "array in ascending (increasing) order : " << std::endl;
+
46 
+
47  for (int i = 0; i < n; i++) std::cin >> array[i];
+
48 
+
49  std::cout << "Enter the value you want to search : ";
+
50  std::cin >> value;
+
51 
+
52  re = interpolation_search(array, value, n);
+
53 
+
54  if (re == -1)
+
55  std::cout << "Entered value is not in the array" << std::endl;
+
56  else
+
57  std::cout << "The value is at the position " << re << std::endl;
+
58 
+
59  delete[] array;
+
60  return 0;
+
61 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T endl(T... args)
+
int interpolation_search(int arr[], int value, int len)
Definition: interpolation_search.cpp:15
+ + + + + diff --git a/d9/dd7/interpolation__search_8cpp.js b/d9/dd7/interpolation__search_8cpp.js new file mode 100644 index 000000000..7f7d35ee0 --- /dev/null +++ b/d9/dd7/interpolation__search_8cpp.js @@ -0,0 +1,5 @@ +var interpolation__search_8cpp = +[ + [ "interpolation_search", "d9/dd7/interpolation__search_8cpp.html#a9805865b5c5ca6b0fdf95fd86132625a", null ], + [ "main", "d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..7d6ac758c --- /dev/null +++ b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..65f27786a --- /dev/null +++ b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +d665af387919874679ac99ee240f5731 \ No newline at end of file diff --git a/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..2b968beda --- /dev/null +++ b/d9/dd7/interpolation__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +interpolation_search + + + + + +Node1->Node3 + + + + + diff --git a/d9/dd9/bisection__method_8cpp__incl.map b/d9/dd9/bisection__method_8cpp__incl.map new file mode 100644 index 000000000..f3ad1c718 --- /dev/null +++ b/d9/dd9/bisection__method_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/d9/dd9/bisection__method_8cpp__incl.md5 b/d9/dd9/bisection__method_8cpp__incl.md5 new file mode 100644 index 000000000..494eae297 --- /dev/null +++ b/d9/dd9/bisection__method_8cpp__incl.md5 @@ -0,0 +1 @@ +932365bfc0159aecb9dc21f24f13830d \ No newline at end of file diff --git a/d9/dd9/bisection__method_8cpp__incl.svg b/d9/dd9/bisection__method_8cpp__incl.svg new file mode 100644 index 000000000..e4c97a1ec --- /dev/null +++ b/d9/dd9/bisection__method_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +numerical_methods/bisection_method.cpp + + + +Node1 + + +numerical_methods/bisection +_method.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +limits + + + + + +Node1->Node4 + + + + + diff --git a/d9/ddb/tower__of__hanoi_8cpp__incl.map b/d9/ddb/tower__of__hanoi_8cpp__incl.map new file mode 100644 index 000000000..082c96e9a --- /dev/null +++ b/d9/ddb/tower__of__hanoi_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/d9/ddb/tower__of__hanoi_8cpp__incl.md5 b/d9/ddb/tower__of__hanoi_8cpp__incl.md5 new file mode 100644 index 000000000..52b17e7d5 --- /dev/null +++ b/d9/ddb/tower__of__hanoi_8cpp__incl.md5 @@ -0,0 +1 @@ +61c2e8ebf033582959aed4ad46852c71 \ No newline at end of file diff --git a/d9/ddb/tower__of__hanoi_8cpp__incl.svg b/d9/ddb/tower__of__hanoi_8cpp__incl.svg new file mode 100644 index 000000000..55516a272 --- /dev/null +++ b/d9/ddb/tower__of__hanoi_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/tower_of_hanoi.cpp + + + +Node1 + + +others/tower_of_hanoi.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/d9/dee/classdouble__linked__list.html b/d9/dee/classdouble__linked__list.html new file mode 100644 index 000000000..4450c7e40 --- /dev/null +++ b/d9/dee/classdouble__linked__list.html @@ -0,0 +1,134 @@ + + + + + + + +Algorithms_in_C++: double_linked_list Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
double_linked_list Class Reference
+
+
+ + + + + + + + + + + + +

+Public Member Functions

+void insert (int x)
 
+void remove (int x)
 
+void search (int x)
 
+void show ()
 
+void reverseShow ()
 
+
The documentation for this class was generated from the following file:
    +
  • data_structures/doubly_linked_list.cpp
  • +
+
+
+ + + + diff --git a/d9/dee/classdouble__linked__list.js b/d9/dee/classdouble__linked__list.js new file mode 100644 index 000000000..7db9b7bdc --- /dev/null +++ b/d9/dee/classdouble__linked__list.js @@ -0,0 +1,9 @@ +var classdouble__linked__list = +[ + [ "double_linked_list", "d9/dee/classdouble__linked__list.html#a999c63fbdcc64f1fd367282d417a991e", null ], + [ "insert", "d9/dee/classdouble__linked__list.html#a3b5f341835034d3a74add60781a65470", null ], + [ "remove", "d9/dee/classdouble__linked__list.html#a4a68961af2c26e06c7b37f7de57d5e5f", null ], + [ "reverseShow", "d9/dee/classdouble__linked__list.html#a0525cf734dfd9cd399f3c8d0df138dce", null ], + [ "search", "d9/dee/classdouble__linked__list.html#a25f38dea0b69f2365fe67bdc35f8e0e2", null ], + [ "show", "d9/dee/classdouble__linked__list.html#a81a7f2c5fa23359b9ddd541a6c8b49f9", null ] +]; \ No newline at end of file diff --git a/d9/dfd/primes__up__to__billion_8cpp__incl.map b/d9/dfd/primes__up__to__billion_8cpp__incl.map new file mode 100644 index 000000000..fc3b1314a --- /dev/null +++ b/d9/dfd/primes__up__to__billion_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/d9/dfd/primes__up__to__billion_8cpp__incl.md5 b/d9/dfd/primes__up__to__billion_8cpp__incl.md5 new file mode 100644 index 000000000..af03add45 --- /dev/null +++ b/d9/dfd/primes__up__to__billion_8cpp__incl.md5 @@ -0,0 +1 @@ +30f446c73a35914d6eaa38cf09aa572d \ No newline at end of file diff --git a/d9/dfd/primes__up__to__billion_8cpp__incl.svg b/d9/dfd/primes__up__to__billion_8cpp__incl.svg new file mode 100644 index 000000000..819c308a9 --- /dev/null +++ b/d9/dfd/primes__up__to__billion_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/primes_up_to_billion.cpp + + + +Node1 + + +math/primes_up_to_billion.cpp + + + + + +Node2 + + +cstring + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/da/d23/eulers__totient__function_8cpp.html b/da/d23/eulers__totient__function_8cpp.html new file mode 100644 index 000000000..7e95042f3 --- /dev/null +++ b/da/d23/eulers__totient__function_8cpp.html @@ -0,0 +1,187 @@ + + + + + + + +Algorithms_in_C++: math/eulers_totient_function.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
eulers_totient_function.cpp File Reference
+
+
+ +

C++ Program to find Euler's Totient function. +More...

+
#include <cstdlib>
+#include <iostream>
+
+Include dependency graph for eulers_totient_function.cpp:
+
+
+
+
+
+ + + + + + +

+Functions

uint64_t phiFunction (uint64_t n)
 
+int main (int argc, char *argv[])
 Main function.
 
+

Detailed Description

+

C++ Program to find Euler's Totient function.

+

Euler Totient Function is also known as phi function.

+\[\phi(n) = \phi\left({p_1}^{a_1}\right)\cdot\phi\left({p_2}^{a_2}\right)\ldots\] +

+

where \(p_1\), \(p_2\), \(\ldots\) are prime factors of n.
+3 Euler's properties:

    +
  1. \(\phi(n) = n-1\)
  2. +
  3. \(\phi(n^k) = n^k - n^{k-1}\)
  4. +
  5. \(\phi(a,b) = \phi(a)\cdot\phi(b)\) where a and b are relative primes.
  6. +
+

Applying this 3 properties on the first equation.

+\[\phi(n) = n\cdot\left(1-\frac{1}{p_1}\right)\cdot\left(1-\frac{1}{p_2}\right)\cdots\] +

+

where \(p_1\), \(p_2\)... are prime factors. Hence Implementation in \(O\left(\sqrt{n}\right)\).
+Some known values are:

    +
  • \(\phi(100) = 40\)
  • +
  • \(\phi(1) = 1\)
  • +
  • \(\phi(17501) = 15120\)
  • +
  • \(\phi(1420) = 560\)
  • +
+

Function Documentation

+ +

◆ phiFunction()

+ +
+
+ + + + + + + + +
uint64_t phiFunction (uint64_t n)
+
+

Function to caculate Euler's totient phi

+
32  {
+
33  uint64_t result = n;
+
34  for (uint64_t i = 2; i * i <= n; i++) {
+
35  if (n % i == 0) {
+
36  while (n % i == 0) {
+
37  n /= i;
+
38  }
+
39  result -= result / i;
+
40  }
+
41  }
+
42  if (n > 1)
+
43  result -= result / n;
+
44  return result;
+
45 }
+
+
+
+
+
+ + + + diff --git a/da/d23/eulers__totient__function_8cpp.js b/da/d23/eulers__totient__function_8cpp.js new file mode 100644 index 000000000..6ae58b409 --- /dev/null +++ b/da/d23/eulers__totient__function_8cpp.js @@ -0,0 +1,5 @@ +var eulers__totient__function_8cpp = +[ + [ "main", "da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "phiFunction", "da/d23/eulers__totient__function_8cpp.html#a35e4874a3e1d67eb708dc57944c8aea0", null ] +]; \ No newline at end of file diff --git a/da/d24/sqrt__double_8cpp.html b/da/d24/sqrt__double_8cpp.html new file mode 100644 index 000000000..f8f1d6114 --- /dev/null +++ b/da/d24/sqrt__double_8cpp.html @@ -0,0 +1,214 @@ + + + + + + + +Algorithms_in_C++: math/sqrt_double.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
sqrt_double.cpp File Reference
+
+
+ +

Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding. +More...

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

+Functions

double Sqrt (double a)
 
int main ()
 
+

Detailed Description

+

Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding.

+
See also
Can be implemented using faster and better algorithms like newton_raphson_method.cpp and false_position.cpp
+

Function Documentation

+ +

◆ main()

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

main function

+
42  {
+
43  double n{};
+
44  std::cin >> n;
+
45  assert(n >= 0);
+
46  // Change this line for a better precision
+
47  std::cout.precision(12);
+
48  std::cout << std::fixed << Sqrt(n);
+
49 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ Sqrt()

+ +
+
+ + + + + + + + +
double Sqrt (double a)
+
+

Bisection method implemented for the function \(x^2-a=0\) whose roots are \(\pm\sqrt{a}\) and only the positive root is returned.

+
16  {
+
17  if (a > 0 && a < 1) {
+
18  return 1 / Sqrt(1 / a);
+
19  }
+
20  double l = 0, r = a;
+
21  /* Epsilon is the precision.
+
22  A great precision is
+
23  between 1e-7 and 1e-12.
+
24  double epsilon = 1e-12;
+
25  */
+
26  double epsilon = 1e-12;
+
27  while (l <= r) {
+
28  double mid = (l + r) / 2;
+
29  if (mid * mid > a) {
+
30  r = mid;
+
31  } else {
+
32  if (a - mid * mid < epsilon) {
+
33  return mid;
+
34  }
+
35  l = mid;
+
36  }
+
37  }
+
38  return -1;
+
39 }
+
+
+
+
+
+
double Sqrt(double a)
Definition: sqrt_double.cpp:16
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T fixed(T... args)
+ + + + + diff --git a/da/d24/sqrt__double_8cpp.js b/da/d24/sqrt__double_8cpp.js new file mode 100644 index 000000000..b11b60048 --- /dev/null +++ b/da/d24/sqrt__double_8cpp.js @@ -0,0 +1,5 @@ +var sqrt__double_8cpp = +[ + [ "main", "da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "Sqrt", "da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc", null ] +]; \ No newline at end of file diff --git a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..c873db959 --- /dev/null +++ b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..6e5f3c8a3 --- /dev/null +++ b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +0176794783568318387cfc3255334703 \ No newline at end of file diff --git a/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..d91c49954 --- /dev/null +++ b/da/d24/sqrt__double_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::fixed + + + + + +Node1->Node2 + + + + + +Node3 + + +Sqrt + + + + + +Node1->Node3 + + + + + diff --git a/da/d35/sieve__of__eratosthenes_8cpp__incl.map b/da/d35/sieve__of__eratosthenes_8cpp__incl.map new file mode 100644 index 000000000..41109c6d6 --- /dev/null +++ b/da/d35/sieve__of__eratosthenes_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/da/d35/sieve__of__eratosthenes_8cpp__incl.md5 b/da/d35/sieve__of__eratosthenes_8cpp__incl.md5 new file mode 100644 index 000000000..0c712b49b --- /dev/null +++ b/da/d35/sieve__of__eratosthenes_8cpp__incl.md5 @@ -0,0 +1 @@ +791cb4e5ff70b85cb6b28271313338ec \ No newline at end of file diff --git a/da/d35/sieve__of__eratosthenes_8cpp__incl.svg b/da/d35/sieve__of__eratosthenes_8cpp__incl.svg new file mode 100644 index 000000000..e461ad1b5 --- /dev/null +++ b/da/d35/sieve__of__eratosthenes_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +math/sieve_of_eratosthenes.cpp + + + +Node1 + + +math/sieve_of_eratosthenes.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl.map b/da/d5d/non__recursive__merge__sort_8cpp__incl.map new file mode 100644 index 000000000..ff05e0d3b --- /dev/null +++ b/da/d5d/non__recursive__merge__sort_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl.md5 b/da/d5d/non__recursive__merge__sort_8cpp__incl.md5 new file mode 100644 index 000000000..769d5eea4 --- /dev/null +++ b/da/d5d/non__recursive__merge__sort_8cpp__incl.md5 @@ -0,0 +1 @@ +58df0c0445e990312cb71446036b3b36 \ No newline at end of file diff --git a/da/d5d/non__recursive__merge__sort_8cpp__incl.svg b/da/d5d/non__recursive__merge__sort_8cpp__incl.svg new file mode 100644 index 000000000..35ad5e577 --- /dev/null +++ b/da/d5d/non__recursive__merge__sort_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +sorting/non_recursive_merge_sort.cpp + + + +Node1 + + +sorting/non_recursive +_merge_sort.cpp + + + + + +Node2 + + +cstddef + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +utility + + + + + +Node1->Node4 + + + + + diff --git a/da/d7b/primality__test_8cpp.html b/da/d7b/primality__test_8cpp.html new file mode 100644 index 000000000..6b6ca2976 --- /dev/null +++ b/da/d7b/primality__test_8cpp.html @@ -0,0 +1,213 @@ + + + + + + + +Algorithms_in_C++: others/primality_test.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
primality_test.cpp File Reference
+
+
+ +

Primality test implementation. +More...

+
#include <iostream>
+
+Include dependency graph for primality_test.cpp:
+
+
+
+
+
+ + + + + +

+Functions

bool IsPrime (int number)
 
int main ()
 
+

Detailed Description

+

Primality test implementation.

+

A simple and efficient implementation of a function to test if a number is prime, based on the fact that

+

Every Prime number, except 2 and 3, are of the form \(6k\pm1\) for integer values of k.

+
+

This gives a 3x speed improvement.

+

Function Documentation

+ +

◆ IsPrime()

+ +
+
+ + + + + + + + +
bool IsPrime (int number)
+
+

Check if a number is prime

Parameters
+ + +
[in]numbernumber to check
+
+
+
Returns
true if prime else false
+
18  {
+
19  if (((!(number & 1)) && number != 2) || (number < 2) ||
+
20  (number % 3 == 0 && number != 3))
+
21  return false;
+
22 
+
23  for (int k = 1; 36 * k * k - 12 * k < number; ++k) {
+
24  if ((number % (6 * k + 1) == 0) || (number % (6 * k - 1) == 0))
+
25  return false;
+
26  }
+
27  return true;
+
28 }
+
+
+
+ +

◆ main()

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

main function

+
31  {
+
32  // Main Function
+
33  std::cout << "Enter the value of n to check if Prime\n";
+
34  int n;
+
35  std::cin >> n;
+
36  if (IsPrime(n))
+
37  std::cout << n << " is Prime" << std::endl;
+
38  else
+
39  std::cout << n << " is not Prime" << std::endl;
+
40 
+
41  return 0;
+
42 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
ll k
Definition: matrix_exponentiation.cpp:48
+
T endl(T... args)
+
bool IsPrime(int number)
Definition: primality_test.cpp:18
+ + + + + diff --git a/da/d7b/primality__test_8cpp.js b/da/d7b/primality__test_8cpp.js new file mode 100644 index 000000000..d91230bc8 --- /dev/null +++ b/da/d7b/primality__test_8cpp.js @@ -0,0 +1,5 @@ +var primality__test_8cpp = +[ + [ "IsPrime", "da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf", null ], + [ "main", "da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..8e411ca47 --- /dev/null +++ b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..961035459 --- /dev/null +++ b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +a3db6c349ac8859688ff501e9f3bf486 \ No newline at end of file diff --git a/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..678df135c --- /dev/null +++ b/da/d7b/primality__test_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +IsPrime + + + + + +Node1->Node3 + + + + + diff --git a/da/d8a/paranthesis__matching_8cpp__incl.map b/da/d8a/paranthesis__matching_8cpp__incl.map new file mode 100644 index 000000000..3881edb3b --- /dev/null +++ b/da/d8a/paranthesis__matching_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/da/d8a/paranthesis__matching_8cpp__incl.md5 b/da/d8a/paranthesis__matching_8cpp__incl.md5 new file mode 100644 index 000000000..324b52ee5 --- /dev/null +++ b/da/d8a/paranthesis__matching_8cpp__incl.md5 @@ -0,0 +1 @@ +0d81f1e5f2406777e3ec79c8049531af \ No newline at end of file diff --git a/da/d8a/paranthesis__matching_8cpp__incl.svg b/da/d8a/paranthesis__matching_8cpp__incl.svg new file mode 100644 index 000000000..54c539b44 --- /dev/null +++ b/da/d8a/paranthesis__matching_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +others/paranthesis_matching.cpp + + + +Node1 + + +others/paranthesis +_matching.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +cstring + + + + + +Node1->Node3 + + + + + diff --git a/da/d9a/class_graph.html b/da/d9a/class_graph.html new file mode 100644 index 000000000..e0d56a504 --- /dev/null +++ b/da/d9a/class_graph.html @@ -0,0 +1,581 @@ + + + + + + + +Algorithms_in_C++: Graph Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for Graph:
+
+
+
+
[legend]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

Graph (int V, int E)
 
+void addEdge (int src, int dst, int weight)
 
Graph (int V)
 
+void addEdge (int src, int dst, int weight)
 
Graph (Graph &&)=default
 
+Graphoperator= (Graph &&)=default
 
Graph (Graph const &)=default
 
+Graphoperator= (Graph const &)=default
 
 Graph (unsigned int vertices, AdjList const &adjList)
 
 Graph (unsigned int vertices, AdjList &&adjList)
 
 Graph (unsigned int vertices, std::vector< Edge > const &edges)
 
std::remove_reference_t< AdjList > const & getAdjList () const
 
std::remove_reference_t< unsigned int > const & getVertices () const
 
void addVertices (unsigned int num=1)
 
void addEdge (Edge const &edge)
 
void addEdge (unsigned int source, unsigned int destination)
 
+void set_graph (void)
 
+void ford_fulkerson (void)
 
+void print_flow_info (void)
 
Graph (const int V)
 
+void addEdge (int src, int dst, int weight)
 
+ + + + + + + + + +

+Public Attributes

+int vertexNum
 
+int edgeNum
 
+Edgeedges
 
+int ** edges
 
+ + + +

+Private Member Functions

+bool bfs (int source, int sink)
 
+ + + + + + + + + + + + + + + + + + + + + + + + + +

+Private Attributes

+unsigned int m_vertices
 
+AdjList m_adjList
 
+int residual_capacity [MAXN][MAXN]
 
+int capacity [MAXN][MAXN]
 
+int total_nodes
 
+int total_edges
 
+int source
 
+int sink
 
+int parent [MAXN]
 
+std::vector< std::tuple< int, int, int > > edge_participated
 
+std::bitset< MAXN > visited
 
+int max_flow = 0
 
+

Detailed Description

+

Implementation of graph class.

+

The graph will be represented using Adjacency List representation. This class contains 2 data members "m_vertices" & "m_adjList" used to represent the number of vertices and adjacency list of the graph respectively. The vertices are labelled 0 - (m_vertices - 1).

+

Constructor & Destructor Documentation

+ +

◆ Graph() [1/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Graph::Graph (unsigned int vertices,
AdjList const & adjList 
)
+
+inline
+
+

Create a graph from vertices and adjacency list.

+
Parameters
+ + + +
verticesspecify the number of vertices the graph would contain.
adjListis the adjacency list representation of graph.
+
+
+
71  : m_vertices(vertices), m_adjList(adjList) {}
+
+
+
+ +

◆ Graph() [2/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Graph::Graph (unsigned int vertices,
AdjList && adjList 
)
+
+inline
+
+

Create a graph from vertices and adjacency list.

+
Parameters
+ + + +
verticesspecify the number of vertices the graph would contain.
adjListis the adjacency list representation of graph.
+
+
+
79  : m_vertices(std::move(vertices)), m_adjList(std::move(adjList)) {}
+
+
+
+ +

◆ Graph() [3/3]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
Graph::Graph (unsigned int vertices,
std::vector< Edge > const & edges 
)
+
+inline
+
+

Create a graph from vertices and a set of edges.

+

Adjacency list of the graph would be created from the set of edges. If the source or destination of any edge has a value greater or equal to number of vertices, then it would throw a range_error.

+
Parameters
+ + + +
verticesspecify the number of vertices the graph would contain.
edgesis a vector of edges.
+
+
+
91  : m_vertices(vertices) {
+
92  for (auto const& edge : edges) {
+
93  if (edge.src >= vertices || edge.dest >= vertices) {
+
94  throw std::range_error(
+
95  "Either src or dest of edge out of range");
+
96  }
+
97  m_adjList[edge.src].emplace_back(edge.dest);
+
98  }
+
99  }
+
+
+
+

Member Function Documentation

+ +

◆ addEdge() [1/2]

+ +
+
+ + + + + +
+ + + + + + + + +
void Graph::addEdge (Edge const & edge)
+
+inline
+
+

Add an edge in the graph.

+
Parameters
+ + +
edgethat needs to be added.
+
+
+
128  {
+
129  if (edge.src >= m_vertices || edge.dest >= m_vertices) {
+
130  throw std::range_error("Either src or dest of edge out of range");
+
131  }
+
132  m_adjList[edge.src].emplace_back(edge.dest);
+
133  }
+
+
+
+ +

◆ addEdge() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void Graph::addEdge (unsigned int source,
unsigned int destination 
)
+
+inline
+
+

Add an Edge in the graph

+
Parameters
+ + + +
sourceis source vertex of the edge.
destinationis the destination vertex of the edge.
+
+
+
140  {
+
141  if (source >= m_vertices || destination >= m_vertices) {
+
142  throw std::range_error(
+
143  "Either source or destination of edge out of range");
+
144  }
+
145  m_adjList[source].emplace_back(destination);
+
146  }
+
+
+
+ +

◆ addVertices()

+ +
+
+ + + + + +
+ + + + + + + + +
void Graph::addVertices (unsigned int num = 1)
+
+inline
+
+

Add vertices in the graph.

+
Parameters
+ + +
numis the number of vertices to be added. It adds 1 vertex by default.
+
+
+
122 { m_vertices += num; }
+
+
+
+ +

◆ getAdjList()

+ +
+
+ + + + + +
+ + + + + + + +
std::remove_reference_t<AdjList> const& Graph::getAdjList () const
+
+inline
+
+

Return a const reference of the adjacency list.

+
Returns
const reference to the adjacency list
+
105  {
+
106  return m_adjList;
+
107  }
+
+
+
+ +

◆ getVertices()

+ +
+
+ + + + + +
+ + + + + + + +
std::remove_reference_t<unsigned int> const& Graph::getVertices () const
+
+inline
+
+
Returns
number of vertices in the graph.
+
112  {
+
113  return m_vertices;
+
114  }
+
+
+
+
The documentation for this class was generated from the following files:
    +
  • dynamic_programming/bellman_ford.cpp
  • +
  • dynamic_programming/floyd_warshall.cpp
  • +
  • graph/cycle_check_directed_graph.cpp
  • +
  • graph/max_flow_with_ford_fulkerson_and_edmond_karp_algo.cpp
  • +
  • greedy_algorithms/dijkstra.cpp
  • +
+
+
+
T move(T... args)
+ + + + + diff --git a/da/d9a/class_graph.js b/da/d9a/class_graph.js new file mode 100644 index 000000000..a144a4361 --- /dev/null +++ b/da/d9a/class_graph.js @@ -0,0 +1,45 @@ +var class_graph = +[ + [ "Graph", "da/d9a/class_graph.html#ad3b98f95ee53f91afad11b8eaddc35e0", null ], + [ "Graph", "da/d9a/class_graph.html#af3ff6b295df8bf3bee0bafd7c7d56915", null ], + [ "~Graph", "da/d9a/class_graph.html#a902c5b3eacb66d60752525ab23297a95", null ], + [ "Graph", "da/d9a/class_graph.html#ae4c72b8ac4d693c49800a4c7e273654f", null ], + [ "~Graph", "da/d9a/class_graph.html#a9f341e2e8348a3f484987bdb0cec8006", null ], + [ "Graph", "da/d9a/class_graph.html#ade809d353b640b9c2773d71d4f57d57d", null ], + [ "Graph", "da/d9a/class_graph.html#a04365fc6f13bf330e38dbc1424134827", null ], + [ "Graph", "da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8", null ], + [ "Graph", "da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3", null ], + [ "Graph", "da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1", null ], + [ "Graph", "da/d9a/class_graph.html#ae4c72b8ac4d693c49800a4c7e273654f", null ], + [ "Graph", "da/d9a/class_graph.html#acfa457b5f6f7eb480fd469fb980a01ea", null ], + [ "addEdge", "da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5", null ], + [ "addEdge", "da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4", null ], + [ "addEdge", "da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4", null ], + [ "addEdge", "da/d9a/class_graph.html#a6dc4dd4ce49c4052ad2a5d27523881f4", null ], + [ "addEdge", "da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910", null ], + [ "addVertices", "da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413", null ], + [ "bfs", "da/d9a/class_graph.html#acfd6fbc5243626bfb7b7116b76fedab0", null ], + [ "ford_fulkerson", "da/d9a/class_graph.html#aa3f6376d7f744929f515214ea90c5280", null ], + [ "getAdjList", "da/d9a/class_graph.html#ae8959064e179573cc48f8cee99115c07", null ], + [ "getVertices", "da/d9a/class_graph.html#a8aa88a88269773cc4dba255dec035898", null ], + [ "operator=", "da/d9a/class_graph.html#a14da756c7e346c651e8cf14df2437d4a", null ], + [ "operator=", "da/d9a/class_graph.html#ac3e58f4a0c8c65befe6629f4e1b71142", null ], + [ "print_flow_info", "da/d9a/class_graph.html#ae0d2312723fb56a431e6fba4f264d25c", null ], + [ "set_graph", "da/d9a/class_graph.html#a13e73168c59bf97020bbc28a34b115bc", null ], + [ "capacity", "da/d9a/class_graph.html#ada0d96b867fe317f251c5a025a1ee8b3", null ], + [ "edge_participated", "da/d9a/class_graph.html#a73268574e2528b8e760191113ef6d1eb", null ], + [ "edgeNum", "da/d9a/class_graph.html#a10ff9c6c323cf435f18e424dbb62235e", null ], + [ "edges", "da/d9a/class_graph.html#a268ba18d421817ad8713c2e92f19d82a", null ], + [ "edges", "da/d9a/class_graph.html#a3535be2ce0d62152e54395951330da81", null ], + [ "m_adjList", "da/d9a/class_graph.html#a13697caf8be6275ebb7b9497c9a9d6e5", null ], + [ "m_vertices", "da/d9a/class_graph.html#a61943646676002a5e75f7b6493c25713", null ], + [ "max_flow", "da/d9a/class_graph.html#aa0aaff1a0c13bdf209ea40b83ac01ae6", null ], + [ "parent", "da/d9a/class_graph.html#a08e82d027824859388cd85c83bfbc314", null ], + [ "residual_capacity", "da/d9a/class_graph.html#af0e8f10f05298718b830d7c01a7cd69c", null ], + [ "sink", "da/d9a/class_graph.html#a47336f7cfe4698ef887a34e03f1a3856", null ], + [ "source", "da/d9a/class_graph.html#a9912e31b32405d21a4c22a9ab8dece30", null ], + [ "total_edges", "da/d9a/class_graph.html#ad621c5393837c21780ff3477431707ac", null ], + [ "total_nodes", "da/d9a/class_graph.html#ae93ae98711b868af601d424954fe94ac", null ], + [ "vertexNum", "da/d9a/class_graph.html#a6afcd41564ea00294a4c089414979ca1", null ], + [ "visited", "da/d9a/class_graph.html#af1abf6ea5346e12dea4df46262ff35aa", null ] +]; \ No newline at end of file diff --git a/da/d9a/palindrome__of__number_8cpp.html b/da/d9a/palindrome__of__number_8cpp.html new file mode 100644 index 000000000..c80c2dcfb --- /dev/null +++ b/da/d9a/palindrome__of__number_8cpp.html @@ -0,0 +1,181 @@ + + + + + + + +Algorithms_in_C++: others/palindrome_of_number.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
palindrome_of_number.cpp File Reference
+
+
+ +

Check if a number is palindrome or not. +More...

+
#include <algorithm>
+#include <iostream>
+#include <cstring>
+
+Include dependency graph for palindrome_of_number.cpp:
+
+
+
+
+
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

Check if a number is palindrome or not.

+

This program cheats by using the STL library's std::reverse function.

+

Function Documentation

+ +

◆ main()

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

Main function

+
19  {
+
20  int num;
+
21  std::cout << "Enter number = ";
+
22  std::cin >> num;
+
23 
+
24  std::string s1 = std::to_string(num); // convert number to string
+
25  std::string s2 = s1;
+
26 
+
27  std::reverse(s1.begin(), s1.end()); // reverse the string
+
28 
+
29  if (s1 == s2) // check if reverse and original string are identical
+
30  std::cout << "true";
+
31  else
+
32  std::cout << "false";
+
33 
+
34  return 0;
+
35 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
STL class.
+
T reverse(T... args)
+ +
T to_string(T... args)
+
T begin(T... args)
+
T end(T... args)
+ + + + + diff --git a/da/d9a/palindrome__of__number_8cpp.js b/da/d9a/palindrome__of__number_8cpp.js new file mode 100644 index 000000000..59a81bbcb --- /dev/null +++ b/da/d9a/palindrome__of__number_8cpp.js @@ -0,0 +1,4 @@ +var palindrome__of__number_8cpp = +[ + [ "main", "da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..27eb08118 --- /dev/null +++ b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..872193869 --- /dev/null +++ b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +96910d526327bd4ff05b94521e561074 \ No newline at end of file diff --git a/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..0467d84a8 --- /dev/null +++ b/da/d9a/palindrome__of__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::string::begin + + + + + +Node1->Node2 + + + + + +Node3 + + +std::string::end + + + + + +Node1->Node3 + + + + + +Node4 + + +std::reverse + + + + + +Node1->Node4 + + + + + +Node5 + + +std::to_string + + + + + +Node1->Node5 + + + + + diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.map b/da/dd3/classmachine__learning_1_1adaline__coll__graph.map new file mode 100644 index 000000000..df0d4d328 --- /dev/null +++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 b/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 new file mode 100644 index 000000000..e276df400 --- /dev/null +++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.md5 @@ -0,0 +1 @@ +b8bfec821ee10d3c3cbf2dac5a63bec0 \ No newline at end of file diff --git a/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg b/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg new file mode 100644 index 000000000..b7de37ee0 --- /dev/null +++ b/da/dd3/classmachine__learning_1_1adaline__coll__graph.svg @@ -0,0 +1,38 @@ + + + + + + +machine_learning::adaline + + + +Node1 + + +machine_learning::adaline + + + + + +Node2 + + +std::vector< double > + + + + + +Node2->Node1 + + + weights + + + diff --git a/da/dd9/happy__number_8cpp__incl.map b/da/dd9/happy__number_8cpp__incl.map new file mode 100644 index 000000000..76d6c53d6 --- /dev/null +++ b/da/dd9/happy__number_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/da/dd9/happy__number_8cpp__incl.md5 b/da/dd9/happy__number_8cpp__incl.md5 new file mode 100644 index 000000000..f46a72ad7 --- /dev/null +++ b/da/dd9/happy__number_8cpp__incl.md5 @@ -0,0 +1 @@ +b5de4be68414ece03921ca3e2ee5411b \ No newline at end of file diff --git a/da/dd9/happy__number_8cpp__incl.svg b/da/dd9/happy__number_8cpp__incl.svg new file mode 100644 index 000000000..a3a3c11ab --- /dev/null +++ b/da/dd9/happy__number_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/happy_number.cpp + + + +Node1 + + +others/happy_number.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/da/de7/decimal__to__hexadecimal_8cpp.html b/da/de7/decimal__to__hexadecimal_8cpp.html new file mode 100644 index 000000000..8bd94d480 --- /dev/null +++ b/da/de7/decimal__to__hexadecimal_8cpp.html @@ -0,0 +1,182 @@ + + + + + + + +Algorithms_in_C++: others/decimal_to_hexadecimal.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
decimal_to_hexadecimal.cpp File Reference
+
+
+ +

Convert decimal number to hexadecimal representation. +More...

+
#include <iostream>
+
+Include dependency graph for decimal_to_hexadecimal.cpp:
+
+
+
+
+
+ + + +

+Functions

int main (void)
 
+

Detailed Description

+

Convert decimal number to hexadecimal representation.

+

Function Documentation

+ +

◆ main()

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

Main program

+
11  {
+
12  int valueToConvert = 0; // Holds user input
+
13  int hexArray[8]; // Contains hex values backwards
+
14  int i = 0; // counter
+
15  char HexValues[] = "0123456789ABCDEF";
+
16 
+
17  std::cout << "Enter a Decimal Value"
+
18  << std::endl; // Displays request to stdout
+
19  std::cin >>
+
20  valueToConvert; // Stores value into valueToConvert via user input
+
21 
+
22  while (valueToConvert > 15) { // Dec to Hex Algorithm
+
23  hexArray[i++] = valueToConvert % 16; // Gets remainder
+
24  valueToConvert /= 16;
+
25  // valueToConvert >>= 4; // This will divide by 2^4=16 and is faster
+
26  }
+
27  hexArray[i] = valueToConvert; // Gets last value
+
28 
+
29  std::cout << "Hex Value: ";
+
30  while (i >= 0) std::cout << HexValues[hexArray[i--]];
+
31 
+ +
33  return 0;
+
34 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T endl(T... args)
+ + + + + diff --git a/da/de7/decimal__to__hexadecimal_8cpp.js b/da/de7/decimal__to__hexadecimal_8cpp.js new file mode 100644 index 000000000..ad99c59bf --- /dev/null +++ b/da/de7/decimal__to__hexadecimal_8cpp.js @@ -0,0 +1,4 @@ +var decimal__to__hexadecimal_8cpp = +[ + [ "main", "da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe", null ] +]; \ No newline at end of file diff --git a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map new file mode 100644 index 000000000..6da7ad474 --- /dev/null +++ b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 new file mode 100644 index 000000000..86a68ba5f --- /dev/null +++ b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.md5 @@ -0,0 +1 @@ +7b66b13cd9e906646a781de5e20f13d9 \ No newline at end of file diff --git a/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg new file mode 100644 index 000000000..01ecc6aea --- /dev/null +++ b/da/de7/decimal__to__hexadecimal_8cpp_a840291bc02cba5474a4cb46a9b9566fe_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/da/df2/durand__kerner__roots_8cpp.html b/da/df2/durand__kerner__roots_8cpp.html new file mode 100644 index 000000000..1eff890f2 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp.html @@ -0,0 +1,586 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/durand_kerner_roots.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
durand_kerner_roots.cpp File Reference
+
+
+ +

Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm +More...

+
#include <algorithm>
+#include <cassert>
+#include <cmath>
+#include <complex>
+#include <cstdlib>
+#include <ctime>
+#include <fstream>
+#include <iostream>
+#include <valarray>
+
+Include dependency graph for durand_kerner_roots.cpp:
+
+
+
+
+
+ + + + + +

+Macros

#define ACCURACY   1e-10
 
+#define MAX_BUFF_SIZE   50
 
+ + + + + + + + + + + + + + + +

+Functions

std::complex< double > poly_function (const std::valarray< double > &coeffs, std::complex< double > x)
 
const char * complex_str (const std::complex< double > &x)
 
bool check_termination (long double delta)
 
std::pair< uint32_t, double > durand_kerner_algo (const std::valarray< double > &coeffs, std::valarray< std::complex< double >> *roots, bool write_log=false)
 
void test1 ()
 
void test2 ()
 
+int main (int argc, char **argv)
 
+

Detailed Description

+

Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm

+
Author
Krishna Vedala
+

Test the algorithm online: https://gist.github.com/kvedala/27f1b0b6502af935f6917673ec43bcd7

+

Try the highly unstable Wilkinson's polynomial:

./numerical_methods/durand_kerner_roots 1 -210 20615 -1256850 53327946
+
-1672280820 40171771630 -756111184500 11310276995381 -135585182899530
+
1307535010540395 -10142299865511450 63030812099294896 -311333643161390640
+
1206647803780373360 -3599979517947607200 8037811822645051776
+
-12870931245150988800 13803759753640704000 -8752948036761600000
+
2432902008176640000
+

Sample implementation results to compute approximate roots of the equation \(x^4-1=0\):
+Error evolution during root approximations computed every
+iteration. Roots evolution - shows the initial approximation of the
+roots and their convergence to a final approximation along with the iterative
+approximations

+

Macro Definition Documentation

+ +

◆ ACCURACY

+ +
+
+ + + + +
#define ACCURACY   1e-10
+
+

maximum accuracy limit

+ +
+
+

Function Documentation

+ +

◆ check_termination()

+ +
+
+ + + + + + + + +
bool check_termination (long double delta)
+
+

check for termination condition

Parameters
+ + +
[in]deltapoint at which to evaluate the polynomial
+
+
+
Returns
false if termination not reached
+
+true if termination reached
+
91  {
+
92  static long double past_delta = INFINITY;
+
93  if (std::abs(past_delta - delta) <= ACCURACY || delta < ACCURACY)
+
94  return true;
+
95  past_delta = delta;
+
96  return false;
+
97 }
+
+
+
+ +

◆ complex_str()

+ +
+
+ + + + + + + + +
const char* complex_str (const std::complex< double > & x)
+
+

create a textual form of complex number

Parameters
+ + +
[in]xpoint at which to evaluate the polynomial
+
+
+
Returns
pointer to converted string
+
76  {
+
77 #define MAX_BUFF_SIZE 50
+
78  static char msg[MAX_BUFF_SIZE];
+
79 
+
80  std::snprintf(msg, MAX_BUFF_SIZE, "% 7.04g%+7.04gj", x.real(), x.imag());
+
81 
+
82  return msg;
+
83 }
+
+
+
+ +

◆ durand_kerner_algo()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
std::pair<uint32_t, double> durand_kerner_algo (const std::valarray< double > & coeffs,
std::valarray< std::complex< double >> * roots,
bool write_log = false 
)
+
+

Implements Durand Kerner iterative algorithm to compute all roots of a polynomial.

+
Parameters
+ + + + +
[in]coeffscoefficients of the polynomial
[out]rootsthe computed roots of the polynomial
[in]write_logflag whether to save the log file (default = false)
+
+
+
Returns
pair of values - number of iterations taken and final accuracy achieved
+
111  {
+
112  long double tol_condition = 1;
+
113  uint32_t iter = 0;
+
114  int n;
+
115  std::ofstream log_file;
+
116 
+
117  if (write_log) {
+
118  /*
+
119  * store intermediate values to a CSV file
+
120  */
+
121  log_file.open("durand_kerner.log.csv");
+
122  if (!log_file.is_open()) {
+
123  perror("Unable to create a storage log file!");
+
124  std::exit(EXIT_FAILURE);
+
125  }
+
126  log_file << "iter#,";
+
127 
+
128  for (n = 0; n < roots->size(); n++) log_file << "root_" << n << ",";
+
129 
+
130  log_file << "avg. correction";
+
131  log_file << "\n0,";
+
132  for (n = 0; n < roots->size(); n++)
+
133  log_file << complex_str((*roots)[n]) << ",";
+
134  }
+
135 
+
136  bool break_loop = false;
+
137  while (!check_termination(tol_condition) && iter < INT16_MAX &&
+
138  !break_loop) {
+
139  tol_condition = 0;
+
140  iter++;
+
141  break_loop = false;
+
142 
+
143  if (log_file.is_open())
+
144  log_file << "\n" << iter << ",";
+
145 
+
146 #ifdef _OPENMP
+
147 #pragma omp parallel for shared(break_loop, tol_condition)
+
148 #endif
+
149  for (n = 0; n < roots->size(); n++) {
+
150  if (break_loop)
+
151  continue;
+
152 
+
153  std::complex<double> numerator, denominator;
+
154  numerator = poly_function(coeffs, (*roots)[n]);
+
155  denominator = 1.0;
+
156  for (int i = 0; i < roots->size(); i++)
+
157  if (i != n)
+
158  denominator *= (*roots)[n] - (*roots)[i];
+
159 
+
160  std::complex<long double> delta = numerator / denominator;
+
161 
+
162  if (std::isnan(std::abs(delta)) || std::isinf(std::abs(delta))) {
+
163  std::cerr << "\n\nOverflow/underrun error - got value = "
+
164  << std::abs(delta) << "\n";
+
165  // return std::pair<uint32_t, double>(iter, tol_condition);
+
166  break_loop = true;
+
167  }
+
168 
+
169  (*roots)[n] -= delta;
+
170 
+
171 #ifdef _OPENMP
+
172 #pragma omp critical
+
173 #endif
+
174  tol_condition = std::max(tol_condition, std::abs(std::abs(delta)));
+
175  }
+
176  // tol_condition /= (degree - 1);
+
177 
+
178  if (break_loop)
+
179  break;
+
180 
+
181  if (log_file.is_open()) {
+
182  for (n = 0; n < roots->size(); n++)
+
183  log_file << complex_str((*roots)[n]) << ",";
+
184  }
+
185 
+
186 #if defined(DEBUG) || !defined(NDEBUG)
+
187  if (iter % 500 == 0) {
+
188  std::cout << "Iter: " << iter << "\t";
+
189  for (n = 0; n < roots->size(); n++)
+
190  std::cout << "\t" << complex_str((*roots)[n]);
+
191  std::cout << "\t\tabsolute average change: " << tol_condition
+
192  << "\n";
+
193  }
+
194 #endif
+
195 
+
196  if (log_file.is_open())
+
197  log_file << tol_condition;
+
198  }
+
199 
+
200  return std::pair<uint32_t, long double>(iter, tol_condition);
+
201 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ poly_function()

+ +
+
+ + + + + + + + + + + + + + + + + + +
std::complex<double> poly_function (const std::valarray< double > & coeffs,
std::complex< double > x 
)
+
+

Evaluate the value of a polynomial with given coefficients

Parameters
+ + + +
[in]coeffscoefficients of the polynomial
[in]xpoint at which to evaluate the polynomial
+
+
+
Returns
\(f(x)\)
+
54  {
+
55  double real = 0.f, imag = 0.f;
+
56  int n;
+
57 
+
58  // #ifdef _OPENMP
+
59  // #pragma omp target teams distribute reduction(+ : real, imag)
+
60  // #endif
+
61  for (n = 0; n < coeffs.size(); n++) {
+ +
63  coeffs[n] * std::pow(x, coeffs.size() - n - 1);
+
64  real += tmp.real();
+
65  imag += tmp.imag();
+
66  }
+
67 
+
68  return std::complex<double>(real, imag);
+
69 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test1()

+ +
+
+ + + + + + + +
void test1 ()
+
+

Self test the algorithm by checking the roots for \(x^2+4=0\) to which the roots are \(0 \pm 2i\)

+
207  {
+
208  const std::valarray<double> coeffs = {1, 0, 4}; // x^2 - 2 = 0
+ + +
211  std::complex<double>(0., 2.),
+
212  std::complex<double>(0., -2.) // known expected roots
+
213  };
+
214 
+
215  /* initialize root approximations with random values */
+
216  for (int n = 0; n < roots.size(); n++) {
+
217  roots[n] = std::complex<double>(std::rand() % 100, std::rand() % 100);
+
218  roots[n] -= 50.f;
+
219  roots[n] /= 25.f;
+
220  }
+
221 
+
222  auto result = durand_kerner_algo(coeffs, &roots, false);
+
223 
+
224  for (int i = 0; i < roots.size(); i++) {
+
225  // check if approximations are have < 0.1% error with one of the
+
226  // expected roots
+
227  bool err1 = false;
+
228  for (int j = 0; j < roots.size(); j++)
+
229  err1 |= std::abs(std::abs(roots[i] - expected[j])) < 1e-3;
+
230  assert(err1);
+
231  }
+
232 
+
233  std::cout << "Test 1 passed! - " << result.first << " iterations, "
+
234  << result.second << " accuracy"
+
235  << "\n";
+
236 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test2()

+ +
+
+ + + + + + + +
void test2 ()
+
+

Self test the algorithm by checking the roots for \(0.015625x^3-1=0\) to which the roots are \((4+0i),\,(-2\pm3.464i)\)

+
242  {
+
243  const std::valarray<double> coeffs = {// 0.015625 x^3 - 1 = 0
+
244  1. / 64., 0., 0., -1.};
+ +
246  const std::valarray<std::complex<double>> expected = {
+
247  std::complex<double>(4., 0.), std::complex<double>(-2., 3.46410162),
+
248  std::complex<double>(-2., -3.46410162) // known expected roots
+
249  };
+
250 
+
251  /* initialize root approximations with random values */
+
252  for (int n = 0; n < roots.size(); n++) {
+
253  roots[n] = std::complex<double>(std::rand() % 100, std::rand() % 100);
+
254  roots[n] -= 50.f;
+
255  roots[n] /= 25.f;
+
256  }
+
257 
+
258  auto result = durand_kerner_algo(coeffs, &roots, false);
+
259 
+
260  for (int i = 0; i < roots.size(); i++) {
+
261  // check if approximations are have < 0.1% error with one of the
+
262  // expected roots
+
263  bool err1 = false;
+
264  for (int j = 0; j < roots.size(); j++)
+
265  err1 |= std::abs(std::abs(roots[i] - expected[j])) < 1e-3;
+
266  assert(err1);
+
267  }
+
268 
+
269  std::cout << "Test 2 passed! - " << result.first << " iterations, "
+
270  << result.second << " accuracy"
+
271  << "\n";
+
272 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
bool check_termination(long double delta)
Definition: durand_kerner_roots.cpp:91
+ +
const char * complex_str(const std::complex< double > &x)
Definition: durand_kerner_roots.cpp:76
+
std::pair< uint32_t, double > durand_kerner_algo(const std::valarray< double > &coeffs, std::valarray< std::complex< double >> *roots, bool write_log=false)
Definition: durand_kerner_roots.cpp:109
+
T isnan(T... args)
+
T snprintf(T... args)
+ +
STL class.
+
T isinf(T... args)
+
T perror(T... args)
+
std::complex< double > poly_function(const std::valarray< double > &coeffs, std::complex< double > x)
Definition: durand_kerner_roots.cpp:53
+
STL class.
+
T real(T... args)
+
T open(T... args)
+
#define ACCURACY
Definition: durand_kerner_roots.cpp:45
+
T rand(T... args)
+
STL class.
+
T imag(T... args)
+
T max(T... args)
+
T is_open(T... args)
+
T exit(T... args)
+
T pow(T... args)
+ + + + diff --git a/da/df2/durand__kerner__roots_8cpp.js b/da/df2/durand__kerner__roots_8cpp.js new file mode 100644 index 000000000..020c687d5 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp.js @@ -0,0 +1,12 @@ +var durand__kerner__roots_8cpp = +[ + [ "ACCURACY", "da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689", null ], + [ "MAX_BUFF_SIZE", "da/df2/durand__kerner__roots_8cpp.html#a212979f5fc9dcf0a420e90b9b21d780a", null ], + [ "check_termination", "da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377", null ], + [ "complex_str", "da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740", null ], + [ "durand_kerner_algo", "da/df2/durand__kerner__roots_8cpp.html#ac38b9cfd2a39d856e0feba3b5d241ded", null ], + [ "main", "da/df2/durand__kerner__roots_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "poly_function", "da/df2/durand__kerner__roots_8cpp.html#a51637ff89e55ca749993d3e84b95d153", null ], + [ "test1", "da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", null ], + [ "test2", "da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ] +]; \ No newline at end of file diff --git a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map new file mode 100644 index 000000000..b72192d76 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 new file mode 100644 index 000000000..586db3209 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 @@ -0,0 +1 @@ +d2f637fcf014076ba2cbd3f9b1b93fe4 \ No newline at end of file diff --git a/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg new file mode 100644 index 000000000..329315726 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -0,0 +1,232 @@ + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +durand_kerner_algo + + + + + +Node1->Node2 + + + + + +Node15 + + +std::rand + + + + + +Node1->Node15 + + + + + +Node3 + + +check_termination + + + + + +Node2->Node3 + + + + + +Node4 + + +complex_str + + + + + +Node2->Node4 + + + + + +Node5 + + +std::exit + + + + + +Node2->Node5 + + + + + +Node6 + + +std::ofstream::is_open + + + + + +Node2->Node6 + + + + + +Node7 + + +std::isinf + + + + + +Node2->Node7 + + + + + +Node8 + + +std::isnan + + + + + +Node2->Node8 + + + + + +Node9 + + +std::max + + + + + +Node2->Node9 + + + + + +Node10 + + +std::ofstream::open + + + + + +Node2->Node10 + + + + + +Node11 + + +poly_function + + + + + +Node2->Node11 + + + + + +Node12 + + +std::complex::imag + + + + + +Node11->Node12 + + + + + +Node13 + + +std::pow + + + + + +Node11->Node13 + + + + + +Node14 + + +std::complex::real + + + + + +Node11->Node14 + + + + + diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map new file mode 100644 index 000000000..0b0b0a3d8 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 new file mode 100644 index 000000000..9af71dddf --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 @@ -0,0 +1 @@ +a9cd90795b692401b9335f1a73a8038e \ No newline at end of file diff --git a/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg new file mode 100644 index 000000000..f70b0b252 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -0,0 +1,232 @@ + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +durand_kerner_algo + + + + + +Node1->Node2 + + + + + +Node15 + + +std::rand + + + + + +Node1->Node15 + + + + + +Node3 + + +check_termination + + + + + +Node2->Node3 + + + + + +Node4 + + +complex_str + + + + + +Node2->Node4 + + + + + +Node5 + + +std::exit + + + + + +Node2->Node5 + + + + + +Node6 + + +std::ofstream::is_open + + + + + +Node2->Node6 + + + + + +Node7 + + +std::isinf + + + + + +Node2->Node7 + + + + + +Node8 + + +std::isnan + + + + + +Node2->Node8 + + + + + +Node9 + + +std::max + + + + + +Node2->Node9 + + + + + +Node10 + + +std::ofstream::open + + + + + +Node2->Node10 + + + + + +Node11 + + +poly_function + + + + + +Node2->Node11 + + + + + +Node12 + + +std::complex::imag + + + + + +Node11->Node12 + + + + + +Node13 + + +std::pow + + + + + +Node11->Node13 + + + + + +Node14 + + +std::complex::real + + + + + +Node11->Node14 + + + + + diff --git a/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.map b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.map new file mode 100644 index 000000000..409c83458 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.md5 new file mode 100644 index 000000000..fe9377a58 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.md5 @@ -0,0 +1 @@ +2c145b5ecf01642704ae315c2884e089 \ No newline at end of file diff --git a/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.svg new file mode 100644 index 000000000..c535cfa3c --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_a51637ff89e55ca749993d3e84b95d153_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +poly_function + + + +Node1 + + +poly_function + + + + + +Node2 + + +std::complex::imag + + + + + +Node1->Node2 + + + + + +Node3 + + +std::pow + + + + + +Node1->Node3 + + + + + +Node4 + + +std::complex::real + + + + + +Node1->Node4 + + + + + diff --git a/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.map b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.map new file mode 100644 index 000000000..1be4f943a --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.map @@ -0,0 +1,15 @@ + + + + + + + + + + + + + + + diff --git a/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5 b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5 new file mode 100644 index 000000000..0a3bb71f4 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.md5 @@ -0,0 +1 @@ +d975e88b18f81b99129d130f661e7bd8 \ No newline at end of file diff --git a/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg new file mode 100644 index 000000000..d4ad093f2 --- /dev/null +++ b/da/df2/durand__kerner__roots_8cpp_ac38b9cfd2a39d856e0feba3b5d241ded_cgraph.svg @@ -0,0 +1,202 @@ + + + + + + +durand_kerner_algo + + + +Node1 + + +durand_kerner_algo + + + + + +Node2 + + +check_termination + + + + + +Node1->Node2 + + + + + +Node3 + + +complex_str + + + + + +Node1->Node3 + + + + + +Node4 + + +std::exit + + + + + +Node1->Node4 + + + + + +Node5 + + +std::ofstream::is_open + + + + + +Node1->Node5 + + + + + +Node6 + + +std::isinf + + + + + +Node1->Node6 + + + + + +Node7 + + +std::isnan + + + + + +Node1->Node7 + + + + + +Node8 + + +std::max + + + + + +Node1->Node8 + + + + + +Node9 + + +std::ofstream::open + + + + + +Node1->Node9 + + + + + +Node10 + + +poly_function + + + + + +Node1->Node10 + + + + + +Node11 + + +std::complex::imag + + + + + +Node10->Node11 + + + + + +Node12 + + +std::pow + + + + + +Node10->Node12 + + + + + +Node13 + + +std::complex::real + + + + + +Node10->Node13 + + + + + diff --git a/da/dfd/buzz__number_8cpp__incl.map b/da/dfd/buzz__number_8cpp__incl.map new file mode 100644 index 000000000..7c510932c --- /dev/null +++ b/da/dfd/buzz__number_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/da/dfd/buzz__number_8cpp__incl.md5 b/da/dfd/buzz__number_8cpp__incl.md5 new file mode 100644 index 000000000..507db8271 --- /dev/null +++ b/da/dfd/buzz__number_8cpp__incl.md5 @@ -0,0 +1 @@ +1b31a059966c8ec67cb02a205e5e3b80 \ No newline at end of file diff --git a/da/dfd/buzz__number_8cpp__incl.svg b/da/dfd/buzz__number_8cpp__incl.svg new file mode 100644 index 000000000..76e2c8fb6 --- /dev/null +++ b/da/dfd/buzz__number_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/buzz_number.cpp + + + +Node1 + + +others/buzz_number.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/db/d07/spiral__print_8cpp.html b/db/d07/spiral__print_8cpp.html new file mode 100644 index 000000000..352511642 --- /dev/null +++ b/db/d07/spiral__print_8cpp.html @@ -0,0 +1,308 @@ + + + + + + + +Algorithms_in_C++: others/spiral_print.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
spiral_print.cpp File Reference
+
+
+ +

Print the elements of a matrix traversing it spirally. +More...

+
#include <iostream>
+
+Include dependency graph for spiral_print.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

void genArray (int **a, int r, int c)
 
void spiralPrint (int **a, int r, int c)
 
int main ()
 
+

Detailed Description

+

Print the elements of a matrix traversing it spirally.

+

Function Documentation

+ +

◆ genArray()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void genArray (int ** a,
int r,
int c 
)
+
+

Arrange sequence of numbers from '1' in a matrix form

Parameters
+ + + + +
[out]amatrix to fill
[in]rnumber of rows
[in]cnumber of columns
+
+
+
12  {
+
13  int value = 1;
+
14  for (int i = 0; i < r; i++) {
+
15  for (int j = 0; j < c; j++) {
+
16  a[i][j] = value;
+
17  std::cout << a[i][j] << " ";
+
18  value++;
+
19  }
+ +
21  }
+
22 }
+
+
+
+ +

◆ main()

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

main function

+
69  {
+
70  int r, c;
+
71  std::cin >> r >> c;
+
72  int **a = new int *[r];
+
73  for (int i = 0; i < r; i++) a[i] = new int[c];
+
74 
+
75  genArray(a, r, c);
+
76  spiralPrint(a, r, c);
+
77 
+
78  for (int i = 0; i < r; i++) delete[] a[i];
+
79  delete[] a;
+
80  return 0;
+
81 }
+
+
+
+ +

◆ spiralPrint()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void spiralPrint (int ** a,
int r,
int c 
)
+
+

Traverse the matrix spirally and print the sequence of elements

Parameters
+ + + + +
[in]amatrix to read from
[in]rnumber of rows
[in]cnumber of columns
+
+
+

Print start row

+

Print the end col

+

Print the end row

+

Print the start Col

+
29  {
+
30  int startRow = 0, endRow = r - 1;
+
31  int startCol = 0, endCol = c - 1;
+
32  int cnt = 0;
+
33 
+
34  while (startRow <= endRow && startCol <= endCol) {
+
35  /// Print start row
+
36  for (int i = startCol; i <= endCol; i++, cnt++) {
+
37  std::cout << a[startRow][i] << " ";
+
38  }
+
39  startRow++;
+
40 
+
41  /// Print the end col
+
42  for (int i = startRow; i <= endRow; i++, cnt++) {
+
43  std::cout << a[i][endCol] << " ";
+
44  }
+
45  endCol--;
+
46 
+
47  /// Print the end row
+
48  if (cnt == r * c) {
+
49  break;
+
50  }
+
51 
+
52  for (int i = endCol; i >= startCol; i--, cnt++) {
+
53  std::cout << a[endRow][i] << " ";
+
54  }
+
55  endRow--;
+
56 
+
57  /// Print the start Col
+
58  if (cnt == r * c) {
+
59  break;
+
60  }
+
61  for (int i = endRow; i >= startRow; i--, cnt++) {
+
62  std::cout << a[i][startCol] << " ";
+
63  }
+
64  startCol++;
+
65  }
+
66 }
+
+
+
+
+
+ +
void spiralPrint(int **a, int r, int c)
Definition: spiral_print.cpp:29
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+
void genArray(int **a, int r, int c)
Definition: spiral_print.cpp:12
+ + + + + diff --git a/db/d07/spiral__print_8cpp.js b/db/d07/spiral__print_8cpp.js new file mode 100644 index 000000000..4d9f4d691 --- /dev/null +++ b/db/d07/spiral__print_8cpp.js @@ -0,0 +1,6 @@ +var spiral__print_8cpp = +[ + [ "genArray", "db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5", null ], + [ "main", "db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "spiralPrint", "db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197", null ] +]; \ No newline at end of file diff --git a/db/d0d/prime__factorization_8cpp.html b/db/d0d/prime__factorization_8cpp.html new file mode 100644 index 000000000..f85dc55ff --- /dev/null +++ b/db/d0d/prime__factorization_8cpp.html @@ -0,0 +1,330 @@ + + + + + + + +Algorithms_in_C++: math/prime_factorization.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
prime_factorization.cpp File Reference
+
+
+ +

Prime factorization of positive integers. +More...

+
#include <algorithm>
+#include <cstring>
+#include <iostream>
+#include <vector>
+
+Include dependency graph for prime_factorization.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

void SieveOfEratosthenes (int N)
 
void prime_factorization (int num)
 
int main ()
 
+ + + + + + + +

+Variables

bool isprime [1000006]
 
std::vector< int > prime_numbers
 
std::vector< std::pair< int, int > > factors
 
+

Detailed Description

+

Prime factorization of positive integers.

+

Function Documentation

+ +

◆ main()

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

Main program

+
62  {
+
63  int num;
+
64  std::cout << "\t\tComputes the prime factorization\n\n";
+
65  std::cout << "Type in a number: ";
+
66  std::cin >> num;
+
67 
+ +
69 
+ +
71 
+
72  // Prime factors with their powers in the given number in new line
+
73  for (auto it : factors) {
+
74  std::cout << it.first << " " << it.second << std::endl;
+
75  }
+
76 
+
77  return 0;
+
78 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ prime_factorization()

+ +
+
+ + + + + + + + +
void prime_factorization (int num)
+
+

Prime factorization of a number

+
40  {
+
41  int number = num;
+
42 
+
43  for (int i = 0; prime_numbers[i] <= num; i++) {
+
44  int count = 0;
+
45 
+
46  // termination condition
+
47  if (number == 1) {
+
48  break;
+
49  }
+
50 
+
51  while (number % prime_numbers[i] == 0) {
+
52  count++;
+
53  number = number / prime_numbers[i];
+
54  }
+
55 
+
56  if (count)
+
57  factors.push_back(std::make_pair(prime_numbers[i], count));
+
58  }
+
59 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ SieveOfEratosthenes()

+ +
+
+ + + + + + + + +
void SieveOfEratosthenes (int N)
+
+

Calculating prime number upto a given range

+
23  {
+
24  // initializes the array isprime
+
25  memset(isprime, true, sizeof isprime);
+
26 
+
27  for (int i = 2; i <= N; i++) {
+
28  if (isprime[i]) {
+
29  for (int j = 2 * i; j <= N; j += i) isprime[j] = false;
+
30  }
+
31  }
+
32 
+
33  for (int i = 2; i <= N; i++) {
+
34  if (isprime[i])
+ +
36  }
+
37 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+

Variable Documentation

+ +

◆ factors

+ +
+
+ + + + +
std::vector<std::pair<int, int> > factors
+
+

list of prime factor-pairs

+ +
+
+ +

◆ isprime

+ +
+
+ + + + +
bool isprime[1000006]
+
+

Declaring variables for maintaing prime numbers and to check whether a number is prime or not

+ +
+
+ +

◆ prime_numbers

+ +
+
+ + + + +
std::vector<int> prime_numbers
+
+

list of prime numbers

+ +
+
+
+
+
std::vector< int > prime_numbers
Definition: prime_factorization.cpp:16
+
std::vector< std::pair< int, int > > factors
Definition: prime_factorization.cpp:19
+
T push_back(T... args)
+ +
void SieveOfEratosthenes(int N)
Definition: prime_factorization.cpp:23
+
T endl(T... args)
+
void prime_factorization(int num)
Definition: prime_factorization.cpp:40
+
T make_pair(T... args)
+ +
T memset(T... args)
+
bool isprime[1000006]
Definition: prime_factorization.cpp:13
+ + + + diff --git a/db/d0d/prime__factorization_8cpp.js b/db/d0d/prime__factorization_8cpp.js new file mode 100644 index 000000000..0d9815c35 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp.js @@ -0,0 +1,9 @@ +var prime__factorization_8cpp = +[ + [ "main", "db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "prime_factorization", "db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46", null ], + [ "SieveOfEratosthenes", "db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099", null ], + [ "factors", "db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b", null ], + [ "isprime", "db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23", null ], + [ "prime_numbers", "db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe", null ] +]; \ No newline at end of file diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map new file mode 100644 index 000000000..539756523 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5 b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5 new file mode 100644 index 000000000..55bedd74c --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.md5 @@ -0,0 +1 @@ +6cf5a359b2c2d158492f9577dcc7fa99 \ No newline at end of file diff --git a/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg new file mode 100644 index 000000000..4a88f6719 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_a0ece0145fb29a5cf48378c23dde2da46_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +prime_factorization + + + +Node1 + + +prime_factorization + + + + + +Node2 + + +std::make_pair + + + + + +Node1->Node2 + + + + + diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..15cc1f323 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..7dfb7dfd7 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +4fd38d0c941c97bda907e33b4a6d998e \ No newline at end of file diff --git a/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..991480cd1 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,97 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +prime_factorization + + + + + +Node1->Node3 + + + + + +Node5 + + +SieveOfEratosthenes + + + + + +Node1->Node5 + + + + + +Node4 + + +std::make_pair + + + + + +Node3->Node4 + + + + + +Node6 + + +std::vector::push_back + + + + + +Node5->Node6 + + + + + diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map new file mode 100644 index 000000000..91e8862d1 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5 b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5 new file mode 100644 index 000000000..df6615ef4 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.md5 @@ -0,0 +1 @@ +f13f9d23bc7efc9cac7d696b1768b0fd \ No newline at end of file diff --git a/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg new file mode 100644 index 000000000..e651358d8 --- /dev/null +++ b/db/d0d/prime__factorization_8cpp_affe577b9bce8f604f5e2f861c63c7099_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +SieveOfEratosthenes + + + +Node1 + + +SieveOfEratosthenes + + + + + +Node2 + + +std::vector::push_back + + + + + +Node1->Node2 + + + + + diff --git a/db/d30/fast__power_8cpp__incl.map b/db/d30/fast__power_8cpp__incl.map new file mode 100644 index 000000000..cbd97275a --- /dev/null +++ b/db/d30/fast__power_8cpp__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/db/d30/fast__power_8cpp__incl.md5 b/db/d30/fast__power_8cpp__incl.md5 new file mode 100644 index 000000000..3ead40c3b --- /dev/null +++ b/db/d30/fast__power_8cpp__incl.md5 @@ -0,0 +1 @@ +f91403863302af788666224f2165fcb3 \ No newline at end of file diff --git a/db/d30/fast__power_8cpp__incl.svg b/db/d30/fast__power_8cpp__incl.svg new file mode 100644 index 000000000..8b68287b2 --- /dev/null +++ b/db/d30/fast__power_8cpp__incl.svg @@ -0,0 +1,112 @@ + + + + + + +math/fast_power.cpp + + + +Node1 + + +math/fast_power.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +cstdint + + + + + +Node1->Node4 + + + + + +Node5 + + +cstdlib + + + + + +Node1->Node5 + + + + + +Node6 + + +ctime + + + + + +Node1->Node6 + + + + + +Node7 + + +iostream + + + + + +Node1->Node7 + + + + + diff --git a/db/d3c/tower__of__hanoi_8cpp.html b/db/d3c/tower__of__hanoi_8cpp.html new file mode 100644 index 000000000..f92fe537f --- /dev/null +++ b/db/d3c/tower__of__hanoi_8cpp.html @@ -0,0 +1,350 @@ + + + + + + + +Algorithms_in_C++: others/tower_of_hanoi.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
tower_of_hanoi.cpp File Reference
+
+
+ +

Solve the Tower of Hanoi problem. +More...

+
#include <iostream>
+
+Include dependency graph for tower_of_hanoi.cpp:
+
+
+
+
+
+ + + +

+Classes

struct  tower
 
+ + + + + + + + + +

+Functions

void show (const struct tower *const F, const struct tower *const T, const struct tower *const U)
 
void mov (tower *From, tower *To)
 
void TH (int n, tower *From, tower *Using, tower *To)
 
int main ()
 
+

Detailed Description

+

Solve the Tower of Hanoi problem.

+

Function Documentation

+ +

◆ main()

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

Main function

+
65  {
+
66  struct tower F, U, T;
+
67 
+
68  F.top = 0;
+
69  U.top = 0;
+
70  T.top = 0;
+
71 
+
72  int no;
+
73 
+
74  std::cout << "\nEnter number of discs : ";
+
75  std::cin >> no;
+
76 
+
77  for (int i = no; i > 0; i--) {
+
78  F.values[F.top++] = i;
+
79  }
+
80 
+
81  show(&F, &T, &U);
+
82  TH(no, &F, &U, &T);
+
83 
+
84  return 0;
+
85 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ mov()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void mov (towerFrom,
towerTo 
)
+
+

Move one disc from one tower to another

Parameters
+ + + +
[in,out]Fromtower to move disk from
[in,out]Totower to move disk to
+
+
+
39  {
+
40  --From->top;
+
41  To->values[To->top] = From->values[From->top];
+
42  ++To->top;
+
43 }
+
+
+
+ +

◆ show()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void show (const struct tower *const F,
const struct tower *const T,
const struct tower *const U 
)
+
+

Display the towers

+
20  {
+
21  std::cout << "\n\n\tF : ";
+
22  for (int i = 0; i < F->top; i++) {
+
23  std::cout << F->values[i] << "\t";
+
24  }
+
25  std::cout << "\n\tU : ";
+
26  for (int i = 0; i < U->top; i++) {
+
27  std::cout << U->values[i] << "\t";
+
28  }
+
29  std::cout << "\n\tT : ";
+
30  for (int i = 0; i < T->top; i++) {
+
31  std::cout << T->values[i] << "\t";
+
32  }
+
33 }
+
+
+
+ +

◆ TH()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void TH (int n,
towerFrom,
towerUsing,
towerTo 
)
+
+

Recursive algorithm to solve the puzzle

Parameters
+ + + + + +
[in]nstarting number of disks
[in,out]Fromtower to move disks from
[in,out]Usingtemporary tower for the puzzle
[in,out]Totower to move disk to
+
+
+
52  {
+
53  if (n == 1) {
+
54  mov(From, To);
+
55  show(From, To, Using);
+
56  } else {
+
57  TH(n - 1, From, To, Using);
+
58  mov(From, To);
+
59  show(From, To, Using);
+
60  TH(n - 1, Using, From, To);
+
61  }
+
62 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
void mov(tower *From, tower *To)
Definition: tower_of_hanoi.cpp:39
+ +
Definition: tower_of_hanoi.cpp:11
+
void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)
Definition: tower_of_hanoi.cpp:19
+
int values[10]
Values in the tower.
Definition: tower_of_hanoi.cpp:13
+
int top
top tower ID
Definition: tower_of_hanoi.cpp:15
+
void TH(int n, tower *From, tower *Using, tower *To)
Definition: tower_of_hanoi.cpp:52
+ + + + + diff --git a/db/d3c/tower__of__hanoi_8cpp.js b/db/d3c/tower__of__hanoi_8cpp.js new file mode 100644 index 000000000..efe500526 --- /dev/null +++ b/db/d3c/tower__of__hanoi_8cpp.js @@ -0,0 +1,8 @@ +var tower__of__hanoi_8cpp = +[ + [ "tower", "d2/d2c/structtower.html", "d2/d2c/structtower" ], + [ "main", "db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "mov", "db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d", null ], + [ "show", "db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed", null ], + [ "TH", "db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417", null ] +]; \ No newline at end of file diff --git a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map new file mode 100644 index 000000000..fda9d54b7 --- /dev/null +++ b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5 b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5 new file mode 100644 index 000000000..90b746fa7 --- /dev/null +++ b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.md5 @@ -0,0 +1 @@ +e0e1459bfbaf15727ebfd078c2189da4 \ No newline at end of file diff --git a/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg new file mode 100644 index 000000000..f0c14110b --- /dev/null +++ b/db/d3c/tower__of__hanoi_8cpp_ab037f72a5eac476535a6cfbbcb965417_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +TH + + + +Node1 + + +TH + + + + + +Node2 + + +mov + + + + + +Node1->Node2 + + + + + +Node3 + + +show + + + + + +Node1->Node3 + + + + + diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..86ef21d52 --- /dev/null +++ b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..17d8d7685 --- /dev/null +++ b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +a81da7ae9e4f154b7c29e84c6273dfe6 \ No newline at end of file diff --git a/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..0b4204a37 --- /dev/null +++ b/db/d3c/tower__of__hanoi_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,73 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +show + + + + + +Node1->Node2 + + + + + +Node3 + + +TH + + + + + +Node1->Node3 + + + + + +Node3->Node2 + + + + + +Node4 + + +mov + + + + + +Node3->Node4 + + + + + diff --git a/db/d51/fibonacci__fast_8cpp__incl.map b/db/d51/fibonacci__fast_8cpp__incl.map new file mode 100644 index 000000000..92df6f22b --- /dev/null +++ b/db/d51/fibonacci__fast_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/db/d51/fibonacci__fast_8cpp__incl.md5 b/db/d51/fibonacci__fast_8cpp__incl.md5 new file mode 100644 index 000000000..4cae10256 --- /dev/null +++ b/db/d51/fibonacci__fast_8cpp__incl.md5 @@ -0,0 +1 @@ +6ebc1eb36d5bf41d67032d323f0171b2 \ No newline at end of file diff --git a/db/d51/fibonacci__fast_8cpp__incl.svg b/db/d51/fibonacci__fast_8cpp__incl.svg new file mode 100644 index 000000000..1d6e10a15 --- /dev/null +++ b/db/d51/fibonacci__fast_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +math/fibonacci_fast.cpp + + + +Node1 + + +math/fibonacci_fast.cpp + + + + + +Node2 + + +cinttypes + + + + + +Node1->Node2 + + + + + +Node3 + + +cstdio + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + diff --git a/db/d66/struct_item.html b/db/d66/struct_item.html new file mode 100644 index 000000000..09ffc0136 --- /dev/null +++ b/db/d66/struct_item.html @@ -0,0 +1,125 @@ + + + + + + + +Algorithms_in_C++: Item Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
Item Struct Reference
+
+
+ + + + + + +

+Public Attributes

+int weight
 
+int profit
 
+
The documentation for this struct was generated from the following file:
    +
  • greedy_algorithms/knapsack.cpp
  • +
+
+
+ + + + diff --git a/db/d66/struct_item.js b/db/d66/struct_item.js new file mode 100644 index 000000000..487024cd4 --- /dev/null +++ b/db/d66/struct_item.js @@ -0,0 +1,5 @@ +var struct_item = +[ + [ "profit", "db/d66/struct_item.html#a62e6c5a24f2618be18e46407857c98de", null ], + [ "weight", "db/d66/struct_item.html#a05e743552459fc8c2abdc80a0f4f0b0a", null ] +]; \ No newline at end of file diff --git a/db/d82/classlarge__number.html b/db/d82/classlarge__number.html new file mode 100644 index 000000000..75c8e17ec --- /dev/null +++ b/db/d82/classlarge__number.html @@ -0,0 +1,989 @@ + + + + + + + +Algorithms_in_C++: large_number Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+ +

#include <large_number.h>

+
+Collaboration diagram for large_number:
+
+
+
+
[legend]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

 large_number ()
 
 large_number (int n)
 
 large_number (const large_number &a)
 
 large_number (std::vector< unsigned char > &vec)
 
large_number (char const *number_str)
 
void add_digit (unsigned int value)
 
const size_t num_digits () const
 
unsigned char & operator[] (size_t n)
 
+const unsigned char & operator[] (size_t n) const
 
large_numberoperator++ ()
 
large_numberoperator++ (int)
 
large_numberoperator+= (large_number n)
 
+large_numberoperator+= (int n)
 
large_numberoperator= (const large_number &b)
 
template<class T >
large_numberoperator*= (const T n)
 
const char digit_char (size_t i) const
 
+ + + +

+Static Public Member Functions

static bool test ()
 
+ + + + +

+Private Member Functions

template<class T >
void multiply (const T n)
 
+ + + +

+Private Attributes

std::vector< unsigned char > _digits
 
+ + + + + + + + + + +

+Friends

std::ostreamoperator<< (std::ostream &out, const large_number &a)
 
bool operator== (large_number const &a, large_number const &b)
 
bool operator!= (large_number const &a, large_number const &b)
 
template<class T >
large_numberoperator+ (const large_number &a, const T &b)
 
+

Detailed Description

+

Store large unsigned numbers as a C++ vector The class provides convenience functions to add a digit to the number, perform multiplication of large number with long unsigned integers.

+

Constructor & Destructor Documentation

+ +

◆ large_number() [1/4]

+ +
+
+ + + + + +
+ + + + + + + +
large_number::large_number ()
+
+inline
+
+

< initializer with value = 1

+
27 { _digits.push_back(1); }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ large_number() [2/4]

+ +
+
+ + + + + +
+ + + + + + + + +
large_number::large_number (int n)
+
+inlineexplicit
+
+

< initializer from an integer initializer from another large_number

+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ large_number() [3/4]

+ +
+
+ + + + + +
+ + + + + + + + +
large_number::large_number (const large_numbera)
+
+inline
+
+

initializer from a vector

+ +
+
+ +

◆ large_number() [4/4]

+ +
+
+ + + + + +
+ + + + + + + + +
large_number::large_number (std::vector< unsigned char > & vec)
+
+inlineexplicit
+
+

initializer from a string

+ +
+
+

Member Function Documentation

+ +

◆ add_digit()

+ +
+
+ + + + + +
+ + + + + + + + +
void large_number::add_digit (unsigned int value)
+
+inline
+
+

add a digit at MSB to the large number

+
118  {
+
119  if (value > 9) {
+
120  std::cerr << "digit > 9!!\n";
+
121  exit(EXIT_FAILURE);
+
122  }
+
123 
+
124  _digits.push_back(value);
+
125  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ digit_char()

+ +
+
+ + + + + +
+ + + + + + + + +
const char large_number::digit_char (size_t i) const
+
+inline
+
+

returns i^th digit as an ASCII character

+
248  {
+
249  return _digits[num_digits() - i - 1] + '0';
+
250  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ multiply()

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + + +
void large_number::multiply (const T n)
+
+inlineprivate
+
+

multiply large number with another integer and store the result in the same large number

+
258  {
+
259  static_assert(std::is_integral<T>::value,
+
260  "Can only have integer types.");
+
261  // assert(!(std::is_signed<T>::value)); //, "Implemented only for
+
262  // unsigned integer types.");
+
263 
+
264  size_t i;
+
265  uint64_t carry = 0, temp;
+
266  for (i = 0; i < this->num_digits(); i++) {
+
267  temp = (*this)[i] * n;
+
268  temp += carry;
+
269  if (temp < 10) {
+
270  carry = 0;
+
271  } else {
+
272  carry = temp / 10;
+
273  temp = temp % 10;
+
274  }
+
275  (*this)[i] = temp;
+
276  }
+
277 
+
278  while (carry != 0) {
+
279  this->add_digit(carry % 10);
+
280  carry /= 10;
+
281  }
+
282  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ num_digits()

+ +
+
+ + + + + +
+ + + + + + + +
const size_t large_number::num_digits () const
+
+inline
+
+

Get number of digits in the number

+
130 { return _digits.size(); }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator*=()

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + + +
large_number& large_number::operator*= (const T n)
+
+inline
+
+

operator overload to increment

+
238  {
+
239  static_assert(std::is_integral<T>::value,
+
240  "Must be integer addition unsigned integer types.");
+
241  this->multiply(n);
+
242  return *this;
+
243  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator++() [1/2]

+ +
+
+ + + + + +
+ + + + + + + +
large_number& large_number::operator++ ()
+
+inline
+
+

operator overload to increment (prefix)

+
175  {
+
176  (*this) += 1;
+
177  return *this;
+
178  }
+
+
+
+ +

◆ operator++() [2/2]

+ +
+
+ + + + + +
+ + + + + + + + +
large_number& large_number::operator++ (int )
+
+inline
+
+

operator overload to increment (postfix)

+
183  {
+
184  static large_number tmp(_digits);
+
185  ++(*this);
+
186  return tmp;
+
187  }
+
+
+
+ +

◆ operator+=()

+ +
+
+ + + + + +
+ + + + + + + + +
large_number& large_number::operator+= (large_number n)
+
+inline
+
+

operator overload to add

+
192  {
+
193  // if adding with another large_number
+
194  large_number *b = reinterpret_cast<large_number *>(&n);
+
195  const size_t max_L = std::max(this->num_digits(), b->num_digits());
+
196  unsigned int carry = 0;
+
197  size_t i;
+
198  for (i = 0; i < max_L || carry != 0; i++) {
+
199  if (i < b->num_digits())
+
200  carry += (*b)[i];
+
201  if (i < this->num_digits())
+
202  carry += (*this)[i];
+
203  if (i < this->num_digits())
+
204  (*this)[i] = carry % 10;
+
205  else
+
206  this->add_digit(carry % 10);
+
207  carry /= 10;
+
208  }
+
209  return *this;
+
210  }
+
+
+
+ +

◆ operator=()

+ +
+
+ + + + + +
+ + + + + + + + +
large_number& large_number::operator= (const large_numberb)
+
+inline
+
+

assignment operator

+
229  {
+
230  this->_digits = b._digits;
+
231  return *this;
+
232  }
+
+
+
+ +

◆ operator[]()

+ +
+
+ + + + + +
+ + + + + + + + +
unsigned char& large_number::operator[] (size_t n)
+
+inline
+
+

operator over load to access the i^th digit conveniently and also assign value to it

+
137 { return this->_digits[n]; }
+
+
+
+ +

◆ test()

+ +
+
+ + + + + +
+ + + + + + + +
static bool large_number::test ()
+
+inlinestatic
+
+

Function to check implementation

+
65  {
+
66  std::cout << "------ Checking `large_number` class implementations\t"
+
67  << std::endl;
+
68  large_number a(40);
+
69  // 1. test multiplication
+
70  a *= 10;
+
71  if (a != large_number(400)) {
+
72  std::cerr << "\tFailed 1/6 (" << a << "!=400)" << std::endl;
+
73  return false;
+
74  }
+
75  std::cout << "\tPassed 1/6...";
+
76  // 2. test compound addition with integer
+
77  a += 120;
+
78  if (a != large_number(520)) {
+
79  std::cerr << "\tFailed 2/6 (" << a << "!=520)" << std::endl;
+
80  return false;
+
81  }
+
82  std::cout << "\tPassed 2/6...";
+
83  // 3. test compound multiplication again
+
84  a *= 10;
+
85  if (a != large_number(5200)) {
+
86  std::cerr << "\tFailed 3/6 (" << a << "!=5200)" << std::endl;
+
87  return false;
+
88  }
+
89  std::cout << "\tPassed 3/6...";
+
90  // 4. test increment (prefix)
+
91  ++a;
+
92  if (a != large_number(5201)) {
+
93  std::cerr << "\tFailed 4/6 (" << a << "!=5201)" << std::endl;
+
94  return false;
+
95  }
+
96  std::cout << "\tPassed 4/6...";
+
97  // 5. test increment (postfix)
+
98  a++;
+
99  if (a != large_number(5202)) {
+
100  std::cerr << "\tFailed 5/6 (" << a << "!=5202)" << std::endl;
+
101  return false;
+
102  }
+
103  std::cout << "\tPassed 5/6...";
+
104  // 6. test addition with another large number
+
105  a = a + large_number("7000000000000000000000000000000");
+
106  if (a != large_number("7000000000000000000000000005202")) {
+
107  std::cerr << "\tFailed 6/6 (" << a
+
108  << "!=7000000000000000000000000005202)" << std::endl;
+
109  return false;
+
110  }
+
111  std::cout << "\tPassed 6/6..." << std::endl;
+
112  return true;
+
113  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+

Friends And Related Function Documentation

+ +

◆ operator!=

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool operator!= (large_number const & a,
large_number const & b 
)
+
+friend
+
+

operator overload to compare two numbers

+
168  {
+
169  return !(a == b);
+
170  }
+
+
+
+ +

◆ operator+

+ +
+
+
+template<class T >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
large_number& operator+ (const large_numbera,
const T & b 
)
+
+friend
+
+

operator overload to perform addition

+
220  {
+
221  static large_number c = a;
+
222  c += b;
+
223  return c;
+
224  }
+
+
+
+ +

◆ operator<<

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
std::ostream& operator<< (std::ostreamout,
const large_numbera 
)
+
+friend
+
+

operator overload to compare two numbers

+
146  {
+
147  for (size_t i = a.num_digits(); i > 0; i--)
+
148  out << static_cast<int>(a[i - 1]);
+
149  return out;
+
150  }
+
+
+
+ +

◆ operator==

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
bool operator== (large_number const & a,
large_number const & b 
)
+
+friend
+
+

operator overload to compare two numbers

+
155  {
+
156  size_t N = a.num_digits();
+
157  if (N != b.num_digits())
+
158  return false;
+
159  for (size_t i = 0; i < N; i++)
+
160  if (a[i] != b[i])
+
161  return false;
+
162  return true;
+
163  }
+
+
+
+

Member Data Documentation

+ +

◆ _digits

+ +
+
+ + + + + +
+ + + + +
std::vector<unsigned char> large_number::_digits
+
+private
+
+

where individual digits are stored

+ +
+
+
The documentation for this class was generated from the following file: +
+
+
void add_digit(unsigned int value)
Definition: large_number.h:118
+
T size(T... args)
+
Definition: large_number.h:24
+
const size_t num_digits() const
Definition: large_number.h:130
+
T push_back(T... args)
+
large_number()
Definition: large_number.h:27
+ +
void multiply(const T n)
Definition: large_number.h:258
+
std::vector< unsigned char > _digits
Definition: large_number.h:285
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+
T max(T... args)
+
T exit(T... args)
+ + + + diff --git a/db/d82/classlarge__number.js b/db/d82/classlarge__number.js new file mode 100644 index 000000000..1c543fb3e --- /dev/null +++ b/db/d82/classlarge__number.js @@ -0,0 +1,26 @@ +var classlarge__number = +[ + [ "large_number", "db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337", null ], + [ "large_number", "db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a", null ], + [ "large_number", "db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872", null ], + [ "large_number", "db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f", null ], + [ "large_number", "db/d82/classlarge__number.html#adf804e60309bf016f7954fdcb0a4d103", null ], + [ "add_digit", "db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615", null ], + [ "digit_char", "db/d82/classlarge__number.html#af530d90830d385c76973658ff3214f98", null ], + [ "multiply", "db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc", null ], + [ "num_digits", "db/d82/classlarge__number.html#a2305a82e7b372617419337b2d2119c7d", null ], + [ "operator*=", "db/d82/classlarge__number.html#ab1af3e0f425cdf7ea2039c9dcfe22f0b", null ], + [ "operator++", "db/d82/classlarge__number.html#a622d84883180ff42f04955909adea5a9", null ], + [ "operator++", "db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706", null ], + [ "operator+=", "db/d82/classlarge__number.html#aad394466f3207b21b5d3e994b3a8ed72", null ], + [ "operator+=", "db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e", null ], + [ "operator=", "db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb", null ], + [ "operator[]", "db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d", null ], + [ "operator[]", "db/d82/classlarge__number.html#ab53e3d0d72a547243a6e995e918ba87c", null ], + [ "test", "db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9", null ], + [ "operator!=", "db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94", null ], + [ "operator+", "db/d82/classlarge__number.html#a70d23d67535e67030db570e56c00e16d", null ], + [ "operator<<", "db/d82/classlarge__number.html#a778428c4761b6ea5e7770743f0eab5ab", null ], + [ "operator==", "db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca", null ], + [ "_digits", "db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57", null ] +]; \ No newline at end of file diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map new file mode 100644 index 000000000..95abcbf82 --- /dev/null +++ b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5 b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5 new file mode 100644 index 000000000..351ec616a --- /dev/null +++ b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.md5 @@ -0,0 +1 @@ +8fd23292e49894c379ca9e9f8b776f74 \ No newline at end of file diff --git a/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg new file mode 100644 index 000000000..988823a40 --- /dev/null +++ b/db/d82/classlarge__number_a10119a83839e65962621b73df46a5337_cgraph.svg @@ -0,0 +1,38 @@ + + + + + + +large_number::large_number + + + +Node1 + + +large_number::large +_number + + + + + +Node2 + + +std::vector::push_back + + + + + +Node1->Node2 + + + + + diff --git a/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.map b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.map new file mode 100644 index 000000000..00a844106 --- /dev/null +++ b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.md5 b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.md5 new file mode 100644 index 000000000..ade0b2809 --- /dev/null +++ b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.md5 @@ -0,0 +1 @@ +0a5152f4f85e7068ba747643e10e2cc3 \ No newline at end of file diff --git a/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.svg b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.svg new file mode 100644 index 000000000..6abd9dd62 --- /dev/null +++ b/db/d82/classlarge__number_a2305a82e7b372617419337b2d2119c7d_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +large_number::num_digits + + + +Node1 + + +large_number::num_digits + + + + + +Node2 + + +std::vector::size + + + + + +Node1->Node2 + + + + + diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map new file mode 100644 index 000000000..448c30af7 --- /dev/null +++ b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 new file mode 100644 index 000000000..44b22fc70 --- /dev/null +++ b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.md5 @@ -0,0 +1 @@ +104319d7ad94a3a0f6ae6a24828b39b4 \ No newline at end of file diff --git a/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg new file mode 100644 index 000000000..f665ea4ce --- /dev/null +++ b/db/d82/classlarge__number_a2f5571e66305cf68bb8283e4aeda58bc_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +large_number::multiply + + + +Node1 + + +large_number::multiply + + + + + +Node2 + + +large_number::add_digit + + + + + +Node1->Node2 + + + + + +Node4 + + +large_number::num_digits + + + + + +Node1->Node4 + + + + + +Node3 + + +std::vector::push_back + + + + + +Node2->Node3 + + + + + +Node5 + + +std::vector::size + + + + + +Node4->Node5 + + + + + diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map new file mode 100644 index 000000000..16af4d601 --- /dev/null +++ b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5 b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5 new file mode 100644 index 000000000..cd8cf6e29 --- /dev/null +++ b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.md5 @@ -0,0 +1 @@ +2193d4191a23c4df1c79d1f6b5bcc1e8 \ No newline at end of file diff --git a/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg new file mode 100644 index 000000000..a99995bcf --- /dev/null +++ b/db/d82/classlarge__number_a60c436d1a1c5e3795d6177d3815ad615_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +large_number::add_digit + + + +Node1 + + +large_number::add_digit + + + + + +Node2 + + +std::vector::push_back + + + + + +Node1->Node2 + + + + + diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map new file mode 100644 index 000000000..1f0e903f7 --- /dev/null +++ b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 new file mode 100644 index 000000000..193ad9778 --- /dev/null +++ b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.md5 @@ -0,0 +1 @@ +d2bf160e494c8b78eb2f7a064f247e16 \ No newline at end of file diff --git a/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg new file mode 100644 index 000000000..cf4a8bfbf --- /dev/null +++ b/db/d82/classlarge__number_a959c5c1a982949bbf98e1ea0f9afe6a9_cgraph.svg @@ -0,0 +1,68 @@ + + + + + + +large_number::test + + + +Node1 + + +large_number::test + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +large_number::large +_number + + + + + +Node1->Node3 + + + + + +Node4 + + +std::vector::push_back + + + + + +Node3->Node4 + + + + + diff --git a/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map new file mode 100644 index 000000000..533353aff --- /dev/null +++ b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5 b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5 new file mode 100644 index 000000000..2f242fc9b --- /dev/null +++ b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.md5 @@ -0,0 +1 @@ +092df34284fec296a5183c9966f15331 \ No newline at end of file diff --git a/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg new file mode 100644 index 000000000..fe7687642 --- /dev/null +++ b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph.svg @@ -0,0 +1,185 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +large_number::operator*= + + + +Node1 + + +large_number::operator*= + + + + + +Node2 + + +large_number::multiply + + + + + +Node1->Node2 + + + + + +Node3 + + +large_number::add_digit + + + + + +Node2->Node3 + + + + + +Node5 + + +large_number::num_digits + + + + + +Node2->Node5 + + + + + +Node4 + + +std::vector::push_back + + + + + +Node3->Node4 + + + + + +Node6 + + +std::vector::size + + + + + +Node5->Node6 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg new file mode 100644 index 000000000..57e22ad05 --- /dev/null +++ b/db/d82/classlarge__number_ab1af3e0f425cdf7ea2039c9dcfe22f0b_cgraph_org.svg @@ -0,0 +1,97 @@ + + + + + + +large_number::operator*= + + + +Node1 + + +large_number::operator*= + + + + + +Node2 + + +large_number::multiply + + + + + +Node1->Node2 + + + + + +Node3 + + +large_number::add_digit + + + + + +Node2->Node3 + + + + + +Node5 + + +large_number::num_digits + + + + + +Node2->Node5 + + + + + +Node4 + + +std::vector::push_back + + + + + +Node3->Node4 + + + + + +Node6 + + +std::vector::size + + + + + +Node5->Node6 + + + + + diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map new file mode 100644 index 000000000..d19f3a9e7 --- /dev/null +++ b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 new file mode 100644 index 000000000..0a31ca39f --- /dev/null +++ b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.md5 @@ -0,0 +1 @@ +15791d7b0638a2cc0a39bc3d720a228c \ No newline at end of file diff --git a/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg new file mode 100644 index 000000000..a8aebe2fe --- /dev/null +++ b/db/d82/classlarge__number_af4598f1f2794b5e17e10c25e0501e41a_cgraph.svg @@ -0,0 +1,53 @@ + + + + + + +large_number::large_number + + + +Node1 + + +large_number::large +_number + + + + + +Node2 + + +large_number::add_digit + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::push_back + + + + + +Node2->Node3 + + + + + diff --git a/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.map b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.map new file mode 100644 index 000000000..07c8ea273 --- /dev/null +++ b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.md5 b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.md5 new file mode 100644 index 000000000..b62089077 --- /dev/null +++ b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.md5 @@ -0,0 +1 @@ +62ef5863160c17bf7805b896a62923e2 \ No newline at end of file diff --git a/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.svg b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.svg new file mode 100644 index 000000000..65bd31e69 --- /dev/null +++ b/db/d82/classlarge__number_af530d90830d385c76973658ff3214f98_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +large_number::digit_char + + + +Node1 + + +large_number::digit_char + + + + + +Node2 + + +large_number::num_digits + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::size + + + + + +Node2->Node3 + + + + + diff --git a/db/d8b/struct_node.html b/db/d8b/struct_node.html new file mode 100644 index 000000000..351f865fe --- /dev/null +++ b/db/d8b/struct_node.html @@ -0,0 +1,149 @@ + + + + + + + +Algorithms_in_C++: Node Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for Node:
+
+
+
+
[legend]
+ + + + +

+Public Member Functions

Node (int v, Node *n)
 
+ + + + + + + + + + + +

+Public Attributes

+int data
 
+int next
 
+struct Nodenext
 
+int val
 
+Nodenext
 
+
The documentation for this class was generated from the following files: +
+
+ + + + diff --git a/db/d8b/struct_node.js b/db/d8b/struct_node.js new file mode 100644 index 000000000..4207c50d9 --- /dev/null +++ b/db/d8b/struct_node.js @@ -0,0 +1,9 @@ +var struct_node = +[ + [ "Node", "db/d8b/struct_node.html#a66af34de5f6c4d108abd948f341e6470", null ], + [ "data", "db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605", null ], + [ "next", "db/d8b/struct_node.html#a2559a716f69ccaa76d648d9f1b83065e", null ], + [ "next", "db/d8b/struct_node.html#af67b110ca1a258b793bf69d306929b22", null ], + [ "next", "db/d8b/struct_node.html#a80be4538a9184fa43c1dee17641e819b", null ], + [ "val", "db/d8b/struct_node.html#ab1d228a881cf7465b2d42ea135781427", null ] +]; \ No newline at end of file diff --git a/db/d8f/struct_btree__coll__graph.map b/db/d8f/struct_btree__coll__graph.map new file mode 100644 index 000000000..2a20b22b1 --- /dev/null +++ b/db/d8f/struct_btree__coll__graph.map @@ -0,0 +1,3 @@ + + + diff --git a/db/d8f/struct_btree__coll__graph.md5 b/db/d8f/struct_btree__coll__graph.md5 new file mode 100644 index 000000000..2a4a3a3f9 --- /dev/null +++ b/db/d8f/struct_btree__coll__graph.md5 @@ -0,0 +1 @@ +da72bf5e647f072e1dd1d3dc40f0ce29 \ No newline at end of file diff --git a/db/d8f/struct_btree__coll__graph.svg b/db/d8f/struct_btree__coll__graph.svg new file mode 100644 index 000000000..fe0994265 --- /dev/null +++ b/db/d8f/struct_btree__coll__graph.svg @@ -0,0 +1,30 @@ + + + + + + +Btree + + + +Node1 + + +Btree + + + + + +Node1->Node1 + + + right +left + + + diff --git a/db/d93/check__prime_8cpp.html b/db/d93/check__prime_8cpp.html new file mode 100644 index 000000000..e99f515db --- /dev/null +++ b/db/d93/check__prime_8cpp.html @@ -0,0 +1,227 @@ + + + + + + + +Algorithms_in_C++: math/check_prime.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
check_prime.cpp File Reference
+
+
+ +

Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime. +More...

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

+Functions

template<typename T >
bool is_prime (T num)
 
int main ()
 
+

Detailed Description

+

Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime.

+

Copyright 2020

Author
omkarlanghe
+

A simple program to check if the given number if prime or not.

+

Function Documentation

+ +

◆ is_prime()

+ +
+
+
+template<typename T >
+ + + + + + + + +
bool is_prime (num)
+
+

Function to check if the given number is prime or not.

Parameters
+ + +
numnumber to be checked.
+
+
+
Returns
if number is prime, it returns @ true, else it returns @ false.
+
22  {
+
23  bool result = true;
+
24  if (num <= 1) {
+
25  return 0;
+
26  } else if (num == 2) {
+
27  return 1;
+
28  } else if ((num & 1) == 0) {
+
29  return 0;
+
30  }
+
31  if (num >= 3) {
+
32  for (T i = 3; (i * i) < (num); i = (i + 2)) {
+
33  if ((num % i) == 0) {
+
34  result = false;
+
35  break;
+
36  }
+
37  }
+
38  }
+
39  return (result);
+
40 }
+
+
+
+ +

◆ main()

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

Main function

+
45  {
+
46  // perform self-test
+
47  assert(is_prime(50) == false);
+
48  assert(is_prime(115249) == true);
+
49 
+
50  int num;
+
51  std::cout << "Enter the number to check if it is prime or not" << std::endl;
+
52  std::cin >> num;
+
53  bool result = is_prime(num);
+
54  if (result) {
+
55  std::cout << num << " is a prime number" << std::endl;
+
56  } else {
+
57  std::cout << num << " is not a prime number" << std::endl;
+
58  }
+
59 
+
60  return 0;
+
61 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
bool is_prime(T num)
Definition: check_prime.cpp:22
+ +
T endl(T... args)
+ + + + + diff --git a/db/d93/check__prime_8cpp.js b/db/d93/check__prime_8cpp.js new file mode 100644 index 000000000..37d788d16 --- /dev/null +++ b/db/d93/check__prime_8cpp.js @@ -0,0 +1,5 @@ +var check__prime_8cpp = +[ + [ "is_prime", "db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532", null ], + [ "main", "db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..52ba1ebed --- /dev/null +++ b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..3cd5271c9 --- /dev/null +++ b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +f74f1e830fea0a7ae8a99fce9ea6a54f \ No newline at end of file diff --git a/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..3e6e5bad9 --- /dev/null +++ b/db/d93/check__prime_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +is_prime + + + + + +Node1->Node3 + + + + + diff --git a/db/dd3/ode__forward__euler_8cpp.html b/db/dd3/ode__forward__euler_8cpp.html new file mode 100644 index 000000000..12b8fd4e1 --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp.html @@ -0,0 +1,414 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/ode_forward_euler.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
ode_forward_euler.cpp File Reference
+
+
+ +

Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method +More...

+
#include <cmath>
+#include <ctime>
+#include <fstream>
+#include <iostream>
+#include <valarray>
+
+Include dependency graph for ode_forward_euler.cpp:
+
+
+
+
+
+ + + + + + + + + + + + + + + + + +

+Functions

void problem (const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Problem statement for a system with first-order differential equations. Updates the system differential variables. More...
 
void exact_solution (const double &x, std::valarray< double > *y)
 Exact solution of the problem. Used for solution comparison. More...
 
void forward_euler_step (const double dx, const double &x, std::valarray< double > *y, std::valarray< double > *dy)
 Compute next step approximation using the forward-Euler method. More...
 
double forward_euler (double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
 Compute approximation using the forward-Euler method in the given limits. More...
 
void save_exact_solution (const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
 
int main (int argc, char *argv[])
 
+

Detailed Description

+

Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method

+
Authors
Krishna Vedala
+

The ODE being solved is:

+\begin{eqnarray*} \dot{u} &=& v\\ \dot{v} &=& -\omega^2 u\\ \omega &=& 1\\ [x_0, u_0, v_0] &=& [0,1,0]\qquad\ldots\text{(initial values)} \end{eqnarray*} +

+

The exact solution for the above problem is:

+\begin{eqnarray*} u(x) &=& \cos(x)\\ v(x) &=& -\sin(x)\\ \end{eqnarray*} +

+

The computation results are stored to a text file forward_euler.csv and the exact soltuion results in exact.csv for comparison. Implementation solution

+

To implement Van der Pol oscillator, change the problem function to:

const double mu = 2.0;
+
dy[0] = y[1];
+
dy[1] = mu * (1.f - y[0] * y[0]) * y[1] - y[0];
+
See also
ode_midpoint_euler.cpp, ode_semi_implicit_euler.cpp
+

Function Documentation

+ +

◆ exact_solution()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void exact_solution (const double & x,
std::valarray< double > * y 
)
+
+ +

Exact solution of the problem. Used for solution comparison.

+
Parameters
+ + + +
[in]xindependent variable
[in,out]ydependent variable
+
+
+
67  {
+
68  y[0][0] = std::cos(x);
+
69  y[0][1] = -std::sin(x);
+
70 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main Function

+
188  {
+
189  double X0 = 0.f; /* initial value of x0 */
+
190  double X_MAX = 10.F; /* upper limit of integration */
+
191  std::valarray<double> Y0 = {1.f, 0.f}; /* initial value Y = y(x = x_0) */
+
192  double step_size;
+
193 
+
194  if (argc == 1) {
+
195  std::cout << "\nEnter the step size: ";
+
196  std::cin >> step_size;
+
197  } else {
+
198  // use commandline argument as independent variable step size
+
199  step_size = std::atof(argv[1]);
+
200  }
+
201 
+
202  // get approximate solution
+
203  double total_time = forward_euler(step_size, X0, X_MAX, &Y0, true);
+
204  std::cout << "\tTime = " << total_time << " ms\n";
+
205 
+
206  /* compute exact solution for comparion */
+
207  save_exact_solution(X0, X_MAX, step_size, Y0);
+
208 
+
209  return 0;
+
210 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ problem()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void problem (const double & x,
std::valarray< double > * y,
std::valarray< double > * dy 
)
+
+ +

Problem statement for a system with first-order differential equations. Updates the system differential variables.

+
Note
This function can be updated to and ode of any order.
+
Parameters
+ + + + +
[in]xindependent variable(s)
[in,out]ydependent variable(s)
[in,out]dyfirst-derivative of dependent variable(s)
+
+
+
55  {
+
56  const double omega = 1.F; // some const for the problem
+
57  dy[0][0] = y[0][1]; // x dot
+
58  dy[0][1] = -omega * omega * y[0][0]; // y dot
+
59 }
+
+
+
+ +

◆ save_exact_solution()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
void save_exact_solution (const double & X0,
const double & X_MAX,
const double & step_size,
const std::valarray< double > & Y0 
)
+
+

Function to compute and save exact solution for comparison

+
Parameters
+ + + + + +
[in]X0initial value of independent variable
[in]X_MAXfinal value of independent variable
[in]step_sizeindependent variable step size
[in]Y0initial values of dependent variables
+
+
+
154  {
+
155  double x = X0;
+
156  std::valarray<double> y = Y0;
+
157 
+
158  std::ofstream fp("exact.csv", std::ostream::out);
+
159  if (!fp.is_open()) {
+
160  std::perror("Error! ");
+
161  return;
+
162  }
+
163  std::cout << "Finding exact solution\n";
+
164 
+
165  std::clock_t t1 = std::clock();
+
166  do {
+
167  fp << x << ",";
+
168  for (int i = 0; i < y.size() - 1; i++) {
+
169  fp << y[i] << ",";
+
170  }
+
171  fp << y[y.size() - 1] << "\n";
+
172 
+
173  exact_solution(x, &y);
+
174 
+
175  x += step_size;
+
176  } while (x <= X_MAX);
+
177 
+
178  std::clock_t t2 = std::clock();
+
179  double total_time = static_cast<double>(t2 - t1) / CLOCKS_PER_SEC;
+
180  std::cout << "\tTime = " << total_time << " ms\n";
+
181 
+
182  fp.close();
+
183 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T cos(T... args)
+
void exact_solution(const double &x, std::valarray< double > *y)
Exact solution of the problem. Used for solution comparison.
Definition: ode_forward_euler.cpp:67
+
T atof(T... args)
+
T clock(T... args)
+
void save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0)
Definition: ode_forward_euler.cpp:152
+ +
STL class.
+
T perror(T... args)
+
STL class.
+
double forward_euler(double dx, double x0, double x_max, std::valarray< double > *y, bool save_to_file=false)
Compute approximation using the forward-Euler method in the given limits.
Definition: ode_forward_euler.cpp:102
+
T sin(T... args)
+ + + + + diff --git a/db/dd3/ode__forward__euler_8cpp.js b/db/dd3/ode__forward__euler_8cpp.js new file mode 100644 index 000000000..d08321c38 --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp.js @@ -0,0 +1,9 @@ +var ode__forward__euler_8cpp = +[ + [ "exact_solution", "db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b", null ], + [ "forward_euler", "d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9", null ], + [ "forward_euler_step", "d6/d60/group__ode.html#gaa197c6b7085ac9ea71abc4c063e6f52f", null ], + [ "main", "db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ], + [ "problem", "db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe", null ], + [ "save_exact_solution", "db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f", null ] +]; \ No newline at end of file diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map new file mode 100644 index 000000000..49fdd6f9b --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map @@ -0,0 +1,16 @@ + + + + + + + + + + + + + + + + diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 new file mode 100644 index 000000000..f32b05ae4 --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 @@ -0,0 +1 @@ +1c011524884e08ee09e2a375bad79290 \ No newline at end of file diff --git a/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg new file mode 100644 index 000000000..b25912759 --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg @@ -0,0 +1,241 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::atof + + + + + +Node1->Node2 + + + + + +Node3 + + +forward_euler + + + + + +Node1->Node3 + + + + + +Node11 + + +save_exact_solution + + + + + +Node1->Node11 + + + + + +Node4 + + +std::clock + + + + + +Node3->Node4 + + + + + +Node5 + + +std::ofstream::close + + + + + +Node3->Node5 + + + + + +Node6 + + +forward_euler_step + + + + + +Node3->Node6 + + + + + +Node8 + + +std::ofstream::is_open + + + + + +Node3->Node8 + + + + + +Node9 + + +std::ofstream::open + + + + + +Node3->Node9 + + + + + +Node10 + + +std::perror + + + + + +Node3->Node10 + + + + + +Node7 + + +problem + + + + + +Node6->Node7 + + + + + +Node11->Node4 + + + + + +Node11->Node5 + + + + + +Node11->Node8 + + + + + +Node11->Node10 + + + + + +Node12 + + +exact_solution + + + + + +Node11->Node12 + + + + + +Node13 + + +std::cos + + + + + +Node12->Node13 + + + + + +Node14 + + +std::sin + + + + + +Node12->Node14 + + + + + diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map new file mode 100644 index 000000000..682408495 --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 new file mode 100644 index 000000000..0658178d0 --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.md5 @@ -0,0 +1 @@ +e73ec3022db67a36c8cbe08bd9e8f092 \ No newline at end of file diff --git a/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg new file mode 100644 index 000000000..42b60ba06 --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_aa13517b8e5de1b75592052db7f7e237f_cgraph.svg @@ -0,0 +1,127 @@ + + + + + + +save_exact_solution + + + +Node1 + + +save_exact_solution + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +std::ofstream::close + + + + + +Node1->Node3 + + + + + +Node4 + + +exact_solution + + + + + +Node1->Node4 + + + + + +Node7 + + +std::ofstream::is_open + + + + + +Node1->Node7 + + + + + +Node8 + + +std::perror + + + + + +Node1->Node8 + + + + + +Node5 + + +std::cos + + + + + +Node4->Node5 + + + + + +Node6 + + +std::sin + + + + + +Node4->Node6 + + + + + diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map new file mode 100644 index 000000000..fbb37ebae --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 new file mode 100644 index 000000000..53dab073e --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.md5 @@ -0,0 +1 @@ +28f68d690a34e83ed529b0e7cf875a9c \ No newline at end of file diff --git a/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg new file mode 100644 index 000000000..6b0aebf2e --- /dev/null +++ b/db/dd3/ode__forward__euler_8cpp_af3adf7b092a87868917ee5fb4255192b_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +exact_solution + + + +Node1 + + +exact_solution + + + + + +Node2 + + +std::cos + + + + + +Node1->Node2 + + + + + +Node3 + + +std::sin + + + + + +Node1->Node3 + + + + + diff --git a/db/dd4/structlist__coll__graph.map b/db/dd4/structlist__coll__graph.map new file mode 100644 index 000000000..02369b136 --- /dev/null +++ b/db/dd4/structlist__coll__graph.map @@ -0,0 +1,3 @@ + + + diff --git a/db/dd4/structlist__coll__graph.md5 b/db/dd4/structlist__coll__graph.md5 new file mode 100644 index 000000000..ebc888f18 --- /dev/null +++ b/db/dd4/structlist__coll__graph.md5 @@ -0,0 +1 @@ +b27f82817fdb09c9c12cc0ea928971fc \ No newline at end of file diff --git a/db/dd4/structlist__coll__graph.svg b/db/dd4/structlist__coll__graph.svg new file mode 100644 index 000000000..2caf349ff --- /dev/null +++ b/db/dd4/structlist__coll__graph.svg @@ -0,0 +1,29 @@ + + + + + + +list + + + +Node1 + + +list + + + + + +Node1->Node1 + + + next + + + diff --git a/db/df3/happy__number_8cpp.html b/db/df3/happy__number_8cpp.html new file mode 100644 index 000000000..be09d47a3 --- /dev/null +++ b/db/df3/happy__number_8cpp.html @@ -0,0 +1,206 @@ + + + + + + + +Algorithms_in_C++: others/happy_number.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
happy_number.cpp File Reference
+
+
+ +

A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1. +More...

+
#include <iostream>
+
+Include dependency graph for happy_number.cpp:
+
+
+
+
+
+ + + + + + +

+Functions

template<typename T >
bool is_happy (T n)
 
int main ()
 
+

Detailed Description

+

A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1.

+

Function Documentation

+ +

◆ is_happy()

+ +
+
+
+template<typename T >
+ + + + + + + + +
bool is_happy (n)
+
+

Checks if a decimal number is a happy number

Returns
true if happy else false
+
14  {
+
15  T s = 0; // stores sum of digits
+
16  while (n > 9) { // while number is > 9, there are more than 1 digit
+
17  while (n != 0) { // get digit
+
18  T d = n % 10;
+
19  s += d;
+
20  n /= 10;
+
21  }
+
22  n = s;
+
23  s = 0;
+
24  }
+
25  return (n == 1) ? true : false; // true if k == 1
+
26 }
+
+
+
+ +

◆ main()

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

Main function

+
29  {
+
30  int n;
+
31  std::cout << "Enter a number:";
+
32  std::cin >> n;
+
33 
+
34  if (is_happy(n))
+
35  std::cout << n << " is a happy number" << std::endl;
+
36  else
+
37  std::cout << n << " is not a happy number" << std::endl;
+
38  return 0;
+
39 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
bool is_happy(T n)
Definition: happy_number.cpp:14
+
T endl(T... args)
+ + + + + diff --git a/db/df3/happy__number_8cpp.js b/db/df3/happy__number_8cpp.js new file mode 100644 index 000000000..00b55410a --- /dev/null +++ b/db/df3/happy__number_8cpp.js @@ -0,0 +1,5 @@ +var happy__number_8cpp = +[ + [ "is_happy", "db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7", null ], + [ "main", "db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..ac8415712 --- /dev/null +++ b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..902727a46 --- /dev/null +++ b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +f21e4c6581963c7779fe9d4f680ff130 \ No newline at end of file diff --git a/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..d45112587 --- /dev/null +++ b/db/df3/happy__number_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +is_happy + + + + + +Node1->Node3 + + + + + diff --git a/dc/d1a/pascal__triangle_8cpp.html b/dc/d1a/pascal__triangle_8cpp.html new file mode 100644 index 000000000..1c9bd6b8b --- /dev/null +++ b/dc/d1a/pascal__triangle_8cpp.html @@ -0,0 +1,291 @@ + + + + + + + +Algorithms_in_C++: others/pascal_triangle.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
pascal_triangle.cpp File Reference
+
+
+ +

Pascal's triangle implementation. +More...

+
#include <cstring>
+#include <iomanip>
+#include <iostream>
+
+Include dependency graph for pascal_triangle.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

void show_pascal (int **arr, int n)
 
int ** pascal_triangle (int **arr, int n)
 
int main ()
 
+

Detailed Description

+

Pascal's triangle implementation.

+

Function Documentation

+ +

◆ main()

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

main function

+
52  {
+
53  int n = 0;
+
54 
+
55  std::cout << "Set Pascal's Triangle Height" << std::endl;
+
56  std::cin >> n;
+
57 
+
58  // memory allocation (Assign two-dimensional array to store Pascal triangle)
+
59  int **arr = new int *[n];
+
60  for (int i = 0; i < n; ++i) {
+
61  arr[i] = new int[2 * n - 1];
+
62  memset(arr[i], 0, sizeof(int) * (2 * n - 1));
+
63  }
+
64 
+
65  pascal_triangle(arr, n);
+
66  show_pascal(arr, n);
+
67 
+
68  // deallocation
+
69  for (int i = 0; i < n; ++i) {
+
70  delete[] arr[i];
+
71  }
+
72  delete[] arr;
+
73 
+
74  return 0;
+
75 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ pascal_triangle()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int** pascal_triangle (int ** arr,
int n 
)
+
+

Print the triangle

Parameters
+ + + +
[in,out]arrarray containing Pascal numbers
[in]ndepth of Pascal triangle to print
+
+
+
Returns
arr pointer returned
+
36  {
+
37  for (int i = 0; i < n; ++i) {
+
38  for (int j = n - i - 1; j < n + i; ++j) {
+
39  if (j == n - i - 1 || j == n + i - 1)
+
40  arr[i][j] = 1; // The edge of the Pascal triangle goes in 1
+
41  else
+
42  arr[i][j] = arr[i - 1][j - 1] + arr[i - 1][j + 1];
+
43  }
+
44  }
+
45 
+
46  return arr;
+
47 }
+
+
+
+ +

◆ show_pascal()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void show_pascal (int ** arr,
int n 
)
+
+

Print the triangle

Parameters
+ + + +
[in]arr2D-array containing Pascal numbers
[in]ndepth of Pascal triangle to print
+
+
+
18  {
+
19  for (int i = 0; i < n; ++i) {
+
20  for (int j = 0; j < n + i; ++j) {
+
21  if (arr[i][j] == 0)
+
22  std::cout << std::setw(4) << " ";
+
23  else
+
24  std::cout << std::setw(4) << arr[i][j];
+
25  }
+ +
27  }
+
28 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
int ** pascal_triangle(int **arr, int n)
Definition: pascal_triangle.cpp:36
+ +
T endl(T... args)
+
T setw(T... args)
+ +
void show_pascal(int **arr, int n)
Definition: pascal_triangle.cpp:18
+
T memset(T... args)
+ + + + diff --git a/dc/d1a/pascal__triangle_8cpp.js b/dc/d1a/pascal__triangle_8cpp.js new file mode 100644 index 000000000..877243304 --- /dev/null +++ b/dc/d1a/pascal__triangle_8cpp.js @@ -0,0 +1,6 @@ +var pascal__triangle_8cpp = +[ + [ "main", "dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "pascal_triangle", "dc/d1a/pascal__triangle_8cpp.html#afd3f52dd56ddedbf7af5d26a202a199e", null ], + [ "show_pascal", "dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c", null ] +]; \ No newline at end of file diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map new file mode 100644 index 000000000..f19bd9dbc --- /dev/null +++ b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 new file mode 100644 index 000000000..26de61150 --- /dev/null +++ b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.md5 @@ -0,0 +1 @@ +caa1a77c7731a9de31a29f525b2b4583 \ No newline at end of file diff --git a/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg new file mode 100644 index 000000000..4ad4ceaac --- /dev/null +++ b/dc/d1a/pascal__triangle_8cpp_ad7a31d9cb2818d21b1ba12aead7f4c5c_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +show_pascal + + + +Node1 + + +show_pascal + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::setw + + + + + +Node1->Node3 + + + + + diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..466de1306 --- /dev/null +++ b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..ce1d3bf2c --- /dev/null +++ b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +ccfa80a00f865d04a990271c964d5318 \ No newline at end of file diff --git a/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..7bdcbede6 --- /dev/null +++ b/dc/d1a/pascal__triangle_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,88 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +pascal_triangle + + + + + +Node1->Node3 + + + + + +Node4 + + +show_pascal + + + + + +Node1->Node4 + + + + + +Node4->Node2 + + + + + +Node5 + + +std::setw + + + + + +Node4->Node5 + + + + + diff --git a/dc/d37/lu__decompose_8cpp__incl.map b/dc/d37/lu__decompose_8cpp__incl.map new file mode 100644 index 000000000..2544e7c25 --- /dev/null +++ b/dc/d37/lu__decompose_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/dc/d37/lu__decompose_8cpp__incl.md5 b/dc/d37/lu__decompose_8cpp__incl.md5 new file mode 100644 index 000000000..d14f77b15 --- /dev/null +++ b/dc/d37/lu__decompose_8cpp__incl.md5 @@ -0,0 +1 @@ +0aaf50ef77094991d705b3bba1630939 \ No newline at end of file diff --git a/dc/d37/lu__decompose_8cpp__incl.svg b/dc/d37/lu__decompose_8cpp__incl.svg new file mode 100644 index 000000000..2f08e9c80 --- /dev/null +++ b/dc/d37/lu__decompose_8cpp__incl.svg @@ -0,0 +1,83 @@ + + + + + + +numerical_methods/lu_decompose.cpp + + + +Node1 + + +numerical_methods/lu +_decompose.cpp + + + + + +Node2 + + +ctime + + + + + +Node1->Node2 + + + + + +Node3 + + +iomanip + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +vector + + + + + +Node1->Node5 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp.html b/dc/d38/ordinary__least__squares__regressor_8cpp.html new file mode 100644 index 000000000..c412f08cd --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp.html @@ -0,0 +1,994 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/ordinary_least_squares_regressor.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
ordinary_least_squares_regressor.cpp File Reference
+
+
+ +

Linear regression example using Ordinary least squares +More...

+
#include <iomanip>
+#include <iostream>
+#include <vector>
+
+Include dependency graph for ordinary_least_squares_regressor.cpp:
+
+
+
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Functions

template<typename T >
std::ostreamoperator<< (std::ostream &out, std::vector< std::vector< T >> const &v)
 
template<typename T >
std::ostreamoperator<< (std::ostream &out, std::vector< T > const &v)
 
template<typename T >
bool is_square (std::vector< std::vector< T >> const &A)
 
template<typename T >
std::vector< std::vector< T > > operator* (std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B)
 
template<typename T >
std::vector< T > operator* (std::vector< std::vector< T >> const &A, std::vector< T > const &B)
 
template<typename T >
std::vector< float > operator* (float const scalar, std::vector< T > const &A)
 
template<typename T >
std::vector< float > operator* (std::vector< T > const &A, float const scalar)
 
template<typename T >
std::vector< float > operator/ (std::vector< T > const &A, float const scalar)
 
template<typename T >
std::vector< T > operator- (std::vector< T > const &A, std::vector< T > const &B)
 
template<typename T >
std::vector< T > operator+ (std::vector< T > const &A, std::vector< T > const &B)
 
template<typename T >
std::vector< std::vector< float > > get_inverse (std::vector< std::vector< T >> const &A)
 
template<typename T >
std::vector< std::vector< T > > get_transpose (std::vector< std::vector< T >> const &A)
 
template<typename T >
std::vector< float > fit_OLS_regressor (std::vector< std::vector< T >> const &X, std::vector< T > const &Y)
 
template<typename T >
std::vector< float > predict_OLS_regressor (std::vector< std::vector< T >> const &X, std::vector< float > const &beta)
 
int main ()
 
+

Detailed Description

+

Linear regression example using Ordinary least squares

+
Author
Krishna Vedala Program that gets the number of data samples and number of features per sample along with output per sample. It applies OLS regression to compute the regression output for additional test data samples.
+

Function Documentation

+ +

◆ fit_OLS_regressor()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<float> fit_OLS_regressor (std::vector< std::vector< T >> const & X,
std::vector< T > const & Y 
)
+
+

Perform Ordinary Least Squares curve fit. This operation is defined as

+\[\beta = \left(X^TXX^T\right)Y\] +

+
Parameters
+ + + +
Xfeature matrix with rows representing sample vector of features
Yknown regression value for each sample
+
+
+
Returns
fitted regression model polynomial coefficients
+
310  {
+
311  // NxF
+ +
313  for (size_t i = 0; i < X2.size(); i++)
+
314  // add Y-intercept -> Nx(F+1)
+
315  X2[i].push_back(1);
+
316  // (F+1)xN
+ +
318  // (F+1)x(F+1)
+
319  std::vector<std::vector<T>> tmp = get_inverse(Xt * X2);
+
320  // (F+1)xN
+
321  std::vector<std::vector<float>> out = tmp * Xt;
+
322  // cout << endl
+
323  // << "Projection matrix: " << X2 * out << endl;
+
324 
+
325  // Fx1,1 -> (F+1)^th element is the independent constant
+
326  return out * Y;
+
327 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ get_inverse()

+ +
+
+
+template<typename T >
+ + + + + + + + +
std::vector<std::vector<float> > get_inverse (std::vector< std::vector< T >> const & A)
+
+

Get matrix inverse using Row-trasnformations. Given matrix must be a square and non-singular.

Returns
inverse matrix
+
218  {
+
219  // Assuming A is square matrix
+
220  size_t N = A.size();
+
221 
+
222  std::vector<std::vector<float>> inverse(N);
+
223  for (size_t row = 0; row < N; row++) {
+
224  // preallocatae a resultant identity matrix
+
225  inverse[row] = std::vector<float>(N);
+
226  for (size_t col = 0; col < N; col++)
+
227  inverse[row][col] = (row == col) ? 1.f : 0.f;
+
228  }
+
229 
+
230  if (!is_square(A)) {
+
231  std::cerr << "A must be a square matrix!" << std::endl;
+
232  return inverse;
+
233  }
+
234 
+
235  // preallocatae a temporary matrix identical to A
+ +
237  for (size_t row = 0; row < N; row++) {
+
238  std::vector<float> v(N);
+
239  for (size_t col = 0; col < N; col++)
+
240  v[col] = static_cast<float>(A[row][col]);
+
241  temp[row] = v;
+
242  }
+
243 
+
244  // start transformations
+
245  for (size_t row = 0; row < N; row++) {
+
246  for (size_t row2 = row; row2 < N && temp[row][row] == 0; row2++) {
+
247  // this to ensure diagonal elements are not 0
+
248  temp[row] = temp[row] + temp[row2];
+
249  inverse[row] = inverse[row] + inverse[row2];
+
250  }
+
251 
+
252  for (size_t col2 = row; col2 < N && temp[row][row] == 0; col2++) {
+
253  // this to further ensure diagonal elements are not 0
+
254  for (size_t row2 = 0; row2 < N; row2++) {
+
255  temp[row2][row] = temp[row2][row] + temp[row2][col2];
+
256  inverse[row2][row] = inverse[row2][row] + inverse[row2][col2];
+
257  }
+
258  }
+
259 
+
260  if (temp[row][row] == 0) {
+
261  // Probably a low-rank matrix and hence singular
+
262  std::cerr << "Low-rank matrix, no inverse!" << std::endl;
+
263  return inverse;
+
264  }
+
265 
+
266  // set diagonal to 1
+
267  float divisor = static_cast<float>(temp[row][row]);
+
268  temp[row] = temp[row] / divisor;
+
269  inverse[row] = inverse[row] / divisor;
+
270  // Row transformations
+
271  for (size_t row2 = 0; row2 < N; row2++) {
+
272  if (row2 == row)
+
273  continue;
+
274  float factor = temp[row2][row];
+
275  temp[row2] = temp[row2] - factor * temp[row];
+
276  inverse[row2] = inverse[row2] - factor * inverse[row];
+
277  }
+
278  }
+
279 
+
280  return inverse;
+
281 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ get_transpose()

+ +
+
+
+template<typename T >
+ + + + + + + + +
std::vector<std::vector<T> > get_transpose (std::vector< std::vector< T >> const & A)
+
+

matrix transpose

Returns
resultant matrix
+
289  {
+
290  std::vector<std::vector<T>> result(A[0].size());
+
291 
+
292  for (size_t row = 0; row < A[0].size(); row++) {
+
293  std::vector<T> v(A.size());
+
294  for (size_t col = 0; col < A.size(); col++) v[col] = A[col][row];
+
295 
+
296  result[row] = v;
+
297  }
+
298  return result;
+
299 }
+
+
+
+ +

◆ is_square()

+ +
+
+
+template<typename T >
+ + + + + +
+ + + + + + + + +
bool is_square (std::vector< std::vector< T >> const & A)
+
+inline
+
+

function to check if given matrix is a square matrix

Returns
1 if true, 0 if false
+
54  {
+
55  // Assuming A is square matrix
+
56  size_t N = A.size();
+
57  for (size_t i = 0; i < N; i++)
+
58  if (A[i].size() != N)
+
59  return false;
+
60  return true;
+
61 }
+
+
+
+ +

◆ main()

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

main function

+
357  {
+
358  size_t N, F;
+
359 
+
360  std::cout << "Enter number of features: ";
+
361  // number of features = columns
+
362  std::cin >> F;
+
363  std::cout << "Enter number of samples: ";
+
364  // number of samples = rows
+
365  std::cin >> N;
+
366 
+ +
368  std::vector<float> Y(N);
+
369 
+
370  std::cout
+
371  << "Enter training data. Per sample, provide features ad one output."
+
372  << std::endl;
+
373 
+
374  for (size_t rows = 0; rows < N; rows++) {
+
375  std::vector<float> v(F);
+
376  std::cout << "Sample# " << rows + 1 << ": ";
+
377  for (size_t cols = 0; cols < F; cols++)
+
378  // get the F features
+
379  std::cin >> v[cols];
+
380  data[rows] = v;
+
381  // get the corresponding output
+
382  std::cin >> Y[rows];
+
383  }
+
384 
+ +
386  std::cout << std::endl << std::endl << "beta:" << beta << std::endl;
+
387 
+
388  size_t T;
+
389  std::cout << "Enter number of test samples: ";
+
390  // number of test sample inputs
+
391  std::cin >> T;
+ +
393  // vector<float> Y2(T);
+
394 
+
395  for (size_t rows = 0; rows < T; rows++) {
+
396  std::cout << "Sample# " << rows + 1 << ": ";
+
397  std::vector<float> v(F);
+
398  for (size_t cols = 0; cols < F; cols++) std::cin >> v[cols];
+
399  data2[rows] = v;
+
400  }
+
401 
+
402  std::vector<float> out = predict_OLS_regressor(data2, beta);
+
403  for (size_t rows = 0; rows < T; rows++) std::cout << out[rows] << std::endl;
+
404 
+
405  return 0;
+
406 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator*() [1/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<float> operator* (float const scalar,
std::vector< T > const & A 
)
+
+

pre-multiplication of a vector by a scalar

Returns
resultant vector
+
130  {
+
131  // Number of rows in A
+
132  size_t N_A = A.size();
+
133 
+
134  std::vector<float> result(N_A);
+
135 
+
136  for (size_t row = 0; row < N_A; row++) {
+
137  result[row] += A[row] * static_cast<float>(scalar);
+
138  }
+
139 
+
140  return result;
+
141 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator*() [2/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<std::vector<T> > operator* (std::vector< std::vector< T >> const & A,
std::vector< std::vector< T >> const & B 
)
+
+

Matrix multiplication such that if A is size (mxn) and B is of size (pxq) then the multiplication is defined only when n = p and the resultant matrix is of size (mxq)

+
Returns
resultant matrix
+
72  {
+
73  // Number of rows in A
+
74  size_t N_A = A.size();
+
75  // Number of columns in B
+
76  size_t N_B = B[0].size();
+
77 
+
78  std::vector<std::vector<T>> result(N_A);
+
79 
+
80  if (A[0].size() != B.size()) {
+
81  std::cerr << "Number of columns in A != Number of rows in B ("
+
82  << A[0].size() << ", " << B.size() << ")" << std::endl;
+
83  return result;
+
84  }
+
85 
+
86  for (size_t row = 0; row < N_A; row++) {
+
87  std::vector<T> v(N_B);
+
88  for (size_t col = 0; col < N_B; col++) {
+
89  v[col] = static_cast<T>(0);
+
90  for (size_t j = 0; j < B.size(); j++)
+
91  v[col] += A[row][j] * B[j][col];
+
92  }
+
93  result[row] = v;
+
94  }
+
95 
+
96  return result;
+
97 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator*() [3/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<T> operator* (std::vector< std::vector< T >> const & A,
std::vector< T > const & B 
)
+
+

multiplication of a matrix with a column vector

Returns
resultant vector
+
105  {
+
106  // Number of rows in A
+
107  size_t N_A = A.size();
+
108 
+
109  std::vector<T> result(N_A);
+
110 
+
111  if (A[0].size() != B.size()) {
+
112  std::cerr << "Number of columns in A != Number of rows in B ("
+
113  << A[0].size() << ", " << B.size() << ")" << std::endl;
+
114  return result;
+
115  }
+
116 
+
117  for (size_t row = 0; row < N_A; row++) {
+
118  result[row] = static_cast<T>(0);
+
119  for (size_t j = 0; j < B.size(); j++) result[row] += A[row][j] * B[j];
+
120  }
+
121 
+
122  return result;
+
123 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator*() [4/4]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<float> operator* (std::vector< T > const & A,
float const scalar 
)
+
+

post-multiplication of a vector by a scalar

Returns
resultant vector
+
148  {
+
149  // Number of rows in A
+
150  size_t N_A = A.size();
+
151 
+
152  std::vector<float> result(N_A);
+
153 
+
154  for (size_t row = 0; row < N_A; row++)
+
155  result[row] = A[row] * static_cast<float>(scalar);
+
156 
+
157  return result;
+
158 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator+()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<T> operator+ (std::vector< T > const & A,
std::vector< T > const & B 
)
+
+

addition of two vectors of identical lengths

Returns
resultant vector
+
195  {
+
196  // Number of rows in A
+
197  size_t N = A.size();
+
198 
+
199  std::vector<T> result(N);
+
200 
+
201  if (B.size() != N) {
+
202  std::cerr << "Vector dimensions shouldbe identical!" << std::endl;
+
203  return A;
+
204  }
+
205 
+
206  for (size_t row = 0; row < N; row++) result[row] = A[row] + B[row];
+
207 
+
208  return result;
+
209 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator-()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<T> operator- (std::vector< T > const & A,
std::vector< T > const & B 
)
+
+

subtraction of two vectors of identical lengths

Returns
resultant vector
+
174  {
+
175  // Number of rows in A
+
176  size_t N = A.size();
+
177 
+
178  std::vector<T> result(N);
+
179 
+
180  if (B.size() != N) {
+
181  std::cerr << "Vector dimensions shouldbe identical!" << std::endl;
+
182  return A;
+
183  }
+
184 
+
185  for (size_t row = 0; row < N; row++) result[row] = A[row] - B[row];
+
186 
+
187  return result;
+
188 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator/()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<float> operator/ (std::vector< T > const & A,
float const scalar 
)
+
+

division of a vector by a scalar

Returns
resultant vector
+
165  {
+
166  return (1.f / scalar) * A;
+
167 }
+
+
+
+ +

◆ operator<<() [1/2]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::ostream& operator<< (std::ostreamout,
std::vector< std::vector< T >> const & v 
)
+
+

operator to print a matrix

+
20  {
+
21  const int width = 10;
+
22  const char separator = ' ';
+
23 
+
24  for (size_t row = 0; row < v.size(); row++) {
+
25  for (size_t col = 0; col < v[row].size(); col++)
+
26  out << std::left << std::setw(width) << std::setfill(separator)
+
27  << v[row][col];
+
28  out << std::endl;
+
29  }
+
30 
+
31  return out;
+
32 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator<<() [2/2]

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::ostream& operator<< (std::ostreamout,
std::vector< T > const & v 
)
+
+

operator to print a vector

+
38  {
+
39  const int width = 15;
+
40  const char separator = ' ';
+
41 
+
42  for (size_t row = 0; row < v.size(); row++)
+
43  out << std::left << std::setw(width) << std::setfill(separator)
+
44  << v[row];
+
45 
+
46  return out;
+
47 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ predict_OLS_regressor()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::vector<float> predict_OLS_regressor (std::vector< std::vector< T >> const & X,
std::vector< float > const & beta 
)
+
+

Given data and OLS model coeffficients, predict regression estimates. This operation is defined as

+\[y_{\text{row}=i} = \sum_{j=\text{columns}}\beta_j\cdot X_{i,j}\] +

+
Parameters
+ + + +
Xfeature matrix with rows representing sample vector of features
betafitted regression model
+
+
+
Returns
vector with regression values for each sample
+
341  {
+
342  std::vector<float> result(X.size());
+
343 
+
344  for (size_t rows = 0; rows < X.size(); rows++) {
+
345  // -> start with constant term
+
346  result[rows] = beta[X[0].size()];
+
347  for (size_t cols = 0; cols < X[0].size(); cols++)
+
348  result[rows] += beta[cols] * X[rows][cols];
+
349  }
+
350  // Nx1
+
351  return result;
+
352 }
+
+
+
+
+
+
uint64_t f[MAX]
Definition: fibonacci_fast.cpp:27
+
STL class.
+
T size(T... args)
+
T setfill(T... args)
+
bool is_square(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:54
+ +
std::vector< float > predict_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< float > const &beta)
Definition: ordinary_least_squares_regressor.cpp:339
+
int data[MAX]
test data
Definition: hash_search.cpp:24
+
std::vector< float > fit_OLS_regressor(std::vector< std::vector< T >> const &X, std::vector< T > const &Y)
Definition: ordinary_least_squares_regressor.cpp:309
+
T endl(T... args)
+
std::vector< std::vector< float > > get_inverse(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:217
+
T left(T... args)
+
T setw(T... args)
+ +
std::vector< std::vector< T > > get_transpose(std::vector< std::vector< T >> const &A)
Definition: ordinary_least_squares_regressor.cpp:288
+ + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp.js b/dc/d38/ordinary__least__squares__regressor_8cpp.js new file mode 100644 index 000000000..bc815530d --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp.js @@ -0,0 +1,18 @@ +var ordinary__least__squares__regressor_8cpp = +[ + [ "fit_OLS_regressor", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a38ff1d954e9b7de93eb20e2dd101a045", null ], + [ "get_inverse", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a98ab8f75d981088369b89b8be2182483", null ], + [ "get_transpose", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05", null ], + [ "is_square", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f", null ], + [ "main", "dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "operator*", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a9b2b5da35a6ba8ae203c33739ef0b91d", null ], + [ "operator*", "dc/d38/ordinary__least__squares__regressor_8cpp.html#ab6171f4db68a5e50ae0f3500a63acd26", null ], + [ "operator*", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a64d9dd5c5816d6d907b00e5f4b0372a5", null ], + [ "operator*", "dc/d38/ordinary__least__squares__regressor_8cpp.html#aecef32c2a4f39a3f7398949256d180a6", null ], + [ "operator+", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0", null ], + [ "operator-", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a31be3fe36e76b87d5616ff8e7918cd24", null ], + [ "operator/", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a30acf52af3184bc22274234ef5a73536", null ], + [ "operator<<", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a98eb5807f21b783c341cab402ced6732", null ], + [ "operator<<", "dc/d38/ordinary__least__squares__regressor_8cpp.html#aa799b4cec1681219887d89d037cfab50", null ], + [ "predict_OLS_regressor", "dc/d38/ordinary__least__squares__regressor_8cpp.html#a4bcaaf41c66da4d3a471dacef133def7", null ] +]; \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.map new file mode 100644 index 000000000..2a00111a8 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.md5 new file mode 100644 index 000000000..4edbf47a3 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.md5 @@ -0,0 +1 @@ +2f3b031b202221f1b2541d0dcb9cbcc0 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg new file mode 100644 index 000000000..b82202df6 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a31be3fe36e76b87d5616ff8e7918cd24_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +operator- + + + +Node1 + + +operator- + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::size + + + + + +Node1->Node3 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.map new file mode 100644 index 000000000..23419073f --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.md5 new file mode 100644 index 000000000..c067fc38a --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.md5 @@ -0,0 +1 @@ +f7cdb2473afd1e28b5b5851eb8c61505 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg new file mode 100644 index 000000000..5c5fbcd12 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a38ff1d954e9b7de93eb20e2dd101a045_cgraph.svg @@ -0,0 +1,97 @@ + + + + + + +fit_OLS_regressor + + + +Node1 + + +fit_OLS_regressor + + + + + +Node2 + + +get_inverse + + + + + +Node1->Node2 + + + + + +Node5 + + +get_transpose + + + + + +Node1->Node5 + + + + + +Node6 + + +std::vector::size + + + + + +Node1->Node6 + + + + + +Node3 + + +std::endl + + + + + +Node2->Node3 + + + + + +Node4 + + +is_square + + + + + +Node2->Node4 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map new file mode 100644 index 000000000..ed0cac802 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5 new file mode 100644 index 000000000..f7eba86af --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.md5 @@ -0,0 +1 @@ +64cbbb1df5c344a9a2abafce74132318 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg new file mode 100644 index 000000000..c3386c145 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a64d9dd5c5816d6d907b00e5f4b0372a5_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +operator* + + + +Node1 + + +operator* + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::size + + + + + +Node1->Node3 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.map new file mode 100644 index 000000000..227f29788 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.md5 new file mode 100644 index 000000000..781746e2c --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.md5 @@ -0,0 +1 @@ +d57610d3d7b0c5ac21d89b7326a3a580 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg new file mode 100644 index 000000000..e7d168d59 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a67249e31221231cf3aaf3cfd870372d0_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +operator+ + + + +Node1 + + +operator+ + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::vector::size + + + + + +Node1->Node3 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.map new file mode 100644 index 000000000..ef47b80fe --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.md5 new file mode 100644 index 000000000..56a7ee273 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.md5 @@ -0,0 +1 @@ +1c8e663a07d91145beb8fb2008e86122 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg new file mode 100644 index 000000000..dd618ef29 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98ab8f75d981088369b89b8be2182483_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +get_inverse + + + +Node1 + + +get_inverse + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +is_square + + + + + +Node1->Node3 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map new file mode 100644 index 000000000..1209266bf --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 new file mode 100644 index 000000000..d8a0506e3 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 @@ -0,0 +1 @@ +5d572395cc614d4fe8d328f204366b12 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg new file mode 100644 index 000000000..05f913712 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +operator<< + + + +Node1 + + +operator<< + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::left + + + + + +Node1->Node3 + + + + + +Node4 + + +std::setfill + + + + + +Node1->Node4 + + + + + +Node5 + + +std::setw + + + + + +Node1->Node5 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map new file mode 100644 index 000000000..9831e8be5 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5 new file mode 100644 index 000000000..06d8151cb --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.md5 @@ -0,0 +1 @@ +853180b63c189d061d111dc9113e2b51 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg new file mode 100644 index 000000000..a13270076 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_a9b2b5da35a6ba8ae203c33739ef0b91d_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +operator* + + + +Node1 + + +operator* + + + + + +Node2 + + +std::vector::size + + + + + +Node1->Node2 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.map new file mode 100644 index 000000000..2346a81bb --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.md5 new file mode 100644 index 000000000..df360d90c --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.md5 @@ -0,0 +1 @@ +25ec4718e406f531ef8a8f0cb804f843 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg new file mode 100644 index 000000000..0833db3b2 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aa799b4cec1681219887d89d037cfab50_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +operator<< + + + +Node1 + + +operator<< + + + + + +Node2 + + +std::left + + + + + +Node1->Node2 + + + + + +Node3 + + +std::setfill + + + + + +Node1->Node3 + + + + + +Node4 + + +std::setw + + + + + +Node1->Node4 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.map new file mode 100644 index 000000000..4f9b60620 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.md5 new file mode 100644 index 000000000..4006a112d --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.md5 @@ -0,0 +1 @@ +bdce570240e0de070c1169e752ba7ecb \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.svg new file mode 100644 index 000000000..47ae6dca1 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ab6171f4db68a5e50ae0f3500a63acd26_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +operator* + + + +Node1 + + +operator* + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..8a91004f8 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..ebca49874 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +25d118c3503cf8d09b19ff9b6d6e3e43 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..c55679f00 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,133 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +fit_OLS_regressor + + + + + +Node1->Node3 + + + + + +Node8 + + +predict_OLS_regressor + + + + + +Node1->Node8 + + + + + +Node4 + + +get_inverse + + + + + +Node3->Node4 + + + + + +Node6 + + +get_transpose + + + + + +Node3->Node6 + + + + + +Node7 + + +std::vector::size + + + + + +Node3->Node7 + + + + + +Node4->Node2 + + + + + +Node5 + + +is_square + + + + + +Node4->Node5 + + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.map b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.map new file mode 100644 index 000000000..9831e8be5 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.md5 b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.md5 new file mode 100644 index 000000000..06d8151cb --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.md5 @@ -0,0 +1 @@ +853180b63c189d061d111dc9113e2b51 \ No newline at end of file diff --git a/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg new file mode 100644 index 000000000..a13270076 --- /dev/null +++ b/dc/d38/ordinary__least__squares__regressor_8cpp_aecef32c2a4f39a3f7398949256d180a6_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +operator* + + + +Node1 + + +operator* + + + + + +Node2 + + +std::vector::size + + + + + +Node1->Node2 + + + + + diff --git a/dc/d43/decimal__to__roman__numeral_8cpp__incl.map b/dc/d43/decimal__to__roman__numeral_8cpp__incl.map new file mode 100644 index 000000000..4b6bc5a84 --- /dev/null +++ b/dc/d43/decimal__to__roman__numeral_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/dc/d43/decimal__to__roman__numeral_8cpp__incl.md5 b/dc/d43/decimal__to__roman__numeral_8cpp__incl.md5 new file mode 100644 index 000000000..b7001def7 --- /dev/null +++ b/dc/d43/decimal__to__roman__numeral_8cpp__incl.md5 @@ -0,0 +1 @@ +ca58ebfd7e81a0e7a55b397b4578a0d3 \ No newline at end of file diff --git a/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg b/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg new file mode 100644 index 000000000..17c33ee3a --- /dev/null +++ b/dc/d43/decimal__to__roman__numeral_8cpp__incl.svg @@ -0,0 +1,83 @@ + + + + + + +others/decimal_to_roman_numeral.cpp + + + +Node1 + + +others/decimal_to_roman +_numeral.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +cstdio + + + + + +Node1->Node3 + + + + + +Node4 + + +cstring + + + + + +Node1->Node4 + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + diff --git a/dc/d5f/qr__decompose_8h__dep__incl.map b/dc/d5f/qr__decompose_8h__dep__incl.map new file mode 100644 index 000000000..652acda92 --- /dev/null +++ b/dc/d5f/qr__decompose_8h__dep__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/d5f/qr__decompose_8h__dep__incl.md5 b/dc/d5f/qr__decompose_8h__dep__incl.md5 new file mode 100644 index 000000000..ade939cab --- /dev/null +++ b/dc/d5f/qr__decompose_8h__dep__incl.md5 @@ -0,0 +1 @@ +347d5b7e54ed20c88df058a9f53ceadf \ No newline at end of file diff --git a/dc/d5f/qr__decompose_8h__dep__incl.svg b/dc/d5f/qr__decompose_8h__dep__incl.svg new file mode 100644 index 000000000..6a5c0d421 --- /dev/null +++ b/dc/d5f/qr__decompose_8h__dep__incl.svg @@ -0,0 +1,55 @@ + + + + + + +numerical_methods/qr_decompose.h + + + +Node1 + + +numerical_methods/qr +_decompose.h + + + + + +Node2 + + +numerical_methods/qr +_decomposition.cpp + + + + + +Node1->Node2 + + + + + +Node3 + + +numerical_methods/qr +_eigen_values.cpp + + + + + +Node1->Node3 + + + + + diff --git a/dc/d93/trie__modern_8cpp.html b/dc/d93/trie__modern_8cpp.html new file mode 100644 index 000000000..5b504761e --- /dev/null +++ b/dc/d93/trie__modern_8cpp.html @@ -0,0 +1,171 @@ + + + + + + + +Algorithms_in_C++: data_structures/trie_modern.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
trie_modern.cpp File Reference
+
+
+ +

A basic implementation of trie class to store only lower-case strings. +More...

+
#include <iostream>
+#include <memory>
+#include <string>
+
+Include dependency graph for trie_modern.cpp:
+
+
+
+
+
+ + + + + +

+Classes

class  Trie
 
struct  Trie::TrieNode
 
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

A basic implementation of trie class to store only lower-case strings.

+

Copyright 2020

Author
Anmol3299
+

Function Documentation

+ +

◆ main()

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

Main function

+
160  {
+
161  Trie trie;
+
162  trie.insert("hel");
+
163  trie.insert("hello");
+
164  trie.removeWord("hel");
+
165  std::cout << trie.search("hello") << '\n';
+
166 
+
167  return 0;
+
168 }
+
+
+
+
+
+
Definition: trie_tree.cpp:8
+
Definition: trie_modern.cpp:16
+ + + + + diff --git a/dc/d93/trie__modern_8cpp.js b/dc/d93/trie__modern_8cpp.js new file mode 100644 index 000000000..7f7d32601 --- /dev/null +++ b/dc/d93/trie__modern_8cpp.js @@ -0,0 +1,6 @@ +var trie__modern_8cpp = +[ + [ "Trie", "dd/d2f/class_trie.html", "dd/d2f/class_trie" ], + [ "TrieNode", "de/d48/struct_trie_1_1_trie_node.html", "de/d48/struct_trie_1_1_trie_node" ], + [ "main", "dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/dc/db5/text__search_8cpp.html b/dc/db5/text__search_8cpp.html new file mode 100644 index 000000000..005ff086c --- /dev/null +++ b/dc/db5/text__search_8cpp.html @@ -0,0 +1,189 @@ + + + + + + + +Algorithms_in_C++: search/text_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
text_search.cpp File Reference
+
+
+ +

Search for words in a long textual paragraph. +More...

+
#include <cstdlib>
+#include <iostream>
+#include <cstring>
+
+Include dependency graph for text_search.cpp:
+
+
+
+
+
+ + + +

+Functions

int main ()
 
+

Detailed Description

+

Search for words in a long textual paragraph.

+

Function Documentation

+ +

◆ main()

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

Main function

+
15  {
+
16  std::string paragraph;
+
17  std::cout << "Please enter your paragraph: \n";
+
18  std::getline(std::cin, paragraph);
+
19  std::cout << "\nHello, your paragraph is:\n " << paragraph << "!\n";
+
20  std::cout << "\nThe size of your paragraph = " << paragraph.size()
+
21  << " characters. \n\n";
+
22 
+
23  if (paragraph.empty()) {
+
24  std::cout << "\nThe paragraph is empty" << std::endl;
+
25  } else {
+
26  while (true) {
+
27  std::string word;
+
28  std::cout << "Please enter the word you are searching for: ";
+
29  std::getline(std::cin, word);
+
30  std::cout << "Hello, your word is " << word << "!\n";
+
31  if (paragraph.find(word) == std::string::npos) {
+
32  std::cout << word << " does not exist in the sentence"
+
33  << std::endl;
+
34  } else {
+
35  std::cout << "The word " << word << " is now found at location "
+
36  << paragraph.find(word) << std::endl
+
37  << std::endl;
+
38  }
+
39  std::cin.get();
+
40  }
+
41  }
+
42 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
STL class.
+ +
T endl(T... args)
+
T getline(T... args)
+ + + + + diff --git a/dc/db5/text__search_8cpp.js b/dc/db5/text__search_8cpp.js new file mode 100644 index 000000000..d63f04085 --- /dev/null +++ b/dc/db5/text__search_8cpp.js @@ -0,0 +1,4 @@ +var text__search_8cpp = +[ + [ "main", "dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..08dc1b5a7 --- /dev/null +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..685159a17 --- /dev/null +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +546deebaf429d5e4ac5656f38fbe4024 \ No newline at end of file diff --git a/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..af48da736 --- /dev/null +++ b/dc/db5/text__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::getline + + + + + +Node1->Node3 + + + + + diff --git a/dc/dc5/ode__forward__euler_8cpp__incl.map b/dc/dc5/ode__forward__euler_8cpp__incl.map new file mode 100644 index 000000000..7d4085f41 --- /dev/null +++ b/dc/dc5/ode__forward__euler_8cpp__incl.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dc/dc5/ode__forward__euler_8cpp__incl.md5 b/dc/dc5/ode__forward__euler_8cpp__incl.md5 new file mode 100644 index 000000000..c3fc556a6 --- /dev/null +++ b/dc/dc5/ode__forward__euler_8cpp__incl.md5 @@ -0,0 +1 @@ +6c0133a36ee73621a7d187b5441a2122 \ No newline at end of file diff --git a/dc/dc5/ode__forward__euler_8cpp__incl.svg b/dc/dc5/ode__forward__euler_8cpp__incl.svg new file mode 100644 index 000000000..1678aba67 --- /dev/null +++ b/dc/dc5/ode__forward__euler_8cpp__incl.svg @@ -0,0 +1,98 @@ + + + + + + +numerical_methods/ode_forward_euler.cpp + + + +Node1 + + +numerical_methods/ode +_forward_euler.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +ctime + + + + + +Node1->Node3 + + + + + +Node4 + + +fstream + + + + + +Node1->Node4 + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + +Node6 + + +valarray + + + + + +Node1->Node6 + + + + + diff --git a/dc/dc5/paranthesis__matching_8cpp.html b/dc/dc5/paranthesis__matching_8cpp.html new file mode 100644 index 000000000..2a197ff18 --- /dev/null +++ b/dc/dc5/paranthesis__matching_8cpp.html @@ -0,0 +1,227 @@ + + + + + + + +Algorithms_in_C++: others/paranthesis_matching.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
paranthesis_matching.cpp File Reference
+
+
+ +

Perform paranthesis matching. +More...

+
#include <iostream>
+#include <cstring>
+
+Include dependency graph for paranthesis_matching.cpp:
+
+
+
+
+
+ + + +

+Macros

#define MAX   100
 
+ + + + + + + + + + + + + + + + +

+Functions

char opening (char ch)
 
+int main ()
 
char stack [MAX]
 
+int top = -1
 pointer to track stack index
 
+void push (char ch)
 push byte to stack variable
 
+char pop ()
 pop a byte out of stack variable
 
+

Detailed Description

+

Perform paranthesis matching.

+
Note
Do not know the application of this, however.
+
+Implementation is C-type and does not utilize the C++ constructs
+
Todo:
implement as a C++ class
+

Macro Definition Documentation

+ +

◆ MAX

+ +
+
+ + + + +
#define MAX   100
+
+

check number

+ +
+
+

Function Documentation

+ +

◆ opening()

+ +
+
+ + + + + + + + +
char opening (char ch)
+
+

return opening paranthesis corresponding to the close paranthesis

Parameters
+ + +
[in]chclosed paranthesis character
+
+
+
36  {
+
37  switch (ch) {
+
38  case '}':
+
39  return '{';
+
40  case ']':
+
41  return '[';
+
42  case ')':
+
43  return '(';
+
44  case '>':
+
45  return '<';
+
46  }
+
47  return '\0';
+
48 }
+
+
+
+

Variable Documentation

+ +

◆ stack

+ +
+
+ + + + +
char stack[MAX]
+
+

-----------— stack -----------— global stack

+ +
+
+
+
+ + + + diff --git a/dc/dc5/paranthesis__matching_8cpp.js b/dc/dc5/paranthesis__matching_8cpp.js new file mode 100644 index 000000000..d04986aab --- /dev/null +++ b/dc/dc5/paranthesis__matching_8cpp.js @@ -0,0 +1,10 @@ +var paranthesis__matching_8cpp = +[ + [ "MAX", "dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326", null ], + [ "main", "dc/dc5/paranthesis__matching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "opening", "dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21", null ], + [ "pop", "dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664", null ], + [ "push", "dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095", null ], + [ "stack", "dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7", null ], + [ "top", "dc/dc5/paranthesis__matching_8cpp.html#af93f4f37fc2ad9c37af4a715423b110c", null ] +]; \ No newline at end of file diff --git a/dc/de0/fibonacci__large_8cpp__incl.map b/dc/de0/fibonacci__large_8cpp__incl.map new file mode 100644 index 000000000..b5764f83d --- /dev/null +++ b/dc/de0/fibonacci__large_8cpp__incl.map @@ -0,0 +1,12 @@ + + + + + + + + + + + + diff --git a/dc/de0/fibonacci__large_8cpp__incl.md5 b/dc/de0/fibonacci__large_8cpp__incl.md5 new file mode 100644 index 000000000..49286988b --- /dev/null +++ b/dc/de0/fibonacci__large_8cpp__incl.md5 @@ -0,0 +1 @@ +6b39570dbac50617d3c22cd1794ec72a \ No newline at end of file diff --git a/dc/de0/fibonacci__large_8cpp__incl.svg b/dc/de0/fibonacci__large_8cpp__incl.svg new file mode 100644 index 000000000..13bdf3d20 --- /dev/null +++ b/dc/de0/fibonacci__large_8cpp__incl.svg @@ -0,0 +1,169 @@ + + + + + + +math/fibonacci_large.cpp + + + +Node1 + + +math/fibonacci_large.cpp + + + + + +Node2 + + +cinttypes + + + + + +Node1->Node2 + + + + + +Node3 + + +ctime + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +./large_number.h + + + + + +Node1->Node5 + + + + + +Node5->Node2 + + + + + +Node5->Node4 + + + + + +Node6 + + +algorithm + + + + + +Node5->Node6 + + + + + +Node7 + + +cassert + + + + + +Node5->Node7 + + + + + +Node8 + + +cstring + + + + + +Node5->Node8 + + + + + +Node9 + + +type_traits + + + + + +Node5->Node9 + + + + + +Node10 + + +vector + + + + + +Node5->Node10 + + + + + diff --git a/dc/de2/false__position_8cpp__incl.map b/dc/de2/false__position_8cpp__incl.map new file mode 100644 index 000000000..5ae67bde1 --- /dev/null +++ b/dc/de2/false__position_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/dc/de2/false__position_8cpp__incl.md5 b/dc/de2/false__position_8cpp__incl.md5 new file mode 100644 index 000000000..b1e8b238f --- /dev/null +++ b/dc/de2/false__position_8cpp__incl.md5 @@ -0,0 +1 @@ +af7e510fea5907e77434a402cd0066d5 \ No newline at end of file diff --git a/dc/de2/false__position_8cpp__incl.svg b/dc/de2/false__position_8cpp__incl.svg new file mode 100644 index 000000000..79de17876 --- /dev/null +++ b/dc/de2/false__position_8cpp__incl.svg @@ -0,0 +1,83 @@ + + + + + + +numerical_methods/false_position.cpp + + + +Node1 + + +numerical_methods/false +_position.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +cstdlib + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +limits + + + + + +Node1->Node5 + + + + + diff --git a/dc/dfe/ternary__search_8cpp.html b/dc/dfe/ternary__search_8cpp.html new file mode 100644 index 000000000..4ded930f6 --- /dev/null +++ b/dc/dfe/ternary__search_8cpp.html @@ -0,0 +1,461 @@ + + + + + + + +Algorithms_in_C++: search/ternary_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
ternary_search.cpp File Reference
+
+
+ +

Ternary search algorithm +More...

+
#include <iostream>
+
+Include dependency graph for ternary_search.cpp:
+
+
+
+
+
+ + + + + + + + +

+Macros

#define absolutePrecision   10
 
#define _target   10
 
+#define MAX   10000000
 Maximum length of array.
 
+ + + + + + + + + + + +

+Functions

void get_input ()
 
int it_ternary_search (int left, int right, int A[], int target)
 
int rec_ternary_search (int left, int right, int A[], int target)
 
void ternary_search (int N, int A[], int target)
 
int main ()
 
+

Detailed Description

+

Ternary search algorithm

+

This is a divide and conquer algorithm. It does this by dividing the search space by 3 parts and using its property (usually monotonic property) to find the desired index.

+
    +
  • Time Complexity : O(log3 n)
  • +
  • Space Complexity : O(1) (without the array)
  • +
+

Macro Definition Documentation

+ +

◆ _target

+ +
+
+ + + + +
#define _target   10
+
+

The value of _target should be decided or can be decided later by using the variable of the function.

+ +
+
+ +

◆ absolutePrecision

+ +
+
+ + + + +
#define absolutePrecision   10
+
+

The absolutePrecision can be modified to fit preference but it is recommended to not go lower than 10 due to errors that may occur.

+ +
+
+

Function Documentation

+ +

◆ get_input()

+ +
+
+ + + + + + + +
void get_input ()
+
+

get_input function is to receive input from standard IO

Todo:
@christianbender Get input from STDIO or write input to memory as done above.
+
36 {}
+
+
+
+ +

◆ it_ternary_search()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int it_ternary_search (int left,
int right,
int A[],
int target 
)
+
+

This is the iterative method of the ternary search which returns the index of the element.

Parameters
+ + + + + +
[in]leftlower interval limit
[in]rightupper interval limit
[in]Aarray to search in
[in]targetvalue to search for
+
+
+
Returns
index where the target value was found
+
+-1 if target value not found
+
48  {
+
49  while (1) {
+
50  if (left < right) {
+
51  if (right - left < absolutePrecision) {
+
52  for (int i = left; i <= right; i++)
+
53  if (A[i] == target)
+
54  return i;
+
55 
+
56  return -1;
+
57  }
+
58 
+
59  int oneThird = (left + right) / 3 + 1;
+
60  int twoThird = (left + right) * 2 / 3 + 1;
+
61 
+
62  if (A[oneThird] == target)
+
63  return oneThird;
+
64  else if (A[twoThird] == target)
+
65  return twoThird;
+
66 
+
67  else if (target > A[twoThird])
+
68  left = twoThird + 1;
+
69  else if (target < A[oneThird])
+
70  right = oneThird - 1;
+
71 
+
72  else
+
73  left = oneThird + 1, right = twoThird - 1;
+
74  } else {
+
75  return -1;
+
76  }
+
77  }
+
78 }
+
+
+
+ +

◆ main()

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

Main function

+
134  {
+
135  int N = 21;
+
136  int A[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 4, 10};
+
137  get_input();
+
138  ternary_search(N, A, _target);
+
139  return 0;
+
140 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ rec_ternary_search()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
int rec_ternary_search (int left,
int right,
int A[],
int target 
)
+
+

This is the recursive method of the ternary search which returns the index of the element.

Parameters
+ + + + + +
[in]leftlower interval limit
[in]rightupper interval limit
[in]Aarray to search in
[in]targetvalue to search for
+
+
+
Returns
index where the target value was found
+
+-1 if target value not found
+
90  {
+
91  if (left < right) {
+
92  if (right - left < absolutePrecision) {
+
93  for (int i = left; i <= right; i++)
+
94  if (A[i] == target)
+
95  return i;
+
96 
+
97  return -1;
+
98  }
+
99 
+
100  int oneThird = (left + right) / 3 + 1;
+
101  int twoThird = (left + right) * 2 / 3 + 1;
+
102 
+
103  if (A[oneThird] == target)
+
104  return oneThird;
+
105  if (A[twoThird] == target)
+
106  return twoThird;
+
107 
+
108  if (target < A[oneThird])
+
109  return rec_ternary_search(left, oneThird - 1, A, target);
+
110  if (target > A[twoThird])
+
111  return rec_ternary_search(twoThird + 1, right, A, target);
+
112 
+
113  return rec_ternary_search(oneThird + 1, twoThird - 1, A, target);
+
114  } else {
+
115  return -1;
+
116  }
+
117 }
+
+
+
+ +

◆ ternary_search()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void ternary_search (int N,
int A[],
int target 
)
+
+

ternary_search is a template function You could either use it_ternary_search or rec_ternary_search according to preference.

Parameters
+ + + + +
[in]Nlength of array
[in]Aarray to search in
[in]targetvalue to search for
+
+
+
127  {
+
128  std::cout << it_ternary_search(0, N - 1, A, target) << '\t';
+
129  std::cout << rec_ternary_search(0, N - 1, A, target) << '\t';
+
130  std::cout << std::endl;
+
131 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
void ternary_search(int N, int A[], int target)
Definition: ternary_search.cpp:127
+
#define absolutePrecision
Definition: ternary_search.cpp:22
+
int rec_ternary_search(int left, int right, int A[], int target)
Definition: ternary_search.cpp:90
+ +
#define _target
Definition: ternary_search.cpp:27
+
int it_ternary_search(int left, int right, int A[], int target)
Definition: ternary_search.cpp:48
+
T endl(T... args)
+
T right(T... args)
+
void get_input()
Definition: ternary_search.cpp:36
+ + + + diff --git a/dc/dfe/ternary__search_8cpp.js b/dc/dfe/ternary__search_8cpp.js new file mode 100644 index 000000000..85ae8eb75 --- /dev/null +++ b/dc/dfe/ternary__search_8cpp.js @@ -0,0 +1,11 @@ +var ternary__search_8cpp = +[ + [ "_target", "dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027", null ], + [ "absolutePrecision", "dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc", null ], + [ "MAX", "dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326", null ], + [ "get_input", "dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1", null ], + [ "it_ternary_search", "dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0", null ], + [ "main", "dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "rec_ternary_search", "dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead", null ], + [ "ternary_search", "dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8", null ] +]; \ No newline at end of file diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..92014eac6 --- /dev/null +++ b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..8e7f84a9f --- /dev/null +++ b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +621cd897edea0804f61d86b01ad1a90d \ No newline at end of file diff --git a/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..1b73e0e56 --- /dev/null +++ b/dc/dfe/ternary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,97 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +get_input + + + + + +Node1->Node2 + + + + + +Node3 + + +ternary_search + + + + + +Node1->Node3 + + + + + +Node4 + + +std::endl + + + + + +Node3->Node4 + + + + + +Node5 + + +it_ternary_search + + + + + +Node3->Node5 + + + + + +Node6 + + +rec_ternary_search + + + + + +Node3->Node6 + + + + + diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map new file mode 100644 index 000000000..895f9d368 --- /dev/null +++ b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 new file mode 100644 index 000000000..aecc25c72 --- /dev/null +++ b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.md5 @@ -0,0 +1 @@ +3749349ab9e91b8cbe42eb831fccdd9f \ No newline at end of file diff --git a/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg new file mode 100644 index 000000000..84dae2cb3 --- /dev/null +++ b/dc/dfe/ternary__search_8cpp_aef655a27eb82efa299bf9d0becf6e9c8_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +ternary_search + + + +Node1 + + +ternary_search + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +it_ternary_search + + + + + +Node1->Node3 + + + + + +Node4 + + +rec_ternary_search + + + + + +Node1->Node4 + + + + + diff --git a/dd/d00/class_queue-members.html b/dd/d00/class_queue-members.html new file mode 100644 index 000000000..c6f420350 --- /dev/null +++ b/dd/d00/class_queue-members.html @@ -0,0 +1,118 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Queue Member List
+
+
+ +

This is the complete list of members for Queue, including all inherited members.

+ + + + + + + + +
createNode(int val) (defined in Queue)Queueinline
dequeue() (defined in Queue)Queueinline
enqueue(int val) (defined in Queue)Queueinline
front (defined in Queue)Queueprivate
Queue() (defined in Queue)Queueinline
rear (defined in Queue)Queueprivate
traverse() (defined in Queue)Queueinline
+
+ + + + diff --git a/dd/d0e/double__factorial_8cpp__incl.map b/dd/d0e/double__factorial_8cpp__incl.map new file mode 100644 index 000000000..8fabeca1a --- /dev/null +++ b/dd/d0e/double__factorial_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dd/d0e/double__factorial_8cpp__incl.md5 b/dd/d0e/double__factorial_8cpp__incl.md5 new file mode 100644 index 000000000..1d4164467 --- /dev/null +++ b/dd/d0e/double__factorial_8cpp__incl.md5 @@ -0,0 +1 @@ +ee60764944201d6cf3f6571ad0be0d7d \ No newline at end of file diff --git a/dd/d0e/double__factorial_8cpp__incl.svg b/dd/d0e/double__factorial_8cpp__incl.svg new file mode 100644 index 000000000..05f08e2a7 --- /dev/null +++ b/dd/d0e/double__factorial_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/double_factorial.cpp + + + +Node1 + + +math/double_factorial.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/dd/d0f/text__search_8cpp__incl.map b/dd/d0f/text__search_8cpp__incl.map new file mode 100644 index 000000000..09c75be7f --- /dev/null +++ b/dd/d0f/text__search_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/dd/d0f/text__search_8cpp__incl.md5 b/dd/d0f/text__search_8cpp__incl.md5 new file mode 100644 index 000000000..42c8682b7 --- /dev/null +++ b/dd/d0f/text__search_8cpp__incl.md5 @@ -0,0 +1 @@ +fd3cff2d5c9ddc6ee71f7ee4179cb735 \ No newline at end of file diff --git a/dd/d0f/text__search_8cpp__incl.svg b/dd/d0f/text__search_8cpp__incl.svg new file mode 100644 index 000000000..fd8972f4f --- /dev/null +++ b/dd/d0f/text__search_8cpp__incl.svg @@ -0,0 +1,67 @@ + + + + + + +search/text_search.cpp + + + +Node1 + + +search/text_search.cpp + + + + + +Node2 + + +cstdlib + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +cstring + + + + + +Node1->Node4 + + + + + diff --git a/dd/d1b/structquery.html b/dd/d1b/structquery.html new file mode 100644 index 000000000..c76201861 --- /dev/null +++ b/dd/d1b/structquery.html @@ -0,0 +1,128 @@ + + + + + + + +Algorithms_in_C++: query Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
query Struct Reference
+
+
+ + + + + + + + +

+Public Attributes

+int l
 
+int r
 
+int i
 
+
The documentation for this struct was generated from the following file:
    +
  • range_queries/mo.cpp
  • +
+
+
+ + + + diff --git a/dd/d1b/structquery.js b/dd/d1b/structquery.js new file mode 100644 index 000000000..88ddd6cf0 --- /dev/null +++ b/dd/d1b/structquery.js @@ -0,0 +1,6 @@ +var structquery = +[ + [ "i", "dd/d1b/structquery.html#a1442afb70f26fd0655914632c0dcadcd", null ], + [ "l", "dd/d1b/structquery.html#aedd873fb96eb4f83fb4289b1c58ce794", null ], + [ "r", "dd/d1b/structquery.html#a748f5dfd8faf440897bab39091f0a5ca", null ] +]; \ No newline at end of file diff --git a/dd/d29/false__position_8cpp.html b/dd/d29/false__position_8cpp.html new file mode 100644 index 000000000..1f7c83fe3 --- /dev/null +++ b/dd/d29/false__position_8cpp.html @@ -0,0 +1,275 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/false_position.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
false_position.cpp File Reference
+
+
+ +

Solve the equation \(f(x)=0\) using false position method, also known as the Secant method. +More...

+
#include <cmath>
+#include <cstdlib>
+#include <iostream>
+#include <limits>
+
+Include dependency graph for false_position.cpp:
+
+
+
+
+
+ + + + + + +

+Macros

+#define EPSILON   1e-6
 
+#define MAX_ITERATIONS   50000
 Maximum number of iterations to check.
 
+ + + + + + + + +

+Functions

static double eq (double i)
 
template<typename T >
int sgn (T val)
 
int main ()
 
+

Detailed Description

+

Solve the equation \(f(x)=0\) using false position method, also known as the Secant method.

+

Given two points \(a\) and \(b\) such that \(f(a)<0\) and \(f(b)>0\), then the \((i+1)^\text{th}\) approximation is given by:

+\[ x_{i+1} = \frac{a_i\cdot f(b_i) - b_i\cdot f(a_i)}{f(b_i) - f(a_i)} \] +

+

For the next iteration, the interval is selected as: \([a,x]\) if \(x>0\) or \([x,b]\) if \(x<0\). The Process is continued till a close enough approximation is achieved.

+
See also
newton_raphson_method.cpp, bisection_method.cpp
+

Function Documentation

+ +

◆ eq()

+ +
+
+ + + + + +
+ + + + + + + + +
static double eq (double i)
+
+static
+
+

define \(f(x)\) to find root for

+
28  {
+
29  return (std::pow(i, 3) - (4 * i) - 9); // origial equation
+
30 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

main function

+
39  {
+
40  double a = -1, b = 1, x, z, m, n, c;
+
41  int i;
+
42 
+
43  // loop to find initial intervals a, b
+
44  for (int i = 0; i < MAX_ITERATIONS; i++) {
+
45  z = eq(a);
+
46  x = eq(b);
+
47  if (sgn(z) == sgn(x)) { // same signs, increase interval
+
48  b++;
+
49  a--;
+
50  } else { // if opposite signs, we got our interval
+
51  break;
+
52  }
+
53  }
+
54 
+
55  std::cout << "\nFirst initial: " << a;
+
56  std::cout << "\nSecond initial: " << b;
+
57 
+
58  for (i = 0; i < MAX_ITERATIONS; i++) {
+
59  m = eq(a);
+
60  n = eq(b);
+
61 
+
62  c = ((a * n) - (b * m)) / (n - m);
+
63 
+
64  a = c;
+
65  z = eq(c);
+
66 
+
67  if (std::abs(z) < EPSILON) { // stoping criteria
+
68  break;
+
69  }
+
70  }
+
71 
+
72  std::cout << "\n\nRoot: " << c << "\t\tSteps: " << i << std::endl;
+
73  return 0;
+
74 }
+
+
+
+ +

◆ sgn()

+ +
+
+
+template<typename T >
+ + + + + + + + +
int sgn (val)
+
+

get the sign of any given number

+
34  {
+
35  return (T(0) < val) - (val < T(0));
+
36 }
+
+
+
+
+
+
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: false_position.cpp:24
+ +
int sgn(T val)
Definition: false_position.cpp:34
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+
static double eq(double i)
Definition: false_position.cpp:28
+
T pow(T... args)
+ + + + diff --git a/dd/d29/false__position_8cpp.js b/dd/d29/false__position_8cpp.js new file mode 100644 index 000000000..05bcc2cad --- /dev/null +++ b/dd/d29/false__position_8cpp.js @@ -0,0 +1,8 @@ +var false__position_8cpp = +[ + [ "EPSILON", "dd/d29/false__position_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70", null ], + [ "MAX_ITERATIONS", "dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14", null ], + [ "eq", "dd/d29/false__position_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d", null ], + [ "main", "dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "sgn", "dd/d29/false__position_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2", null ] +]; \ No newline at end of file diff --git a/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map new file mode 100644 index 000000000..f584df02e --- /dev/null +++ b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 new file mode 100644 index 000000000..ecfa65278 --- /dev/null +++ b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 @@ -0,0 +1 @@ +ebb04cd15e67d7a7b151a478105c7fad \ No newline at end of file diff --git a/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg new file mode 100644 index 000000000..c3eea1476 --- /dev/null +++ b/dd/d29/false__position_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +eq + + + +Node1 + + +eq + + + + + +Node2 + + +std::pow + + + + + +Node1->Node2 + + + + + diff --git a/dd/d2f/class_trie.html b/dd/d2f/class_trie.html new file mode 100644 index 000000000..608aa647f --- /dev/null +++ b/dd/d2f/class_trie.html @@ -0,0 +1,414 @@ + + + + + + + +Algorithms_in_C++: Trie Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for Trie:
+
+
+
+
[legend]
+ + + + +

+Classes

struct  TrieNode
 
+ + + + + + + + + + +

+Public Member Functions

Trie ()
 constructor to initialise the root of the trie.
 
void insert (const std::string &word)
 
bool search (const std::string &word)
 
+void removeWord (const std::string &word)
 
+ + + +

+Private Member Functions

std::shared_ptr< TrieNoderemoveWordHelper (const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
 
+ + + +

+Static Private Member Functions

static bool hasChildren (std::shared_ptr< TrieNode > node)
 
+ + + +

+Private Attributes

+std::shared_ptr< TrieNodem_root
 
+ + + +

+Static Private Attributes

+static constexpr size_t ALPHABETS = 26
 
+

Detailed Description

+

A basic implementation of trie class to store only lower-case strings. You can extend the implementation to all the ASCII characters by changing the value of @ ALPHABETS to 128.

+

Member Function Documentation

+ +

◆ hasChildren()

+ +
+
+ + + + + +
+ + + + + + + + +
static bool Trie::hasChildren (std::shared_ptr< TrieNodenode)
+
+inlinestaticprivate
+
+

Function to check if a node has some children which can form words.

Parameters
+ + +
nodewhose character array of pointers need to be checked for children.
+
+
+
Returns
true if a child is found
+
+false if a child is not found
+
41  {
+
42  for (size_t i = 0; i < ALPHABETS; i++) {
+
43  if (node->character[i]) {
+
44  return true;
+
45  }
+
46  }
+
47  return false;
+
48  }
+
+
+
+ +

◆ insert()

+ +
+
+ + + + + +
+ + + + + + + + +
void Trie::insert (const std::stringword)
+
+inline
+
+

Insert a word into the trie.

Parameters
+ + +
wordwhich needs to be inserted into the string.
+
+
+
109  {
+
110  auto curr = m_root;
+
111  for (char ch : word) {
+
112  size_t index = ch - 'a';
+
113 
+
114  // if a node for current word is not already present in trie, create
+
115  // a new node for it.
+
116  if (!curr->character[index]) {
+
117  curr->character[index] = std::make_shared<TrieNode>();
+
118  }
+
119 
+
120  curr = curr->character[index];
+
121  }
+
122  curr->isEndOfWord = true;
+
123  }
+
+
+
+ +

◆ removeWordHelper()

+ +
+
+ + + + + +
+ + + + + + + + + + + + + + + + + + + + + + + + +
std::shared_ptr<TrieNode> Trie::removeWordHelper (const std::stringword,
std::shared_ptr< TrieNodecurr,
size_t index 
)
+
+inlineprivate
+
+

A recursive helper function to remove a word from the trie. First, it recursively traverses to the location of last character of word in the trie. However, if the word is not found, the function returns a runtime error. Upon successfully reaching the last character of word in trie, if sets the isEndOfWord to false and deletes the node if and only if it has no children, else it returns the current node.

Parameters
+ + + + +
wordis the string which needs to be removed from trie.
curris the current node we are at.
indexis the index of the @word we are at.
+
+
+
Returns
if current node has childern, it returns @ curr, else it returns nullptr.
+
Exceptions
+ + +
aruntime error in case @ word is not found in the trie.
+
+
+
66  {
+
67  if (word.size() == index) {
+
68  if (curr->isEndOfWord) {
+
69  curr->isEndOfWord = false;
+
70  }
+
71  if (hasChildren(curr)) {
+
72  return curr;
+
73  }
+
74  return nullptr;
+
75  }
+
76 
+
77  size_t idx = word[index] - 'a';
+
78 
+
79  // Throw a runtime error in case the user enters a word which is not
+
80  // present in the trie.
+
81  if (!curr->character[idx]) {
+
82  throw std::runtime_error(std::move(std::string("Word not found.")));
+
83  }
+
84 
+
85  curr->character[idx] =
+
86  removeWordHelper(word, curr->character[idx], index + 1);
+
87 
+
88  // This if condition checks if the node has some childern.
+
89  // The 1st if check, i.e. (curr->character[idx]) is checked specifically
+
90  // because if the older string is a prefix of some other string, then,
+
91  // there would be no need to check all 26 characters. Example- str1 =
+
92  // abbey, str2 = abbex and we want to delete string "abbey", then in
+
93  // this case, there would be no need to check all characters for the
+
94  // chars a,b,b.
+
95  if (curr->character[idx] || hasChildren(curr)) {
+
96  return curr;
+
97  }
+
98  return nullptr;
+
99  }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ search()

+ +
+
+ + + + + +
+ + + + + + + + +
bool Trie::search (const std::stringword)
+
+inline
+
+

Search if a word is present in trie or not.

Parameters
+ + +
wordwhich is needed to be searched in the trie.
+
+
+
Returns
True if the word is found in trie and isEndOfWord is set to true.
+
+False if word is not found in trie or isEndOfWord is set to false.
+
132  {
+
133  auto curr = m_root;
+
134  for (char ch : word) {
+
135  size_t index = ch - 'a';
+
136 
+
137  // if any node for a character is not found, then return that the
+
138  // word cannot be formed.
+
139  if (!curr->character[index]) {
+
140  return false;
+
141  }
+
142  curr = curr->character[index];
+
143  }
+
144  return curr->isEndOfWord;
+
145  }
+
+
+
+
The documentation for this class was generated from the following file: +
+
+
STL class.
+
T move(T... args)
+
T size(T... args)
+
static bool hasChildren(std::shared_ptr< TrieNode > node)
Definition: trie_modern.cpp:41
+
Definition: avltree.cpp:13
+ +
std::shared_ptr< TrieNode > removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)
Definition: trie_modern.cpp:64
+ + + + diff --git a/dd/d2f/class_trie.js b/dd/d2f/class_trie.js new file mode 100644 index 000000000..2661e64da --- /dev/null +++ b/dd/d2f/class_trie.js @@ -0,0 +1,12 @@ +var class_trie = +[ + [ "TrieNode", "de/d48/struct_trie_1_1_trie_node.html", "de/d48/struct_trie_1_1_trie_node" ], + [ "Trie", "dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908", null ], + [ "hasChildren", "dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb", null ], + [ "insert", "dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2", null ], + [ "removeWord", "dd/d2f/class_trie.html#a734a08b52b8ad73bdd1f36ae8348056e", null ], + [ "removeWordHelper", "dd/d2f/class_trie.html#a95216ffc56cb9f8cede982cecb872af4", null ], + [ "search", "dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206", null ], + [ "ALPHABETS", "dd/d2f/class_trie.html#a7c3ba4caf24378826a789848629177bd", null ], + [ "m_root", "dd/d2f/class_trie.html#a58b359fad33ca0064bd75a0d41a7b66d", null ] +]; \ No newline at end of file diff --git a/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.map b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.map new file mode 100644 index 000000000..ca1931122 --- /dev/null +++ b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.md5 b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.md5 new file mode 100644 index 000000000..0e9379408 --- /dev/null +++ b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.md5 @@ -0,0 +1 @@ +78be4e71e977b5dce6cdfc91a3a722ec \ No newline at end of file diff --git a/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg new file mode 100644 index 000000000..08f591b0c --- /dev/null +++ b/dd/d2f/class_trie_a95216ffc56cb9f8cede982cecb872af4_cgraph.svg @@ -0,0 +1,67 @@ + + + + + + +Trie::removeWordHelper + + + +Node1 + + +Trie::removeWordHelper + + + + + +Node2 + + +Trie::hasChildren + + + + + +Node1->Node2 + + + + + +Node3 + + +std::move + + + + + +Node1->Node3 + + + + + +Node4 + + +std::string::size + + + + + +Node1->Node4 + + + + + diff --git a/dd/d30/matrix__exponentiation_8cpp__incl.map b/dd/d30/matrix__exponentiation_8cpp__incl.map new file mode 100644 index 000000000..3ebaa83b6 --- /dev/null +++ b/dd/d30/matrix__exponentiation_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dd/d30/matrix__exponentiation_8cpp__incl.md5 b/dd/d30/matrix__exponentiation_8cpp__incl.md5 new file mode 100644 index 000000000..680bb3397 --- /dev/null +++ b/dd/d30/matrix__exponentiation_8cpp__incl.md5 @@ -0,0 +1 @@ +0682b4368c5373318d2d76ce2a7a30af \ No newline at end of file diff --git a/dd/d30/matrix__exponentiation_8cpp__incl.svg b/dd/d30/matrix__exponentiation_8cpp__incl.svg new file mode 100644 index 000000000..b875c5f4d --- /dev/null +++ b/dd/d30/matrix__exponentiation_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +others/matrix_exponentiation.cpp + + + +Node1 + + +others/matrix_exponentiation.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +vector + + + + + +Node1->Node3 + + + + + diff --git a/dd/d3b/struct_entry.html b/dd/d3b/struct_entry.html new file mode 100644 index 000000000..1367a4440 --- /dev/null +++ b/dd/d3b/struct_entry.html @@ -0,0 +1,137 @@ + + + + + + + +Algorithms_in_C++: Entry Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
Entry Struct Reference
+
+
+ + + + + + + + +

+Public Member Functions

Entry (int key=notPresent)
 
Entry (int key=notPresent)
 
Entry (int key=notPresent)
 
+ + + +

+Public Attributes

+int key
 
+
The documentation for this struct was generated from the following files:
    +
  • hashing/double_hash_hash_table.cpp
  • +
  • hashing/linear_probing_hash_table.cpp
  • +
  • hashing/quadratic_probing_hash_table.cpp
  • +
+
+
+ + + + diff --git a/dd/d3b/struct_entry.js b/dd/d3b/struct_entry.js new file mode 100644 index 000000000..50ad39d40 --- /dev/null +++ b/dd/d3b/struct_entry.js @@ -0,0 +1,7 @@ +var struct_entry = +[ + [ "Entry", "dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372", null ], + [ "Entry", "dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372", null ], + [ "Entry", "dd/d3b/struct_entry.html#aeda5da9d6e79cb91d566e85af94fc372", null ], + [ "key", "dd/d3b/struct_entry.html#acef39096ad1bc616755a4c120a713cea", null ] +]; \ No newline at end of file diff --git a/dd/d4f/class_solution.html b/dd/d4f/class_solution.html new file mode 100644 index 000000000..7944b580d --- /dev/null +++ b/dd/d4f/class_solution.html @@ -0,0 +1,157 @@ + + + + + + + +Algorithms_in_C++: Solution Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for Solution:
+
+
+
+
[legend]
+ + + + +

+Public Member Functions

+vector< vector< int > > search_bridges (int n, const vector< vector< int >> &connections)
 
+ + + +

+Private Member Functions

+void dfs (int current_node, int parent)
 
+ + + + + + + + + + + + + +

+Private Attributes

+vector< vector< int > > graph
 
+vector< int > in_time
 
+vector< int > out_time
 
+int timer
 
+vector< vector< int > > bridge
 
+vector< bool > visited
 
+
The documentation for this class was generated from the following file:
    +
  • graph/bridge_finding_with_tarjan_algorithm.cpp
  • +
+
+
+ + + + diff --git a/dd/d4f/class_solution.js b/dd/d4f/class_solution.js new file mode 100644 index 000000000..8463ed649 --- /dev/null +++ b/dd/d4f/class_solution.js @@ -0,0 +1,11 @@ +var class_solution = +[ + [ "dfs", "dd/d4f/class_solution.html#a29d19d87d54fe43d3f22221b8fe1b0bc", null ], + [ "search_bridges", "dd/d4f/class_solution.html#ac9c725337cddfd2dc20ee18f8f1811f7", null ], + [ "bridge", "dd/d4f/class_solution.html#a90a1c45a367a06a2ac0303454857257c", null ], + [ "graph", "dd/d4f/class_solution.html#a50bf79c8a34952dea70eeb47cef0a945", null ], + [ "in_time", "dd/d4f/class_solution.html#aa3befe17e23ba7f8edf3e0b91366798d", null ], + [ "out_time", "dd/d4f/class_solution.html#a396e87fa435c4ff06ee1cd6be55f95be", null ], + [ "timer", "dd/d4f/class_solution.html#ae8ca86dfb0d034665027aa99af3c88c6", null ], + [ "visited", "dd/d4f/class_solution.html#a0a92d4ba2a822ae87e4c8a7c321024c0", null ] +]; \ No newline at end of file diff --git a/dd/d51/classstack-members.html b/dd/d51/classstack-members.html new file mode 100644 index 000000000..49cd2aab0 --- /dev/null +++ b/dd/d51/classstack-members.html @@ -0,0 +1,122 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
stack< Type > Member List
+
+
+ +

This is the complete list of members for stack< Type >, including all inherited members.

+ + + + + + + + + + + + +
clear()stack< Type >inline
display()stack< Type >inline
isEmptyStack()stack< Type >inline
operator=(const stack< Type > &otherStack)stack< Type >inline
pop()stack< Type >inline
push(Type item)stack< Type >inline
size (defined in stack< Type >)stack< Type >private
stack()stack< Type >inline
stackTopstack< Type >private
top()stack< Type >inline
~stack()stack< Type >inline
+
+ + + + diff --git a/dd/d65/lu__decompose_8cpp.html b/dd/d65/lu__decompose_8cpp.html new file mode 100644 index 000000000..7fceee62a --- /dev/null +++ b/dd/d65/lu__decompose_8cpp.html @@ -0,0 +1,365 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/lu_decompose.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
lu_decompose.cpp File Reference
+
+
+ +

LU decomposition of a square matrix +More...

+
#include <ctime>
+#include <iomanip>
+#include <iostream>
+#include <vector>
+
+Include dependency graph for lu_decompose.cpp:
+
+
+
+
+
+ + + + + + + + +

+Functions

int lu_decomposition (const std::vector< std::vector< double >> &A, std::vector< std::vector< double >> *L, std::vector< std::vector< double >> *U)
 
template<typename T >
std::ostreamoperator<< (std::ostream &out, std::vector< std::vector< T >> const &v)
 
int main (int argc, char **argv)
 
+

Detailed Description

+

LU decomposition of a square matrix

+
Author
Krishna Vedala
+

Function Documentation

+ +

◆ lu_decomposition()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int lu_decomposition (const std::vector< std::vector< double >> & A,
std::vector< std::vector< double >> * L,
std::vector< std::vector< double >> * U 
)
+
+

Perform LU decomposition on matrix

Parameters
+ + + + +
[in]Amatrix to decompose
[out]Loutput L matrix
[out]Uoutput U matrix
+
+
+
Returns
0 if no errors
+
+negative if error occurred
+
24  {
+
25  int row, col, j;
+
26  int mat_size = A.size();
+
27 
+
28  if (mat_size != A[0].size()) {
+
29  // check matrix is a square matrix
+
30  std::cerr << "Not a square matrix!\n";
+
31  return -1;
+
32  }
+
33 
+
34  // regularize each row
+
35  for (row = 0; row < mat_size; row++) {
+
36  // Upper triangular matrix
+
37 #ifdef _OPENMP
+
38 #pragma omp for
+
39 #endif
+
40  for (col = row; col < mat_size; col++) {
+
41  // Summation of L[i,j] * U[j,k]
+
42  double lu_sum = 0.;
+
43  for (j = 0; j < row; j++) lu_sum += L[0][row][j] * U[0][j][col];
+
44 
+
45  // Evaluate U[i,k]
+
46  U[0][row][col] = A[row][col] - lu_sum;
+
47  }
+
48 
+
49  // Lower triangular matrix
+
50 #ifdef _OPENMP
+
51 #pragma omp for
+
52 #endif
+
53  for (col = row; col < mat_size; col++) {
+
54  if (row == col) {
+
55  L[0][row][col] = 1.;
+
56  continue;
+
57  }
+
58 
+
59  // Summation of L[i,j] * U[j,k]
+
60  double lu_sum = 0.;
+
61  for (j = 0; j < row; j++) lu_sum += L[0][col][j] * U[0][j][row];
+
62 
+
63  // Evaluate U[i,k]
+
64  L[0][col][row] = (A[col][row] - lu_sum) / U[0][row][row];
+
65  }
+
66  }
+
67 
+
68  return 0;
+
69 }
+
+
+
+ +

◆ main()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int main (int argc,
char ** argv 
)
+
+

Main function

+
91  {
+
92  int mat_size = 3; // default matrix size
+
93  const int range = 50;
+
94  const int range2 = range >> 1;
+
95 
+
96  if (argc == 2)
+
97  mat_size = atoi(argv[1]);
+
98 
+
99  std::srand(std::time(NULL)); // random number initializer
+
100 
+
101  /* Create a square matrix with random values */
+
102  std::vector<std::vector<double>> A(mat_size);
+
103  std::vector<std::vector<double>> L(mat_size); // output
+
104  std::vector<std::vector<double>> U(mat_size); // output
+
105  for (int i = 0; i < mat_size; i++) {
+
106  // calloc so that all valeus are '0' by default
+
107  A[i] = std::vector<double>(mat_size);
+
108  L[i] = std::vector<double>(mat_size);
+
109  U[i] = std::vector<double>(mat_size);
+
110  for (int j = 0; j < mat_size; j++)
+
111  /* create random values in the limits [-range2, range-1] */
+
112  A[i][j] = static_cast<double>(std::rand() % range - range2);
+
113  }
+
114 
+
115  std::clock_t start_t = std::clock();
+
116  lu_decomposition(A, &L, &U);
+
117  std::clock_t end_t = std::clock();
+
118  std::cout << "Time taken: "
+
119  << static_cast<double>(end_t - start_t) / CLOCKS_PER_SEC << "\n";
+
120 
+
121  std::cout << "A = \n" << A << "\n";
+
122  std::cout << "L = \n" << L << "\n";
+
123  std::cout << "U = \n" << U << "\n";
+
124 
+
125  return 0;
+
126 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ operator<<()

+ +
+
+
+template<typename T >
+ + + + + + + + + + + + + + + + + + +
std::ostream& operator<< (std::ostreamout,
std::vector< std::vector< T >> const & v 
)
+
+

operator to print a matrix

+
76  {
+
77  const int width = 10;
+
78  const char separator = ' ';
+
79 
+
80  for (size_t row = 0; row < v.size(); row++) {
+
81  for (size_t col = 0; col < v[row].size(); col++)
+
82  out << std::left << std::setw(width) << std::setfill(separator)
+
83  << v[row][col];
+
84  out << std::endl;
+
85  }
+
86 
+
87  return out;
+
88 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T srand(T... args)
+ +
STL class.
+
T size(T... args)
+
T setfill(T... args)
+
T clock(T... args)
+ +
T atoi(T... args)
+
T rand(T... args)
+
T endl(T... args)
+
T left(T... args)
+
T time(T... args)
+
T setw(T... args)
+
int lu_decomposition(const std::vector< std::vector< double >> &A, std::vector< std::vector< double >> *L, std::vector< std::vector< double >> *U)
Definition: lu_decompose.cpp:22
+ + + + diff --git a/dd/d65/lu__decompose_8cpp.js b/dd/d65/lu__decompose_8cpp.js new file mode 100644 index 000000000..83b237610 --- /dev/null +++ b/dd/d65/lu__decompose_8cpp.js @@ -0,0 +1,6 @@ +var lu__decompose_8cpp = +[ + [ "lu_decomposition", "dd/d65/lu__decompose_8cpp.html#af703fd0afe349e567d7a82350e03cace", null ], + [ "main", "dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "operator<<", "dd/d65/lu__decompose_8cpp.html#a98eb5807f21b783c341cab402ced6732", null ] +]; \ No newline at end of file diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map new file mode 100644 index 000000000..49ef4effa --- /dev/null +++ b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map @@ -0,0 +1,8 @@ + + + + + + + + diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 new file mode 100644 index 000000000..2b6697b29 --- /dev/null +++ b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 @@ -0,0 +1 @@ +6acf1104da2f83975f57075289c5c6d4 \ No newline at end of file diff --git a/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg new file mode 100644 index 000000000..e8e03477d --- /dev/null +++ b/dd/d65/lu__decompose_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -0,0 +1,97 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::clock + + + + + +Node1->Node2 + + + + + +Node3 + + +lu_decomposition + + + + + +Node1->Node3 + + + + + +Node4 + + +std::rand + + + + + +Node1->Node4 + + + + + +Node5 + + +std::srand + + + + + +Node1->Node5 + + + + + +Node6 + + +std::time + + + + + +Node1->Node6 + + + + + diff --git a/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map new file mode 100644 index 000000000..1209266bf --- /dev/null +++ b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 new file mode 100644 index 000000000..d8a0506e3 --- /dev/null +++ b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.md5 @@ -0,0 +1 @@ +5d572395cc614d4fe8d328f204366b12 \ No newline at end of file diff --git a/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg new file mode 100644 index 000000000..05f913712 --- /dev/null +++ b/dd/d65/lu__decompose_8cpp_a98eb5807f21b783c341cab402ced6732_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +operator<< + + + +Node1 + + +operator<< + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +std::left + + + + + +Node1->Node3 + + + + + +Node4 + + +std::setfill + + + + + +Node1->Node4 + + + + + +Node5 + + +std::setw + + + + + +Node1->Node5 + + + + + diff --git a/dd/d75/structqueue__coll__graph.map b/dd/d75/structqueue__coll__graph.map new file mode 100644 index 000000000..c157e0f51 --- /dev/null +++ b/dd/d75/structqueue__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/dd/d75/structqueue__coll__graph.md5 b/dd/d75/structqueue__coll__graph.md5 new file mode 100644 index 000000000..30c0758b8 --- /dev/null +++ b/dd/d75/structqueue__coll__graph.md5 @@ -0,0 +1 @@ +1bf827d546df1c288156db7012f4b791 \ No newline at end of file diff --git a/dd/d75/structqueue__coll__graph.svg b/dd/d75/structqueue__coll__graph.svg new file mode 100644 index 000000000..4516d62ca --- /dev/null +++ b/dd/d75/structqueue__coll__graph.svg @@ -0,0 +1,49 @@ + + + + + + +queue< Kind > + + + +Node1 + + +queue< Kind > + + + + + +Node2 + + +node< Kind > + + + + + +Node2->Node1 + + + t + + + +Node2->Node2 + + + prev +next +right +left +link + + + diff --git a/dd/d7a/classdouble__linked__list-members.html b/dd/d7a/classdouble__linked__list-members.html new file mode 100644 index 000000000..da8b017dd --- /dev/null +++ b/dd/d7a/classdouble__linked__list-members.html @@ -0,0 +1,117 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
double_linked_list Member List
+
+
+ +

This is the complete list of members for double_linked_list, including all inherited members.

+ + + + + + + +
double_linked_list() (defined in double_linked_list)double_linked_listinline
insert(int x) (defined in double_linked_list)double_linked_list
remove(int x) (defined in double_linked_list)double_linked_list
reverseShow() (defined in double_linked_list)double_linked_list
search(int x) (defined in double_linked_list)double_linked_list
show() (defined in double_linked_list)double_linked_list
+
+ + + + diff --git a/dd/d7f/classstack__linked_list__coll__graph.map b/dd/d7f/classstack__linked_list__coll__graph.map new file mode 100644 index 000000000..bb6e29b2e --- /dev/null +++ b/dd/d7f/classstack__linked_list__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/dd/d7f/classstack__linked_list__coll__graph.md5 b/dd/d7f/classstack__linked_list__coll__graph.md5 new file mode 100644 index 000000000..38a8f6905 --- /dev/null +++ b/dd/d7f/classstack__linked_list__coll__graph.md5 @@ -0,0 +1 @@ +8b35d1d619df1f0232b29335c0c85ccc \ No newline at end of file diff --git a/dd/d7f/classstack__linked_list__coll__graph.svg b/dd/d7f/classstack__linked_list__coll__graph.svg new file mode 100644 index 000000000..add546db3 --- /dev/null +++ b/dd/d7f/classstack__linked_list__coll__graph.svg @@ -0,0 +1,46 @@ + + + + + + +stack_linkedList + + + +Node1 + + +stack_linkedList + + + + + +Node2 + + +linkedlist + + + + + +Node2->Node1 + + + front +rear + + + +Node2->Node2 + + + next + + + diff --git a/dd/d82/large__number_8h__incl.map b/dd/d82/large__number_8h__incl.map new file mode 100644 index 000000000..a0ab6ef76 --- /dev/null +++ b/dd/d82/large__number_8h__incl.map @@ -0,0 +1,10 @@ + + + + + + + + + + diff --git a/dd/d82/large__number_8h__incl.md5 b/dd/d82/large__number_8h__incl.md5 new file mode 100644 index 000000000..c08b08e3e --- /dev/null +++ b/dd/d82/large__number_8h__incl.md5 @@ -0,0 +1 @@ +4c99f4059fe90907c6da5e1b7b904c77 \ No newline at end of file diff --git a/dd/d82/large__number_8h__incl.svg b/dd/d82/large__number_8h__incl.svg new file mode 100644 index 000000000..3bda990ef --- /dev/null +++ b/dd/d82/large__number_8h__incl.svg @@ -0,0 +1,127 @@ + + + + + + +math/large_number.h + + + +Node1 + + +math/large_number.h + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +cassert + + + + + +Node1->Node3 + + + + + +Node4 + + +cinttypes + + + + + +Node1->Node4 + + + + + +Node5 + + +cstring + + + + + +Node1->Node5 + + + + + +Node6 + + +iostream + + + + + +Node1->Node6 + + + + + +Node7 + + +type_traits + + + + + +Node1->Node7 + + + + + +Node8 + + +vector + + + + + +Node1->Node8 + + + + + diff --git a/dd/d86/shell__sort2_8cpp__incl.map b/dd/d86/shell__sort2_8cpp__incl.map new file mode 100644 index 000000000..82c2ec1cf --- /dev/null +++ b/dd/d86/shell__sort2_8cpp__incl.map @@ -0,0 +1,9 @@ + + + + + + + + + diff --git a/dd/d86/shell__sort2_8cpp__incl.md5 b/dd/d86/shell__sort2_8cpp__incl.md5 new file mode 100644 index 000000000..d5ff8c0fb --- /dev/null +++ b/dd/d86/shell__sort2_8cpp__incl.md5 @@ -0,0 +1 @@ +0cbb687b07e8b9802dfd83b28eb22377 \ No newline at end of file diff --git a/dd/d86/shell__sort2_8cpp__incl.svg b/dd/d86/shell__sort2_8cpp__incl.svg new file mode 100644 index 000000000..5a8bc05bc --- /dev/null +++ b/dd/d86/shell__sort2_8cpp__incl.svg @@ -0,0 +1,112 @@ + + + + + + +sorting/shell_sort2.cpp + + + +Node1 + + +sorting/shell_sort2.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +cstdlib + + + + + +Node1->Node3 + + + + + +Node4 + + +ctime + + + + + +Node1->Node4 + + + + + +Node5 + + +iostream + + + + + +Node1->Node5 + + + + + +Node6 + + +utility + + + + + +Node1->Node6 + + + + + +Node7 + + +vector + + + + + +Node1->Node7 + + + + + diff --git a/dd/d9b/classgraph.html b/dd/d9b/classgraph.html new file mode 100644 index 000000000..518ffcdc1 --- /dev/null +++ b/dd/d9b/classgraph.html @@ -0,0 +1,173 @@ + + + + + + + +Algorithms_in_C++: graph Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for graph:
+
+
+
+
[legend]
+ + + + + + + + + + + + + + + + +

+Public Member Functions

graph (int v)
 
+void addedge (int src, int dest)
 
+void printgraph ()
 
+void bfs (int s)
 
graph (int n)
 
+void addEdge (int, int)
 
+int getConnectedComponents ()
 
+ + + + + +

+Private Member Functions

+void depth_first_search ()
 
+void explore (int, vector< bool > &)
 
+ + + + + + + + + +

+Private Attributes

+int v
 
+list< int > * adj
 
+vector< vector< int > > adj
 
+int connected_components
 
+
The documentation for this class was generated from the following files:
    +
  • graph/bfs.cpp
  • +
  • graph/connected_components.cpp
  • +
+
+
+ + + + diff --git a/dd/d9b/classgraph.js b/dd/d9b/classgraph.js new file mode 100644 index 000000000..7c1a2899e --- /dev/null +++ b/dd/d9b/classgraph.js @@ -0,0 +1,16 @@ +var classgraph = +[ + [ "graph", "dd/d9b/classgraph.html#a01de7229e455294187882cf48c5865f1", null ], + [ "graph", "dd/d9b/classgraph.html#a6da44f9820d3b7bae2f0f74bc149c27e", null ], + [ "addedge", "dd/d9b/classgraph.html#a0d1f72b044a0ff541da4672481625fe5", null ], + [ "addEdge", "dd/d9b/classgraph.html#a35c12fba596d8bb48b1877b128c4ba6d", null ], + [ "bfs", "dd/d9b/classgraph.html#a907cab58d8b38ab3798ad4d043670914", null ], + [ "depth_first_search", "dd/d9b/classgraph.html#a135921a59082b669678b029b301b8a1c", null ], + [ "explore", "dd/d9b/classgraph.html#a6398e513b9574e029fbee07c6ac6e028", null ], + [ "getConnectedComponents", "dd/d9b/classgraph.html#af9b34bbae0f618e2128c501b69339bb0", null ], + [ "printgraph", "dd/d9b/classgraph.html#a12c78a42f38c3b46637cf0da488824e9", null ], + [ "adj", "dd/d9b/classgraph.html#abf45919942312aee0679dcd56e8aae9a", null ], + [ "adj", "dd/d9b/classgraph.html#a45045da3d080cb81472ce6d5cc02b911", null ], + [ "connected_components", "dd/d9b/classgraph.html#a822dcbe7978a9fa026f2b37f1a52f5e9", null ], + [ "v", "dd/d9b/classgraph.html#af77d6c400ef60f882b8beca48db8017d", null ] +]; \ No newline at end of file diff --git a/dd/da0/todo.html b/dd/da0/todo.html new file mode 100644 index 000000000..a24e73b9b --- /dev/null +++ b/dd/da0/todo.html @@ -0,0 +1,131 @@ + + + + + + + +Algorithms_in_C++: Todo List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Todo List
+
+
+
+
File avltree.cpp
+
update code to use C++ STL library features and OO structure
+
File binary_search_tree.cpp
+
update code to use C++ STL library features and OO structure
+
Member k
+
@stepfencurryxiao add documetnation
+
Member a
+
@stepfencurryxiao add documetnation
+
File paranthesis_matching.cpp
+
implement as a C++ class
+
Member test3 ()
+
This test fails
+
File hash_search.cpp
+
fix the program for memory leaks and better structure in C++ and not C fashion
+
Member create_list (int key)
+
fix memory leak
+
Member comp (X x, std::vector< int > *s1, std::vector< int > *s2, std::vector< int > *s3)
+
add documentation
+
Member get_input ()
+
@christianbender Get input from STDIO or write input to memory as done above.
+
+
+
+
+ + + + diff --git a/dd/da8/struct_segment_intersection-members.html b/dd/da8/struct_segment_intersection-members.html new file mode 100644 index 000000000..b3d2c3451 --- /dev/null +++ b/dd/da8/struct_segment_intersection-members.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
SegmentIntersection Member List
+
+
+ +

This is the complete list of members for SegmentIntersection, including all inherited members.

+ + + + +
direction(Point first_point, Point second_point, Point third_point)SegmentIntersectioninline
intersect(Point first_point, Point second_point, Point third_point, Point forth_point) (defined in SegmentIntersection)SegmentIntersectioninline
on_segment(Point first_point, Point second_point, Point third_point)SegmentIntersectioninline
+
+ + + + diff --git a/dd/df3/line__segment__intersection_8cpp__incl.map b/dd/df3/line__segment__intersection_8cpp__incl.map new file mode 100644 index 000000000..fb4e4985f --- /dev/null +++ b/dd/df3/line__segment__intersection_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dd/df3/line__segment__intersection_8cpp__incl.md5 b/dd/df3/line__segment__intersection_8cpp__incl.md5 new file mode 100644 index 000000000..a6b32c340 --- /dev/null +++ b/dd/df3/line__segment__intersection_8cpp__incl.md5 @@ -0,0 +1 @@ +f9a2b4778dfb0f860bce23d9c2ae7421 \ No newline at end of file diff --git a/dd/df3/line__segment__intersection_8cpp__incl.svg b/dd/df3/line__segment__intersection_8cpp__incl.svg new file mode 100644 index 000000000..c2ea5e193 --- /dev/null +++ b/dd/df3/line__segment__intersection_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +geometry/line_segment_intersection.cpp + + + +Node1 + + +geometry/line_segment +_intersection.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/dd/df4/structlca.html b/dd/df4/structlca.html new file mode 100644 index 000000000..88dd08c42 --- /dev/null +++ b/dd/df4/structlca.html @@ -0,0 +1,156 @@ + + + + + + + +Algorithms_in_C++: lca Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for lca:
+
+
+
+
[legend]
+ + + + + + + + + + + + +

+Public Member Functions

lca (int n_)
 
+void verify ()
 
+void build ()
 
+void dfs (int node, int par)
 
+int query (int u, int v)
 
+ + + + + + + + + +

+Public Attributes

+int n
 
+vector< int > adj [N]
 
+int up [LG][N]
 
+int level [N]
 
+
The documentation for this struct was generated from the following file:
    +
  • graph/lca.cpp
  • +
+
+
+ + + + diff --git a/dd/df4/structlca.js b/dd/df4/structlca.js new file mode 100644 index 000000000..f08b66df0 --- /dev/null +++ b/dd/df4/structlca.js @@ -0,0 +1,12 @@ +var structlca = +[ + [ "lca", "dd/df4/structlca.html#af1749a2effd0d3818ad6a788cdaa7428", null ], + [ "build", "dd/df4/structlca.html#ab8e51315d17f1dea5f868789c7728991", null ], + [ "dfs", "dd/df4/structlca.html#a32c8be06ce7ed44b643354f0c0ae47a6", null ], + [ "query", "dd/df4/structlca.html#a7570bbb77f84fbc1b53927b0c9696511", null ], + [ "verify", "dd/df4/structlca.html#ae4feede657d048b9ffa9e375d1c1f2f8", null ], + [ "adj", "dd/df4/structlca.html#a14b42cdfa4ea593bc0d0571c513c0e23", null ], + [ "level", "dd/df4/structlca.html#a2a794275904ce312065fea07e362aaef", null ], + [ "n", "dd/df4/structlca.html#a1db0a3861d8cb6b3da785646654adb1c", null ], + [ "up", "dd/df4/structlca.html#ae53b8b2b47baa0097c6e3186279b154b", null ] +]; \ No newline at end of file diff --git a/dd/df5/poisson__dist_8cpp__incl.map b/dd/df5/poisson__dist_8cpp__incl.map new file mode 100644 index 000000000..7c05a38a3 --- /dev/null +++ b/dd/df5/poisson__dist_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/dd/df5/poisson__dist_8cpp__incl.md5 b/dd/df5/poisson__dist_8cpp__incl.md5 new file mode 100644 index 000000000..cd096c7b8 --- /dev/null +++ b/dd/df5/poisson__dist_8cpp__incl.md5 @@ -0,0 +1 @@ +697116b0b93ccca5b82c3a4e65bbae25 \ No newline at end of file diff --git a/dd/df5/poisson__dist_8cpp__incl.svg b/dd/df5/poisson__dist_8cpp__incl.svg new file mode 100644 index 000000000..161231223 --- /dev/null +++ b/dd/df5/poisson__dist_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +probability/poisson_dist.cpp + + + +Node1 + + +probability/poisson +_dist.cpp + + + + + +Node2 + + +cmath + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/de/d36/binary__exponent_8cpp__incl.map b/de/d36/binary__exponent_8cpp__incl.map new file mode 100644 index 000000000..96dd88f9d --- /dev/null +++ b/de/d36/binary__exponent_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/de/d36/binary__exponent_8cpp__incl.md5 b/de/d36/binary__exponent_8cpp__incl.md5 new file mode 100644 index 000000000..265b0716d --- /dev/null +++ b/de/d36/binary__exponent_8cpp__incl.md5 @@ -0,0 +1 @@ +002ac0bc1547bbb735ceb81b0e22c026 \ No newline at end of file diff --git a/de/d36/binary__exponent_8cpp__incl.svg b/de/d36/binary__exponent_8cpp__incl.svg new file mode 100644 index 000000000..789cd1758 --- /dev/null +++ b/de/d36/binary__exponent_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +math/binary_exponent.cpp + + + +Node1 + + +math/binary_exponent.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/de/d47/string__fibonacci_8cpp.html b/de/d47/string__fibonacci_8cpp.html new file mode 100644 index 000000000..6b9f34cbe --- /dev/null +++ b/de/d47/string__fibonacci_8cpp.html @@ -0,0 +1,295 @@ + + + + + + + +Algorithms_in_C++: math/string_fibonacci.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
string_fibonacci.cpp File Reference
+
+
+ +

This Programme returns the Nth fibonacci as a string. +More...

+
#include <iostream>
+#include <cstring>
+
+Include dependency graph for string_fibonacci.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

std::string add (std::string a, std::string b)
 
void fib_Accurate (uint64_t n)
 
int main ()
 
+

Detailed Description

+

This Programme returns the Nth fibonacci as a string.

+

The method used is manual addition with carry and placing it in a string which is called string addition This makes it have no bounds or limits

+
See also
fibonacci_large.cpp, fibonacci_fast.cpp, fibonacci.cpp
+

Function Documentation

+ +

◆ add()

+ +
+
+ + + + + + + + + + + + + + + + + + +
std::string add (std::string a,
std::string b 
)
+
+

function to add two string numbers

Parameters
+ + + +
[in]afirst number in string to add
[in]bsecond number in string to add
+
+
+
Returns
sum as a std::string
+
24  {
+
25  std::string temp = "";
+
26 
+
27  // carry flag
+
28  int carry = 0;
+
29 
+
30  // fills up with zeros
+
31  while (a.length() < b.length()) {
+
32  a = "0" + a;
+
33  }
+
34 
+
35  // fills up with zeros
+
36  while (b.length() < a.length()) {
+
37  b = "0" + b;
+
38  }
+
39 
+
40  // adds the numbers a and b
+
41  for (int i = a.length() - 1; i >= 0; i--) {
+
42  char val = static_cast<char>(((a[i] - 48) + (b[i] - 48)) + 48 + carry);
+
43  if (val > 57) {
+
44  carry = 1;
+
45  val -= 10;
+
46  } else {
+
47  carry = 0;
+
48  }
+
49  temp = val + temp;
+
50  }
+
51 
+
52  // processes the carry flag
+
53  if (carry == 1) {
+
54  temp = "1" + temp;
+
55  }
+
56 
+
57  // removes leading zeros.
+
58  while (temp[0] == '0' && temp.length() > 1) {
+
59  temp = temp.substr(1);
+
60  }
+
61 
+
62  return temp;
+
63 }
+
+
+
+ +

◆ fib_Accurate()

+ +
+
+ + + + + + + + +
void fib_Accurate (uint64_t n)
+
+

Fibonacci iterator

Parameters
+ + +
[in]nn^th Fibonacci number
+
+
+
68  {
+
69  std::string tmp = "";
+
70  std::string fibMinus1 = "1";
+
71  std::string fibMinus2 = "0";
+
72  for (uint64_t i = 0; i < n; i++) {
+
73  tmp = add(fibMinus1, fibMinus2);
+
74  fibMinus2 = fibMinus1;
+
75  fibMinus1 = tmp;
+
76  }
+
77  std::cout << fibMinus2;
+
78 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

main function

+
81  {
+
82  int n;
+
83  std::cout << "Enter whatever number N you want to find the fibonacci of\n";
+
84  std::cin >> n;
+
85  std::cout << n << " th Fibonacci is \n";
+
86  fib_Accurate(n);
+
87 
+
88  return 0;
+
89 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
STL class.
+
T length(T... args)
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T substr(T... args)
+
std::string add(std::string a, std::string b)
Definition: string_fibonacci.cpp:24
+
void fib_Accurate(uint64_t n)
Definition: string_fibonacci.cpp:68
+ + + + + diff --git a/de/d47/string__fibonacci_8cpp.js b/de/d47/string__fibonacci_8cpp.js new file mode 100644 index 000000000..31edff092 --- /dev/null +++ b/de/d47/string__fibonacci_8cpp.js @@ -0,0 +1,6 @@ +var string__fibonacci_8cpp = +[ + [ "add", "de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35", null ], + [ "fib_Accurate", "de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca", null ], + [ "main", "de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map new file mode 100644 index 000000000..02b344cc9 --- /dev/null +++ b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 new file mode 100644 index 000000000..a82748172 --- /dev/null +++ b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.md5 @@ -0,0 +1 @@ +eb015093a376f4430734c10122881316 \ No newline at end of file diff --git a/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg new file mode 100644 index 000000000..3c845654e --- /dev/null +++ b/de/d47/string__fibonacci_8cpp_ad8055ee368a5d5b24de01bdde6bf8fca_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +fib_Accurate + + + +Node1 + + +fib_Accurate + + + + + +Node2 + + +add + + + + + +Node1->Node2 + + + + + diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..4fba517a3 --- /dev/null +++ b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..1c57898db --- /dev/null +++ b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +7d416f84c9f950a685ee14d9fe01088e \ No newline at end of file diff --git a/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..cf4f1fe51 --- /dev/null +++ b/de/d47/string__fibonacci_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +fib_Accurate + + + + + +Node1->Node2 + + + + + +Node3 + + +add + + + + + +Node2->Node3 + + + + + diff --git a/de/d48/struct_trie_1_1_trie_node.html b/de/d48/struct_trie_1_1_trie_node.html new file mode 100644 index 000000000..672d07495 --- /dev/null +++ b/de/d48/struct_trie_1_1_trie_node.html @@ -0,0 +1,133 @@ + + + + + + + +Algorithms_in_C++: Trie::TrieNode Struct Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
Trie::TrieNode Struct Reference
+
+
+
+Collaboration diagram for Trie::TrieNode:
+
+
+
+
[legend]
+ + + + + + +

+Public Attributes

+std::shared_ptr< TrieNodecharacter [ALPHABETS] {nullptr}
 
+bool isEndOfWord {false}
 
+

Detailed Description

+

Structure of trie node. This struct doesn't need a constructor as we are initializing using intializer list which is more efficient than if we had done so with constructor.

+

The documentation for this struct was generated from the following file: +
+
+ + + + diff --git a/de/d48/struct_trie_1_1_trie_node.js b/de/d48/struct_trie_1_1_trie_node.js new file mode 100644 index 000000000..fc7e87f8f --- /dev/null +++ b/de/d48/struct_trie_1_1_trie_node.js @@ -0,0 +1,5 @@ +var struct_trie_1_1_trie_node = +[ + [ "character", "de/d48/struct_trie_1_1_trie_node.html#ae13ae4b74d997d3e83d7bb51b204d99e", null ], + [ "isEndOfWord", "de/d48/struct_trie_1_1_trie_node.html#a73bba435c8e304cc97fd3dc40c95d52f", null ] +]; \ No newline at end of file diff --git a/de/d5b/eulers__totient__function_8cpp__incl.map b/de/d5b/eulers__totient__function_8cpp__incl.map new file mode 100644 index 000000000..bf4e9d9d2 --- /dev/null +++ b/de/d5b/eulers__totient__function_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/de/d5b/eulers__totient__function_8cpp__incl.md5 b/de/d5b/eulers__totient__function_8cpp__incl.md5 new file mode 100644 index 000000000..208a85ccf --- /dev/null +++ b/de/d5b/eulers__totient__function_8cpp__incl.md5 @@ -0,0 +1 @@ +8a9a85f66dd59a18bd52880d6677089e \ No newline at end of file diff --git a/de/d5b/eulers__totient__function_8cpp__incl.svg b/de/d5b/eulers__totient__function_8cpp__incl.svg new file mode 100644 index 000000000..414a3825e --- /dev/null +++ b/de/d5b/eulers__totient__function_8cpp__incl.svg @@ -0,0 +1,53 @@ + + + + + + +math/eulers_totient_function.cpp + + + +Node1 + + +math/eulers_totient +_function.cpp + + + + + +Node2 + + +cstdlib + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/de/d69/knuth__morris__pratt_8cpp__incl.map b/de/d69/knuth__morris__pratt_8cpp__incl.map new file mode 100644 index 000000000..ac98e98da --- /dev/null +++ b/de/d69/knuth__morris__pratt_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/de/d69/knuth__morris__pratt_8cpp__incl.md5 b/de/d69/knuth__morris__pratt_8cpp__incl.md5 new file mode 100644 index 000000000..b91bff7b5 --- /dev/null +++ b/de/d69/knuth__morris__pratt_8cpp__incl.md5 @@ -0,0 +1 @@ +af5ff9c29093781018fea3d9c9e792f5 \ No newline at end of file diff --git a/de/d69/knuth__morris__pratt_8cpp__incl.svg b/de/d69/knuth__morris__pratt_8cpp__incl.svg new file mode 100644 index 000000000..1dc5dfb31 --- /dev/null +++ b/de/d69/knuth__morris__pratt_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +strings/knuth_morris_pratt.cpp + + + +Node1 + + +strings/knuth_morris +_pratt.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + +Node3 + + +cstring + + + + + +Node1->Node3 + + + + + +Node4 + + +vector + + + + + +Node1->Node4 + + + + + diff --git a/de/d6a/knuth__morris__pratt_8cpp.html b/de/d6a/knuth__morris__pratt_8cpp.html new file mode 100644 index 000000000..e4d80bc33 --- /dev/null +++ b/de/d6a/knuth__morris__pratt_8cpp.html @@ -0,0 +1,195 @@ + + + + + + + +Algorithms_in_C++: strings/knuth_morris_pratt.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
knuth_morris_pratt.cpp File Reference
+
+
+ +

The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m) +More...

+
#include <iostream>
+#include <cstring>
+#include <vector>
+
+Include dependency graph for knuth_morris_pratt.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 
+ + + + + + + +

+Functions

std::vector< int > string_search::getFailureArray (const std::string &pattern)
 
bool string_search::kmp (const std::string &pattern, const std::string &text)
 
int main ()
 
+

Detailed Description

+

The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m)

+
    +
  1. Preprocess pattern to identify any suffixes that are identical to prefixes. This tells us where to continue from if we get a mismatch between a character in our pattern and the text.
  2. +
  3. Step through the text one character at a time and compare it to a character in the pattern updating our location within the pattern if necessary
  4. +
+

Function Documentation

+ +

◆ main()

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

Main function

+
76  {
+
77  std::string text = "alskfjaldsabc1abc1abc12k23adsfabcabc";
+
78  std::string pattern = "abc1abc12l";
+
79 
+
80  if (kmp(pattern, text) == true) {
+
81  std::cout << "Found" << std::endl;
+
82  } else {
+
83  std::cout << "Not Found" << std::endl;
+
84  }
+
85 
+
86  text = "abcabc";
+
87  pattern = "bca";
+
88  if (kmp(pattern, text) == true) {
+
89  std::cout << "Found" << std::endl;
+
90  } else {
+
91  std::cout << "Not Found" << std::endl;
+
92  }
+
93 
+
94  return 0;
+
95 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
STL class.
+ +
bool kmp(const std::string &pattern, const std::string &text)
Definition: knuth_morris_pratt.cpp:56
+
T endl(T... args)
+ + + + diff --git a/de/d6a/knuth__morris__pratt_8cpp.js b/de/d6a/knuth__morris__pratt_8cpp.js new file mode 100644 index 000000000..39364b9ad --- /dev/null +++ b/de/d6a/knuth__morris__pratt_8cpp.js @@ -0,0 +1,6 @@ +var knuth__morris__pratt_8cpp = +[ + [ "getFailureArray", "de/d6a/knuth__morris__pratt_8cpp.html#aa422aab133d4ed5e5d6022a7f701271f", null ], + [ "kmp", "de/d6a/knuth__morris__pratt_8cpp.html#a26a58225ce7d3fa9d4c2f5349a65ed93", null ], + [ "main", "de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..b43430adb --- /dev/null +++ b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..3bf0483d4 --- /dev/null +++ b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +a62a4e1e546f55c30dfad1fe65cff63e \ No newline at end of file diff --git a/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..7b4fe21ac --- /dev/null +++ b/de/d6a/knuth__morris__pratt_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,89 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +string_search::kmp + + + + + +Node1->Node3 + + + + + +Node4 + + +string_search::getFailure +Array + + + + + +Node3->Node4 + + + + + +Node5 + + +std::string::size + + + + + +Node3->Node5 + + + + + +Node4->Node5 + + + + + diff --git a/de/d6c/palindrome__of__number_8cpp__incl.map b/de/d6c/palindrome__of__number_8cpp__incl.map new file mode 100644 index 000000000..d7b2dea5c --- /dev/null +++ b/de/d6c/palindrome__of__number_8cpp__incl.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/de/d6c/palindrome__of__number_8cpp__incl.md5 b/de/d6c/palindrome__of__number_8cpp__incl.md5 new file mode 100644 index 000000000..c093429f6 --- /dev/null +++ b/de/d6c/palindrome__of__number_8cpp__incl.md5 @@ -0,0 +1 @@ +10c4fbb5cba7eb12506f965c4a309c79 \ No newline at end of file diff --git a/de/d6c/palindrome__of__number_8cpp__incl.svg b/de/d6c/palindrome__of__number_8cpp__incl.svg new file mode 100644 index 000000000..164167458 --- /dev/null +++ b/de/d6c/palindrome__of__number_8cpp__incl.svg @@ -0,0 +1,68 @@ + + + + + + +others/palindrome_of_number.cpp + + + +Node1 + + +others/palindrome_of +_number.cpp + + + + + +Node2 + + +algorithm + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + +Node4 + + +cstring + + + + + +Node1->Node4 + + + + + diff --git a/de/d75/qr__eigen__values_8cpp.html b/de/d75/qr__eigen__values_8cpp.html new file mode 100644 index 000000000..98b1281a7 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp.html @@ -0,0 +1,485 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/qr_eigen_values.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
qr_eigen_values.cpp File Reference
+
+
+ +

Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method. +More...

+
#include <cassert>
+#include <cmath>
+#include <cstdlib>
+#include <ctime>
+#include <iostream>
+#include "./qr_decompose.h"
+
+Include dependency graph for qr_eigen_values.cpp:
+
+
+
+
+
+ + + + +

+Namespaces

 qr_algorithm
 Functions to compute QR decomposition of any rectangular matrix.
 
+ + + +

+Macros

#define LIMS   9
 
+ + + + + + + + + + + + + +

+Functions

void create_matrix (std::valarray< std::valarray< double >> *A)
 
void mat_mul (const std::valarray< std::valarray< double >> &A, const std::valarray< std::valarray< double >> &B, std::valarray< std::valarray< double >> *OUT)
 
std::valarray< double > qr_algorithm::eigen_values (std::valarray< std::valarray< double >> *A, bool print_intermediates=false)
 
void test1 ()
 
void test2 ()
 
int main (int argc, char **argv)
 
+

Detailed Description

+

Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.

+
Author
Krishna Vedala
+

Macro Definition Documentation

+ +

◆ LIMS

+ +
+
+ + + + +
#define LIMS   9
+
+

limit of range of matrix values

+ +
+
+

Function Documentation

+ +

◆ create_matrix()

+ +
+
+ + + + + + + + +
void create_matrix (std::valarray< std::valarray< double >> * A)
+
+

create a symmetric square matrix of given size with random elements. A symmetric square matrix will always have real eigen values.

+
Parameters
+ + +
[out]Amatrix to create (must be pre-allocated in memory)
+
+
+
28  {
+
29  int i, j, tmp, lim2 = LIMS >> 1;
+
30  int N = A->size();
+
31 
+
32 #ifdef _OPENMP
+
33 #pragma omp for
+
34 #endif
+
35  for (i = 0; i < N; i++) {
+
36  A[0][i][i] = (std::rand() % LIMS) - lim2;
+
37  for (j = i + 1; j < N; j++) {
+
38  tmp = (std::rand() % LIMS) - lim2;
+
39  A[0][i][j] = tmp; // summetrically distribute random values
+
40  A[0][j][i] = tmp;
+
41  }
+
42  }
+
43 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int main (int argc,
char ** argv 
)
+
+

main function

+
243  {
+
244  int mat_size = 5;
+
245  if (argc == 2) {
+
246  mat_size = atoi(argv[1]);
+
247  } else { // if invalid input argument is given run tests
+
248  test1();
+
249  test2();
+
250  std::cout << "Usage: ./qr_eigen_values [mat_size]\n";
+
251  return 0;
+
252  }
+
253 
+
254  if (mat_size < 2) {
+
255  fprintf(stderr, "Matrix size should be > 2\n");
+
256  return -1;
+
257  }
+
258 
+
259  // initialize random number generator
+
260  std::srand(std::time(nullptr));
+
261 
+
262  int i, rows = mat_size, columns = mat_size;
+
263 
+ +
265 
+
266  for (int i = 0; i < rows; i++) {
+
267  A[i] = std::valarray<double>(columns);
+
268  }
+
269 
+
270  /* create a random matrix */
+
271  create_matrix(&A);
+
272 
+
273  std::cout << A << "\n";
+
274 
+
275  clock_t t1 = clock();
+ +
277  double dtime = static_cast<double>(clock() - t1) / CLOCKS_PER_SEC;
+
278 
+
279  std::cout << "Eigen vals: ";
+
280  for (i = 0; i < mat_size; i++) std::cout << eigen_vals[i] << "\t";
+
281  std::cout << "\nTime taken to compute: " << dtime << " sec\n";
+
282 
+
283  return 0;
+
284 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ mat_mul()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
void mat_mul (const std::valarray< std::valarray< double >> & A,
const std::valarray< std::valarray< double >> & B,
std::valarray< std::valarray< double >> * OUT 
)
+
+

Perform multiplication of two matrices.

    +
  • R2 must be equal to C1
  • +
  • Resultant matrix size should be R1xC2
    Parameters
    + + + + +
    [in]Afirst matrix to multiply
    [in]Bsecond matrix to multiply
    [out]OUToutput matrix (must be pre-allocated)
    +
    +
    +
    Returns
    pointer to resultant matrix
    +
  • +
+
56  {
+
57  int R1 = A.size();
+
58  int C1 = A[0].size();
+
59  int R2 = B.size();
+
60  int C2 = B[0].size();
+
61  if (C1 != R2) {
+
62  perror("Matrix dimensions mismatch!");
+
63  return;
+
64  }
+
65 
+
66  for (int i = 0; i < R1; i++) {
+
67  for (int j = 0; j < C2; j++) {
+
68  OUT[0][i][j] = 0.f;
+
69  for (int k = 0; k < C1; k++) {
+
70  OUT[0][i][j] += A[i][k] * B[k][j];
+
71  }
+
72  }
+
73  }
+
74 }
+
+
+
+ +

◆ test1()

+ +
+
+ + + + + + + +
void test1 ()
+
+

test function to compute eigen values of a 2x2 matrix

+\[\begin{bmatrix} 5 & 7\\ 7 & 11 \end{bmatrix}\] +

+

which are approximately, {15.56158, 0.384227}

+
177  {
+
178  std::valarray<std::valarray<double>> X = {{5, 7}, {7, 11}};
+
179  double y[] = {15.56158, 0.384227}; // corresponding y-values
+
180 
+
181  std::cout << "------- Test 1 -------" << std::endl;
+ +
183 
+
184  for (int i = 0; i < 2; i++) {
+
185  std::cout << i + 1 << "/2 Checking for " << y[i] << " --> ";
+
186  bool result = false;
+
187  for (int j = 0; j < 2 && !result; j++) {
+
188  if (std::abs(y[i] - eig_vals[j]) < 0.1) {
+
189  result = true;
+
190  std::cout << "(" << eig_vals[j] << ") ";
+
191  }
+
192  }
+
193  assert(result); // ensure that i^th expected eigen value was computed
+
194  std::cout << "found\n";
+
195  }
+
196  std::cout << "Test 1 Passed\n\n";
+
197 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ test2()

+ +
+
+ + + + + + + +
void test2 ()
+
+

test function to compute eigen values of a 2x2 matrix

+\[\begin{bmatrix} -4& 4& 2& 0& -3\\ 4& -4& 4& -3& -1\\ 2& 4& 4& 3& -3\\ 0& -3& 3& -1&-1\\ -3& -1& -3& -3& 0 \end{bmatrix}\] +

+

which are approximately, {9.27648, -9.26948, 2.0181, -1.03516, -5.98994}

+
210  {
+
211  std::valarray<std::valarray<double>> X = {{-4, 4, 2, 0, -3},
+
212  {4, -4, 4, -3, -1},
+
213  {2, 4, 4, 3, -3},
+
214  {0, -3, 3, -1, -3},
+
215  {-3, -1, -3, -3, 0}};
+
216  double y[] = {9.27648, -9.26948, 2.0181, -1.03516,
+
217  -5.98994}; // corresponding y-values
+
218 
+
219  std::cout << "------- Test 2 -------" << std::endl;
+ +
221 
+
222  std::cout << X << "\n"
+
223  << "Eigen values: " << eig_vals << "\n";
+
224 
+
225  for (int i = 0; i < 5; i++) {
+
226  std::cout << i + 1 << "/5 Checking for " << y[i] << " --> ";
+
227  bool result = false;
+
228  for (int j = 0; j < 5 && !result; j++) {
+
229  if (std::abs(y[i] - eig_vals[j]) < 0.1) {
+
230  result = true;
+
231  std::cout << "(" << eig_vals[j] << ") ";
+
232  }
+
233  }
+
234  assert(result); // ensure that i^th expected eigen value was computed
+
235  std::cout << "found\n";
+
236  }
+
237  std::cout << "Test 2 Passed\n\n";
+
238 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T srand(T... args)
+
void create_matrix(std::valarray< std::valarray< double >> *A)
Definition: qr_eigen_values.cpp:28
+
std::valarray< double > eigen_values(std::valarray< std::valarray< double >> *A, bool print_intermediates=false)
Definition: qr_eigen_values.cpp:98
+
T clock(T... args)
+
T fprintf(T... args)
+ +
ll k
Definition: matrix_exponentiation.cpp:48
+
T atoi(T... args)
+
T perror(T... args)
+
STL class.
+
void test2()
Definition: qr_eigen_values.cpp:210
+
T rand(T... args)
+
void test1()
Definition: qr_eigen_values.cpp:177
+
T endl(T... args)
+
T time(T... args)
+
#define LIMS
Definition: qr_eigen_values.cpp:20
+ + + + diff --git a/de/d75/qr__eigen__values_8cpp.js b/de/d75/qr__eigen__values_8cpp.js new file mode 100644 index 000000000..efcc5d814 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp.js @@ -0,0 +1,10 @@ +var qr__eigen__values_8cpp = +[ + [ "LIMS", "de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40", null ], + [ "create_matrix", "de/d75/qr__eigen__values_8cpp.html#a33cb0a68c36aa26fd599c7c66da86ed7", null ], + [ "eigen_values", "de/d75/qr__eigen__values_8cpp.html#a763896dbb4a7e95c4a1e614ac0819d66", null ], + [ "main", "de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627", null ], + [ "mat_mul", "de/d75/qr__eigen__values_8cpp.html#a7558fd7779bf207157ced66f275951a0", null ], + [ "test1", "de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0", null ], + [ "test2", "de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0", null ] +]; \ No newline at end of file diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map new file mode 100644 index 000000000..41b321051 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 new file mode 100644 index 000000000..381038945 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 @@ -0,0 +1 @@ +7f6559a9bad74fb1bcc1eea038eaee5a \ No newline at end of file diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg new file mode 100644 index 000000000..7165a441b --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -0,0 +1,231 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +qr_algorithm::eigen +_values + + + + + +Node1->Node2 + + + + + +Node9 + + +std::endl + + + + + +Node1->Node9 + + + + + +Node3 + + +mat_mul + + + + + +Node2->Node3 + + + + + +Node4 + + +qr_algorithm::qr_decompose + + + + + +Node2->Node4 + + + + + +Node5 + + +qr_algorithm::vector_mag + + + + + +Node4->Node5 + + + + + +Node8 + + +qr_algorithm::vector_proj + + + + + +Node4->Node8 + + + + + +Node6 + + +std::sqrt + + + + + +Node5->Node6 + + + + + +Node7 + + +qr_algorithm::vector_dot + + + + + +Node5->Node7 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg new file mode 100644 index 000000000..0ccfc0fee --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -0,0 +1,143 @@ + + + + + + +test2 + + + +Node1 + + +test2 + + + + + +Node2 + + +qr_algorithm::eigen +_values + + + + + +Node1->Node2 + + + + + +Node9 + + +std::endl + + + + + +Node1->Node9 + + + + + +Node3 + + +mat_mul + + + + + +Node2->Node3 + + + + + +Node4 + + +qr_algorithm::qr_decompose + + + + + +Node2->Node4 + + + + + +Node5 + + +qr_algorithm::vector_mag + + + + + +Node4->Node5 + + + + + +Node8 + + +qr_algorithm::vector_proj + + + + + +Node4->Node8 + + + + + +Node6 + + +std::sqrt + + + + + +Node5->Node6 + + + + + +Node7 + + +qr_algorithm::vector_dot + + + + + +Node5->Node7 + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map new file mode 100644 index 000000000..cf632f4df --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map @@ -0,0 +1,11 @@ + + + + + + + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 new file mode 100644 index 000000000..7db3f7baa --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 @@ -0,0 +1 @@ +68524f9a1914d782e59fe01311c7bd91 \ No newline at end of file diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg new file mode 100644 index 000000000..410cc22a7 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -0,0 +1,231 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +qr_algorithm::eigen +_values + + + + + +Node1->Node2 + + + + + +Node9 + + +std::endl + + + + + +Node1->Node9 + + + + + +Node3 + + +mat_mul + + + + + +Node2->Node3 + + + + + +Node4 + + +qr_algorithm::qr_decompose + + + + + +Node2->Node4 + + + + + +Node5 + + +qr_algorithm::vector_mag + + + + + +Node4->Node5 + + + + + +Node8 + + +qr_algorithm::vector_proj + + + + + +Node4->Node8 + + + + + +Node6 + + +std::sqrt + + + + + +Node5->Node6 + + + + + +Node7 + + +qr_algorithm::vector_dot + + + + + +Node5->Node7 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg new file mode 100644 index 000000000..5b2e400ee --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -0,0 +1,143 @@ + + + + + + +test1 + + + +Node1 + + +test1 + + + + + +Node2 + + +qr_algorithm::eigen +_values + + + + + +Node1->Node2 + + + + + +Node9 + + +std::endl + + + + + +Node1->Node9 + + + + + +Node3 + + +mat_mul + + + + + +Node2->Node3 + + + + + +Node4 + + +qr_algorithm::qr_decompose + + + + + +Node2->Node4 + + + + + +Node5 + + +qr_algorithm::vector_mag + + + + + +Node4->Node5 + + + + + +Node8 + + +qr_algorithm::vector_proj + + + + + +Node4->Node8 + + + + + +Node6 + + +std::sqrt + + + + + +Node5->Node6 + + + + + +Node7 + + +qr_algorithm::vector_dot + + + + + +Node5->Node7 + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.map b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.map new file mode 100644 index 000000000..ec7b7deba --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5 new file mode 100644 index 000000000..85baf6b21 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.md5 @@ -0,0 +1 @@ +bf6f7ec5ca04845009b2badc50fe5893 \ No newline at end of file diff --git a/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg new file mode 100644 index 000000000..a0b547612 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a33cb0a68c36aa26fd599c7c66da86ed7_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +create_matrix + + + +Node1 + + +create_matrix + + + + + +Node2 + + +std::rand + + + + + +Node1->Node2 + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map new file mode 100644 index 000000000..5c70c6b75 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.map @@ -0,0 +1,17 @@ + + + + + + + + + + + + + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 new file mode 100644 index 000000000..39daccda6 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.md5 @@ -0,0 +1 @@ +059a634ce09b1a75d5fc3b20aef7134a \ No newline at end of file diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg new file mode 100644 index 000000000..b98f2c17c --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg @@ -0,0 +1,339 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +create_matrix + + + + + +Node1->Node2 + + + + + +Node4 + + +qr_algorithm::eigen +_values + + + + + +Node1->Node4 + + + + + +Node11 + + +std::srand + + + + + +Node1->Node11 + + + + + +Node12 + + +test1 + + + + + +Node1->Node12 + + + + + +Node14 + + +test2 + + + + + +Node1->Node14 + + + + + +Node15 + + +std::time + + + + + +Node1->Node15 + + + + + +Node3 + + +std::rand + + + + + +Node2->Node3 + + + + + +Node5 + + +mat_mul + + + + + +Node4->Node5 + + + + + +Node6 + + +qr_algorithm::qr_decompose + + + + + +Node4->Node6 + + + + + +Node7 + + +qr_algorithm::vector_mag + + + + + +Node6->Node7 + + + + + +Node10 + + +qr_algorithm::vector_proj + + + + + +Node6->Node10 + + + + + +Node8 + + +std::sqrt + + + + + +Node7->Node8 + + + + + +Node9 + + +qr_algorithm::vector_dot + + + + + +Node7->Node9 + + + + + +Node12->Node4 + + + + + +Node13 + + +std::endl + + + + + +Node12->Node13 + + + + + +Node14->Node4 + + + + + +Node14->Node13 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg new file mode 100644 index 000000000..c8d515514 --- /dev/null +++ b/de/d75/qr__eigen__values_8cpp_a3c04138a5bfe5d72780bb7e82a18e627_cgraph_org.svg @@ -0,0 +1,251 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +create_matrix + + + + + +Node1->Node2 + + + + + +Node4 + + +qr_algorithm::eigen +_values + + + + + +Node1->Node4 + + + + + +Node11 + + +std::srand + + + + + +Node1->Node11 + + + + + +Node12 + + +test1 + + + + + +Node1->Node12 + + + + + +Node14 + + +test2 + + + + + +Node1->Node14 + + + + + +Node15 + + +std::time + + + + + +Node1->Node15 + + + + + +Node3 + + +std::rand + + + + + +Node2->Node3 + + + + + +Node5 + + +mat_mul + + + + + +Node4->Node5 + + + + + +Node6 + + +qr_algorithm::qr_decompose + + + + + +Node4->Node6 + + + + + +Node7 + + +qr_algorithm::vector_mag + + + + + +Node6->Node7 + + + + + +Node10 + + +qr_algorithm::vector_proj + + + + + +Node6->Node10 + + + + + +Node8 + + +std::sqrt + + + + + +Node7->Node8 + + + + + +Node9 + + +qr_algorithm::vector_dot + + + + + +Node7->Node9 + + + + + +Node12->Node4 + + + + + +Node13 + + +std::endl + + + + + +Node12->Node13 + + + + + +Node14->Node4 + + + + + +Node14->Node13 + + + + + diff --git a/de/d7c/struct_trie_1_1_trie_node-members.html b/de/d7c/struct_trie_1_1_trie_node-members.html new file mode 100644 index 000000000..4a06f727c --- /dev/null +++ b/de/d7c/struct_trie_1_1_trie_node-members.html @@ -0,0 +1,113 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Trie::TrieNode Member List
+
+
+ +

This is the complete list of members for Trie::TrieNode, including all inherited members.

+ + + +
character (defined in Trie::TrieNode)Trie::TrieNode
isEndOfWord (defined in Trie::TrieNode)Trie::TrieNode
+
+ + + + diff --git a/de/d85/decimal__to__roman__numeral_8cpp.html b/de/d85/decimal__to__roman__numeral_8cpp.html new file mode 100644 index 000000000..8c23cec05 --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp.html @@ -0,0 +1,322 @@ + + + + + + + +Algorithms_in_C++: others/decimal_to_roman_numeral.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
decimal_to_roman_numeral.cpp File Reference
+
+
+ +

This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral. +More...

+
#include <cmath>
+#include <cstdio>
+#include <cstring>
+#include <iostream>
+
+Include dependency graph for decimal_to_roman_numeral.cpp:
+
+
+
+
+
+ + + + + + + + + +

+Functions

std::string fill (char c, int n)
 
std::string tolowerRoman (int n)
 
std::string toupperRoman (int n)
 
int main ()
 
+

Detailed Description

+

This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral.

+

Function Documentation

+ +

◆ fill()

+ +
+
+ + + + + + + + + + + + + + + + + + +
std::string fill (char c,
int n 
)
+
+

This functions fills a string with character c, n times and returns it

Note
This can probably be replace by memcpy function.
+
15  {
+
16  std::string s = "";
+
17  while (n--) s += c;
+
18  return s;
+
19 }
+
+
+
+ +

◆ main()

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

main function

+
90  {
+
91  int n;
+
92  std::cout << "\t\tRoman numbers converter\n\n";
+
93  std::cout << "Type in decimal number between 0 up to 4000 (exclusive): ";
+
94  std::cin >> n;
+
95  std::cout << n << " in Upper Roman Numerals is " << toupperRoman(n) << "\n";
+
96  std::cout << n << " in Lower Roman Numerals is " << tolowerRoman(n) << "\n";
+
97  return 0;
+
98 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ tolowerRoman()

+ +
+
+ + + + + + + + +
std::string tolowerRoman (int n)
+
+

to convert to lowercase Roman Numeral the function works recursively

+
24  {
+
25  if (n < 4)
+
26  return fill('i', n);
+
27  if (n < 6)
+
28  return fill('i', 5 - n) + "v";
+
29  if (n < 9)
+
30  return std::string("v") + fill('i', n - 5);
+
31  if (n < 11)
+
32  return fill('i', 10 - n) + "x";
+
33  if (n < 40)
+
34  return fill('x', n / 10) + tolowerRoman(n % 10);
+
35  if (n < 60)
+
36  return fill('x', 5 - n / 10) + 'l' + tolowerRoman(n % 10);
+
37  if (n < 90)
+
38  return std::string("l") + fill('x', n / 10 - 5) + tolowerRoman(n % 10);
+
39  if (n < 110)
+
40  return fill('x', 10 - n / 10) + "c" + tolowerRoman(n % 10);
+
41  if (n < 400)
+
42  return fill('c', n / 100) + tolowerRoman(n % 100);
+
43  if (n < 600)
+
44  return fill('c', 5 - n / 100) + 'd' + tolowerRoman(n % 100);
+
45  if (n < 900)
+
46  return std::string("d") + fill('c', n / 100 - 5) +
+
47  tolowerRoman(n % 100);
+
48  if (n < 1100)
+
49  return fill('c', 10 - n / 100) + "m" + tolowerRoman(n % 100);
+
50  if (n < 4000)
+
51  return fill('m', n / 1000) + tolowerRoman(n % 1000);
+
52  return "?";
+
53 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ toupperRoman()

+ +
+
+ + + + + + + + +
std::string toupperRoman (int n)
+
+

to convert to uppercase Roman Numeral the function works recursively

+
58  {
+
59  if (n < 4)
+
60  return fill('I', n);
+
61  if (n < 6)
+
62  return fill('I', 5 - n) + "V";
+
63  if (n < 9)
+
64  return std::string("V") + fill('I', n - 5);
+
65  if (n < 11)
+
66  return fill('I', 10 - n) + "X";
+
67  if (n < 40)
+
68  return fill('X', n / 10) + toupperRoman(n % 10);
+
69  if (n < 60)
+
70  return fill('X', 5 - n / 10) + 'L' + toupperRoman(n % 10);
+
71  if (n < 90)
+
72  return std::string("L") + fill('X', n / 10 - 5) + toupperRoman(n % 10);
+
73  if (n < 110)
+
74  return fill('X', 10 - n / 10) + "C" + toupperRoman(n % 10);
+
75  if (n < 400)
+
76  return fill('C', n / 100) + toupperRoman(n % 100);
+
77  if (n < 600)
+
78  return fill('C', 5 - n / 100) + 'D' + toupperRoman(n % 100);
+
79  if (n < 900)
+
80  return std::string("D") + fill('C', n / 100 - 5) +
+
81  toupperRoman(n % 100);
+
82  if (n < 1100)
+
83  return fill('C', 10 - n / 100) + "M" + toupperRoman(n % 100);
+
84  if (n < 4000)
+
85  return fill('M', n / 1000) + toupperRoman(n % 1000);
+
86  return "?";
+
87 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
STL class.
+
std::string tolowerRoman(int n)
Definition: decimal_to_roman_numeral.cpp:24
+
std::string fill(char c, int n)
Definition: decimal_to_roman_numeral.cpp:15
+ +
std::string toupperRoman(int n)
Definition: decimal_to_roman_numeral.cpp:58
+ + + + + diff --git a/de/d85/decimal__to__roman__numeral_8cpp.js b/de/d85/decimal__to__roman__numeral_8cpp.js new file mode 100644 index 000000000..f104ab71a --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp.js @@ -0,0 +1,7 @@ +var decimal__to__roman__numeral_8cpp = +[ + [ "fill", "de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780", null ], + [ "main", "de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "tolowerRoman", "de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d", null ], + [ "toupperRoman", "de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979", null ] +]; \ No newline at end of file diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map new file mode 100644 index 000000000..f0fc71885 --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 new file mode 100644 index 000000000..597e57075 --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.md5 @@ -0,0 +1 @@ +f710e2d8b6cc6f50984992fe66292e0b \ No newline at end of file diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg new file mode 100644 index 000000000..76aa49816 --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_a003fb4e1b08279fe4cd50fbbc2782c2d_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +tolowerRoman + + + +Node1 + + +tolowerRoman + + + + + +Node2 + + +fill + + + + + +Node1->Node2 + + + + + diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map new file mode 100644 index 000000000..3f382190e --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5 new file mode 100644 index 000000000..bc99c4e0a --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.md5 @@ -0,0 +1 @@ +728539a9650eb359a199ea70c18650c0 \ No newline at end of file diff --git a/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg new file mode 100644 index 000000000..7abc1b0bf --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_a214743638eff1336f835310049aef979_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +toupperRoman + + + +Node1 + + +toupperRoman + + + + + +Node2 + + +fill + + + + + +Node1->Node2 + + + + + diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..9383fec90 --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,6 @@ + + + + + + diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..99d418038 --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +c8cd6b7042ff5ebfdf1b6db8235899a6 \ No newline at end of file diff --git a/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..3f091ccae --- /dev/null +++ b/de/d85/decimal__to__roman__numeral_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,73 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +tolowerRoman + + + + + +Node1->Node2 + + + + + +Node4 + + +toupperRoman + + + + + +Node1->Node4 + + + + + +Node3 + + +fill + + + + + +Node2->Node3 + + + + + +Node4->Node3 + + + + + diff --git a/de/d8a/class_trie-members.html b/de/d8a/class_trie-members.html new file mode 100644 index 000000000..bd11dcdfa --- /dev/null +++ b/de/d8a/class_trie-members.html @@ -0,0 +1,119 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Trie Member List
+
+
+ +

This is the complete list of members for Trie, including all inherited members.

+ + + + + + + + + +
ALPHABETS (defined in Trie)Trieprivatestatic
hasChildren(std::shared_ptr< TrieNode > node)Trieinlineprivatestatic
insert(const std::string &word)Trieinline
m_root (defined in Trie)Trieprivate
removeWord(const std::string &word) (defined in Trie)Trieinline
removeWordHelper(const std::string &word, std::shared_ptr< TrieNode > curr, size_t index)Trieinlineprivate
search(const std::string &word)Trieinline
Trie()Trieinline
+
+ + + + diff --git a/de/d91/class_queue___array-members.html b/de/d91/class_queue___array-members.html new file mode 100644 index 000000000..8db8304a2 --- /dev/null +++ b/de/d91/class_queue___array-members.html @@ -0,0 +1,119 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Queue_Array Member List
+
+
+ +

This is the complete list of members for Queue_Array, including all inherited members.

+ + + + + + + + + +
arr (defined in Queue_Array)Queue_Array
dequeue() (defined in Queue_Array)Queue_Array
display() (defined in Queue_Array)Queue_Array
enqueue(int) (defined in Queue_Array)Queue_Array
front (defined in Queue_Array)Queue_Arrayprivate
Queue_Array() (defined in Queue_Array)Queue_Arrayinline
rear (defined in Queue_Array)Queue_Arrayprivate
size (defined in Queue_Array)Queue_Arrayprivate
+
+ + + + diff --git a/de/d91/structlist-members.html b/de/d91/structlist-members.html new file mode 100644 index 000000000..93071e4ec --- /dev/null +++ b/de/d91/structlist-members.html @@ -0,0 +1,123 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
list Member List
+
+
+ +

This is the complete list of members for list, including all inherited members.

+ + + + + + + + + + + + + +
BinarySearch(int *array, int first, int last, int x) (defined in list)listinline
data (defined in list)list
insert(int x) (defined in list)listinline
isSorted (defined in list)list
keylist
LinarSearch(int *array, int x) (defined in list)listinline
nextlist
Remove(int x) (defined in list)listinline
Search(int x) (defined in list)listinline
Show() (defined in list)listinline
Sort() (defined in list)listinline
top (defined in list)list
+
+ + + + diff --git a/de/d9b/prime__numbers_8cpp.html b/de/d9b/prime__numbers_8cpp.html new file mode 100644 index 000000000..24cde6272 --- /dev/null +++ b/de/d9b/prime__numbers_8cpp.html @@ -0,0 +1,211 @@ + + + + + + + +Algorithms_in_C++: math/prime_numbers.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
prime_numbers.cpp File Reference
+
+
+ +

Get list of prime numbers. +More...

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

+Functions

std::vector< int > primes (int max)
 
int main ()
 
+

Detailed Description

+

Get list of prime numbers.

+
See also
primes_up_to_billion.cpp sieve_of_eratosthenes.cpp
+

Function Documentation

+ +

◆ main()

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

main function

+
26  {
+
27  std::cout << "Calculate primes up to:\n>> ";
+
28  int n;
+
29  std::cin >> n;
+ +
31  for (int i = 0; i < ans.size(); i++) std::cout << ans[i] << ' ';
+ +
33 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ primes()

+ +
+
+ + + + + + + + +
std::vector<int> primes (int max)
+
+

Generate an increasingly large number of primes and store in a list

+
12  {
+
13  max++;
+
14  std::vector<int> res;
+
15  std::vector<bool> numbers(max, false);
+
16  for (int i = 2; i < max; i++) {
+
17  if (!numbers[i]) {
+
18  for (int j = i; j < max; j += i) numbers[j] = true;
+
19  res.push_back(i);
+
20  }
+
21  }
+
22  return res;
+
23 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
std::vector< int > primes(int max)
Definition: prime_numbers.cpp:12
+ +
ll ans(ll n)
Definition: matrix_exponentiation.cpp:94
+
T push_back(T... args)
+ +
T endl(T... args)
+
T max(T... args)
+ + + + + diff --git a/de/d9b/prime__numbers_8cpp.js b/de/d9b/prime__numbers_8cpp.js new file mode 100644 index 000000000..4132bd5cf --- /dev/null +++ b/de/d9b/prime__numbers_8cpp.js @@ -0,0 +1,5 @@ +var prime__numbers_8cpp = +[ + [ "main", "de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "primes", "de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3", null ] +]; \ No newline at end of file diff --git a/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.map b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.map new file mode 100644 index 000000000..3b677c6c3 --- /dev/null +++ b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.md5 b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.md5 new file mode 100644 index 000000000..42fed2534 --- /dev/null +++ b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.md5 @@ -0,0 +1 @@ +c724d045227b4ab296082cfac7279b55 \ No newline at end of file diff --git a/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg new file mode 100644 index 000000000..9bef758b2 --- /dev/null +++ b/de/d9b/prime__numbers_8cpp_a3b91f208e8365c95a295cfe3e67df5c3_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +primes + + + +Node1 + + +primes + + + + + +Node2 + + +std::vector::push_back + + + + + +Node1->Node2 + + + + + diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..e6f19c046 --- /dev/null +++ b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..583fcc32e --- /dev/null +++ b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +8e89adb06e5c7748c8b9a8f506f2a57b \ No newline at end of file diff --git a/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..a55c09ab0 --- /dev/null +++ b/de/d9b/prime__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,82 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +ans + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + +Node4 + + +primes + + + + + +Node1->Node4 + + + + + +Node5 + + +std::vector::push_back + + + + + +Node4->Node5 + + + + + diff --git a/de/db2/quick__sort_8cpp__incl.map b/de/db2/quick__sort_8cpp__incl.map new file mode 100644 index 000000000..8091649d0 --- /dev/null +++ b/de/db2/quick__sort_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/de/db2/quick__sort_8cpp__incl.md5 b/de/db2/quick__sort_8cpp__incl.md5 new file mode 100644 index 000000000..6f2dc525a --- /dev/null +++ b/de/db2/quick__sort_8cpp__incl.md5 @@ -0,0 +1 @@ +4b46081768df50ee71c6abb048fa8066 \ No newline at end of file diff --git a/de/db2/quick__sort_8cpp__incl.svg b/de/db2/quick__sort_8cpp__incl.svg new file mode 100644 index 000000000..28ffb6b28 --- /dev/null +++ b/de/db2/quick__sort_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +sorting/quick_sort.cpp + + + +Node1 + + +sorting/quick_sort.cpp + + + + + +Node2 + + +cstdlib + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/de/db5/class_edge-members.html b/de/db5/class_edge-members.html new file mode 100644 index 000000000..b0429499d --- /dev/null +++ b/de/db5/class_edge-members.html @@ -0,0 +1,123 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Edge Member List
+
+
+ +

This is the complete list of members for Edge, including all inherited members.

+ + + + + + + + + + + + + +
dest (defined in Edge)Edge
dst (defined in Edge)Edge
Edge()=delete (defined in Edge)Edge
Edge(Edge &&)=default (defined in Edge)Edge
Edge(Edge const &)=default (defined in Edge)Edge
Edge(unsigned int source, unsigned int destination)Edgeinline
operator=(Edge &&)=default (defined in Edge)Edge
operator=(Edge const &)=default (defined in Edge)Edge
src (defined in Edge)Edge
src (defined in Edge)Edge
weight (defined in Edge)Edge
~Edge()=default (defined in Edge)Edge
+
+ + + + diff --git a/de/dc3/binaryheap_8cpp.html b/de/dc3/binaryheap_8cpp.html new file mode 100644 index 000000000..7014eb14a --- /dev/null +++ b/de/dc3/binaryheap_8cpp.html @@ -0,0 +1,138 @@ + + + + + + + +Algorithms_in_C++: data_structures/binaryheap.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
binaryheap.cpp File Reference
+
+
+ +

A C++ program to demonstrate common Binary Heap Operations. +More...

+
#include <climits>
+#include <iostream>
+#include <utility>
+
+Include dependency graph for binaryheap.cpp:
+
+
+
+
+
+ + + +

+Classes

class  MinHeap
 
+ + + +

+Functions

+int main ()
 
+

Detailed Description

+

A C++ program to demonstrate common Binary Heap Operations.

+
+
+ + + + diff --git a/de/dc3/binaryheap_8cpp.js b/de/dc3/binaryheap_8cpp.js new file mode 100644 index 000000000..78a4fe732 --- /dev/null +++ b/de/dc3/binaryheap_8cpp.js @@ -0,0 +1,5 @@ +var binaryheap_8cpp = +[ + [ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ], + [ "main", "de/dc3/binaryheap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/de/dc8/classlarge__number-members.html b/de/dc8/classlarge__number-members.html new file mode 100644 index 000000000..4cdcc253f --- /dev/null +++ b/de/dc8/classlarge__number-members.html @@ -0,0 +1,134 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
large_number Member List
+
+
+ +

This is the complete list of members for large_number, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + +
_digitslarge_numberprivate
add_digit(unsigned int value)large_numberinline
digit_char(size_t i) constlarge_numberinline
large_number()large_numberinline
large_number(int n)large_numberinlineexplicit
large_number(const large_number &a)large_numberinline
large_number(std::vector< unsigned char > &vec)large_numberinlineexplicit
large_number(char const *number_str) (defined in large_number)large_numberinlineexplicit
multiply(const T n)large_numberinlineprivate
num_digits() constlarge_numberinline
operator!=(large_number const &a, large_number const &b)large_numberfriend
operator*=(const T n)large_numberinline
operator+(const large_number &a, const T &b)large_numberfriend
operator++()large_numberinline
operator++(int)large_numberinline
operator+=(large_number n)large_numberinline
operator+=(int n) (defined in large_number)large_numberinline
operator<<(std::ostream &out, const large_number &a)large_numberfriend
operator=(const large_number &b)large_numberinline
operator==(large_number const &a, large_number const &b)large_numberfriend
operator[](size_t n)large_numberinline
operator[](size_t n) const (defined in large_number)large_numberinline
test()large_numberinlinestatic
+
+ + + + diff --git a/de/dcf/binary__exponent_8cpp.html b/de/dcf/binary__exponent_8cpp.html new file mode 100644 index 000000000..028ba2ce0 --- /dev/null +++ b/de/dcf/binary__exponent_8cpp.html @@ -0,0 +1,265 @@ + + + + + + + +Algorithms_in_C++: math/binary_exponent.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
binary_exponent.cpp File Reference
+
+
+ +

C++ Program to find Binary Exponent Iteratively and Recursively. +More...

+
#include <iostream>
+
+Include dependency graph for binary_exponent.cpp:
+
+
+
+
+
+ + + + + + + + +

+Functions

int binExpo (int a, int b)
 
int binExpo_alt (int a, int b)
 
int main ()
 Main function. More...
 
+

Detailed Description

+

C++ Program to find Binary Exponent Iteratively and Recursively.

+

Calculate \(a^b\) in \(O(\log(b))\) by converting \(b\) to a binary number. Binary exponentiation is also known as exponentiation by squaring.

Note
This is a far better approach compared to naive method which provide \(O(b)\) operations.
+

Example: 10 in base 2 is 1010.

+\begin{eqnarray*} 2^{10_d} &=& 2^{1010_b} = 2^8 * 2^2\\ 2^1 &=& 2\\ 2^2 &=& (2^1)^2 = 2^2 = 4\\ 2^4 &=& (2^2)^2 = 4^2 = 16\\ 2^8 &=& (2^4)^2 = 16^2 = 256\\ \end{eqnarray*} +

+

Hence to calculate 2^10 we only need to multiply \(2^8\) and \(2^2\) skipping \(2^1\) and \(2^4\).

+

Function Documentation

+ +

◆ binExpo()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int binExpo (int a,
int b 
)
+
+

Recursive function to calculate exponent in \(O(\log(n))\) using binary exponent.

+
28  {
+
29  if (b == 0) {
+
30  return 1;
+
31  }
+
32  int res = binExpo(a, b / 2);
+
33  if (b % 2) {
+
34  return res * res * a;
+
35  } else {
+
36  return res * res;
+
37  }
+
38 }
+
+
+
+ +

◆ binExpo_alt()

+ +
+
+ + + + + + + + + + + + + + + + + + +
int binExpo_alt (int a,
int b 
)
+
+

Iterative function to calculate exponent in \(O(\log(n))\) using binary exponent.

+
42  {
+
43  int res = 1;
+
44  while (b > 0) {
+
45  if (b % 2) {
+
46  res = res * a;
+
47  }
+
48  a = a * a;
+
49  b /= 2;
+
50  }
+
51  return res;
+
52 }
+
+
+
+ +

◆ main()

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

Main function.

+

Give two numbers a, b

+

int resIterate = binExpo_alt(a, b);

+

Result of a^b (where '^' denotes exponentiation)

+

std::cout << resIterate << std::endl;

+
55  {
+
56  int a, b;
+
57  /// Give two numbers a, b
+
58  std::cin >> a >> b;
+
59  if (a == 0 && b == 0) {
+
60  std::cout << "Math error" << std::endl;
+
61  } else if (b < 0) {
+
62  std::cout << "Exponent must be positive !!" << std::endl;
+
63  } else {
+
64  int resRecurse = binExpo(a, b);
+
65  /// int resIterate = binExpo_alt(a, b);
+
66 
+
67  /// Result of a^b (where '^' denotes exponentiation)
+
68  std::cout << resRecurse << std::endl;
+
69  /// std::cout << resIterate << std::endl;
+
70  }
+
71 }
+
+
+
+
+
+
int binExpo(int a, int b)
Definition: binary_exponent.cpp:28
+ +
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+ + + + + diff --git a/de/dcf/binary__exponent_8cpp.js b/de/dcf/binary__exponent_8cpp.js new file mode 100644 index 000000000..1e59122a2 --- /dev/null +++ b/de/dcf/binary__exponent_8cpp.js @@ -0,0 +1,6 @@ +var binary__exponent_8cpp = +[ + [ "binExpo", "de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73", null ], + [ "binExpo_alt", "de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f", null ], + [ "main", "de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/de/dd3/newton__raphson__method_8cpp.html b/de/dd3/newton__raphson__method_8cpp.html new file mode 100644 index 000000000..09f4a058e --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp.html @@ -0,0 +1,281 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/newton_raphson_method.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
newton_raphson_method.cpp File Reference
+
+
+ +

Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions. +More...

+
#include <cmath>
+#include <ctime>
+#include <iostream>
+#include <limits>
+
+Include dependency graph for newton_raphson_method.cpp:
+
+
+
+
+
+ + + + + + +

+Macros

+#define EPSILON   1e-6
 
+#define MAX_ITERATIONS   50000
 Maximum number of iterations to check.
 
+ + + + + + + +

+Functions

static double eq (double i)
 
static double eq_der (double i)
 
int main ()
 
+

Detailed Description

+

Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions.

+

The \((i+1)^\text{th}\) approximation is given by:

+\[ x_{i+1} = x_i - \frac{f(x_i)}{f'(x_i)} \] +

+
Author
Krishna Vedala
+
See also
bisection_method.cpp, false_position.cpp
+

Function Documentation

+ +

◆ eq()

+ +
+
+ + + + + +
+ + + + + + + + +
static double eq (double i)
+
+static
+
+

define \(f(x)\) to find root for

+
26  {
+
27  return (std::pow(i, 3) - (4 * i) - 9); // original equation
+
28 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ eq_der()

+ +
+
+ + + + + +
+ + + + + + + + +
static double eq_der (double i)
+
+static
+
+

define the derivative function \(f'(x)\)

+
32  {
+
33  return ((3 * std::pow(i, 2)) - 4); // derivative of equation
+
34 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ main()

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

Main function

+
37  {
+
38  std::srand(std::time(nullptr)); // initialize randomizer
+
39 
+
40  double z, c = std::rand() % 100, m, n;
+
41  int i;
+
42 
+
43  std::cout << "\nInitial approximation: " << c;
+
44 
+
45  // start iterations
+
46  for (i = 0; i < MAX_ITERATIONS; i++) {
+
47  m = eq(c);
+
48  n = eq_der(c);
+
49 
+
50  z = c - (m / n);
+
51  c = z;
+
52 
+
53  if (std::abs(m) < EPSILON) // stoping criteria
+
54  break;
+
55  }
+
56 
+
57  std::cout << "\n\nRoot: " << z << "\t\tSteps: " << i << std::endl;
+
58  return 0;
+
59 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T srand(T... args)
+
#define MAX_ITERATIONS
Maximum number of iterations to check.
Definition: newton_raphson_method.cpp:22
+
static double eq(double i)
Definition: newton_raphson_method.cpp:26
+
static double eq_der(double i)
Definition: newton_raphson_method.cpp:32
+ +
T rand(T... args)
+
T endl(T... args)
+
T time(T... args)
+
T pow(T... args)
+ + + + diff --git a/de/dd3/newton__raphson__method_8cpp.js b/de/dd3/newton__raphson__method_8cpp.js new file mode 100644 index 000000000..12acb8598 --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp.js @@ -0,0 +1,8 @@ +var newton__raphson__method_8cpp = +[ + [ "EPSILON", "de/dd3/newton__raphson__method_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70", null ], + [ "MAX_ITERATIONS", "de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14", null ], + [ "eq", "de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d", null ], + [ "eq_der", "de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386", null ], + [ "main", "de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map new file mode 100644 index 000000000..f584df02e --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 new file mode 100644 index 000000000..ecfa65278 --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.md5 @@ -0,0 +1 @@ +ebb04cd15e67d7a7b151a478105c7fad \ No newline at end of file diff --git a/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg new file mode 100644 index 000000000..c3eea1476 --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_a2003b5b2dcfff0769b957ab5c968b03d_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +eq + + + +Node1 + + +eq + + + + + +Node2 + + +std::pow + + + + + +Node1->Node2 + + + + + diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map new file mode 100644 index 000000000..dcab8cffc --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5 new file mode 100644 index 000000000..c996d6b43 --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.md5 @@ -0,0 +1 @@ +c83bd1d152d8b23784fc627b77621f50 \ No newline at end of file diff --git a/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg new file mode 100644 index 000000000..2e9619de8 --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_a3d3f7f41977394680af6ebbed96f3386_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +eq_der + + + +Node1 + + +eq_der + + + + + +Node2 + + +std::pow + + + + + +Node1->Node2 + + + + + diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..6237da0b6 --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..054e93adb --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +d5eb5c4ea1e41ebc82aec90ab0eaa2a4 \ No newline at end of file diff --git a/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..5275e3f7f --- /dev/null +++ b/de/dd3/newton__raphson__method_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::srand + + + + + +Node1->Node2 + + + + + +Node3 + + +std::time + + + + + +Node1->Node3 + + + + + diff --git a/de/de4/fibonacci__large_8cpp.html b/de/de4/fibonacci__large_8cpp.html new file mode 100644 index 000000000..020750b15 --- /dev/null +++ b/de/de4/fibonacci__large_8cpp.html @@ -0,0 +1,175 @@ + + + + + + + +Algorithms_in_C++: math/fibonacci_large.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
fibonacci_large.cpp File Reference
+
+
+ +

Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations. +More...

+
#include <cinttypes>
+#include <ctime>
+#include <iostream>
+#include "./large_number.h"
+
+Include dependency graph for fibonacci_large.cpp:
+
+
+
+
+
+ + + + + +

+Functions

large_number fib (uint64_t n)
 
+int main (int argc, char *argv[])
 
+

Detailed Description

+

Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations.

+

Took 0.608246 seconds to compute 50,000^th Fibonacci number that contains 10450 digits!

+
Author
Krishna Vedala
+
See also
fibonacci.cpp, fibonacci_fast.cpp, string_fibonacci.cpp
+

Function Documentation

+ +

◆ fib()

+ +
+
+ + + + + + + + +
large_number fib (uint64_t n)
+
+

Compute fibonacci numbers using the relation

+\[f(n)=f(n-1)+f(n-2)\] +

+

and returns the result as a large_number type.

+
24  {
+
25  large_number f0(1);
+
26  large_number f1(1);
+
27 
+
28  do {
+
29  large_number f2 = f1;
+
30  f1 += f0;
+
31  f0 = f2;
+
32  n--;
+
33  } while (n > 2); // since we start from 2
+
34 
+
35  return f1;
+
36 }
+
+
+
+
+
+
Definition: large_number.h:24
+ + + + diff --git a/de/de4/fibonacci__large_8cpp.js b/de/de4/fibonacci__large_8cpp.js new file mode 100644 index 000000000..04256ec55 --- /dev/null +++ b/de/de4/fibonacci__large_8cpp.js @@ -0,0 +1,5 @@ +var fibonacci__large_8cpp = +[ + [ "fib", "de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db", null ], + [ "main", "de/de4/fibonacci__large_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ] +]; \ No newline at end of file diff --git a/df/d06/decimal__to__binary_8cpp.html b/df/d06/decimal__to__binary_8cpp.html new file mode 100644 index 000000000..4b8d6d763 --- /dev/null +++ b/df/d06/decimal__to__binary_8cpp.html @@ -0,0 +1,217 @@ + + + + + + + +Algorithms_in_C++: others/decimal_to_binary.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
decimal_to_binary.cpp File Reference
+
+
+ +

Function to convert decimal number to binary representation. +More...

+
#include <iostream>
+
+Include dependency graph for decimal_to_binary.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

void method1 (int number)
 
void method2 (int number)
 
+int main ()
 
+

Detailed Description

+

Function to convert decimal number to binary representation.

+

Function Documentation

+ +

◆ method1()

+ +
+
+ + + + + + + + +
void method1 (int number)
+
+

This method converts the bit representation and stores it as a decimal number.

+
11  {
+
12  int remainder, binary = 0, var = 1;
+
13 
+
14  do {
+
15  remainder = number % 2;
+
16  number = number / 2;
+
17  binary = binary + (remainder * var);
+
18  var = var * 10;
+
19  } while (number > 0);
+
20  std::cout << "Method 1 : " << binary << std::endl;
+
21 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ method2()

+ +
+
+ + + + + + + + +
void method2 (int number)
+
+

This method stores each bit value from LSB to MSB and then prints them back from MSB to LSB

+
27  {
+
28  int num_bits = 0;
+
29  char bit_string[50];
+
30 
+
31  do {
+
32  bool bit = number & 0x01; // get last bit
+
33  if (bit)
+
34  bit_string[num_bits++] = '1';
+
35  else
+
36  bit_string[num_bits++] = '0';
+
37  number >>= 1; // right shift bit 1 bit
+
38  } while (number > 0);
+
39 
+
40  std::cout << "Method 2 : ";
+
41  while (num_bits >= 0)
+
42  std::cout << bit_string[num_bits--]; // print from MSB to LSB
+ +
44 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T remainder(T... args)
+ +
T endl(T... args)
+ + + + diff --git a/df/d06/decimal__to__binary_8cpp.js b/df/d06/decimal__to__binary_8cpp.js new file mode 100644 index 000000000..01ca7c34e --- /dev/null +++ b/df/d06/decimal__to__binary_8cpp.js @@ -0,0 +1,6 @@ +var decimal__to__binary_8cpp = +[ + [ "main", "df/d06/decimal__to__binary_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "method1", "df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11", null ], + [ "method2", "df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7", null ] +]; \ No newline at end of file diff --git a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map new file mode 100644 index 000000000..9e834a77a --- /dev/null +++ b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5 b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5 new file mode 100644 index 000000000..eea2960bd --- /dev/null +++ b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.md5 @@ -0,0 +1 @@ +3c4e8f992ea59f183dfecf1f41b20539 \ No newline at end of file diff --git a/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg new file mode 100644 index 000000000..146c03922 --- /dev/null +++ b/df/d06/decimal__to__binary_8cpp_a10df57491019f0ac39b492740fb388f7_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +method2 + + + +Node1 + + +method2 + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map new file mode 100644 index 000000000..2e38e9a6e --- /dev/null +++ b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5 b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5 new file mode 100644 index 000000000..756989b2a --- /dev/null +++ b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.md5 @@ -0,0 +1 @@ +888f430fa2a3ccc0a3f97ff78c3aab71 \ No newline at end of file diff --git a/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg new file mode 100644 index 000000000..a5808885e --- /dev/null +++ b/df/d06/decimal__to__binary_8cpp_a9240f2e79074a2a248395258aebbfa11_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +method1 + + + +Node1 + + +method1 + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + diff --git a/df/d0f/fibonacci_8cpp__incl.map b/df/d0f/fibonacci_8cpp__incl.map new file mode 100644 index 000000000..c6569c877 --- /dev/null +++ b/df/d0f/fibonacci_8cpp__incl.map @@ -0,0 +1,5 @@ + + + + + diff --git a/df/d0f/fibonacci_8cpp__incl.md5 b/df/d0f/fibonacci_8cpp__incl.md5 new file mode 100644 index 000000000..2e71bcfb4 --- /dev/null +++ b/df/d0f/fibonacci_8cpp__incl.md5 @@ -0,0 +1 @@ +aead6fed1017e9b63f0374840d524e12 \ No newline at end of file diff --git a/df/d0f/fibonacci_8cpp__incl.svg b/df/d0f/fibonacci_8cpp__incl.svg new file mode 100644 index 000000000..0bb6575a5 --- /dev/null +++ b/df/d0f/fibonacci_8cpp__incl.svg @@ -0,0 +1,52 @@ + + + + + + +math/fibonacci.cpp + + + +Node1 + + +math/fibonacci.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +iostream + + + + + +Node1->Node3 + + + + + diff --git a/df/d27/class_bit.html b/df/d27/class_bit.html new file mode 100644 index 000000000..f22b5e253 --- /dev/null +++ b/df/d27/class_bit.html @@ -0,0 +1,157 @@ + + + + + + + +Algorithms_in_C++: Bit Class Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+
+Collaboration diagram for Bit:
+
+
+
+
[legend]
+ + + + + + + + + + + + +

+Public Member Functions

Bit (vector< int > &arr)
 
Bit (int x)
 
+void update (int id, int val)
 
+int sum (int id)
 
+int sum_range (int l, int r)
 
+ + + +

+Private Member Functions

+int offset (int x)
 
+ + + + + +

+Private Attributes

+int n
 
+vector< int > bit
 
+
The documentation for this class was generated from the following file:
    +
  • range_queries/bit.cpp
  • +
+
+
+ + + + diff --git a/df/d27/class_bit.js b/df/d27/class_bit.js new file mode 100644 index 000000000..01e4d414b --- /dev/null +++ b/df/d27/class_bit.js @@ -0,0 +1,11 @@ +var class_bit = +[ + [ "Bit", "df/d27/class_bit.html#a0469ede9ad660a29610818a18d54771e", null ], + [ "Bit", "df/d27/class_bit.html#a4608ad7c723fd9bfa0307a7fa92bb796", null ], + [ "offset", "df/d27/class_bit.html#a7bcd2ef5d469cc9dcb168337e2123c37", null ], + [ "sum", "df/d27/class_bit.html#a5328d6a5f9ddc6f4e81788f4c5644824", null ], + [ "sum_range", "df/d27/class_bit.html#a1e9901bca87d5edc9d196bc6c498b5e4", null ], + [ "update", "df/d27/class_bit.html#a9c00ccda9c4eb4278485e7ed503b41d2", null ], + [ "bit", "df/d27/class_bit.html#a6b0c0c1b952eec7e839ef3d24a8d8b8e", null ], + [ "n", "df/d27/class_bit.html#ab304c3bfc76f08016188653ff54605e5", null ] +]; \ No newline at end of file diff --git a/df/d39/interpolation__search2_8cpp.html b/df/d39/interpolation__search2_8cpp.html new file mode 100644 index 000000000..99eb0c284 --- /dev/null +++ b/df/d39/interpolation__search2_8cpp.html @@ -0,0 +1,231 @@ + + + + + + + +Algorithms_in_C++: search/interpolation_search2.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
interpolation_search2.cpp File Reference
+
+
+ +

Interpolation search algorithm +More...

+
#include <iostream>
+
+Include dependency graph for interpolation_search2.cpp:
+
+
+
+
+
+ + + + + +

+Functions

int InterpolationSearch (int A[], int n, int x)
 
int main ()
 
+

Detailed Description

+

Function Documentation

+ +

◆ InterpolationSearch()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int InterpolationSearch (int A[],
int n,
int x 
)
+
+

function to search the value in an array using interpolation search

Parameters
+ + + + +
[in]arrarray to search in
[in]valuevalue to search for
[in]lenlength of array
+
+
+
Returns
index where the value is found
+
+-1 if not found
+
15  {
+
16  int low = 0;
+
17  int high = n - 1;
+
18  while (low <= high) {
+
19  int mid = low + (((high - 1) * (x - A[low])) / (A[high] - A[low]));
+
20  if (x == A[mid])
+
21  return mid; // Found x, return (exit)
+
22  else if (x < A[mid])
+
23  high = mid - 1; // X lies before mid
+
24  else
+
25  low = mid + 1; // x lies after mid
+
26  }
+
27 
+
28  return -1;
+
29 }
+
+
+
+ +

◆ main()

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

main function

+

< passed array A inside the InterpolationSearch function

+
32  {
+
33  int A[] = {2, 4, 5, 7, 13, 14, 15, 23};
+
34  int x = 17;
+
35 
+
36  ///< passed array A inside the InterpolationSearch function
+
37  int index = InterpolationSearch(A, 8, x);
+
38  if (index < 0)
+
39  std::cout << "Number " << x << " not found" << std::endl;
+
40  else
+
41  std::cout << "Number " << x << " is at " << index << std::endl;
+
42 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
T endl(T... args)
+
int InterpolationSearch(int A[], int n, int x)
Definition: interpolation_search2.cpp:15
+ + + + diff --git a/df/d39/interpolation__search2_8cpp.js b/df/d39/interpolation__search2_8cpp.js new file mode 100644 index 000000000..fb1d0b0f4 --- /dev/null +++ b/df/d39/interpolation__search2_8cpp.js @@ -0,0 +1,5 @@ +var interpolation__search2_8cpp = +[ + [ "InterpolationSearch", "df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629", null ], + [ "main", "df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..e1b4ccb0f --- /dev/null +++ b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..97f771200 --- /dev/null +++ b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +ee05305faa520af3901c305bf62887b7 \ No newline at end of file diff --git a/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..c35d6be5b --- /dev/null +++ b/df/d39/interpolation__search2_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +std::endl + + + + + +Node1->Node2 + + + + + +Node3 + + +InterpolationSearch + + + + + +Node1->Node3 + + + + + diff --git a/df/d3c/exponential__search_8cpp__incl.map b/df/d3c/exponential__search_8cpp__incl.map new file mode 100644 index 000000000..d092674a8 --- /dev/null +++ b/df/d3c/exponential__search_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/df/d3c/exponential__search_8cpp__incl.md5 b/df/d3c/exponential__search_8cpp__incl.md5 new file mode 100644 index 000000000..fc983c7a7 --- /dev/null +++ b/df/d3c/exponential__search_8cpp__incl.md5 @@ -0,0 +1 @@ +433c55cf298e9cf95854d26e1ee9632e \ No newline at end of file diff --git a/df/d3c/exponential__search_8cpp__incl.svg b/df/d3c/exponential__search_8cpp__incl.svg new file mode 100644 index 000000000..6b7ca4ca6 --- /dev/null +++ b/df/d3c/exponential__search_8cpp__incl.svg @@ -0,0 +1,83 @@ + + + + + + +search/exponential_search.cpp + + + +Node1 + + +search/exponential +_search.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +cstring + + + + + +Node1->Node5 + + + + + diff --git a/df/d86/rabin__karp_8cpp__incl.map b/df/d86/rabin__karp_8cpp__incl.map new file mode 100644 index 000000000..7f6224c23 --- /dev/null +++ b/df/d86/rabin__karp_8cpp__incl.map @@ -0,0 +1,7 @@ + + + + + + + diff --git a/df/d86/rabin__karp_8cpp__incl.md5 b/df/d86/rabin__karp_8cpp__incl.md5 new file mode 100644 index 000000000..1926c18a4 --- /dev/null +++ b/df/d86/rabin__karp_8cpp__incl.md5 @@ -0,0 +1 @@ +1c6300b160a0a1f5d5fa8acdf5239669 \ No newline at end of file diff --git a/df/d86/rabin__karp_8cpp__incl.svg b/df/d86/rabin__karp_8cpp__incl.svg new file mode 100644 index 000000000..d5ab55ade --- /dev/null +++ b/df/d86/rabin__karp_8cpp__incl.svg @@ -0,0 +1,82 @@ + + + + + + +strings/rabin_karp.cpp + + + +Node1 + + +strings/rabin_karp.cpp + + + + + +Node2 + + +cassert + + + + + +Node1->Node2 + + + + + +Node3 + + +cmath + + + + + +Node1->Node3 + + + + + +Node4 + + +iostream + + + + + +Node1->Node4 + + + + + +Node5 + + +cstring + + + + + +Node1->Node5 + + + + + diff --git a/df/dc8/successive__approximation_8cpp.html b/df/dc8/successive__approximation_8cpp.html new file mode 100644 index 000000000..b9cf50ba8 --- /dev/null +++ b/df/dc8/successive__approximation_8cpp.html @@ -0,0 +1,246 @@ + + + + + + + +Algorithms_in_C++: numerical_methods/successive_approximation.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
successive_approximation.cpp File Reference
+
+
+ +

Method of successive approximations using fixed-point iteration method. +More...

+
#include <cmath>
+#include <iostream>
+
+Include dependency graph for successive_approximation.cpp:
+
+
+
+
+
+ + + + + + + +

+Functions

static float eq (float y)
 
static float eqd (float y)
 
int main ()
 
+

Detailed Description

+

Method of successive approximations using fixed-point iteration method.

+

Function Documentation

+ +

◆ eq()

+ +
+
+ + + + + +
+ + + + + + + + +
static float eq (float y)
+
+static
+
+

equation 1

+\[f(y) = 3y - \cos y -2\] +

+
12 { return (3 * y) - cos(y) - 2; }
+
+
+
+ +

◆ eqd()

+ +
+
+ + + + + +
+ + + + + + + + +
static float eqd (float y)
+
+static
+
+

equation 2

+\[f(y) = \frac{\cos y+2}{2}\] +

+
17 { return 0.5 * (cos(y) + 2); }
+
+
+
+ +

◆ main()

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

Main function

+
20  {
+
21  float y, x1, x2, x3, sum, s, a, f1, f2, gd;
+
22  int i, n;
+
23 
+
24  for (i = 0; i < 10; i++) {
+
25  sum = eq(y);
+
26  std::cout << "value of equation at " << i << " " << sum << "\n";
+
27  y++;
+
28  }
+
29  std::cout << "enter the x1->";
+
30  std::cin >> x1;
+
31  std::cout << "enter the no iteration to perform->\n";
+
32  std::cin >> n;
+
33 
+
34  for (i = 0; i <= n; i++) {
+
35  x2 = eqd(x1);
+
36  std::cout << "\nenter the x2->" << x2;
+
37  x1 = x2;
+
38  }
+
39  return 0;
+
40 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
T cos(T... args)
+
static float eqd(float y)
Definition: successive_approximation.cpp:17
+ +
static float eq(float y)
Definition: successive_approximation.cpp:12
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+ + + + + diff --git a/df/dc8/successive__approximation_8cpp.js b/df/dc8/successive__approximation_8cpp.js new file mode 100644 index 000000000..c3c57bb36 --- /dev/null +++ b/df/dc8/successive__approximation_8cpp.js @@ -0,0 +1,6 @@ +var successive__approximation_8cpp = +[ + [ "eq", "df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389", null ], + [ "eqd", "df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456", null ], + [ "main", "df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ] +]; \ No newline at end of file diff --git a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..653505fa5 --- /dev/null +++ b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..e54cdbc1d --- /dev/null +++ b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +102ab08fa39138d36326dbf570699389 \ No newline at end of file diff --git a/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..8c6ef6fa5 --- /dev/null +++ b/df/dc8/successive__approximation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +eq + + + + + +Node1->Node2 + + + + + +Node3 + + +eqd + + + + + +Node1->Node3 + + + + + diff --git a/df/dd4/stairs__pattern_8cpp__incl.map b/df/dd4/stairs__pattern_8cpp__incl.map new file mode 100644 index 000000000..3ca4b1bf4 --- /dev/null +++ b/df/dd4/stairs__pattern_8cpp__incl.map @@ -0,0 +1,4 @@ + + + + diff --git a/df/dd4/stairs__pattern_8cpp__incl.md5 b/df/dd4/stairs__pattern_8cpp__incl.md5 new file mode 100644 index 000000000..a4b52e183 --- /dev/null +++ b/df/dd4/stairs__pattern_8cpp__incl.md5 @@ -0,0 +1 @@ +405d5e7494690bc8e281593bd63860b1 \ No newline at end of file diff --git a/df/dd4/stairs__pattern_8cpp__incl.svg b/df/dd4/stairs__pattern_8cpp__incl.svg new file mode 100644 index 000000000..0437ced31 --- /dev/null +++ b/df/dd4/stairs__pattern_8cpp__incl.svg @@ -0,0 +1,37 @@ + + + + + + +others/stairs_pattern.cpp + + + +Node1 + + +others/stairs_pattern.cpp + + + + + +Node2 + + +iostream + + + + + +Node1->Node2 + + + + + diff --git a/df/dd5/binary__search_8cpp.html b/df/dd5/binary__search_8cpp.html new file mode 100644 index 000000000..13d1a8ba2 --- /dev/null +++ b/df/dd5/binary__search_8cpp.html @@ -0,0 +1,257 @@ + + + + + + + +Algorithms_in_C++: search/binary_search.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
binary_search.cpp File Reference
+
+
+ +

Binary search algorithm +More...

+
#include <iostream>
+
+Include dependency graph for binary_search.cpp:
+
+
+
+
+
+ + + + + +

+Functions

int binary_search (int a[], int r, int key)
 
int main (int argc, char const *argv[])
 
+

Detailed Description

+

Function Documentation

+ +

◆ binary_search()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int binary_search (int a[],
int r,
int key 
)
+
+

binary_search function

Parameters
+ + + + +
[in]aarray to sort
[in]rright hand limit = \(n-1\)
[in]keyvalue to find
+
+
+
Returns
index if T is found
+
+-1 if T is not found
+
15  {
+
16  int l = 0;
+
17 
+
18  while (l <= r) {
+
19  int m = l + (r - l) / 2;
+
20  if (key == a[m])
+
21  return m;
+
22  else if (key < a[m])
+
23  r = m - 1;
+
24  else
+
25  l = m + 1;
+
26  }
+
27  return -1;
+
28 }
+
+
+
+ +

◆ main()

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

main function

+
31  {
+
32  int n, key;
+
33  std::cout << "Enter size of array: ";
+
34  std::cin >> n;
+
35  std::cout << "Enter array elements: ";
+
36 
+
37  int* a = new int[n];
+
38 
+
39  // this loop use for store value in Array
+
40  for (int i = 0; i < n; i++) {
+
41  std::cin >> a[i];
+
42  }
+
43 
+
44  std::cout << "Enter search key: ";
+
45  std::cin >> key;
+
46 
+
47  // this is use for find value in given array
+
48  int res = binary_search(a, n - 1, key);
+
49  if (res != -1)
+
50  std::cout << key << " found at index " << res << std::endl;
+
51  else
+
52  std::cout << key << " not found" << std::endl;
+
53 
+
54  delete[] a;
+
55  return 0;
+
56 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+ +
int binary_search(int a[], int r, int key)
Definition: binary_search.cpp:15
+
vector< ll > a
Definition: matrix_exponentiation.cpp:53
+
T endl(T... args)
+ + + + + diff --git a/df/dd5/binary__search_8cpp.js b/df/dd5/binary__search_8cpp.js new file mode 100644 index 000000000..219f31a08 --- /dev/null +++ b/df/dd5/binary__search_8cpp.js @@ -0,0 +1,5 @@ +var binary__search_8cpp = +[ + [ "binary_search", "df/dd5/binary__search_8cpp.html#a78df202b718cfe3c2c9216979b08298d", null ], + [ "main", "df/dd5/binary__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089", null ] +]; \ No newline at end of file diff --git a/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map new file mode 100644 index 000000000..93cf4ec5d --- /dev/null +++ b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 new file mode 100644 index 000000000..d5a63e829 --- /dev/null +++ b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.md5 @@ -0,0 +1 @@ +9acab01bae3e42b3a24ada6558bec4f3 \ No newline at end of file diff --git a/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg new file mode 100644 index 000000000..fa9f41259 --- /dev/null +++ b/df/dd5/binary__search_8cpp_abf9e6b7e6f15df4b525a2e7705ba3089_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +binary_search + + + + + +Node1->Node2 + + + + + +Node3 + + +std::endl + + + + + +Node1->Node3 + + + + + diff --git a/df/dd7/structlinkedlist-members.html b/df/dd7/structlinkedlist-members.html new file mode 100644 index 000000000..f1b23b75d --- /dev/null +++ b/df/dd7/structlinkedlist-members.html @@ -0,0 +1,113 @@ + + + + + + + +Algorithms_in_C++: Member List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
linkedlist Member List
+
+
+ +

This is the complete list of members for linkedlist, including all inherited members.

+ + + +
data (defined in linkedlist)linkedlist
next (defined in linkedlist)linkedlist
+
+ + + + diff --git a/df/ddc/struct_node__coll__graph.map b/df/ddc/struct_node__coll__graph.map new file mode 100644 index 000000000..fabbe5c8f --- /dev/null +++ b/df/ddc/struct_node__coll__graph.map @@ -0,0 +1,3 @@ + + + diff --git a/df/ddc/struct_node__coll__graph.md5 b/df/ddc/struct_node__coll__graph.md5 new file mode 100644 index 000000000..af23d5d0c --- /dev/null +++ b/df/ddc/struct_node__coll__graph.md5 @@ -0,0 +1 @@ +6d52568ff645f92b7b7485c4f03983fb \ No newline at end of file diff --git a/df/ddc/struct_node__coll__graph.svg b/df/ddc/struct_node__coll__graph.svg new file mode 100644 index 000000000..4dc85a45f --- /dev/null +++ b/df/ddc/struct_node__coll__graph.svg @@ -0,0 +1,29 @@ + + + + + + +Node + + + +Node1 + + +Node + + + + + +Node1->Node1 + + + next + + + diff --git a/df/def/power__for__huge__numbers_8cpp.html b/df/def/power__for__huge__numbers_8cpp.html new file mode 100644 index 000000000..19e0752be --- /dev/null +++ b/df/def/power__for__huge__numbers_8cpp.html @@ -0,0 +1,327 @@ + + + + + + + +Algorithms_in_C++: math/power_for_huge_numbers.cpp File Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+ +
+
power_for_huge_numbers.cpp File Reference
+
+
+ +

Compute powers of large numbers. +More...

+
#include <iostream>
+
+Include dependency graph for power_for_huge_numbers.cpp:
+
+
+
+
+
+ + + +

+Macros

#define MAX   100000
 
+ + + + + + + +

+Functions

int multiply (int x, int res[], int res_size)
 
void power (int x, int n)
 
int main ()
 
+

Detailed Description

+

Compute powers of large numbers.

+

Macro Definition Documentation

+ +

◆ MAX

+ +
+
+ + + + +
#define MAX   100000
+
+

Maximum number of digits in output \(x^n\) where \(1 <= x,\; n <= 10000\) and overflow may happen

+ +
+
+

Function Documentation

+ +

◆ main()

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

Main function

+
82  {
+
83  int exponent, base;
+
84  std::cout << "Enter base ";
+
85  std::cin >> base;
+
86  std::cout << "Enter exponent ";
+
87  std::cin >> exponent;
+
88  power(base, exponent);
+
89  return 0;
+
90 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+ +

◆ multiply()

+ +
+
+ + + + + + + + + + + + + + + + + + + + + + + + +
int multiply (int x,
int res[],
int res_size 
)
+
+

This function multiplies x with the number represented by res[]. res_size is size of res[] or number of digits in the number represented by res[]. This function uses simple school mathematics for multiplication. This function may value of res_size and returns the new value of res_size

Parameters
+ + + + +
xmultiplicand
reslarge number representation using array
res_sizenumber of digits in res
+
+
+
25  {
+
26  // Initialize carry
+
27  int carry = 0;
+
28 
+
29  // One by one multiply n with
+
30  // individual digits of res[]
+
31  for (int i = 0; i < res_size; i++) {
+
32  int prod = res[i] * x + carry;
+
33 
+
34  // Store last digit of
+
35  // 'prod' in res[]
+
36  res[i] = prod % 10;
+
37 
+
38  // Put rest in carry
+
39  carry = prod / 10;
+
40  }
+
41 
+
42  // Put carry in res and
+
43  // increase result size
+
44  while (carry) {
+
45  res[res_size] = carry % 10;
+
46  carry = carry / 10;
+
47  res_size++;
+
48  }
+
49  return res_size;
+
50 }
+
+
+
+ +

◆ power()

+ +
+
+ + + + + + + + + + + + + + + + + + +
void power (int x,
int n 
)
+
+

This function finds power of a number x and print \(x^n\)

Parameters
+ + + +
xbase
nexponent
+
+
+
56  {
+
57  // printing value "1" for power = 0
+
58  if (n == 0) {
+
59  std::cout << "1";
+
60  return;
+
61  }
+
62 
+
63  int res[MAX];
+
64  int res_size = 0;
+
65  int temp = x;
+
66 
+
67  // Initialize result
+
68  while (temp != 0) {
+
69  res[res_size++] = temp % 10;
+
70  temp = temp / 10;
+
71  }
+
72 
+
73  // Multiply x n times
+
74  // (x^n = x*x*x....n times)
+
75  for (int i = 2; i <= n; i++) res_size = multiply(x, res, res_size);
+
76 
+
77  std::cout << x << "^" << n << " = ";
+
78  for (int i = res_size - 1; i >= 0; i--) std::cout << res[i];
+
79 }
+
+Here is the call graph for this function:
+
+
+
+
+ +
+
+
+
+
int multiply(int x, int res[], int res_size)
Definition: power_for_huge_numbers.cpp:25
+
void power(int x, int n)
Definition: power_for_huge_numbers.cpp:56
+ + +
#define MAX
Definition: power_for_huge_numbers.cpp:10
+ + + + diff --git a/df/def/power__for__huge__numbers_8cpp.js b/df/def/power__for__huge__numbers_8cpp.js new file mode 100644 index 000000000..2e461d67f --- /dev/null +++ b/df/def/power__for__huge__numbers_8cpp.js @@ -0,0 +1,7 @@ +var power__for__huge__numbers_8cpp = +[ + [ "MAX", "df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326", null ], + [ "main", "df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ], + [ "multiply", "df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9", null ], + [ "power", "df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f", null ] +]; \ No newline at end of file diff --git a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map new file mode 100644 index 000000000..961b5589e --- /dev/null +++ b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.map @@ -0,0 +1,4 @@ + + + + diff --git a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5 b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5 new file mode 100644 index 000000000..434461bea --- /dev/null +++ b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.md5 @@ -0,0 +1 @@ +3df9151c06eddefd14e3d2ded32ac1dc \ No newline at end of file diff --git a/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg new file mode 100644 index 000000000..b57054db4 --- /dev/null +++ b/df/def/power__for__huge__numbers_8cpp_ae249a2af508aa94266023ce8aa81426f_cgraph.svg @@ -0,0 +1,37 @@ + + + + + + +power + + + +Node1 + + +power + + + + + +Node2 + + +multiply + + + + + +Node1->Node2 + + + + + diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map new file mode 100644 index 000000000..084737ff6 --- /dev/null +++ b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -0,0 +1,5 @@ + + + + + diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 new file mode 100644 index 000000000..605326aa9 --- /dev/null +++ b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -0,0 +1 @@ +dd50750aecb0f8138266b6e1aebb276d \ No newline at end of file diff --git a/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg new file mode 100644 index 000000000..6afb0c4d8 --- /dev/null +++ b/df/def/power__for__huge__numbers_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -0,0 +1,52 @@ + + + + + + +main + + + +Node1 + + +main + + + + + +Node2 + + +power + + + + + +Node1->Node2 + + + + + +Node3 + + +multiply + + + + + +Node2->Node3 + + + + + diff --git a/dir_074119ce3a874b57120c49a0cc4bb5ad.html b/dir_074119ce3a874b57120c49a0cc4bb5ad.html new file mode 100644 index 000000000..da4750ba5 --- /dev/null +++ b/dir_074119ce3a874b57120c49a0cc4bb5ad.html @@ -0,0 +1,109 @@ + + + + + + + +Algorithms_in_C++: range_queries Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
range_queries Directory Reference
+
+
+
+
+ + + + diff --git a/dir_0eaa691bd54ab0922ca7f50599de6d22.html b/dir_0eaa691bd54ab0922ca7f50599de6d22.html new file mode 100644 index 000000000..8cdcdd69c --- /dev/null +++ b/dir_0eaa691bd54ab0922ca7f50599de6d22.html @@ -0,0 +1,109 @@ + + + + + + + +Algorithms_in_C++: greedy_algorithms Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
greedy_algorithms Directory Reference
+
+
+
+
+ + + + diff --git a/dir_12552d7fa429bf94a2e32e5cf39f7e69.html b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html new file mode 100644 index 000000000..49cead8ea --- /dev/null +++ b/dir_12552d7fa429bf94a2e32e5cf39f7e69.html @@ -0,0 +1,109 @@ + + + + + + + +Algorithms_in_C++: graph Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
graph Directory Reference
+
+
+
+
+ + + + diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.html b/dir_19b2bf9199a15c634a08b1ede1dd896a.html new file mode 100644 index 000000000..98e63cb62 --- /dev/null +++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.html @@ -0,0 +1,143 @@ + + + + + + + +Algorithms_in_C++: search Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
search Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  binary_search.cpp
 Binary search algorithm
 
file  exponential_search.cpp
 Exponential search algorithm
 
file  hash_search.cpp
 Hash Search Algorithm - Best Time Complexity Ω(1)
 
file  interpolation_search.cpp
 Interpolation search algorithm
 
file  interpolation_search2.cpp
 Interpolation search algorithm
 
file  jump_search.cpp
 C++ program to implement Jump Search
 
file  linear_search.cpp
 Linear search algorithm
 
file  median_search.cpp
 Median search algorithm
 
file  ternary_search.cpp
 Ternary search algorithm
 
file  text_search.cpp
 Search for words in a long textual paragraph.
 
+
+
+ + + + diff --git a/dir_19b2bf9199a15c634a08b1ede1dd896a.js b/dir_19b2bf9199a15c634a08b1ede1dd896a.js new file mode 100644 index 000000000..40f90c0ce --- /dev/null +++ b/dir_19b2bf9199a15c634a08b1ede1dd896a.js @@ -0,0 +1,13 @@ +var dir_19b2bf9199a15c634a08b1ede1dd896a = +[ + [ "binary_search.cpp", "df/dd5/binary__search_8cpp.html", "df/dd5/binary__search_8cpp" ], + [ "exponential_search.cpp", "d8/d8a/exponential__search_8cpp.html", "d8/d8a/exponential__search_8cpp" ], + [ "hash_search.cpp", "d1/df3/hash__search_8cpp.html", "d1/df3/hash__search_8cpp" ], + [ "interpolation_search.cpp", "d9/dd7/interpolation__search_8cpp.html", "d9/dd7/interpolation__search_8cpp" ], + [ "interpolation_search2.cpp", "df/d39/interpolation__search2_8cpp.html", "df/d39/interpolation__search2_8cpp" ], + [ "jump_search.cpp", "d2/d22/jump__search_8cpp.html", "d2/d22/jump__search_8cpp" ], + [ "linear_search.cpp", "d9/d02/linear__search_8cpp.html", "d9/d02/linear__search_8cpp" ], + [ "median_search.cpp", "d9/d69/median__search_8cpp.html", "d9/d69/median__search_8cpp" ], + [ "ternary_search.cpp", "dc/dfe/ternary__search_8cpp.html", "dc/dfe/ternary__search_8cpp" ], + [ "text_search.cpp", "dc/db5/text__search_8cpp.html", "dc/db5/text__search_8cpp" ] +]; \ No newline at end of file diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.html b/dir_296d53ceaeaa7e099814a6def439fe8a.html new file mode 100644 index 000000000..c53f9b4b9 --- /dev/null +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.html @@ -0,0 +1,190 @@ + + + + + + + +Algorithms_in_C++: math Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
math Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  binary_exponent.cpp
 C++ Program to find Binary Exponent Iteratively and Recursively.
 
file  check_prime.cpp
 Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime.
 
file  double_factorial.cpp
 Compute double factorial: \(n!!\).
 
file  eulers_totient_function.cpp
 C++ Program to find Euler's Totient function.
 
file  extended_euclid_algorithm.cpp
 GCD using extended Euclid's algorithm
 
file  factorial.cpp
 C++ program to find factorial of given number.
 
file  fast_power.cpp
 Faster computation for \(a^b\).
 
file  fibonacci.cpp
 Generate fibonacci sequence.
 
file  fibonacci_fast.cpp
 Faster computation of Fibonacci series.
 
file  fibonacci_large.cpp
 Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations.
 
file  gcd_iterative_euclidean.cpp
 Compute the greatest common denominator of two integers using iterative form of Euclidean algorithm
 
file  gcd_of_n_numbers.cpp
 This program aims at calculating the GCD of n numbers by division method.
 
file  gcd_recursive_euclidean.cpp
 Compute the greatest common denominator of two integers using recursive form of Euclidean algorithm
 
file  large_factorial.cpp
 Compute factorial of any arbitratily large number/.
 
file  large_number.h [code]
 Library to perform arithmatic operations on arbitrarily large numbers.
 
file  least_common_multiple.cpp
 
file  modular_inverse_fermat_little_theorem.cpp
 C++ Program to find the modular inverse using Fermat's Little Theorem
 
file  number_of_positive_divisors.cpp
 C++ Program to calculate number of divisors.
 
file  power_for_huge_numbers.cpp
 Compute powers of large numbers.
 
file  prime_factorization.cpp
 Prime factorization of positive integers.
 
file  prime_numbers.cpp
 Get list of prime numbers.
 
file  primes_up_to_billion.cpp
 Compute prime numbers upto 1 billion.
 
file  realtime_stats.cpp
 Compute statistics for data entered in rreal-time.
 
file  sieve_of_eratosthenes.cpp
 Get list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main).
 
file  sqrt_double.cpp
 Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding.
 
file  string_fibonacci.cpp
 This Programme returns the Nth fibonacci as a string.
 
+
+
+ + + + diff --git a/dir_296d53ceaeaa7e099814a6def439fe8a.js b/dir_296d53ceaeaa7e099814a6def439fe8a.js new file mode 100644 index 000000000..3f07b2a7b --- /dev/null +++ b/dir_296d53ceaeaa7e099814a6def439fe8a.js @@ -0,0 +1,31 @@ +var dir_296d53ceaeaa7e099814a6def439fe8a = +[ + [ "binary_exponent.cpp", "de/dcf/binary__exponent_8cpp.html", "de/dcf/binary__exponent_8cpp" ], + [ "check_prime.cpp", "db/d93/check__prime_8cpp.html", "db/d93/check__prime_8cpp" ], + [ "double_factorial.cpp", "d7/d89/double__factorial_8cpp.html", "d7/d89/double__factorial_8cpp" ], + [ "eulers_totient_function.cpp", "da/d23/eulers__totient__function_8cpp.html", "da/d23/eulers__totient__function_8cpp" ], + [ "extended_euclid_algorithm.cpp", "d9/d5d/extended__euclid__algorithm_8cpp.html", "d9/d5d/extended__euclid__algorithm_8cpp" ], + [ "factorial.cpp", "d9/d00/factorial_8cpp.html", "d9/d00/factorial_8cpp" ], + [ "fast_power.cpp", "d2/d0b/fast__power_8cpp.html", "d2/d0b/fast__power_8cpp" ], + [ "fibonacci.cpp", "d9/d89/fibonacci_8cpp.html", "d9/d89/fibonacci_8cpp" ], + [ "fibonacci_fast.cpp", "d4/d32/fibonacci__fast_8cpp.html", "d4/d32/fibonacci__fast_8cpp" ], + [ "fibonacci_large.cpp", "de/de4/fibonacci__large_8cpp.html", "de/de4/fibonacci__large_8cpp" ], + [ "gcd_iterative_euclidean.cpp", "d4/da0/gcd__iterative__euclidean_8cpp.html", "d4/da0/gcd__iterative__euclidean_8cpp" ], + [ "gcd_of_n_numbers.cpp", "d1/d11/gcd__of__n__numbers_8cpp.html", "d1/d11/gcd__of__n__numbers_8cpp" ], + [ "gcd_recursive_euclidean.cpp", "d4/d45/gcd__recursive__euclidean_8cpp.html", "d4/d45/gcd__recursive__euclidean_8cpp" ], + [ "large_factorial.cpp", "d6/d9d/large__factorial_8cpp.html", "d6/d9d/large__factorial_8cpp" ], + [ "large_number.h", "d4/d86/large__number_8h.html", [ + [ "large_number", "db/d82/classlarge__number.html", "db/d82/classlarge__number" ] + ] ], + [ "least_common_multiple.cpp", "d4/d21/least__common__multiple_8cpp.html", "d4/d21/least__common__multiple_8cpp" ], + [ "modular_inverse_fermat_little_theorem.cpp", "d8/d53/modular__inverse__fermat__little__theorem_8cpp.html", "d8/d53/modular__inverse__fermat__little__theorem_8cpp" ], + [ "number_of_positive_divisors.cpp", "d0/da2/number__of__positive__divisors_8cpp.html", "d0/da2/number__of__positive__divisors_8cpp" ], + [ "power_for_huge_numbers.cpp", "df/def/power__for__huge__numbers_8cpp.html", "df/def/power__for__huge__numbers_8cpp" ], + [ "prime_factorization.cpp", "db/d0d/prime__factorization_8cpp.html", "db/d0d/prime__factorization_8cpp" ], + [ "prime_numbers.cpp", "de/d9b/prime__numbers_8cpp.html", "de/d9b/prime__numbers_8cpp" ], + [ "primes_up_to_billion.cpp", "d4/d9c/primes__up__to__billion_8cpp.html", "d4/d9c/primes__up__to__billion_8cpp" ], + [ "realtime_stats.cpp", "d0/d08/realtime__stats_8cpp.html", "d0/d08/realtime__stats_8cpp" ], + [ "sieve_of_eratosthenes.cpp", "d8/ddf/sieve__of__eratosthenes_8cpp.html", "d8/ddf/sieve__of__eratosthenes_8cpp" ], + [ "sqrt_double.cpp", "da/d24/sqrt__double_8cpp.html", "da/d24/sqrt__double_8cpp" ], + [ "string_fibonacci.cpp", "de/d47/string__fibonacci_8cpp.html", "de/d47/string__fibonacci_8cpp" ] +]; \ No newline at end of file diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html new file mode 100644 index 000000000..0c44fdf0a --- /dev/null +++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html @@ -0,0 +1,131 @@ + + + + + + + +Algorithms_in_C++: data_structures Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
data_structures Directory Reference
+
+
+ + +

+Directories

+ + + + + + + + + + + + + + + + +

+Files

file  avltree.cpp
 A simple tree implementation using nodes.
 
file  binary_search_tree.cpp
 A simple tree implementation using structured nodes.
 
file  binaryheap.cpp
 A C++ program to demonstrate common Binary Heap Operations.
 
file  linkedlist_implentation_usingarray.cpp
 Linked list implementation using Arrays.
 
file  trie_modern.cpp
 A basic implementation of trie class to store only lower-case strings.
 
+
+
+ + + + diff --git a/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js new file mode 100644 index 000000000..747c3f6ea --- /dev/null +++ b/dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js @@ -0,0 +1,11 @@ +var dir_2e746e9d06bf2d8ff842208bcc6ebcfc = +[ + [ "cll", "dir_f1797d0c2a0a12033e7d74efffeb14e1.html", "dir_f1797d0c2a0a12033e7d74efffeb14e1" ], + [ "avltree.cpp", "d8/dee/avltree_8cpp.html", "d8/dee/avltree_8cpp" ], + [ "binary_search_tree.cpp", "d3/d26/binary__search__tree_8cpp.html", "d3/d26/binary__search__tree_8cpp" ], + [ "binaryheap.cpp", "de/dc3/binaryheap_8cpp.html", "de/dc3/binaryheap_8cpp" ], + [ "linkedlist_implentation_usingarray.cpp", "d3/dce/linkedlist__implentation__usingarray_8cpp.html", "d3/dce/linkedlist__implentation__usingarray_8cpp" ], + [ "queue.h", "d8/d38/queue_8h_source.html", null ], + [ "stack.h", "d7/de0/stack_8h_source.html", null ], + [ "trie_modern.cpp", "dc/d93/trie__modern_8cpp.html", "dc/d93/trie__modern_8cpp" ] +]; \ No newline at end of file diff --git a/dir_3343723ae086de42ee4ca9774da3a13f.html b/dir_3343723ae086de42ee4ca9774da3a13f.html new file mode 100644 index 000000000..36b92cde6 --- /dev/null +++ b/dir_3343723ae086de42ee4ca9774da3a13f.html @@ -0,0 +1,122 @@ + + + + + + + +Algorithms_in_C++: machine_learning Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
machine_learning Directory Reference
+
+
+ + + + + + + + + + + +

+Files

file  adaline_learning.cpp
 Adaptive Linear Neuron (ADALINE) implementation
 
file  kohonen_som_topology.cpp
 Kohonen self organizing map (topological map)
 
file  kohonen_som_trace.cpp
 Kohonen self organizing map (data tracing)
 
+
+
+ + + + diff --git a/dir_3343723ae086de42ee4ca9774da3a13f.js b/dir_3343723ae086de42ee4ca9774da3a13f.js new file mode 100644 index 000000000..745891418 --- /dev/null +++ b/dir_3343723ae086de42ee4ca9774da3a13f.js @@ -0,0 +1,6 @@ +var dir_3343723ae086de42ee4ca9774da3a13f = +[ + [ "adaline_learning.cpp", "d5/db0/adaline__learning_8cpp.html", "d5/db0/adaline__learning_8cpp" ], + [ "kohonen_som_topology.cpp", "d4/def/kohonen__som__topology_8cpp.html", "d4/def/kohonen__som__topology_8cpp" ], + [ "kohonen_som_trace.cpp", "d9/d49/kohonen__som__trace_8cpp.html", "d9/d49/kohonen__som__trace_8cpp" ] +]; \ No newline at end of file diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.html b/dir_35422be6552f1b3672c1b6c4aba2da64.html new file mode 100644 index 000000000..7ec1be916 --- /dev/null +++ b/dir_35422be6552f1b3672c1b6c4aba2da64.html @@ -0,0 +1,109 @@ + + + + + + + +Algorithms_in_C++: operations_on_datastructures Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
operations_on_datastructures Directory Reference
+
+
+
+
+ + + + diff --git a/dir_73a3cc5065b223eb41b02873c0e19f0e.html b/dir_73a3cc5065b223eb41b02873c0e19f0e.html new file mode 100644 index 000000000..e2166adaf --- /dev/null +++ b/dir_73a3cc5065b223eb41b02873c0e19f0e.html @@ -0,0 +1,122 @@ + + + + + + + +Algorithms_in_C++: strings Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
strings Directory Reference
+
+
+ + + + + + + + + + + +

+Files

file  brute_force_string_searching.cpp
 String pattern search - brute force.
 
file  knuth_morris_pratt.cpp
 The Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m)
 
file  rabin_karp.cpp
 The Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m)
 
+
+
+ + + + diff --git a/dir_73a3cc5065b223eb41b02873c0e19f0e.js b/dir_73a3cc5065b223eb41b02873c0e19f0e.js new file mode 100644 index 000000000..c20e50ca5 --- /dev/null +++ b/dir_73a3cc5065b223eb41b02873c0e19f0e.js @@ -0,0 +1,6 @@ +var dir_73a3cc5065b223eb41b02873c0e19f0e = +[ + [ "brute_force_string_searching.cpp", "d3/d7d/brute__force__string__searching_8cpp.html", "d3/d7d/brute__force__string__searching_8cpp" ], + [ "knuth_morris_pratt.cpp", "de/d6a/knuth__morris__pratt_8cpp.html", "de/d6a/knuth__morris__pratt_8cpp" ], + [ "rabin_karp.cpp", "d6/dce/rabin__karp_8cpp.html", "d6/dce/rabin__karp_8cpp" ] +]; \ No newline at end of file diff --git a/dir_82e494173a87936756866de2fa774307.html b/dir_82e494173a87936756866de2fa774307.html new file mode 100644 index 000000000..5afe1aa1f --- /dev/null +++ b/dir_82e494173a87936756866de2fa774307.html @@ -0,0 +1,125 @@ + + + + + + + +Algorithms_in_C++: probability Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
probability Directory Reference
+
+
+ + + + + + + + + + + + + + +

+Files

file  addition_rule.cpp
 Addition rule of probabilities.
 
file  bayes_theorem.cpp
 Bayes' theorem
 
file  binomial_dist.cpp
 Binomial distribution example
 
file  poisson_dist.cpp
 Poisson statistics
 
+
+
+ + + + diff --git a/dir_82e494173a87936756866de2fa774307.js b/dir_82e494173a87936756866de2fa774307.js new file mode 100644 index 000000000..26c72285d --- /dev/null +++ b/dir_82e494173a87936756866de2fa774307.js @@ -0,0 +1,7 @@ +var dir_82e494173a87936756866de2fa774307 = +[ + [ "addition_rule.cpp", "d6/d4a/addition__rule_8cpp.html", "d6/d4a/addition__rule_8cpp" ], + [ "bayes_theorem.cpp", "d5/d67/bayes__theorem_8cpp.html", "d5/d67/bayes__theorem_8cpp" ], + [ "binomial_dist.cpp", "d6/db0/binomial__dist_8cpp.html", "d6/db0/binomial__dist_8cpp" ], + [ "poisson_dist.cpp", "d9/d24/poisson__dist_8cpp.html", "d9/d24/poisson__dist_8cpp" ] +]; \ No newline at end of file diff --git a/dir_8a20dd5bfd5341a725342bf72b6b686f.html b/dir_8a20dd5bfd5341a725342bf72b6b686f.html new file mode 100644 index 000000000..a24da4573 --- /dev/null +++ b/dir_8a20dd5bfd5341a725342bf72b6b686f.html @@ -0,0 +1,109 @@ + + + + + + + +Algorithms_in_C++: dynamic_programming Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
dynamic_programming Directory Reference
+
+
+
+
+ + + + diff --git a/dir_9510827d0b234b3cc54b29892f217477.html b/dir_9510827d0b234b3cc54b29892f217477.html new file mode 100644 index 000000000..c73822a18 --- /dev/null +++ b/dir_9510827d0b234b3cc54b29892f217477.html @@ -0,0 +1,163 @@ + + + + + + + +Algorithms_in_C++: others Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
others Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  buzz_number.cpp
 A buzz number is a number that is either divisible by 7 or has last digit as 7.
 
file  decimal_to_binary.cpp
 Function to convert decimal number to binary representation.
 
file  decimal_to_hexadecimal.cpp
 Convert decimal number to hexadecimal representation.
 
file  decimal_to_roman_numeral.cpp
 This Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral.
 
file  fast_interger_input.cpp
 Read integers from stdin continuously as they are entered without waiting for the \n character.
 
file  happy_number.cpp
 A happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1.
 
file  matrix_exponentiation.cpp
 Matrix Exponentiation.
 
file  palindrome_of_number.cpp
 Check if a number is palindrome or not.
 
file  paranthesis_matching.cpp
 Perform paranthesis matching.
 
file  pascal_triangle.cpp
 Pascal's triangle implementation.
 
file  primality_test.cpp
 Primality test implementation.
 
file  smallest_circle.cpp
 Get centre and radius of the smallest circle that circumscribes given set of points.
 
file  sparse_matrix.cpp
 
file  spiral_print.cpp
 Print the elements of a matrix traversing it spirally.
 
file  stairs_pattern.cpp
 This program is use to print the following pattern.
 
file  tower_of_hanoi.cpp
 Solve the Tower of Hanoi problem.
 
file  vector_important_functions.cpp
 A C++ program to demonstrate working of std::sort(), std::reverse()
 
+
+
+ + + + diff --git a/dir_9510827d0b234b3cc54b29892f217477.js b/dir_9510827d0b234b3cc54b29892f217477.js new file mode 100644 index 000000000..830e7974b --- /dev/null +++ b/dir_9510827d0b234b3cc54b29892f217477.js @@ -0,0 +1,20 @@ +var dir_9510827d0b234b3cc54b29892f217477 = +[ + [ "buzz_number.cpp", "d1/d76/buzz__number_8cpp.html", "d1/d76/buzz__number_8cpp" ], + [ "decimal_to_binary.cpp", "df/d06/decimal__to__binary_8cpp.html", "df/d06/decimal__to__binary_8cpp" ], + [ "decimal_to_hexadecimal.cpp", "da/de7/decimal__to__hexadecimal_8cpp.html", "da/de7/decimal__to__hexadecimal_8cpp" ], + [ "decimal_to_roman_numeral.cpp", "de/d85/decimal__to__roman__numeral_8cpp.html", "de/d85/decimal__to__roman__numeral_8cpp" ], + [ "fast_interger_input.cpp", "d4/de8/fast__interger__input_8cpp.html", "d4/de8/fast__interger__input_8cpp" ], + [ "happy_number.cpp", "db/df3/happy__number_8cpp.html", "db/df3/happy__number_8cpp" ], + [ "matrix_exponentiation.cpp", "d7/d35/matrix__exponentiation_8cpp.html", "d7/d35/matrix__exponentiation_8cpp" ], + [ "palindrome_of_number.cpp", "da/d9a/palindrome__of__number_8cpp.html", "da/d9a/palindrome__of__number_8cpp" ], + [ "paranthesis_matching.cpp", "dc/dc5/paranthesis__matching_8cpp.html", "dc/dc5/paranthesis__matching_8cpp" ], + [ "pascal_triangle.cpp", "dc/d1a/pascal__triangle_8cpp.html", "dc/d1a/pascal__triangle_8cpp" ], + [ "primality_test.cpp", "da/d7b/primality__test_8cpp.html", "da/d7b/primality__test_8cpp" ], + [ "smallest_circle.cpp", "d0/d01/smallest__circle_8cpp.html", "d0/d01/smallest__circle_8cpp" ], + [ "sparse_matrix.cpp", "d3/d19/sparse__matrix_8cpp.html", "d3/d19/sparse__matrix_8cpp" ], + [ "spiral_print.cpp", "db/d07/spiral__print_8cpp.html", "db/d07/spiral__print_8cpp" ], + [ "stairs_pattern.cpp", "d5/def/stairs__pattern_8cpp.html", "d5/def/stairs__pattern_8cpp" ], + [ "tower_of_hanoi.cpp", "db/d3c/tower__of__hanoi_8cpp.html", "db/d3c/tower__of__hanoi_8cpp" ], + [ "vector_important_functions.cpp", "d3/d61/vector__important__functions_8cpp.html", "d3/d61/vector__important__functions_8cpp" ] +]; \ No newline at end of file diff --git a/dir_9c6faab82c22511b50177aa2e38e2780.html b/dir_9c6faab82c22511b50177aa2e38e2780.html new file mode 100644 index 000000000..3bd8030b0 --- /dev/null +++ b/dir_9c6faab82c22511b50177aa2e38e2780.html @@ -0,0 +1,155 @@ + + + + + + + +Algorithms_in_C++: numerical_methods Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
numerical_methods Directory Reference
+
+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Files

file  bisection_method.cpp
 Solve the equation \(f(x)=0\) using bisection method
 
file  durand_kerner_roots.cpp
 Compute all possible approximate roots of any given polynomial using Durand Kerner algorithm
 
file  false_position.cpp
 Solve the equation \(f(x)=0\) using false position method, also known as the Secant method.
 
file  gaussian_elimination.cpp
 Gaussian elimination method
 
file  lu_decompose.cpp
 LU decomposition of a square matrix
 
file  newton_raphson_method.cpp
 Solve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions.
 
file  ode_forward_euler.cpp
 Solve a multivariable first order ordinary differential equation (ODEs) using forward Euler method
 
file  ode_midpoint_euler.cpp
 Solve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method
 
file  ode_semi_implicit_euler.cpp
 Solve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method
 
file  ordinary_least_squares_regressor.cpp
 Linear regression example using Ordinary least squares
 
file  qr_decompose.h [code]
 Library functions to compute QR decomposition of a given matrix.
 
file  qr_decomposition.cpp
 Program to compute the QR decomposition of a given matrix.
 
file  qr_eigen_values.cpp
 Compute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method.
 
file  successive_approximation.cpp
 Method of successive approximations using fixed-point iteration method.
 
+
+
+ + + + diff --git a/dir_9c6faab82c22511b50177aa2e38e2780.js b/dir_9c6faab82c22511b50177aa2e38e2780.js new file mode 100644 index 000000000..a6f0bb38d --- /dev/null +++ b/dir_9c6faab82c22511b50177aa2e38e2780.js @@ -0,0 +1,17 @@ +var dir_9c6faab82c22511b50177aa2e38e2780 = +[ + [ "bisection_method.cpp", "d7/d6a/bisection__method_8cpp.html", "d7/d6a/bisection__method_8cpp" ], + [ "durand_kerner_roots.cpp", "da/df2/durand__kerner__roots_8cpp.html", "da/df2/durand__kerner__roots_8cpp" ], + [ "false_position.cpp", "dd/d29/false__position_8cpp.html", "dd/d29/false__position_8cpp" ], + [ "gaussian_elimination.cpp", "d0/de2/gaussian__elimination_8cpp.html", "d0/de2/gaussian__elimination_8cpp" ], + [ "lu_decompose.cpp", "dd/d65/lu__decompose_8cpp.html", "dd/d65/lu__decompose_8cpp" ], + [ "newton_raphson_method.cpp", "de/dd3/newton__raphson__method_8cpp.html", "de/dd3/newton__raphson__method_8cpp" ], + [ "ode_forward_euler.cpp", "db/dd3/ode__forward__euler_8cpp.html", "db/dd3/ode__forward__euler_8cpp" ], + [ "ode_midpoint_euler.cpp", "d6/dd3/ode__midpoint__euler_8cpp.html", "d6/dd3/ode__midpoint__euler_8cpp" ], + [ "ode_semi_implicit_euler.cpp", "d3/d06/ode__semi__implicit__euler_8cpp.html", "d3/d06/ode__semi__implicit__euler_8cpp" ], + [ "ordinary_least_squares_regressor.cpp", "dc/d38/ordinary__least__squares__regressor_8cpp.html", "dc/d38/ordinary__least__squares__regressor_8cpp" ], + [ "qr_decompose.h", "d4/d68/qr__decompose_8h.html", "d4/d68/qr__decompose_8h" ], + [ "qr_decomposition.cpp", "d3/d24/qr__decomposition_8cpp.html", "d3/d24/qr__decomposition_8cpp" ], + [ "qr_eigen_values.cpp", "de/d75/qr__eigen__values_8cpp.html", "de/d75/qr__eigen__values_8cpp" ], + [ "successive_approximation.cpp", "df/dc8/successive__approximation_8cpp.html", "df/dc8/successive__approximation_8cpp" ] +]; \ No newline at end of file diff --git a/dir_bb1b521853a9c46347182a9d10420771.html b/dir_bb1b521853a9c46347182a9d10420771.html new file mode 100644 index 000000000..83e92a923 --- /dev/null +++ b/dir_bb1b521853a9c46347182a9d10420771.html @@ -0,0 +1,124 @@ + + + + + + + +Algorithms_in_C++: sorting Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
sorting Directory Reference
+
+
+ + + + + + + + + + + + + +

+Files

file  bubble_sort.cpp
 Bubble sort algorithm.
 
file  non_recursive_merge_sort.cpp
 
file  quick_sort.cpp
 Quick sort algorithm.
 
file  shell_sort2.cpp
 Shell sort algorithm
 
+
+
+ + + + diff --git a/dir_bb1b521853a9c46347182a9d10420771.js b/dir_bb1b521853a9c46347182a9d10420771.js new file mode 100644 index 000000000..4d9281033 --- /dev/null +++ b/dir_bb1b521853a9c46347182a9d10420771.js @@ -0,0 +1,7 @@ +var dir_bb1b521853a9c46347182a9d10420771 = +[ + [ "bubble_sort.cpp", "d8/d13/bubble__sort_8cpp.html", "d8/d13/bubble__sort_8cpp" ], + [ "non_recursive_merge_sort.cpp", "d0/db6/non__recursive__merge__sort_8cpp.html", "d0/db6/non__recursive__merge__sort_8cpp" ], + [ "quick_sort.cpp", "d1/d21/quick__sort_8cpp.html", "d1/d21/quick__sort_8cpp" ], + [ "shell_sort2.cpp", "d4/d7a/shell__sort2_8cpp.html", "d4/d7a/shell__sort2_8cpp" ] +]; \ No newline at end of file diff --git a/dir_c11585dfcef32a26e29098facab6c144.html b/dir_c11585dfcef32a26e29098facab6c144.html new file mode 100644 index 000000000..87e4608d9 --- /dev/null +++ b/dir_c11585dfcef32a26e29098facab6c144.html @@ -0,0 +1,109 @@ + + + + + + + +Algorithms_in_C++: backtracking Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
backtracking Directory Reference
+
+
+
+
+ + + + diff --git a/dir_e3380d2178455503f266746fb14246a5.html b/dir_e3380d2178455503f266746fb14246a5.html new file mode 100644 index 000000000..075590e96 --- /dev/null +++ b/dir_e3380d2178455503f266746fb14246a5.html @@ -0,0 +1,116 @@ + + + + + + + +Algorithms_in_C++: geometry Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
geometry Directory Reference
+
+
+ + + + + +

+Files

file  line_segment_intersection.cpp
 check whether two line segments intersect each other or not.
 
+
+
+ + + + diff --git a/dir_e3380d2178455503f266746fb14246a5.js b/dir_e3380d2178455503f266746fb14246a5.js new file mode 100644 index 000000000..b3c41b22a --- /dev/null +++ b/dir_e3380d2178455503f266746fb14246a5.js @@ -0,0 +1,4 @@ +var dir_e3380d2178455503f266746fb14246a5 = +[ + [ "line_segment_intersection.cpp", "d8/d6c/line__segment__intersection_8cpp.html", "d8/d6c/line__segment__intersection_8cpp" ] +]; \ No newline at end of file diff --git a/dir_ece9b94c107bbaa1dd68197a8c9983b9.html b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html new file mode 100644 index 000000000..e7cacab4b --- /dev/null +++ b/dir_ece9b94c107bbaa1dd68197a8c9983b9.html @@ -0,0 +1,109 @@ + + + + + + + +Algorithms_in_C++: hashing Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
hashing Directory Reference
+
+
+
+
+ + + + diff --git a/dir_f1797d0c2a0a12033e7d74efffeb14e1.html b/dir_f1797d0c2a0a12033e7d74efffeb14e1.html new file mode 100644 index 000000000..d3f6aebd9 --- /dev/null +++ b/dir_f1797d0c2a0a12033e7d74efffeb14e1.html @@ -0,0 +1,109 @@ + + + + + + + +Algorithms_in_C++: data_structures/cll Directory Reference + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
cll Directory Reference
+
+
+
+
+ + + + diff --git a/dir_f1797d0c2a0a12033e7d74efffeb14e1.js b/dir_f1797d0c2a0a12033e7d74efffeb14e1.js new file mode 100644 index 000000000..fef75ea2b --- /dev/null +++ b/dir_f1797d0c2a0a12033e7d74efffeb14e1.js @@ -0,0 +1,4 @@ +var dir_f1797d0c2a0a12033e7d74efffeb14e1 = +[ + [ "cll.h", "d7/dba/cll_8h_source.html", null ] +]; \ No newline at end of file diff --git a/doc.png b/doc.png new file mode 100644 index 0000000000000000000000000000000000000000..17edabff95f7b8da13c9516a04efe05493c29501 GIT binary patch literal 746 zcmV7=@pnbNXRFEm&G8P!&WHG=d)>K?YZ1bzou)2{$)) zumDct!>4SyxL;zgaG>wy`^Hv*+}0kUfCrz~BCOViSb$_*&;{TGGn2^x9K*!Sf0=lV zpP=7O;GA0*Jm*tTYj$IoXvimpnV4S1Z5f$p*f$Db2iq2zrVGQUz~yq`ahn7ck(|CE z7Gz;%OP~J6)tEZWDzjhL9h2hdfoU2)Nd%T<5Kt;Y0XLt&<@6pQx!nw*5`@bq#?l*?3z{Hlzoc=Pr>oB5(9i6~_&-}A(4{Q$>c>%rV&E|a(r&;?i5cQB=} zYSDU5nXG)NS4HEs0it2AHe2>shCyr7`6@4*6{r@8fXRbTA?=IFVWAQJL&H5H{)DpM#{W(GL+Idzf^)uRV@oB8u$ z8v{MfJbTiiRg4bza<41NAzrl{=3fl_D+$t+^!xlQ8S}{UtY`e z;;&9UhyZqQRN%2pot{*Ei0*4~hSF_3AH2@fKU!$NSflS>{@tZpDT4`M2WRTTVH+D? z)GFlEGGHe?koB}i|1w45!BF}N_q&^HJ&-tyR{(afC6H7|aml|tBBbv}55C5DNP8p3 z)~jLEO4Z&2hZmP^i-e%(@d!(E|KRafiU8Q5u(wU((j8un3OR*Hvj+t literal 0 HcmV?d00001 diff --git a/doxygen.css b/doxygen.css new file mode 100644 index 000000000..5e35db3f4 --- /dev/null +++ b/doxygen.css @@ -0,0 +1,1730 @@ +/* The standard CSS for doxygen 1.8.18 */ + +body, table, div, p, dl { + font: 400 14px/22px Roboto,sans-serif; +} + +p.reference, p.definition { + font: 400 14px/22px Roboto,sans-serif; +} + +/* @group Heading Levels */ + +h1.groupheader { + font-size: 150%; +} + +.title { + font: 400 14px/28px Roboto,sans-serif; + font-size: 150%; + font-weight: bold; + margin: 10px 2px; +} + +h2.groupheader { + border-bottom: 1px solid #879ECB; + color: #354C7B; + font-size: 150%; + font-weight: normal; + margin-top: 1.75em; + padding-top: 8px; + padding-bottom: 4px; + width: 100%; +} + +h3.groupheader { + font-size: 100%; +} + +h1, h2, h3, h4, h5, h6 { + -webkit-transition: text-shadow 0.5s linear; + -moz-transition: text-shadow 0.5s linear; + -ms-transition: text-shadow 0.5s linear; + -o-transition: text-shadow 0.5s linear; + transition: text-shadow 0.5s linear; + margin-right: 15px; +} + +h1.glow, h2.glow, h3.glow, h4.glow, h5.glow, h6.glow { + text-shadow: 0 0 15px cyan; +} + +dt { + font-weight: bold; +} + +ul.multicol { + -moz-column-gap: 1em; + -webkit-column-gap: 1em; + column-gap: 1em; + -moz-column-count: 3; + -webkit-column-count: 3; + column-count: 3; +} + +p.startli, p.startdd { + margin-top: 2px; +} + +th p.starttd, p.intertd, p.endtd { + font-size: 100%; + font-weight: 700; +} + +p.starttd { + margin-top: 0px; +} + +p.endli { + margin-bottom: 0px; +} + +p.enddd { + margin-bottom: 4px; +} + +p.endtd { + margin-bottom: 2px; +} + +p.interli { +} + +p.interdd { +} + +p.intertd { +} + +/* @end */ + +caption { + font-weight: bold; +} + +span.legend { + font-size: 70%; + text-align: center; +} + +h3.version { + font-size: 90%; + text-align: center; +} + +div.qindex, div.navtab{ + background-color: #EBEFF6; + border: 1px solid #A3B4D7; + text-align: center; +} + +div.qindex, div.navpath { + width: 100%; + line-height: 140%; +} + +div.navtab { + margin-right: 15px; +} + +/* @group Link Styling */ + +a { + color: #3D578C; + font-weight: normal; + text-decoration: none; +} + +.contents a:visited { + color: #4665A2; +} + +a:hover { + text-decoration: underline; +} + +a.qindex { + font-weight: bold; +} + +a.qindexHL { + font-weight: bold; + background-color: #9CAFD4; + color: #FFFFFF; + border: 1px double #869DCA; +} + +.contents a.qindexHL:visited { + color: #FFFFFF; +} + +a.el { + font-weight: bold; +} + +a.elRef { +} + +a.code, a.code:visited, a.line, a.line:visited { + color: #4665A2; +} + +a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited { + color: #4665A2; +} + +/* @end */ + +dl.el { + margin-left: -1cm; +} + +ul { + overflow: hidden; /*Fixed: list item bullets overlap floating elements*/ +} + +#side-nav ul { + overflow: visible; /* reset ul rule for scroll bar in GENERATE_TREEVIEW window */ +} + +#main-nav ul { + overflow: visible; /* reset ul rule for the navigation bar drop down lists */ +} + +.fragment { + text-align: left; + direction: ltr; + overflow-x: auto; /*Fixed: fragment lines overlap floating elements*/ + overflow-y: hidden; +} + +pre.fragment { + border: 1px solid #C4CFE5; + background-color: #FBFCFD; + padding: 4px 6px; + margin: 4px 8px 4px 2px; + overflow: auto; + word-wrap: break-word; + font-size: 9pt; + line-height: 125%; + font-family: monospace, fixed; + font-size: 105%; +} + +div.fragment { + padding: 0 0 1px 0; /*Fixed: last line underline overlap border*/ + margin: 4px 8px 4px 2px; + background-color: #FBFCFD; + border: 1px solid #C4CFE5; +} + +div.line { + font-family: monospace, fixed; + font-size: 13px; + min-height: 13px; + line-height: 1.0; + text-wrap: unrestricted; + white-space: -moz-pre-wrap; /* Moz */ + white-space: -pre-wrap; /* Opera 4-6 */ + white-space: -o-pre-wrap; /* Opera 7 */ + white-space: pre-wrap; /* CSS3 */ + word-wrap: break-word; /* IE 5.5+ */ + text-indent: -53px; + padding-left: 53px; + padding-bottom: 0px; + margin: 0px; + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +div.line:after { + content:"\000A"; + white-space: pre; +} + +div.line.glow { + background-color: cyan; + box-shadow: 0 0 10px cyan; +} + + +span.lineno { + padding-right: 4px; + text-align: right; + border-right: 2px solid #0F0; + background-color: #E8E8E8; + white-space: pre; +} +span.lineno a { + background-color: #D8D8D8; +} + +span.lineno a:hover { + background-color: #C8C8C8; +} + +.lineno { + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +div.ah, span.ah { + background-color: black; + font-weight: bold; + color: #FFFFFF; + margin-bottom: 3px; + margin-top: 3px; + padding: 0.2em; + border: solid thin #333; + border-radius: 0.5em; + -webkit-border-radius: .5em; + -moz-border-radius: .5em; + box-shadow: 2px 2px 3px #999; + -webkit-box-shadow: 2px 2px 3px #999; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; + background-image: -webkit-gradient(linear, left top, left bottom, from(#eee), to(#000),color-stop(0.3, #444)); + background-image: -moz-linear-gradient(center top, #eee 0%, #444 40%, #000 110%); +} + +div.classindex ul { + list-style: none; + padding-left: 0; +} + +div.classindex span.ai { + display: inline-block; +} + +div.groupHeader { + margin-left: 16px; + margin-top: 12px; + font-weight: bold; +} + +div.groupText { + margin-left: 16px; + font-style: italic; +} + +body { + background-color: white; + color: black; + margin: 0; +} + +div.contents { + margin-top: 10px; + margin-left: 12px; + margin-right: 8px; +} + +td.indexkey { + background-color: #EBEFF6; + font-weight: bold; + border: 1px solid #C4CFE5; + margin: 2px 0px 2px 0; + padding: 2px 10px; + white-space: nowrap; + vertical-align: top; +} + +td.indexvalue { + background-color: #EBEFF6; + border: 1px solid #C4CFE5; + padding: 2px 10px; + margin: 2px 0px; +} + +tr.memlist { + background-color: #EEF1F7; +} + +p.formulaDsp { + text-align: center; +} + +img.formulaDsp { + +} + +img.formulaInl, img.inline { + vertical-align: middle; +} + +div.center { + text-align: center; + margin-top: 0px; + margin-bottom: 0px; + padding: 0px; +} + +div.center img { + border: 0px; +} + +address.footer { + text-align: right; + padding-right: 12px; +} + +img.footer { + border: 0px; + vertical-align: middle; +} + +/* @group Code Colorization */ + +span.keyword { + color: #008000 +} + +span.keywordtype { + color: #604020 +} + +span.keywordflow { + color: #e08000 +} + +span.comment { + color: #800000 +} + +span.preprocessor { + color: #806020 +} + +span.stringliteral { + color: #002080 +} + +span.charliteral { + color: #008080 +} + +span.vhdldigit { + color: #ff00ff +} + +span.vhdlchar { + color: #000000 +} + +span.vhdlkeyword { + color: #700070 +} + +span.vhdllogic { + color: #ff0000 +} + +blockquote { + background-color: #F7F8FB; + border-left: 2px solid #9CAFD4; + margin: 0 24px 0 4px; + padding: 0 12px 0 16px; +} + +blockquote.DocNodeRTL { + border-left: 0; + border-right: 2px solid #9CAFD4; + margin: 0 4px 0 24px; + padding: 0 16px 0 12px; +} + +/* @end */ + +/* +.search { + color: #003399; + font-weight: bold; +} + +form.search { + margin-bottom: 0px; + margin-top: 0px; +} + +input.search { + font-size: 75%; + color: #000080; + font-weight: normal; + background-color: #e8eef2; +} +*/ + +td.tiny { + font-size: 75%; +} + +.dirtab { + padding: 4px; + border-collapse: collapse; + border: 1px solid #A3B4D7; +} + +th.dirtab { + background: #EBEFF6; + font-weight: bold; +} + +hr { + height: 0px; + border: none; + border-top: 1px solid #4A6AAA; +} + +hr.footer { + height: 1px; +} + +/* @group Member Descriptions */ + +table.memberdecls { + border-spacing: 0px; + padding: 0px; +} + +.memberdecls td, .fieldtable tr { + -webkit-transition-property: background-color, box-shadow; + -webkit-transition-duration: 0.5s; + -moz-transition-property: background-color, box-shadow; + -moz-transition-duration: 0.5s; + -ms-transition-property: background-color, box-shadow; + -ms-transition-duration: 0.5s; + -o-transition-property: background-color, box-shadow; + -o-transition-duration: 0.5s; + transition-property: background-color, box-shadow; + transition-duration: 0.5s; +} + +.memberdecls td.glow, .fieldtable tr.glow { + background-color: cyan; + box-shadow: 0 0 15px cyan; +} + +.mdescLeft, .mdescRight, +.memItemLeft, .memItemRight, +.memTemplItemLeft, .memTemplItemRight, .memTemplParams { + background-color: #F9FAFC; + border: none; + margin: 4px; + padding: 1px 0 0 8px; +} + +.mdescLeft, .mdescRight { + padding: 0px 8px 4px 8px; + color: #555; +} + +.memSeparator { + border-bottom: 1px solid #DEE4F0; + line-height: 1px; + margin: 0px; + padding: 0px; +} + +.memItemLeft, .memTemplItemLeft { + white-space: nowrap; +} + +.memItemRight, .memTemplItemRight { + width: 100%; +} + +.memTemplParams { + color: #4665A2; + white-space: nowrap; + font-size: 80%; +} + +/* @end */ + +/* @group Member Details */ + +/* Styles for detailed member documentation */ + +.memtitle { + padding: 8px; + border-top: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + border-top-right-radius: 4px; + border-top-left-radius: 4px; + margin-bottom: -1px; + background-image: url('nav_f.png'); + background-repeat: repeat-x; + background-color: #E2E8F2; + line-height: 1.25; + font-weight: 300; + float:left; +} + +.permalink +{ + font-size: 65%; + display: inline-block; + vertical-align: middle; +} + +.memtemplate { + font-size: 80%; + color: #4665A2; + font-weight: normal; + margin-left: 9px; +} + +.memnav { + background-color: #EBEFF6; + border: 1px solid #A3B4D7; + text-align: center; + margin: 2px; + margin-right: 15px; + padding: 2px; +} + +.mempage { + width: 100%; +} + +.memitem { + padding: 0; + margin-bottom: 10px; + margin-right: 5px; + -webkit-transition: box-shadow 0.5s linear; + -moz-transition: box-shadow 0.5s linear; + -ms-transition: box-shadow 0.5s linear; + -o-transition: box-shadow 0.5s linear; + transition: box-shadow 0.5s linear; + display: table !important; + width: 100%; +} + +.memitem.glow { + box-shadow: 0 0 15px cyan; +} + +.memname { + font-weight: 400; + margin-left: 6px; +} + +.memname td { + vertical-align: bottom; +} + +.memproto, dl.reflist dt { + border-top: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 0px 6px 0px; + color: #253555; + font-weight: bold; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + background-color: #DFE5F1; + /* opera specific markup */ + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + border-top-right-radius: 4px; + /* firefox specific markup */ + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + -moz-border-radius-topright: 4px; + /* webkit specific markup */ + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + -webkit-border-top-right-radius: 4px; + +} + +.overload { + font-family: "courier new",courier,monospace; + font-size: 65%; +} + +.memdoc, dl.reflist dd { + border-bottom: 1px solid #A8B8D9; + border-left: 1px solid #A8B8D9; + border-right: 1px solid #A8B8D9; + padding: 6px 10px 2px 10px; + background-color: #FBFCFD; + border-top-width: 0; + background-image:url('nav_g.png'); + background-repeat:repeat-x; + background-color: #FFFFFF; + /* opera specific markup */ + border-bottom-left-radius: 4px; + border-bottom-right-radius: 4px; + box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); + /* firefox specific markup */ + -moz-border-radius-bottomleft: 4px; + -moz-border-radius-bottomright: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 5px 5px 5px; + /* webkit specific markup */ + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +dl.reflist dt { + padding: 5px; +} + +dl.reflist dd { + margin: 0px 0px 10px 0px; + padding: 5px; +} + +.paramkey { + text-align: right; +} + +.paramtype { + white-space: nowrap; +} + +.paramname { + color: #602020; + white-space: nowrap; +} +.paramname em { + font-style: normal; +} +.paramname code { + line-height: 14px; +} + +.params, .retval, .exception, .tparams { + margin-left: 0px; + padding-left: 0px; +} + +.params .paramname, .retval .paramname, .tparams .paramname, .exception .paramname { + font-weight: bold; + vertical-align: top; +} + +.params .paramtype, .tparams .paramtype { + font-style: italic; + vertical-align: top; +} + +.params .paramdir, .tparams .paramdir { + font-family: "courier new",courier,monospace; + vertical-align: top; +} + +table.mlabels { + border-spacing: 0px; +} + +td.mlabels-left { + width: 100%; + padding: 0px; +} + +td.mlabels-right { + vertical-align: bottom; + padding: 0px; + white-space: nowrap; +} + +span.mlabels { + margin-left: 8px; +} + +span.mlabel { + background-color: #728DC1; + border-top:1px solid #5373B4; + border-left:1px solid #5373B4; + border-right:1px solid #C4CFE5; + border-bottom:1px solid #C4CFE5; + text-shadow: none; + color: white; + margin-right: 4px; + padding: 2px 3px; + border-radius: 3px; + font-size: 7pt; + white-space: nowrap; + vertical-align: middle; +} + + + +/* @end */ + +/* these are for tree view inside a (index) page */ + +div.directory { + margin: 10px 0px; + border-top: 1px solid #9CAFD4; + border-bottom: 1px solid #9CAFD4; + width: 100%; +} + +.directory table { + border-collapse:collapse; +} + +.directory td { + margin: 0px; + padding: 0px; + vertical-align: top; +} + +.directory td.entry { + white-space: nowrap; + padding-right: 6px; + padding-top: 3px; +} + +.directory td.entry a { + outline:none; +} + +.directory td.entry a img { + border: none; +} + +.directory td.desc { + width: 100%; + padding-left: 6px; + padding-right: 6px; + padding-top: 3px; + border-left: 1px solid rgba(0,0,0,0.05); +} + +.directory tr.even { + padding-left: 6px; + background-color: #F7F8FB; +} + +.directory img { + vertical-align: -30%; +} + +.directory .levels { + white-space: nowrap; + width: 100%; + text-align: right; + font-size: 9pt; +} + +.directory .levels span { + cursor: pointer; + padding-left: 2px; + padding-right: 2px; + color: #3D578C; +} + +.arrow { + color: #9CAFD4; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; + cursor: pointer; + font-size: 80%; + display: inline-block; + width: 16px; + height: 22px; +} + +.icon { + font-family: Arial, Helvetica; + font-weight: bold; + font-size: 12px; + height: 14px; + width: 16px; + display: inline-block; + background-color: #728DC1; + color: white; + text-align: center; + border-radius: 4px; + margin-left: 2px; + margin-right: 2px; +} + +.icona { + width: 24px; + height: 22px; + display: inline-block; +} + +.iconfopen { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('folderopen.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +.iconfclosed { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('folderclosed.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +.icondoc { + width: 24px; + height: 18px; + margin-bottom: 4px; + background-image:url('doc.png'); + background-position: 0px -4px; + background-repeat: repeat-y; + vertical-align:top; + display: inline-block; +} + +table.directory { + font: 400 14px Roboto,sans-serif; +} + +/* @end */ + +div.dynheader { + margin-top: 8px; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +address { + font-style: normal; + color: #2A3D61; +} + +table.doxtable caption { + caption-side: top; +} + +table.doxtable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.doxtable td, table.doxtable th { + border: 1px solid #2D4068; + padding: 3px 7px 2px; +} + +table.doxtable th { + background-color: #374F7F; + color: #FFFFFF; + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +table.fieldtable { + /*width: 100%;*/ + margin-bottom: 10px; + border: 1px solid #A8B8D9; + border-spacing: 0px; + -moz-border-radius: 4px; + -webkit-border-radius: 4px; + border-radius: 4px; + -moz-box-shadow: rgba(0, 0, 0, 0.15) 2px 2px 2px; + -webkit-box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); + box-shadow: 2px 2px 2px rgba(0, 0, 0, 0.15); +} + +.fieldtable td, .fieldtable th { + padding: 3px 7px 2px; +} + +.fieldtable td.fieldtype, .fieldtable td.fieldname { + white-space: nowrap; + border-right: 1px solid #A8B8D9; + border-bottom: 1px solid #A8B8D9; + vertical-align: top; +} + +.fieldtable td.fieldname { + padding-top: 3px; +} + +.fieldtable td.fielddoc { + border-bottom: 1px solid #A8B8D9; + /*width: 100%;*/ +} + +.fieldtable td.fielddoc p:first-child { + margin-top: 0px; +} + +.fieldtable td.fielddoc p:last-child { + margin-bottom: 2px; +} + +.fieldtable tr:last-child td { + border-bottom: none; +} + +.fieldtable th { + background-image:url('nav_f.png'); + background-repeat:repeat-x; + background-color: #E2E8F2; + font-size: 90%; + color: #253555; + padding-bottom: 4px; + padding-top: 5px; + text-align:left; + font-weight: 400; + -moz-border-radius-topleft: 4px; + -moz-border-radius-topright: 4px; + -webkit-border-top-left-radius: 4px; + -webkit-border-top-right-radius: 4px; + border-top-left-radius: 4px; + border-top-right-radius: 4px; + border-bottom: 1px solid #A8B8D9; +} + + +.tabsearch { + top: 0px; + left: 10px; + height: 36px; + background-image: url('tab_b.png'); + z-index: 101; + overflow: hidden; + font-size: 13px; +} + +.navpath ul +{ + font-size: 11px; + background-image:url('tab_b.png'); + background-repeat:repeat-x; + background-position: 0 -5px; + height:30px; + line-height:30px; + color:#8AA0CC; + border:solid 1px #C2CDE4; + overflow:hidden; + margin:0px; + padding:0px; +} + +.navpath li +{ + list-style-type:none; + float:left; + padding-left:10px; + padding-right:15px; + background-image:url('bc_s.png'); + background-repeat:no-repeat; + background-position:right; + color:#364D7C; +} + +.navpath li.navelem a +{ + height:32px; + display:block; + text-decoration: none; + outline: none; + color: #283A5D; + font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; + text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); + text-decoration: none; +} + +.navpath li.navelem a:hover +{ + color:#6884BD; +} + +.navpath li.footer +{ + list-style-type:none; + float:right; + padding-left:10px; + padding-right:15px; + background-image:none; + background-repeat:no-repeat; + background-position:right; + color:#364D7C; + font-size: 8pt; +} + + +div.summary +{ + float: right; + font-size: 8pt; + padding-right: 5px; + width: 50%; + text-align: right; +} + +div.summary a +{ + white-space: nowrap; +} + +table.classindex +{ + margin: 10px; + white-space: nowrap; + margin-left: 3%; + margin-right: 3%; + width: 94%; + border: 0; + border-spacing: 0; + padding: 0; +} + +div.ingroups +{ + font-size: 8pt; + width: 50%; + text-align: left; +} + +div.ingroups a +{ + white-space: nowrap; +} + +div.header +{ + background-image:url('nav_h.png'); + background-repeat:repeat-x; + background-color: #F9FAFC; + margin: 0px; + border-bottom: 1px solid #C4CFE5; +} + +div.headertitle +{ + padding: 5px 5px 5px 10px; +} + +.PageDocRTL-title div.headertitle { + text-align: right; + direction: rtl; +} + +dl { + padding: 0 0 0 0; +} + +/* dl.note, dl.warning, dl.attention, dl.pre, dl.post, dl.invariant, dl.deprecated, dl.todo, dl.test, dl.bug, dl.examples */ +dl.section { + margin-left: 0px; + padding-left: 0px; +} + +dl.section.DocNodeRTL { + margin-right: 0px; + padding-right: 0px; +} + +dl.note { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #D0C000; +} + +dl.note.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #D0C000; +} + +dl.warning, dl.attention { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #FF0000; +} + +dl.warning.DocNodeRTL, dl.attention.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #FF0000; +} + +dl.pre, dl.post, dl.invariant { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #00D000; +} + +dl.pre.DocNodeRTL, dl.post.DocNodeRTL, dl.invariant.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #00D000; +} + +dl.deprecated { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #505050; +} + +dl.deprecated.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #505050; +} + +dl.todo { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #00C0E0; +} + +dl.todo.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #00C0E0; +} + +dl.test { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #3030E0; +} + +dl.test.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #3030E0; +} + +dl.bug { + margin-left: -7px; + padding-left: 3px; + border-left: 4px solid; + border-color: #C08050; +} + +dl.bug.DocNodeRTL { + margin-left: 0; + padding-left: 0; + border-left: 0; + margin-right: -7px; + padding-right: 3px; + border-right: 4px solid; + border-color: #C08050; +} + +dl.section dd { + margin-bottom: 6px; +} + + +#projectlogo +{ + text-align: center; + vertical-align: bottom; + border-collapse: separate; +} + +#projectlogo img +{ + border: 0px none; +} + +#projectalign +{ + vertical-align: middle; +} + +#projectname +{ + font: 300% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 2px 0px; +} + +#projectbrief +{ + font: 120% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 0px; +} + +#projectnumber +{ + font: 50% Tahoma, Arial,sans-serif; + margin: 0px; + padding: 0px; +} + +#titlearea +{ + padding: 0px; + margin: 0px; + width: 100%; + border-bottom: 1px solid #5373B4; +} + +.image +{ + text-align: center; +} + +.dotgraph +{ + text-align: center; +} + +.mscgraph +{ + text-align: center; +} + +.plantumlgraph +{ + text-align: center; +} + +.diagraph +{ + text-align: center; +} + +.caption +{ + font-weight: bold; +} + +div.zoom +{ + border: 1px solid #90A5CE; +} + +dl.citelist { + margin-bottom:50px; +} + +dl.citelist dt { + color:#334975; + float:left; + font-weight:bold; + margin-right:10px; + padding:5px; +} + +dl.citelist dd { + margin:2px 0; + padding:5px 0; +} + +div.toc { + padding: 14px 25px; + background-color: #F4F6FA; + border: 1px solid #D8DFEE; + border-radius: 7px 7px 7px 7px; + float: right; + height: auto; + margin: 0 8px 10px 10px; + width: 200px; +} + +.PageDocRTL-title div.toc { + float: left !important; + text-align: right; +} + +div.toc li { + background: url("bdwn.png") no-repeat scroll 0 5px transparent; + font: 10px/1.2 Verdana,DejaVu Sans,Geneva,sans-serif; + margin-top: 5px; + padding-left: 10px; + padding-top: 2px; +} + +.PageDocRTL-title div.toc li { + background-position-x: right !important; + padding-left: 0 !important; + padding-right: 10px; +} + +div.toc h3 { + font: bold 12px/1.2 Arial,FreeSans,sans-serif; + color: #4665A2; + border-bottom: 0 none; + margin: 0; +} + +div.toc ul { + list-style: none outside none; + border: medium none; + padding: 0px; +} + +div.toc li.level1 { + margin-left: 0px; +} + +div.toc li.level2 { + margin-left: 15px; +} + +div.toc li.level3 { + margin-left: 30px; +} + +div.toc li.level4 { + margin-left: 45px; +} + +.PageDocRTL-title div.toc li.level1 { + margin-left: 0 !important; + margin-right: 0; +} + +.PageDocRTL-title div.toc li.level2 { + margin-left: 0 !important; + margin-right: 15px; +} + +.PageDocRTL-title div.toc li.level3 { + margin-left: 0 !important; + margin-right: 30px; +} + +.PageDocRTL-title div.toc li.level4 { + margin-left: 0 !important; + margin-right: 45px; +} + +.inherit_header { + font-weight: bold; + color: gray; + cursor: pointer; + -webkit-touch-callout: none; + -webkit-user-select: none; + -khtml-user-select: none; + -moz-user-select: none; + -ms-user-select: none; + user-select: none; +} + +.inherit_header td { + padding: 6px 0px 2px 5px; +} + +.inherit { + display: none; +} + +tr.heading h2 { + margin-top: 12px; + margin-bottom: 4px; +} + +/* tooltip related style info */ + +.ttc { + position: absolute; + display: none; +} + +#powerTip { + cursor: default; + white-space: nowrap; + background-color: white; + border: 1px solid gray; + border-radius: 4px 4px 4px 4px; + box-shadow: 1px 1px 7px gray; + display: none; + font-size: smaller; + max-width: 80%; + opacity: 0.9; + padding: 1ex 1em 1em; + position: absolute; + z-index: 2147483647; +} + +#powerTip div.ttdoc { + color: grey; + font-style: italic; +} + +#powerTip div.ttname a { + font-weight: bold; +} + +#powerTip div.ttname { + font-weight: bold; +} + +#powerTip div.ttdeci { + color: #006318; +} + +#powerTip div { + margin: 0px; + padding: 0px; + font: 12px/16px Roboto,sans-serif; +} + +#powerTip:before, #powerTip:after { + content: ""; + position: absolute; + margin: 0px; +} + +#powerTip.n:after, #powerTip.n:before, +#powerTip.s:after, #powerTip.s:before, +#powerTip.w:after, #powerTip.w:before, +#powerTip.e:after, #powerTip.e:before, +#powerTip.ne:after, #powerTip.ne:before, +#powerTip.se:after, #powerTip.se:before, +#powerTip.nw:after, #powerTip.nw:before, +#powerTip.sw:after, #powerTip.sw:before { + border: solid transparent; + content: " "; + height: 0; + width: 0; + position: absolute; +} + +#powerTip.n:after, #powerTip.s:after, +#powerTip.w:after, #powerTip.e:after, +#powerTip.nw:after, #powerTip.ne:after, +#powerTip.sw:after, #powerTip.se:after { + border-color: rgba(255, 255, 255, 0); +} + +#powerTip.n:before, #powerTip.s:before, +#powerTip.w:before, #powerTip.e:before, +#powerTip.nw:before, #powerTip.ne:before, +#powerTip.sw:before, #powerTip.se:before { + border-color: rgba(128, 128, 128, 0); +} + +#powerTip.n:after, #powerTip.n:before, +#powerTip.ne:after, #powerTip.ne:before, +#powerTip.nw:after, #powerTip.nw:before { + top: 100%; +} + +#powerTip.n:after, #powerTip.ne:after, #powerTip.nw:after { + border-top-color: #FFFFFF; + border-width: 10px; + margin: 0px -10px; +} +#powerTip.n:before { + border-top-color: #808080; + border-width: 11px; + margin: 0px -11px; +} +#powerTip.n:after, #powerTip.n:before { + left: 50%; +} + +#powerTip.nw:after, #powerTip.nw:before { + right: 14px; +} + +#powerTip.ne:after, #powerTip.ne:before { + left: 14px; +} + +#powerTip.s:after, #powerTip.s:before, +#powerTip.se:after, #powerTip.se:before, +#powerTip.sw:after, #powerTip.sw:before { + bottom: 100%; +} + +#powerTip.s:after, #powerTip.se:after, #powerTip.sw:after { + border-bottom-color: #FFFFFF; + border-width: 10px; + margin: 0px -10px; +} + +#powerTip.s:before, #powerTip.se:before, #powerTip.sw:before { + border-bottom-color: #808080; + border-width: 11px; + margin: 0px -11px; +} + +#powerTip.s:after, #powerTip.s:before { + left: 50%; +} + +#powerTip.sw:after, #powerTip.sw:before { + right: 14px; +} + +#powerTip.se:after, #powerTip.se:before { + left: 14px; +} + +#powerTip.e:after, #powerTip.e:before { + left: 100%; +} +#powerTip.e:after { + border-left-color: #FFFFFF; + border-width: 10px; + top: 50%; + margin-top: -10px; +} +#powerTip.e:before { + border-left-color: #808080; + border-width: 11px; + top: 50%; + margin-top: -11px; +} + +#powerTip.w:after, #powerTip.w:before { + right: 100%; +} +#powerTip.w:after { + border-right-color: #FFFFFF; + border-width: 10px; + top: 50%; + margin-top: -10px; +} +#powerTip.w:before { + border-right-color: #808080; + border-width: 11px; + top: 50%; + margin-top: -11px; +} + +@media print +{ + #top { display: none; } + #side-nav { display: none; } + #nav-path { display: none; } + body { overflow:visible; } + h1, h2, h3, h4, h5, h6 { page-break-after: avoid; } + .summary { display: none; } + .memitem { page-break-inside: avoid; } + #doc-content + { + margin-left:0 !important; + height:auto !important; + width:auto !important; + overflow:inherit; + display:inline; + } +} + +/* @group Markdown */ + +table.markdownTable { + border-collapse:collapse; + margin-top: 4px; + margin-bottom: 4px; +} + +table.markdownTable td, table.markdownTable th { + border: 1px solid #2D4068; + padding: 3px 7px 2px; +} + +table.markdownTable tr { +} + +th.markdownTableHeadLeft, th.markdownTableHeadRight, th.markdownTableHeadCenter, th.markdownTableHeadNone { + background-color: #374F7F; + color: #FFFFFF; + font-size: 110%; + padding-bottom: 4px; + padding-top: 5px; +} + +th.markdownTableHeadLeft, td.markdownTableBodyLeft { + text-align: left +} + +th.markdownTableHeadRight, td.markdownTableBodyRight { + text-align: right +} + +th.markdownTableHeadCenter, td.markdownTableBodyCenter { + text-align: center +} + +.DocNodeRTL { + text-align: right; + direction: rtl; +} + +.DocNodeLTR { + text-align: left; + direction: ltr; +} + +table.DocNodeRTL { + width: auto; + margin-right: 0; + margin-left: auto; +} + +table.DocNodeLTR { + width: auto; + margin-right: auto; + margin-left: 0; +} + +tt, code, kbd, samp +{ + display: inline-block; + direction:ltr; +} +/* @end */ + +u { + text-decoration: underline; +} + diff --git a/doxygen.png b/doxygen.png new file mode 100644 index 0000000000000000000000000000000000000000..3ff17d807fd8aa003bed8bb2a69e8f0909592fd1 GIT binary patch literal 3779 zcmV;!4m|ORP)tMIv#Q0*~7*`IBSO7_x;@a8#Zk6_PeKR_s92J&)(m+);m9Iz3blw)z#Gi zP!9lj4$%+*>Hz@HCmM9L9|8c+0u=!H$O3?R0Kgx|#WP<6fKfC8fM-CQZT|_r@`>VO zX^Hgb|9cJqpdJA5$MCEK`F_2@2Y@s>^+;pF`~jdI0Pvr|vl4`=C)EH@1IFe7pdJ8F zH(qGi004~QnF)Ggga~8v08kGAs2hKTATxr7pwfNk|4#_AaT>w8P6TV+R2kbS$v==} zAjf`s0g#V8lB+b3)5oEI*q+{Yt$MZDruD2^;$+(_%Qn+%v0X-bJO=;@kiJ^ygLBnC z?1OVv_%aex1M@jKU|Z~$eI?PoF4Vj>fDzyo zAiLfpXY*a^Sj-S5D0S3@#V$sRW)g)_1e#$%8xdM>Jm7?!h zu0P2X=xoN>^!4DoPRgph2(2va07yfpXF+WH7EOg1GY%Zn z7~1A<(z7Q$ktEXhW_?GMpHp9l_UL18F3KOsxu81pqoBiNbFSGsof-W z6~eloMoz=4?OOnl2J268x5rOY`dCk0us(uS#Ud4yqOr@?=Q57a}tit|BhY>}~frH1sP`ScHS_d)oqH^lYy zZ%VP`#10MlE~P?cE(%(#(AUSv_T{+;t@$U}El}(1ig`vZo`Rm;+5&(AYzJ^Ae=h2X z@Re%vHwZU>|f0NI&%$*4eJweC5OROQrpPMA@*w|o z()A==l}(@bv^&>H1Ob3C=<^|hob?0+xJ?QQ3-ueQC}zy&JQNib!OqSO@-=>XzxlSF zAZ^U*1l6EEmg3r};_HY>&Jo_{dOPEFTWPmt=U&F#+0(O59^UIlHbNX+eF8UzyDR*T z(=5X$VF3!gm@RooS-&iiUYGG^`hMR(07zr_xP`d!^BH?uD>Phl8Rdifx3Af^Zr`Ku ztL+~HkVeL#bJ)7;`=>;{KNRvjmc}1}c58Sr#Treq=4{xo!ATy|c>iRSp4`dzMMVd@ zL8?uwXDY}Wqgh4mH`|$BTXpUIu6A1-cSq%hJw;@^Zr8TP=GMh*p(m(tN7@!^D~sl$ zz^tf4II4|};+irE$Fnm4NTc5%p{PRA`%}Zk`CE5?#h3|xcyQsS#iONZ z6H(@^i9td!$z~bZiJLTax$o>r(p}3o@< zyD7%(>ZYvy=6$U3e!F{Z`uSaYy`xQyl?b{}eg|G3&fz*`QH@mDUn)1%#5u`0m$%D} z?;tZ0u(mWeMV0QtzjgN!lT*pNRj;6510Wwx?Yi_=tYw|J#7@(Xe7ifDzXuK;JB;QO z#bg~K$cgm$@{QiL_3yr}y&~wuv=P=#O&Tj=Sr)aCUlYmZMcw?)T?c%0rUe1cS+o!qs_ zQ6Gp)-{)V!;=q}llyK3|^WeLKyjf%y;xHku;9(vM!j|~<7w1c*Mk-;P{T&yG) z@C-8E?QPynNQ<8f01D`2qexcVEIOU?y}MG)TAE6&VT5`rK8s(4PE;uQ92LTXUQ<>^ ztyQ@=@kRdh@ebUG^Z6NWWIL;_IGJ2ST>$t!$m$qvtj0Qmw8moN6GUV^!QKNK zHBXCtUH8)RY9++gH_TUV4^=-j$t}dD3qsN7GclJ^Zc&(j6&a_!$jCf}%c5ey`pm~1)@{yI3 zTdWyB+*X{JFw#z;PwRr5evb2!ueWF;v`B0HoUu4-(~aL=z;OXUUEtG`_$)Oxw6FKg zEzY`CyKaSBK3xt#8gA|r_|Kehn_HYVBMpEwbn9-fI*!u*eTA1ef8Mkl1=!jV4oYwWYM}i`A>_F4nhmlCIC6WLa zY%;4&@AlnaG11ejl61Jev21|r*m+?Kru3;1tFDl}#!OzUp6c>go4{C|^erwpG*&h6bspUPJag}oOkN2912Y3I?(eRc@U9>z#HPBHC?nps7H5!zP``90!Q1n80jo+B3TWXp!8Pe zwuKuLLI6l3Gv@+QH*Y}2wPLPQ1^EZhT#+Ed8q8Wo z1pTmIBxv14-{l&QVKxAyQF#8Q@NeJwWdKk>?cpiJLkJr+aZ!Me+Cfp!?FWSRf^j2k z73BRR{WSKaMkJ>1Nbx5dan5hg^_}O{Tj6u%iV%#QGz0Q@j{R^Ik)Z*+(YvY2ziBG)?AmJa|JV%4UT$k`hcOg5r9R?5>?o~JzK zJCrj&{i#hG>N7!B4kNX(%igb%kDj0fOQThC-8mtfap82PNRXr1D>lbgg)dYTQ(kbx z`Ee5kXG~Bh+BHQBf|kJEy6(ga%WfhvdQNDuOfQoe377l#ht&DrMGeIsI5C<&ai zWG$|hop2@@q5YDa)_-A?B02W;#fH!%k`daQLEItaJJ8Yf1L%8x;kg?)k)00P-lH+w z)5$QNV6r2$YtnV(4o=0^3{kmaXn*Dm0F*fU(@o)yVVjk|ln8ea6BMy%vZAhW9|wvA z8RoDkVoMEz1d>|5(k0Nw>22ZT){V<3$^C-cN+|~hKt2)){+l-?3m@-$c?-dlzQ)q- zZ)j%n^gerV{|+t}9m1_&&Ly!9$rtG4XX|WQ8`xYzGC~U@nYh~g(z9)bdAl#xH)xd5a=@|qql z|FzEil{P5(@gy!4ek05i$>`E^G~{;pnf6ftpLh$h#W?^#4UkPfa;;?bsIe&kz!+40 zI|6`F2n020)-r`pFaZ38F!S-lJM-o&inOw|66=GMeP@xQU5ghQH{~5Uh~TMTd;I9` z>YhVB`e^EVj*S7JF39ZgNf}A-0DwOcTT63ydN$I3b?yBQtUI*_fae~kPvzoD$zjX3 zoqBe#>12im4WzZ=f^4+u=!lA|#r%1`WB0-6*3BL#at`47#ebPpR|D1b)3BjT34nYY z%Ds%d?5$|{LgOIaRO{{oC&RK`O91$fqwM0(C_TALcozu*fWHb%%q&p-q{_8*2Zsi^ zh1ZCnr^UYa;4vQEtHk{~zi>wwMC5o{S=$P0X681y`SXwFH?Ewn{x-MOZynmc)JT5v zuHLwh;tLfxRrr%|k370}GofLl7thg>ACWWY&msqaVu&ry+`7+Ss>NL^%T1|z{IGMA zW-SKl=V-^{(f!Kf^#3(|T2W47d(%JVCI4JgRrT1pNz>+ietmFToNv^`gzC@&O-)+i zPQ~RwK8%C_vf%;%e>NyTp~dM5;!C|N0Q^6|CEb7Bw=Vz~$1#FA;Z*?mKSC)Hl-20s t8QyHj(g6VK0RYbl8UjE)0O0w=e*@m04r>stuEhWV002ovPDHLkV1hl;dM*F} literal 0 HcmV?d00001 diff --git a/dynsections.js b/dynsections.js new file mode 100644 index 000000000..3174bd7be --- /dev/null +++ b/dynsections.js @@ -0,0 +1,121 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file + */ +function toggleVisibility(linkObj) +{ + var base = $(linkObj).attr('id'); + var summary = $('#'+base+'-summary'); + var content = $('#'+base+'-content'); + var trigger = $('#'+base+'-trigger'); + var src=$(trigger).attr('src'); + if (content.is(':visible')===true) { + content.hide(); + summary.show(); + $(linkObj).addClass('closed').removeClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-8)+'closed.png'); + } else { + content.show(); + summary.hide(); + $(linkObj).removeClass('closed').addClass('opened'); + $(trigger).attr('src',src.substring(0,src.length-10)+'open.png'); + } + return false; +} + +function updateStripes() +{ + $('table.directory tr'). + removeClass('even').filter(':visible:even').addClass('even'); +} + +function toggleLevel(level) +{ + $('table.directory tr').each(function() { + var l = this.id.split('_').length-1; + var i = $('#img'+this.id.substring(3)); + var a = $('#arr'+this.id.substring(3)); + if (l + + + + + + +Algorithms_in_C++: File List + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
File List
+
+
+
Here is a list of all documented files with brief descriptions:
+
[detail level 123]
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
  data_structures
  cll
 avltree.cppA simple tree implementation using nodes
 binary_search_tree.cppA simple tree implementation using structured nodes
 binaryheap.cppA C++ program to demonstrate common Binary Heap Operations
 linkedlist_implentation_usingarray.cppLinked list implementation using Arrays
 queue.h
 stack.h
 trie_modern.cppA basic implementation of trie class to store only lower-case strings
  geometry
 line_segment_intersection.cppCheck whether two line segments intersect each other or not
  machine_learning
 adaline_learning.cppAdaptive Linear Neuron (ADALINE) implementation
 kohonen_som_topology.cppKohonen self organizing map (topological map)
 kohonen_som_trace.cppKohonen self organizing map (data tracing)
  math
 binary_exponent.cppC++ Program to find Binary Exponent Iteratively and Recursively
 check_prime.cppReduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+2 jumping on all odd numbers only. If number is <= 1 or if it is even except 2, break the loop and return false telling number is not prime
 double_factorial.cppCompute double factorial: \(n!!\)
 eulers_totient_function.cppC++ Program to find Euler's Totient function
 extended_euclid_algorithm.cppGCD using extended Euclid's algorithm
 factorial.cppC++ program to find factorial of given number
 fast_power.cppFaster computation for \(a^b\)
 fibonacci.cppGenerate fibonacci sequence
 fibonacci_fast.cppFaster computation of Fibonacci series
 fibonacci_large.cppComputes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations
 gcd_iterative_euclidean.cppCompute the greatest common denominator of two integers using iterative form of Euclidean algorithm
 gcd_of_n_numbers.cppThis program aims at calculating the GCD of n numbers by division method
 gcd_recursive_euclidean.cppCompute the greatest common denominator of two integers using recursive form of Euclidean algorithm
 large_factorial.cppCompute factorial of any arbitratily large number/
 large_number.hLibrary to perform arithmatic operations on arbitrarily large numbers
 least_common_multiple.cpp
 modular_inverse_fermat_little_theorem.cppC++ Program to find the modular inverse using Fermat's Little Theorem
 number_of_positive_divisors.cppC++ Program to calculate number of divisors
 power_for_huge_numbers.cppCompute powers of large numbers
 prime_factorization.cppPrime factorization of positive integers
 prime_numbers.cppGet list of prime numbers
 primes_up_to_billion.cppCompute prime numbers upto 1 billion
 realtime_stats.cppCompute statistics for data entered in rreal-time
 sieve_of_eratosthenes.cppGet list of prime numbers using Sieve of Eratosthenes Sieve of Eratosthenes is an algorithm to find the primes that is between 2 to N (as defined in main)
 sqrt_double.cppCalculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using bisection method of root-finding
 string_fibonacci.cppThis Programme returns the Nth fibonacci as a string
  numerical_methods
 bisection_method.cppSolve the equation \(f(x)=0\) using bisection method
 durand_kerner_roots.cppCompute all possible approximate roots of any given polynomial using Durand Kerner algorithm
 false_position.cppSolve the equation \(f(x)=0\) using false position method, also known as the Secant method
 gaussian_elimination.cppGaussian elimination method
 lu_decompose.cppLU decomposition of a square matrix
 newton_raphson_method.cppSolve the equation \(f(x)=0\) using Newton-Raphson method for both real and complex solutions
 ode_forward_euler.cppSolve a multivariable first order ordinary differential equation (ODEs) using forward Euler method
 ode_midpoint_euler.cppSolve a multivariable first order ordinary differential equation (ODEs) using midpoint Euler method
 ode_semi_implicit_euler.cppSolve a multivariable first order ordinary differential equation (ODEs) using semi implicit Euler method
 ordinary_least_squares_regressor.cppLinear regression example using Ordinary least squares
 qr_decompose.hLibrary functions to compute QR decomposition of a given matrix
 qr_decomposition.cppProgram to compute the QR decomposition of a given matrix
 qr_eigen_values.cppCompute real eigen values and eigen vectors of a symmetric matrix using QR decomposition method
 successive_approximation.cppMethod of successive approximations using fixed-point iteration method
  others
 buzz_number.cppA buzz number is a number that is either divisible by 7 or has last digit as 7
 decimal_to_binary.cppFunction to convert decimal number to binary representation
 decimal_to_hexadecimal.cppConvert decimal number to hexadecimal representation
 decimal_to_roman_numeral.cppThis Programme Converts a given decimal number in the range [0,4000) to both Lower case and Upper case Roman Numeral
 fast_interger_input.cppRead integers from stdin continuously as they are entered without waiting for the \n character
 happy_number.cppA happy number is a number whose sum of digits is calculated until the sum is a single digit, and this sum turns out to be 1
 matrix_exponentiation.cppMatrix Exponentiation
 palindrome_of_number.cppCheck if a number is palindrome or not
 paranthesis_matching.cppPerform paranthesis matching
 pascal_triangle.cppPascal's triangle implementation
 primality_test.cppPrimality test implementation
 smallest_circle.cppGet centre and radius of the smallest circle that circumscribes given set of points
 sparse_matrix.cpp
 spiral_print.cppPrint the elements of a matrix traversing it spirally
 stairs_pattern.cppThis program is use to print the following pattern
 tower_of_hanoi.cppSolve the Tower of Hanoi problem
 vector_important_functions.cppA C++ program to demonstrate working of std::sort(), std::reverse()
  probability
 addition_rule.cppAddition rule of probabilities
 bayes_theorem.cppBayes' theorem
 binomial_dist.cppBinomial distribution example
 poisson_dist.cppPoisson statistics
  search
 binary_search.cppBinary search algorithm
 exponential_search.cppExponential search algorithm
 hash_search.cppHash Search Algorithm - Best Time Complexity Ω(1)
 interpolation_search.cppInterpolation search algorithm
 interpolation_search2.cppInterpolation search algorithm
 jump_search.cppC++ program to implement Jump Search
 linear_search.cppLinear search algorithm
 median_search.cppMedian search algorithm
 ternary_search.cppTernary search algorithm
 text_search.cppSearch for words in a long textual paragraph
  sorting
 bubble_sort.cppBubble sort algorithm
 non_recursive_merge_sort.cpp
 quick_sort.cppQuick sort algorithm
 shell_sort2.cppShell sort algorithm
  strings
 brute_force_string_searching.cppString pattern search - brute force
 knuth_morris_pratt.cppThe Knuth-Morris-Pratt Algorithm for finding a pattern within a piece of text with complexity O(n + m)
 rabin_karp.cppThe Rabin-Karp Algorithm for finding a pattern within a piece of text with complexity O(n + m)
+
+
+
+ + + + diff --git a/files_dup.js b/files_dup.js new file mode 100644 index 000000000..afe330337 --- /dev/null +++ b/files_dup.js @@ -0,0 +1,13 @@ +var files_dup = +[ + [ "data_structures", "dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html", "dir_2e746e9d06bf2d8ff842208bcc6ebcfc" ], + [ "geometry", "dir_e3380d2178455503f266746fb14246a5.html", "dir_e3380d2178455503f266746fb14246a5" ], + [ "machine_learning", "dir_3343723ae086de42ee4ca9774da3a13f.html", "dir_3343723ae086de42ee4ca9774da3a13f" ], + [ "math", "dir_296d53ceaeaa7e099814a6def439fe8a.html", "dir_296d53ceaeaa7e099814a6def439fe8a" ], + [ "numerical_methods", "dir_9c6faab82c22511b50177aa2e38e2780.html", "dir_9c6faab82c22511b50177aa2e38e2780" ], + [ "others", "dir_9510827d0b234b3cc54b29892f217477.html", "dir_9510827d0b234b3cc54b29892f217477" ], + [ "probability", "dir_82e494173a87936756866de2fa774307.html", "dir_82e494173a87936756866de2fa774307" ], + [ "search", "dir_19b2bf9199a15c634a08b1ede1dd896a.html", "dir_19b2bf9199a15c634a08b1ede1dd896a" ], + [ "sorting", "dir_bb1b521853a9c46347182a9d10420771.html", "dir_bb1b521853a9c46347182a9d10420771" ], + [ "strings", "dir_73a3cc5065b223eb41b02873c0e19f0e.html", "dir_73a3cc5065b223eb41b02873c0e19f0e" ] +]; \ No newline at end of file diff --git a/folderclosed.png b/folderclosed.png new file mode 100644 index 0000000000000000000000000000000000000000..bb8ab35edce8e97554e360005ee9fc5bffb36e66 GIT binary patch literal 616 zcmV-u0+;=XP)a9#ETzayK)T~Jw&MMH>OIr#&;dC}is*2Mqdf&akCc=O@`qC+4i z5Iu3w#1M@KqXCz8TIZd1wli&kkl2HVcAiZ8PUn5z_kG@-y;?yK06=cA0U%H0PH+kU zl6dp}OR(|r8-RG+YLu`zbI}5TlOU6ToR41{9=uz^?dGTNL;wIMf|V3`d1Wj3y!#6` zBLZ?xpKR~^2x}?~zA(_NUu3IaDB$tKma*XUdOZN~c=dLt_h_k!dbxm_*ibDM zlFX`g{k$X}yIe%$N)cn1LNu=q9_CS)*>A zsX_mM4L@`(cSNQKMFc$RtYbx{79#j-J7hk*>*+ZZhM4Hw?I?rsXCi#mRWJ=-0LGV5a-WR0Qgt<|Nqf)C-@80`5gIz45^_20000IqP)X=#(TiCT&PiIIVc55T}TU}EUh*{q$|`3@{d>{Tc9Bo>e= zfmF3!f>fbI9#GoEHh0f`i5)wkLpva0ztf%HpZneK?w-7AK@b4Itw{y|Zd3k!fH?q2 zlhckHd_V2M_X7+)U&_Xcfvtw60l;--DgZmLSw-Y?S>)zIqMyJ1#FwLU*%bl38ok+! zh78H87n`ZTS;uhzAR$M`zZ`bVhq=+%u9^$5jDplgxd44}9;IRqUH1YHH|@6oFe%z( zo4)_>E$F&^P-f(#)>(TrnbE>Pefs9~@iN=|)Rz|V`sGfHNrJ)0gJb8xx+SBmRf@1l zvuzt=vGfI)<-F9!o&3l?>9~0QbUDT(wFdnQPv%xdD)m*g%!20>Bc9iYmGAp<9YAa( z0QgYgTWqf1qN++Gqp z8@AYPTB3E|6s=WLG?xw0tm|U!o=&zd+H0oRYE;Dbx+Na9s^STqX|Gnq%H8s(nGDGJ j8vwW|`Ts`)fSK|Kx=IK@RG@g200000NkvXXu0mjfauFEA literal 0 HcmV?d00001 diff --git a/functions.html b/functions.html new file mode 100644 index 000000000..783fa94c2 --- /dev/null +++ b/functions.html @@ -0,0 +1,447 @@ + + + + + + + +Algorithms_in_C++: Class Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented class members with links to the class documentation for each member:
+ +

- _ -

+ + +

- a -

+ + +

- c -

+ + +

- d -

+ + +

- e -

+ + +

- f -

+ + +

- g -

+ + +

- h -

+ + +

- i -

+ + +

- k -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- o -

+ + +

- p -

+ + +

- q -

+ + +

- r -

+ + +

- s -

+ + +

- t -

+ + +

- v -

+ + +

- w -

+ + +

- x -

+ + +

- y -

+ + +

- ~ -

+
+
+ + + + diff --git a/functions_func.html b/functions_func.html new file mode 100644 index 000000000..088a3d5a2 --- /dev/null +++ b/functions_func.html @@ -0,0 +1,364 @@ + + + + + + + +Algorithms_in_C++: Class Members - Functions + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- a -

+ + +

- c -

+ + +

- d -

+ + +

- e -

+ + +

- f -

+ + +

- g -

+ + +

- h -

    +
  • hasChildren() +: Trie +
  • +
+ + +

- i -

+ + +

- l -

+ + +

- m -

+ + +

- n -

+ + +

- o -

+ + +

- p -

+ + +

- q -

+ + +

- r -

+ + +

- s -

+ + +

- t -

+ + +

- v -

+ + +

- ~ -

+
+
+ + + + diff --git a/functions_rela.html b/functions_rela.html new file mode 100644 index 000000000..50b09a8ef --- /dev/null +++ b/functions_rela.html @@ -0,0 +1,123 @@ + + + + + + + +Algorithms_in_C++: Class Members - Related Functions + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
+ + + + diff --git a/functions_vars.html b/functions_vars.html new file mode 100644 index 000000000..aa15b0af0 --- /dev/null +++ b/functions_vars.html @@ -0,0 +1,154 @@ + + + + + + + +Algorithms_in_C++: Class Members - Variables + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
+ + + + diff --git a/globals.html b/globals.html new file mode 100644 index 000000000..606f07596 --- /dev/null +++ b/globals.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- _ -

+
+
+ + + + diff --git a/globals_a.html b/globals_a.html new file mode 100644 index 000000000..e02d3ae68 --- /dev/null +++ b/globals_a.html @@ -0,0 +1,135 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- a -

+
+
+ + + + diff --git a/globals_b.html b/globals_b.html new file mode 100644 index 000000000..8bebe3c1f --- /dev/null +++ b/globals_b.html @@ -0,0 +1,142 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- b -

+
+
+ + + + diff --git a/globals_c.html b/globals_c.html new file mode 100644 index 000000000..841e49840 --- /dev/null +++ b/globals_c.html @@ -0,0 +1,132 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- c -

+
+
+ + + + diff --git a/globals_d.html b/globals_d.html new file mode 100644 index 000000000..cd40941bc --- /dev/null +++ b/globals_d.html @@ -0,0 +1,123 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- d -

+
+
+ + + + diff --git a/globals_defs.html b/globals_defs.html new file mode 100644 index 000000000..1f7120cb5 --- /dev/null +++ b/globals_defs.html @@ -0,0 +1,151 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ + + + + + diff --git a/globals_dup.js b/globals_dup.js new file mode 100644 index 000000000..ca51adb92 --- /dev/null +++ b/globals_dup.js @@ -0,0 +1,24 @@ +var globals_dup = +[ + [ "_", "globals.html", null ], + [ "a", "globals_a.html", null ], + [ "b", "globals_b.html", null ], + [ "c", "globals_c.html", null ], + [ "d", "globals_d.html", null ], + [ "e", "globals_e.html", null ], + [ "f", "globals_f.html", null ], + [ "g", "globals_g.html", null ], + [ "h", "globals_h.html", null ], + [ "i", "globals_i.html", null ], + [ "j", "globals_j.html", null ], + [ "k", "globals_k.html", null ], + [ "l", "globals_l.html", null ], + [ "m", "globals_m.html", null ], + [ "n", "globals_n.html", null ], + [ "o", "globals_o.html", null ], + [ "p", "globals_p.html", null ], + [ "r", "globals_r.html", null ], + [ "s", "globals_s.html", null ], + [ "t", "globals_t.html", null ], + [ "u", "globals_u.html", null ] +]; \ No newline at end of file diff --git a/globals_e.html b/globals_e.html new file mode 100644 index 000000000..844bec606 --- /dev/null +++ b/globals_e.html @@ -0,0 +1,134 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- e -

+
+
+ + + + diff --git a/globals_f.html b/globals_f.html new file mode 100644 index 000000000..6118ba0d1 --- /dev/null +++ b/globals_f.html @@ -0,0 +1,154 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- f -

+
+
+ + + + diff --git a/globals_func.html b/globals_func.html new file mode 100644 index 000000000..42222ec26 --- /dev/null +++ b/globals_func.html @@ -0,0 +1,111 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- _ -

+
+
+ + + + diff --git a/globals_func.js b/globals_func.js new file mode 100644 index 000000000..306e8682e --- /dev/null +++ b/globals_func.js @@ -0,0 +1,23 @@ +var globals_func = +[ + [ "_", "globals_func.html", null ], + [ "a", "globals_func_a.html", null ], + [ "b", "globals_func_b.html", null ], + [ "c", "globals_func_c.html", null ], + [ "d", "globals_func_d.html", null ], + [ "e", "globals_func_e.html", null ], + [ "f", "globals_func_f.html", null ], + [ "g", "globals_func_g.html", null ], + [ "h", "globals_func_h.html", null ], + [ "i", "globals_func_i.html", null ], + [ "j", "globals_func_j.html", null ], + [ "l", "globals_func_l.html", null ], + [ "m", "globals_func_m.html", null ], + [ "n", "globals_func_n.html", null ], + [ "o", "globals_func_o.html", null ], + [ "p", "globals_func_p.html", null ], + [ "r", "globals_func_r.html", null ], + [ "s", "globals_func_s.html", null ], + [ "t", "globals_func_t.html", null ], + [ "u", "globals_func_u.html", null ] +]; \ No newline at end of file diff --git a/globals_func_a.html b/globals_func_a.html new file mode 100644 index 000000000..3b909ea37 --- /dev/null +++ b/globals_func_a.html @@ -0,0 +1,123 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- a -

+
+
+ + + + diff --git a/globals_func_b.html b/globals_func_b.html new file mode 100644 index 000000000..7958ecf0c --- /dev/null +++ b/globals_func_b.html @@ -0,0 +1,142 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- b -

+
+
+ + + + diff --git a/globals_func_c.html b/globals_func_c.html new file mode 100644 index 000000000..be2b9ce94 --- /dev/null +++ b/globals_func_c.html @@ -0,0 +1,132 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- c -

+
+
+ + + + diff --git a/globals_func_d.html b/globals_func_d.html new file mode 100644 index 000000000..874e1f15b --- /dev/null +++ b/globals_func_d.html @@ -0,0 +1,120 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- d -

+
+
+ + + + diff --git a/globals_func_e.html b/globals_func_e.html new file mode 100644 index 000000000..bb016dc27 --- /dev/null +++ b/globals_func_e.html @@ -0,0 +1,131 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ + + + + + diff --git a/globals_func_f.html b/globals_func_f.html new file mode 100644 index 000000000..631baf255 --- /dev/null +++ b/globals_func_f.html @@ -0,0 +1,148 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- f -

+
+
+ + + + diff --git a/globals_func_g.html b/globals_func_g.html new file mode 100644 index 000000000..d21fe44c6 --- /dev/null +++ b/globals_func_g.html @@ -0,0 +1,139 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+ + + + diff --git a/globals_func_h.html b/globals_func_h.html new file mode 100644 index 000000000..5e6992260 --- /dev/null +++ b/globals_func_h.html @@ -0,0 +1,117 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- h -

+
+
+ + + + diff --git a/globals_func_i.html b/globals_func_i.html new file mode 100644 index 000000000..026c944e4 --- /dev/null +++ b/globals_func_i.html @@ -0,0 +1,141 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- i -

+
+
+ + + + diff --git a/globals_func_j.html b/globals_func_j.html new file mode 100644 index 000000000..878eb5699 --- /dev/null +++ b/globals_func_j.html @@ -0,0 +1,111 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- j -

+
+
+ + + + diff --git a/globals_func_l.html b/globals_func_l.html new file mode 100644 index 000000000..6153baebd --- /dev/null +++ b/globals_func_l.html @@ -0,0 +1,126 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- l -

+
+
+ + + + diff --git a/globals_func_m.html b/globals_func_m.html new file mode 100644 index 000000000..dab763444 --- /dev/null +++ b/globals_func_m.html @@ -0,0 +1,211 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- m -

+
+
+ + + + diff --git a/globals_func_n.html b/globals_func_n.html new file mode 100644 index 000000000..b13921681 --- /dev/null +++ b/globals_func_n.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- n -

+
+
+ + + + diff --git a/globals_func_o.html b/globals_func_o.html new file mode 100644 index 000000000..53d996274 --- /dev/null +++ b/globals_func_o.html @@ -0,0 +1,127 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+ + + + diff --git a/globals_func_p.html b/globals_func_p.html new file mode 100644 index 000000000..50b637285 --- /dev/null +++ b/globals_func_p.html @@ -0,0 +1,159 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- p -

+
+
+ + + + diff --git a/globals_func_r.html b/globals_func_r.html new file mode 100644 index 000000000..28c4dfd4c --- /dev/null +++ b/globals_func_r.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- r -

+
+
+ + + + diff --git a/globals_func_s.html b/globals_func_s.html new file mode 100644 index 000000000..3f47a0939 --- /dev/null +++ b/globals_func_s.html @@ -0,0 +1,156 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- s -

+
+
+ + + + diff --git a/globals_func_t.html b/globals_func_t.html new file mode 100644 index 000000000..997a19167 --- /dev/null +++ b/globals_func_t.html @@ -0,0 +1,179 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ + +
+ + + + diff --git a/globals_func_u.html b/globals_func_u.html new file mode 100644 index 000000000..8817db498 --- /dev/null +++ b/globals_func_u.html @@ -0,0 +1,111 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+  + +

- u -

+
+
+ + + + diff --git a/globals_g.html b/globals_g.html new file mode 100644 index 000000000..f569b9d1a --- /dev/null +++ b/globals_g.html @@ -0,0 +1,139 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- g -

+
+
+ + + + diff --git a/globals_h.html b/globals_h.html new file mode 100644 index 000000000..02e56f2b4 --- /dev/null +++ b/globals_h.html @@ -0,0 +1,123 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- h -

+
+
+ + + + diff --git a/globals_i.html b/globals_i.html new file mode 100644 index 000000000..3f6154268 --- /dev/null +++ b/globals_i.html @@ -0,0 +1,147 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- i -

+
+
+ + + + diff --git a/globals_j.html b/globals_j.html new file mode 100644 index 000000000..80820b283 --- /dev/null +++ b/globals_j.html @@ -0,0 +1,111 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- j -

+
+
+ + + + diff --git a/globals_k.html b/globals_k.html new file mode 100644 index 000000000..240a8d72c --- /dev/null +++ b/globals_k.html @@ -0,0 +1,111 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- k -

+
+
+ + + + diff --git a/globals_l.html b/globals_l.html new file mode 100644 index 000000000..d15cdd09c --- /dev/null +++ b/globals_l.html @@ -0,0 +1,135 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- l -

+
+
+ + + + diff --git a/globals_m.html b/globals_m.html new file mode 100644 index 000000000..c1afc1255 --- /dev/null +++ b/globals_m.html @@ -0,0 +1,230 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- m -

+
+
+ + + + diff --git a/globals_n.html b/globals_n.html new file mode 100644 index 000000000..730e0e019 --- /dev/null +++ b/globals_n.html @@ -0,0 +1,117 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- n -

+
+
+ + + + diff --git a/globals_o.html b/globals_o.html new file mode 100644 index 000000000..a8373366c --- /dev/null +++ b/globals_o.html @@ -0,0 +1,127 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- o -

+
+
+ + + + diff --git a/globals_p.html b/globals_p.html new file mode 100644 index 000000000..768580e3d --- /dev/null +++ b/globals_p.html @@ -0,0 +1,171 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- p -

+
+
+ + + + diff --git a/globals_r.html b/globals_r.html new file mode 100644 index 000000000..8dd47f575 --- /dev/null +++ b/globals_r.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- r -

+
+
+ + + + diff --git a/globals_s.html b/globals_s.html new file mode 100644 index 000000000..9ad02738f --- /dev/null +++ b/globals_s.html @@ -0,0 +1,159 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- s -

+
+
+ + + + diff --git a/globals_t.html b/globals_t.html new file mode 100644 index 000000000..d53f47b7b --- /dev/null +++ b/globals_t.html @@ -0,0 +1,185 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- t -

+
+
+ + + + diff --git a/globals_type.html b/globals_type.html new file mode 100644 index 000000000..6af814e47 --- /dev/null +++ b/globals_type.html @@ -0,0 +1,112 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
+ + + + diff --git a/globals_u.html b/globals_u.html new file mode 100644 index 000000000..a90586b03 --- /dev/null +++ b/globals_u.html @@ -0,0 +1,111 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
Here is a list of all documented file members with links to the documentation:
+ +

- u -

+
+
+ + + + diff --git a/globals_vars.html b/globals_vars.html new file mode 100644 index 000000000..6194d02c9 --- /dev/null +++ b/globals_vars.html @@ -0,0 +1,149 @@ + + + + + + + +Algorithms_in_C++: File Members + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ + + + + + diff --git a/graph_legend.html b/graph_legend.html new file mode 100644 index 000000000..51f9a8d0c --- /dev/null +++ b/graph_legend.html @@ -0,0 +1,168 @@ + + + + + + + +Algorithms_in_C++: Graph Legend + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
Graph Legend
+
+
+

This page explains how to interpret the graphs that are generated by doxygen.

+

Consider the following example:

/*! Invisible class because of truncation */
+
class Invisible { };
+
+
/*! Truncated class, inheritance relation is hidden */
+
class Truncated : public Invisible { };
+
+
/* Class not documented with doxygen comments */
+
class Undocumented { };
+
+
/*! Class that is inherited using public inheritance */
+
class PublicBase : public Truncated { };
+
+
/*! A template class */
+
template<class T> class Templ { };
+
+
/*! Class that is inherited using protected inheritance */
+
class ProtectedBase { };
+
+
/*! Class that is inherited using private inheritance */
+
class PrivateBase { };
+
+
/*! Class that is used by the Inherited class */
+
class Used { };
+
+
/*! Super class that inherits a number of other classes */
+
class Inherited : public PublicBase,
+
protected ProtectedBase,
+
private PrivateBase,
+
public Undocumented,
+
public Templ<int>
+
{
+
private:
+
Used *m_usedClass;
+
};
+

This will result in the following graph:

+

The boxes in the above graph have the following meaning:

+
    +
  • +A filled gray box represents the struct or class for which the graph is generated.
  • +
  • +A box with a black border denotes a documented struct or class.
  • +
  • +A box with a gray border denotes an undocumented struct or class.
  • +
  • +A box with a red border denotes a documented struct or class forwhich not all inheritance/containment relations are shown. A graph is truncated if it does not fit within the specified boundaries.
  • +
+

The arrows have the following meaning:

+
    +
  • +A dark blue arrow is used to visualize a public inheritance relation between two classes.
  • +
  • +A dark green arrow is used for protected inheritance.
  • +
  • +A dark red arrow is used for private inheritance.
  • +
  • +A purple dashed arrow is used if a class is contained or used by another class. The arrow is labelled with the variable(s) through which the pointed class or struct is accessible.
  • +
  • +A yellow dashed arrow denotes a relation between a template instance and the template class it was instantiated from. The arrow is labelled with the template parameters of the instance.
  • +
+
+
+ + + + diff --git a/graph_legend.md5 b/graph_legend.md5 new file mode 100644 index 000000000..5543aee75 --- /dev/null +++ b/graph_legend.md5 @@ -0,0 +1 @@ +2949d8d683b49299ad5e82dbf5d1be6c \ No newline at end of file diff --git a/graph_legend.svg b/graph_legend.svg new file mode 100644 index 000000000..ac0987b97 --- /dev/null +++ b/graph_legend.svg @@ -0,0 +1,117 @@ + + + + + + +Graph Legend + + + +Node9 + +Inherited + + + +Node10 + +PublicBase + + + +Node10->Node9 + + + + + +Node11 + +Truncated + + + +Node11->Node10 + + + + + +Node13 + +ProtectedBase + + + +Node13->Node9 + + + + + +Node14 + +PrivateBase + + + +Node14->Node9 + + + + + +Node15 + +Undocumented + + + +Node15->Node9 + + + + + +Node16 + +Templ< int > + + + +Node16->Node9 + + + + + +Node17 + +Templ< T > + + + +Node17->Node16 + + +< int > + + + +Node18 + +Used + + + +Node18->Node9 + + +m_usedClass + + + diff --git a/index.html b/index.html new file mode 100644 index 000000000..ec960ed39 --- /dev/null +++ b/index.html @@ -0,0 +1,118 @@ + + + + + + + +Algorithms_in_C++: The Algorithms - C++ + + + + + + + + + + + + + + + +
+
+ + + + + + +
+
Algorithms_in_C++ +  1.0.0 +
+
Set of algorithms implemented in C++.
+
+
+ + + + + + + +
+
+ +
+
+
+ +
+ +
+
+ + +
+ +
+ +
+
+
The Algorithms - C++
+
+
+

Gitpod Ready-to-Code Gitter chat contributions welcome GitHub repo size GitHub closed pull requests Doxygen CI Awesome CI

+

Online Documentation.

+

Click on Files menu to see the list of all the files documented with the code.

+

+Algorithms implemented in C++ (for education)

+

The implementations are for learning purpose. They may be less efficient than the implementation in the standard library.

+

+Contribute Guidelines

+

Read our Contribution Guidelines before you contribute.

+
+
+
+ + + + diff --git a/jquery.js b/jquery.js new file mode 100644 index 000000000..103c32d79 --- /dev/null +++ b/jquery.js @@ -0,0 +1,35 @@ +/*! jQuery v3.4.1 | (c) JS Foundation and other contributors | jquery.org/license */ +!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],E=C.document,r=Object.getPrototypeOf,s=t.slice,g=t.concat,u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType},x=function(e){return null!=e&&e===e.window},c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.4.1",k=function(e,t){return new k.fn.init(e,t)},p=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;function d(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp($),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+$),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\([\\da-f]{1,6}"+M+"?|("+M+")|.)","ig"),ne=function(e,t,n){var r="0x"+t-65536;return r!=r||n?t:r<0?String.fromCharCode(r+65536):String.fromCharCode(r>>10|55296,1023&r|56320)},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(m.childNodes),m.childNodes),t[m.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&((e?e.ownerDocument||e:m)!==C&&T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!A[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&U.test(t)){(s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=k),o=(l=h(t)).length;while(o--)l[o]="#"+s+" "+xe(l[o]);c=l.join(","),f=ee.test(t)&&ye(e.parentNode)||e}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){A(t,!0)}finally{s===k&&e.removeAttribute("id")}}}return g(t.replace(B,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[k]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e.namespaceURI,n=(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:m;return r!==C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),m!==C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=k,!C.getElementsByName||!C.getElementsByName(k).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){a.appendChild(e).innerHTML="",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+k+"-]").length||v.push("~="),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+k+"+*").length||v.push(".#.+[+~]")}),ce(function(e){e.innerHTML="";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",$)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test(a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},D=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)===(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e===C||e.ownerDocument===m&&y(m,e)?-1:t===C||t.ownerDocument===m&&y(m,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e===C?-1:t===C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]===m?-1:s[r]===m?1:0}),C},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if((e.ownerDocument||e)!==C&&T(e),d.matchesSelector&&E&&!A[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){A(t,!0)}return 0":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=p[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&p(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?k.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?k.grep(e,function(e){return e===n!==r}):"string"!=typeof n?k.grep(e,function(e){return-1)[^>]*|#([\w-]+))$/;(k.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||q,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:L.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof k?t[0]:t,k.merge(this,k.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),D.test(r[1])&&k.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(k):k.makeArray(e,this)}).prototype=k.fn,q=k(E);var H=/^(?:parents|prev(?:Until|All))/,O={children:!0,contents:!0,next:!0,prev:!0};function P(e,t){while((e=e[t])&&1!==e.nodeType);return e}k.fn.extend({has:function(e){var t=k(e,this),n=t.length;return this.filter(function(){for(var e=0;e\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i,ge={option:[1,""],thead:[1,"","
"],col:[2,"","
"],tr:[2,"","
"],td:[3,"","
"],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?k.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;nx",y.noCloneChecked=!!me.cloneNode(!0).lastChild.defaultValue;var Te=/^key/,Ce=/^(?:mouse|pointer|contextmenu|drag|drop)|click/,Ee=/^([^.]*)(?:\.(.+)|)/;function ke(){return!0}function Se(){return!1}function Ne(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function Ae(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Ae(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Se;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return k().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=k.guid++)),e.each(function(){k.event.add(this,t,i,r,n)})}function De(e,i,o){o?(Q.set(e,i,!1),k.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Q.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(k.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Q.set(this,i,r),t=o(this,i),this[i](),r!==(n=Q.get(this,i))||t?Q.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n.value}else r.length&&(Q.set(this,i,{value:k.event.trigger(k.extend(r[0],k.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Q.get(e,i)&&k.event.add(e,i,ke)}k.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.get(t);if(v){n.handler&&(n=(o=n).handler,i=o.selector),i&&k.find.matchesSelector(ie,i),n.guid||(n.guid=k.guid++),(u=v.events)||(u=v.events={}),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof k&&k.event.triggered!==e.type?k.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(R)||[""]).length;while(l--)d=g=(s=Ee.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=k.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=k.event.special[d]||{},c=k.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&k.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),k.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.hasData(e)&&Q.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(R)||[""]).length;while(l--)if(d=g=(s=Ee.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=k.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||k.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)k.event.remove(e,d+t[l],n,r,!0);k.isEmptyObject(u)&&Q.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=k.event.fix(e),u=new Array(arguments.length),l=(Q.get(this,"events")||{})[s.type]||[],c=k.event.special[s.type]||{};for(u[0]=s,t=1;t\x20\t\r\n\f]*)[^>]*)\/>/gi,qe=/\s*$/g;function Oe(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&k(e).children("tbody")[0]||e}function Pe(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function Re(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Me(e,t){var n,r,i,o,a,s,u,l;if(1===t.nodeType){if(Q.hasData(e)&&(o=Q.access(e),a=Q.set(t,o),l=o.events))for(i in delete a.handle,a.events={},l)for(n=0,r=l[i].length;n")},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=oe(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||k.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var Vt,Gt=[],Yt=/(=)\?(?=&|$)|\?\?/;k.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=Gt.pop()||k.expando+"_"+kt++;return this[e]=!0,e}}),k.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Yt.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Yt.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Yt,"$1"+r):!1!==e.jsonp&&(e.url+=(St.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||k.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?k(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,Gt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((Vt=E.implementation.createHTMLDocument("").body).innerHTML="
",2===Vt.childNodes.length),k.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=D.exec(e))?[t.createElement(i[1])]:(i=we([e],t,o),o&&o.length&&k(o).remove(),k.merge([],i.childNodes)));var r,i,o},k.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1").append(k.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},k.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){k.fn[t]=function(e){return this.on(t,e)}}),k.expr.pseudos.animated=function(t){return k.grep(k.timers,function(e){return t===e.elem}).length},k.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=k.css(e,"position"),c=k(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=k.css(e,"top"),u=k.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,k.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},k.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){k.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===k.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===k.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=k(e).offset()).top+=k.css(e,"borderTopWidth",!0),i.left+=k.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-k.css(r,"marginTop",!0),left:t.left-i.left-k.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===k.css(e,"position"))e=e.offsetParent;return e||ie})}}),k.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;k.fn[t]=function(e){return _(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),k.each(["top","left"],function(e,n){k.cssHooks[n]=ze(y.pixelPosition,function(e,t){if(t)return t=_e(e,n),$e.test(t)?k(e).position()[n]+"px":t})}),k.each({Height:"height",Width:"width"},function(a,s){k.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){k.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return _(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?k.css(e,t,i):k.style(e,t,n,i)},s,n?e:void 0,n)}})}),k.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){k.fn[n]=function(e,t){return 0a;a++)for(i in o[a])n=o[a][i],o[a].hasOwnProperty(i)&&void 0!==n&&(e[i]=t.isPlainObject(n)?t.isPlainObject(e[i])?t.widget.extend({},e[i],n):t.widget.extend({},n):n);return e},t.widget.bridge=function(e,i){var n=i.prototype.widgetFullName||e;t.fn[e]=function(o){var a="string"==typeof o,r=s.call(arguments,1),h=this;return a?this.length||"instance"!==o?this.each(function(){var i,s=t.data(this,n);return"instance"===o?(h=s,!1):s?t.isFunction(s[o])&&"_"!==o.charAt(0)?(i=s[o].apply(s,r),i!==s&&void 0!==i?(h=i&&i.jquery?h.pushStack(i.get()):i,!1):void 0):t.error("no such method '"+o+"' for "+e+" widget instance"):t.error("cannot call methods on "+e+" prior to initialization; "+"attempted to call method '"+o+"'")}):h=void 0:(r.length&&(o=t.widget.extend.apply(null,[o].concat(r))),this.each(function(){var e=t.data(this,n);e?(e.option(o||{}),e._init&&e._init()):t.data(this,n,new i(o,this))})),h}},t.Widget=function(){},t.Widget._childConstructors=[],t.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",defaultElement:"
",options:{classes:{},disabled:!1,create:null},_createWidget:function(e,s){s=t(s||this.defaultElement||this)[0],this.element=t(s),this.uuid=i++,this.eventNamespace="."+this.widgetName+this.uuid,this.bindings=t(),this.hoverable=t(),this.focusable=t(),this.classesElementLookup={},s!==this&&(t.data(s,this.widgetFullName,this),this._on(!0,this.element,{remove:function(t){t.target===s&&this.destroy()}}),this.document=t(s.style?s.ownerDocument:s.document||s),this.window=t(this.document[0].defaultView||this.document[0].parentWindow)),this.options=t.widget.extend({},this.options,this._getCreateOptions(),e),this._create(),this.options.disabled&&this._setOptionDisabled(this.options.disabled),this._trigger("create",null,this._getCreateEventData()),this._init()},_getCreateOptions:function(){return{}},_getCreateEventData:t.noop,_create:t.noop,_init:t.noop,destroy:function(){var e=this;this._destroy(),t.each(this.classesElementLookup,function(t,i){e._removeClass(i,t)}),this.element.off(this.eventNamespace).removeData(this.widgetFullName),this.widget().off(this.eventNamespace).removeAttr("aria-disabled"),this.bindings.off(this.eventNamespace)},_destroy:t.noop,widget:function(){return this.element},option:function(e,i){var s,n,o,a=e;if(0===arguments.length)return t.widget.extend({},this.options);if("string"==typeof e)if(a={},s=e.split("."),e=s.shift(),s.length){for(n=a[e]=t.widget.extend({},this.options[e]),o=0;s.length-1>o;o++)n[s[o]]=n[s[o]]||{},n=n[s[o]];if(e=s.pop(),1===arguments.length)return void 0===n[e]?null:n[e];n[e]=i}else{if(1===arguments.length)return void 0===this.options[e]?null:this.options[e];a[e]=i}return this._setOptions(a),this},_setOptions:function(t){var e;for(e in t)this._setOption(e,t[e]);return this},_setOption:function(t,e){return"classes"===t&&this._setOptionClasses(e),this.options[t]=e,"disabled"===t&&this._setOptionDisabled(e),this},_setOptionClasses:function(e){var i,s,n;for(i in e)n=this.classesElementLookup[i],e[i]!==this.options.classes[i]&&n&&n.length&&(s=t(n.get()),this._removeClass(n,i),s.addClass(this._classes({element:s,keys:i,classes:e,add:!0})))},_setOptionDisabled:function(t){this._toggleClass(this.widget(),this.widgetFullName+"-disabled",null,!!t),t&&(this._removeClass(this.hoverable,null,"ui-state-hover"),this._removeClass(this.focusable,null,"ui-state-focus"))},enable:function(){return this._setOptions({disabled:!1})},disable:function(){return this._setOptions({disabled:!0})},_classes:function(e){function i(i,o){var a,r;for(r=0;i.length>r;r++)a=n.classesElementLookup[i[r]]||t(),a=e.add?t(t.unique(a.get().concat(e.element.get()))):t(a.not(e.element).get()),n.classesElementLookup[i[r]]=a,s.push(i[r]),o&&e.classes[i[r]]&&s.push(e.classes[i[r]])}var s=[],n=this;return e=t.extend({element:this.element,classes:this.options.classes||{}},e),this._on(e.element,{remove:"_untrackClassesElement"}),e.keys&&i(e.keys.match(/\S+/g)||[],!0),e.extra&&i(e.extra.match(/\S+/g)||[]),s.join(" ")},_untrackClassesElement:function(e){var i=this;t.each(i.classesElementLookup,function(s,n){-1!==t.inArray(e.target,n)&&(i.classesElementLookup[s]=t(n.not(e.target).get()))})},_removeClass:function(t,e,i){return this._toggleClass(t,e,i,!1)},_addClass:function(t,e,i){return this._toggleClass(t,e,i,!0)},_toggleClass:function(t,e,i,s){s="boolean"==typeof s?s:i;var n="string"==typeof t||null===t,o={extra:n?e:i,keys:n?t:e,element:n?this.element:t,add:s};return o.element.toggleClass(this._classes(o),s),this},_on:function(e,i,s){var n,o=this;"boolean"!=typeof e&&(s=i,i=e,e=!1),s?(i=n=t(i),this.bindings=this.bindings.add(i)):(s=i,i=this.element,n=this.widget()),t.each(s,function(s,a){function r(){return e||o.options.disabled!==!0&&!t(this).hasClass("ui-state-disabled")?("string"==typeof a?o[a]:a).apply(o,arguments):void 0}"string"!=typeof a&&(r.guid=a.guid=a.guid||r.guid||t.guid++);var h=s.match(/^([\w:-]*)\s*(.*)$/),l=h[1]+o.eventNamespace,c=h[2];c?n.on(l,c,r):i.on(l,r)})},_off:function(e,i){i=(i||"").split(" ").join(this.eventNamespace+" ")+this.eventNamespace,e.off(i).off(i),this.bindings=t(this.bindings.not(e).get()),this.focusable=t(this.focusable.not(e).get()),this.hoverable=t(this.hoverable.not(e).get())},_delay:function(t,e){function i(){return("string"==typeof t?s[t]:t).apply(s,arguments)}var s=this;return setTimeout(i,e||0)},_hoverable:function(e){this.hoverable=this.hoverable.add(e),this._on(e,{mouseenter:function(e){this._addClass(t(e.currentTarget),null,"ui-state-hover")},mouseleave:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-hover")}})},_focusable:function(e){this.focusable=this.focusable.add(e),this._on(e,{focusin:function(e){this._addClass(t(e.currentTarget),null,"ui-state-focus")},focusout:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-focus")}})},_trigger:function(e,i,s){var n,o,a=this.options[e];if(s=s||{},i=t.Event(i),i.type=(e===this.widgetEventPrefix?e:this.widgetEventPrefix+e).toLowerCase(),i.target=this.element[0],o=i.originalEvent)for(n in o)n in i||(i[n]=o[n]);return this.element.trigger(i,s),!(t.isFunction(a)&&a.apply(this.element[0],[i].concat(s))===!1||i.isDefaultPrevented())}},t.each({show:"fadeIn",hide:"fadeOut"},function(e,i){t.Widget.prototype["_"+e]=function(s,n,o){"string"==typeof n&&(n={effect:n});var a,r=n?n===!0||"number"==typeof n?i:n.effect||i:e;n=n||{},"number"==typeof n&&(n={duration:n}),a=!t.isEmptyObject(n),n.complete=o,n.delay&&s.delay(n.delay),a&&t.effects&&t.effects.effect[r]?s[e](n):r!==e&&s[r]?s[r](n.duration,n.easing,o):s.queue(function(i){t(this)[e](),o&&o.call(s[0]),i()})}}),t.widget,function(){function e(t,e,i){return[parseFloat(t[0])*(u.test(t[0])?e/100:1),parseFloat(t[1])*(u.test(t[1])?i/100:1)]}function i(e,i){return parseInt(t.css(e,i),10)||0}function s(e){var i=e[0];return 9===i.nodeType?{width:e.width(),height:e.height(),offset:{top:0,left:0}}:t.isWindow(i)?{width:e.width(),height:e.height(),offset:{top:e.scrollTop(),left:e.scrollLeft()}}:i.preventDefault?{width:0,height:0,offset:{top:i.pageY,left:i.pageX}}:{width:e.outerWidth(),height:e.outerHeight(),offset:e.offset()}}var n,o=Math.max,a=Math.abs,r=/left|center|right/,h=/top|center|bottom/,l=/[\+\-]\d+(\.[\d]+)?%?/,c=/^\w+/,u=/%$/,d=t.fn.position;t.position={scrollbarWidth:function(){if(void 0!==n)return n;var e,i,s=t("
"),o=s.children()[0];return t("body").append(s),e=o.offsetWidth,s.css("overflow","scroll"),i=o.offsetWidth,e===i&&(i=s[0].clientWidth),s.remove(),n=e-i},getScrollInfo:function(e){var i=e.isWindow||e.isDocument?"":e.element.css("overflow-x"),s=e.isWindow||e.isDocument?"":e.element.css("overflow-y"),n="scroll"===i||"auto"===i&&e.widthi?"left":e>0?"right":"center",vertical:0>r?"top":s>0?"bottom":"middle"};l>p&&p>a(e+i)&&(u.horizontal="center"),c>f&&f>a(s+r)&&(u.vertical="middle"),u.important=o(a(e),a(i))>o(a(s),a(r))?"horizontal":"vertical",n.using.call(this,t,u)}),h.offset(t.extend(D,{using:r}))})},t.ui.position={fit:{left:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollLeft:s.offset.left,a=s.width,r=t.left-e.collisionPosition.marginLeft,h=n-r,l=r+e.collisionWidth-a-n;e.collisionWidth>a?h>0&&0>=l?(i=t.left+h+e.collisionWidth-a-n,t.left+=h-i):t.left=l>0&&0>=h?n:h>l?n+a-e.collisionWidth:n:h>0?t.left+=h:l>0?t.left-=l:t.left=o(t.left-r,t.left)},top:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollTop:s.offset.top,a=e.within.height,r=t.top-e.collisionPosition.marginTop,h=n-r,l=r+e.collisionHeight-a-n;e.collisionHeight>a?h>0&&0>=l?(i=t.top+h+e.collisionHeight-a-n,t.top+=h-i):t.top=l>0&&0>=h?n:h>l?n+a-e.collisionHeight:n:h>0?t.top+=h:l>0?t.top-=l:t.top=o(t.top-r,t.top)}},flip:{left:function(t,e){var i,s,n=e.within,o=n.offset.left+n.scrollLeft,r=n.width,h=n.isWindow?n.scrollLeft:n.offset.left,l=t.left-e.collisionPosition.marginLeft,c=l-h,u=l+e.collisionWidth-r-h,d="left"===e.my[0]?-e.elemWidth:"right"===e.my[0]?e.elemWidth:0,p="left"===e.at[0]?e.targetWidth:"right"===e.at[0]?-e.targetWidth:0,f=-2*e.offset[0];0>c?(i=t.left+d+p+f+e.collisionWidth-r-o,(0>i||a(c)>i)&&(t.left+=d+p+f)):u>0&&(s=t.left-e.collisionPosition.marginLeft+d+p+f-h,(s>0||u>a(s))&&(t.left+=d+p+f))},top:function(t,e){var i,s,n=e.within,o=n.offset.top+n.scrollTop,r=n.height,h=n.isWindow?n.scrollTop:n.offset.top,l=t.top-e.collisionPosition.marginTop,c=l-h,u=l+e.collisionHeight-r-h,d="top"===e.my[1],p=d?-e.elemHeight:"bottom"===e.my[1]?e.elemHeight:0,f="top"===e.at[1]?e.targetHeight:"bottom"===e.at[1]?-e.targetHeight:0,m=-2*e.offset[1];0>c?(s=t.top+p+f+m+e.collisionHeight-r-o,(0>s||a(c)>s)&&(t.top+=p+f+m)):u>0&&(i=t.top-e.collisionPosition.marginTop+p+f+m-h,(i>0||u>a(i))&&(t.top+=p+f+m))}},flipfit:{left:function(){t.ui.position.flip.left.apply(this,arguments),t.ui.position.fit.left.apply(this,arguments)},top:function(){t.ui.position.flip.top.apply(this,arguments),t.ui.position.fit.top.apply(this,arguments)}}}}(),t.ui.position,t.extend(t.expr[":"],{data:t.expr.createPseudo?t.expr.createPseudo(function(e){return function(i){return!!t.data(i,e)}}):function(e,i,s){return!!t.data(e,s[3])}}),t.fn.extend({disableSelection:function(){var t="onselectstart"in document.createElement("div")?"selectstart":"mousedown";return function(){return this.on(t+".ui-disableSelection",function(t){t.preventDefault()})}}(),enableSelection:function(){return this.off(".ui-disableSelection")}}),t.ui.focusable=function(i,s){var n,o,a,r,h,l=i.nodeName.toLowerCase();return"area"===l?(n=i.parentNode,o=n.name,i.href&&o&&"map"===n.nodeName.toLowerCase()?(a=t("img[usemap='#"+o+"']"),a.length>0&&a.is(":visible")):!1):(/^(input|select|textarea|button|object)$/.test(l)?(r=!i.disabled,r&&(h=t(i).closest("fieldset")[0],h&&(r=!h.disabled))):r="a"===l?i.href||s:s,r&&t(i).is(":visible")&&e(t(i)))},t.extend(t.expr[":"],{focusable:function(e){return t.ui.focusable(e,null!=t.attr(e,"tabindex"))}}),t.ui.focusable,t.fn.form=function(){return"string"==typeof this[0].form?this.closest("form"):t(this[0].form)},t.ui.formResetMixin={_formResetHandler:function(){var e=t(this);setTimeout(function(){var i=e.data("ui-form-reset-instances");t.each(i,function(){this.refresh()})})},_bindFormResetHandler:function(){if(this.form=this.element.form(),this.form.length){var t=this.form.data("ui-form-reset-instances")||[];t.length||this.form.on("reset.ui-form-reset",this._formResetHandler),t.push(this),this.form.data("ui-form-reset-instances",t)}},_unbindFormResetHandler:function(){if(this.form.length){var e=this.form.data("ui-form-reset-instances");e.splice(t.inArray(this,e),1),e.length?this.form.data("ui-form-reset-instances",e):this.form.removeData("ui-form-reset-instances").off("reset.ui-form-reset")}}},"1.7"===t.fn.jquery.substring(0,3)&&(t.each(["Width","Height"],function(e,i){function s(e,i,s,o){return t.each(n,function(){i-=parseFloat(t.css(e,"padding"+this))||0,s&&(i-=parseFloat(t.css(e,"border"+this+"Width"))||0),o&&(i-=parseFloat(t.css(e,"margin"+this))||0)}),i}var n="Width"===i?["Left","Right"]:["Top","Bottom"],o=i.toLowerCase(),a={innerWidth:t.fn.innerWidth,innerHeight:t.fn.innerHeight,outerWidth:t.fn.outerWidth,outerHeight:t.fn.outerHeight};t.fn["inner"+i]=function(e){return void 0===e?a["inner"+i].call(this):this.each(function(){t(this).css(o,s(this,e)+"px")})},t.fn["outer"+i]=function(e,n){return"number"!=typeof e?a["outer"+i].call(this,e):this.each(function(){t(this).css(o,s(this,e,!0,n)+"px")})}}),t.fn.addBack=function(t){return this.add(null==t?this.prevObject:this.prevObject.filter(t))}),t.ui.keyCode={BACKSPACE:8,COMMA:188,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,LEFT:37,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SPACE:32,TAB:9,UP:38},t.ui.escapeSelector=function(){var t=/([!"#$%&'()*+,./:;<=>?@[\]^`{|}~])/g;return function(e){return e.replace(t,"\\$1")}}(),t.fn.labels=function(){var e,i,s,n,o;return this[0].labels&&this[0].labels.length?this.pushStack(this[0].labels):(n=this.eq(0).parents("label"),s=this.attr("id"),s&&(e=this.eq(0).parents().last(),o=e.add(e.length?e.siblings():this.siblings()),i="label[for='"+t.ui.escapeSelector(s)+"']",n=n.add(o.find(i).addBack(i))),this.pushStack(n))},t.fn.scrollParent=function(e){var i=this.css("position"),s="absolute"===i,n=e?/(auto|scroll|hidden)/:/(auto|scroll)/,o=this.parents().filter(function(){var e=t(this);return s&&"static"===e.css("position")?!1:n.test(e.css("overflow")+e.css("overflow-y")+e.css("overflow-x"))}).eq(0);return"fixed"!==i&&o.length?o:t(this[0].ownerDocument||document)},t.extend(t.expr[":"],{tabbable:function(e){var i=t.attr(e,"tabindex"),s=null!=i;return(!s||i>=0)&&t.ui.focusable(e,s)}}),t.fn.extend({uniqueId:function(){var t=0;return function(){return this.each(function(){this.id||(this.id="ui-id-"+ ++t)})}}(),removeUniqueId:function(){return this.each(function(){/^ui-id-\d+$/.test(this.id)&&t(this).removeAttr("id")})}}),t.ui.ie=!!/msie [\w.]+/.exec(navigator.userAgent.toLowerCase());var n=!1;t(document).on("mouseup",function(){n=!1}),t.widget("ui.mouse",{version:"1.12.1",options:{cancel:"input, textarea, button, select, option",distance:1,delay:0},_mouseInit:function(){var e=this;this.element.on("mousedown."+this.widgetName,function(t){return e._mouseDown(t)}).on("click."+this.widgetName,function(i){return!0===t.data(i.target,e.widgetName+".preventClickEvent")?(t.removeData(i.target,e.widgetName+".preventClickEvent"),i.stopImmediatePropagation(),!1):void 0}),this.started=!1},_mouseDestroy:function(){this.element.off("."+this.widgetName),this._mouseMoveDelegate&&this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate)},_mouseDown:function(e){if(!n){this._mouseMoved=!1,this._mouseStarted&&this._mouseUp(e),this._mouseDownEvent=e;var i=this,s=1===e.which,o="string"==typeof this.options.cancel&&e.target.nodeName?t(e.target).closest(this.options.cancel).length:!1;return s&&!o&&this._mouseCapture(e)?(this.mouseDelayMet=!this.options.delay,this.mouseDelayMet||(this._mouseDelayTimer=setTimeout(function(){i.mouseDelayMet=!0},this.options.delay)),this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(e)!==!1,!this._mouseStarted)?(e.preventDefault(),!0):(!0===t.data(e.target,this.widgetName+".preventClickEvent")&&t.removeData(e.target,this.widgetName+".preventClickEvent"),this._mouseMoveDelegate=function(t){return i._mouseMove(t)},this._mouseUpDelegate=function(t){return i._mouseUp(t)},this.document.on("mousemove."+this.widgetName,this._mouseMoveDelegate).on("mouseup."+this.widgetName,this._mouseUpDelegate),e.preventDefault(),n=!0,!0)):!0}},_mouseMove:function(e){if(this._mouseMoved){if(t.ui.ie&&(!document.documentMode||9>document.documentMode)&&!e.button)return this._mouseUp(e);if(!e.which)if(e.originalEvent.altKey||e.originalEvent.ctrlKey||e.originalEvent.metaKey||e.originalEvent.shiftKey)this.ignoreMissingWhich=!0;else if(!this.ignoreMissingWhich)return this._mouseUp(e)}return(e.which||e.button)&&(this._mouseMoved=!0),this._mouseStarted?(this._mouseDrag(e),e.preventDefault()):(this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(this._mouseDownEvent,e)!==!1,this._mouseStarted?this._mouseDrag(e):this._mouseUp(e)),!this._mouseStarted)},_mouseUp:function(e){this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate),this._mouseStarted&&(this._mouseStarted=!1,e.target===this._mouseDownEvent.target&&t.data(e.target,this.widgetName+".preventClickEvent",!0),this._mouseStop(e)),this._mouseDelayTimer&&(clearTimeout(this._mouseDelayTimer),delete this._mouseDelayTimer),this.ignoreMissingWhich=!1,n=!1,e.preventDefault()},_mouseDistanceMet:function(t){return Math.max(Math.abs(this._mouseDownEvent.pageX-t.pageX),Math.abs(this._mouseDownEvent.pageY-t.pageY))>=this.options.distance},_mouseDelayMet:function(){return this.mouseDelayMet},_mouseStart:function(){},_mouseDrag:function(){},_mouseStop:function(){},_mouseCapture:function(){return!0}}),t.ui.plugin={add:function(e,i,s){var n,o=t.ui[e].prototype;for(n in s)o.plugins[n]=o.plugins[n]||[],o.plugins[n].push([i,s[n]])},call:function(t,e,i,s){var n,o=t.plugins[e];if(o&&(s||t.element[0].parentNode&&11!==t.element[0].parentNode.nodeType))for(n=0;o.length>n;n++)t.options[o[n][0]]&&o[n][1].apply(t.element,i)}},t.widget("ui.resizable",t.ui.mouse,{version:"1.12.1",widgetEventPrefix:"resize",options:{alsoResize:!1,animate:!1,animateDuration:"slow",animateEasing:"swing",aspectRatio:!1,autoHide:!1,classes:{"ui-resizable-se":"ui-icon ui-icon-gripsmall-diagonal-se"},containment:!1,ghost:!1,grid:!1,handles:"e,s,se",helper:!1,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:90,resize:null,start:null,stop:null},_num:function(t){return parseFloat(t)||0},_isNumber:function(t){return!isNaN(parseFloat(t))},_hasScroll:function(e,i){if("hidden"===t(e).css("overflow"))return!1;var s=i&&"left"===i?"scrollLeft":"scrollTop",n=!1;return e[s]>0?!0:(e[s]=1,n=e[s]>0,e[s]=0,n)},_create:function(){var e,i=this.options,s=this;this._addClass("ui-resizable"),t.extend(this,{_aspectRatio:!!i.aspectRatio,aspectRatio:i.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:i.helper||i.ghost||i.animate?i.helper||"ui-resizable-helper":null}),this.element[0].nodeName.match(/^(canvas|textarea|input|select|button|img)$/i)&&(this.element.wrap(t("
").css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")})),this.element=this.element.parent().data("ui-resizable",this.element.resizable("instance")),this.elementIsWrapper=!0,e={marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom"),marginLeft:this.originalElement.css("marginLeft")},this.element.css(e),this.originalElement.css("margin",0),this.originalResizeStyle=this.originalElement.css("resize"),this.originalElement.css("resize","none"),this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"})),this.originalElement.css(e),this._proportionallyResize()),this._setupHandles(),i.autoHide&&t(this.element).on("mouseenter",function(){i.disabled||(s._removeClass("ui-resizable-autohide"),s._handles.show())}).on("mouseleave",function(){i.disabled||s.resizing||(s._addClass("ui-resizable-autohide"),s._handles.hide())}),this._mouseInit()},_destroy:function(){this._mouseDestroy();var e,i=function(e){t(e).removeData("resizable").removeData("ui-resizable").off(".resizable").find(".ui-resizable-handle").remove()};return this.elementIsWrapper&&(i(this.element),e=this.element,this.originalElement.css({position:e.css("position"),width:e.outerWidth(),height:e.outerHeight(),top:e.css("top"),left:e.css("left")}).insertAfter(e),e.remove()),this.originalElement.css("resize",this.originalResizeStyle),i(this.originalElement),this},_setOption:function(t,e){switch(this._super(t,e),t){case"handles":this._removeHandles(),this._setupHandles();break;default:}},_setupHandles:function(){var e,i,s,n,o,a=this.options,r=this;if(this.handles=a.handles||(t(".ui-resizable-handle",this.element).length?{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"}:"e,s,se"),this._handles=t(),this.handles.constructor===String)for("all"===this.handles&&(this.handles="n,e,s,w,se,sw,ne,nw"),s=this.handles.split(","),this.handles={},i=0;s.length>i;i++)e=t.trim(s[i]),n="ui-resizable-"+e,o=t("
"),this._addClass(o,"ui-resizable-handle "+n),o.css({zIndex:a.zIndex}),this.handles[e]=".ui-resizable-"+e,this.element.append(o);this._renderAxis=function(e){var i,s,n,o;e=e||this.element;for(i in this.handles)this.handles[i].constructor===String?this.handles[i]=this.element.children(this.handles[i]).first().show():(this.handles[i].jquery||this.handles[i].nodeType)&&(this.handles[i]=t(this.handles[i]),this._on(this.handles[i],{mousedown:r._mouseDown})),this.elementIsWrapper&&this.originalElement[0].nodeName.match(/^(textarea|input|select|button)$/i)&&(s=t(this.handles[i],this.element),o=/sw|ne|nw|se|n|s/.test(i)?s.outerHeight():s.outerWidth(),n=["padding",/ne|nw|n/.test(i)?"Top":/se|sw|s/.test(i)?"Bottom":/^e$/.test(i)?"Right":"Left"].join(""),e.css(n,o),this._proportionallyResize()),this._handles=this._handles.add(this.handles[i])},this._renderAxis(this.element),this._handles=this._handles.add(this.element.find(".ui-resizable-handle")),this._handles.disableSelection(),this._handles.on("mouseover",function(){r.resizing||(this.className&&(o=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)),r.axis=o&&o[1]?o[1]:"se")}),a.autoHide&&(this._handles.hide(),this._addClass("ui-resizable-autohide"))},_removeHandles:function(){this._handles.remove()},_mouseCapture:function(e){var i,s,n=!1;for(i in this.handles)s=t(this.handles[i])[0],(s===e.target||t.contains(s,e.target))&&(n=!0);return!this.options.disabled&&n},_mouseStart:function(e){var i,s,n,o=this.options,a=this.element;return this.resizing=!0,this._renderProxy(),i=this._num(this.helper.css("left")),s=this._num(this.helper.css("top")),o.containment&&(i+=t(o.containment).scrollLeft()||0,s+=t(o.containment).scrollTop()||0),this.offset=this.helper.offset(),this.position={left:i,top:s},this.size=this._helper?{width:this.helper.width(),height:this.helper.height()}:{width:a.width(),height:a.height()},this.originalSize=this._helper?{width:a.outerWidth(),height:a.outerHeight()}:{width:a.width(),height:a.height()},this.sizeDiff={width:a.outerWidth()-a.width(),height:a.outerHeight()-a.height()},this.originalPosition={left:i,top:s},this.originalMousePosition={left:e.pageX,top:e.pageY},this.aspectRatio="number"==typeof o.aspectRatio?o.aspectRatio:this.originalSize.width/this.originalSize.height||1,n=t(".ui-resizable-"+this.axis).css("cursor"),t("body").css("cursor","auto"===n?this.axis+"-resize":n),this._addClass("ui-resizable-resizing"),this._propagate("start",e),!0},_mouseDrag:function(e){var i,s,n=this.originalMousePosition,o=this.axis,a=e.pageX-n.left||0,r=e.pageY-n.top||0,h=this._change[o];return this._updatePrevProperties(),h?(i=h.apply(this,[e,a,r]),this._updateVirtualBoundaries(e.shiftKey),(this._aspectRatio||e.shiftKey)&&(i=this._updateRatio(i,e)),i=this._respectSize(i,e),this._updateCache(i),this._propagate("resize",e),s=this._applyChanges(),!this._helper&&this._proportionallyResizeElements.length&&this._proportionallyResize(),t.isEmptyObject(s)||(this._updatePrevProperties(),this._trigger("resize",e,this.ui()),this._applyChanges()),!1):!1},_mouseStop:function(e){this.resizing=!1;var i,s,n,o,a,r,h,l=this.options,c=this;return this._helper&&(i=this._proportionallyResizeElements,s=i.length&&/textarea/i.test(i[0].nodeName),n=s&&this._hasScroll(i[0],"left")?0:c.sizeDiff.height,o=s?0:c.sizeDiff.width,a={width:c.helper.width()-o,height:c.helper.height()-n},r=parseFloat(c.element.css("left"))+(c.position.left-c.originalPosition.left)||null,h=parseFloat(c.element.css("top"))+(c.position.top-c.originalPosition.top)||null,l.animate||this.element.css(t.extend(a,{top:h,left:r})),c.helper.height(c.size.height),c.helper.width(c.size.width),this._helper&&!l.animate&&this._proportionallyResize()),t("body").css("cursor","auto"),this._removeClass("ui-resizable-resizing"),this._propagate("stop",e),this._helper&&this.helper.remove(),!1},_updatePrevProperties:function(){this.prevPosition={top:this.position.top,left:this.position.left},this.prevSize={width:this.size.width,height:this.size.height}},_applyChanges:function(){var t={};return this.position.top!==this.prevPosition.top&&(t.top=this.position.top+"px"),this.position.left!==this.prevPosition.left&&(t.left=this.position.left+"px"),this.size.width!==this.prevSize.width&&(t.width=this.size.width+"px"),this.size.height!==this.prevSize.height&&(t.height=this.size.height+"px"),this.helper.css(t),t},_updateVirtualBoundaries:function(t){var e,i,s,n,o,a=this.options;o={minWidth:this._isNumber(a.minWidth)?a.minWidth:0,maxWidth:this._isNumber(a.maxWidth)?a.maxWidth:1/0,minHeight:this._isNumber(a.minHeight)?a.minHeight:0,maxHeight:this._isNumber(a.maxHeight)?a.maxHeight:1/0},(this._aspectRatio||t)&&(e=o.minHeight*this.aspectRatio,s=o.minWidth/this.aspectRatio,i=o.maxHeight*this.aspectRatio,n=o.maxWidth/this.aspectRatio,e>o.minWidth&&(o.minWidth=e),s>o.minHeight&&(o.minHeight=s),o.maxWidth>i&&(o.maxWidth=i),o.maxHeight>n&&(o.maxHeight=n)),this._vBoundaries=o},_updateCache:function(t){this.offset=this.helper.offset(),this._isNumber(t.left)&&(this.position.left=t.left),this._isNumber(t.top)&&(this.position.top=t.top),this._isNumber(t.height)&&(this.size.height=t.height),this._isNumber(t.width)&&(this.size.width=t.width)},_updateRatio:function(t){var e=this.position,i=this.size,s=this.axis;return this._isNumber(t.height)?t.width=t.height*this.aspectRatio:this._isNumber(t.width)&&(t.height=t.width/this.aspectRatio),"sw"===s&&(t.left=e.left+(i.width-t.width),t.top=null),"nw"===s&&(t.top=e.top+(i.height-t.height),t.left=e.left+(i.width-t.width)),t},_respectSize:function(t){var e=this._vBoundaries,i=this.axis,s=this._isNumber(t.width)&&e.maxWidth&&e.maxWidtht.width,a=this._isNumber(t.height)&&e.minHeight&&e.minHeight>t.height,r=this.originalPosition.left+this.originalSize.width,h=this.originalPosition.top+this.originalSize.height,l=/sw|nw|w/.test(i),c=/nw|ne|n/.test(i);return o&&(t.width=e.minWidth),a&&(t.height=e.minHeight),s&&(t.width=e.maxWidth),n&&(t.height=e.maxHeight),o&&l&&(t.left=r-e.minWidth),s&&l&&(t.left=r-e.maxWidth),a&&c&&(t.top=h-e.minHeight),n&&c&&(t.top=h-e.maxHeight),t.width||t.height||t.left||!t.top?t.width||t.height||t.top||!t.left||(t.left=null):t.top=null,t},_getPaddingPlusBorderDimensions:function(t){for(var e=0,i=[],s=[t.css("borderTopWidth"),t.css("borderRightWidth"),t.css("borderBottomWidth"),t.css("borderLeftWidth")],n=[t.css("paddingTop"),t.css("paddingRight"),t.css("paddingBottom"),t.css("paddingLeft")];4>e;e++)i[e]=parseFloat(s[e])||0,i[e]+=parseFloat(n[e])||0;return{height:i[0]+i[2],width:i[1]+i[3]}},_proportionallyResize:function(){if(this._proportionallyResizeElements.length)for(var t,e=0,i=this.helper||this.element;this._proportionallyResizeElements.length>e;e++)t=this._proportionallyResizeElements[e],this.outerDimensions||(this.outerDimensions=this._getPaddingPlusBorderDimensions(t)),t.css({height:i.height()-this.outerDimensions.height||0,width:i.width()-this.outerDimensions.width||0})},_renderProxy:function(){var e=this.element,i=this.options;this.elementOffset=e.offset(),this._helper?(this.helper=this.helper||t("
"),this._addClass(this.helper,this._helper),this.helper.css({width:this.element.outerWidth(),height:this.element.outerHeight(),position:"absolute",left:this.elementOffset.left+"px",top:this.elementOffset.top+"px",zIndex:++i.zIndex}),this.helper.appendTo("body").disableSelection()):this.helper=this.element +},_change:{e:function(t,e){return{width:this.originalSize.width+e}},w:function(t,e){var i=this.originalSize,s=this.originalPosition;return{left:s.left+e,width:i.width-e}},n:function(t,e,i){var s=this.originalSize,n=this.originalPosition;return{top:n.top+i,height:s.height-i}},s:function(t,e,i){return{height:this.originalSize.height+i}},se:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},sw:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[e,i,s]))},ne:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},nw:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[e,i,s]))}},_propagate:function(e,i){t.ui.plugin.call(this,e,[i,this.ui()]),"resize"!==e&&this._trigger(e,i,this.ui())},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}}),t.ui.plugin.add("resizable","animate",{stop:function(e){var i=t(this).resizable("instance"),s=i.options,n=i._proportionallyResizeElements,o=n.length&&/textarea/i.test(n[0].nodeName),a=o&&i._hasScroll(n[0],"left")?0:i.sizeDiff.height,r=o?0:i.sizeDiff.width,h={width:i.size.width-r,height:i.size.height-a},l=parseFloat(i.element.css("left"))+(i.position.left-i.originalPosition.left)||null,c=parseFloat(i.element.css("top"))+(i.position.top-i.originalPosition.top)||null;i.element.animate(t.extend(h,c&&l?{top:c,left:l}:{}),{duration:s.animateDuration,easing:s.animateEasing,step:function(){var s={width:parseFloat(i.element.css("width")),height:parseFloat(i.element.css("height")),top:parseFloat(i.element.css("top")),left:parseFloat(i.element.css("left"))};n&&n.length&&t(n[0]).css({width:s.width,height:s.height}),i._updateCache(s),i._propagate("resize",e)}})}}),t.ui.plugin.add("resizable","containment",{start:function(){var e,i,s,n,o,a,r,h=t(this).resizable("instance"),l=h.options,c=h.element,u=l.containment,d=u instanceof t?u.get(0):/parent/.test(u)?c.parent().get(0):u;d&&(h.containerElement=t(d),/document/.test(u)||u===document?(h.containerOffset={left:0,top:0},h.containerPosition={left:0,top:0},h.parentData={element:t(document),left:0,top:0,width:t(document).width(),height:t(document).height()||document.body.parentNode.scrollHeight}):(e=t(d),i=[],t(["Top","Right","Left","Bottom"]).each(function(t,s){i[t]=h._num(e.css("padding"+s))}),h.containerOffset=e.offset(),h.containerPosition=e.position(),h.containerSize={height:e.innerHeight()-i[3],width:e.innerWidth()-i[1]},s=h.containerOffset,n=h.containerSize.height,o=h.containerSize.width,a=h._hasScroll(d,"left")?d.scrollWidth:o,r=h._hasScroll(d)?d.scrollHeight:n,h.parentData={element:d,left:s.left,top:s.top,width:a,height:r}))},resize:function(e){var i,s,n,o,a=t(this).resizable("instance"),r=a.options,h=a.containerOffset,l=a.position,c=a._aspectRatio||e.shiftKey,u={top:0,left:0},d=a.containerElement,p=!0;d[0]!==document&&/static/.test(d.css("position"))&&(u=h),l.left<(a._helper?h.left:0)&&(a.size.width=a.size.width+(a._helper?a.position.left-h.left:a.position.left-u.left),c&&(a.size.height=a.size.width/a.aspectRatio,p=!1),a.position.left=r.helper?h.left:0),l.top<(a._helper?h.top:0)&&(a.size.height=a.size.height+(a._helper?a.position.top-h.top:a.position.top),c&&(a.size.width=a.size.height*a.aspectRatio,p=!1),a.position.top=a._helper?h.top:0),n=a.containerElement.get(0)===a.element.parent().get(0),o=/relative|absolute/.test(a.containerElement.css("position")),n&&o?(a.offset.left=a.parentData.left+a.position.left,a.offset.top=a.parentData.top+a.position.top):(a.offset.left=a.element.offset().left,a.offset.top=a.element.offset().top),i=Math.abs(a.sizeDiff.width+(a._helper?a.offset.left-u.left:a.offset.left-h.left)),s=Math.abs(a.sizeDiff.height+(a._helper?a.offset.top-u.top:a.offset.top-h.top)),i+a.size.width>=a.parentData.width&&(a.size.width=a.parentData.width-i,c&&(a.size.height=a.size.width/a.aspectRatio,p=!1)),s+a.size.height>=a.parentData.height&&(a.size.height=a.parentData.height-s,c&&(a.size.width=a.size.height*a.aspectRatio,p=!1)),p||(a.position.left=a.prevPosition.left,a.position.top=a.prevPosition.top,a.size.width=a.prevSize.width,a.size.height=a.prevSize.height)},stop:function(){var e=t(this).resizable("instance"),i=e.options,s=e.containerOffset,n=e.containerPosition,o=e.containerElement,a=t(e.helper),r=a.offset(),h=a.outerWidth()-e.sizeDiff.width,l=a.outerHeight()-e.sizeDiff.height;e._helper&&!i.animate&&/relative/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l}),e._helper&&!i.animate&&/static/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l})}}),t.ui.plugin.add("resizable","alsoResize",{start:function(){var e=t(this).resizable("instance"),i=e.options;t(i.alsoResize).each(function(){var e=t(this);e.data("ui-resizable-alsoresize",{width:parseFloat(e.width()),height:parseFloat(e.height()),left:parseFloat(e.css("left")),top:parseFloat(e.css("top"))})})},resize:function(e,i){var s=t(this).resizable("instance"),n=s.options,o=s.originalSize,a=s.originalPosition,r={height:s.size.height-o.height||0,width:s.size.width-o.width||0,top:s.position.top-a.top||0,left:s.position.left-a.left||0};t(n.alsoResize).each(function(){var e=t(this),s=t(this).data("ui-resizable-alsoresize"),n={},o=e.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];t.each(o,function(t,e){var i=(s[e]||0)+(r[e]||0);i&&i>=0&&(n[e]=i||null)}),e.css(n)})},stop:function(){t(this).removeData("ui-resizable-alsoresize")}}),t.ui.plugin.add("resizable","ghost",{start:function(){var e=t(this).resizable("instance"),i=e.size;e.ghost=e.originalElement.clone(),e.ghost.css({opacity:.25,display:"block",position:"relative",height:i.height,width:i.width,margin:0,left:0,top:0}),e._addClass(e.ghost,"ui-resizable-ghost"),t.uiBackCompat!==!1&&"string"==typeof e.options.ghost&&e.ghost.addClass(this.options.ghost),e.ghost.appendTo(e.helper)},resize:function(){var e=t(this).resizable("instance");e.ghost&&e.ghost.css({position:"relative",height:e.size.height,width:e.size.width})},stop:function(){var e=t(this).resizable("instance");e.ghost&&e.helper&&e.helper.get(0).removeChild(e.ghost.get(0))}}),t.ui.plugin.add("resizable","grid",{resize:function(){var e,i=t(this).resizable("instance"),s=i.options,n=i.size,o=i.originalSize,a=i.originalPosition,r=i.axis,h="number"==typeof s.grid?[s.grid,s.grid]:s.grid,l=h[0]||1,c=h[1]||1,u=Math.round((n.width-o.width)/l)*l,d=Math.round((n.height-o.height)/c)*c,p=o.width+u,f=o.height+d,m=s.maxWidth&&p>s.maxWidth,g=s.maxHeight&&f>s.maxHeight,_=s.minWidth&&s.minWidth>p,v=s.minHeight&&s.minHeight>f;s.grid=h,_&&(p+=l),v&&(f+=c),m&&(p-=l),g&&(f-=c),/^(se|s|e)$/.test(r)?(i.size.width=p,i.size.height=f):/^(ne)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.top=a.top-d):/^(sw)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.left=a.left-u):((0>=f-c||0>=p-l)&&(e=i._getPaddingPlusBorderDimensions(this)),f-c>0?(i.size.height=f,i.position.top=a.top-d):(f=c-e.height,i.size.height=f,i.position.top=a.top+o.height-f),p-l>0?(i.size.width=p,i.position.left=a.left-u):(p=l-e.width,i.size.width=p,i.position.left=a.left+o.width-p))}}),t.ui.resizable});/** + * Copyright (c) 2007 Ariel Flesler - aflesler ○ gmail • com | https://github.com/flesler + * Licensed under MIT + * @author Ariel Flesler + * @version 2.1.2 + */ +;(function(f){"use strict";"function"===typeof define&&define.amd?define(["jquery"],f):"undefined"!==typeof module&&module.exports?module.exports=f(require("jquery")):f(jQuery)})(function($){"use strict";function n(a){return!a.nodeName||-1!==$.inArray(a.nodeName.toLowerCase(),["iframe","#document","html","body"])}function h(a){return $.isFunction(a)||$.isPlainObject(a)?a:{top:a,left:a}}var p=$.scrollTo=function(a,d,b){return $(window).scrollTo(a,d,b)};p.defaults={axis:"xy",duration:0,limit:!0};$.fn.scrollTo=function(a,d,b){"object"=== typeof d&&(b=d,d=0);"function"===typeof b&&(b={onAfter:b});"max"===a&&(a=9E9);b=$.extend({},p.defaults,b);d=d||b.duration;var u=b.queue&&1=f[g]?0:Math.min(f[g],n));!a&&1-1){targetElements.on(evt+EVENT_NAMESPACE,function elementToggle(event){$.powerTip.toggle(this,event)})}else{targetElements.on(evt+EVENT_NAMESPACE,function elementOpen(event){$.powerTip.show(this,event)})}});$.each(options.closeEvents,function(idx,evt){if($.inArray(evt,options.openEvents)<0){targetElements.on(evt+EVENT_NAMESPACE,function elementClose(event){$.powerTip.hide(this,!isMouseEvent(event))})}});targetElements.on("keydown"+EVENT_NAMESPACE,function elementKeyDown(event){if(event.keyCode===27){$.powerTip.hide(this,true)}})}return targetElements};$.fn.powerTip.defaults={fadeInTime:200,fadeOutTime:100,followMouse:false,popupId:"powerTip",popupClass:null,intentSensitivity:7,intentPollInterval:100,closeDelay:100,placement:"n",smartPlacement:false,offset:10,mouseOnToPopup:false,manual:false,openEvents:["mouseenter","focus"],closeEvents:["mouseleave","blur"]};$.fn.powerTip.smartPlacementLists={n:["n","ne","nw","s"],e:["e","ne","se","w","nw","sw","n","s","e"],s:["s","se","sw","n"],w:["w","nw","sw","e","ne","se","n","s","w"],nw:["nw","w","sw","n","s","se","nw"],ne:["ne","e","se","n","s","sw","ne"],sw:["sw","w","nw","s","n","ne","sw"],se:["se","e","ne","s","n","nw","se"],"nw-alt":["nw-alt","n","ne-alt","sw-alt","s","se-alt","w","e"],"ne-alt":["ne-alt","n","nw-alt","se-alt","s","sw-alt","e","w"],"sw-alt":["sw-alt","s","se-alt","nw-alt","n","ne-alt","w","e"],"se-alt":["se-alt","s","sw-alt","ne-alt","n","nw-alt","e","w"]};$.powerTip={show:function apiShowTip(element,event){if(isMouseEvent(event)){trackMouse(event);session.previousX=event.pageX;session.previousY=event.pageY;$(element).data(DATA_DISPLAYCONTROLLER).show()}else{$(element).first().data(DATA_DISPLAYCONTROLLER).show(true,true)}return element},reposition:function apiResetPosition(element){$(element).first().data(DATA_DISPLAYCONTROLLER).resetPosition();return element},hide:function apiCloseTip(element,immediate){var displayController;immediate=element?immediate:true;if(element){displayController=$(element).first().data(DATA_DISPLAYCONTROLLER)}else if(session.activeHover){displayController=session.activeHover.data(DATA_DISPLAYCONTROLLER)}if(displayController){displayController.hide(immediate)}return element},toggle:function apiToggle(element,event){if(session.activeHover&&session.activeHover.is(element)){$.powerTip.hide(element,!isMouseEvent(event))}else{$.powerTip.show(element,event)}return element}};$.powerTip.showTip=$.powerTip.show;$.powerTip.closeTip=$.powerTip.hide;function CSSCoordinates(){var me=this;me.top="auto";me.left="auto";me.right="auto";me.bottom="auto";me.set=function(property,value){if($.isNumeric(value)){me[property]=Math.round(value)}}}function DisplayController(element,options,tipController){var hoverTimer=null,myCloseDelay=null;function openTooltip(immediate,forceOpen){cancelTimer();if(!element.data(DATA_HASACTIVEHOVER)){if(!immediate){session.tipOpenImminent=true;hoverTimer=setTimeout(function intentDelay(){hoverTimer=null;checkForIntent()},options.intentPollInterval)}else{if(forceOpen){element.data(DATA_FORCEDOPEN,true)}closeAnyDelayed();tipController.showTip(element)}}else{cancelClose()}}function closeTooltip(disableDelay){if(myCloseDelay){myCloseDelay=session.closeDelayTimeout=clearTimeout(myCloseDelay);session.delayInProgress=false}cancelTimer();session.tipOpenImminent=false;if(element.data(DATA_HASACTIVEHOVER)){element.data(DATA_FORCEDOPEN,false);if(!disableDelay){session.delayInProgress=true;session.closeDelayTimeout=setTimeout(function closeDelay(){session.closeDelayTimeout=null;tipController.hideTip(element);session.delayInProgress=false;myCloseDelay=null},options.closeDelay);myCloseDelay=session.closeDelayTimeout}else{tipController.hideTip(element)}}}function checkForIntent(){var xDifference=Math.abs(session.previousX-session.currentX),yDifference=Math.abs(session.previousY-session.currentY),totalDifference=xDifference+yDifference;if(totalDifference",{id:options.popupId});if($body.length===0){$body=$("body")}$body.append(tipElement);session.tooltips=session.tooltips?session.tooltips.add(tipElement):tipElement}if(options.followMouse){if(!tipElement.data(DATA_HASMOUSEMOVE)){$document.on("mousemove"+EVENT_NAMESPACE,positionTipOnCursor);$window.on("scroll"+EVENT_NAMESPACE,positionTipOnCursor);tipElement.data(DATA_HASMOUSEMOVE,true)}}function beginShowTip(element){element.data(DATA_HASACTIVEHOVER,true);tipElement.queue(function queueTipInit(next){showTip(element);next()})}function showTip(element){var tipContent;if(!element.data(DATA_HASACTIVEHOVER)){return}if(session.isTipOpen){if(!session.isClosing){hideTip(session.activeHover)}tipElement.delay(100).queue(function queueTipAgain(next){showTip(element);next()});return}element.trigger("powerTipPreRender");tipContent=getTooltipContent(element);if(tipContent){tipElement.empty().append(tipContent)}else{return}element.trigger("powerTipRender");session.activeHover=element;session.isTipOpen=true;tipElement.data(DATA_MOUSEONTOTIP,options.mouseOnToPopup);tipElement.addClass(options.popupClass);if(!options.followMouse||element.data(DATA_FORCEDOPEN)){positionTipOnElement(element);session.isFixedTipOpen=true}else{positionTipOnCursor()}if(!element.data(DATA_FORCEDOPEN)&&!options.followMouse){$document.on("click"+EVENT_NAMESPACE,function documentClick(event){var target=event.target;if(target!==element[0]){if(options.mouseOnToPopup){if(target!==tipElement[0]&&!$.contains(tipElement[0],target)){$.powerTip.hide()}}else{$.powerTip.hide()}}})}if(options.mouseOnToPopup&&!options.manual){tipElement.on("mouseenter"+EVENT_NAMESPACE,function tipMouseEnter(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).cancel()}});tipElement.on("mouseleave"+EVENT_NAMESPACE,function tipMouseLeave(){if(session.activeHover){session.activeHover.data(DATA_DISPLAYCONTROLLER).hide()}})}tipElement.fadeIn(options.fadeInTime,function fadeInCallback(){if(!session.desyncTimeout){session.desyncTimeout=setInterval(closeDesyncedTip,500)}element.trigger("powerTipOpen")})}function hideTip(element){session.isClosing=true;session.isTipOpen=false;session.desyncTimeout=clearInterval(session.desyncTimeout);element.data(DATA_HASACTIVEHOVER,false);element.data(DATA_FORCEDOPEN,false);$document.off("click"+EVENT_NAMESPACE);tipElement.off(EVENT_NAMESPACE);tipElement.fadeOut(options.fadeOutTime,function fadeOutCallback(){var coords=new CSSCoordinates;session.activeHover=null;session.isClosing=false;session.isFixedTipOpen=false;tipElement.removeClass();coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);tipElement.css(coords);element.trigger("powerTipClose")})}function positionTipOnCursor(){var tipWidth,tipHeight,coords,collisions,collisionCount;if(!session.isFixedTipOpen&&(session.isTipOpen||session.tipOpenImminent&&tipElement.data(DATA_HASMOUSEMOVE))){tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=new CSSCoordinates;coords.set("top",session.currentY+options.offset);coords.set("left",session.currentX+options.offset);collisions=getViewportCollisions(coords,tipWidth,tipHeight);if(collisions!==Collision.none){collisionCount=countFlags(collisions);if(collisionCount===1){if(collisions===Collision.right){coords.set("left",session.scrollLeft+session.windowWidth-tipWidth)}else if(collisions===Collision.bottom){coords.set("top",session.scrollTop+session.windowHeight-tipHeight)}}else{coords.set("left",session.currentX-tipWidth-options.offset);coords.set("top",session.currentY-tipHeight-options.offset)}}tipElement.css(coords)}}function positionTipOnElement(element){var priorityList,finalPlacement;if(options.smartPlacement||options.followMouse&&element.data(DATA_FORCEDOPEN)){priorityList=$.fn.powerTip.smartPlacementLists[options.placement];$.each(priorityList,function(idx,pos){var collisions=getViewportCollisions(placeTooltip(element,pos),tipElement.outerWidth(),tipElement.outerHeight());finalPlacement=pos;return collisions!==Collision.none})}else{placeTooltip(element,options.placement);finalPlacement=options.placement}tipElement.removeClass("w nw sw e ne se n s w se-alt sw-alt ne-alt nw-alt");tipElement.addClass(finalPlacement)}function placeTooltip(element,placement){var iterationCount=0,tipWidth,tipHeight,coords=new CSSCoordinates;coords.set("top",0);coords.set("left",0);tipElement.css(coords);do{tipWidth=tipElement.outerWidth();tipHeight=tipElement.outerHeight();coords=placementCalculator.compute(element,placement,tipWidth,tipHeight,options.offset);tipElement.css(coords)}while(++iterationCount<=5&&(tipWidth!==tipElement.outerWidth()||tipHeight!==tipElement.outerHeight()));return coords}function closeDesyncedTip(){var isDesynced=false,hasDesyncableCloseEvent=$.grep(["mouseleave","mouseout","blur","focusout"],function(eventType){return $.inArray(eventType,options.closeEvents)!==-1}).length>0;if(session.isTipOpen&&!session.isClosing&&!session.delayInProgress&&hasDesyncableCloseEvent){if(session.activeHover.data(DATA_HASACTIVEHOVER)===false||session.activeHover.is(":disabled")){isDesynced=true}else if(!isMouseOver(session.activeHover)&&!session.activeHover.is(":focus")&&!session.activeHover.data(DATA_FORCEDOPEN)){if(tipElement.data(DATA_MOUSEONTOTIP)){if(!isMouseOver(tipElement)){isDesynced=true}}else{isDesynced=true}}if(isDesynced){hideTip(session.activeHover)}}}this.showTip=beginShowTip;this.hideTip=hideTip;this.resetPosition=positionTipOnElement}function isSvgElement(element){return Boolean(window.SVGElement&&element[0]instanceof SVGElement)}function isMouseEvent(event){return Boolean(event&&$.inArray(event.type,MOUSE_EVENTS)>-1&&typeof event.pageX==="number")}function initTracking(){if(!session.mouseTrackingActive){session.mouseTrackingActive=true;getViewportDimensions();$(getViewportDimensions);$document.on("mousemove"+EVENT_NAMESPACE,trackMouse);$window.on("resize"+EVENT_NAMESPACE,trackResize);$window.on("scroll"+EVENT_NAMESPACE,trackScroll)}}function getViewportDimensions(){session.scrollLeft=$window.scrollLeft();session.scrollTop=$window.scrollTop();session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackResize(){session.windowWidth=$window.width();session.windowHeight=$window.height()}function trackScroll(){var x=$window.scrollLeft(),y=$window.scrollTop();if(x!==session.scrollLeft){session.currentX+=x-session.scrollLeft;session.scrollLeft=x}if(y!==session.scrollTop){session.currentY+=y-session.scrollTop;session.scrollTop=y}}function trackMouse(event){session.currentX=event.pageX;session.currentY=event.pageY}function isMouseOver(element){var elementPosition=element.offset(),elementBox=element[0].getBoundingClientRect(),elementWidth=elementBox.right-elementBox.left,elementHeight=elementBox.bottom-elementBox.top;return session.currentX>=elementPosition.left&&session.currentX<=elementPosition.left+elementWidth&&session.currentY>=elementPosition.top&&session.currentY<=elementPosition.top+elementHeight}function getTooltipContent(element){var tipText=element.data(DATA_POWERTIP),tipObject=element.data(DATA_POWERTIPJQ),tipTarget=element.data(DATA_POWERTIPTARGET),targetElement,content;if(tipText){if($.isFunction(tipText)){tipText=tipText.call(element[0])}content=tipText}else if(tipObject){if($.isFunction(tipObject)){tipObject=tipObject.call(element[0])}if(tipObject.length>0){content=tipObject.clone(true,true)}}else if(tipTarget){targetElement=$("#"+tipTarget);if(targetElement.length>0){content=targetElement.html()}}return content}function getViewportCollisions(coords,elementWidth,elementHeight){var viewportTop=session.scrollTop,viewportLeft=session.scrollLeft,viewportBottom=viewportTop+session.windowHeight,viewportRight=viewportLeft+session.windowWidth,collisions=Collision.none;if(coords.topviewportBottom||Math.abs(coords.bottom-session.windowHeight)>viewportBottom){collisions|=Collision.bottom}if(coords.leftviewportRight){collisions|=Collision.left}if(coords.left+elementWidth>viewportRight||coords.right1)){a.preventDefault();var c=a.originalEvent.changedTouches[0],d=document.createEvent("MouseEvents");d.initMouseEvent(b,!0,!0,window,1,c.screenX,c.screenY,c.clientX,c.clientY,!1,!1,!1,!1,0,null),a.target.dispatchEvent(d)}}if(a.support.touch="ontouchend"in document,a.support.touch){var e,b=a.ui.mouse.prototype,c=b._mouseInit,d=b._mouseDestroy;b._touchStart=function(a){var b=this;!e&&b._mouseCapture(a.originalEvent.changedTouches[0])&&(e=!0,b._touchMoved=!1,f(a,"mouseover"),f(a,"mousemove"),f(a,"mousedown"))},b._touchMove=function(a){e&&(this._touchMoved=!0,f(a,"mousemove"))},b._touchEnd=function(a){e&&(f(a,"mouseup"),f(a,"mouseout"),this._touchMoved||f(a,"click"),e=!1)},b._mouseInit=function(){var b=this;b.element.bind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),c.call(b)},b._mouseDestroy=function(){var b=this;b.element.unbind({touchstart:a.proxy(b,"_touchStart"),touchmove:a.proxy(b,"_touchMove"),touchend:a.proxy(b,"_touchEnd")}),d.call(b)}}}(jQuery);/*! SmartMenus jQuery Plugin - v1.1.0 - September 17, 2017 + * http://www.smartmenus.org/ + * Copyright Vasil Dinkov, Vadikom Web Ltd. http://vadikom.com; Licensed MIT */(function(t){"function"==typeof define&&define.amd?define(["jquery"],t):"object"==typeof module&&"object"==typeof module.exports?module.exports=t(require("jquery")):t(jQuery)})(function($){function initMouseDetection(t){var e=".smartmenus_mouse";if(mouseDetectionEnabled||t)mouseDetectionEnabled&&t&&($(document).off(e),mouseDetectionEnabled=!1);else{var i=!0,s=null,o={mousemove:function(t){var e={x:t.pageX,y:t.pageY,timeStamp:(new Date).getTime()};if(s){var o=Math.abs(s.x-e.x),a=Math.abs(s.y-e.y);if((o>0||a>0)&&2>=o&&2>=a&&300>=e.timeStamp-s.timeStamp&&(mouse=!0,i)){var n=$(t.target).closest("a");n.is("a")&&$.each(menuTrees,function(){return $.contains(this.$root[0],n[0])?(this.itemEnter({currentTarget:n[0]}),!1):void 0}),i=!1}}s=e}};o[touchEvents?"touchstart":"pointerover pointermove pointerout MSPointerOver MSPointerMove MSPointerOut"]=function(t){isTouchEvent(t.originalEvent)&&(mouse=!1)},$(document).on(getEventsNS(o,e)),mouseDetectionEnabled=!0}}function isTouchEvent(t){return!/^(4|mouse)$/.test(t.pointerType)}function getEventsNS(t,e){e||(e="");var i={};for(var s in t)i[s.split(" ").join(e+" ")+e]=t[s];return i}var menuTrees=[],mouse=!1,touchEvents="ontouchstart"in window,mouseDetectionEnabled=!1,requestAnimationFrame=window.requestAnimationFrame||function(t){return setTimeout(t,1e3/60)},cancelAnimationFrame=window.cancelAnimationFrame||function(t){clearTimeout(t)},canAnimate=!!$.fn.animate;return $.SmartMenus=function(t,e){this.$root=$(t),this.opts=e,this.rootId="",this.accessIdPrefix="",this.$subArrow=null,this.activatedItems=[],this.visibleSubMenus=[],this.showTimeout=0,this.hideTimeout=0,this.scrollTimeout=0,this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.idInc=0,this.$firstLink=null,this.$firstSub=null,this.disabled=!1,this.$disableOverlay=null,this.$touchScrollingSub=null,this.cssTransforms3d="perspective"in t.style||"webkitPerspective"in t.style,this.wasCollapsible=!1,this.init()},$.extend($.SmartMenus,{hideAll:function(){$.each(menuTrees,function(){this.menuHideAll()})},destroy:function(){for(;menuTrees.length;)menuTrees[0].destroy();initMouseDetection(!0)},prototype:{init:function(t){var e=this;if(!t){menuTrees.push(this),this.rootId=((new Date).getTime()+Math.random()+"").replace(/\D/g,""),this.accessIdPrefix="sm-"+this.rootId+"-",this.$root.hasClass("sm-rtl")&&(this.opts.rightToLeftSubMenus=!0);var i=".smartmenus";this.$root.data("smartmenus",this).attr("data-smartmenus-id",this.rootId).dataSM("level",1).on(getEventsNS({"mouseover focusin":$.proxy(this.rootOver,this),"mouseout focusout":$.proxy(this.rootOut,this),keydown:$.proxy(this.rootKeyDown,this)},i)).on(getEventsNS({mouseenter:$.proxy(this.itemEnter,this),mouseleave:$.proxy(this.itemLeave,this),mousedown:$.proxy(this.itemDown,this),focus:$.proxy(this.itemFocus,this),blur:$.proxy(this.itemBlur,this),click:$.proxy(this.itemClick,this)},i),"a"),i+=this.rootId,this.opts.hideOnClick&&$(document).on(getEventsNS({touchstart:$.proxy(this.docTouchStart,this),touchmove:$.proxy(this.docTouchMove,this),touchend:$.proxy(this.docTouchEnd,this),click:$.proxy(this.docClick,this)},i)),$(window).on(getEventsNS({"resize orientationchange":$.proxy(this.winResize,this)},i)),this.opts.subIndicators&&(this.$subArrow=$("").addClass("sub-arrow"),this.opts.subIndicatorsText&&this.$subArrow.html(this.opts.subIndicatorsText)),initMouseDetection()}if(this.$firstSub=this.$root.find("ul").each(function(){e.menuInit($(this))}).eq(0),this.$firstLink=this.$root.find("a").eq(0),this.opts.markCurrentItem){var s=/(index|default)\.[^#\?\/]*/i,o=/#.*/,a=window.location.href.replace(s,""),n=a.replace(o,"");this.$root.find("a").each(function(){var t=this.href.replace(s,""),i=$(this);(t==a||t==n)&&(i.addClass("current"),e.opts.markCurrentTree&&i.parentsUntil("[data-smartmenus-id]","ul").each(function(){$(this).dataSM("parent-a").addClass("current")}))})}this.wasCollapsible=this.isCollapsible()},destroy:function(t){if(!t){var e=".smartmenus";this.$root.removeData("smartmenus").removeAttr("data-smartmenus-id").removeDataSM("level").off(e),e+=this.rootId,$(document).off(e),$(window).off(e),this.opts.subIndicators&&(this.$subArrow=null)}this.menuHideAll();var i=this;this.$root.find("ul").each(function(){var t=$(this);t.dataSM("scroll-arrows")&&t.dataSM("scroll-arrows").remove(),t.dataSM("shown-before")&&((i.opts.subMenusMinWidth||i.opts.subMenusMaxWidth)&&t.css({width:"",minWidth:"",maxWidth:""}).removeClass("sm-nowrap"),t.dataSM("scroll-arrows")&&t.dataSM("scroll-arrows").remove(),t.css({zIndex:"",top:"",left:"",marginLeft:"",marginTop:"",display:""})),0==(t.attr("id")||"").indexOf(i.accessIdPrefix)&&t.removeAttr("id")}).removeDataSM("in-mega").removeDataSM("shown-before").removeDataSM("scroll-arrows").removeDataSM("parent-a").removeDataSM("level").removeDataSM("beforefirstshowfired").removeAttr("role").removeAttr("aria-hidden").removeAttr("aria-labelledby").removeAttr("aria-expanded"),this.$root.find("a.has-submenu").each(function(){var t=$(this);0==t.attr("id").indexOf(i.accessIdPrefix)&&t.removeAttr("id")}).removeClass("has-submenu").removeDataSM("sub").removeAttr("aria-haspopup").removeAttr("aria-controls").removeAttr("aria-expanded").closest("li").removeDataSM("sub"),this.opts.subIndicators&&this.$root.find("span.sub-arrow").remove(),this.opts.markCurrentItem&&this.$root.find("a.current").removeClass("current"),t||(this.$root=null,this.$firstLink=null,this.$firstSub=null,this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),menuTrees.splice($.inArray(this,menuTrees),1))},disable:function(t){if(!this.disabled){if(this.menuHideAll(),!t&&!this.opts.isPopup&&this.$root.is(":visible")){var e=this.$root.offset();this.$disableOverlay=$('
').css({position:"absolute",top:e.top,left:e.left,width:this.$root.outerWidth(),height:this.$root.outerHeight(),zIndex:this.getStartZIndex(!0),opacity:0}).appendTo(document.body)}this.disabled=!0}},docClick:function(t){return this.$touchScrollingSub?(this.$touchScrollingSub=null,void 0):((this.visibleSubMenus.length&&!$.contains(this.$root[0],t.target)||$(t.target).closest("a").length)&&this.menuHideAll(),void 0)},docTouchEnd:function(){if(this.lastTouch){if(!(!this.visibleSubMenus.length||void 0!==this.lastTouch.x2&&this.lastTouch.x1!=this.lastTouch.x2||void 0!==this.lastTouch.y2&&this.lastTouch.y1!=this.lastTouch.y2||this.lastTouch.target&&$.contains(this.$root[0],this.lastTouch.target))){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var t=this;this.hideTimeout=setTimeout(function(){t.menuHideAll()},350)}this.lastTouch=null}},docTouchMove:function(t){if(this.lastTouch){var e=t.originalEvent.touches[0];this.lastTouch.x2=e.pageX,this.lastTouch.y2=e.pageY}},docTouchStart:function(t){var e=t.originalEvent.touches[0];this.lastTouch={x1:e.pageX,y1:e.pageY,target:e.target}},enable:function(){this.disabled&&(this.$disableOverlay&&(this.$disableOverlay.remove(),this.$disableOverlay=null),this.disabled=!1)},getClosestMenu:function(t){for(var e=$(t).closest("ul");e.dataSM("in-mega");)e=e.parent().closest("ul");return e[0]||null},getHeight:function(t){return this.getOffset(t,!0)},getOffset:function(t,e){var i;"none"==t.css("display")&&(i={position:t[0].style.position,visibility:t[0].style.visibility},t.css({position:"absolute",visibility:"hidden"}).show());var s=t[0].getBoundingClientRect&&t[0].getBoundingClientRect(),o=s&&(e?s.height||s.bottom-s.top:s.width||s.right-s.left);return o||0===o||(o=e?t[0].offsetHeight:t[0].offsetWidth),i&&t.hide().css(i),o},getStartZIndex:function(t){var e=parseInt(this[t?"$root":"$firstSub"].css("z-index"));return!t&&isNaN(e)&&(e=parseInt(this.$root.css("z-index"))),isNaN(e)?1:e},getTouchPoint:function(t){return t.touches&&t.touches[0]||t.changedTouches&&t.changedTouches[0]||t},getViewport:function(t){var e=t?"Height":"Width",i=document.documentElement["client"+e],s=window["inner"+e];return s&&(i=Math.min(i,s)),i},getViewportHeight:function(){return this.getViewport(!0)},getViewportWidth:function(){return this.getViewport()},getWidth:function(t){return this.getOffset(t)},handleEvents:function(){return!this.disabled&&this.isCSSOn()},handleItemEvents:function(t){return this.handleEvents()&&!this.isLinkInMegaMenu(t)},isCollapsible:function(){return"static"==this.$firstSub.css("position")},isCSSOn:function(){return"inline"!=this.$firstLink.css("display")},isFixed:function(){var t="fixed"==this.$root.css("position");return t||this.$root.parentsUntil("body").each(function(){return"fixed"==$(this).css("position")?(t=!0,!1):void 0}),t},isLinkInMegaMenu:function(t){return $(this.getClosestMenu(t[0])).hasClass("mega-menu")},isTouchMode:function(){return!mouse||this.opts.noMouseOver||this.isCollapsible()},itemActivate:function(t,e){var i=t.closest("ul"),s=i.dataSM("level");if(s>1&&(!this.activatedItems[s-2]||this.activatedItems[s-2][0]!=i.dataSM("parent-a")[0])){var o=this;$(i.parentsUntil("[data-smartmenus-id]","ul").get().reverse()).add(i).each(function(){o.itemActivate($(this).dataSM("parent-a"))})}if((!this.isCollapsible()||e)&&this.menuHideSubMenus(this.activatedItems[s-1]&&this.activatedItems[s-1][0]==t[0]?s:s-1),this.activatedItems[s-1]=t,this.$root.triggerHandler("activate.smapi",t[0])!==!1){var a=t.dataSM("sub");a&&(this.isTouchMode()||!this.opts.showOnClick||this.clickActivated)&&this.menuShow(a)}},itemBlur:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&this.$root.triggerHandler("blur.smapi",e[0])},itemClick:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(this.$touchScrollingSub&&this.$touchScrollingSub[0]==e.closest("ul")[0])return this.$touchScrollingSub=null,t.stopPropagation(),!1;if(this.$root.triggerHandler("click.smapi",e[0])===!1)return!1;var i=$(t.target).is(".sub-arrow"),s=e.dataSM("sub"),o=s?2==s.dataSM("level"):!1,a=this.isCollapsible(),n=/toggle$/.test(this.opts.collapsibleBehavior),r=/link$/.test(this.opts.collapsibleBehavior),h=/^accordion/.test(this.opts.collapsibleBehavior);if(s&&!s.is(":visible")){if((!r||!a||i)&&(this.opts.showOnClick&&o&&(this.clickActivated=!0),this.itemActivate(e,h),s.is(":visible")))return this.focusActivated=!0,!1}else if(a&&(n||i))return this.itemActivate(e,h),this.menuHide(s),n&&(this.focusActivated=!1),!1;return this.opts.showOnClick&&o||e.hasClass("disabled")||this.$root.triggerHandler("select.smapi",e[0])===!1?!1:void 0}},itemDown:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&e.dataSM("mousedown",!0)},itemEnter:function(t){var e=$(t.currentTarget);if(this.handleItemEvents(e)){if(!this.isTouchMode()){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);var i=this;this.showTimeout=setTimeout(function(){i.itemActivate(e)},this.opts.showOnClick&&1==e.closest("ul").dataSM("level")?1:this.opts.showTimeout)}this.$root.triggerHandler("mouseenter.smapi",e[0])}},itemFocus:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(!this.focusActivated||this.isTouchMode()&&e.dataSM("mousedown")||this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0]==e[0]||this.itemActivate(e,!0),this.$root.triggerHandler("focus.smapi",e[0]))},itemLeave:function(t){var e=$(t.currentTarget);this.handleItemEvents(e)&&(this.isTouchMode()||(e[0].blur(),this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0)),e.removeDataSM("mousedown"),this.$root.triggerHandler("mouseleave.smapi",e[0]))},menuHide:function(t){if(this.$root.triggerHandler("beforehide.smapi",t[0])!==!1&&(canAnimate&&t.stop(!0,!0),"none"!=t.css("display"))){var e=function(){t.css("z-index","")};this.isCollapsible()?canAnimate&&this.opts.collapsibleHideFunction?this.opts.collapsibleHideFunction.call(this,t,e):t.hide(this.opts.collapsibleHideDuration,e):canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,t,e):t.hide(this.opts.hideDuration,e),t.dataSM("scroll")&&(this.menuScrollStop(t),t.css({"touch-action":"","-ms-touch-action":"","-webkit-transform":"",transform:""}).off(".smartmenus_scroll").removeDataSM("scroll").dataSM("scroll-arrows").hide()),t.dataSM("parent-a").removeClass("highlighted").attr("aria-expanded","false"),t.attr({"aria-expanded":"false","aria-hidden":"true"});var i=t.dataSM("level");this.activatedItems.splice(i-1,1),this.visibleSubMenus.splice($.inArray(t,this.visibleSubMenus),1),this.$root.triggerHandler("hide.smapi",t[0])}},menuHideAll:function(){this.showTimeout&&(clearTimeout(this.showTimeout),this.showTimeout=0);for(var t=this.opts.isPopup?1:0,e=this.visibleSubMenus.length-1;e>=t;e--)this.menuHide(this.visibleSubMenus[e]);this.opts.isPopup&&(canAnimate&&this.$root.stop(!0,!0),this.$root.is(":visible")&&(canAnimate&&this.opts.hideFunction?this.opts.hideFunction.call(this,this.$root):this.$root.hide(this.opts.hideDuration))),this.activatedItems=[],this.visibleSubMenus=[],this.clickActivated=!1,this.focusActivated=!1,this.zIndexInc=0,this.$root.triggerHandler("hideAll.smapi")},menuHideSubMenus:function(t){for(var e=this.activatedItems.length-1;e>=t;e--){var i=this.activatedItems[e].dataSM("sub");i&&this.menuHide(i)}},menuInit:function(t){if(!t.dataSM("in-mega")){t.hasClass("mega-menu")&&t.find("ul").dataSM("in-mega",!0);for(var e=2,i=t[0];(i=i.parentNode.parentNode)!=this.$root[0];)e++;var s=t.prevAll("a").eq(-1);s.length||(s=t.prevAll().find("a").eq(-1)),s.addClass("has-submenu").dataSM("sub",t),t.dataSM("parent-a",s).dataSM("level",e).parent().dataSM("sub",t);var o=s.attr("id")||this.accessIdPrefix+ ++this.idInc,a=t.attr("id")||this.accessIdPrefix+ ++this.idInc;s.attr({id:o,"aria-haspopup":"true","aria-controls":a,"aria-expanded":"false"}),t.attr({id:a,role:"group","aria-hidden":"true","aria-labelledby":o,"aria-expanded":"false"}),this.opts.subIndicators&&s[this.opts.subIndicatorsPos](this.$subArrow.clone())}},menuPosition:function(t){var e,i,s=t.dataSM("parent-a"),o=s.closest("li"),a=o.parent(),n=t.dataSM("level"),r=this.getWidth(t),h=this.getHeight(t),u=s.offset(),l=u.left,c=u.top,d=this.getWidth(s),m=this.getHeight(s),p=$(window),f=p.scrollLeft(),v=p.scrollTop(),b=this.getViewportWidth(),S=this.getViewportHeight(),g=a.parent().is("[data-sm-horizontal-sub]")||2==n&&!a.hasClass("sm-vertical"),M=this.opts.rightToLeftSubMenus&&!o.is("[data-sm-reverse]")||!this.opts.rightToLeftSubMenus&&o.is("[data-sm-reverse]"),w=2==n?this.opts.mainMenuSubOffsetX:this.opts.subMenusSubOffsetX,T=2==n?this.opts.mainMenuSubOffsetY:this.opts.subMenusSubOffsetY;if(g?(e=M?d-r-w:w,i=this.opts.bottomToTopSubMenus?-h-T:m+T):(e=M?w-r:d-w,i=this.opts.bottomToTopSubMenus?m-T-h:T),this.opts.keepInViewport){var y=l+e,I=c+i;if(M&&f>y?e=g?f-y+e:d-w:!M&&y+r>f+b&&(e=g?f+b-r-y+e:w-r),g||(S>h&&I+h>v+S?i+=v+S-h-I:(h>=S||v>I)&&(i+=v-I)),g&&(I+h>v+S+.49||v>I)||!g&&h>S+.49){var x=this;t.dataSM("scroll-arrows")||t.dataSM("scroll-arrows",$([$('')[0],$('')[0]]).on({mouseenter:function(){t.dataSM("scroll").up=$(this).hasClass("scroll-up"),x.menuScroll(t)},mouseleave:function(e){x.menuScrollStop(t),x.menuScrollOut(t,e)},"mousewheel DOMMouseScroll":function(t){t.preventDefault()}}).insertAfter(t));var A=".smartmenus_scroll";if(t.dataSM("scroll",{y:this.cssTransforms3d?0:i-m,step:1,itemH:m,subH:h,arrowDownH:this.getHeight(t.dataSM("scroll-arrows").eq(1))}).on(getEventsNS({mouseover:function(e){x.menuScrollOver(t,e)},mouseout:function(e){x.menuScrollOut(t,e)},"mousewheel DOMMouseScroll":function(e){x.menuScrollMousewheel(t,e)}},A)).dataSM("scroll-arrows").css({top:"auto",left:"0",marginLeft:e+(parseInt(t.css("border-left-width"))||0),width:r-(parseInt(t.css("border-left-width"))||0)-(parseInt(t.css("border-right-width"))||0),zIndex:t.css("z-index")}).eq(g&&this.opts.bottomToTopSubMenus?0:1).show(),this.isFixed()){var C={};C[touchEvents?"touchstart touchmove touchend":"pointerdown pointermove pointerup MSPointerDown MSPointerMove MSPointerUp"]=function(e){x.menuScrollTouch(t,e)},t.css({"touch-action":"none","-ms-touch-action":"none"}).on(getEventsNS(C,A))}}}t.css({top:"auto",left:"0",marginLeft:e,marginTop:i-m})},menuScroll:function(t,e,i){var s,o=t.dataSM("scroll"),a=t.dataSM("scroll-arrows"),n=o.up?o.upEnd:o.downEnd;if(!e&&o.momentum){if(o.momentum*=.92,s=o.momentum,.5>s)return this.menuScrollStop(t),void 0}else s=i||(e||!this.opts.scrollAccelerate?this.opts.scrollStep:Math.floor(o.step));var r=t.dataSM("level");if(this.activatedItems[r-1]&&this.activatedItems[r-1].dataSM("sub")&&this.activatedItems[r-1].dataSM("sub").is(":visible")&&this.menuHideSubMenus(r-1),o.y=o.up&&o.y>=n||!o.up&&n>=o.y?o.y:Math.abs(n-o.y)>s?o.y+(o.up?s:-s):n,t.css(this.cssTransforms3d?{"-webkit-transform":"translate3d(0, "+o.y+"px, 0)",transform:"translate3d(0, "+o.y+"px, 0)"}:{marginTop:o.y}),mouse&&(o.up&&o.y>o.downEnd||!o.up&&o.y0;t.dataSM("scroll-arrows").eq(i?0:1).is(":visible")&&(t.dataSM("scroll").up=i,this.menuScroll(t,!0))}e.preventDefault()},menuScrollOut:function(t,e){mouse&&(/^scroll-(up|down)/.test((e.relatedTarget||"").className)||(t[0]==e.relatedTarget||$.contains(t[0],e.relatedTarget))&&this.getClosestMenu(e.relatedTarget)==t[0]||t.dataSM("scroll-arrows").css("visibility","hidden"))},menuScrollOver:function(t,e){if(mouse&&!/^scroll-(up|down)/.test(e.target.className)&&this.getClosestMenu(e.target)==t[0]){this.menuScrollRefreshData(t);var i=t.dataSM("scroll"),s=$(window).scrollTop()-t.dataSM("parent-a").offset().top-i.itemH;t.dataSM("scroll-arrows").eq(0).css("margin-top",s).end().eq(1).css("margin-top",s+this.getViewportHeight()-i.arrowDownH).end().css("visibility","visible")}},menuScrollRefreshData:function(t){var e=t.dataSM("scroll"),i=$(window).scrollTop()-t.dataSM("parent-a").offset().top-e.itemH;this.cssTransforms3d&&(i=-(parseFloat(t.css("margin-top"))-i)),$.extend(e,{upEnd:i,downEnd:i+this.getViewportHeight()-e.subH})},menuScrollStop:function(t){return this.scrollTimeout?(cancelAnimationFrame(this.scrollTimeout),this.scrollTimeout=0,t.dataSM("scroll").step=1,!0):void 0},menuScrollTouch:function(t,e){if(e=e.originalEvent,isTouchEvent(e)){var i=this.getTouchPoint(e);if(this.getClosestMenu(i.target)==t[0]){var s=t.dataSM("scroll");if(/(start|down)$/i.test(e.type))this.menuScrollStop(t)?(e.preventDefault(),this.$touchScrollingSub=t):this.$touchScrollingSub=null,this.menuScrollRefreshData(t),$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp});else if(/move$/i.test(e.type)){var o=void 0!==s.touchY?s.touchY:s.touchStartY;if(void 0!==o&&o!=i.pageY){this.$touchScrollingSub=t;var a=i.pageY>o;void 0!==s.up&&s.up!=a&&$.extend(s,{touchStartY:i.pageY,touchStartTime:e.timeStamp}),$.extend(s,{up:a,touchY:i.pageY}),this.menuScroll(t,!0,Math.abs(i.pageY-o))}e.preventDefault()}else void 0!==s.touchY&&((s.momentum=15*Math.pow(Math.abs(i.pageY-s.touchStartY)/(e.timeStamp-s.touchStartTime),2))&&(this.menuScrollStop(t),this.menuScroll(t),e.preventDefault()),delete s.touchY)}}},menuShow:function(t){if((t.dataSM("beforefirstshowfired")||(t.dataSM("beforefirstshowfired",!0),this.$root.triggerHandler("beforefirstshow.smapi",t[0])!==!1))&&this.$root.triggerHandler("beforeshow.smapi",t[0])!==!1&&(t.dataSM("shown-before",!0),canAnimate&&t.stop(!0,!0),!t.is(":visible"))){var e=t.dataSM("parent-a"),i=this.isCollapsible();if((this.opts.keepHighlighted||i)&&e.addClass("highlighted"),i)t.removeClass("sm-nowrap").css({zIndex:"",width:"auto",minWidth:"",maxWidth:"",top:"",left:"",marginLeft:"",marginTop:""});else{if(t.css("z-index",this.zIndexInc=(this.zIndexInc||this.getStartZIndex())+1),(this.opts.subMenusMinWidth||this.opts.subMenusMaxWidth)&&(t.css({width:"auto",minWidth:"",maxWidth:""}).addClass("sm-nowrap"),this.opts.subMenusMinWidth&&t.css("min-width",this.opts.subMenusMinWidth),this.opts.subMenusMaxWidth)){var s=this.getWidth(t);t.css("max-width",this.opts.subMenusMaxWidth),s>this.getWidth(t)&&t.removeClass("sm-nowrap").css("width",this.opts.subMenusMaxWidth)}this.menuPosition(t)}var o=function(){t.css("overflow","")};i?canAnimate&&this.opts.collapsibleShowFunction?this.opts.collapsibleShowFunction.call(this,t,o):t.show(this.opts.collapsibleShowDuration,o):canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,t,o):t.show(this.opts.showDuration,o),e.attr("aria-expanded","true"),t.attr({"aria-expanded":"true","aria-hidden":"false"}),this.visibleSubMenus.push(t),this.$root.triggerHandler("show.smapi",t[0])}},popupHide:function(t){this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0);var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},t?1:this.opts.hideTimeout)},popupShow:function(t,e){if(!this.opts.isPopup)return alert('SmartMenus jQuery Error:\n\nIf you want to show this menu via the "popupShow" method, set the isPopup:true option.'),void 0;if(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),this.$root.dataSM("shown-before",!0),canAnimate&&this.$root.stop(!0,!0),!this.$root.is(":visible")){this.$root.css({left:t,top:e});var i=this,s=function(){i.$root.css("overflow","")};canAnimate&&this.opts.showFunction?this.opts.showFunction.call(this,this.$root,s):this.$root.show(this.opts.showDuration,s),this.visibleSubMenus[0]=this.$root}},refresh:function(){this.destroy(!0),this.init(!0)},rootKeyDown:function(t){if(this.handleEvents())switch(t.keyCode){case 27:var e=this.activatedItems[0];if(e){this.menuHideAll(),e[0].focus();var i=e.dataSM("sub");i&&this.menuHide(i)}break;case 32:var s=$(t.target);if(s.is("a")&&this.handleItemEvents(s)){var i=s.dataSM("sub");i&&!i.is(":visible")&&(this.itemClick({currentTarget:t.target}),t.preventDefault())}}},rootOut:function(t){if(this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&(this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0),!this.opts.showOnClick||!this.opts.hideOnClick)){var e=this;this.hideTimeout=setTimeout(function(){e.menuHideAll()},this.opts.hideTimeout)}},rootOver:function(t){this.handleEvents()&&!this.isTouchMode()&&t.target!=this.$root[0]&&this.hideTimeout&&(clearTimeout(this.hideTimeout),this.hideTimeout=0)},winResize:function(t){if(this.handleEvents()){if(!("onorientationchange"in window)||"orientationchange"==t.type){var e=this.isCollapsible();this.wasCollapsible&&e||(this.activatedItems.length&&this.activatedItems[this.activatedItems.length-1][0].blur(),this.menuHideAll()),this.wasCollapsible=e}}else if(this.$disableOverlay){var i=this.$root.offset();this.$disableOverlay.css({top:i.top,left:i.left,width:this.$root.outerWidth(),height:this.$root.outerHeight()})}}}}),$.fn.dataSM=function(t,e){return e?this.data(t+"_smartmenus",e):this.data(t+"_smartmenus")},$.fn.removeDataSM=function(t){return this.removeData(t+"_smartmenus")},$.fn.smartmenus=function(options){if("string"==typeof options){var args=arguments,method=options;return Array.prototype.shift.call(args),this.each(function(){var t=$(this).data("smartmenus");t&&t[method]&&t[method].apply(t,args)})}return this.each(function(){var dataOpts=$(this).data("sm-options")||null;if(dataOpts)try{dataOpts=eval("("+dataOpts+")")}catch(e){dataOpts=null,alert('ERROR\n\nSmartMenus jQuery init:\nInvalid "data-sm-options" attribute value syntax.')}new $.SmartMenus(this,$.extend({},$.fn.smartmenus.defaults,options,dataOpts))})},$.fn.smartmenus.defaults={isPopup:!1,mainMenuSubOffsetX:0,mainMenuSubOffsetY:0,subMenusSubOffsetX:0,subMenusSubOffsetY:0,subMenusMinWidth:"10em",subMenusMaxWidth:"20em",subIndicators:!0,subIndicatorsPos:"append",subIndicatorsText:"",scrollStep:30,scrollAccelerate:!0,showTimeout:250,hideTimeout:500,showDuration:0,showFunction:null,hideDuration:0,hideFunction:function(t,e){t.fadeOut(200,e)},collapsibleShowDuration:0,collapsibleShowFunction:function(t,e){t.slideDown(200,e)},collapsibleHideDuration:0,collapsibleHideFunction:function(t,e){t.slideUp(200,e)},showOnClick:!1,hideOnClick:!0,noMouseOver:!1,keepInViewport:!0,keepHighlighted:!0,markCurrentItem:!1,markCurrentTree:!0,rightToLeftSubMenus:!1,bottomToTopSubMenus:!1,collapsibleBehavior:"default"},$}); \ No newline at end of file diff --git a/menu.js b/menu.js new file mode 100644 index 000000000..d18a2fe2a --- /dev/null +++ b/menu.js @@ -0,0 +1,51 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file + */ +function initMenu(relPath,searchEnabled,serverSide,searchPage,search) { + function makeTree(data,relPath) { + var result=''; + if ('children' in data) { + result+=''; + } + return result; + } + + $('#main-nav').append(makeTree(menudata,relPath)); + $('#main-nav').children(':first').addClass('sm sm-dox').attr('id','main-menu'); + if (searchEnabled) { + if (serverSide) { + $('#main-menu').append('
  • '); + } else { + $('#main-menu').append('
  • '); + } + } + $('#main-menu').smartmenus(); +} +/* @license-end */ diff --git a/menudata.js b/menudata.js new file mode 100644 index 000000000..67de24047 --- /dev/null +++ b/menudata.js @@ -0,0 +1,133 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file +*/ +var menudata={children:[ +{text:"Main Page",url:"index.html"}, +{text:"Related Pages",url:"pages.html"}, +{text:"Modules",url:"modules.html"}, +{text:"Namespaces",url:"namespaces.html",children:[ +{text:"Namespace List",url:"namespaces.html"}, +{text:"Namespace Members",url:"namespacemembers.html",children:[ +{text:"All",url:"namespacemembers.html"}, +{text:"Functions",url:"namespacemembers_func.html"}]}]}, +{text:"Classes",url:"annotated.html",children:[ +{text:"Class List",url:"annotated.html"}, +{text:"Class Index",url:"classes.html"}, +{text:"Class Members",url:"functions.html",children:[ +{text:"All",url:"functions.html",children:[ +{text:"_",url:"functions.html#index__5F"}, +{text:"a",url:"functions.html#index_a"}, +{text:"c",url:"functions.html#index_c"}, +{text:"d",url:"functions.html#index_d"}, +{text:"e",url:"functions.html#index_e"}, +{text:"f",url:"functions.html#index_f"}, +{text:"g",url:"functions.html#index_g"}, +{text:"h",url:"functions.html#index_h"}, +{text:"i",url:"functions.html#index_i"}, +{text:"k",url:"functions.html#index_k"}, +{text:"l",url:"functions.html#index_l"}, +{text:"m",url:"functions.html#index_m"}, +{text:"n",url:"functions.html#index_n"}, +{text:"o",url:"functions.html#index_o"}, +{text:"p",url:"functions.html#index_p"}, +{text:"q",url:"functions.html#index_q"}, +{text:"r",url:"functions.html#index_r"}, +{text:"s",url:"functions.html#index_s"}, +{text:"t",url:"functions.html#index_t"}, +{text:"v",url:"functions.html#index_v"}, +{text:"w",url:"functions.html#index_w"}, +{text:"x",url:"functions.html#index_x"}, +{text:"y",url:"functions.html#index_y"}, +{text:"~",url:"functions.html#index__7E"}]}, +{text:"Functions",url:"functions_func.html",children:[ +{text:"a",url:"functions_func.html#index_a"}, +{text:"c",url:"functions_func.html#index_c"}, +{text:"d",url:"functions_func.html#index_d"}, +{text:"e",url:"functions_func.html#index_e"}, +{text:"f",url:"functions_func.html#index_f"}, +{text:"g",url:"functions_func.html#index_g"}, +{text:"h",url:"functions_func.html#index_h"}, +{text:"i",url:"functions_func.html#index_i"}, +{text:"l",url:"functions_func.html#index_l"}, +{text:"m",url:"functions_func.html#index_m"}, +{text:"n",url:"functions_func.html#index_n"}, +{text:"o",url:"functions_func.html#index_o"}, +{text:"p",url:"functions_func.html#index_p"}, +{text:"q",url:"functions_func.html#index_q"}, +{text:"r",url:"functions_func.html#index_r"}, +{text:"s",url:"functions_func.html#index_s"}, +{text:"t",url:"functions_func.html#index_t"}, +{text:"v",url:"functions_func.html#index_v"}, +{text:"~",url:"functions_func.html#index__7E"}]}, +{text:"Variables",url:"functions_vars.html"}, +{text:"Related Functions",url:"functions_rela.html"}]}]}, +{text:"Files",url:"files.html",children:[ +{text:"File List",url:"files.html"}, +{text:"File Members",url:"globals.html",children:[ +{text:"All",url:"globals.html",children:[ +{text:"_",url:"globals.html#index__5F"}, +{text:"a",url:"globals_a.html#index_a"}, +{text:"b",url:"globals_b.html#index_b"}, +{text:"c",url:"globals_c.html#index_c"}, +{text:"d",url:"globals_d.html#index_d"}, +{text:"e",url:"globals_e.html#index_e"}, +{text:"f",url:"globals_f.html#index_f"}, +{text:"g",url:"globals_g.html#index_g"}, +{text:"h",url:"globals_h.html#index_h"}, +{text:"i",url:"globals_i.html#index_i"}, +{text:"j",url:"globals_j.html#index_j"}, +{text:"k",url:"globals_k.html#index_k"}, +{text:"l",url:"globals_l.html#index_l"}, +{text:"m",url:"globals_m.html#index_m"}, +{text:"n",url:"globals_n.html#index_n"}, +{text:"o",url:"globals_o.html#index_o"}, +{text:"p",url:"globals_p.html#index_p"}, +{text:"r",url:"globals_r.html#index_r"}, +{text:"s",url:"globals_s.html#index_s"}, +{text:"t",url:"globals_t.html#index_t"}, +{text:"u",url:"globals_u.html#index_u"}]}, +{text:"Functions",url:"globals_func.html",children:[ +{text:"_",url:"globals_func.html#index__5F"}, +{text:"a",url:"globals_func_a.html#index_a"}, +{text:"b",url:"globals_func_b.html#index_b"}, +{text:"c",url:"globals_func_c.html#index_c"}, +{text:"d",url:"globals_func_d.html#index_d"}, +{text:"e",url:"globals_func_e.html#index_e"}, +{text:"f",url:"globals_func_f.html#index_f"}, +{text:"g",url:"globals_func_g.html#index_g"}, +{text:"h",url:"globals_func_h.html#index_h"}, +{text:"i",url:"globals_func_i.html#index_i"}, +{text:"j",url:"globals_func_j.html#index_j"}, +{text:"l",url:"globals_func_l.html#index_l"}, +{text:"m",url:"globals_func_m.html#index_m"}, +{text:"n",url:"globals_func_n.html#index_n"}, +{text:"o",url:"globals_func_o.html#index_o"}, +{text:"p",url:"globals_func_p.html#index_p"}, +{text:"r",url:"globals_func_r.html#index_r"}, +{text:"s",url:"globals_func_s.html#index_s"}, +{text:"t",url:"globals_func_t.html#index_t"}, +{text:"u",url:"globals_func_u.html#index_u"}]}, +{text:"Variables",url:"globals_vars.html"}, +{text:"Typedefs",url:"globals_type.html"}, +{text:"Macros",url:"globals_defs.html"}]}]}]} diff --git a/modules.html b/modules.html new file mode 100644 index 000000000..55ee5bfae --- /dev/null +++ b/modules.html @@ -0,0 +1,114 @@ + + + + + + + +Algorithms_in_C++: Modules + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ +  1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    +
    Modules
    +
    +
    +
    Here is a list of all modules:
    +
    +
    + + + + diff --git a/modules.js b/modules.js new file mode 100644 index 000000000..d43b2dc9f --- /dev/null +++ b/modules.js @@ -0,0 +1,5 @@ +var modules = +[ + [ "Machine Learning Algorithms", "d9/d66/group__machine__learning.html", "d9/d66/group__machine__learning" ], + [ "Ordinary Differential Equations", "d6/d60/group__ode.html", "d6/d60/group__ode" ] +]; \ No newline at end of file diff --git a/namespacemembers.html b/namespacemembers.html new file mode 100644 index 000000000..432392fc4 --- /dev/null +++ b/namespacemembers.html @@ -0,0 +1,172 @@ + + + + + + + +Algorithms_in_C++: Namespace Members + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ +  1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    Here is a list of all documented namespace members with links to the namespaces they belong to:
    +
    +
    + + + + diff --git a/namespacemembers_func.html b/namespacemembers_func.html new file mode 100644 index 000000000..3d68f5d1b --- /dev/null +++ b/namespacemembers_func.html @@ -0,0 +1,172 @@ + + + + + + + +Algorithms_in_C++: Namespace Members + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ +  1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    +
    + + + + diff --git a/namespaces.html b/namespaces.html new file mode 100644 index 000000000..3cc552a41 --- /dev/null +++ b/namespaces.html @@ -0,0 +1,118 @@ + + + + + + + +Algorithms_in_C++: Namespace List + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ +  1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    +
    Namespace List
    +
    +
    +
    Here is a list of all documented namespaces with brief descriptions:
    + + + + + + + +
     Nmachine_learningMachine learning algorithms
     Nqr_algorithmFunctions to compute QR decomposition of any rectangular matrix
     NsortingSorting algorithms
     NstatisticsStatistical algorithms
     NstdSTL namespace
     Nstring_searchString search algorithms
    +
    +
    +
    + + + + diff --git a/namespaces_dup.js b/namespaces_dup.js new file mode 100644 index 000000000..299508f82 --- /dev/null +++ b/namespaces_dup.js @@ -0,0 +1,9 @@ +var namespaces_dup = +[ + [ "machine_learning", "d8/d77/namespacemachine__learning.html", null ], + [ "qr_algorithm", "d2/d3b/namespaceqr__algorithm.html", null ], + [ "sorting", "d5/d91/namespacesorting.html", null ], + [ "statistics", "d2/dcf/namespacestatistics.html", null ], + [ "std", "d8/dcc/namespacestd.html", null ], + [ "string_search", "d9/d03/namespacestring__search.html", null ] +]; \ No newline at end of file diff --git a/nav_f.png b/nav_f.png new file mode 100644 index 0000000000000000000000000000000000000000..72a58a529ed3a9ed6aa0c51a79cf207e026deee2 GIT binary patch literal 153 zcmeAS@N?(olHy`uVBq!ia0vp^j6iI`!2~2XGqLUlQVE_ejv*C{Z|{2ZH7M}7UYxc) zn!W8uqtnIQ>_z8U literal 0 HcmV?d00001 diff --git a/nav_g.png b/nav_g.png new file mode 100644 index 0000000000000000000000000000000000000000..2093a237a94f6c83e19ec6e5fd42f7ddabdafa81 GIT binary patch literal 95 zcmeAS@N?(olHy`uVBq!ia0vp^j6lrB!3HFm1ilyoDK$?Q$B+ufw|5PB85lU25BhtE tr?otc=hd~V+ws&_A@j8Fiv!KF$B+ufw|5=67#uj90@pIL wZ=Q8~_Ju`#59=RjDrmm`tMD@M=!-l18IR?&vFVdQ&MBb@0HFXL=0 ? varName.substring(i+1) : varName; + return eval(n.replace(/\-/g,'_')); +} + +function stripPath(uri) +{ + return uri.substring(uri.lastIndexOf('/')+1); +} + +function stripPath2(uri) +{ + var i = uri.lastIndexOf('/'); + var s = uri.substring(i+1); + var m = uri.substring(0,i+1).match(/\/d\w\/d\w\w\/$/); + return m ? uri.substring(i-6) : s; +} + +function hashValue() +{ + return $(location).attr('hash').substring(1).replace(/[^\w\-]/g,''); +} + +function hashUrl() +{ + return '#'+hashValue(); +} + +function pathName() +{ + return $(location).attr('pathname').replace(/[^-A-Za-z0-9+&@#/%?=~_|!:,.;\(\)]/g, ''); +} + +function localStorageSupported() +{ + try { + return 'localStorage' in window && window['localStorage'] !== null && window.localStorage.getItem; + } + catch(e) { + return false; + } +} + +function storeLink(link) +{ + if (!$("#nav-sync").hasClass('sync') && localStorageSupported()) { + window.localStorage.setItem('navpath',link); + } +} + +function deleteLink() +{ + if (localStorageSupported()) { + window.localStorage.setItem('navpath',''); + } +} + +function cachedLink() +{ + if (localStorageSupported()) { + return window.localStorage.getItem('navpath'); + } else { + return ''; + } +} + +function getScript(scriptName,func,show) +{ + var head = document.getElementsByTagName("head")[0]; + var script = document.createElement('script'); + script.id = scriptName; + script.type = 'text/javascript'; + script.onload = func; + script.src = scriptName+'.js'; + head.appendChild(script); +} + +function createIndent(o,domNode,node,level) +{ + var level=-1; + var n = node; + while (n.parentNode) { level++; n=n.parentNode; } + if (node.childrenData) { + var imgNode = document.createElement("span"); + imgNode.className = 'arrow'; + imgNode.style.paddingLeft=(16*level).toString()+'px'; + imgNode.innerHTML=arrowRight; + node.plus_img = imgNode; + node.expandToggle = document.createElement("a"); + node.expandToggle.href = "javascript:void(0)"; + node.expandToggle.onclick = function() { + if (node.expanded) { + $(node.getChildrenUL()).slideUp("fast"); + node.plus_img.innerHTML=arrowRight; + node.expanded = false; + } else { + expandNode(o, node, false, false); + } + } + node.expandToggle.appendChild(imgNode); + domNode.appendChild(node.expandToggle); + } else { + var span = document.createElement("span"); + span.className = 'arrow'; + span.style.width = 16*(level+1)+'px'; + span.innerHTML = ' '; + domNode.appendChild(span); + } +} + +var animationInProgress = false; + +function gotoAnchor(anchor,aname,updateLocation) +{ + var pos, docContent = $('#doc-content'); + var ancParent = $(anchor.parent()); + if (ancParent.hasClass('memItemLeft') || + ancParent.hasClass('memtitle') || + ancParent.hasClass('fieldname') || + ancParent.hasClass('fieldtype') || + ancParent.is(':header')) + { + pos = ancParent.position().top; + } else if (anchor.position()) { + pos = anchor.position().top; + } + if (pos) { + var dist = Math.abs(Math.min( + pos-docContent.offset().top, + docContent[0].scrollHeight- + docContent.height()-docContent.scrollTop())); + animationInProgress=true; + docContent.animate({ + scrollTop: pos + docContent.scrollTop() - docContent.offset().top + },Math.max(50,Math.min(500,dist)),function(){ + if (updateLocation) window.location.href=aname; + animationInProgress=false; + }); + } +} + +function newNode(o, po, text, link, childrenData, lastNode) +{ + var node = new Object(); + node.children = Array(); + node.childrenData = childrenData; + node.depth = po.depth + 1; + node.relpath = po.relpath; + node.isLast = lastNode; + + node.li = document.createElement("li"); + po.getChildrenUL().appendChild(node.li); + node.parentNode = po; + + node.itemDiv = document.createElement("div"); + node.itemDiv.className = "item"; + + node.labelSpan = document.createElement("span"); + node.labelSpan.className = "label"; + + createIndent(o,node.itemDiv,node,0); + node.itemDiv.appendChild(node.labelSpan); + node.li.appendChild(node.itemDiv); + + var a = document.createElement("a"); + node.labelSpan.appendChild(a); + node.label = document.createTextNode(text); + node.expanded = false; + a.appendChild(node.label); + if (link) { + var url; + if (link.substring(0,1)=='^') { + url = link.substring(1); + link = url; + } else { + url = node.relpath+link; + } + a.className = stripPath(link.replace('#',':')); + if (link.indexOf('#')!=-1) { + var aname = '#'+link.split('#')[1]; + var srcPage = stripPath(pathName()); + var targetPage = stripPath(link.split('#')[0]); + a.href = srcPage!=targetPage ? url : "javascript:void(0)"; + a.onclick = function(){ + storeLink(link); + if (!$(a).parent().parent().hasClass('selected')) + { + $('.item').removeClass('selected'); + $('.item').removeAttr('id'); + $(a).parent().parent().addClass('selected'); + $(a).parent().parent().attr('id','selected'); + } + var anchor = $(aname); + gotoAnchor(anchor,aname,true); + }; + } else { + a.href = url; + a.onclick = function() { storeLink(link); } + } + } else { + if (childrenData != null) + { + a.className = "nolink"; + a.href = "javascript:void(0)"; + a.onclick = node.expandToggle.onclick; + } + } + + node.childrenUL = null; + node.getChildrenUL = function() { + if (!node.childrenUL) { + node.childrenUL = document.createElement("ul"); + node.childrenUL.className = "children_ul"; + node.childrenUL.style.display = "none"; + node.li.appendChild(node.childrenUL); + } + return node.childrenUL; + }; + + return node; +} + +function showRoot() +{ + var headerHeight = $("#top").height(); + var footerHeight = $("#nav-path").height(); + var windowHeight = $(window).height() - headerHeight - footerHeight; + (function (){ // retry until we can scroll to the selected item + try { + var navtree=$('#nav-tree'); + navtree.scrollTo('#selected',100,{offset:-windowHeight/2}); + } catch (err) { + setTimeout(arguments.callee, 0); + } + })(); +} + +function expandNode(o, node, imm, showRoot) +{ + if (node.childrenData && !node.expanded) { + if (typeof(node.childrenData)==='string') { + var varName = node.childrenData; + getScript(node.relpath+varName,function(){ + node.childrenData = getData(varName); + expandNode(o, node, imm, showRoot); + }, showRoot); + } else { + if (!node.childrenVisited) { + getNode(o, node); + } + $(node.getChildrenUL()).slideDown("fast"); + node.plus_img.innerHTML = arrowDown; + node.expanded = true; + } + } +} + +function glowEffect(n,duration) +{ + n.addClass('glow').delay(duration).queue(function(next){ + $(this).removeClass('glow');next(); + }); +} + +function highlightAnchor() +{ + var aname = hashUrl(); + var anchor = $(aname); + if (anchor.parent().attr('class')=='memItemLeft'){ + var rows = $('.memberdecls tr[class$="'+hashValue()+'"]'); + glowEffect(rows.children(),300); // member without details + } else if (anchor.parent().attr('class')=='fieldname'){ + glowEffect(anchor.parent().parent(),1000); // enum value + } else if (anchor.parent().attr('class')=='fieldtype'){ + glowEffect(anchor.parent().parent(),1000); // struct field + } else if (anchor.parent().is(":header")) { + glowEffect(anchor.parent(),1000); // section header + } else { + glowEffect(anchor.next(),1000); // normal member + } +} + +function selectAndHighlight(hash,n) +{ + var a; + if (hash) { + var link=stripPath(pathName())+':'+hash.substring(1); + a=$('.item a[class$="'+link+'"]'); + } + if (a && a.length) { + a.parent().parent().addClass('selected'); + a.parent().parent().attr('id','selected'); + highlightAnchor(); + } else if (n) { + $(n.itemDiv).addClass('selected'); + $(n.itemDiv).attr('id','selected'); + } + if ($('#nav-tree-contents .item:first').hasClass('selected')) { + $('#nav-sync').css('top','30px'); + } else { + $('#nav-sync').css('top','5px'); + } + showRoot(); +} + +function showNode(o, node, index, hash) +{ + if (node && node.childrenData) { + if (typeof(node.childrenData)==='string') { + var varName = node.childrenData; + getScript(node.relpath+varName,function(){ + node.childrenData = getData(varName); + showNode(o,node,index,hash); + },true); + } else { + if (!node.childrenVisited) { + getNode(o, node); + } + $(node.getChildrenUL()).css({'display':'block'}); + node.plus_img.innerHTML = arrowDown; + node.expanded = true; + var n = node.children[o.breadcrumbs[index]]; + if (index+11) hash = '#'+parts[1].replace(/[^\w\-]/g,''); + else hash=''; + } + if (hash.match(/^#l\d+$/)) { + var anchor=$('a[name='+hash.substring(1)+']'); + glowEffect(anchor.parent(),1000); // line number + hash=''; // strip line number anchors + } + var url=root+hash; + var i=-1; + while (NAVTREEINDEX[i+1]<=url) i++; + if (i==-1) { i=0; root=NAVTREE[0][1]; } // fallback: show index + if (navTreeSubIndices[i]) { + gotoNode(o,i,root,hash,relpath) + } else { + getScript(relpath+'navtreeindex'+i,function(){ + navTreeSubIndices[i] = eval('NAVTREEINDEX'+i); + if (navTreeSubIndices[i]) { + gotoNode(o,i,root,hash,relpath); + } + },true); + } +} + +function showSyncOff(n,relpath) +{ + n.html(''); +} + +function showSyncOn(n,relpath) +{ + n.html(''); +} + +function toggleSyncButton(relpath) +{ + var navSync = $('#nav-sync'); + if (navSync.hasClass('sync')) { + navSync.removeClass('sync'); + showSyncOff(navSync,relpath); + storeLink(stripPath2(pathName())+hashUrl()); + } else { + navSync.addClass('sync'); + showSyncOn(navSync,relpath); + deleteLink(); + } +} + +var loadTriggered = false; +var readyTriggered = false; +var loadObject,loadToRoot,loadUrl,loadRelPath; + +$(window).on('load',function(){ + if (readyTriggered) { // ready first + navTo(loadObject,loadToRoot,loadUrl,loadRelPath); + showRoot(); + } + loadTriggered=true; +}); + +function initNavTree(toroot,relpath) +{ + var o = new Object(); + o.toroot = toroot; + o.node = new Object(); + o.node.li = document.getElementById("nav-tree-contents"); + o.node.childrenData = NAVTREE; + o.node.children = new Array(); + o.node.childrenUL = document.createElement("ul"); + o.node.getChildrenUL = function() { return o.node.childrenUL; }; + o.node.li.appendChild(o.node.childrenUL); + o.node.depth = 0; + o.node.relpath = relpath; + o.node.expanded = false; + o.node.isLast = true; + o.node.plus_img = document.createElement("span"); + o.node.plus_img.className = 'arrow'; + o.node.plus_img.innerHTML = arrowRight; + + if (localStorageSupported()) { + var navSync = $('#nav-sync'); + if (cachedLink()) { + showSyncOff(navSync,relpath); + navSync.removeClass('sync'); + } else { + showSyncOn(navSync,relpath); + } + navSync.click(function(){ toggleSyncButton(relpath); }); + } + + if (loadTriggered) { // load before ready + navTo(o,toroot,hashUrl(),relpath); + showRoot(); + } else { // ready before load + loadObject = o; + loadToRoot = toroot; + loadUrl = hashUrl(); + loadRelPath = relpath; + readyTriggered=true; + } + + $(window).bind('hashchange', function(){ + if (window.location.hash && window.location.hash.length>1){ + var a; + if ($(location).attr('hash')){ + var clslink=stripPath(pathName())+':'+hashValue(); + a=$('.item a[class$="'+clslink.replace(/1|%O$WD@{VPM$7~Ar*{o?;hlAFyLXmaDC0y znK1_#cQqJWPES%4Uujug^TE?jMft$}Eq^WaR~)%f)vSNs&gek&x%A9X9sM + + + + + + +Algorithms_in_C++: Related Pages + + + + + + + + + + + + + + + +
    +
    + + + + + + +
    +
    Algorithms_in_C++ +  1.0.0 +
    +
    Set of algorithms implemented in C++.
    +
    +
    + + + + + + + +
    +
    + +
    +
    +
    + +
    + +
    +
    + + +
    + +
    + +
    +
    +
    Related Pages
    +
    +
    +
    Here is a list of all related documentation pages:
    +
    +
    + + + + diff --git a/resize.js b/resize.js new file mode 100644 index 000000000..e1ad0fe3b --- /dev/null +++ b/resize.js @@ -0,0 +1,140 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file + */ +function initResizable() +{ + var cookie_namespace = 'doxygen'; + var sidenav,navtree,content,header,collapsed,collapsedWidth=0,barWidth=6,desktop_vp=768,titleHeight; + + function readCookie(cookie) + { + var myCookie = cookie_namespace+"_"+cookie+"="; + if (document.cookie) { + var index = document.cookie.indexOf(myCookie); + if (index != -1) { + var valStart = index + myCookie.length; + var valEnd = document.cookie.indexOf(";", valStart); + if (valEnd == -1) { + valEnd = document.cookie.length; + } + var val = document.cookie.substring(valStart, valEnd); + return val; + } + } + return 0; + } + + function writeCookie(cookie, val, expiration) + { + if (val==undefined) return; + if (expiration == null) { + var date = new Date(); + date.setTime(date.getTime()+(10*365*24*60*60*1000)); // default expiration is one week + expiration = date.toGMTString(); + } + document.cookie = cookie_namespace + "_" + cookie + "=" + val + "; expires=" + expiration+"; path=/"; + } + + function resizeWidth() + { + var windowWidth = $(window).width() + "px"; + var sidenavWidth = $(sidenav).outerWidth(); + content.css({marginLeft:parseInt(sidenavWidth)+"px"}); + writeCookie('width',sidenavWidth-barWidth, null); + } + + function restoreWidth(navWidth) + { + var windowWidth = $(window).width() + "px"; + content.css({marginLeft:parseInt(navWidth)+barWidth+"px"}); + sidenav.css({width:navWidth + "px"}); + } + + function resizeHeight() + { + var headerHeight = header.outerHeight(); + var footerHeight = footer.outerHeight(); + var windowHeight = $(window).height() - headerHeight - footerHeight; + content.css({height:windowHeight + "px"}); + navtree.css({height:windowHeight + "px"}); + sidenav.css({height:windowHeight + "px"}); + var width=$(window).width(); + if (width!=collapsedWidth) { + if (width=desktop_vp) { + if (!collapsed) { + collapseExpand(); + } + } else if (width>desktop_vp && collapsedWidth0) { + restoreWidth(0); + collapsed=true; + } + else { + var width = readCookie('width'); + if (width>200 && width<$(window).width()) { restoreWidth(width); } else { restoreWidth(200); } + collapsed=false; + } + } + + header = $("#top"); + sidenav = $("#side-nav"); + content = $("#doc-content"); + navtree = $("#nav-tree"); + footer = $("#nav-path"); + $(".side-nav-resizable").resizable({resize: function(e, ui) { resizeWidth(); } }); + $(sidenav).resizable({ minWidth: 0 }); + $(window).resize(function() { resizeHeight(); }); + var device = navigator.userAgent.toLowerCase(); + var touch_device = device.match(/(iphone|ipod|ipad|android)/); + if (touch_device) { /* wider split bar for touch only devices */ + $(sidenav).css({ paddingRight:'20px' }); + $('.ui-resizable-e').css({ width:'20px' }); + $('#nav-sync').css({ right:'34px' }); + barWidth=20; + } + var width = readCookie('width'); + if (width) { restoreWidth(width); } else { resizeWidth(); } + resizeHeight(); + var url = location.href; + var i=url.indexOf("#"); + if (i>=0) window.location.hash=url.substr(i); + var _preventDefault = function(evt) { evt.preventDefault(); }; + $("#splitbar").bind("dragstart", _preventDefault).bind("selectstart", _preventDefault); + $(".ui-resizable-handle").dblclick(collapseExpand); + $(window).on('load',resizeHeight); +} +/* @license-end */ diff --git a/search/all_0.html b/search/all_0.html new file mode 100644 index 000000000..ea50fff7e --- /dev/null +++ b/search/all_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_0.js b/search/all_0.js new file mode 100644 index 000000000..b7b9f2df0 --- /dev/null +++ b/search/all_0.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['_5fdigits_0',['_digits',['../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57',1,'large_number']]], + ['_5fexit_1',['_Exit',['http://en.cppreference.com/w/cpp/utility/program/_Exit.html',0,'std']]], + ['_5frandom_2',['_random',['../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485',1,'kohonen_som_topology.cpp']]], + ['_5ftarget_3',['_target',['../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027',1,'ternary_search.cpp']]] +]; diff --git a/search/all_1.html b/search/all_1.html new file mode 100644 index 000000000..86b0682cc --- /dev/null +++ b/search/all_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_1.js b/search/all_1.js new file mode 100644 index 000000000..302b72201 --- /dev/null +++ b/search/all_1.js @@ -0,0 +1,96 @@ +var searchData= +[ + ['a_4',['a',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::a()'],['../d7/d35/matrix__exponentiation_8cpp.html#a9ecd98ce0064e2f7f97bb6a92f58ee72',1,'a(): matrix_exponentiation.cpp']]], + ['ab_5',['ab',['../d7/d35/matrix__exponentiation_8cpp.html#a8bcf0bfddddfd7f6d0848703632d795d',1,'matrix_exponentiation.cpp']]], + ['abort_6',['abort',['http://en.cppreference.com/w/cpp/utility/program/abort.html',0,'std']]], + ['abs_28float_29_7',['abs(float)',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]], + ['abs_28int_29_8',['abs(int)',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['absoluteprecision_9',['absolutePrecision',['../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc',1,'ternary_search.cpp']]], + ['accumulate_10',['accumulate',['http://en.cppreference.com/w/cpp/algorithm/accumulate.html',0,'std']]], + ['accuracy_11',['accuracy',['../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3',1,'machine_learning::adaline::accuracy()'],['../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689',1,'ACCURACY(): durand_kerner_roots.cpp']]], + ['acos_12',['acos',['http://en.cppreference.com/w/cpp/numeric/math/acos.html',0,'std']]], + ['acosh_13',['acosh',['http://en.cppreference.com/w/cpp/numeric/math/acosh.html',0,'std']]], + ['adaline_14',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html',1,'machine_learning::adaline'],['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline::adaline()']]], + ['adaline_5flearning_2ecpp_15',['adaline_learning.cpp',['../d5/db0/adaline__learning_8cpp.html',1,'']]], + ['add_16',['add',['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'string_fibonacci.cpp']]], + ['add_5fconst_17',['add_const',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['add_5fcv_18',['add_cv',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['add_5fdigit_19',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]], + ['add_5flvalue_5freference_20',['add_lvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]], + ['add_5fpointer_21',['add_pointer',['http://en.cppreference.com/w/cpp/types/add_pointer.html',0,'std']]], + ['add_5frvalue_5freference_22',['add_rvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]], + ['add_5fvolatile_23',['add_volatile',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['addedge_24',['addEdge',['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge(Edge const &edge)'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge(unsigned int source, unsigned int destination)']]], + ['addition_5frule_2ecpp_25',['addition_rule.cpp',['../d6/d4a/addition__rule_8cpp.html',1,'']]], + ['addition_5frule_5fdependent_26',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]], + ['addition_5frule_5findependent_27',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]], + ['address_28',['address',['http://en.cppreference.com/w/cpp/memory/allocator/address.html',0,'std::allocator']]], + ['addressof_29',['addressof',['http://en.cppreference.com/w/cpp/memory/addressof.html',0,'std']]], + ['addvertices_30',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]], + ['adjacent_5fdifference_31',['adjacent_difference',['http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html',0,'std']]], + ['adjacent_5ffind_32',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]], + ['adopt_5flock_5ft_33',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['advance_34',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]], + ['align_35',['align',['http://en.cppreference.com/w/cpp/memory/align.html',0,'std']]], + ['aligned_5fstorage_36',['aligned_storage',['http://en.cppreference.com/w/cpp/types/aligned_storage.html',0,'std']]], + ['aligned_5funion_37',['aligned_union',['http://en.cppreference.com/w/cpp/types/aligned_union.html',0,'std']]], + ['alignment_5fof_38',['alignment_of',['http://en.cppreference.com/w/cpp/types/alignment_of.html',0,'std']]], + ['all_39',['all',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['all_5fof_40',['all_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['allocate_41',['allocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/allocate.html',0,'std::allocator_traits::allocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/allocate.html',0,'std::allocator::allocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/allocate.html',0,'std::scoped_allocator_adaptor::allocate()']]], + ['allocate_5fshared_42',['allocate_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html',0,'std']]], + ['allocator_43',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator.html',0,'std::allocator< T >'],['http://en.cppreference.com/w/cpp/memory/allocator/allocator.html',0,'std::allocator::allocator()']]], + ['allocator_5farg_5ft_44',['allocator_arg_t',['http://en.cppreference.com/w/cpp/memory/allocator_arg_t.html',0,'std']]], + ['allocator_5ftraits_45',['allocator_traits',['http://en.cppreference.com/w/cpp/memory/allocator_traits.html',0,'std']]], + ['alpha_46',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], + ['always_5fnoconv_47',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()']]], + ['ans_48',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]], + ['any_49',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['any_5fof_50',['any_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['append_51',['append',['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::basic_string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::wstring::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u16string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u32string::append()']]], + ['array_52',['array',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['asctime_53',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]], + ['asin_54',['asin',['http://en.cppreference.com/w/cpp/numeric/math/asin.html',0,'std']]], + ['asinh_55',['asinh',['http://en.cppreference.com/w/cpp/numeric/math/asinh.html',0,'std']]], + ['assign_56',['assign',['http://en.cppreference.com/w/cpp/container/vector/assign.html',0,'std::vector::assign()'],['http://en.cppreference.com/w/cpp/string/char_traits/assign.html',0,'std::char_traits::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::string::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::basic_regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::wregex::assign()'],['http://en.cppreference.com/w/cpp/container/forward_list/assign.html',0,'std::forward_list::assign()'],['http://en.cppreference.com/w/cpp/error/error_code/assign.html',0,'std::error_code::assign()'],['http://en.cppreference.com/w/cpp/container/deque/assign.html',0,'std::deque::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::basic_string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::wstring::assign()'],['http://en.cppreference.com/w/cpp/utility/functional/function/assign.html',0,'std::function::assign()'],['http://en.cppreference.com/w/cpp/error/error_condition/assign.html',0,'std::error_condition::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u16string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u32string::assign()'],['http://en.cppreference.com/w/cpp/container/list/assign.html',0,'std::list::assign()']]], + ['async_57',['async',['http://en.cppreference.com/w/cpp/thread/async.html',0,'std']]], + ['at_58',['at',['http://en.cppreference.com/w/cpp/container/dynarray/at.html',0,'std::dynarray::at()'],['http://en.cppreference.com/w/cpp/container/vector/at.html',0,'std::vector::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::string::at()'],['http://en.cppreference.com/w/cpp/container/unordered_map/at.html',0,'std::unordered_map::at()'],['http://en.cppreference.com/w/cpp/container/deque/at.html',0,'std::deque::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::basic_string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::wstring::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u16string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u32string::at()'],['http://en.cppreference.com/w/cpp/container/map/at.html',0,'std::map::at()'],['http://en.cppreference.com/w/cpp/container/array/at.html',0,'std::array::at()']]], + ['at_5fquick_5fexit_59',['at_quick_exit',['http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html',0,'std']]], + ['atan_60',['atan',['http://en.cppreference.com/w/cpp/numeric/math/atan.html',0,'std']]], + ['atan2_61',['atan2',['http://en.cppreference.com/w/cpp/numeric/math/atan2.html',0,'std']]], + ['atanh_62',['atanh',['http://en.cppreference.com/w/cpp/numeric/math/atanh.html',0,'std']]], + ['atexit_63',['atexit',['http://en.cppreference.com/w/cpp/utility/program/atexit.html',0,'std']]], + ['atof_64',['atof',['http://en.cppreference.com/w/cpp/string/byte/atof.html',0,'std']]], + ['atoi_65',['atoi',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atol_66',['atol',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atoll_67',['atoll',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atomic_68',['atomic',['http://en.cppreference.com/w/cpp/atomic/atomic.html',0,'std::atomic< T >'],['http://en.cppreference.com/w/cpp/atomic/atomic/atomic.html',0,'std::atomic::atomic()']]], + ['atomic_5fcompare_5fexchange_5fstrong_69',['atomic_compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fstrong_5fexplicit_70',['atomic_compare_exchange_strong_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fweak_71',['atomic_compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fweak_5fexplicit_72',['atomic_compare_exchange_weak_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fexchange_73',['atomic_exchange',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]], + ['atomic_5fexchange_5fexplicit_74',['atomic_exchange_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]], + ['atomic_5ffetch_5fadd_75',['atomic_fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]], + ['atomic_5ffetch_5fadd_5fexplicit_76',['atomic_fetch_add_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]], + ['atomic_5ffetch_5fand_77',['atomic_fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fand_5fexplicit_78',['atomic_fetch_and_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5for_79',['atomic_fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]], + ['atomic_5ffetch_5for_5fexplicit_80',['atomic_fetch_or_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]], + ['atomic_5ffetch_5fsub_81',['atomic_fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fsub_5fexplicit_82',['atomic_fetch_sub_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fxor_83',['atomic_fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]], + ['atomic_5ffetch_5fxor_5fexplicit_84',['atomic_fetch_xor_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]], + ['atomic_5fflag_85',['atomic_flag',['http://en.cppreference.com/w/cpp/atomic/atomic_flag.html',0,'std::atomic_flag'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/atomic_flag.html',0,'std::atomic_flag::atomic_flag()']]], + ['atomic_5finit_86',['atomic_init',['http://en.cppreference.com/w/cpp/atomic/atomic_init.html',0,'std']]], + ['atomic_5fis_5flock_5ffree_87',['atomic_is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html',0,'std']]], + ['atomic_5fload_88',['atomic_load',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]], + ['atomic_5fload_5fexplicit_89',['atomic_load_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]], + ['atomic_5fsignal_5ffence_90',['atomic_signal_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html',0,'std']]], + ['atomic_5fstore_91',['atomic_store',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], + ['atomic_5fstore_5fexplicit_92',['atomic_store_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], + ['atomic_5fthread_5ffence_93',['atomic_thread_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html',0,'std']]], + ['auto_5fptr_94',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr.html',0,'std::auto_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/auto_ptr.html',0,'std::auto_ptr::auto_ptr()']]], + ['availarray_95',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]], + ['avltree_2ecpp_96',['avltree.cpp',['../d8/dee/avltree_8cpp.html',1,'']]] +]; diff --git a/search/all_10.html b/search/all_10.html new file mode 100644 index 000000000..b9106743b --- /dev/null +++ b/search/all_10.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_10.js b/search/all_10.js new file mode 100644 index 000000000..888eb908b --- /dev/null +++ b/search/all_10.js @@ -0,0 +1,96 @@ +var searchData= +[ + ['p_1079',['p',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/p.html',0,'std::bernoulli_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/p.html',0,'std::geometric_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution::p()']]], + ['packaged_5ftask_1080',['packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task.html',0,'std::packaged_task'],['http://en.cppreference.com/w/cpp/thread/packaged_task/packaged_task.html',0,'std::packaged_task::packaged_task()']]], + ['pair_1081',['pair',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std::pair'],['http://en.cppreference.com/w/cpp/utility/pair/pair.html',0,'std::pair::pair()']]], + ['palindrome_5fof_5fnumber_2ecpp_1082',['palindrome_of_number.cpp',['../da/d9a/palindrome__of__number_8cpp.html',1,'']]], + ['param_1083',['param',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()']]], + ['paranthesis_5fmatching_2ecpp_1084',['paranthesis_matching.cpp',['../dc/dc5/paranthesis__matching_8cpp.html',1,'']]], + ['partial_5fsort_1085',['partial_sort',['http://en.cppreference.com/w/cpp/algorithm/partial_sort.html',0,'std']]], + ['partial_5fsort_5fcopy_1086',['partial_sort_copy',['http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html',0,'std']]], + ['partial_5fsum_1087',['partial_sum',['http://en.cppreference.com/w/cpp/algorithm/partial_sum.html',0,'std']]], + ['partition_1088',['partition',['http://en.cppreference.com/w/cpp/algorithm/partition.html',0,'std::partition()'],['../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e',1,'sorting::partition()']]], + ['partition_5fcopy_1089',['partition_copy',['http://en.cppreference.com/w/cpp/algorithm/partition_copy.html',0,'std']]], + ['partition_5fpoint_1090',['partition_point',['http://en.cppreference.com/w/cpp/algorithm/partition_point.html',0,'std']]], + ['pascal_5ftriangle_1091',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#afd3f52dd56ddedbf7af5d26a202a199e',1,'pascal_triangle.cpp']]], + ['pascal_5ftriangle_2ecpp_1092',['pascal_triangle.cpp',['../dc/d1a/pascal__triangle_8cpp.html',1,'']]], + ['pattern_1093',['pattern',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct_byname::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_base::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_put::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_get::pattern']]], + ['pb_1094',['pb',['../d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b',1,'matrix_exponentiation.cpp']]], + ['pbackfail_1095',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()']]], + ['pbase_1096',['pbase',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pbase()']]], + ['pbump_1097',['pbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wfilebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::strstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::streambuf::pbump()']]], + ['pcount_1098',['pcount',['http://en.cppreference.com/w/cpp/io/strstreambuf/pcount.html',0,'std::strstreambuf::pcount()'],['http://en.cppreference.com/w/cpp/io/strstream/pcount.html',0,'std::strstream::pcount()'],['http://en.cppreference.com/w/cpp/io/ostrstream/pcount.html',0,'std::ostrstream::pcount()']]], + ['peek_1099',['peek',['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::strstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istrstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wiostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wfstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wstringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::ifstream::peek()']]], + ['perror_1100',['perror',['http://en.cppreference.com/w/cpp/io/c/perror.html',0,'std']]], + ['peta_1101',['peta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['phifunction_1102',['phiFunction',['../da/d23/eulers__totient__function_8cpp.html#a35e4874a3e1d67eb708dc57944c8aea0',1,'eulers_totient_function.cpp']]], + ['pico_1103',['pico',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['piecewise_5fconstant_5fdistribution_1104',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution::piecewise_constant_distribution()']]], + ['piecewise_5fconstruct_5ft_1105',['piecewise_construct_t',['http://en.cppreference.com/w/cpp/utility/piecewise_construct_t.html',0,'std']]], + ['piecewise_5flinear_5fdistribution_1106',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution::piecewise_linear_distribution()']]], + ['placeholders_1107',['placeholders',['http://en.cppreference.com/w/cpp/utility/functional/placeholders.html',0,'std']]], + ['plus_1108',['plus',['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std']]], + ['point_1109',['Point',['../d8/dc8/struct_point.html',1,'Point'],['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point::Point()']]], + ['pointer_5fsafety_1110',['pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html',0,'std']]], + ['pointer_5fto_1111',['pointer_to',['http://en.cppreference.com/w/cpp/memory/pointer_traits/pointer_to.html',0,'std::pointer_traits']]], + ['pointer_5ftraits_1112',['pointer_traits',['http://en.cppreference.com/w/cpp/memory/pointer_traits.html',0,'std']]], + ['pointincircle_1113',['PointInCircle',['../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad',1,'smallest_circle.cpp']]], + ['poisson_5fdist_2ecpp_1114',['poisson_dist.cpp',['../d9/d24/poisson__dist_8cpp.html',1,'']]], + ['poisson_5fdistribution_1115',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution.html',0,'std::poisson_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/poisson_distribution.html',0,'std::poisson_distribution::poisson_distribution()']]], + ['poisson_5fexpected_1116',['poisson_expected',['../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71',1,'poisson_dist.cpp']]], + ['poisson_5frange_5fsuccesses_1117',['poisson_range_successes',['../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a',1,'poisson_dist.cpp']]], + ['poisson_5frate_1118',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]], + ['poisson_5fx_5fsuccesses_1119',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]], + ['poly_5ffunction_1120',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#a51637ff89e55ca749993d3e84b95d153',1,'durand_kerner_roots.cpp']]], + ['pop_1121',['pop',['http://en.cppreference.com/w/cpp/container/stack/pop.html',0,'std::stack::pop()'],['http://en.cppreference.com/w/cpp/container/queue/pop.html',0,'std::queue::pop()'],['http://en.cppreference.com/w/cpp/container/priority_queue/pop.html',0,'std::priority_queue::pop()'],['../d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc',1,'stack::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop(): paranthesis_matching.cpp']]], + ['pop_5fback_1122',['pop_back',['http://en.cppreference.com/w/cpp/container/vector/pop_back.html',0,'std::vector::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::string::pop_back()'],['http://en.cppreference.com/w/cpp/container/deque/pop_back.html',0,'std::deque::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::basic_string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::wstring::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u16string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u32string::pop_back()'],['http://en.cppreference.com/w/cpp/container/list/pop_back.html',0,'std::list::pop_back()']]], + ['pop_5ffront_1123',['pop_front',['http://en.cppreference.com/w/cpp/container/forward_list/pop_front.html',0,'std::forward_list::pop_front()'],['http://en.cppreference.com/w/cpp/container/deque/pop_front.html',0,'std::deque::pop_front()'],['http://en.cppreference.com/w/cpp/container/list/pop_front.html',0,'std::list::pop_front()']]], + ['pop_5fheap_1124',['pop_heap',['http://en.cppreference.com/w/cpp/algorithm/pop_heap.html',0,'std']]], + ['pos_5fformat_1125',['pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::pos_format()']]], + ['position_1126',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]], + ['positive_5fsign_1127',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()']]], + ['pow_1128',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]], + ['power_1129',['power',['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a5769b745458157ef2679949155684f3b',1,'power(const vector< vector< ll >> &A, ll p): matrix_exponentiation.cpp']]], + ['power_5ffor_5fhuge_5fnumbers_2ecpp_1130',['power_for_huge_numbers.cpp',['../df/def/power__for__huge__numbers_8cpp.html',1,'']]], + ['pptr_1131',['pptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pptr()']]], + ['precision_1132',['precision',['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ios::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ios_base::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::strstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wiostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wfstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wstringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ifstream::precision()']]], + ['predict_1133',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline']]], + ['predict_5fols_5fregressor_1134',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4bcaaf41c66da4d3a471dacef133def7',1,'ordinary_least_squares_regressor.cpp']]], + ['prefix_1135',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]], + ['prev_1136',['prev',['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std']]], + ['prev_5fpermutation_1137',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]], + ['primality_5ftest_2ecpp_1138',['primality_test.cpp',['../da/d7b/primality__test_8cpp.html',1,'']]], + ['prime_1139',['prime',['../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95',1,'prime(): primes_up_to_billion.cpp'],['../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8',1,'PRIME(): rabin_karp.cpp']]], + ['prime_5ffactorization_1140',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]], + ['prime_5ffactorization_2ecpp_1141',['prime_factorization.cpp',['../db/d0d/prime__factorization_8cpp.html',1,'']]], + ['prime_5fnumbers_1142',['prime_numbers',['../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe',1,'prime_factorization.cpp']]], + ['prime_5fnumbers_2ecpp_1143',['prime_numbers.cpp',['../de/d9b/prime__numbers_8cpp.html',1,'']]], + ['primes_1144',['primes',['../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3',1,'prime_numbers.cpp']]], + ['primes_5fup_5fto_5fbillion_2ecpp_1145',['primes_up_to_billion.cpp',['../d4/d9c/primes__up__to__billion_8cpp.html',1,'']]], + ['print_1146',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46',1,'sieve_of_eratosthenes.cpp']]], + ['printf_1147',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['priority_5fqueue_1148',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std::priority_queue< T >'],['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue::priority_queue()']]], + ['probabilities_1149',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]], + ['problem_1150',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_semi_implicit_euler.cpp']]], + ['promise_1151',['promise',['http://en.cppreference.com/w/cpp/thread/promise.html',0,'std::promise'],['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise::promise()']]], + ['ptrdiff_5ft_1152',['ptrdiff_t',['http://en.cppreference.com/w/cpp/types/ptrdiff_t.html',0,'std']]], + ['pubimbue_1153',['pubimbue',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::pubimbue()']]], + ['pubseekoff_1154',['pubseekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::pubseekoff()']]], + ['pubseekpos_1155',['pubseekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::pubseekpos()']]], + ['pubsetbuf_1156',['pubsetbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::pubsetbuf()']]], + ['pubsync_1157',['pubsync',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::pubsync()']]], + ['push_1158',['push',['http://en.cppreference.com/w/cpp/container/stack/push.html',0,'std::stack::push()'],['http://en.cppreference.com/w/cpp/container/queue/push.html',0,'std::queue::push()'],['http://en.cppreference.com/w/cpp/container/priority_queue/push.html',0,'std::priority_queue::push()'],['../d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d',1,'stack::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push(): paranthesis_matching.cpp']]], + ['push_5fback_1159',['push_back',['http://en.cppreference.com/w/cpp/container/vector/push_back.html',0,'std::vector::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::string::push_back()'],['http://en.cppreference.com/w/cpp/container/deque/push_back.html',0,'std::deque::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::basic_string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::wstring::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u16string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u32string::push_back()'],['http://en.cppreference.com/w/cpp/container/list/push_back.html',0,'std::list::push_back()']]], + ['push_5ffront_1160',['push_front',['http://en.cppreference.com/w/cpp/container/forward_list/push_front.html',0,'std::forward_list::push_front()'],['http://en.cppreference.com/w/cpp/container/deque/push_front.html',0,'std::deque::push_front()'],['http://en.cppreference.com/w/cpp/container/list/push_front.html',0,'std::list::push_front()']]], + ['push_5fheap_1161',['push_heap',['http://en.cppreference.com/w/cpp/algorithm/push_heap.html',0,'std']]], + ['put_1162',['put',['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::strstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_stringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wiostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ofstream::put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostrstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wfstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wstringstream::put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::put()']]], + ['put_5fmoney_1163',['put_money',['http://en.cppreference.com/w/cpp/io/manip/put_money.html',0,'std']]], + ['put_5ftime_1164',['put_time',['http://en.cppreference.com/w/cpp/io/manip/put_time.html',0,'std']]], + ['putback_1165',['putback',['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::strstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istrstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wiostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wfstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wstringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::ifstream::putback()']]], + ['putc_1166',['putc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], + ['putchar_1167',['putchar',['http://en.cppreference.com/w/cpp/io/c/putchar.html',0,'std']]], + ['puts_1168',['puts',['http://en.cppreference.com/w/cpp/io/c/puts.html',0,'std']]], + ['putwchar_1169',['putwchar',['http://en.cppreference.com/w/cpp/io/c/putwchar.html',0,'std']]], + ['pword_1170',['pword',['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ios::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ios_base::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::strstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wiostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wfstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wstringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ifstream::pword()']]], + ['prime_20factorization_1171',['Prime factorization',['../d7/d7f/section.html',1,'']]] +]; diff --git a/search/all_11.html b/search/all_11.html new file mode 100644 index 000000000..459c97797 --- /dev/null +++ b/search/all_11.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_11.js b/search/all_11.js new file mode 100644 index 000000000..e1fedd2f5 --- /dev/null +++ b/search/all_11.js @@ -0,0 +1,18 @@ +var searchData= +[ + ['qr_5falgorithm_1172',['qr_algorithm',['../d2/d3b/namespaceqr__algorithm.html',1,'']]], + ['qr_5fdecompose_1173',['qr_decompose',['../d2/d3b/namespaceqr__algorithm.html#ab1ac74497ffb2101040cc1efe3546de8',1,'qr_algorithm']]], + ['qr_5fdecompose_2eh_1174',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]], + ['qr_5fdecomposition_2ecpp_1175',['qr_decomposition.cpp',['../d3/d24/qr__decomposition_8cpp.html',1,'']]], + ['qr_5feigen_5fvalues_2ecpp_1176',['qr_eigen_values.cpp',['../de/d75/qr__eigen__values_8cpp.html',1,'']]], + ['qsort_1177',['qsort',['http://en.cppreference.com/w/cpp/algorithm/qsort.html',0,'std']]], + ['query_1178',['query',['../dd/d1b/structquery.html',1,'']]], + ['queue_1179',['queue',['../d2/d36/structqueue.html',1,'queue< Kind >'],['http://en.cppreference.com/w/cpp/container/queue.html',0,'std::queue< T >'],['../d4/da4/class_queue.html',1,'Queue'],['http://en.cppreference.com/w/cpp/container/queue/queue.html',0,'std::queue::queue()'],['../d2/d36/structqueue.html#a21381ee7f95daae0332665914780e970',1,'queue::queue()']]], + ['queue_5farray_1180',['Queue_Array',['../d0/dd2/class_queue___array.html',1,'']]], + ['queuefront_1181',['queueFront',['../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5',1,'queue']]], + ['queuerear_1182',['queueRear',['../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5',1,'queue']]], + ['quick_5fexit_1183',['quick_exit',['http://en.cppreference.com/w/cpp/utility/program/quick_exit.html',0,'std']]], + ['quick_5fsort_2ecpp_1184',['quick_sort.cpp',['../d1/d21/quick__sort_8cpp.html',1,'']]], + ['quicksort_1185',['quickSort',['../d5/d91/namespacesorting.html#a50b66a1c652291b9a346ec7342967178',1,'sorting']]], + ['quiet_5fnan_1186',['quiet_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/quiet_NaN.html',0,'std::numeric_limits']]] +]; diff --git a/search/all_12.html b/search/all_12.html new file mode 100644 index 000000000..290ee76ee --- /dev/null +++ b/search/all_12.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_12.js b/search/all_12.js new file mode 100644 index 000000000..64caa7374 --- /dev/null +++ b/search/all_12.js @@ -0,0 +1,97 @@ +var searchData= +[ + ['rabin_5fkarp_1187',['rabin_karp',['../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9',1,'string_search']]], + ['rabin_5fkarp_2ecpp_1188',['rabin_karp.cpp',['../d6/dce/rabin__karp_8cpp.html',1,'']]], + ['raise_1189',['raise',['http://en.cppreference.com/w/cpp/utility/program/raise.html',0,'std']]], + ['rand_1190',['rand',['http://en.cppreference.com/w/cpp/numeric/random/rand.html',0,'std']]], + ['random_5faccess_5fiterator_5ftag_1191',['random_access_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['random_5fdevice_1192',['random_device',['http://en.cppreference.com/w/cpp/numeric/random/random_device.html',0,'std::random_device'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/random_device.html',0,'std::random_device::random_device()']]], + ['random_5fshuffle_1193',['random_shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]], + ['range_5ferror_1194',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error'],['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error::range_error()']]], + ['rank_1195',['rank',['http://en.cppreference.com/w/cpp/types/rank.html',0,'std']]], + ['ranlux24_1196',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::ranlux24'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux24::ranlux24()']]], + ['ranlux24_5fbase_1197',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::ranlux24_base'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux24_base::ranlux24_base()']]], + ['ranlux48_1198',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::ranlux48'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux48::ranlux48()']]], + ['ranlux48_5fbase_1199',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::ranlux48_base'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux48_base::ranlux48_base()']]], + ['ratio_1200',['ratio',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['ratio_5fadd_1201',['ratio_add',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_add.html',0,'std']]], + ['ratio_5fdivide_1202',['ratio_divide',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_divide.html',0,'std']]], + ['ratio_5fequal_1203',['ratio_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_equal.html',0,'std']]], + ['ratio_5fgreater_1204',['ratio_greater',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater.html',0,'std']]], + ['ratio_5fgreater_5fequal_1205',['ratio_greater_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater_equal.html',0,'std']]], + ['ratio_5fless_1206',['ratio_less',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less.html',0,'std']]], + ['ratio_5fless_5fequal_1207',['ratio_less_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less_equal.html',0,'std']]], + ['ratio_5fmultiply_1208',['ratio_multiply',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_multiply.html',0,'std']]], + ['ratio_5fnot_5fequal_1209',['ratio_not_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_not_equal.html',0,'std']]], + ['ratio_5fsubtract_1210',['ratio_subtract',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_subtract.html',0,'std']]], + ['raw_5fstorage_5fiterator_1211',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator.html',0,'std::raw_storage_iterator'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/raw_storage_iterator.html',0,'std::raw_storage_iterator::raw_storage_iterator()']]], + ['rbegin_1212',['rbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::rbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::rbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::rbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::rbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::rbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::rbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::rbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::rbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::rbegin()']]], + ['rdbuf_1213',['rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/rdbuf.html',0,'std::wbuffer_convert::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ios::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::strstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wiostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wfstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wstringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ifstream::rdbuf()']]], + ['rdstate_1214',['rdstate',['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ios::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::strstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wiostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wfstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wstringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ifstream::rdstate()']]], + ['read_1215',['read',['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::strstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istrstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wiostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wfstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wstringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::ifstream::read()']]], + ['readsome_1216',['readsome',['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::strstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istrstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wiostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wfstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wstringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::ifstream::readsome()']]], + ['ready_1217',['ready',['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::match_results::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wsmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::smatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wcmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::cmatch::ready()']]], + ['real_1218',['real',['http://en.cppreference.com/w/cpp/numeric/complex/real.html',0,'std::complex']]], + ['realloc_1219',['realloc',['http://en.cppreference.com/w/cpp/memory/c/realloc.html',0,'std']]], + ['realtime_5fstats_2ecpp_1220',['realtime_stats.cpp',['../d0/d08/realtime__stats_8cpp.html',1,'']]], + ['rec_5fternary_5fsearch_1221',['rec_ternary_search',['../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead',1,'ternary_search.cpp']]], + ['recalculate_5fhash_1222',['recalculate_hash',['../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893',1,'string_search']]], + ['recursive_5fmutex_1223',['recursive_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_mutex.html',0,'std::recursive_mutex'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/recursive_mutex.html',0,'std::recursive_mutex::recursive_mutex()']]], + ['recursive_5ftimed_5fmutex_1224',['recursive_timed_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex.html',0,'std::recursive_timed_mutex'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/recursive_timed_mutex.html',0,'std::recursive_timed_mutex::recursive_timed_mutex()']]], + ['ref_1225',['ref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], + ['reference_1226',['reference',['http://en.cppreference.com/w/cpp/utility/bitset/reference.html',0,'std::bitset']]], + ['reference_5fwrapper_1227',['reference_wrapper',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper.html',0,'std::reference_wrapper'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/reference_wrapper.html',0,'std::reference_wrapper::reference_wrapper()']]], + ['regex_1228',['regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::regex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::regex::regex()']]], + ['regex_5ferror_1229',['regex_error',['http://en.cppreference.com/w/cpp/regex/regex_error.html',0,'std::regex_error'],['http://en.cppreference.com/w/cpp/regex/regex_error/regex_error.html',0,'std::regex_error::regex_error()']]], + ['regex_5fiterator_1230',['regex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::regex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::regex_iterator::regex_iterator()']]], + ['regex_5fmatch_1231',['regex_match',['http://en.cppreference.com/w/cpp/regex/regex_match.html',0,'std']]], + ['regex_5freplace_1232',['regex_replace',['http://en.cppreference.com/w/cpp/regex/regex_replace.html',0,'std']]], + ['regex_5fsearch_1233',['regex_search',['http://en.cppreference.com/w/cpp/regex/regex_search.html',0,'std']]], + ['regex_5ftoken_5fiterator_1234',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::regex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::regex_token_iterator::regex_token_iterator()']]], + ['regex_5ftraits_1235',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits.html',0,'std::regex_traits'],['http://en.cppreference.com/w/cpp/regex/regex_traits/regex_traits.html',0,'std::regex_traits::regex_traits()']]], + ['register_5fcallback_1236',['register_callback',['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ios::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ios_base::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::strstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wiostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wfstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wstringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ifstream::register_callback()']]], + ['rehash_1237',['rehash',['http://en.cppreference.com/w/cpp/container/unordered_map/rehash.html',0,'std::unordered_map::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/rehash.html',0,'std::unordered_multimap::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/rehash.html',0,'std::unordered_multiset::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_set/rehash.html',0,'std::unordered_set::rehash()']]], + ['release_1238',['release',['http://en.cppreference.com/w/cpp/thread/unique_lock/release.html',0,'std::unique_lock::release()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/release.html',0,'std::unique_ptr::release()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/release.html',0,'std::shared_lock::release()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/release.html',0,'std::auto_ptr::release()']]], + ['remainder_1239',['remainder',['http://en.cppreference.com/w/cpp/numeric/math/remainder.html',0,'std']]], + ['remove_1240',['remove',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove()']]], + ['remove_5fall_5fextents_1241',['remove_all_extents',['http://en.cppreference.com/w/cpp/types/remove_all_extents.html',0,'std']]], + ['remove_5fconst_1242',['remove_const',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['remove_5fcopy_1243',['remove_copy',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], + ['remove_5fcopy_5fif_1244',['remove_copy_if',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], + ['remove_5fcv_1245',['remove_cv',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['remove_5fextent_1246',['remove_extent',['http://en.cppreference.com/w/cpp/types/remove_extent.html',0,'std']]], + ['remove_5fif_1247',['remove_if',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove_if()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove_if()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove_if()']]], + ['remove_5fpointer_1248',['remove_pointer',['http://en.cppreference.com/w/cpp/types/remove_pointer.html',0,'std']]], + ['remove_5freference_1249',['remove_reference',['http://en.cppreference.com/w/cpp/types/remove_reference.html',0,'std']]], + ['remove_5fvolatile_1250',['remove_volatile',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['removewordhelper_1251',['removeWordHelper',['../dd/d2f/class_trie.html#a95216ffc56cb9f8cede982cecb872af4',1,'Trie']]], + ['remquo_1252',['remquo',['http://en.cppreference.com/w/cpp/numeric/math/remquo.html',0,'std']]], + ['rename_1253',['rename',['http://en.cppreference.com/w/cpp/io/c/rename.html',0,'std']]], + ['rend_1254',['rend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::rend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::rend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::rend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::rend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::rend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::rend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::rend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::rend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::rend()']]], + ['replace_1255',['replace',['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::basic_string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::wstring::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u16string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u32string::replace()'],['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std::replace()']]], + ['replace_5fcopy_1256',['replace_copy',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], + ['replace_5fcopy_5fif_1257',['replace_copy_if',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], + ['replace_5fif_1258',['replace_if',['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std']]], + ['reserve_1259',['reserve',['http://en.cppreference.com/w/cpp/container/vector/reserve.html',0,'std::vector::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_map/reserve.html',0,'std::unordered_map::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/reserve.html',0,'std::unordered_multimap::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::basic_string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::wstring::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/reserve.html',0,'std::unordered_multiset::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u16string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u32string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_set/reserve.html',0,'std::unordered_set::reserve()']]], + ['reset_1260',['reset',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/reset.html',0,'std::student_t_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/reset.html',0,'std::extreme_value_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/reset.html',0,'std::lognormal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/reset.html',0,'std::weak_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/reset.html',0,'std::discrete_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/reset.html',0,'std::piecewise_constant_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/reset.html',0,'std::poisson_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/reset.html',0,'std::bernoulli_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html',0,'std::shared_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/reset.html',0,'std::exponential_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/reset.html',0,'std::uniform_real_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/reset.html',0,'std::geometric_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/reset.html',0,'std::normal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html',0,'std::unique_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/reset.html',0,'std::weibull_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/reset.html',0,'std::negative_binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/reset.html',0,'std::chi_squared_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/reset.html',0,'std::piecewise_linear_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/reset.html',0,'std::uniform_int_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/reset.html',0,'std::fisher_f_distribution::reset()'],['http://en.cppreference.com/w/cpp/utility/bitset/reset.html',0,'std::bitset::reset()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/reset.html',0,'std::auto_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/reset.html',0,'std::gamma_distribution::reset()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/reset.html',0,'std::packaged_task::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/reset.html',0,'std::binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/reset.html',0,'std::cauchy_distribution::reset()']]], + ['resetiosflags_1261',['resetiosflags',['http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html',0,'std']]], + ['resize_1262',['resize',['http://en.cppreference.com/w/cpp/container/vector/resize.html',0,'std::vector::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::string::resize()'],['http://en.cppreference.com/w/cpp/container/forward_list/resize.html',0,'std::forward_list::resize()'],['http://en.cppreference.com/w/cpp/container/deque/resize.html',0,'std::deque::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::basic_string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::wstring::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u16string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u32string::resize()'],['http://en.cppreference.com/w/cpp/container/list/resize.html',0,'std::list::resize()']]], + ['result_5fof_1263',['result_of',['http://en.cppreference.com/w/cpp/types/result_of.html',0,'std']]], + ['rethrow_5fexception_1264',['rethrow_exception',['http://en.cppreference.com/w/cpp/error/rethrow_exception.html',0,'std']]], + ['rethrow_5fif_5fnested_1265',['rethrow_if_nested',['http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html',0,'std']]], + ['rethrow_5fnested_1266',['rethrow_nested',['http://en.cppreference.com/w/cpp/error/nested_exception/rethrow_nested.html',0,'std::nested_exception']]], + ['return_5ftemporary_5fbuffer_1267',['return_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html',0,'std']]], + ['reverse_1268',['reverse',['http://en.cppreference.com/w/cpp/container/forward_list/reverse.html',0,'std::forward_list::reverse()'],['http://en.cppreference.com/w/cpp/container/list/reverse.html',0,'std::list::reverse()'],['http://en.cppreference.com/w/cpp/algorithm/reverse.html',0,'std::reverse()']]], + ['reverse_5fcopy_1269',['reverse_copy',['http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html',0,'std']]], + ['reverse_5fiterator_1270',['reverse_iterator',['http://en.cppreference.com/w/cpp/iterator/reverse_iterator.html',0,'std']]], + ['rewind_1271',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]], + ['rfind_1272',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()']]], + ['right_1273',['right',['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()']]], + ['rightrotate_1274',['rightRotate',['../d8/dee/avltree_8cpp.html#a4d93589966920b2756b84f8b92c54d1c',1,'avltree.cpp']]], + ['rint_1275',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['rotate_1276',['rotate',['http://en.cppreference.com/w/cpp/algorithm/rotate.html',0,'std']]], + ['rotate_5fcopy_1277',['rotate_copy',['http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html',0,'std']]], + ['round_1278',['round',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['round_5ferror_1279',['round_error',['http://en.cppreference.com/w/cpp/types/numeric_limits/round_error.html',0,'std::numeric_limits']]], + ['runtime_5ferror_1280',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error'],['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error::runtime_error()']]] +]; diff --git a/search/all_13.html b/search/all_13.html new file mode 100644 index 000000000..f7d46e7af --- /dev/null +++ b/search/all_13.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_13.js b/search/all_13.js new file mode 100644 index 000000000..acc3ac2b8 --- /dev/null +++ b/search/all_13.js @@ -0,0 +1,201 @@ +var searchData= +[ + ['chrono_1281',['chrono',['http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html',0,'std']]], + ['experimental_1282',['experimental',['http://en.cppreference.com/w/de/d97/namespacestd_1_1experimental.html',0,'std']]], + ['regex_5fconstants_1283',['regex_constants',['http://en.cppreference.com/w/db/da4/namespacestd_1_1regex__constants.html',0,'std']]], + ['rel_5fops_1284',['rel_ops',['http://en.cppreference.com/w/da/d42/namespacestd_1_1rel__ops.html',0,'std']]], + ['s_1285',['s',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution']]], + ['save_5f2d_5fdata_1286',['save_2d_data',['../d9/d66/group__machine__learning.html#ga6c606bc85a3e9fd9d010f874ad760336',1,'kohonen_som_topology.cpp']]], + ['save_5fexact_5fsolution_1287',['save_exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_semi_implicit_euler.cpp']]], + ['save_5fnd_5fdata_1288',['save_nd_data',['../d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa',1,'kohonen_som_trace.cpp']]], + ['save_5fu_5fmatrix_1289',['save_u_matrix',['../d8/d77/namespacemachine__learning.html#a1d577f5d95b774ae97eb6838852d0df5',1,'machine_learning']]], + ['sbumpc_1290',['sbumpc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wfilebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::strstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::streambuf::sbumpc()']]], + ['scalbln_1291',['scalbln',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]], + ['scalbn_1292',['scalbn',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]], + ['scan_5fis_1293',['scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::scan_is()']]], + ['scanf_1294',['scanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['scientific_1295',['scientific',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['scoped_5fallocator_5fadaptor_1296',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor::scoped_allocator_adaptor()']]], + ['search_1297',['search',['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()']]], + ['search_5fn_1298',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]], + ['seconds_1299',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::seconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds::seconds()']]], + ['seed_1300',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()']]], + ['seed_5fseq_1301',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq.html',0,'std::seed_seq'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/seed_seq.html',0,'std::seed_seq::seed_seq()']]], + ['seekg_1302',['seekg',['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::strstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istrstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wiostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wfstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wstringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::ifstream::seekg()']]], + ['seekoff_1303',['seekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::seekoff()']]], + ['seekp_1304',['seekp',['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::strstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wiostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostrstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wfstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wstringstream::seekp()']]], + ['seekpos_1305',['seekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::seekpos()']]], + ['segmentintersection_1306',['SegmentIntersection',['../d4/db4/struct_segment_intersection.html',1,'']]], + ['select_5fon_5fcontainer_5fcopy_5fconstruction_1307',['select_on_container_copy_construction',['http://en.cppreference.com/w/cpp/memory/allocator_traits/select_on_container_copy_construction.html',0,'std::allocator_traits::select_on_container_copy_construction()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/select_on_container_copy_construction.html',0,'std::scoped_allocator_adaptor::select_on_container_copy_construction()']]], + ['semi_5fimplicit_5feuler_1308',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]], + ['semi_5fimplicit_5feuler_5fstep_1309',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]], + ['sentry_1310',['sentry',['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wfstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_stringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_iostream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wstringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::strstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::fstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::iostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wiostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::stringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_fstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::sentry()']]], + ['set_1311',['set',['http://en.cppreference.com/w/cpp/container/set.html',0,'std::set< K >'],['http://en.cppreference.com/w/cpp/container/set/set.html',0,'std::set::set()'],['http://en.cppreference.com/w/cpp/utility/bitset/set.html',0,'std::bitset::set()']]], + ['set_5fdifference_1312',['set_difference',['http://en.cppreference.com/w/cpp/algorithm/set_difference.html',0,'std']]], + ['set_5fexception_1313',['set_exception',['http://en.cppreference.com/w/cpp/thread/promise/set_exception.html',0,'std::promise']]], + ['set_5fexception_5fat_5fthread_5fexit_1314',['set_exception_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_exception_at_thread_exit.html',0,'std::promise']]], + ['set_5fintersection_1315',['set_intersection',['http://en.cppreference.com/w/cpp/algorithm/set_intersection.html',0,'std']]], + ['set_5fnew_5fhandler_1316',['set_new_handler',['http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html',0,'std']]], + ['set_5frdbuf_1317',['set_rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ios::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::strstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wiostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wfstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wstringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ifstream::set_rdbuf()']]], + ['set_5fsymmetric_5fdifference_1318',['set_symmetric_difference',['http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html',0,'std']]], + ['set_5fterminate_1319',['set_terminate',['http://en.cppreference.com/w/cpp/error/set_terminate.html',0,'std']]], + ['set_5funexpected_1320',['set_unexpected',['http://en.cppreference.com/w/cpp/error/set_unexpected.html',0,'std']]], + ['set_5funion_1321',['set_union',['http://en.cppreference.com/w/cpp/algorithm/set_union.html',0,'std']]], + ['set_5fvalue_1322',['set_value',['http://en.cppreference.com/w/cpp/thread/promise/set_value.html',0,'std::promise']]], + ['set_5fvalue_5fat_5fthread_5fexit_1323',['set_value_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_value_at_thread_exit.html',0,'std::promise']]], + ['setbase_1324',['setbase',['http://en.cppreference.com/w/cpp/io/manip/setbase.html',0,'std']]], + ['setbuf_1325',['setbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/c/setbuf.html',0,'std::setbuf()']]], + ['setf_1326',['setf',['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ios::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ios_base::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::strstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wiostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wfstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wstringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ifstream::setf()']]], + ['setfill_1327',['setfill',['http://en.cppreference.com/w/cpp/io/manip/setfill.html',0,'std']]], + ['setg_1328',['setg',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wfilebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::strstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::streambuf::setg()']]], + ['setiosflags_1329',['setiosflags',['http://en.cppreference.com/w/cpp/io/manip/setiosflags.html',0,'std']]], + ['setlocale_1330',['setlocale',['http://en.cppreference.com/w/cpp/locale/setlocale.html',0,'std']]], + ['setp_1331',['setp',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wfilebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::strstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::streambuf::setp()']]], + ['setprecision_1332',['setprecision',['http://en.cppreference.com/w/cpp/io/manip/setprecision.html',0,'std']]], + ['setstate_1333',['setstate',['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ios::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::strstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wiostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wfstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wstringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ifstream::setstate()']]], + ['setvbuf_1334',['setvbuf',['http://en.cppreference.com/w/cpp/io/c/setvbuf.html',0,'std']]], + ['setw_1335',['setw',['http://en.cppreference.com/w/cpp/io/manip/setw.html',0,'std']]], + ['sgetc_1336',['sgetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wfilebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::strstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::streambuf::sgetc()']]], + ['sgetn_1337',['sgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::sgetn()']]], + ['sgn_1338',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'sgn(T val): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'sgn(T val): false_position.cpp']]], + ['share_1339',['share',['http://en.cppreference.com/w/cpp/thread/future/share.html',0,'std::future']]], + ['shared_5ffrom_5fthis_1340',['shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/shared_from_this.html',0,'std::enable_shared_from_this']]], + ['shared_5ffuture_1341',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future.html',0,'std::shared_future'],['http://en.cppreference.com/w/cpp/thread/shared_future/shared_future.html',0,'std::shared_future::shared_future()']]], + ['shared_5flock_1342',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock.html',0,'std::shared_lock< T >'],['http://en.cppreference.com/w/cpp/thread/shared_lock/shared_lock.html',0,'std::shared_lock::shared_lock()']]], + ['shared_5fptr_1343',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std::shared_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr.html',0,'std::shared_ptr::shared_ptr()']]], + ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_1344',['shared_ptr< Trie::TrieNode >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5ftimed_5fmutex_1345',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex.html',0,'std::shared_timed_mutex'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/shared_timed_mutex.html',0,'std::shared_timed_mutex::shared_timed_mutex()']]], + ['shell_5fsort_1346',['shell_sort',['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&arr)[N])'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector< T > *arr)']]], + ['shell_5fsort2_2ecpp_1347',['shell_sort2.cpp',['../d4/d7a/shell__sort2_8cpp.html',1,'']]], + ['show_1348',['show',['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'tower_of_hanoi.cpp']]], + ['show_5fdata_1349',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN): shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&arr)[N]): shell_sort2.cpp']]], + ['show_5fpascal_1350',['show_pascal',['../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c',1,'pascal_triangle.cpp']]], + ['showbase_1351',['showbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], + ['showmanyc_1352',['showmanyc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wfilebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::strstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::streambuf::showmanyc()']]], + ['showpoint_1353',['showpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], + ['showpos_1354',['showpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], + ['shrink_5fto_5ffit_1355',['shrink_to_fit',['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]], + ['shuffle_1356',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]], + ['shuffle_5forder_5fengine_1357',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::shuffle_order_engine'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine::shuffle_order_engine()']]], + ['sieve_1358',['Sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n): primes_up_to_billion.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8',1,'sieve(uint32_t N): sieve_of_eratosthenes.cpp']]], + ['sieve_5fof_5feratosthenes_2ecpp_1359',['sieve_of_eratosthenes.cpp',['../d8/ddf/sieve__of__eratosthenes_8cpp.html',1,'']]], + ['sieveoferatosthenes_1360',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]], + ['sig_5fatomic_5ft_1361',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]], + ['signal_1362',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]], + ['signaling_5fnan_1363',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]], + ['signbit_1364',['signbit',['http://en.cppreference.com/w/cpp/numeric/math/signbit.html',0,'std']]], + ['sin_1365',['sin',['http://en.cppreference.com/w/cpp/numeric/math/sin.html',0,'std']]], + ['sinh_1366',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]], + ['size_1367',['size',['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()']]], + ['size_5ft_1368',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]], + ['skipws_1369',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], + ['sleep_5ffor_1370',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]], + ['sleep_5funtil_1371',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]], + ['smallest_5fcircle_2ecpp_1372',['smallest_circle.cpp',['../d0/d01/smallest__circle_8cpp.html',1,'']]], + ['smatch_1373',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::smatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::smatch::smatch()']]], + ['snextc_1374',['snextc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wfilebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::strstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::streambuf::snextc()']]], + ['snprintf_1375',['snprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['solution_1376',['Solution',['../dd/d4f/class_solution.html',1,'']]], + ['sort_1377',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort()']]], + ['sort_5fheap_1378',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], + ['sorting_1379',['sorting',['../d5/d91/namespacesorting.html',1,'']]], + ['sparse_5fmatrix_2ecpp_1380',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]], + ['spiral_5fprint_2ecpp_1381',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]], + ['spiralprint_1382',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]], + ['splice_1383',['splice',['http://en.cppreference.com/w/cpp/container/list/splice.html',0,'std::list']]], + ['splice_5fafter_1384',['splice_after',['http://en.cppreference.com/w/cpp/container/forward_list/splice_after.html',0,'std::forward_list']]], + ['sprintf_1385',['sprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['sputbackc_1386',['sputbackc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wfilebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::strstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::streambuf::sputbackc()']]], + ['sputc_1387',['sputc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wfilebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::strstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::streambuf::sputc()']]], + ['sputn_1388',['sputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::sputn()']]], + ['sqrt_1389',['sqrt',['http://en.cppreference.com/w/cpp/numeric/math/sqrt.html',0,'std::sqrt()'],['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'Sqrt(): sqrt_double.cpp']]], + ['sqrt_5fdouble_2ecpp_1390',['sqrt_double.cpp',['../da/d24/sqrt__double_8cpp.html',1,'']]], + ['srand_1391',['srand',['http://en.cppreference.com/w/cpp/numeric/random/srand.html',0,'std']]], + ['sregex_5fiterator_1392',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::sregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::sregex_iterator::sregex_iterator()']]], + ['sregex_5ftoken_5fiterator_1393',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::sregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::sregex_token_iterator::sregex_token_iterator()']]], + ['sscanf_1394',['sscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['ssub_5fmatch_1395',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::ssub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::ssub_match::ssub_match()']]], + ['stable_5fpartition_1396',['stable_partition',['http://en.cppreference.com/w/cpp/algorithm/stable_partition.html',0,'std']]], + ['stable_5fsort_1397',['stable_sort',['http://en.cppreference.com/w/cpp/algorithm/stable_sort.html',0,'std']]], + ['stack_1398',['stack',['../d1/dc2/classstack.html',1,'stack< Type >'],['http://en.cppreference.com/w/cpp/container/stack.html',0,'std::stack< T >'],['http://en.cppreference.com/w/cpp/container/stack/stack.html',0,'std::stack::stack()'],['../d1/dc2/classstack.html#a5b64337ec34b12e98458bb9b9d5f8f83',1,'stack::stack()'],['../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7',1,'stack(): paranthesis_matching.cpp']]], + ['stack_5flinkedlist_1399',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]], + ['stacktop_1400',['stackTop',['../d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453',1,'stack']]], + ['stairs_5fpattern_2ecpp_1401',['stairs_pattern.cpp',['../d5/def/stairs__pattern_8cpp.html',1,'']]], + ['state_1402',['state',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/state.html',0,'std::wbuffer_convert::state()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/state.html',0,'std::wstring_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::wstreampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u16streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::fpos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u32streampos::state()']]], + ['state_5ftype_1403',['state_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::state_type']]], + ['static_5fpointer_5fcast_1404',['static_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['statistics_1405',['statistics',['../d2/dcf/namespacestatistics.html',1,'']]], + ['stats_5fcomputer1_1406',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]], + ['stats_5fcomputer2_1407',['stats_computer2',['../d8/dab/classstatistics_1_1stats__computer2.html',1,'statistics']]], + ['std_1408',['std',['../d8/dcc/namespacestd.html',1,'std'],['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]], + ['stddev_1409',['stddev',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution']]], + ['steady_5fclock_1410',['steady_clock',['http://en.cppreference.com/w/cpp/chrono/steady_clock.html',0,'std::chrono']]], + ['stod_1411',['stod',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stof_1412',['stof',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stoi_1413',['stoi',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stol_1414',['stol',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stold_1415',['stold',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stoll_1416',['stoll',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['store_1417',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]], + ['stoul_1418',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], + ['stoull_1419',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], + ['str_1420',['str',['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()']]], + ['strcat_1421',['strcat',['http://en.cppreference.com/w/cpp/string/byte/strcat.html',0,'std']]], + ['strchr_1422',['strchr',['http://en.cppreference.com/w/cpp/string/byte/strchr.html',0,'std']]], + ['strcmp_1423',['strcmp',['http://en.cppreference.com/w/cpp/string/byte/strcmp.html',0,'std']]], + ['strcoll_1424',['strcoll',['http://en.cppreference.com/w/cpp/string/byte/strcoll.html',0,'std']]], + ['strcpy_1425',['strcpy',['http://en.cppreference.com/w/cpp/string/byte/strcpy.html',0,'std']]], + ['strcspn_1426',['strcspn',['http://en.cppreference.com/w/cpp/string/byte/strcspn.html',0,'std']]], + ['streambuf_1427',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::streambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::streambuf::streambuf()']]], + ['streamoff_1428',['streamoff',['http://en.cppreference.com/w/cpp/io/streamoff.html',0,'std']]], + ['streampos_1429',['streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['streamsize_1430',['streamsize',['http://en.cppreference.com/w/cpp/io/streamsize.html',0,'std']]], + ['strerror_1431',['strerror',['http://en.cppreference.com/w/cpp/string/byte/strerror.html',0,'std']]], + ['strftime_1432',['strftime',['http://en.cppreference.com/w/cpp/chrono/c/strftime.html',0,'std']]], + ['string_1433',['string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::string::string()']]], + ['string_5ffibonacci_2ecpp_1434',['string_fibonacci.cpp',['../de/d47/string__fibonacci_8cpp.html',1,'']]], + ['string_5fsearch_1435',['string_search',['../d9/d03/namespacestring__search.html',1,'']]], + ['string_5ftype_1436',['string_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::string_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::string_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::string_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::string_type']]], + ['stringbuf_1437',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::stringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::stringbuf::stringbuf()']]], + ['stringstream_1438',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::stringstream'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::stringstream::stringstream()']]], + ['strlen_1439',['strlen',['http://en.cppreference.com/w/cpp/string/byte/strlen.html',0,'std']]], + ['strncat_1440',['strncat',['http://en.cppreference.com/w/cpp/string/byte/strncat.html',0,'std']]], + ['strncmp_1441',['strncmp',['http://en.cppreference.com/w/cpp/string/byte/strncmp.html',0,'std']]], + ['strncpy_1442',['strncpy',['http://en.cppreference.com/w/cpp/string/byte/strncpy.html',0,'std']]], + ['strpbrk_1443',['strpbrk',['http://en.cppreference.com/w/cpp/string/byte/strpbrk.html',0,'std']]], + ['strrchr_1444',['strrchr',['http://en.cppreference.com/w/cpp/string/byte/strrchr.html',0,'std']]], + ['strspn_1445',['strspn',['http://en.cppreference.com/w/cpp/string/byte/strspn.html',0,'std']]], + ['strstr_1446',['strstr',['http://en.cppreference.com/w/cpp/string/byte/strstr.html',0,'std']]], + ['strstream_1447',['strstream',['http://en.cppreference.com/w/cpp/io/strstream.html',0,'std::strstream'],['http://en.cppreference.com/w/cpp/io/strstream/strstream.html',0,'std::strstream::strstream()']]], + ['strstreambuf_1448',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf.html',0,'std::strstreambuf'],['http://en.cppreference.com/w/cpp/io/strstreambuf/strstreambuf.html',0,'std::strstreambuf::strstreambuf()']]], + ['strtod_1449',['strtod',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtof_1450',['strtof',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtoimax_1451',['strtoimax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], + ['strtok_1452',['strtok',['http://en.cppreference.com/w/cpp/string/byte/strtok.html',0,'std']]], + ['strtol_1453',['strtol',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], + ['strtold_1454',['strtold',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtoll_1455',['strtoll',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], + ['strtoul_1456',['strtoul',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], + ['strtoull_1457',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], + ['strtoumax_1458',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], + ['struzik_5fsearch_1459',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d',1,'exponential_search.cpp']]], + ['strxfrm_1460',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]], + ['student_5ft_5fdistribution_1461',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution.html',0,'std::student_t_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/student_t_distribution.html',0,'std::student_t_distribution::student_t_distribution()']]], + ['sub_5fmatch_1462',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::sub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match::sub_match()']]], + ['substr_1463',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], + ['subtract_5fwith_5fcarry_5fengine_1464',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine::subtract_with_carry_engine()']]], + ['successive_5fapproximation_2ecpp_1465',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]], + ['suffix_1466',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()']]], + ['sungetc_1467',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]], + ['swap_1468',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap()']]], + ['swap_5franges_1469',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]], + ['swprintf_1470',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['swscanf_1471',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], + ['sync_1472',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]], + ['sync_5fwith_5fstdio_1473',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()']]], + ['system_1474',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]], + ['system_5fcategory_1475',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]], + ['system_5fclock_1476',['system_clock',['http://en.cppreference.com/w/cpp/chrono/system_clock.html',0,'std::chrono']]], + ['system_5ferror_1477',['system_error',['http://en.cppreference.com/w/cpp/error/system_error.html',0,'std::system_error'],['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error::system_error()']]], + ['this_5fthread_1478',['this_thread',['http://en.cppreference.com/w/d7/dbf/namespacestd_1_1this__thread.html',0,'std']]] +]; diff --git a/search/all_14.html b/search/all_14.html new file mode 100644 index 000000000..c0e4c762a --- /dev/null +++ b/search/all_14.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_14.js b/search/all_14.js new file mode 100644 index 000000000..9c857ae98 --- /dev/null +++ b/search/all_14.js @@ -0,0 +1,96 @@ +var searchData= +[ + ['the_20algorithms_20_2d_20c_2b_2b_1479',['The Algorithms - C++',['../index.html',1,'']]], + ['t_1480',['t',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution']]], + ['tan_1481',['tan',['http://en.cppreference.com/w/cpp/numeric/math/tan.html',0,'std']]], + ['tanh_1482',['tanh',['http://en.cppreference.com/w/cpp/numeric/math/tanh.html',0,'std']]], + ['target_1483',['target',['http://en.cppreference.com/w/cpp/utility/functional/function/target.html',0,'std::function']]], + ['target_5ftype_1484',['target_type',['http://en.cppreference.com/w/cpp/utility/functional/function/target_type.html',0,'std::function']]], + ['tellg_1485',['tellg',['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::strstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istrstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wiostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wfstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wstringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::ifstream::tellg()']]], + ['tellp_1486',['tellp',['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::strstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wiostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostrstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wfstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wstringstream::tellp()']]], + ['tera_1487',['tera',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['terminate_1488',['terminate',['http://en.cppreference.com/w/cpp/error/terminate.html',0,'std']]], + ['terminate_5fhandler_1489',['terminate_handler',['http://en.cppreference.com/w/cpp/error/terminate_handler.html',0,'std']]], + ['ternary_5fsearch_1490',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]], + ['ternary_5fsearch_2ecpp_1491',['ternary_search.cpp',['../dc/dfe/ternary__search_8cpp.html',1,'']]], + ['test_1492',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp']]], + ['test1_1493',['test1',['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1(): large_factorial.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): durand_kerner_roots.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.cpp']]], + ['test2_1494',['test2',['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2(): large_factorial.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): durand_kerner_roots.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): smallest_circle.cpp']]], + ['test3_1495',['test3',['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.cpp'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): smallest_circle.cpp']]], + ['test_5f2d_5fclasses_1496',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755',1,'kohonen_som_topology.cpp']]], + ['test_5f3d_5fclasses_1497',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a9ab8c79ffb674a63f151f282faeb723b',1,'kohonen_som_trace.cpp']]], + ['test_5f3d_5fclasses1_1498',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#ab3081e021270ba21a9fd88646f6a6e26',1,'kohonen_som_topology.cpp']]], + ['test_5f3d_5fclasses2_1499',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a0e7435446ed7c763f7de79a468add2e0',1,'kohonen_som_topology.cpp']]], + ['test_5fand_5fset_1500',['test_and_set',['http://en.cppreference.com/w/cpp/atomic/atomic_flag/test_and_set.html',0,'std::atomic_flag']]], + ['test_5fcircle_1501',['test_circle',['../d9/d49/kohonen__som__trace_8cpp.html#ab47fb569e63648bd76e7edfdacc02dbd',1,'kohonen_som_trace.cpp']]], + ['test_5ff_1502',['test_f',['../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d',1,'shell_sort2.cpp']]], + ['test_5ffunction_1503',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]], + ['test_5fint_1504',['test_int',['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'shell_sort2.cpp']]], + ['test_5flamniscate_1505',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60',1,'kohonen_som_trace.cpp']]], + ['test_5fset_1506',['test_set',['../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123',1,'brute_force_string_searching.cpp']]], + ['tests_1507',['tests',['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'least_common_multiple.cpp']]], + ['text_5fsearch_2ecpp_1508',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]], + ['tgamma_1509',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], + ['th_1510',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], + ['thousands_5fsep_1511',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]], + ['thread_1512',['thread',['http://en.cppreference.com/w/cpp/thread/thread.html',0,'std::thread'],['http://en.cppreference.com/w/cpp/thread/thread/thread.html',0,'std::thread::thread()']]], + ['throw_5fwith_5fnested_1513',['throw_with_nested',['http://en.cppreference.com/w/cpp/error/throw_with_nested.html',0,'std']]], + ['tie_1514',['tie',['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ios::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::strstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wiostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wfstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wstringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ifstream::tie()'],['http://en.cppreference.com/w/cpp/utility/tuple/tie.html',0,'std::tie()']]], + ['time_1515',['time',['http://en.cppreference.com/w/cpp/chrono/c/time.html',0,'std']]], + ['time_5fbase_1516',['time_base',['http://en.cppreference.com/w/cpp/locale/time_base.html',0,'std']]], + ['time_5fget_1517',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get'],['http://en.cppreference.com/w/cpp/locale/time_get/time_get.html',0,'std::time_get::time_get()']]], + ['time_5fget_5fbyname_1518',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname'],['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname::time_get_byname()']]], + ['time_5fpoint_1519',['time_point',['http://en.cppreference.com/w/cpp/chrono/time_point.html',0,'std::chrono::time_point'],['http://en.cppreference.com/w/cpp/chrono/time_point/time_point.html',0,'std::chrono::time_point::time_point()']]], + ['time_5fpoint_5fcast_1520',['time_point_cast',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point_cast.html',0,'std::chrono']]], + ['time_5fput_1521',['time_put',['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put'],['http://en.cppreference.com/w/cpp/locale/time_put/time_put.html',0,'std::time_put::time_put()']]], + ['time_5fput_5fbyname_1522',['time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname'],['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname::time_put_byname()']]], + ['time_5fsince_5fepoch_1523',['time_since_epoch',['http://en.cppreference.com/w/cpp/chrono/time_point/time_since_epoch.html',0,'std::chrono::time_point']]], + ['time_5ft_1524',['time_t',['http://en.cppreference.com/w/cpp/chrono/c/time_t.html',0,'std']]], + ['timed_5fmutex_1525',['timed_mutex',['http://en.cppreference.com/w/cpp/thread/timed_mutex.html',0,'std::timed_mutex'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/timed_mutex.html',0,'std::timed_mutex::timed_mutex()']]], + ['tm_1526',['tm',['http://en.cppreference.com/w/cpp/chrono/c/tm.html',0,'std']]], + ['tmpfile_1527',['tmpfile',['http://en.cppreference.com/w/cpp/io/c/tmpfile.html',0,'std']]], + ['tmpnam_1528',['tmpnam',['http://en.cppreference.com/w/cpp/io/c/tmpnam.html',0,'std']]], + ['to_5fbytes_1529',['to_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/to_bytes.html',0,'std::wstring_convert']]], + ['to_5fchar_5ftype_1530',['to_char_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_char_type.html',0,'std::char_traits']]], + ['to_5fint_5ftype_1531',['to_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_int_type.html',0,'std::char_traits']]], + ['to_5fstring_1532',['to_string',['http://en.cppreference.com/w/cpp/utility/bitset/to_string.html',0,'std::bitset::to_string()'],['http://en.cppreference.com/w/cpp/string/basic_string/to_string.html',0,'std::to_string()']]], + ['to_5ftime_5ft_1533',['to_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/to_time_t.html',0,'std::chrono::system_clock']]], + ['to_5fullong_1534',['to_ullong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ullong.html',0,'std::bitset']]], + ['to_5fulong_1535',['to_ulong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ulong.html',0,'std::bitset']]], + ['to_5fwstring_1536',['to_wstring',['http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html',0,'std']]], + ['todo_20list_1537',['Todo List',['../dd/da0/todo.html',1,'']]], + ['tolower_1538',['tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::tolower()'],['http://en.cppreference.com/w/cpp/string/byte/tolower.html',0,'std::tolower()']]], + ['tolowerroman_1539',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]], + ['top_1540',['top',['../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d',1,'tower::top()'],['http://en.cppreference.com/w/cpp/container/stack/top.html',0,'std::stack::top()'],['http://en.cppreference.com/w/cpp/container/priority_queue/top.html',0,'std::priority_queue::top()'],['../d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344',1,'stack::top()'],['../dc/dc5/paranthesis__matching_8cpp.html#af93f4f37fc2ad9c37af4a715423b110c',1,'top(): paranthesis_matching.cpp']]], + ['toupper_1541',['toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::toupper()'],['http://en.cppreference.com/w/cpp/string/byte/toupper.html',0,'std::toupper()']]], + ['toupperroman_1542',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]], + ['towctrans_1543',['towctrans',['http://en.cppreference.com/w/cpp/string/wide/towctrans.html',0,'std']]], + ['tower_1544',['tower',['../d2/d2c/structtower.html',1,'']]], + ['tower_5fof_5fhanoi_2ecpp_1545',['tower_of_hanoi.cpp',['../db/d3c/tower__of__hanoi_8cpp.html',1,'']]], + ['towlower_1546',['towlower',['http://en.cppreference.com/w/cpp/string/wide/towlower.html',0,'std']]], + ['towupper_1547',['towupper',['http://en.cppreference.com/w/cpp/string/wide/towupper.html',0,'std']]], + ['transform_1548',['transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::transform()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/transform.html',0,'std::regex_traits::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::transform()'],['http://en.cppreference.com/w/cpp/algorithm/transform.html',0,'std::transform()']]], + ['transform_5fprimary_1549',['transform_primary',['http://en.cppreference.com/w/cpp/regex/regex_traits/transform_primary.html',0,'std::regex_traits']]], + ['translate_1550',['translate',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate.html',0,'std::regex_traits']]], + ['translate_5fnocase_1551',['translate_nocase',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate_nocase.html',0,'std::regex_traits']]], + ['treat_5fas_5ffloating_5fpoint_1552',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]], + ['trianglearea_1553',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]], + ['trie_1554',['Trie',['../dd/d2f/class_trie.html',1,'Trie'],['../d4/dd9/structtrie.html',1,'trie'],['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie::Trie()']]], + ['trie_5fmodern_2ecpp_1555',['trie_modern.cpp',['../dc/d93/trie__modern_8cpp.html',1,'']]], + ['trienode_1556',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]], + ['true_5ftype_1557',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['truename_1558',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()']]], + ['trunc_1559',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]], + ['try_5flock_1560',['try_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()']]], + ['try_5flock_5ffor_1561',['try_lock_for',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_for.html',0,'std::unique_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_for.html',0,'std::recursive_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_for.html',0,'std::shared_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_for.html',0,'std::timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_for.html',0,'std::shared_timed_mutex::try_lock_for()']]], + ['try_5flock_5fshared_1562',['try_lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5fshared_5ffor_1563',['try_lock_shared_for',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_for.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5fshared_5funtil_1564',['try_lock_shared_until',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_until.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5funtil_1565',['try_lock_until',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_until.html',0,'std::unique_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_until.html',0,'std::recursive_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_until.html',0,'std::shared_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_until.html',0,'std::timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_until.html',0,'std::shared_timed_mutex::try_lock_until()']]], + ['try_5fto_5flock_5ft_1566',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['tuple_1567',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std::tuple'],['http://en.cppreference.com/w/cpp/utility/tuple/tuple.html',0,'std::tuple::tuple()']]], + ['tuple_3c_20int_2c_20int_2c_20int_20_3e_1568',['tuple< int, int, int >',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], + ['tuple_5fcat_1569',['tuple_cat',['http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html',0,'std']]], + ['type_5findex_1570',['type_index',['http://en.cppreference.com/w/cpp/types/type_index.html',0,'std::type_index'],['http://en.cppreference.com/w/cpp/types/type_index/type_index.html',0,'std::type_index::type_index()']]], + ['type_5finfo_1571',['type_info',['http://en.cppreference.com/w/cpp/types/type_info.html',0,'std']]] +]; diff --git a/search/all_15.html b/search/all_15.html new file mode 100644 index 000000000..ff415521e --- /dev/null +++ b/search/all_15.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_15.js b/search/all_15.js new file mode 100644 index 000000000..df38efa36 --- /dev/null +++ b/search/all_15.js @@ -0,0 +1,62 @@ +var searchData= +[ + ['u16streampos_1572',['u16streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['u16string_1573',['u16string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::u16string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u16string::u16string()']]], + ['u32streampos_1574',['u32streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['u32string_1575',['u32string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::u32string'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u32string::u32string()']]], + ['uflow_1576',['uflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wfilebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::strstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_streambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::streambuf::uflow()']]], + ['uint16_5ft_1577',['uint16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint32_5ft_1578',['uint32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint64_5ft_1579',['uint64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint8_5ft_1580',['uint8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5ffast16_5ft_1581',['uint_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5ffast32_5ft_1582',['uint_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5ffast64_5ft_1583',['uint_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5ffast8_5ft_1584',['uint_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5fleast16_5ft_1585',['uint_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5fleast32_5ft_1586',['uint_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5fleast64_5ft_1587',['uint_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5fleast8_5ft_1588',['uint_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uintmax_5ft_1589',['uintmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uintptr_5ft_1590',['uintptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['unary_5ffunction_1591',['unary_function',['http://en.cppreference.com/w/cpp/utility/functional/unary_function.html',0,'std']]], + ['unary_5fnegate_1592',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::unary_negate()']]], + ['uncaught_5fexception_1593',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]], + ['undeclare_5fno_5fpointers_1594',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]], + ['undeclare_5freachable_1595',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]], + ['underflow_1596',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]], + ['underflow_5ferror_1597',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error'],['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error::underflow_error()']]], + ['underlying_5ftype_1598',['underlying_type',['http://en.cppreference.com/w/cpp/types/underlying_type.html',0,'std']]], + ['unexpected_1599',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]], + ['unexpected_5fhandler_1600',['unexpected_handler',['http://en.cppreference.com/w/cpp/error/unexpected_handler.html',0,'std']]], + ['unget_1601',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]], + ['ungetc_1602',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]], + ['ungetwc_1603',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]], + ['uniform_5fint_5fdistribution_1604',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html',0,'std::uniform_int_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution::uniform_int_distribution()']]], + ['uniform_5freal_5fdistribution_1605',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html',0,'std::uniform_real_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/uniform_real_distribution.html',0,'std::uniform_real_distribution::uniform_real_distribution()']]], + ['uninitialized_5fcopy_1606',['uninitialized_copy',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html',0,'std']]], + ['uninitialized_5fcopy_5fn_1607',['uninitialized_copy_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html',0,'std']]], + ['uninitialized_5ffill_1608',['uninitialized_fill',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html',0,'std']]], + ['uninitialized_5ffill_5fn_1609',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]], + ['unique_1610',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique()']]], + ['unique_5fcopy_1611',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], + ['unique_5flock_1612',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock.html',0,'std::unique_lock< T >'],['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock::unique_lock()']]], + ['unique_5fptr_1613',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std::unique_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr::unique_ptr()']]], + ['unitbuf_1614',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['unlock_1615',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock()']]], + ['unlock_5fshared_1616',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], + ['unordered_5fmap_1617',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std::unordered_map< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map::unordered_map()']]], + ['unordered_5fmap_3c_20unsigned_20int_2c_20std_3a_3avector_3c_20unsigned_20int_20_3e_20_3e_1618',['unordered_map< unsigned int, std::vector< unsigned int > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmultimap_1619',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap.html',0,'std::unordered_multimap< K, T >'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap::unordered_multimap()']]], + ['unordered_5fmultiset_1620',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset.html',0,'std::unordered_multiset< K >'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset::unordered_multiset()']]], + ['unordered_5fset_1621',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std::unordered_set< K >'],['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set::unordered_set()']]], + ['unsetf_1622',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]], + ['unshift_1623',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], + ['update_5fstep_1624',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], + ['update_5fweights_1625',['update_weights',['../d8/d77/namespacemachine__learning.html#ac4010fe3a52a74e8b5b1aaadfe38b46f',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#a361674452869413536ee501f053129a8',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double >> *W, std::valarray< double > *D, double alpha, int R)']]], + ['upper_5fbound_1626',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound()']]], + ['uppercase_1627',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['use_5fcount_1628',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], + ['use_5ffacet_1629',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]], + ['uses_5fallocator_1630',['uses_allocator',['http://en.cppreference.com/w/cpp/memory/uses_allocator.html',0,'std']]] +]; diff --git a/search/all_16.html b/search/all_16.html new file mode 100644 index 000000000..936394cec --- /dev/null +++ b/search/all_16.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_16.js b/search/all_16.js new file mode 100644 index 000000000..801f652b5 --- /dev/null +++ b/search/all_16.js @@ -0,0 +1,37 @@ +var searchData= +[ + ['va_5flist_1631',['va_list',['http://en.cppreference.com/w/cpp/utility/variadic/va_list.html',0,'']]], + ['valarray_1632',['valarray',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]], + ['valid_1633',['valid',['http://en.cppreference.com/w/cpp/thread/shared_future/valid.html',0,'std::shared_future::valid()'],['http://en.cppreference.com/w/cpp/thread/future/valid.html',0,'std::future::valid()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/valid.html',0,'std::packaged_task::valid()']]], + ['value_1634',['value',['http://en.cppreference.com/w/cpp/error/error_code/value.html',0,'std::error_code::value()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/value.html',0,'std::regex_traits::value()'],['http://en.cppreference.com/w/cpp/error/error_condition/value.html',0,'std::error_condition::value()'],['http://en.cppreference.com/w/cpp/experimental/optional/value.html',0,'std::experimental::optional::value()']]], + ['value_5fcomp_1635',['value_comp',['http://en.cppreference.com/w/cpp/container/multiset/value_comp.html',0,'std::multiset::value_comp()'],['http://en.cppreference.com/w/cpp/container/set/value_comp.html',0,'std::set::value_comp()'],['http://en.cppreference.com/w/cpp/container/map/value_comp.html',0,'std::map::value_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/value_comp.html',0,'std::multimap::value_comp()']]], + ['value_5fcompare_1636',['value_compare',['http://en.cppreference.com/w/cpp/container/multimap/value_compare.html',0,'std::multimap< K, T >::value_compare'],['http://en.cppreference.com/w/cpp/container/map/value_compare.html',0,'std::map< K, T >::value_compare']]], + ['value_5for_1637',['value_or',['http://en.cppreference.com/w/cpp/experimental/optional/value_or.html',0,'std::experimental::optional']]], + ['values_1638',['values',['../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9',1,'tower']]], + ['variance_1639',['variance',['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()']]], + ['vector_1640',['vector',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std::vector< T >'],['http://en.cppreference.com/w/cpp/container/vector/vector.html',0,'std::vector::vector()']]], + ['vector_3c_20bool_20_3e_1641',['vector< bool >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20double_20_3e_1642',['vector< double >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20int_20_3e_1643',['vector< int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_1644',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20char_20_3e_1645',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20int_20_3e_1646',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20vector_3c_20int_20_3e_20_3e_1647',['vector< vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_5fdot_1648',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]], + ['vector_5fimportant_5ffunctions_2ecpp_1649',['vector_important_functions.cpp',['../d3/d61/vector__important__functions_8cpp.html',1,'']]], + ['vector_5fmag_1650',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]], + ['vector_5fproj_1651',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a5422c76bfa322620de611083bd518d71',1,'qr_algorithm']]], + ['vfprintf_1652',['vfprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vfscanf_1653',['vfscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vfwprintf_1654',['vfwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vfwscanf_1655',['vfwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], + ['vprintf_1656',['vprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vscanf_1657',['vscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vsnprintf_1658',['vsnprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vsprintf_1659',['vsprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vsscanf_1660',['vsscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vswprintf_1661',['vswprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vswscanf_1662',['vswscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], + ['vwprintf_1663',['vwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vwscanf_1664',['vwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]] +]; diff --git a/search/all_17.html b/search/all_17.html new file mode 100644 index 000000000..9685a5867 --- /dev/null +++ b/search/all_17.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_17.js b/search/all_17.js new file mode 100644 index 000000000..38557d2bf --- /dev/null +++ b/search/all_17.js @@ -0,0 +1,82 @@ +var searchData= +[ + ['wait_1665',['wait',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait.html',0,'std::condition_variable_any::wait()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait.html',0,'std::condition_variable::wait()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait.html',0,'std::shared_future::wait()'],['http://en.cppreference.com/w/cpp/thread/future/wait.html',0,'std::future::wait()']]], + ['wait_5ffor_1666',['wait_for',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_for.html',0,'std::condition_variable_any::wait_for()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_for.html',0,'std::condition_variable::wait_for()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_for.html',0,'std::shared_future::wait_for()'],['http://en.cppreference.com/w/cpp/thread/future/wait_for.html',0,'std::future::wait_for()']]], + ['wait_5funtil_1667',['wait_until',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_until.html',0,'std::condition_variable_any::wait_until()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_until.html',0,'std::condition_variable::wait_until()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_until.html',0,'std::shared_future::wait_until()'],['http://en.cppreference.com/w/cpp/thread/future/wait_until.html',0,'std::future::wait_until()']]], + ['wbuffer_5fconvert_1668',['wbuffer_convert',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert.html',0,'std::wbuffer_convert'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/wbuffer_convert.html',0,'std::wbuffer_convert::wbuffer_convert()']]], + ['wcerr_1669',['wcerr',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['wcin_1670',['wcin',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['wclog_1671',['wclog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['wcmatch_1672',['wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::wcmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wcmatch::wcmatch()']]], + ['wcout_1673',['wcout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['wcregex_5fiterator_1674',['wcregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::wcregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wcregex_iterator::wcregex_iterator()']]], + ['wcregex_5ftoken_5fiterator_1675',['wcregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::wcregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wcregex_token_iterator::wcregex_token_iterator()']]], + ['wcrtomb_1676',['wcrtomb',['http://en.cppreference.com/w/cpp/string/multibyte/wcrtomb.html',0,'std']]], + ['wcscat_1677',['wcscat',['http://en.cppreference.com/w/cpp/string/wide/wcscat.html',0,'std']]], + ['wcschr_1678',['wcschr',['http://en.cppreference.com/w/cpp/string/wide/wcschr.html',0,'std']]], + ['wcscmp_1679',['wcscmp',['http://en.cppreference.com/w/cpp/string/wide/wcscmp.html',0,'std']]], + ['wcscoll_1680',['wcscoll',['http://en.cppreference.com/w/cpp/string/wide/wcscoll.html',0,'std']]], + ['wcscpy_1681',['wcscpy',['http://en.cppreference.com/w/cpp/string/wide/wcscpy.html',0,'std']]], + ['wcscspn_1682',['wcscspn',['http://en.cppreference.com/w/cpp/string/wide/wcscspn.html',0,'std']]], + ['wcsftime_1683',['wcsftime',['http://en.cppreference.com/w/cpp/chrono/c/wcsftime.html',0,'std']]], + ['wcslen_1684',['wcslen',['http://en.cppreference.com/w/cpp/string/wide/wcslen.html',0,'std']]], + ['wcsncat_1685',['wcsncat',['http://en.cppreference.com/w/cpp/string/wide/wcsncat.html',0,'std']]], + ['wcsncmp_1686',['wcsncmp',['http://en.cppreference.com/w/cpp/string/wide/wcsncmp.html',0,'std']]], + ['wcsncpy_1687',['wcsncpy',['http://en.cppreference.com/w/cpp/string/wide/wcsncpy.html',0,'std']]], + ['wcspbrk_1688',['wcspbrk',['http://en.cppreference.com/w/cpp/string/wide/wcspbrk.html',0,'std']]], + ['wcsrchr_1689',['wcsrchr',['http://en.cppreference.com/w/cpp/string/wide/wcsrchr.html',0,'std']]], + ['wcsspn_1690',['wcsspn',['http://en.cppreference.com/w/cpp/string/wide/wcsspn.html',0,'std']]], + ['wcsstr_1691',['wcsstr',['http://en.cppreference.com/w/cpp/string/wide/wcsstr.html',0,'std']]], + ['wcstod_1692',['wcstod',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]], + ['wcstof_1693',['wcstof',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]], + ['wcstoimax_1694',['wcstoimax',['http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html',0,'std']]], + ['wcstok_1695',['wcstok',['http://en.cppreference.com/w/cpp/string/wide/wcstok.html',0,'std']]], + ['wcstol_1696',['wcstol',['http://en.cppreference.com/w/cpp/string/wide/wcstol.html',0,'std']]], + ['wcstold_1697',['wcstold',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]], + ['wcstoll_1698',['wcstoll',['http://en.cppreference.com/w/cpp/string/wide/wcstol.html',0,'std']]], + ['wcstombs_1699',['wcstombs',['http://en.cppreference.com/w/cpp/string/multibyte/wcstombs.html',0,'std']]], + ['wcstoul_1700',['wcstoul',['http://en.cppreference.com/w/cpp/string/wide/wcstoul.html',0,'std']]], + ['wcstoull_1701',['wcstoull',['http://en.cppreference.com/w/cpp/string/wide/wcstoul.html',0,'std']]], + ['wcstoumax_1702',['wcstoumax',['http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html',0,'std']]], + ['wcsub_5fmatch_1703',['wcsub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::wcsub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wcsub_match::wcsub_match()']]], + ['wcsxfrm_1704',['wcsxfrm',['http://en.cppreference.com/w/cpp/string/wide/wcsxfrm.html',0,'std']]], + ['wctob_1705',['wctob',['http://en.cppreference.com/w/cpp/string/multibyte/wctob.html',0,'std']]], + ['wctomb_1706',['wctomb',['http://en.cppreference.com/w/cpp/string/multibyte/wctomb.html',0,'std']]], + ['wctrans_1707',['wctrans',['http://en.cppreference.com/w/cpp/string/wide/wctrans.html',0,'std']]], + ['wctype_1708',['wctype',['http://en.cppreference.com/w/cpp/string/wide/wctype.html',0,'std']]], + ['weak_5fptr_1709',['weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr.html',0,'std::weak_ptr< T >'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/weak_ptr.html',0,'std::weak_ptr::weak_ptr()']]], + ['weibull_5fdistribution_1710',['weibull_distribution',['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution.html',0,'std::weibull_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/weibull_distribution.html',0,'std::weibull_distribution::weibull_distribution()']]], + ['weights_1711',['weights',['../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492',1,'machine_learning::adaline']]], + ['wfilebuf_1712',['wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::wfilebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::wfilebuf::wfilebuf()']]], + ['wfstream_1713',['wfstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::wfstream'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::wfstream::wfstream()']]], + ['what_1714',['what',['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::runtime_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_new_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_typeid::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ios::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::logic_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_alloc::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_function_call::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::range_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::invalid_argument::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ios_base::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::out_of_range::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::domain_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::overflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::strstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::future_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_cast::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wiostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::exception::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_optional_access::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_weak_ptr::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wfstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::underflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wstringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::regex_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::system_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::length_error::what()']]], + ['widen_1715',['widen',['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ofstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ios::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::strstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wiostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istringstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wfstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wstringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ifstream::widen()']]], + ['width_1716',['width',['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ios::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ios_base::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::strstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wiostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wfstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wstringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ifstream::width()']]], + ['wifstream_1717',['wifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::wifstream'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::wifstream::wifstream()']]], + ['wiostream_1718',['wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::wiostream'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::wiostream::wiostream()']]], + ['wistream_1719',['wistream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::wistream'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::wistream::wistream()']]], + ['wistringstream_1720',['wistringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::wistringstream'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::wistringstream::wistringstream()']]], + ['wmemchr_1721',['wmemchr',['http://en.cppreference.com/w/cpp/string/wide/wmemchr.html',0,'std']]], + ['wmemcmp_1722',['wmemcmp',['http://en.cppreference.com/w/cpp/string/wide/wmemcmp.html',0,'std']]], + ['wmemcpy_1723',['wmemcpy',['http://en.cppreference.com/w/cpp/string/wide/wmemcpy.html',0,'std']]], + ['wmemmove_1724',['wmemmove',['http://en.cppreference.com/w/cpp/string/wide/wmemmove.html',0,'std']]], + ['wmemset_1725',['wmemset',['http://en.cppreference.com/w/cpp/string/wide/wmemset.html',0,'std']]], + ['wofstream_1726',['wofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::wofstream'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::wofstream::wofstream()']]], + ['wostream_1727',['wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::wostream'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::wostream::wostream()']]], + ['wostringstream_1728',['wostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::wostringstream'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::wostringstream::wostringstream()']]], + ['wprintf_1729',['wprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['wregex_1730',['wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::wregex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::wregex::wregex()']]], + ['write_1731',['write',['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::strstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wiostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostrstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wfstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wstringstream::write()']]], + ['ws_1732',['ws',['http://en.cppreference.com/w/cpp/io/manip/ws.html',0,'std']]], + ['wscanf_1733',['wscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], + ['wsmatch_1734',['wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::wsmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wsmatch::wsmatch()']]], + ['wsregex_5fiterator_1735',['wsregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::wsregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wsregex_iterator::wsregex_iterator()']]], + ['wsregex_5ftoken_5fiterator_1736',['wsregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::wsregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wsregex_token_iterator::wsregex_token_iterator()']]], + ['wssub_5fmatch_1737',['wssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::wssub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wssub_match::wssub_match()']]], + ['wstreambuf_1738',['wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::wstreambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::wstreambuf::wstreambuf()']]], + ['wstreampos_1739',['wstreampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['wstring_1740',['wstring',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::wstring'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::wstring::wstring()']]], + ['wstring_5fconvert_1741',['wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert.html',0,'std::wstring_convert'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/wstring_convert.html',0,'std::wstring_convert::wstring_convert()']]], + ['wstringbuf_1742',['wstringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::wstringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::wstringbuf::wstringbuf()']]], + ['wstringstream_1743',['wstringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::wstringstream'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::wstringstream::wstringstream()']]] +]; diff --git a/search/all_18.html b/search/all_18.html new file mode 100644 index 000000000..e5781b31f --- /dev/null +++ b/search/all_18.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_18.js b/search/all_18.js new file mode 100644 index 000000000..74c3ba492 --- /dev/null +++ b/search/all_18.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['x_1744',['x',['../d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7',1,'Point']]], + ['xalloc_1745',['xalloc',['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ios::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ios_base::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::strstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wiostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wfstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wstringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ifstream::xalloc()']]], + ['xsgetn_1746',['xsgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::xsgetn()']]], + ['xsputn_1747',['xsputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::xsputn()']]] +]; diff --git a/search/all_19.html b/search/all_19.html new file mode 100644 index 000000000..8964697c7 --- /dev/null +++ b/search/all_19.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_19.js b/search/all_19.js new file mode 100644 index 000000000..66d1b43aa --- /dev/null +++ b/search/all_19.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['y_1748',['y',['../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7',1,'Point::y()'],['../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8',1,'Point::y()']]], + ['yield_1749',['yield',['http://en.cppreference.com/w/cpp/thread/yield.html',0,'std::this_thread']]], + ['yocto_1750',['yocto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['yotta_1751',['yotta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]] +]; diff --git a/search/all_1a.html b/search/all_1a.html new file mode 100644 index 000000000..9de34f1ae --- /dev/null +++ b/search/all_1a.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_1a.js b/search/all_1a.js new file mode 100644 index 000000000..15d5e1bb7 --- /dev/null +++ b/search/all_1a.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['zero_1752',['zero',['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::minutes::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::seconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::duration::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::milliseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::hours::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/zero.html',0,'std::chrono::duration_values::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::microseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::nanoseconds::zero()']]], + ['zetta_1753',['zetta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]] +]; diff --git a/search/all_1b.html b/search/all_1b.html new file mode 100644 index 000000000..f3665c17d --- /dev/null +++ b/search/all_1b.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_1b.js b/search/all_1b.js new file mode 100644 index 000000000..4f37c04f9 --- /dev/null +++ b/search/all_1b.js @@ -0,0 +1,94 @@ +var searchData= +[ + ['_7eallocator_1754',['~allocator',['http://en.cppreference.com/w/cpp/memory/allocator/~allocator.html',0,'std::allocator']]], + ['_7eauto_5fptr_1755',['~auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr/~auto_ptr.html',0,'std::auto_ptr']]], + ['_7ebasic_5ffilebuf_1756',['~basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::basic_filebuf']]], + ['_7ebasic_5fios_1757',['~basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios/~basic_ios.html',0,'std::basic_ios']]], + ['_7ebasic_5fiostream_1758',['~basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::basic_iostream']]], + ['_7ebasic_5fistream_1759',['~basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::basic_istream']]], + ['_7ebasic_5fostream_1760',['~basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::basic_ostream']]], + ['_7ebasic_5fregex_1761',['~basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::basic_regex']]], + ['_7ebasic_5fstreambuf_1762',['~basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::basic_streambuf']]], + ['_7ecmatch_1763',['~cmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::cmatch']]], + ['_7ecodecvt_1764',['~codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt/~codecvt.html',0,'std::codecvt']]], + ['_7ecodecvt_5fbyname_1765',['~codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname']]], + ['_7ecollate_1766',['~collate',['http://en.cppreference.com/w/cpp/locale/collate/~collate.html',0,'std::collate']]], + ['_7ecollate_5fbyname_1767',['~collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname']]], + ['_7econdition_5fvariable_1768',['~condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/~condition_variable.html',0,'std::condition_variable']]], + ['_7econdition_5fvariable_5fany_1769',['~condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/~condition_variable_any.html',0,'std::condition_variable_any']]], + ['_7ectype_1770',['~ctype',['http://en.cppreference.com/w/cpp/locale/ctype/~ctype.html',0,'std::ctype']]], + ['_7ectype_5fbyname_1771',['~ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]], + ['_7edeque_1772',['~deque',['http://en.cppreference.com/w/cpp/container/deque/~deque.html',0,'std::deque']]], + ['_7edynarray_1773',['~dynarray',['http://en.cppreference.com/w/cpp/container/dynarray/~dynarray.html',0,'std::dynarray']]], + ['_7eenable_5fshared_5ffrom_5fthis_1774',['~enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/~enable_shared_from_this.html',0,'std::enable_shared_from_this']]], + ['_7eerror_5fcategory_1775',['~error_category',['http://en.cppreference.com/w/cpp/error/error_category/~error_category.html',0,'std::error_category']]], + ['_7eexception_1776',['~exception',['http://en.cppreference.com/w/cpp/error/exception/~exception.html',0,'std::exception']]], + ['_7efilebuf_1777',['~filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::filebuf']]], + ['_7eforward_5flist_1778',['~forward_list',['http://en.cppreference.com/w/cpp/container/forward_list/~forward_list.html',0,'std::forward_list']]], + ['_7efunction_1779',['~function',['http://en.cppreference.com/w/cpp/utility/functional/function/~function.html',0,'std::function']]], + ['_7efuture_1780',['~future',['http://en.cppreference.com/w/cpp/thread/future/~future.html',0,'std::future']]], + ['_7eios_5fbase_1781',['~ios_base',['http://en.cppreference.com/w/cpp/io/ios_base/~ios_base.html',0,'std::ios_base']]], + ['_7eiostream_1782',['~iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::iostream']]], + ['_7eistream_1783',['~istream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::istream']]], + ['_7eistrstream_1784',['~istrstream',['http://en.cppreference.com/w/cpp/io/istrstream/~istrstream.html',0,'std::istrstream']]], + ['_7elist_1785',['~list',['http://en.cppreference.com/w/cpp/container/list/~list.html',0,'std::list']]], + ['_7elocale_1786',['~locale',['http://en.cppreference.com/w/cpp/locale/locale/~locale.html',0,'std::locale']]], + ['_7elock_5fguard_1787',['~lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard/~lock_guard.html',0,'std::lock_guard']]], + ['_7emap_1788',['~map',['http://en.cppreference.com/w/cpp/container/map/~map.html',0,'std::map']]], + ['_7ematch_5fresults_1789',['~match_results',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::match_results']]], + ['_7emessages_1790',['~messages',['http://en.cppreference.com/w/cpp/locale/messages/~messages.html',0,'std::messages']]], + ['_7emessages_5fbyname_1791',['~messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname']]], + ['_7emoney_5fget_1792',['~money_get',['http://en.cppreference.com/w/cpp/locale/money_get/~money_get.html',0,'std::money_get']]], + ['_7emoney_5fput_1793',['~money_put',['http://en.cppreference.com/w/cpp/locale/money_put/~money_put.html',0,'std::money_put']]], + ['_7emoneypunct_1794',['~moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct/~moneypunct.html',0,'std::moneypunct']]], + ['_7emoneypunct_5fbyname_1795',['~moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname']]], + ['_7emultimap_1796',['~multimap',['http://en.cppreference.com/w/cpp/container/multimap/~multimap.html',0,'std::multimap']]], + ['_7emultiset_1797',['~multiset',['http://en.cppreference.com/w/cpp/container/multiset/~multiset.html',0,'std::multiset']]], + ['_7enested_5fexception_1798',['~nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception/~nested_exception.html',0,'std::nested_exception']]], + ['_7enum_5fget_1799',['~num_get',['http://en.cppreference.com/w/cpp/locale/num_get/~num_get.html',0,'std::num_get']]], + ['_7enum_5fput_1800',['~num_put',['http://en.cppreference.com/w/cpp/locale/num_put/~num_put.html',0,'std::num_put']]], + ['_7enumpunct_1801',['~numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct/~numpunct.html',0,'std::numpunct']]], + ['_7enumpunct_5fbyname_1802',['~numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname']]], + ['_7eoptional_1803',['~optional',['http://en.cppreference.com/w/cpp/experimental/optional/~optional.html',0,'std::experimental::optional']]], + ['_7eostream_1804',['~ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::ostream']]], + ['_7eostrstream_1805',['~ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream/~ostrstream.html',0,'std::ostrstream']]], + ['_7epackaged_5ftask_1806',['~packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task/~packaged_task.html',0,'std::packaged_task']]], + ['_7epriority_5fqueue_1807',['~priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/~priority_queue.html',0,'std::priority_queue']]], + ['_7epromise_1808',['~promise',['http://en.cppreference.com/w/cpp/thread/promise/~promise.html',0,'std::promise']]], + ['_7equeue_1809',['~queue',['http://en.cppreference.com/w/cpp/container/queue/~queue.html',0,'std::queue::~queue()'],['../d2/d36/structqueue.html#ad215eee654953d25150bb25d5ac12b7c',1,'queue::~queue()']]], + ['_7eregex_1810',['~regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::regex']]], + ['_7escoped_5fallocator_5fadaptor_1811',['~scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/~scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor']]], + ['_7esentry_1812',['~sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::~sentry()']]], + ['_7eset_1813',['~set',['http://en.cppreference.com/w/cpp/container/set/~set.html',0,'std::set']]], + ['_7eshared_5ffuture_1814',['~shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future/~shared_future.html',0,'std::shared_future']]], + ['_7eshared_5flock_1815',['~shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/~shared_lock.html',0,'std::shared_lock']]], + ['_7eshared_5fptr_1816',['~shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr/~shared_ptr.html',0,'std::shared_ptr']]], + ['_7esmatch_1817',['~smatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::smatch']]], + ['_7estack_1818',['~stack',['http://en.cppreference.com/w/cpp/container/stack/~stack.html',0,'std::stack::~stack()'],['../d1/dc2/classstack.html#a0ac1dba9c7019acdc825b31d06eb0b71',1,'stack::~stack()']]], + ['_7estreambuf_1819',['~streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::streambuf']]], + ['_7estrstream_1820',['~strstream',['http://en.cppreference.com/w/cpp/io/strstream/~strstream.html',0,'std::strstream']]], + ['_7estrstreambuf_1821',['~strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf/~strstreambuf.html',0,'std::strstreambuf']]], + ['_7ethread_1822',['~thread',['http://en.cppreference.com/w/cpp/thread/thread/~thread.html',0,'std::thread']]], + ['_7etime_5fget_1823',['~time_get',['http://en.cppreference.com/w/cpp/locale/time_get/~time_get.html',0,'std::time_get']]], + ['_7etime_5fget_5fbyname_1824',['~time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname']]], + ['_7etime_5fput_1825',['~time_put',['http://en.cppreference.com/w/cpp/locale/time_put/~time_put.html',0,'std::time_put']]], + ['_7etime_5fput_5fbyname_1826',['~time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname']]], + ['_7eunique_5flock_1827',['~unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/~unique_lock.html',0,'std::unique_lock']]], + ['_7eunique_5fptr_1828',['~unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/~unique_ptr.html',0,'std::unique_ptr']]], + ['_7eunordered_5fmap_1829',['~unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/~unordered_map.html',0,'std::unordered_map']]], + ['_7eunordered_5fmultimap_1830',['~unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/~unordered_multimap.html',0,'std::unordered_multimap']]], + ['_7eunordered_5fmultiset_1831',['~unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/~unordered_multiset.html',0,'std::unordered_multiset']]], + ['_7eunordered_5fset_1832',['~unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/~unordered_set.html',0,'std::unordered_set']]], + ['_7evector_1833',['~vector',['http://en.cppreference.com/w/cpp/container/vector/~vector.html',0,'std::vector']]], + ['_7ewbuffer_5fconvert_1834',['~wbuffer_convert',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/~wbuffer_convert.html',0,'std::wbuffer_convert']]], + ['_7ewcmatch_1835',['~wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::wcmatch']]], + ['_7eweak_5fptr_1836',['~weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr/~weak_ptr.html',0,'std::weak_ptr']]], + ['_7ewfilebuf_1837',['~wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::wfilebuf']]], + ['_7ewiostream_1838',['~wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::wiostream']]], + ['_7ewistream_1839',['~wistream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::wistream']]], + ['_7ewostream_1840',['~wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::wostream']]], + ['_7ewregex_1841',['~wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::wregex']]], + ['_7ewsmatch_1842',['~wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::wsmatch']]], + ['_7ewstreambuf_1843',['~wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::wstreambuf']]], + ['_7ewstring_5fconvert_1844',['~wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert/~wstring_convert.html',0,'std::wstring_convert']]] +]; diff --git a/search/all_2.html b/search/all_2.html new file mode 100644 index 000000000..ffa7873b7 --- /dev/null +++ b/search/all_2.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_2.js b/search/all_2.js new file mode 100644 index 000000000..787f95a82 --- /dev/null +++ b/search/all_2.js @@ -0,0 +1,82 @@ +var searchData= +[ + ['b_97',['b',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::b()']]], + ['back_98',['back',['http://en.cppreference.com/w/cpp/container/dynarray/back.html',0,'std::dynarray::back()'],['http://en.cppreference.com/w/cpp/container/vector/back.html',0,'std::vector::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::string::back()'],['http://en.cppreference.com/w/cpp/container/deque/back.html',0,'std::deque::back()'],['http://en.cppreference.com/w/cpp/container/queue/back.html',0,'std::queue::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::basic_string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::wstring::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u16string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u32string::back()'],['http://en.cppreference.com/w/cpp/container/list/back.html',0,'std::list::back()'],['http://en.cppreference.com/w/cpp/container/array/back.html',0,'std::array::back()']]], + ['back_5finsert_5fiterator_99',['back_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/back_insert_iterator.html',0,'std']]], + ['back_5finserter_100',['back_inserter',['http://en.cppreference.com/w/cpp/iterator/back_inserter.html',0,'std']]], + ['bad_101',['bad',['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ios::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::strstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wiostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wfstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wstringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ifstream::bad()']]], + ['bad_5falloc_102',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::bad_alloc()']]], + ['bad_5farray_5flength_103',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length'],['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length::bad_array_length()']]], + ['bad_5farray_5fnew_5flength_104',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length.html',0,'std::bad_array_new_length'],['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length/bad_array_new_length.html',0,'std::bad_array_new_length::bad_array_new_length()']]], + ['bad_5fcast_105',['bad_cast',['http://en.cppreference.com/w/cpp/types/bad_cast.html',0,'std::bad_cast'],['http://en.cppreference.com/w/cpp/types/bad_cast/bad_cast.html',0,'std::bad_cast::bad_cast()']]], + ['bad_5fexception_106',['bad_exception',['http://en.cppreference.com/w/cpp/error/bad_exception.html',0,'std']]], + ['bad_5ffunction_5fcall_107',['bad_function_call',['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call'],['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call::bad_function_call()']]], + ['bad_5foptional_5faccess_108',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access'],['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access::bad_optional_access()']]], + ['bad_5ftypeid_109',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid.html',0,'std::bad_typeid'],['http://en.cppreference.com/w/cpp/types/bad_typeid/bad_typeid.html',0,'std::bad_typeid::bad_typeid()']]], + ['bad_5fweak_5fptr_110',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr.html',0,'std::bad_weak_ptr'],['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr/bad_weak_ptr.html',0,'std::bad_weak_ptr::bad_weak_ptr()']]], + ['base_111',['base',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux48::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::discard_block_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/base.html',0,'std::independent_bits_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::shuffle_order_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux24::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::knuth_b::base()']]], + ['basic_5ffilebuf_112',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::basic_filebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::basic_filebuf::basic_filebuf()']]], + ['basic_5ffstream_113',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::basic_fstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::basic_fstream::basic_fstream()']]], + ['basic_5fifstream_114',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::basic_ifstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::basic_ifstream::basic_ifstream()']]], + ['basic_5fios_115',['basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std::basic_ios< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ios/basic_ios.html',0,'std::basic_ios::basic_ios()']]], + ['basic_5fios_3c_20char_20_3e_116',['basic_ios< char >',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], + ['basic_5fios_3c_20wchar_5ft_20_3e_117',['basic_ios< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], + ['basic_5fiostream_118',['basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::basic_iostream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::basic_iostream::basic_iostream()']]], + ['basic_5fistream_119',['basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::basic_istream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::basic_istream::basic_istream()']]], + ['basic_5fistringstream_120',['basic_istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::basic_istringstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::basic_istringstream::basic_istringstream()']]], + ['basic_5fofstream_121',['basic_ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::basic_ofstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::basic_ofstream::basic_ofstream()']]], + ['basic_5fostream_122',['basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::basic_ostream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::basic_ostream::basic_ostream()']]], + ['basic_5fostringstream_123',['basic_ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::basic_ostringstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::basic_ostringstream::basic_ostringstream()']]], + ['basic_5fregex_124',['basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std::basic_regex'],['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::basic_regex::basic_regex()']]], + ['basic_5fstreambuf_125',['basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std::basic_streambuf'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::basic_streambuf::basic_streambuf()']]], + ['basic_5fstring_126',['basic_string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std::basic_string< Char >'],['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::basic_string::basic_string()']]], + ['basic_5fstring_3c_20char8_5ft_20_3e_127',['basic_string< char8_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['basic_5fstringbuf_128',['basic_stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std::basic_stringbuf'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::basic_stringbuf::basic_stringbuf()']]], + ['basic_5fstringstream_129',['basic_stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std::basic_stringstream< Char >'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::basic_stringstream::basic_stringstream()']]], + ['bayes_5fagivenb_130',['bayes_AgivenB',['../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba',1,'bayes_theorem.cpp']]], + ['bayes_5fbgivena_131',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]], + ['bayes_5ftheorem_2ecpp_132',['bayes_theorem.cpp',['../d5/d67/bayes__theorem_8cpp.html',1,'']]], + ['before_133',['before',['http://en.cppreference.com/w/cpp/types/type_info/before.html',0,'std::type_info']]], + ['before_5fbegin_134',['before_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], + ['begin_135',['begin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()']]], + ['begin_28int_29_136',['begin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::begin(int)()']]], + ['bernoulli_5fdistribution_137',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution.html',0,'std::bernoulli_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/bernoulli_distribution.html',0,'std::bernoulli_distribution::bernoulli_distribution()']]], + ['beta_138',['beta',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], + ['bidirectional_5fiterator_5ftag_139',['bidirectional_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['binary_5fexponent_2ecpp_140',['binary_exponent.cpp',['../de/dcf/binary__exponent_8cpp.html',1,'']]], + ['binary_5ffunction_141',['binary_function',['http://en.cppreference.com/w/cpp/utility/functional/binary_function.html',0,'std']]], + ['binary_5fnegate_142',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::binary_negate()']]], + ['binary_5fs_143',['binary_s',['../d8/d8a/exponential__search_8cpp.html#a0f697e2a3b5193324ab84bd4045088f7',1,'exponential_search.cpp']]], + ['binary_5fsearch_144',['binary_search',['http://en.cppreference.com/w/cpp/algorithm/binary_search.html',0,'std::binary_search()'],['../df/dd5/binary__search_8cpp.html#a78df202b718cfe3c2c9216979b08298d',1,'binary_search(): binary_search.cpp']]], + ['binary_5fsearch_2ecpp_145',['binary_search.cpp',['../df/dd5/binary__search_8cpp.html',1,'']]], + ['binary_5fsearch_5ftree_2ecpp_146',['binary_search_tree.cpp',['../d3/d26/binary__search__tree_8cpp.html',1,'']]], + ['binaryheap_2ecpp_147',['binaryheap.cpp',['../de/dc3/binaryheap_8cpp.html',1,'']]], + ['bind_148',['bind',['http://en.cppreference.com/w/cpp/utility/functional/bind.html',0,'std']]], + ['binexpo_149',['binExpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo(int a, int b): binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4',1,'binExpo(int64_t a, int64_t b, int64_t m): modular_inverse_fermat_little_theorem.cpp']]], + ['binexpo_5falt_150',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]], + ['binomial_5fdist_2ecpp_151',['binomial_dist.cpp',['../d6/db0/binomial__dist_8cpp.html',1,'']]], + ['binomial_5fdistribution_152',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution.html',0,'std::binomial_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/binomial_distribution.html',0,'std::binomial_distribution::binomial_distribution()']]], + ['binomial_5fexpected_153',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]], + ['binomial_5frange_5fsuccesses_154',['binomial_range_successes',['../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25',1,'binomial_dist.cpp']]], + ['binomial_5fstandard_5fdeviation_155',['binomial_standard_deviation',['../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc',1,'binomial_dist.cpp']]], + ['binomial_5fvariance_156',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]], + ['binomial_5fx_5fsuccesses_157',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]], + ['bisection_5fmethod_2ecpp_158',['bisection_method.cpp',['../d7/d6a/bisection__method_8cpp.html',1,'']]], + ['bit_159',['Bit',['../df/d27/class_bit.html',1,'']]], + ['bit_5fand_160',['bit_and',['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std']]], + ['bit_5fnot_161',['bit_not',['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std']]], + ['bit_5for_162',['bit_or',['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std']]], + ['bitset_163',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std::bitset< Bits >'],['http://en.cppreference.com/w/cpp/utility/bitset/bitset.html',0,'std::bitset::bitset()']]], + ['bitset_3c_20maxn_20_3e_164',['bitset< MAXN >',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], + ['boolalpha_165',['boolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], + ['brute_5fforce_166',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]], + ['brute_5fforce_5fstring_5fsearching_2ecpp_167',['brute_force_string_searching.cpp',['../d3/d7d/brute__force__string__searching_8cpp.html',1,'']]], + ['bsearch_168',['bsearch',['http://en.cppreference.com/w/cpp/algorithm/bsearch.html',0,'std']]], + ['btowc_169',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]], + ['btree_170',['Btree',['../d9/d90/struct_btree.html',1,'']]], + ['bubble_5fsort_2ecpp_171',['bubble_sort.cpp',['../d8/d13/bubble__sort_8cpp.html',1,'']]], + ['bucket_172',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()']]], + ['bucket_5fcount_173',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()']]], + ['bucket_5fsize_174',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]], + ['buzz_5fnumber_2ecpp_175',['buzz_number.cpp',['../d1/d76/buzz__number_8cpp.html',1,'']]] +]; diff --git a/search/all_3.html b/search/all_3.html new file mode 100644 index 000000000..f9df19b41 --- /dev/null +++ b/search/all_3.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_3.js b/search/all_3.js new file mode 100644 index 000000000..a1f46c327 --- /dev/null +++ b/search/all_3.js @@ -0,0 +1,91 @@ +var searchData= +[ + ['c16rtomb_176',['c16rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html',0,'std']]], + ['c32rtomb_177',['c32rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html',0,'std']]], + ['c_5fstr_178',['c_str',['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::basic_string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::wstring::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u16string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u32string::c_str()']]], + ['call_5fonce_179',['call_once',['http://en.cppreference.com/w/cpp/thread/call_once.html',0,'std']]], + ['calloc_180',['calloc',['http://en.cppreference.com/w/cpp/memory/c/calloc.html',0,'std']]], + ['capacity_181',['capacity',['../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02',1,'MinHeap::capacity()'],['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()']]], + ['catalog_182',['catalog',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_byname::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_base::catalog']]], + ['category_183',['category',['http://en.cppreference.com/w/cpp/error/error_code/category.html',0,'std::error_code::category()'],['http://en.cppreference.com/w/cpp/error/error_condition/category.html',0,'std::error_condition::category()']]], + ['cauchy_5fdistribution_184',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution.html',0,'std::cauchy_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/cauchy_distribution.html',0,'std::cauchy_distribution::cauchy_distribution()']]], + ['cbefore_5fbegin_185',['cbefore_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], + ['cbegin_186',['cbegin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::cbegin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::cbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::cbegin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::cbegin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::cbegin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::cbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::cbegin()']]], + ['cbegin_28int_29_187',['cbegin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::cbegin(int)()']]], + ['cbrt_188',['cbrt',['http://en.cppreference.com/w/cpp/numeric/math/cbrt.html',0,'std']]], + ['ceil_189',['ceil',['http://en.cppreference.com/w/cpp/numeric/math/ceil.html',0,'std']]], + ['cend_190',['cend',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::cend()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::cend()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::cend()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::cend()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::cend()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::cend()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::cend()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::cend()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::cend()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::cend()']]], + ['cend_28int_29_191',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()']]], + ['centi_192',['centi',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['cerr_193',['cerr',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['char_5ftraits_194',['char_traits',['http://en.cppreference.com/w/cpp/string/char_traits.html',0,'std']]], + ['char_5ftype_195',['char_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::char_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::char_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::char_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::char_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::char_type']]], + ['check_5fif_5fequal_196',['check_if_equal',['../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd',1,'string_search']]], + ['check_5fprime_2ecpp_197',['check_prime.cpp',['../db/d93/check__prime_8cpp.html',1,'']]], + ['check_5fsize_5fmatch_198',['check_size_match',['../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56',1,'machine_learning::adaline']]], + ['check_5ftermination_199',['check_termination',['../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377',1,'durand_kerner_roots.cpp']]], + ['chi_5fsquared_5fdistribution_200',['chi_squared_distribution',['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution.html',0,'std::chi_squared_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/chi_squared_distribution.html',0,'std::chi_squared_distribution::chi_squared_distribution()']]], + ['cin_201',['cin',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['circle_202',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]], + ['classic_203',['classic',['http://en.cppreference.com/w/cpp/locale/locale/classic.html',0,'std::locale']]], + ['clear_204',['clear',['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::fstream::clear()'],['http://en.cppreference.com/w/cpp/container/vector/clear.html',0,'std::vector::clear()'],['http://en.cppreference.com/w/cpp/container/multiset/clear.html',0,'std::multiset::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostream::clear()'],['http://en.cppreference.com/w/cpp/container/set/clear.html',0,'std::set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_map/clear.html',0,'std::unordered_map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ios::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_fstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::stringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/clear.html',0,'std::unordered_multimap::clear()'],['http://en.cppreference.com/w/cpp/container/forward_list/clear.html',0,'std::forward_list::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_code/clear.html',0,'std::error_code::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wifstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istream::clear()'],['http://en.cppreference.com/w/cpp/container/deque/clear.html',0,'std::deque::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::strstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_stringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::basic_string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::wstring::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/clear.html',0,'std::unordered_multiset::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_condition/clear.html',0,'std::error_condition::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u16string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wiostream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u32string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ifstream::clear()'],['http://en.cppreference.com/w/cpp/container/list/clear.html',0,'std::list::clear()'],['http://en.cppreference.com/w/cpp/container/map/clear.html',0,'std::map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_set/clear.html',0,'std::unordered_set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wfstream::clear()'],['http://en.cppreference.com/w/cpp/container/multimap/clear.html',0,'std::multimap::clear()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/clear.html',0,'std::atomic_flag::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wstringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ifstream::clear()'],['../d2/d36/structqueue.html#ab2019d91e28c06de325fb3076b93a930',1,'queue::clear()'],['../d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b',1,'stack::clear()']]], + ['clearerr_205',['clearerr',['http://en.cppreference.com/w/cpp/io/c/clearerr.html',0,'std']]], + ['cll_206',['cll',['../d5/d15/classcll.html',1,'']]], + ['clock_207',['clock',['http://en.cppreference.com/w/cpp/chrono/c/clock.html',0,'std']]], + ['clock_5ft_208',['clock_t',['http://en.cppreference.com/w/cpp/chrono/c/clock_t.html',0,'std']]], + ['clog_209',['clog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['close_210',['close',['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::basic_ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::basic_filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::basic_fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::wfilebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::wifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::basic_ifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::wfstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::wofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::ifstream::close()']]], + ['cmatch_211',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::cmatch'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::cmatch::cmatch()']]], + ['code_212',['code',['http://en.cppreference.com/w/cpp/thread/future_error/code.html',0,'std::future_error::code()'],['http://en.cppreference.com/w/cpp/regex/regex_error/code.html',0,'std::regex_error::code()'],['http://en.cppreference.com/w/cpp/error/system_error/code.html',0,'std::system_error::code()']]], + ['codecvt_213',['codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt'],['http://en.cppreference.com/w/cpp/locale/codecvt/codecvt.html',0,'std::codecvt::codecvt()']]], + ['codecvt_5fbase_214',['codecvt_base',['http://en.cppreference.com/w/cpp/locale/codecvt_base.html',0,'std']]], + ['codecvt_5fbyname_215',['codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname'],['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname::codecvt_byname()']]], + ['codecvt_5futf16_216',['codecvt_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf16.html',0,'std']]], + ['codecvt_5futf8_217',['codecvt_utf8',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8.html',0,'std']]], + ['codecvt_5futf8_5futf16_218',['codecvt_utf8_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8_utf16.html',0,'std']]], + ['collate_219',['collate',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate'],['http://en.cppreference.com/w/cpp/locale/collate/collate.html',0,'std::collate::collate()']]], + ['collate_5fbyname_220',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname'],['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname::collate_byname()']]], + ['combine_221',['combine',['http://en.cppreference.com/w/cpp/locale/locale/combine.html',0,'std::locale']]], + ['common_5ftype_222',['common_type',['http://en.cppreference.com/w/cpp/types/common_type.html',0,'std']]], + ['comp_223',['comp',['../d9/d69/median__search_8cpp.html#a3a66390d0e407dce4fcbf63a169c6c8f',1,'median_search.cpp']]], + ['compare_224',['compare',['../d1/db3/structcompare.html',1,'compare'],['http://en.cppreference.com/w/cpp/string/char_traits/compare.html',0,'std::char_traits::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wcsub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wssub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::csub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::ssub_match::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::basic_string::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::wstring::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u16string::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u32string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::sub_match::compare()'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare(): shell_sort2.cpp']]], + ['compare_5fexchange_5fstrong_225',['compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], + ['compare_5fexchange_5fweak_226',['compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], + ['complex_227',['complex',['http://en.cppreference.com/w/cpp/numeric/complex.html',0,'std::complex'],['http://en.cppreference.com/w/cpp/numeric/complex/complex.html',0,'std::complex::complex()']]], + ['complex_5fstr_228',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740',1,'durand_kerner_roots.cpp']]], + ['condition_5fvariable_229',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std::condition_variable'],['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable::condition_variable()']]], + ['condition_5fvariable_5fany_230',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std::condition_variable_any'],['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any::condition_variable_any()']]], + ['conditional_231',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], + ['const_5fpointer_5fcast_232',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['construct_233',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()']]], + ['converted_234',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], + ['copy_235',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], + ['copy_5fbackward_236',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], + ['copy_5fif_237',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], + ['copy_5fn_238',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], + ['copyfmt_239',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]], + ['copysign_240',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], + ['cos_241',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], + ['cosh_242',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], + ['count_243',['count',['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count()']]], + ['count_5fif_244',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], + ['cout_245',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['crbegin_246',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]], + ['create_5fhash_247',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], + ['create_5flist_248',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], + ['create_5fmatrix_249',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a33cb0a68c36aa26fd599c7c66da86ed7',1,'qr_eigen_values.cpp']]], + ['createnode_250',['createNode',['../d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0',1,'avltree.cpp']]], + ['cref_251',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], + ['cregex_5fiterator_252',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std::cregex_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator::cregex_iterator()']]], + ['cregex_5ftoken_5fiterator_253',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std::cregex_token_iterator'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator::cregex_token_iterator()']]], + ['crend_254',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]], + ['csub_5fmatch_255',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std::csub_match'],['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match::csub_match()']]], + ['ctime_256',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], + ['ctype_257',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std::ctype'],['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype::ctype()']]], + ['ctype_5fbase_258',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]], + ['ctype_5fbyname_259',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname'],['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname::ctype_byname()']]], + ['curr_5fsymbol_260',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]], + ['current_5fexception_261',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]], + ['cyclecheck_262',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]], + ['contribution_20guidelines_263',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]] +]; diff --git a/search/all_4.html b/search/all_4.html new file mode 100644 index 000000000..aa2c933f8 --- /dev/null +++ b/search/all_4.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_4.js b/search/all_4.js new file mode 100644 index 000000000..52a42c6e7 --- /dev/null +++ b/search/all_4.js @@ -0,0 +1,90 @@ +var searchData= +[ + ['data_264',['data',['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data(): hash_search.cpp']]], + ['date_5forder_265',['date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::date_order()']]], + ['deallocate_266',['deallocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/deallocate.html',0,'std::allocator_traits::deallocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/deallocate.html',0,'std::allocator::deallocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/deallocate.html',0,'std::scoped_allocator_adaptor::deallocate()']]], + ['dec_267',['dec',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], + ['deca_268',['deca',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['decay_269',['decay',['http://en.cppreference.com/w/cpp/types/decay.html',0,'std']]], + ['deci_270',['deci',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['decimal_5fpoint_271',['decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::decimal_point()']]], + ['decimal_5fto_5fbinary_2ecpp_272',['decimal_to_binary.cpp',['../df/d06/decimal__to__binary_8cpp.html',1,'']]], + ['decimal_5fto_5fhexadecimal_2ecpp_273',['decimal_to_hexadecimal.cpp',['../da/de7/decimal__to__hexadecimal_8cpp.html',1,'']]], + ['decimal_5fto_5froman_5fnumeral_2ecpp_274',['decimal_to_roman_numeral.cpp',['../de/d85/decimal__to__roman__numeral_8cpp.html',1,'']]], + ['declare_5fno_5fpointers_275',['declare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/declare_no_pointers.html',0,'std']]], + ['declare_5freachable_276',['declare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html',0,'std']]], + ['declval_277',['declval',['http://en.cppreference.com/w/cpp/utility/declval.html',0,'std']]], + ['decreasekey_278',['decreaseKey',['../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5',1,'MinHeap']]], + ['default_5fdelete_279',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::default_delete()']]], + ['default_5ferror_5fcondition_280',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()']]], + ['default_5frandom_5fengine_281',['default_random_engine',['http://en.cppreference.com/w/cpp/numeric/random.html',0,'std']]], + ['defaultfloat_282',['defaultfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['defer_5flock_5ft_283',['defer_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['deletekey_284',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]], + ['deletenode_285',['deleteNode',['../d8/dee/avltree_8cpp.html#a8286388b0743a716145639df3a33e541',1,'avltree.cpp']]], + ['denorm_5fmin_286',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]], + ['densities_287',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()']]], + ['deque_288',['deque',['http://en.cppreference.com/w/cpp/container/deque.html',0,'std::deque< T >'],['http://en.cppreference.com/w/cpp/container/deque/deque.html',0,'std::deque::deque()']]], + ['dequeue_289',['deQueue',['../d2/d36/structqueue.html#a089d4af5532e0a801f560070da6e1f86',1,'queue']]], + ['destroy_290',['destroy',['http://en.cppreference.com/w/cpp/memory/allocator_traits/destroy.html',0,'std::allocator_traits::destroy()'],['http://en.cppreference.com/w/cpp/memory/allocator/destroy.html',0,'std::allocator::destroy()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/destroy.html',0,'std::scoped_allocator_adaptor::destroy()']]], + ['detach_291',['detach',['http://en.cppreference.com/w/cpp/thread/thread/detach.html',0,'std::thread']]], + ['difftime_292',['difftime',['http://en.cppreference.com/w/cpp/chrono/c/difftime.html',0,'std']]], + ['digit_5fchar_293',['digit_char',['../db/d82/classlarge__number.html#af530d90830d385c76973658ff3214f98',1,'large_number']]], + ['direction_294',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]], + ['discard_295',['discard',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]], + ['discard_5fblock_5fengine_296',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std::discard_block_engine'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine::discard_block_engine()']]], + ['discrete_5fdistribution_297',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std::discrete_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution::discrete_distribution()']]], + ['display_298',['display',['../d2/d36/structqueue.html#a26f48801df462ade003b50739196fa4c',1,'queue::display()'],['../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628',1,'stack::display()']]], + ['distance_299',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], + ['div_300',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], + ['divides_301',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]], + ['do_5falways_5fnoconv_302',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]], + ['do_5fclose_303',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]], + ['do_5fcompare_304',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]], + ['do_5fcurr_5fsymbol_305',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]], + ['do_5fdate_5forder_306',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]], + ['do_5fdecimal_5fpoint_307',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]], + ['do_5fencoding_308',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]], + ['do_5ffalsename_309',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]], + ['do_5ffrac_5fdigits_310',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]], + ['do_5fget_311',['do_get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()']]], + ['do_5fget_5fdate_312',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]], + ['do_5fget_5fmonthname_313',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname()']]], + ['do_5fget_5ftime_314',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()']]], + ['do_5fget_5fweekday_315',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]], + ['do_5fget_5fyear_316',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]], + ['do_5fgrouping_317',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]], + ['do_5fhash_318',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]], + ['do_5fin_319',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]], + ['do_5fis_320',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]], + ['do_5flength_321',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]], + ['do_5fmax_5flength_322',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]], + ['do_5fnarrow_323',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]], + ['do_5fneg_5fformat_324',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]], + ['do_5fnegative_5fsign_325',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]], + ['do_5fopen_326',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]], + ['do_5fout_327',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()']]], + ['do_5fpos_5fformat_328',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()']]], + ['do_5fpositive_5fsign_329',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]], + ['do_5fput_330',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()']]], + ['do_5fscan_5fis_331',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()']]], + ['do_5fthousands_5fsep_332',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]], + ['do_5ftolower_333',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]], + ['do_5ftoupper_334',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]], + ['do_5ftransform_335',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]], + ['do_5ftruename_336',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]], + ['do_5funshift_337',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]], + ['do_5fwiden_338',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], + ['domain_5ferror_339',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error'],['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error::domain_error()']]], + ['double_5ffactorial_2ecpp_340',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], + ['double_5ffactorial_5fiterative_341',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]], + ['double_5ffactorial_5frecursive_342',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]], + ['double_5flinked_5flist_343',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]], + ['durand_5fkerner_5falgo_344',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#ac38b9cfd2a39d856e0feba3b5d241ded',1,'durand_kerner_roots.cpp']]], + ['durand_5fkerner_5froots_2ecpp_345',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]], + ['duration_346',['duration',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::duration'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration::duration()']]], + ['duration_5fcast_347',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]], + ['duration_5fvalues_348',['duration_values',['http://en.cppreference.com/w/cpp/chrono/duration_values.html',0,'std::chrono']]], + ['dynamic_5fpointer_5fcast_349',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['dynarray_350',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray.html',0,'std::dynarray'],['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray::dynarray()']]] +]; diff --git a/search/all_5.html b/search/all_5.html new file mode 100644 index 000000000..71848afa5 --- /dev/null +++ b/search/all_5.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_5.js b/search/all_5.js new file mode 100644 index 000000000..ee3050a35 --- /dev/null +++ b/search/all_5.js @@ -0,0 +1,65 @@ +var searchData= +[ + ['eback_351',['eback',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::eback()']]], + ['edge_352',['Edge',['../d7/d77/class_edge.html',1,'Edge'],['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge::Edge()']]], + ['egptr_353',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()']]], + ['eigen_5fvalues_354',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a763896dbb4a7e95c4a1e614ac0819d66',1,'qr_algorithm']]], + ['emplace_355',['emplace',['http://en.cppreference.com/w/cpp/container/vector/emplace.html',0,'std::vector::emplace()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace.html',0,'std::multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/set/emplace.html',0,'std::set::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace.html',0,'std::unordered_map::emplace()'],['http://en.cppreference.com/w/cpp/container/stack/emplace.html',0,'std::stack::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace.html',0,'std::unordered_multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/deque/emplace.html',0,'std::deque::emplace()'],['http://en.cppreference.com/w/cpp/container/queue/emplace.html',0,'std::queue::emplace()'],['http://en.cppreference.com/w/cpp/container/priority_queue/emplace.html',0,'std::priority_queue::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace.html',0,'std::unordered_multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/list/emplace.html',0,'std::list::emplace()'],['http://en.cppreference.com/w/cpp/container/map/emplace.html',0,'std::map::emplace()'],['http://en.cppreference.com/w/cpp/experimental/optional/emplace.html',0,'std::experimental::optional::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace.html',0,'std::unordered_set::emplace()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace.html',0,'std::multimap::emplace()']]], + ['emplace_5fafter_356',['emplace_after',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_after.html',0,'std::forward_list']]], + ['emplace_5fback_357',['emplace_back',['http://en.cppreference.com/w/cpp/container/vector/emplace_back.html',0,'std::vector::emplace_back()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_back.html',0,'std::deque::emplace_back()'],['http://en.cppreference.com/w/cpp/container/list/emplace_back.html',0,'std::list::emplace_back()']]], + ['emplace_5ffront_358',['emplace_front',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_front.html',0,'std::forward_list::emplace_front()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_front.html',0,'std::deque::emplace_front()'],['http://en.cppreference.com/w/cpp/container/list/emplace_front.html',0,'std::list::emplace_front()']]], + ['emplace_5fhint_359',['emplace_hint',['http://en.cppreference.com/w/cpp/container/multiset/emplace_hint.html',0,'std::multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/set/emplace_hint.html',0,'std::set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace_hint.html',0,'std::unordered_map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint.html',0,'std::unordered_multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace_hint.html',0,'std::unordered_multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/map/emplace_hint.html',0,'std::map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace_hint.html',0,'std::unordered_set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace_hint.html',0,'std::multimap::emplace_hint()']]], + ['empty_360',['empty',['http://en.cppreference.com/w/cpp/container/dynarray/empty.html',0,'std::dynarray::empty()'],['http://en.cppreference.com/w/cpp/container/vector/empty.html',0,'std::vector::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::match_results::empty()'],['http://en.cppreference.com/w/cpp/container/multiset/empty.html',0,'std::multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::string::empty()'],['http://en.cppreference.com/w/cpp/container/set/empty.html',0,'std::set::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_map/empty.html',0,'std::unordered_map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wsmatch::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::smatch::empty()'],['http://en.cppreference.com/w/cpp/container/stack/empty.html',0,'std::stack::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/empty.html',0,'std::unordered_multimap::empty()'],['http://en.cppreference.com/w/cpp/container/forward_list/empty.html',0,'std::forward_list::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wcmatch::empty()'],['http://en.cppreference.com/w/cpp/container/deque/empty.html',0,'std::deque::empty()'],['http://en.cppreference.com/w/cpp/container/queue/empty.html',0,'std::queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::basic_string::empty()'],['http://en.cppreference.com/w/cpp/container/priority_queue/empty.html',0,'std::priority_queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::wstring::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/empty.html',0,'std::unordered_multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u16string::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u32string::empty()'],['http://en.cppreference.com/w/cpp/container/list/empty.html',0,'std::list::empty()'],['http://en.cppreference.com/w/cpp/container/map/empty.html',0,'std::map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::cmatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_set/empty.html',0,'std::unordered_set::empty()'],['http://en.cppreference.com/w/cpp/container/multimap/empty.html',0,'std::multimap::empty()'],['http://en.cppreference.com/w/cpp/container/array/empty.html',0,'std::array::empty()']]], + ['enable_5fif_361',['enable_if',['http://en.cppreference.com/w/cpp/types/enable_if.html',0,'std']]], + ['enable_5fshared_5ffrom_5fthis_362',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this.html',0,'std::enable_shared_from_this'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/enable_shared_from_this.html',0,'std::enable_shared_from_this::enable_shared_from_this()']]], + ['encoding_363',['encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::encoding()']]], + ['end_364',['end',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::end()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::end()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::end()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::end()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::end()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/end.html',0,'std::initializer_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::end()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::end()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::end()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::end()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::end()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::end()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::end()'],['http://en.cppreference.com/w/cpp/iterator/end.html',0,'std::end()']]], + ['end_28int_29_365',['end(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::end(int)()']]], + ['endl_366',['endl',['../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258',1,'endl(): matrix_exponentiation.cpp'],['http://en.cppreference.com/w/cpp/io/manip/endl.html',0,'std::endl()']]], + ['ends_367',['ends',['http://en.cppreference.com/w/cpp/io/manip/ends.html',0,'std']]], + ['enqueue_368',['enQueue',['../d2/d36/structqueue.html#a592c0580551ec0d3b4d43e8198d8a377',1,'queue']]], + ['entropy_369',['entropy',['http://en.cppreference.com/w/cpp/numeric/random/random_device/entropy.html',0,'std::random_device']]], + ['entry_370',['Entry',['../dd/d3b/struct_entry.html',1,'']]], + ['eof_371',['eof',['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::fstream::eof()'],['http://en.cppreference.com/w/cpp/string/char_traits/eof.html',0,'std::char_traits::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ios::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::strstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wiostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wfstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wstringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ifstream::eof()']]], + ['epptr_372',['epptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::epptr()']]], + ['epsilon_373',['epsilon',['http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon.html',0,'std::numeric_limits']]], + ['eq_374',['eq',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits::eq()'],['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): false_position.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): newton_raphson_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y): successive_approximation.cpp']]], + ['eq_5fder_375',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]], + ['eq_5fint_5ftype_376',['eq_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/eq_int_type.html',0,'std::char_traits']]], + ['eqd_377',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]], + ['equal_378',['equal',['http://en.cppreference.com/w/cpp/algorithm/equal.html',0,'std']]], + ['equal_5frange_379',['equal_range',['http://en.cppreference.com/w/cpp/container/multiset/equal_range.html',0,'std::multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/set/equal_range.html',0,'std::set::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_map/equal_range.html',0,'std::unordered_map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/equal_range.html',0,'std::unordered_multimap::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/equal_range.html',0,'std::unordered_multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/map/equal_range.html',0,'std::map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_set/equal_range.html',0,'std::unordered_set::equal_range()'],['http://en.cppreference.com/w/cpp/container/multimap/equal_range.html',0,'std::multimap::equal_range()'],['http://en.cppreference.com/w/cpp/algorithm/equal_range.html',0,'std::equal_range()']]], + ['equal_5fto_380',['equal_to',['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std']]], + ['equivalent_381',['equivalent',['http://en.cppreference.com/w/cpp/error/error_category/equivalent.html',0,'std::error_category']]], + ['erase_382',['erase',['http://en.cppreference.com/w/cpp/container/vector/erase.html',0,'std::vector::erase()'],['http://en.cppreference.com/w/cpp/container/multiset/erase.html',0,'std::multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::string::erase()'],['http://en.cppreference.com/w/cpp/container/set/erase.html',0,'std::set::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_map/erase.html',0,'std::unordered_map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/erase.html',0,'std::unordered_multimap::erase()'],['http://en.cppreference.com/w/cpp/container/deque/erase.html',0,'std::deque::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::basic_string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::wstring::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/erase.html',0,'std::unordered_multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u16string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u32string::erase()'],['http://en.cppreference.com/w/cpp/container/list/erase.html',0,'std::list::erase()'],['http://en.cppreference.com/w/cpp/container/map/erase.html',0,'std::map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_set/erase.html',0,'std::unordered_set::erase()'],['http://en.cppreference.com/w/cpp/container/multimap/erase.html',0,'std::multimap::erase()']]], + ['erase_5fafter_383',['erase_after',['http://en.cppreference.com/w/cpp/container/forward_list/erase_after.html',0,'std::forward_list']]], + ['erf_384',['erf',['http://en.cppreference.com/w/cpp/numeric/math/erf.html',0,'std']]], + ['erfc_385',['erfc',['http://en.cppreference.com/w/cpp/numeric/math/erfc.html',0,'std']]], + ['errc_386',['errc',['http://en.cppreference.com/w/cpp/error/errc.html',0,'std']]], + ['error_5fcategory_387',['error_category',['http://en.cppreference.com/w/cpp/error/error_category.html',0,'std::error_category'],['http://en.cppreference.com/w/cpp/error/error_category/error_category.html',0,'std::error_category::error_category()']]], + ['error_5fcode_388',['error_code',['http://en.cppreference.com/w/cpp/error/error_code.html',0,'std::error_code'],['http://en.cppreference.com/w/cpp/error/error_code/error_code.html',0,'std::error_code::error_code()']]], + ['error_5fcondition_389',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition.html',0,'std::error_condition'],['http://en.cppreference.com/w/cpp/error/error_condition/error_condition.html',0,'std::error_condition::error_condition()']]], + ['eta_390',['eta',['../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda',1,'machine_learning::adaline']]], + ['eulers_5ftotient_5ffunction_2ecpp_391',['eulers_totient_function.cpp',['../da/d23/eulers__totient__function_8cpp.html',1,'']]], + ['event_5fcallback_392',['event_callback',['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ios< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wfstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_iostream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wstringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::fstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_fstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::strstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ofstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::iostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_stringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ios_base::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wiostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::stringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ifstream< Char >::event_callback']]], + ['exa_393',['exa',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['exact_5fsolution_394',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_semi_implicit_euler.cpp']]], + ['exception_395',['exception',['http://en.cppreference.com/w/cpp/error/exception.html',0,'std::exception'],['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception::exception()']]], + ['exception_5fptr_396',['exception_ptr',['http://en.cppreference.com/w/cpp/error/exception_ptr.html',0,'std']]], + ['exceptions_397',['exceptions',['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ios::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::strstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wiostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wfstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wstringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ifstream::exceptions()']]], + ['exchange_398',['exchange',['http://en.cppreference.com/w/cpp/atomic/atomic/exchange.html',0,'std::atomic']]], + ['exit_399',['exit',['http://en.cppreference.com/w/cpp/utility/program/exit.html',0,'std']]], + ['exp_400',['exp',['http://en.cppreference.com/w/cpp/numeric/math/exp.html',0,'std']]], + ['exp2_401',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]], + ['expired_402',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]], + ['expm1_403',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]], + ['exponential_5fdistribution_404',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution.html',0,'std::exponential_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/exponential_distribution.html',0,'std::exponential_distribution::exponential_distribution()']]], + ['exponential_5fsearch_2ecpp_405',['exponential_search.cpp',['../d8/d8a/exponential__search_8cpp.html',1,'']]], + ['extended_5feuclid_5falgorithm_2ecpp_406',['extended_euclid_algorithm.cpp',['../d9/d5d/extended__euclid__algorithm_8cpp.html',1,'']]], + ['extendedeuclid_407',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]], + ['extendedeuclid_5f1_408',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]], + ['extent_409',['extent',['http://en.cppreference.com/w/cpp/types/extent.html',0,'std']]], + ['extern_5ftype_410',['extern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::extern_type']]], + ['extractmin_411',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]], + ['extreme_5fvalue_5fdistribution_412',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution.html',0,'std::extreme_value_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/extreme_value_distribution.html',0,'std::extreme_value_distribution::extreme_value_distribution()']]] +]; diff --git a/search/all_6.html b/search/all_6.html new file mode 100644 index 000000000..a24601b90 --- /dev/null +++ b/search/all_6.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_6.js b/search/all_6.js new file mode 100644 index 000000000..fa592d978 --- /dev/null +++ b/search/all_6.js @@ -0,0 +1,118 @@ +var searchData= +[ + ['f_413',['f',['../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9',1,'fibonacci_fast.cpp']]], + ['fabs_414',['fabs',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]], + ['facet_415',['facet',['http://en.cppreference.com/w/cpp/locale/locale/facet.html',0,'std::locale::facet'],['http://en.cppreference.com/w/cpp/locale/locale/facet/facet.html',0,'std::locale::facet::facet()']]], + ['fact_416',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]], + ['factorial_417',['factorial',['../d9/d00/factorial_8cpp.html#ae9945c15826a9c1b5c141db314b7f8b4',1,'factorial.cpp']]], + ['factorial_2ecpp_418',['factorial.cpp',['../d9/d00/factorial_8cpp.html',1,'']]], + ['factors_419',['factors',['../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b',1,'prime_factorization.cpp']]], + ['fail_420',['fail',['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ios::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::strstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wiostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wfstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wstringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ifstream::fail()']]], + ['failure_421',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure::failure()']]], + ['false_5fposition_2ecpp_422',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]], + ['false_5ftype_423',['false_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['falsename_424',['falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::falsename()']]], + ['fast_5finterger_5finput_2ecpp_425',['fast_interger_input.cpp',['../d4/de8/fast__interger__input_8cpp.html',1,'']]], + ['fast_5fpower_2ecpp_426',['fast_power.cpp',['../d2/d0b/fast__power_8cpp.html',1,'']]], + ['fast_5fpower_5flinear_427',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]], + ['fast_5fpower_5frecursive_428',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]], + ['fastinput_429',['fastinput',['../d4/de8/fast__interger__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_interger_input.cpp']]], + ['fclose_430',['fclose',['http://en.cppreference.com/w/cpp/io/c/fclose.html',0,'std']]], + ['fdim_431',['fdim',['http://en.cppreference.com/w/cpp/numeric/math/fdim.html',0,'std']]], + ['feclearexcept_432',['feclearexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feclearexcept.html',0,'std']]], + ['fegetenv_433',['fegetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]], + ['fegetexceptflag_434',['fegetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]], + ['fegetround_435',['fegetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]], + ['feholdexcept_436',['feholdexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html',0,'std']]], + ['femto_437',['femto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['feof_438',['feof',['http://en.cppreference.com/w/cpp/io/c/feof.html',0,'std']]], + ['feraiseexcept_439',['feraiseexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html',0,'std']]], + ['ferror_440',['ferror',['http://en.cppreference.com/w/cpp/io/c/ferror.html',0,'std']]], + ['fesetenv_441',['fesetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]], + ['fesetexceptflag_442',['fesetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]], + ['fesetround_443',['fesetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]], + ['fetch_5fadd_444',['fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_add.html',0,'std::atomic']]], + ['fetch_5fand_445',['fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_and.html',0,'std::atomic']]], + ['fetch_5for_446',['fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_or.html',0,'std::atomic']]], + ['fetch_5fsub_447',['fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_sub.html',0,'std::atomic']]], + ['fetch_5fxor_448',['fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_xor.html',0,'std::atomic']]], + ['fetestexcept_449',['fetestexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/fetestexcept.html',0,'std']]], + ['feupdateenv_450',['feupdateenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feupdateenv.html',0,'std']]], + ['fflush_451',['fflush',['http://en.cppreference.com/w/cpp/io/c/fflush.html',0,'std']]], + ['fgetc_452',['fgetc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]], + ['fgetpos_453',['fgetpos',['http://en.cppreference.com/w/cpp/io/c/fgetpos.html',0,'std']]], + ['fgets_454',['fgets',['http://en.cppreference.com/w/cpp/io/c/fgets.html',0,'std']]], + ['fgetwc_455',['fgetwc',['http://en.cppreference.com/w/cpp/io/c/fgetwc.html',0,'std']]], + ['fgetws_456',['fgetws',['http://en.cppreference.com/w/cpp/io/c/fgetws.html',0,'std']]], + ['fib_457',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n): fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n): fibonacci_large.cpp']]], + ['fib_5faccurate_458',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]], + ['fibonacci_459',['fibonacci',['../d9/d89/fibonacci_8cpp.html#a4bc27e88a3da5cc590f1f78622019a7b',1,'fibonacci.cpp']]], + ['fibonacci_2ecpp_460',['fibonacci.cpp',['../d9/d89/fibonacci_8cpp.html',1,'']]], + ['fibonacci_5ffast_2ecpp_461',['fibonacci_fast.cpp',['../d4/d32/fibonacci__fast_8cpp.html',1,'']]], + ['fibonacci_5flarge_2ecpp_462',['fibonacci_large.cpp',['../de/de4/fibonacci__large_8cpp.html',1,'']]], + ['file_463',['FILE',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]], + ['filebuf_464',['filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std::filebuf'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::filebuf::filebuf()']]], + ['fill_465',['fill',['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::fstream::fill()'],['http://en.cppreference.com/w/cpp/container/dynarray/fill.html',0,'std::dynarray::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ios::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::strstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wiostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wfstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wstringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ifstream::fill()'],['http://en.cppreference.com/w/cpp/container/array/fill.html',0,'std::array::fill()'],['http://en.cppreference.com/w/cpp/algorithm/fill.html',0,'std::fill()'],['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'fill(): decimal_to_roman_numeral.cpp']]], + ['fill_5fn_466',['fill_n',['http://en.cppreference.com/w/cpp/algorithm/fill_n.html',0,'std']]], + ['find_467',['find',['http://en.cppreference.com/w/cpp/string/char_traits/find.html',0,'std::char_traits::find()'],['http://en.cppreference.com/w/cpp/container/multiset/find.html',0,'std::multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::string::find()'],['http://en.cppreference.com/w/cpp/container/set/find.html',0,'std::set::find()'],['http://en.cppreference.com/w/cpp/container/unordered_map/find.html',0,'std::unordered_map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/find.html',0,'std::unordered_multimap::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::basic_string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::wstring::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/find.html',0,'std::unordered_multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u16string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u32string::find()'],['http://en.cppreference.com/w/cpp/container/map/find.html',0,'std::map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_set/find.html',0,'std::unordered_set::find()'],['http://en.cppreference.com/w/cpp/container/multimap/find.html',0,'std::multimap::find()'],['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std::find()']]], + ['find_5fend_468',['find_end',['http://en.cppreference.com/w/cpp/algorithm/find_end.html',0,'std']]], + ['find_5ffirst_5fnot_5fof_469',['find_first_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::basic_string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::wstring::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u16string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u32string::find_first_not_of()']]], + ['find_5ffirst_5fof_470',['find_first_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::basic_string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::wstring::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u16string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u32string::find_first_of()'],['http://en.cppreference.com/w/cpp/algorithm/find_first_of.html',0,'std::find_first_of()']]], + ['find_5fif_471',['find_if',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], + ['find_5fif_5fnot_472',['find_if_not',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], + ['find_5flast_5fnot_5fof_473',['find_last_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::basic_string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::wstring::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u16string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u32string::find_last_not_of()']]], + ['find_5flast_5fof_474',['find_last_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::basic_string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::wstring::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u16string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u32string::find_last_of()']]], + ['fisher_5ff_5fdistribution_475',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution.html',0,'std::fisher_f_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/fisher_f_distribution.html',0,'std::fisher_f_distribution::fisher_f_distribution()']]], + ['fit_476',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector< double > &x, const int &y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a9f1c7cd34252a9ece5bbe7ba36799044',1,'machine_learning::adaline::fit(std::vector< double > const (&X)[N], const int *y)']]], + ['fit_5fols_5fregressor_477',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a38ff1d954e9b7de93eb20e2dd101a045',1,'ordinary_least_squares_regressor.cpp']]], + ['fixed_478',['fixed',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['flags_479',['flags',['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::fstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostringstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::regex::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::basic_regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ios::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_fstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::wregex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ios_base::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::strstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wiostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wfstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wstringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ifstream::flags()']]], + ['flip_480',['flip',['http://en.cppreference.com/w/cpp/utility/bitset/flip.html',0,'std::bitset']]], + ['floor_481',['floor',['http://en.cppreference.com/w/cpp/numeric/math/floor.html',0,'std']]], + ['flush_482',['flush',['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::strstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wiostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostrstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wfstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wstringstream::flush()'],['http://en.cppreference.com/w/cpp/io/manip/flush.html',0,'std::flush()']]], + ['fma_483',['fma',['http://en.cppreference.com/w/cpp/numeric/math/fma.html',0,'std']]], + ['fmax_484',['fmax',['http://en.cppreference.com/w/cpp/numeric/math/fmax.html',0,'std']]], + ['fmin_485',['fmin',['http://en.cppreference.com/w/cpp/numeric/math/fmin.html',0,'std']]], + ['fmod_486',['fmod',['http://en.cppreference.com/w/cpp/numeric/math/fmod.html',0,'std']]], + ['fopen_487',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]], + ['for_5feach_488',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]], + ['format_489',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()']]], + ['forward_490',['forward',['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std']]], + ['forward_5fas_5ftuple_491',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]], + ['forward_5feuler_492',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]], + ['forward_5feuler_5fstep_493',['forward_euler_step',['../d6/d60/group__ode.html#gaa197c6b7085ac9ea71abc4c063e6f52f',1,'ode_forward_euler.cpp']]], + ['forward_5fiterator_5ftag_494',['forward_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['forward_5flist_495',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list.html',0,'std::forward_list< T >'],['http://en.cppreference.com/w/cpp/container/forward_list/forward_list.html',0,'std::forward_list::forward_list()']]], + ['fpclassify_496',['fpclassify',['http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html',0,'std']]], + ['fpos_497',['fpos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['fpos_5ft_498',['fpos_t',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]], + ['fprintf_499',['fprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['fputc_500',['fputc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], + ['fputs_501',['fputs',['http://en.cppreference.com/w/cpp/io/c/fputs.html',0,'std']]], + ['fputwc_502',['fputwc',['http://en.cppreference.com/w/cpp/io/c/fputwc.html',0,'std']]], + ['fputws_503',['fputws',['http://en.cppreference.com/w/cpp/io/c/fputws.html',0,'std']]], + ['frac_5fdigits_504',['frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::frac_digits()']]], + ['fread_505',['fread',['http://en.cppreference.com/w/cpp/io/c/fread.html',0,'std']]], + ['free_506',['free',['http://en.cppreference.com/w/cpp/memory/c/free.html',0,'std']]], + ['freenode_507',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]], + ['freeze_508',['freeze',['http://en.cppreference.com/w/cpp/io/strstreambuf/freeze.html',0,'std::strstreambuf::freeze()'],['http://en.cppreference.com/w/cpp/io/strstream/freeze.html',0,'std::strstream::freeze()'],['http://en.cppreference.com/w/cpp/io/ostrstream/freeze.html',0,'std::ostrstream::freeze()']]], + ['freopen_509',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]], + ['frexp_510',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]], + ['from_5fbytes_511',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]], + ['from_5ftime_5ft_512',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]], + ['front_513',['front',['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['../d2/d36/structqueue.html#a36d47fdbedc199609818385110d9f922',1,'queue::front()']]], + ['front_5finsert_5fiterator_514',['front_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/front_insert_iterator.html',0,'std']]], + ['front_5finserter_515',['front_inserter',['http://en.cppreference.com/w/cpp/iterator/front_inserter.html',0,'std']]], + ['fscanf_516',['fscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['fseek_517',['fseek',['http://en.cppreference.com/w/cpp/io/c/fseek.html',0,'std']]], + ['fsetpos_518',['fsetpos',['http://en.cppreference.com/w/cpp/io/c/fsetpos.html',0,'std']]], + ['fstream_519',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std::fstream'],['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::fstream::fstream()']]], + ['ftell_520',['ftell',['http://en.cppreference.com/w/cpp/io/c/ftell.html',0,'std']]], + ['function_521',['function',['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std::function'],['http://en.cppreference.com/w/cpp/utility/functional/function/function.html',0,'std::function::function()']]], + ['future_522',['future',['http://en.cppreference.com/w/cpp/thread/future.html',0,'std::future'],['http://en.cppreference.com/w/cpp/thread/future/future.html',0,'std::future::future()']]], + ['future_5fcategory_523',['future_category',['http://en.cppreference.com/w/cpp/thread/future/future_category.html',0,'std']]], + ['future_5ferror_524',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error.html',0,'std::future_error'],['http://en.cppreference.com/w/cpp/thread/future_error/future_error.html',0,'std::future_error::future_error()']]], + ['fwprintf_525',['fwprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['fwrite_526',['fwrite',['http://en.cppreference.com/w/cpp/io/c/fwrite.html',0,'std']]], + ['fwscanf_527',['fwscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]] +]; diff --git a/search/all_7.html b/search/all_7.html new file mode 100644 index 000000000..e42e45b42 --- /dev/null +++ b/search/all_7.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_7.js b/search/all_7.js new file mode 100644 index 000000000..22f33ed43 --- /dev/null +++ b/search/all_7.js @@ -0,0 +1,60 @@ +var searchData= +[ + ['gamma_5fdistribution_528',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution.html',0,'std::gamma_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution::gamma_distribution()']]], + ['gaussian_5felimination_2ecpp_529',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]], + ['gbump_530',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]], + ['gcd_531',['gcd',['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y): least_common_multiple.cpp']]], + ['gcd_5fiterative_5feuclidean_2ecpp_532',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]], + ['gcd_5fof_5fn_5fnumbers_2ecpp_533',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]], + ['gcd_5frecursive_5feuclidean_2ecpp_534',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]], + ['gcount_535',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]], + ['genarray_536',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]], + ['generate_537',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate()']]], + ['generate_5fcanonical_538',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]], + ['generate_5fn_539',['generate_n',['http://en.cppreference.com/w/cpp/algorithm/generate_n.html',0,'std']]], + ['generic_5fcategory_540',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]], + ['geometric_5fdistribution_541',['geometric_distribution',['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std::geometric_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution::geometric_distribution()']]], + ['get_542',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()']]], + ['get_5fallocator_543',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]], + ['get_5fclock_5fdiff_544',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.cpp']]], + ['get_5fdate_545',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]], + ['get_5fdeleter_546',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]], + ['get_5ffuture_547',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]], + ['get_5fid_548',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]], + ['get_5finput_549',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]], + ['get_5finverse_550',['get_inverse',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98ab8f75d981088369b89b8be2182483',1,'ordinary_least_squares_regressor.cpp']]], + ['get_5fmin_5f2d_551',['get_min_2d',['../d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f',1,'kohonen_som_topology.cpp']]], + ['get_5fmoney_552',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]], + ['get_5fmonthname_553',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]], + ['get_5fnew_5fhandler_554',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]], + ['get_5fpointer_5fsafety_555',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]], + ['get_5ftemporary_5fbuffer_556',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]], + ['get_5fterminate_557',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]], + ['get_5ftime_558',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]], + ['get_5ftranspose_559',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05',1,'ordinary_least_squares_regressor.cpp']]], + ['get_5funexpected_560',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]], + ['get_5fweekday_561',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]], + ['get_5fyear_562',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]], + ['getadjlist_563',['getAdjList',['../da/d9a/class_graph.html#ae8959064e179573cc48f8cee99115c07',1,'Graph']]], + ['getbalance_564',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]], + ['getc_565',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]], + ['getchar_566',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]], + ['getenv_567',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]], + ['getfailurearray_568',['getFailureArray',['../d9/d03/namespacestring__search.html#aa422aab133d4ed5e5d6022a7f701271f',1,'string_search']]], + ['getline_569',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]], + ['getloc_570',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]], + ['getmin_571',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]], + ['getnode_572',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]], + ['gets_573',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], + ['getvertices_574',['getVertices',['../da/d9a/class_graph.html#a8aa88a88269773cc4dba255dec035898',1,'Graph']]], + ['getwchar_575',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], + ['giga_576',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['global_577',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], + ['gmtime_578',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], + ['good_579',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]], + ['gptr_580',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], + ['graph_581',['graph',['../dd/d9b/classgraph.html',1,'graph'],['../da/d9a/class_graph.html',1,'Graph'],['../da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8',1,'Graph::Graph(unsigned int vertices, AdjList const &adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)']]], + ['greater_582',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]], + ['greater_5fequal_583',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]], + ['grouping_584',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]] +]; diff --git a/search/all_8.html b/search/all_8.html new file mode 100644 index 000000000..888e61909 --- /dev/null +++ b/search/all_8.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_8.js b/search/all_8.js new file mode 100644 index 000000000..ae75286ec --- /dev/null +++ b/search/all_8.js @@ -0,0 +1,25 @@ +var searchData= +[ + ['h_585',['h',['../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001',1,'hash_search.cpp']]], + ['happy_5fnumber_2ecpp_586',['happy_number.cpp',['../db/df3/happy__number_8cpp.html',1,'']]], + ['hardware_5fconcurrency_587',['hardware_concurrency',['http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html',0,'std::thread']]], + ['harr_588',['harr',['../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e',1,'MinHeap']]], + ['has_5ffacet_589',['has_facet',['http://en.cppreference.com/w/cpp/locale/has_facet.html',0,'std']]], + ['has_5fvirtual_5fdestructor_590',['has_virtual_destructor',['http://en.cppreference.com/w/cpp/types/has_virtual_destructor.html',0,'std']]], + ['haschildren_591',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]], + ['hash_592',['hash',['http://en.cppreference.com/w/cpp/utility/hash.html',0,'std::hash'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::hash()'],['http://en.cppreference.com/w/cpp/utility/hash/hash.html',0,'std::hash::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::hash()']]], + ['hash_5fcode_593',['hash_code',['http://en.cppreference.com/w/cpp/types/type_info/hash_code.html',0,'std::type_info::hash_code()'],['http://en.cppreference.com/w/cpp/types/type_index/hash_code.html',0,'std::type_index::hash_code()']]], + ['hash_5ffunction_594',['hash_function',['http://en.cppreference.com/w/cpp/container/unordered_map/hash_function.html',0,'std::unordered_map::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/hash_function.html',0,'std::unordered_multimap::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/hash_function.html',0,'std::unordered_multiset::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_set/hash_function.html',0,'std::unordered_set::hash_function()']]], + ['hash_5fsearch_595',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]], + ['hash_5fsearch_2ecpp_596',['hash_search.cpp',['../d1/df3/hash__search_8cpp.html',1,'']]], + ['hashmax_597',['HASHMAX',['../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367',1,'hash_search.cpp']]], + ['hashtab_598',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]], + ['heap_5fsize_599',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]], + ['hecto_600',['hecto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['height_601',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]], + ['hex_602',['hex',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], + ['hexfloat_603',['hexfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['high_5fresolution_5fclock_604',['high_resolution_clock',['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock.html',0,'std::chrono']]], + ['hours_605',['hours',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::hours'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::hours::hours()']]], + ['hypot_606',['hypot',['http://en.cppreference.com/w/cpp/numeric/math/hypot.html',0,'std']]] +]; diff --git a/search/all_9.html b/search/all_9.html new file mode 100644 index 000000000..dc988f457 --- /dev/null +++ b/search/all_9.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_9.js b/search/all_9.js new file mode 100644 index 000000000..99d92f3ce --- /dev/null +++ b/search/all_9.js @@ -0,0 +1,176 @@ +var searchData= +[ + ['id_607',['id',['http://en.cppreference.com/w/cpp/thread/thread/id.html',0,'std::thread::id'],['http://en.cppreference.com/w/cpp/locale/locale/id.html',0,'std::locale::id'],['http://en.cppreference.com/w/cpp/locale/locale/id/id.html',0,'std::locale::id::id()'],['http://en.cppreference.com/w/cpp/thread/thread/id/id.html',0,'std::thread::id::id()']]], + ['ifstream_608',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std::ifstream'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::ifstream::ifstream()']]], + ['ignore_609',['ignore',['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::strstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istrstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wiostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_ifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wfstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wstringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::ifstream::ignore()']]], + ['ilogb_610',['ilogb',['http://en.cppreference.com/w/cpp/numeric/math/ilogb.html',0,'std']]], + ['imag_611',['imag',['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex']]], + ['imbue_612',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()']]], + ['in_613',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()']]], + ['in_5favail_614',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()']]], + ['includes_615',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]], + ['independent_5fbits_5fengine_616',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine.html',0,'std::independent_bits_engine'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine::independent_bits_engine()']]], + ['infinity_617',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]], + ['init_618',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947',1,'init(): sieve_of_eratosthenes.cpp']]], + ['initializer_5flist_619',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list.html',0,'std::initializer_list'],['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list::initializer_list()']]], + ['inner_5fallocator_620',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]], + ['inner_5fproduct_621',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]], + ['inplace_5fmerge_622',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]], + ['input_5fiterator_5ftag_623',['input_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['insert_624',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a',1,'insert(): avltree.cpp']]], + ['insert_5fafter_625',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]], + ['insert_5fiterator_626',['insert_iterator',['http://en.cppreference.com/w/cpp/iterator/insert_iterator.html',0,'std']]], + ['insertatthebeginning_627',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]], + ['inserter_628',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]], + ['insertkey_629',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]], + ['int16_5ft_630',['int16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int32_5ft_631',['int32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int64_5ft_632',['int64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int8_5ft_633',['int8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast16_5ft_634',['int_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast32_5ft_635',['int_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast64_5ft_636',['int_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast8_5ft_637',['int_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast16_5ft_638',['int_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast32_5ft_639',['int_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast64_5ft_640',['int_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast8_5ft_641',['int_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['integer_5fsequence_642',['integer_sequence',['http://en.cppreference.com/w/cpp/utility/integer_sequence.html',0,'std']]], + ['integral_5fconstant_643',['integral_constant',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['intern_5ftype_644',['intern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::intern_type']]], + ['internal_645',['internal',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std']]], + ['interpolation_5fsearch_646',['interpolation_search',['../d9/dd7/interpolation__search_8cpp.html#a9805865b5c5ca6b0fdf95fd86132625a',1,'interpolation_search.cpp']]], + ['interpolation_5fsearch_2ecpp_647',['interpolation_search.cpp',['../d9/dd7/interpolation__search_8cpp.html',1,'']]], + ['interpolation_5fsearch2_2ecpp_648',['interpolation_search2.cpp',['../df/d39/interpolation__search2_8cpp.html',1,'']]], + ['interpolationsearch_649',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]], + ['intervals_650',['intervals',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::intervals()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::intervals()']]], + ['intmax_5ft_651',['intmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['intptr_5ft_652',['intptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['invalid_5fargument_653',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument'],['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument::invalid_argument()']]], + ['ios_5fbase_654',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base.html',0,'std::ios_base'],['http://en.cppreference.com/w/cpp/io/ios_base/ios_base.html',0,'std::ios_base::ios_base()']]], + ['iostream_655',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std::iostream'],['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::iostream::iostream()']]], + ['iota_656',['iota',['http://en.cppreference.com/w/cpp/algorithm/iota.html',0,'std']]], + ['is_657',['is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::is()']]], + ['is_5fabstract_658',['is_abstract',['http://en.cppreference.com/w/cpp/types/is_abstract.html',0,'std']]], + ['is_5farithmetic_659',['is_arithmetic',['http://en.cppreference.com/w/cpp/types/is_arithmetic.html',0,'std']]], + ['is_5farray_660',['is_array',['http://en.cppreference.com/w/cpp/types/is_array.html',0,'std']]], + ['is_5fassignable_661',['is_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5fbase_5fof_662',['is_base_of',['http://en.cppreference.com/w/cpp/types/is_base_of.html',0,'std']]], + ['is_5fbind_5fexpression_663',['is_bind_expression',['http://en.cppreference.com/w/cpp/utility/functional/is_bind_expression.html',0,'std']]], + ['is_5fclass_664',['is_class',['http://en.cppreference.com/w/cpp/types/is_class.html',0,'std']]], + ['is_5fcompound_665',['is_compound',['http://en.cppreference.com/w/cpp/types/is_compound.html',0,'std']]], + ['is_5fconst_666',['is_const',['http://en.cppreference.com/w/cpp/types/is_const.html',0,'std']]], + ['is_5fconstructible_667',['is_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5fconvertible_668',['is_convertible',['http://en.cppreference.com/w/cpp/types/is_convertible.html',0,'std']]], + ['is_5fcopy_5fassignable_669',['is_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5fcopy_5fconstructible_670',['is_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5fdefault_5fconstructible_671',['is_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5fdestructible_672',['is_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5fempty_673',['is_empty',['http://en.cppreference.com/w/cpp/types/is_empty.html',0,'std']]], + ['is_5fenum_674',['is_enum',['http://en.cppreference.com/w/cpp/types/is_enum.html',0,'std']]], + ['is_5ferror_5fcode_5fenum_675',['is_error_code_enum',['http://en.cppreference.com/w/cpp/error/error_code/is_error_code_enum.html',0,'std']]], + ['is_5ferror_5fcondition_5fenum_676',['is_error_condition_enum',['http://en.cppreference.com/w/cpp/error/error_condition/is_error_condition_enum.html',0,'std']]], + ['is_5ffloating_5fpoint_677',['is_floating_point',['http://en.cppreference.com/w/cpp/types/is_floating_point.html',0,'std']]], + ['is_5ffunction_678',['is_function',['http://en.cppreference.com/w/cpp/types/is_function.html',0,'std']]], + ['is_5ffundamental_679',['is_fundamental',['http://en.cppreference.com/w/cpp/types/is_fundamental.html',0,'std']]], + ['is_5fhappy_680',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]], + ['is_5fheap_681',['is_heap',['http://en.cppreference.com/w/cpp/algorithm/is_heap.html',0,'std']]], + ['is_5fheap_5funtil_682',['is_heap_until',['http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html',0,'std']]], + ['is_5fintegral_683',['is_integral',['http://en.cppreference.com/w/cpp/types/is_integral.html',0,'std']]], + ['is_5fliteral_5ftype_684',['is_literal_type',['http://en.cppreference.com/w/cpp/types/is_literal_type.html',0,'std']]], + ['is_5flock_5ffree_685',['is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic/is_lock_free.html',0,'std::atomic']]], + ['is_5flvalue_5freference_686',['is_lvalue_reference',['http://en.cppreference.com/w/cpp/types/is_lvalue_reference.html',0,'std']]], + ['is_5fmember_5ffunction_5fpointer_687',['is_member_function_pointer',['http://en.cppreference.com/w/cpp/types/is_member_function_pointer.html',0,'std']]], + ['is_5fmember_5fobject_5fpointer_688',['is_member_object_pointer',['http://en.cppreference.com/w/cpp/types/is_member_object_pointer.html',0,'std']]], + ['is_5fmember_5fpointer_689',['is_member_pointer',['http://en.cppreference.com/w/cpp/types/is_member_pointer.html',0,'std']]], + ['is_5fmove_5fassignable_690',['is_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5fmove_5fconstructible_691',['is_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5fnothrow_5fassignable_692',['is_nothrow_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5fnothrow_5fconstructible_693',['is_nothrow_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5fnothrow_5fcopy_5fassignable_694',['is_nothrow_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5fnothrow_5fcopy_5fconstructible_695',['is_nothrow_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5fnothrow_5fdefault_5fconstructible_696',['is_nothrow_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5fnothrow_5fdestructible_697',['is_nothrow_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5fnothrow_5fmove_5fassignable_698',['is_nothrow_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5fnothrow_5fmove_5fconstructible_699',['is_nothrow_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5fobject_700',['is_object',['http://en.cppreference.com/w/cpp/types/is_object.html',0,'std']]], + ['is_5fopen_701',['is_open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::basic_ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::basic_filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::basic_fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::wfilebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::wifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::basic_ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::wfstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::wofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::ifstream::is_open()']]], + ['is_5fpartitioned_702',['is_partitioned',['http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html',0,'std']]], + ['is_5fpermutation_703',['is_permutation',['http://en.cppreference.com/w/cpp/algorithm/is_permutation.html',0,'std']]], + ['is_5fplaceholder_704',['is_placeholder',['http://en.cppreference.com/w/cpp/utility/functional/is_placeholder.html',0,'std']]], + ['is_5fpod_705',['is_pod',['http://en.cppreference.com/w/cpp/types/is_pod.html',0,'std']]], + ['is_5fpointer_706',['is_pointer',['http://en.cppreference.com/w/cpp/types/is_pointer.html',0,'std']]], + ['is_5fpolymorphic_707',['is_polymorphic',['http://en.cppreference.com/w/cpp/types/is_polymorphic.html',0,'std']]], + ['is_5fprime_708',['is_prime',['../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532',1,'check_prime.cpp']]], + ['is_5freference_709',['is_reference',['http://en.cppreference.com/w/cpp/types/is_reference.html',0,'std']]], + ['is_5frvalue_5freference_710',['is_rvalue_reference',['http://en.cppreference.com/w/cpp/types/is_rvalue_reference.html',0,'std']]], + ['is_5fsame_711',['is_same',['http://en.cppreference.com/w/cpp/types/is_same.html',0,'std']]], + ['is_5fscalar_712',['is_scalar',['http://en.cppreference.com/w/cpp/types/is_scalar.html',0,'std']]], + ['is_5fsigned_713',['is_signed',['http://en.cppreference.com/w/cpp/types/is_signed.html',0,'std']]], + ['is_5fsorted_714',['is_sorted',['http://en.cppreference.com/w/cpp/algorithm/is_sorted.html',0,'std']]], + ['is_5fsorted_5funtil_715',['is_sorted_until',['http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html',0,'std']]], + ['is_5fsquare_716',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f',1,'ordinary_least_squares_regressor.cpp']]], + ['is_5fstandard_5flayout_717',['is_standard_layout',['http://en.cppreference.com/w/cpp/types/is_standard_layout.html',0,'std']]], + ['is_5ftrivial_718',['is_trivial',['http://en.cppreference.com/w/cpp/types/is_trivial.html',0,'std']]], + ['is_5ftrivially_5fassignable_719',['is_trivially_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5ftrivially_5fconstructible_720',['is_trivially_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5ftrivially_5fcopy_5fassignable_721',['is_trivially_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5ftrivially_5fcopy_5fconstructible_722',['is_trivially_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5ftrivially_5fcopyable_723',['is_trivially_copyable',['http://en.cppreference.com/w/cpp/types/is_trivially_copyable.html',0,'std']]], + ['is_5ftrivially_5fdefault_5fconstructible_724',['is_trivially_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5ftrivially_5fdestructible_725',['is_trivially_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5ftrivially_5fmove_5fassignable_726',['is_trivially_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5ftrivially_5fmove_5fconstructible_727',['is_trivially_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5funion_728',['is_union',['http://en.cppreference.com/w/cpp/types/is_union.html',0,'std']]], + ['is_5funsigned_729',['is_unsigned',['http://en.cppreference.com/w/cpp/types/is_unsigned.html',0,'std']]], + ['is_5fvoid_730',['is_void',['http://en.cppreference.com/w/cpp/types/is_void.html',0,'std']]], + ['is_5fvolatile_731',['is_volatile',['http://en.cppreference.com/w/cpp/types/is_volatile.html',0,'std']]], + ['isalnum_732',['isalnum',['http://en.cppreference.com/w/cpp/string/byte/isalnum.html',0,'std']]], + ['isalpha_733',['isalpha',['http://en.cppreference.com/w/cpp/string/byte/isalpha.html',0,'std']]], + ['isblank_734',['isblank',['http://en.cppreference.com/w/cpp/string/byte/isblank.html',0,'std']]], + ['iscntrl_735',['iscntrl',['http://en.cppreference.com/w/cpp/string/byte/iscntrl.html',0,'std']]], + ['isctype_736',['isctype',['http://en.cppreference.com/w/cpp/regex/regex_traits/isctype.html',0,'std::regex_traits']]], + ['iscyclicbfs_737',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]], + ['iscyclicdfs_738',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]], + ['iscyclicdfshelper_739',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]], + ['isdigit_740',['isdigit',['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std']]], + ['isemptyqueue_741',['isEmptyQueue',['../d2/d36/structqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31',1,'queue']]], + ['isemptystack_742',['isEmptyStack',['../d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a',1,'stack']]], + ['isfinite_743',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]], + ['isgraph_744',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]], + ['isinf_745',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]], + ['islower_746',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]], + ['isnan_747',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]], + ['isnormal_748',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]], + ['isprime_749',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'IsPrime(int number): primality_test.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd',1,'isPrime(int64_t m): modular_inverse_fermat_little_theorem.cpp'],['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'isprime(): prime_factorization.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22',1,'isprime(): sieve_of_eratosthenes.cpp']]], + ['isprint_750',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]], + ['ispunct_751',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]], + ['isspace_752',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]], + ['istream_753',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std::istream'],['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::istream::istream()']]], + ['istream_5fiterator_754',['istream_iterator',['http://en.cppreference.com/w/cpp/iterator/istream_iterator.html',0,'std']]], + ['istreambuf_5fiterator_755',['istreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/istreambuf_iterator.html',0,'std']]], + ['istringstream_756',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std::istringstream'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::istringstream::istringstream()']]], + ['istrstream_757',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream.html',0,'std::istrstream'],['http://en.cppreference.com/w/cpp/io/istrstream/istrstream.html',0,'std::istrstream::istrstream()']]], + ['isupper_758',['isupper',['http://en.cppreference.com/w/cpp/string/byte/isupper.html',0,'std']]], + ['iswalnum_759',['iswalnum',['http://en.cppreference.com/w/cpp/string/wide/iswalnum.html',0,'std']]], + ['iswalpha_760',['iswalpha',['http://en.cppreference.com/w/cpp/string/wide/iswalpha.html',0,'std']]], + ['iswblank_761',['iswblank',['http://en.cppreference.com/w/cpp/string/wide/iswblank.html',0,'std']]], + ['iswcntrl_762',['iswcntrl',['http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html',0,'std']]], + ['iswctype_763',['iswctype',['http://en.cppreference.com/w/cpp/string/wide/iswctype.html',0,'std']]], + ['iswdigit_764',['iswdigit',['http://en.cppreference.com/w/cpp/string/wide/iswdigit.html',0,'std']]], + ['iswgraph_765',['iswgraph',['http://en.cppreference.com/w/cpp/string/wide/iswgraph.html',0,'std']]], + ['iswlower_766',['iswlower',['http://en.cppreference.com/w/cpp/string/wide/iswlower.html',0,'std']]], + ['iswprint_767',['iswprint',['http://en.cppreference.com/w/cpp/string/wide/iswprint.html',0,'std']]], + ['iswpunct_768',['iswpunct',['http://en.cppreference.com/w/cpp/string/wide/iswpunct.html',0,'std']]], + ['iswspace_769',['iswspace',['http://en.cppreference.com/w/cpp/string/wide/iswspace.html',0,'std']]], + ['iswupper_770',['iswupper',['http://en.cppreference.com/w/cpp/string/wide/iswupper.html',0,'std']]], + ['iswxdigit_771',['iswxdigit',['http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html',0,'std']]], + ['isxdigit_772',['isxdigit',['http://en.cppreference.com/w/cpp/string/byte/isxdigit.html',0,'std']]], + ['it_5fternary_5fsearch_773',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]], + ['item_774',['Item',['../db/d66/struct_item.html',1,'']]], + ['iter_5fswap_775',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]], + ['iter_5ftype_776',['iter_type',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::iter_type']]], + ['iterator_777',['iterator',['http://en.cppreference.com/w/cpp/iterator/iterator.html',0,'std']]], + ['iterator_5ftraits_778',['iterator_traits',['http://en.cppreference.com/w/cpp/iterator/iterator_traits.html',0,'std']]], + ['iword_779',['iword',['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ios::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ios_base::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::strstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wiostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wfstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wstringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ifstream::iword()']]] +]; diff --git a/search/all_a.html b/search/all_a.html new file mode 100644 index 000000000..0ce816b11 --- /dev/null +++ b/search/all_a.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_a.js b/search/all_a.js new file mode 100644 index 000000000..893719d00 --- /dev/null +++ b/search/all_a.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['jmp_5fbuf_780',['jmp_buf',['http://en.cppreference.com/w/cpp/utility/program/jmp_buf.html',0,'std']]], + ['join_781',['join',['http://en.cppreference.com/w/cpp/thread/thread/join.html',0,'std::thread']]], + ['joinable_782',['joinable',['http://en.cppreference.com/w/cpp/thread/thread/joinable.html',0,'std::thread']]], + ['jump_5fsearch_2ecpp_783',['jump_search.cpp',['../d2/d22/jump__search_8cpp.html',1,'']]], + ['jumpsearch_784',['jumpSearch',['../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0',1,'jump_search.cpp']]] +]; diff --git a/search/all_b.html b/search/all_b.html new file mode 100644 index 000000000..28c2413a3 --- /dev/null +++ b/search/all_b.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_b.js b/search/all_b.js new file mode 100644 index 000000000..093bfb477 --- /dev/null +++ b/search/all_b.js @@ -0,0 +1,16 @@ +var searchData= +[ + ['k_785',['k',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::k()'],['../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0',1,'k(): matrix_exponentiation.cpp']]], + ['key_786',['key',['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list']]], + ['key_5fcomp_787',['key_comp',['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]], + ['key_5feq_788',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]], + ['kill_5fdependency_789',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]], + ['kilo_790',['kilo',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['kmp_791',['kmp',['../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93',1,'string_search']]], + ['knuth_5fb_792',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std::knuth_b'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b::knuth_b()']]], + ['knuth_5fmorris_5fpratt_2ecpp_793',['knuth_morris_pratt.cpp',['../de/d6a/knuth__morris__pratt_8cpp.html',1,'']]], + ['kohonen_5fsom_794',['kohonen_som',['../d8/d77/namespacemachine__learning.html#adc731720947b4bc2ab047c141e7d0299',1,'machine_learning']]], + ['kohonen_5fsom_5ftopology_2ecpp_795',['kohonen_som_topology.cpp',['../d4/def/kohonen__som__topology_8cpp.html',1,'']]], + ['kohonen_5fsom_5ftrace_2ecpp_796',['kohonen_som_trace.cpp',['../d9/d49/kohonen__som__trace_8cpp.html',1,'']]], + ['kohonen_5fsom_5ftracer_797',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#acc6a28f40512dbda75ab1a3969248898',1,'machine_learning']]] +]; diff --git a/search/all_c.html b/search/all_c.html new file mode 100644 index 000000000..39fc49b1a --- /dev/null +++ b/search/all_c.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_c.js b/search/all_c.js new file mode 100644 index 000000000..340d9db8c --- /dev/null +++ b/search/all_c.js @@ -0,0 +1,66 @@ +var searchData= +[ + ['labs_798',['labs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['lambda_799',['lambda',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/lambda.html',0,'std::exponential_distribution']]], + ['large_5ffactorial_2ecpp_800',['large_factorial.cpp',['../d6/d9d/large__factorial_8cpp.html',1,'']]], + ['large_5fnumber_801',['large_number',['../db/d82/classlarge__number.html',1,'large_number'],['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &a)'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector< unsigned char > &vec)']]], + ['large_5fnumber_2eh_802',['large_number.h',['../d4/d86/large__number_8h.html',1,'']]], + ['lca_803',['lca',['../dd/df4/structlca.html',1,'']]], + ['lcm_804',['lcm',['../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25',1,'least_common_multiple.cpp']]], + ['lconv_805',['lconv',['http://en.cppreference.com/w/cpp/locale/lconv.html',0,'std']]], + ['ldexp_806',['ldexp',['http://en.cppreference.com/w/cpp/numeric/math/ldexp.html',0,'std']]], + ['ldiv_807',['ldiv',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], + ['least_5fcommon_5fmultiple_2ecpp_808',['least_common_multiple.cpp',['../d4/d21/least__common__multiple_8cpp.html',1,'']]], + ['left_809',['left',['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap::left()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::left()']]], + ['leftrotate_810',['leftRotate',['../d8/dee/avltree_8cpp.html#aed58f3cea338a9d7bdcb9a4cfc6c7a78',1,'avltree.cpp']]], + ['lenghtline_811',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]], + ['length_812',['length',['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::match_results::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::length()'],['http://en.cppreference.com/w/cpp/string/char_traits/length.html',0,'std::char_traits::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wsmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wcsub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::smatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wcmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/length.html',0,'std::regex_traits::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::csub_match::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::ssub_match::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::cmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::sub_match::length()']]], + ['length_5ferror_813',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error'],['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error::length_error()']]], + ['less_814',['less',['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std']]], + ['less_5fequal_815',['less_equal',['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std']]], + ['levelorder_816',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]], + ['lexicographical_5fcompare_817',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]], + ['lgamma_818',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]], + ['lims_819',['LIMS',['../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.cpp']]], + ['line_5fsegment_5fintersection_2ecpp_820',['line_segment_intersection.cpp',['../d8/d6c/line__segment__intersection_8cpp.html',1,'']]], + ['linear_5fcongruential_5fengine_821',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::linear_congruential_engine'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::linear_congruential_engine::linear_congruential_engine()']]], + ['linear_5fsearch_2ecpp_822',['linear_search.cpp',['../d9/d02/linear__search_8cpp.html',1,'']]], + ['linearsearch_823',['LinearSearch',['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'linear_search.cpp']]], + ['link_824',['link',['../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6',1,'hash_search.cpp']]], + ['linkedlist_825',['linkedlist',['../d0/dff/structlinkedlist.html',1,'']]], + ['linkedlist_5fimplentation_5fusingarray_2ecpp_826',['linkedlist_implentation_usingarray.cpp',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html',1,'']]], + ['list_827',['list',['../d8/d10/structlist.html',1,'list'],['http://en.cppreference.com/w/cpp/container/list.html',0,'std::list< T >'],['http://en.cppreference.com/w/cpp/container/list/list.html',0,'std::list::list()']]], + ['list_3c_20int_20_3e_828',['list< int >',['../d8/d10/structlist.html',1,'']]], + ['ll_829',['ll',['../d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba',1,'matrix_exponentiation.cpp']]], + ['llabs_830',['llabs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['llrint_831',['llrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['llround_832',['llround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['load_833',['load',['http://en.cppreference.com/w/cpp/atomic/atomic/load.html',0,'std::atomic']]], + ['load_5ffactor_834',['load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/load_factor.html',0,'std::unordered_map::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/load_factor.html',0,'std::unordered_multimap::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/load_factor.html',0,'std::unordered_multiset::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/load_factor.html',0,'std::unordered_set::load_factor()']]], + ['locale_835',['locale',['http://en.cppreference.com/w/cpp/locale/locale.html',0,'std::locale'],['http://en.cppreference.com/w/cpp/locale/locale/locale.html',0,'std::locale::locale()']]], + ['localeconv_836',['localeconv',['http://en.cppreference.com/w/cpp/locale/localeconv.html',0,'std']]], + ['localtime_837',['localtime',['http://en.cppreference.com/w/cpp/chrono/c/localtime.html',0,'std']]], + ['lock_838',['lock',['http://en.cppreference.com/w/cpp/memory/weak_ptr/lock.html',0,'std::weak_ptr::lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/lock.html',0,'std::unique_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/lock.html',0,'std::recursive_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/lock.html',0,'std::recursive_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/lock.html',0,'std::shared_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/lock.html',0,'std::timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/lock.html',0,'std::mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock.html',0,'std::shared_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/lock.html',0,'std::lock()']]], + ['lock_5fguard_839',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard.html',0,'std::lock_guard< T >'],['http://en.cppreference.com/w/cpp/thread/lock_guard/lock_guard.html',0,'std::lock_guard::lock_guard()']]], + ['lock_5fshared_840',['lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock_shared.html',0,'std::shared_timed_mutex']]], + ['log_841',['log',['http://en.cppreference.com/w/cpp/numeric/math/log.html',0,'std']]], + ['log10_842',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]], + ['log1p_843',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]], + ['logb_844',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]], + ['logic_5ferror_845',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error'],['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error::logic_error()']]], + ['logical_5fand_846',['logical_and',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std']]], + ['logical_5fnot_847',['logical_not',['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std']]], + ['logical_5for_848',['logical_or',['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std']]], + ['lognormal_5fdistribution_849',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution.html',0,'std::lognormal_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/lognormal_distribution.html',0,'std::lognormal_distribution::lognormal_distribution()']]], + ['longjmp_850',['longjmp',['http://en.cppreference.com/w/cpp/utility/program/longjmp.html',0,'std']]], + ['lookup_5fclassname_851',['lookup_classname',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_classname.html',0,'std::regex_traits']]], + ['lookup_5fcollatename_852',['lookup_collatename',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_collatename.html',0,'std::regex_traits']]], + ['lower_5fbound_853',['lower_bound',['http://en.cppreference.com/w/cpp/container/multiset/lower_bound.html',0,'std::multiset::lower_bound()'],['http://en.cppreference.com/w/cpp/container/set/lower_bound.html',0,'std::set::lower_bound()'],['http://en.cppreference.com/w/cpp/container/map/lower_bound.html',0,'std::map::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/lower_bound.html',0,'std::multimap::lower_bound()'],['http://en.cppreference.com/w/cpp/algorithm/lower_bound.html',0,'std::lower_bound()']]], + ['lowest_854',['lowest',['http://en.cppreference.com/w/cpp/types/numeric_limits/lowest.html',0,'std::numeric_limits']]], + ['lrint_855',['lrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['lround_856',['lround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['lt_857',['lt',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits']]], + ['lu_5fdecompose_2ecpp_858',['lu_decompose.cpp',['../dd/d65/lu__decompose_8cpp.html',1,'']]], + ['lu_5fdecomposition_859',['lu_decomposition',['../dd/d65/lu__decompose_8cpp.html#af703fd0afe349e567d7a82350e03cace',1,'lu_decompose.cpp']]], + ['list_20of_20all_20files_860',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]] +]; diff --git a/search/all_d.html b/search/all_d.html new file mode 100644 index 000000000..cc470e5d9 --- /dev/null +++ b/search/all_d.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_d.js b/search/all_d.js new file mode 100644 index 000000000..9be83cee4 --- /dev/null +++ b/search/all_d.js @@ -0,0 +1,101 @@ +var searchData= +[ + ['m_861',['m',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]], + ['machine_5flearning_862',['machine_learning',['../d8/d77/namespacemachine__learning.html',1,'machine_learning'],['../d9/d66/group__machine__learning.html',1,'(Global Namespace)']]], + ['main_863',['main',['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d4/de8/fast__interger__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_interger_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../df/dd5/binary__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): binary_search.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knuth_morris_pratt.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp']]], + ['make_5fexception_5fptr_864',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]], + ['make_5fheap_865',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]], + ['make_5fmove_5fiterator_866',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]], + ['make_5foptional_867',['make_optional',['http://en.cppreference.com/w/cpp/experimental/optional/make_optional.html',0,'std::experimental']]], + ['make_5fpair_868',['make_pair',['http://en.cppreference.com/w/cpp/utility/pair/make_pair.html',0,'std']]], + ['make_5fready_5fat_5fthread_5fexit_869',['make_ready_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/packaged_task/make_ready_at_thread_exit.html',0,'std::packaged_task']]], + ['make_5fshared_870',['make_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html',0,'std']]], + ['make_5fsigned_871',['make_signed',['http://en.cppreference.com/w/cpp/types/make_signed.html',0,'std']]], + ['make_5ftuple_872',['make_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html',0,'std']]], + ['make_5funsigned_873',['make_unsigned',['http://en.cppreference.com/w/cpp/types/make_unsigned.html',0,'std']]], + ['malloc_874',['malloc',['http://en.cppreference.com/w/cpp/memory/c/malloc.html',0,'std']]], + ['map_875',['map',['http://en.cppreference.com/w/cpp/container/map.html',0,'std::map< K, T >'],['http://en.cppreference.com/w/cpp/container/map/map.html',0,'std::map::map()']]], + ['mark_5fcount_876',['mark_count',['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::basic_regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::wregex::mark_count()']]], + ['mask_877',['mask',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_base::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_byname::mask']]], + ['mat_5fmul_878',['mat_mul',['../de/d75/qr__eigen__values_8cpp.html#a7558fd7779bf207157ced66f275951a0',1,'qr_eigen_values.cpp']]], + ['match_5fresults_879',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std::match_results'],['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::match_results::match_results()']]], + ['matrix_5fexponentiation_2ecpp_880',['matrix_exponentiation.cpp',['../d7/d35/matrix__exponentiation_8cpp.html',1,'']]], + ['max_881',['max',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/max.html',0,'std::student_t_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937_64::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux24_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/max.html',0,'std::extreme_value_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/max.html',0,'std::lognormal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/max.html',0,'std::discrete_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux48::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/max.html',0,'std::piecewise_constant_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/max.html',0,'std::poisson_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/max.html',0,'std::bernoulli_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::discard_block_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/max.html',0,'std::exponential_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/max.html',0,'std::uniform_real_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/max.html',0,'std::geometric_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mersenne_twister_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/max.html',0,'std::independent_bits_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/max.html',0,'std::normal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand::max()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/max.html',0,'std::weibull_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux48_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/max.html',0,'std::negative_binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937::max()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/max.html',0,'std::chi_squared_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/max.html',0,'std::piecewise_linear_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::shuffle_order_engine::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::minutes::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::seconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::duration::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::milliseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::hours::max()'],['http://en.cppreference.com/w/cpp/chrono/time_point/max.html',0,'std::chrono::time_point::max()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/max.html',0,'std::chrono::duration_values::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::microseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::nanoseconds::max()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/max.html',0,'std::numeric_limits::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/max.html',0,'std::uniform_int_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/max.html',0,'std::fisher_f_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux24::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::linear_congruential_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::knuth_b::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand0::max()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/max.html',0,'std::gamma_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/max.html',0,'std::binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/max.html',0,'std::cauchy_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::subtract_with_carry_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/max.html',0,'std::random_device::max()'],['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): power_for_huge_numbers.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): sieve_of_eratosthenes.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): ternary_search.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#a692ac7187ee88621a9f78fca78ec498d',1,'MAX(): fibonacci_fast.cpp'],['http://en.cppreference.com/w/cpp/algorithm/max.html',0,'std::max()']]], + ['max_5falign_5ft_882',['max_align_t',['http://en.cppreference.com/w/cpp/types/max_align_t.html',0,'std']]], + ['max_5fbucket_5fcount_883',['max_bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/max_bucket_count.html',0,'std::unordered_map::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_bucket_count.html',0,'std::unordered_multimap::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_bucket_count.html',0,'std::unordered_multiset::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_bucket_count.html',0,'std::unordered_set::max_bucket_count()']]], + ['max_5felement_884',['max_element',['http://en.cppreference.com/w/cpp/algorithm/max_element.html',0,'std']]], + ['max_5fiterations_885',['MAX_ITERATIONS',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS(): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS(): false_position.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS(): newton_raphson_method.cpp']]], + ['max_5flength_886',['max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::max_length()']]], + ['max_5fload_5ffactor_887',['max_load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/max_load_factor.html',0,'std::unordered_map::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_load_factor.html',0,'std::unordered_multimap::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_load_factor.html',0,'std::unordered_multiset::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_load_factor.html',0,'std::unordered_set::max_load_factor()']]], + ['max_5fnum_888',['MAX_NUM',['../d9/d69/median__search_8cpp.html#a55bfdcfe7613d75fb48ec99c7bf4dd5e',1,'median_search.cpp']]], + ['max_5fsize_889',['max_size',['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()']]], + ['mblen_890',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]], + ['mbrlen_891',['mbrlen',['http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html',0,'std']]], + ['mbrtoc16_892',['mbrtoc16',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html',0,'std']]], + ['mbrtoc32_893',['mbrtoc32',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html',0,'std']]], + ['mbrtowc_894',['mbrtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html',0,'std']]], + ['mbsinit_895',['mbsinit',['http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html',0,'std']]], + ['mbsrtowcs_896',['mbsrtowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html',0,'std']]], + ['mbstate_5ft_897',['mbstate_t',['http://en.cppreference.com/w/cpp/string/multibyte/mbstate_t.html',0,'std']]], + ['mbstowcs_898',['mbstowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html',0,'std']]], + ['mbtowc_899',['mbtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html',0,'std']]], + ['mean_900',['mean',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/mean.html',0,'std::poisson_distribution::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution::mean()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]], + ['median_5fsearch_2ecpp_901',['median_search.cpp',['../d9/d69/median__search_8cpp.html',1,'']]], + ['mega_902',['mega',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['mem_5ffn_903',['mem_fn',['http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html',0,'std']]], + ['memchr_904',['memchr',['http://en.cppreference.com/w/cpp/string/byte/memchr.html',0,'std']]], + ['memcmp_905',['memcmp',['http://en.cppreference.com/w/cpp/string/byte/memcmp.html',0,'std']]], + ['memcpy_906',['memcpy',['http://en.cppreference.com/w/cpp/string/byte/memcpy.html',0,'std']]], + ['memmove_907',['memmove',['http://en.cppreference.com/w/cpp/string/byte/memmove.html',0,'std']]], + ['memset_908',['memset',['http://en.cppreference.com/w/cpp/string/byte/memset.html',0,'std']]], + ['merge_909',['merge',['http://en.cppreference.com/w/cpp/container/forward_list/merge.html',0,'std::forward_list::merge()'],['http://en.cppreference.com/w/cpp/container/list/merge.html',0,'std::list::merge()'],['http://en.cppreference.com/w/cpp/algorithm/merge.html',0,'std::merge()'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()']]], + ['mersenne_5ftwister_5fengine_910',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mersenne_twister_engine'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mersenne_twister_engine::mersenne_twister_engine()']]], + ['message_911',['message',['http://en.cppreference.com/w/cpp/error/error_code/message.html',0,'std::error_code::message()'],['http://en.cppreference.com/w/cpp/error/error_category/message.html',0,'std::error_category::message()'],['http://en.cppreference.com/w/cpp/error/error_condition/message.html',0,'std::error_condition::message()']]], + ['messages_912',['messages',['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages'],['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages::messages()']]], + ['messages_5fbase_913',['messages_base',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std']]], + ['messages_5fbyname_914',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname'],['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname::messages_byname()']]], + ['method1_915',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]], + ['method2_916',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]], + ['micro_917',['micro',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['microseconds_918',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::microseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::microseconds::microseconds()']]], + ['midpoint_5feuler_919',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]], + ['midpoint_5feuler_5fstep_920',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]], + ['milli_921',['milli',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['milliseconds_922',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::milliseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::milliseconds::milliseconds()']]], + ['min_923',['min',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/min.html',0,'std::student_t_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937_64::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux24_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/min.html',0,'std::extreme_value_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/min.html',0,'std::lognormal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/min.html',0,'std::discrete_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux48::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/min.html',0,'std::piecewise_constant_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/min.html',0,'std::poisson_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/min.html',0,'std::bernoulli_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::discard_block_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/min.html',0,'std::exponential_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/min.html',0,'std::uniform_real_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/min.html',0,'std::geometric_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mersenne_twister_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/min.html',0,'std::independent_bits_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/min.html',0,'std::normal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand::min()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/min.html',0,'std::weibull_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux48_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/min.html',0,'std::negative_binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937::min()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/min.html',0,'std::chi_squared_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/min.html',0,'std::piecewise_linear_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::shuffle_order_engine::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::minutes::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::seconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::duration::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::milliseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::hours::min()'],['http://en.cppreference.com/w/cpp/chrono/time_point/min.html',0,'std::chrono::time_point::min()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/min.html',0,'std::chrono::duration_values::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::microseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::nanoseconds::min()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/min.html',0,'std::numeric_limits::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/min.html',0,'std::uniform_int_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/min.html',0,'std::fisher_f_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux24::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::linear_congruential_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::knuth_b::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand0::min()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/min.html',0,'std::gamma_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/min.html',0,'std::binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/min.html',0,'std::cauchy_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::subtract_with_carry_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/min.html',0,'std::random_device::min()'],['http://en.cppreference.com/w/cpp/algorithm/min.html',0,'std::min()']]], + ['min_5fdistance_924',['MIN_DISTANCE',['../d4/def/kohonen__som__topology_8cpp.html#a549d41dcf9444ed7d6df1da3c73e7d16',1,'kohonen_som_topology.cpp']]], + ['min_5felement_925',['min_element',['http://en.cppreference.com/w/cpp/algorithm/min_element.html',0,'std']]], + ['minheap_926',['MinHeap',['../d2/d05/class_min_heap.html',1,'MinHeap'],['../d2/d05/class_min_heap.html#ad89ca80a217655a735d266618197965e',1,'MinHeap::MinHeap()']]], + ['minheapify_927',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]], + ['minheapnode_928',['MinHeapNode',['../d5/d29/struct_min_heap_node.html',1,'']]], + ['minmax_929',['minmax',['http://en.cppreference.com/w/cpp/algorithm/minmax.html',0,'std']]], + ['minmax_5felement_930',['minmax_element',['http://en.cppreference.com/w/cpp/algorithm/minmax_element.html',0,'std']]], + ['minstd_5frand_931',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::minstd_rand'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand::minstd_rand()']]], + ['minstd_5frand0_932',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std::minstd_rand0'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand0::minstd_rand0()']]], + ['minus_933',['minus',['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std']]], + ['minutes_934',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::minutes'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::minutes::minutes()']]], + ['minvalue_935',['minValue',['../d8/dee/avltree_8cpp.html#adb8e952bf1c266bae84111b9d6a12015',1,'avltree.cpp']]], + ['mismatch_936',['mismatch',['http://en.cppreference.com/w/cpp/algorithm/mismatch.html',0,'std']]], + ['mktime_937',['mktime',['http://en.cppreference.com/w/cpp/chrono/c/mktime.html',0,'std']]], + ['modf_938',['modf',['http://en.cppreference.com/w/cpp/numeric/math/modf.html',0,'std']]], + ['modular_5finverse_5ffermat_5flittle_5ftheorem_2ecpp_939',['modular_inverse_fermat_little_theorem.cpp',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html',1,'']]], + ['modulus_940',['modulus',['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std']]], + ['money_5fbase_941',['money_base',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std']]], + ['money_5fget_942',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get'],['http://en.cppreference.com/w/cpp/locale/money_get/money_get.html',0,'std::money_get::money_get()']]], + ['money_5fput_943',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put'],['http://en.cppreference.com/w/cpp/locale/money_put/money_put.html',0,'std::money_put::money_put()']]], + ['moneypunct_944',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct'],['http://en.cppreference.com/w/cpp/locale/moneypunct/moneypunct.html',0,'std::moneypunct::moneypunct()']]], + ['moneypunct_5fbyname_945',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname'],['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname::moneypunct_byname()']]], + ['mov_946',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]], + ['move_947',['move',['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::fstream::move()'],['http://en.cppreference.com/w/cpp/string/char_traits/move.html',0,'std::char_traits::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ios::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::strstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wiostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wfstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wstringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ifstream::move()'],['http://en.cppreference.com/w/cpp/utility/move.html',0,'std::move()']]], + ['move_5fbackward_948',['move_backward',['http://en.cppreference.com/w/cpp/algorithm/move_backward.html',0,'std']]], + ['move_5fif_5fnoexcept_949',['move_if_noexcept',['http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html',0,'std']]], + ['move_5fiterator_950',['move_iterator',['http://en.cppreference.com/w/cpp/iterator/move_iterator.html',0,'std']]], + ['mst_951',['mst',['../d1/d77/structmst.html',1,'']]], + ['mt19937_952',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mt19937'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937::mt19937()']]], + ['mt19937_5f64_953',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std::mt19937_64'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937_64::mt19937_64()']]], + ['multimap_954',['multimap',['http://en.cppreference.com/w/cpp/container/multimap.html',0,'std::multimap< K, T >'],['http://en.cppreference.com/w/cpp/container/multimap/multimap.html',0,'std::multimap::multimap()']]], + ['multiplies_955',['multiplies',['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std']]], + ['multiply_956',['multiply',['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ac62a499b83c7895dd0aa69da1b64c904',1,'multiply(const vector< vector< ll >> &A, const vector< vector< ll >> &B): matrix_exponentiation.cpp']]], + ['multiset_957',['multiset',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std::multiset< K >'],['http://en.cppreference.com/w/cpp/container/multiset/multiset.html',0,'std::multiset::multiset()']]], + ['mutex_958',['mutex',['http://en.cppreference.com/w/cpp/thread/mutex.html',0,'std::mutex'],['http://en.cppreference.com/w/cpp/thread/unique_lock/mutex.html',0,'std::unique_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/mutex.html',0,'std::shared_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/mutex/mutex.html',0,'std::mutex::mutex()']]] +]; diff --git a/search/all_e.html b/search/all_e.html new file mode 100644 index 000000000..57cce7600 --- /dev/null +++ b/search/all_e.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_e.js b/search/all_e.js new file mode 100644 index 000000000..c62e6738d --- /dev/null +++ b/search/all_e.js @@ -0,0 +1,60 @@ +var searchData= +[ + ['n_959',['n',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/n.html',0,'std::student_t_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/n.html',0,'std::chi_squared_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::n()']]], + ['name_960',['name',['http://en.cppreference.com/w/cpp/locale/locale/name.html',0,'std::locale::name()'],['http://en.cppreference.com/w/cpp/error/error_category/name.html',0,'std::error_category::name()'],['http://en.cppreference.com/w/cpp/types/type_info/name.html',0,'std::type_info::name()'],['http://en.cppreference.com/w/cpp/types/type_index/name.html',0,'std::type_index::name()']]], + ['nan_961',['nan',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nanf_962',['nanf',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nanl_963',['nanl',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nano_964',['nano',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['nanoseconds_965',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono::nanoseconds'],['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::nanoseconds::nanoseconds()']]], + ['narrow_966',['narrow',['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ofstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ios::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::strstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wiostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istringstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wfstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wstringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ifstream::narrow()']]], + ['native_5fhandle_967',['native_handle',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/native_handle.html',0,'std::condition_variable_any::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/native_handle.html',0,'std::condition_variable::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/native_handle.html',0,'std::recursive_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/native_handle.html',0,'std::recursive_timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/thread/native_handle.html',0,'std::thread::native_handle()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/native_handle.html',0,'std::timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/mutex/native_handle.html',0,'std::mutex::native_handle()']]], + ['ncr_968',['nCr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'binomial_dist.cpp']]], + ['nearbyint_969',['nearbyint',['http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html',0,'std']]], + ['neg_5fformat_970',['neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::neg_format()']]], + ['negate_971',['negate',['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std']]], + ['negative_5fbinomial_5fdistribution_972',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution.html',0,'std::negative_binomial_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/negative_binomial_distribution.html',0,'std::negative_binomial_distribution::negative_binomial_distribution()']]], + ['negative_5fsign_973',['negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::negative_sign()']]], + ['nested_5fexception_974',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception.html',0,'std::nested_exception'],['http://en.cppreference.com/w/cpp/error/nested_exception/nested_exception.html',0,'std::nested_exception::nested_exception()']]], + ['nested_5fptr_975',['nested_ptr',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_ptr.html',0,'std::nested_exception']]], + ['new_5fhandler_976',['new_handler',['http://en.cppreference.com/w/cpp/memory/new/new_handler.html',0,'std']]], + ['new_5fval_977',['new_val',['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()'],['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()']]], + ['newton_5fraphson_5fmethod_2ecpp_978',['newton_raphson_method.cpp',['../de/dd3/newton__raphson__method_8cpp.html',1,'']]], + ['next_979',['next',['../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f',1,'list::next()'],['http://en.cppreference.com/w/cpp/iterator/next.html',0,'std::next()']]], + ['next_5fpermutation_980',['next_permutation',['http://en.cppreference.com/w/cpp/algorithm/next_permutation.html',0,'std']]], + ['nextafter_981',['nextafter',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], + ['nexttoward_982',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], + ['noboolalpha_983',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], + ['node_984',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node< Kind >'],['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'node(): hash_search.cpp']]], + ['node_3c_20type_20_3e_985',['node< Type >',['../d5/da1/structnode.html',1,'']]], + ['non_5frecursive_5fmerge_5fsort_986',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]], + ['non_5frecursive_5fmerge_5fsort_2ecpp_987',['non_recursive_merge_sort.cpp',['../d0/db6/non__recursive__merge__sort_8cpp.html',1,'']]], + ['none_988',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['none_5fof_989',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['normal_5fdistribution_990',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std::normal_distribution'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/normal_distribution.html',0,'std::normal_distribution::normal_distribution()']]], + ['noshowbase_991',['noshowbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], + ['noshowpoint_992',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], + ['noshowpos_993',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], + ['noskipws_994',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], + ['not1_995',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]], + ['not2_996',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]], + ['not_5feof_997',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]], + ['not_5fequal_5fto_998',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]], + ['nothrow_5ft_999',['nothrow_t',['http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html',0,'std']]], + ['notify_5fall_1000',['notify_all',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_all.html',0,'std::condition_variable_any::notify_all()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_all.html',0,'std::condition_variable::notify_all()']]], + ['notify_5fall_5fat_5fthread_5fexit_1001',['notify_all_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html',0,'std']]], + ['notify_5fone_1002',['notify_one',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_one.html',0,'std::condition_variable_any::notify_one()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html',0,'std::condition_variable::notify_one()']]], + ['nounitbuf_1003',['nounitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['nouppercase_1004',['nouppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['now_1005',['now',['http://en.cppreference.com/w/cpp/chrono/steady_clock/now.html',0,'std::chrono::steady_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/system_clock/now.html',0,'std::chrono::system_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html',0,'std::chrono::high_resolution_clock::now()']]], + ['nth_5felement_1006',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]], + ['nullptr_5ft_1007',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]], + ['num_5fdigits_1008',['num_digits',['../db/d82/classlarge__number.html#a2305a82e7b372617419337b2d2119c7d',1,'large_number']]], + ['num_5fget_1009',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get'],['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get::num_get()']]], + ['num_5fput_1010',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put'],['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put::num_put()']]], + ['number_5fof_5fpositive_5fdivisors_1011',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]], + ['number_5fof_5fpositive_5fdivisors_2ecpp_1012',['number_of_positive_divisors.cpp',['../d0/da2/number__of__positive__divisors_8cpp.html',1,'']]], + ['numeric_5flimits_1013',['numeric_limits',['http://en.cppreference.com/w/cpp/types/numeric_limits.html',0,'std']]], + ['numpunct_1014',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct'],['http://en.cppreference.com/w/cpp/locale/numpunct/numpunct.html',0,'std::numpunct::numpunct()']]], + ['numpunct_5fbyname_1015',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname'],['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname::numpunct_byname()']]] +]; diff --git a/search/all_f.html b/search/all_f.html new file mode 100644 index 000000000..ac1e704fb --- /dev/null +++ b/search/all_f.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/all_f.js b/search/all_f.js new file mode 100644 index 000000000..7eab5eb97 --- /dev/null +++ b/search/all_f.js @@ -0,0 +1,66 @@ +var searchData= +[ + ['oct_1016',['oct',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], + ['ordinary_20differential_20equations_1017',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]], + ['ode_5fforward_5feuler_2ecpp_1018',['ode_forward_euler.cpp',['../db/dd3/ode__forward__euler_8cpp.html',1,'']]], + ['ode_5fmidpoint_5feuler_2ecpp_1019',['ode_midpoint_euler.cpp',['../d6/dd3/ode__midpoint__euler_8cpp.html',1,'']]], + ['ode_5fsemi_5fimplicit_5feuler_2ecpp_1020',['ode_semi_implicit_euler.cpp',['../d3/d06/ode__semi__implicit__euler_8cpp.html',1,'']]], + ['ofstream_1021',['ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std::ofstream'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::ofstream::ofstream()']]], + ['on_5fsegment_1022',['on_segment',['../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf',1,'SegmentIntersection']]], + ['once_5fflag_1023',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag'],['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag::once_flag()']]], + ['open_1024',['open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::basic_ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::basic_filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::basic_fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::wfilebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::wifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::basic_ifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::wfstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::wofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::ifstream::open()']]], + ['opening_1025',['opening',['../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21',1,'paranthesis_matching.cpp']]], + ['operator_20auto_5fptr_3c_20y_20_3e_1026',['operator auto_ptr< Y >',['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator_auto_ptr.html',0,'std::auto_ptr']]], + ['operator_20bool_1027',['operator bool',['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator_bool.html',0,'std::unique_lock::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ios::operator bool()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator_bool.html',0,'std::shared_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator_bool.html',0,'std::unique_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator_bool.html',0,'std::shared_lock::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_code/operator_bool.html',0,'std::error_code::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::strstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator_bool.html',0,'std::function::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator_bool.html',0,'std::error_condition::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wiostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator_bool.html',0,'std::experimental::optional::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wfstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wstringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::operator bool()']]], + ['operator_20string_5ftype_1028',['operator string_type',['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::operator string_type()']]], + ['operator_20t_1029',['operator T',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_T.html',0,'std::atomic']]], + ['operator_20t_26_1030',['operator T&',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper']]], + ['operator_21_1031',['operator!',['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ios::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::strstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wiostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wfstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wstringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ifstream::operator!()']]], + ['operator_21_3d_1032',['operator!=',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator!=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator!=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator!=()'],['../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94',1,'large_number::operator!=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator!=()']]], + ['operator_25_3d_1033',['operator%=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator%=()']]], + ['operator_26_3d_1034',['operator&=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator&=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator&=()']]], + ['operator_28_29_1035',['operator()',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std::logical_and::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std::modulus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/operator().html',0,'std::student_t_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937_64::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux24_base::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/operator().html',0,'std::extreme_value_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/operator().html',0,'std::lognormal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std::greater_equal::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/operator().html',0,'std::discrete_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux48::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/operator().html',0,'std::piecewise_constant_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std::less_equal::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std::logical_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::discard_block_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/operator().html',0,'std::exponential_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mersenne_twister_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std::negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std::not_equal_to::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/operator().html',0,'std::independent_bits_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/operator().html',0,'std::normal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand::operator()()'],['http://en.cppreference.com/w/cpp/locale/locale/operator().html',0,'std::locale::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std::equal_to::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std::divides::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/operator().html',0,'std::weibull_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std::less::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std::multiplies::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator().html',0,'std::reference_wrapper::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux48_base::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std::bit_not::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/operator().html',0,'std::chi_squared_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/operator().html',0,'std::piecewise_linear_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/hash/operator().html',0,'std::hash::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::shuffle_order_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std::greater::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std::bit_and::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/operator().html',0,'std::uniform_int_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/operator().html',0,'std::fisher_f_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux24::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std::plus::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std::bit_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator().html',0,'std::function::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std::minus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::linear_congruential_engine::operator()()'],['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std::owner_less::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::knuth_b::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand0::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std::logical_not::operator()()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/operator().html',0,'std::gamma_distribution::operator()()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator().html',0,'std::packaged_task::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/operator().html',0,'std::cauchy_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::subtract_with_carry_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/operator().html',0,'std::random_device::operator()()']]], + ['operator_2a_1036',['operator*',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator*.html',0,'std::raw_storage_iterator::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab6171f4db68a5e50ae0f3500a63acd26',1,'operator*(std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a64d9dd5c5816d6d907b00e5f4b0372a5',1,'operator*(std::vector< std::vector< T >> const &A, std::vector< T > const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a9b2b5da35a6ba8ae203c33739ef0b91d',1,'operator*(float const scalar, std::vector< T > const &A): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aecef32c2a4f39a3f7398949256d180a6',1,'operator*(std::vector< T > const &A, float const scalar): ordinary_least_squares_regressor.cpp']]], + ['operator_2a_3d_1037',['operator*=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator*=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator*=()'],['../db/d82/classlarge__number.html#ab1af3e0f425cdf7ea2039c9dcfe22f0b',1,'large_number::operator*=()']]], + ['operator_2b_1038',['operator+',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator+()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator+()'],['../db/d82/classlarge__number.html#a70d23d67535e67030db570e56c00e16d',1,'large_number::operator+()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0',1,'operator+(): ordinary_least_squares_regressor.cpp']]], + ['operator_2b_2b_1039',['operator++',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator_arith.html',0,'std::raw_storage_iterator::operator++()'],['../db/d82/classlarge__number.html#a622d84883180ff42f04955909adea5a9',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706',1,'large_number::operator++(int)']]], + ['operator_2b_2b_28int_29_1040',['operator++(int)',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++(int)()']]], + ['operator_2b_3d_1041',['operator+=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator+=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator+=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator+=()'],['../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e',1,'large_number::operator+=()']]], + ['operator_2d_1042',['operator-',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator-()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a31be3fe36e76b87d5616ff8e7918cd24',1,'operator-(): ordinary_least_squares_regressor.cpp']]], + ['operator_2d_2d_1043',['operator--',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--()']]], + ['operator_2d_2d_28int_29_1044',['operator--(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--(int)()']]], + ['operator_2d_3d_1045',['operator-=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator-=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator-=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator-=()']]], + ['operator_2d_3e_1046',['operator->',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator->()']]], + ['operator_2f_1047',['operator/',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a30acf52af3184bc22274234ef5a73536',1,'ordinary_least_squares_regressor.cpp']]], + ['operator_2f_3d_1048',['operator/=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator/=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator/=()']]], + ['operator_3c_1049',['operator<',['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<()']]], + ['operator_3c_3c_1050',['operator<<',['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::strstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_ltlt.html',0,'std::thread::id::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wiostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostrstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wfstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wstringstream::operator<<()'],['../d6/d30/classmachine__learning_1_1adaline.html#a1d821a24e1503d468c95d4acedca58b3',1,'machine_learning::adaline::operator<<()'],['../db/d82/classlarge__number.html#a778428c4761b6ea5e7770743f0eab5ab',1,'large_number::operator<<()'],['../dd/d65/lu__decompose_8cpp.html#a98eb5807f21b783c341cab402ced6732',1,'operator<<(std::ostream &out, std::vector< std::vector< T >> const &v): lu_decompose.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98eb5807f21b783c341cab402ced6732',1,'operator<<(std::ostream &out, std::vector< std::vector< T >> const &v): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aa799b4cec1681219887d89d037cfab50',1,'operator<<(std::ostream &out, std::vector< T > const &v): ordinary_least_squares_regressor.cpp'],['../d2/d3b/namespaceqr__algorithm.html#a7c63c78d6839b8ad73b77c161210b514',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< std::valarray< T >> const &v)'],['../d2/d3b/namespaceqr__algorithm.html#a240edf2b6b5942c0e5f2c9d3e326797f',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< T > const &v)']]], + ['operator_3c_3c_3d_1051',['operator<<=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset']]], + ['operator_3c_3d_1052',['operator<=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator<=()']]], + ['operator_3d_1053',['operator=',['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::basic_ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::fstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::regex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/container/vector/operator=.html',0,'std::vector::operator=()'],['http://en.cppreference.com/w/cpp/container/multiset/operator=.html',0,'std::multiset::operator=()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/operator=.html',0,'std::weak_ptr::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::string::operator=()'],['http://en.cppreference.com/w/cpp/container/set/operator=.html',0,'std::set::operator=()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator=.html',0,'std::unique_lock::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::basic_ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::regex::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator=.html',0,'std::unordered_map::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::basic_regex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::basic_filebuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::wstringbuf::operator=()'],['http://en.cppreference.com/w/cpp/utility/tuple/operator=.html',0,'std::tuple::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::sregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator=.html',0,'std::shared_ptr::operator=()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::basic_fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wcregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::wregex::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::cregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::wfilebuf::operator=()'],['http://en.cppreference.com/w/cpp/container/stack/operator=.html',0,'std::stack::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_future/operator=.html',0,'std::shared_future::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::wstreambuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::stringstream::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/operator=.html',0,'std::unordered_multimap::operator=()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator=.html',0,'std::unique_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/forward_list/operator=.html',0,'std::forward_list::operator=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator=.html',0,'std::locale::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator=.html',0,'std::shared_lock::operator=()'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/operator=.html',0,'std::enable_shared_from_this::operator=()'],['http://en.cppreference.com/w/cpp/thread/future/operator=.html',0,'std::future::operator=()'],['http://en.cppreference.com/w/cpp/utility/pair/operator=.html',0,'std::pair::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wsregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/error/error_code/operator=.html',0,'std::error_code::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::wifstream::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator=.html',0,'std::reference_wrapper::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::minutes::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::seconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::duration::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::milliseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::hours::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::microseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::nanoseconds::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::basic_stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/container/deque/operator=.html',0,'std::deque::operator=()'],['http://en.cppreference.com/w/cpp/thread/promise/operator=.html',0,'std::promise::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::basic_streambuf::operator=()'],['http://en.cppreference.com/w/cpp/container/queue/operator=.html',0,'std::queue::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator=.html',0,'std::atomic::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::basic_stringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/thread/operator=.html',0,'std::thread::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::basic_string::operator=()'],['http://en.cppreference.com/w/cpp/container/priority_queue/operator=.html',0,'std::priority_queue::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::wostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::cregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::wstring::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/operator=.html',0,'std::unordered_multiset::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wsregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator=.html',0,'std::function::operator=()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator=.html',0,'std::error_condition::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::filebuf::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u16string::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u32string::operator=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator=.html',0,'std::complex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::basic_istringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::basic_ifstream::operator=()'],['http://en.cppreference.com/w/cpp/container/list/operator=.html',0,'std::list::operator=()'],['http://en.cppreference.com/w/cpp/container/map/operator=.html',0,'std::map::operator=()'],['http://en.cppreference.com/w/cpp/error/exception/operator=.html',0,'std::exception::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::streambuf::operator=()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator=.html',0,'std::experimental::optional::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wcregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::regex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::istringstream::operator=()'],['http://en.cppreference.com/w/cpp/error/nested_exception/operator=.html',0,'std::nested_exception::operator=()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator=.html',0,'std::auto_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::sregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator=.html',0,'std::packaged_task::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_set/operator=.html',0,'std::unordered_set::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::wfstream::operator=()'],['http://en.cppreference.com/w/cpp/container/multimap/operator=.html',0,'std::multimap::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/operator=.html',0,'std::atomic_flag::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::wofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::wstringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::wistringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::ifstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator=.html',0,'std::raw_storage_iterator::operator=()'],['../d1/dc2/classstack.html#a61370d5fbaf9ec6bca4a8c114c1058e1',1,'stack::operator=()'],['../db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb',1,'large_number::operator=()']]], + ['operator_3d_3d_1054',['operator==',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator==()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator==()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator==()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator==()'],['../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca',1,'large_number::operator==()']]], + ['operator_3e_1055',['operator>',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>()']]], + ['operator_3e_3d_1056',['operator>=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>=()']]], + ['operator_3e_3e_1057',['operator>>',['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::strstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istrstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wiostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_ifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wfstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wstringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::ifstream::operator>>()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#ab5b4bfecdf391cae7edb1fe98548b846',1,'statistics::stats_computer1::operator>>()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a7e7a1a2b0a03df0a70cac40d193421d2',1,'statistics::stats_computer2::operator>>()']]], + ['operator_3e_3e_3d_1058',['operator>>=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset']]], + ['operator_5b_5d_1059',['operator[]',['http://en.cppreference.com/w/cpp/container/dynarray/operator_at.html',0,'std::dynarray::operator[]()'],['http://en.cppreference.com/w/cpp/container/vector/operator_at.html',0,'std::vector::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::match_results::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::string::operator[]()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator_at.html',0,'std::unordered_map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wsmatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::smatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wcmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/deque/operator_at.html',0,'std::deque::operator[]()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_at.html',0,'std::bitset::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::basic_string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::wstring::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u16string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u32string::operator[]()'],['http://en.cppreference.com/w/cpp/container/map/operator_at.html',0,'std::map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::cmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/array/operator_at.html',0,'std::array::operator[]()'],['../db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d',1,'large_number::operator[]()']]], + ['operator_5e_3d_1060',['operator^=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator^=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator^=()']]], + ['operator_7c_3d_1061',['operator|=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator|=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator|=()']]], + ['operator_7e_1062',['operator~',['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset']]], + ['optional_1063',['optional',['http://en.cppreference.com/w/cpp/experimental/optional.html',0,'std::experimental::optional'],['http://en.cppreference.com/w/cpp/experimental/optional/optional.html',0,'std::experimental::optional::optional()']]], + ['ordinary_5fleast_5fsquares_5fregressor_2ecpp_1064',['ordinary_least_squares_regressor.cpp',['../dc/d38/ordinary__least__squares__regressor_8cpp.html',1,'']]], + ['ostream_1065',['ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std::ostream'],['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::ostream::ostream()']]], + ['ostream_5fiterator_1066',['ostream_iterator',['http://en.cppreference.com/w/cpp/iterator/ostream_iterator.html',0,'std']]], + ['ostreambuf_5fiterator_1067',['ostreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/ostreambuf_iterator.html',0,'std']]], + ['ostringstream_1068',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std::ostringstream'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::ostringstream::ostringstream()']]], + ['ostrstream_1069',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream.html',0,'std::ostrstream'],['http://en.cppreference.com/w/cpp/io/ostrstream/ostrstream.html',0,'std::ostrstream::ostrstream()']]], + ['out_1070',['out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::out()']]], + ['out_5fof_5frange_1071',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range'],['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range::out_of_range()']]], + ['outer_5fallocator_1072',['outer_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/outer_allocator.html',0,'std::scoped_allocator_adaptor']]], + ['output_5fiterator_5ftag_1073',['output_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['overflow_1074',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()']]], + ['overflow_5ferror_1075',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error'],['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error::overflow_error()']]], + ['owner_5fbefore_1076',['owner_before',['http://en.cppreference.com/w/cpp/memory/weak_ptr/owner_before.html',0,'std::weak_ptr::owner_before()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/owner_before.html',0,'std::shared_ptr::owner_before()']]], + ['owner_5fless_1077',['owner_less',['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std']]], + ['owns_5flock_1078',['owns_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()']]] +]; diff --git a/search/classes_0.html b/search/classes_0.html new file mode 100644 index 000000000..5b441a359 --- /dev/null +++ b/search/classes_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_0.js b/search/classes_0.js new file mode 100644 index 000000000..c8615991b --- /dev/null +++ b/search/classes_0.js @@ -0,0 +1,21 @@ +var searchData= +[ + ['adaline_1845',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html',1,'machine_learning']]], + ['add_5fconst_1846',['add_const',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['add_5fcv_1847',['add_cv',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['add_5flvalue_5freference_1848',['add_lvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]], + ['add_5fpointer_1849',['add_pointer',['http://en.cppreference.com/w/cpp/types/add_pointer.html',0,'std']]], + ['add_5frvalue_5freference_1850',['add_rvalue_reference',['http://en.cppreference.com/w/cpp/types/add_reference.html',0,'std']]], + ['add_5fvolatile_1851',['add_volatile',['http://en.cppreference.com/w/cpp/types/add_cv.html',0,'std']]], + ['adopt_5flock_5ft_1852',['adopt_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['aligned_5fstorage_1853',['aligned_storage',['http://en.cppreference.com/w/cpp/types/aligned_storage.html',0,'std']]], + ['aligned_5funion_1854',['aligned_union',['http://en.cppreference.com/w/cpp/types/aligned_union.html',0,'std']]], + ['alignment_5fof_1855',['alignment_of',['http://en.cppreference.com/w/cpp/types/alignment_of.html',0,'std']]], + ['allocator_1856',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator.html',0,'std']]], + ['allocator_5farg_5ft_1857',['allocator_arg_t',['http://en.cppreference.com/w/cpp/memory/allocator_arg_t.html',0,'std']]], + ['allocator_5ftraits_1858',['allocator_traits',['http://en.cppreference.com/w/cpp/memory/allocator_traits.html',0,'std']]], + ['array_1859',['array',['http://en.cppreference.com/w/cpp/container/array.html',0,'std']]], + ['atomic_1860',['atomic',['http://en.cppreference.com/w/cpp/atomic/atomic.html',0,'std']]], + ['atomic_5fflag_1861',['atomic_flag',['http://en.cppreference.com/w/cpp/atomic/atomic_flag.html',0,'std']]], + ['auto_5fptr_1862',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr.html',0,'std']]] +]; diff --git a/search/classes_1.html b/search/classes_1.html new file mode 100644 index 000000000..0ecc9f796 --- /dev/null +++ b/search/classes_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_1.js b/search/classes_1.js new file mode 100644 index 000000000..e6754b503 --- /dev/null +++ b/search/classes_1.js @@ -0,0 +1,43 @@ +var searchData= +[ + ['back_5finsert_5fiterator_1863',['back_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/back_insert_iterator.html',0,'std']]], + ['bad_5falloc_1864',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std']]], + ['bad_5farray_5flength_1865',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std']]], + ['bad_5farray_5fnew_5flength_1866',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length.html',0,'std']]], + ['bad_5fcast_1867',['bad_cast',['http://en.cppreference.com/w/cpp/types/bad_cast.html',0,'std']]], + ['bad_5fexception_1868',['bad_exception',['http://en.cppreference.com/w/cpp/error/bad_exception.html',0,'std']]], + ['bad_5ffunction_5fcall_1869',['bad_function_call',['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std']]], + ['bad_5foptional_5faccess_1870',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std']]], + ['bad_5ftypeid_1871',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid.html',0,'std']]], + ['bad_5fweak_5fptr_1872',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr.html',0,'std']]], + ['basic_5ffilebuf_1873',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std']]], + ['basic_5ffstream_1874',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]], + ['basic_5fifstream_1875',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]], + ['basic_5fios_1876',['basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], + ['basic_5fios_3c_20char_20_3e_1877',['basic_ios< char >',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], + ['basic_5fios_3c_20wchar_5ft_20_3e_1878',['basic_ios< wchar_t >',['http://en.cppreference.com/w/cpp/io/basic_ios.html',0,'std']]], + ['basic_5fiostream_1879',['basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]], + ['basic_5fistream_1880',['basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['basic_5fistringstream_1881',['basic_istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]], + ['basic_5fofstream_1882',['basic_ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]], + ['basic_5fostream_1883',['basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['basic_5fostringstream_1884',['basic_ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]], + ['basic_5fregex_1885',['basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std']]], + ['basic_5fstreambuf_1886',['basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std']]], + ['basic_5fstring_1887',['basic_string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['basic_5fstring_3c_20char8_5ft_20_3e_1888',['basic_string< char8_t >',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['basic_5fstringbuf_1889',['basic_stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std']]], + ['basic_5fstringstream_1890',['basic_stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]], + ['bernoulli_5fdistribution_1891',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution.html',0,'std']]], + ['bidirectional_5fiterator_5ftag_1892',['bidirectional_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['binary_5ffunction_1893',['binary_function',['http://en.cppreference.com/w/cpp/utility/functional/binary_function.html',0,'std']]], + ['binary_5fnegate_1894',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std']]], + ['binomial_5fdistribution_1895',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution.html',0,'std']]], + ['bit_1896',['Bit',['../df/d27/class_bit.html',1,'']]], + ['bit_5fand_1897',['bit_and',['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std']]], + ['bit_5fnot_1898',['bit_not',['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std']]], + ['bit_5for_1899',['bit_or',['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std']]], + ['bitset_1900',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], + ['bitset_3c_20maxn_20_3e_1901',['bitset< MAXN >',['http://en.cppreference.com/w/cpp/utility/bitset.html',0,'std']]], + ['btree_1902',['Btree',['../d9/d90/struct_btree.html',1,'']]] +]; diff --git a/search/classes_10.html b/search/classes_10.html new file mode 100644 index 000000000..fb544a969 --- /dev/null +++ b/search/classes_10.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_10.js b/search/classes_10.js new file mode 100644 index 000000000..337157445 --- /dev/null +++ b/search/classes_10.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['query_2196',['query',['../dd/d1b/structquery.html',1,'']]], + ['queue_2197',['queue',['../d2/d36/structqueue.html',1,'queue< Kind >'],['http://en.cppreference.com/w/cpp/container/queue.html',0,'std::queue< T >'],['../d4/da4/class_queue.html',1,'Queue']]], + ['queue_5farray_2198',['Queue_Array',['../d0/dd2/class_queue___array.html',1,'']]] +]; diff --git a/search/classes_11.html b/search/classes_11.html new file mode 100644 index 000000000..342865866 --- /dev/null +++ b/search/classes_11.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_11.js b/search/classes_11.js new file mode 100644 index 000000000..c93204fc7 --- /dev/null +++ b/search/classes_11.js @@ -0,0 +1,42 @@ +var searchData= +[ + ['random_5faccess_5fiterator_5ftag_2199',['random_access_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['random_5fdevice_2200',['random_device',['http://en.cppreference.com/w/cpp/numeric/random/random_device.html',0,'std']]], + ['range_5ferror_2201',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std']]], + ['rank_2202',['rank',['http://en.cppreference.com/w/cpp/types/rank.html',0,'std']]], + ['ranlux24_2203',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std']]], + ['ranlux24_5fbase_2204',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std']]], + ['ranlux48_2205',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std']]], + ['ranlux48_5fbase_2206',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std']]], + ['ratio_2207',['ratio',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['ratio_5fadd_2208',['ratio_add',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_add.html',0,'std']]], + ['ratio_5fdivide_2209',['ratio_divide',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_divide.html',0,'std']]], + ['ratio_5fequal_2210',['ratio_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_equal.html',0,'std']]], + ['ratio_5fgreater_2211',['ratio_greater',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater.html',0,'std']]], + ['ratio_5fgreater_5fequal_2212',['ratio_greater_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_greater_equal.html',0,'std']]], + ['ratio_5fless_2213',['ratio_less',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less.html',0,'std']]], + ['ratio_5fless_5fequal_2214',['ratio_less_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_less_equal.html',0,'std']]], + ['ratio_5fmultiply_2215',['ratio_multiply',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_multiply.html',0,'std']]], + ['ratio_5fnot_5fequal_2216',['ratio_not_equal',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_not_equal.html',0,'std']]], + ['ratio_5fsubtract_2217',['ratio_subtract',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio_subtract.html',0,'std']]], + ['raw_5fstorage_5fiterator_2218',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator.html',0,'std']]], + ['recursive_5fmutex_2219',['recursive_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_mutex.html',0,'std']]], + ['recursive_5ftimed_5fmutex_2220',['recursive_timed_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex.html',0,'std']]], + ['reference_2221',['reference',['http://en.cppreference.com/w/cpp/utility/bitset/reference.html',0,'std::bitset']]], + ['reference_5fwrapper_2222',['reference_wrapper',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper.html',0,'std']]], + ['regex_2223',['regex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std']]], + ['regex_5ferror_2224',['regex_error',['http://en.cppreference.com/w/cpp/regex/regex_error.html',0,'std']]], + ['regex_5fiterator_2225',['regex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], + ['regex_5ftoken_5fiterator_2226',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], + ['regex_5ftraits_2227',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits.html',0,'std']]], + ['remove_5fall_5fextents_2228',['remove_all_extents',['http://en.cppreference.com/w/cpp/types/remove_all_extents.html',0,'std']]], + ['remove_5fconst_2229',['remove_const',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['remove_5fcv_2230',['remove_cv',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['remove_5fextent_2231',['remove_extent',['http://en.cppreference.com/w/cpp/types/remove_extent.html',0,'std']]], + ['remove_5fpointer_2232',['remove_pointer',['http://en.cppreference.com/w/cpp/types/remove_pointer.html',0,'std']]], + ['remove_5freference_2233',['remove_reference',['http://en.cppreference.com/w/cpp/types/remove_reference.html',0,'std']]], + ['remove_5fvolatile_2234',['remove_volatile',['http://en.cppreference.com/w/cpp/types/remove_cv.html',0,'std']]], + ['result_5fof_2235',['result_of',['http://en.cppreference.com/w/cpp/types/result_of.html',0,'std']]], + ['reverse_5fiterator_2236',['reverse_iterator',['http://en.cppreference.com/w/cpp/iterator/reverse_iterator.html',0,'std']]], + ['runtime_5ferror_2237',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std']]] +]; diff --git a/search/classes_12.html b/search/classes_12.html new file mode 100644 index 000000000..59539ed8d --- /dev/null +++ b/search/classes_12.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_12.js b/search/classes_12.js new file mode 100644 index 000000000..eada6c392 --- /dev/null +++ b/search/classes_12.js @@ -0,0 +1,43 @@ +var searchData= +[ + ['scoped_5fallocator_5fadaptor_2238',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor.html',0,'std']]], + ['seconds_2239',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]], + ['seed_5fseq_2240',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq.html',0,'std']]], + ['segmentintersection_2241',['SegmentIntersection',['../d4/db4/struct_segment_intersection.html',1,'']]], + ['sentry_2242',['sentry',['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wfstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_stringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_iostream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wstringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::strstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::fstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::iostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wiostream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::stringstream::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_fstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream< Char >::sentry'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry']]], + ['set_2243',['set',['http://en.cppreference.com/w/cpp/container/set.html',0,'std']]], + ['shared_5ffuture_2244',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future.html',0,'std']]], + ['shared_5flock_2245',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock.html',0,'std']]], + ['shared_5fptr_2246',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5fptr_3c_20trie_3a_3atrienode_20_3e_2247',['shared_ptr< Trie::TrieNode >',['http://en.cppreference.com/w/cpp/memory/shared_ptr.html',0,'std']]], + ['shared_5ftimed_5fmutex_2248',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex.html',0,'std']]], + ['shuffle_5forder_5fengine_2249',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std']]], + ['sig_5fatomic_5ft_2250',['sig_atomic_t',['http://en.cppreference.com/w/cpp/utility/program/sig_atomic_t.html',0,'std']]], + ['size_5ft_2251',['size_t',['http://en.cppreference.com/w/cpp/types/size_t.html',0,'std']]], + ['smatch_2252',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]], + ['solution_2253',['Solution',['../dd/d4f/class_solution.html',1,'']]], + ['sregex_5fiterator_2254',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], + ['sregex_5ftoken_5fiterator_2255',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], + ['ssub_5fmatch_2256',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], + ['stack_2257',['stack',['../d1/dc2/classstack.html',1,'stack< Type >'],['http://en.cppreference.com/w/cpp/container/stack.html',0,'std::stack< T >']]], + ['stack_5flinkedlist_2258',['stack_linkedList',['../d2/dc4/classstack__linked_list.html',1,'']]], + ['state_5ftype_2259',['state_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::state_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::state_type']]], + ['stats_5fcomputer1_2260',['stats_computer1',['../d7/d7c/classstatistics_1_1stats__computer1.html',1,'statistics']]], + ['stats_5fcomputer2_2261',['stats_computer2',['../d8/dab/classstatistics_1_1stats__computer2.html',1,'statistics']]], + ['steady_5fclock_2262',['steady_clock',['http://en.cppreference.com/w/cpp/chrono/steady_clock.html',0,'std::chrono']]], + ['streambuf_2263',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std']]], + ['streamoff_2264',['streamoff',['http://en.cppreference.com/w/cpp/io/streamoff.html',0,'std']]], + ['streampos_2265',['streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['streamsize_2266',['streamsize',['http://en.cppreference.com/w/cpp/io/streamsize.html',0,'std']]], + ['string_2267',['string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['string_5ftype_2268',['string_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::string_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::string_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::string_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::string_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::string_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::string_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::string_type']]], + ['stringbuf_2269',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std']]], + ['stringstream_2270',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]], + ['strstream_2271',['strstream',['http://en.cppreference.com/w/cpp/io/strstream.html',0,'std']]], + ['strstreambuf_2272',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf.html',0,'std']]], + ['student_5ft_5fdistribution_2273',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution.html',0,'std']]], + ['sub_5fmatch_2274',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], + ['subtract_5fwith_5fcarry_5fengine_2275',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine.html',0,'std']]], + ['system_5fclock_2276',['system_clock',['http://en.cppreference.com/w/cpp/chrono/system_clock.html',0,'std::chrono']]], + ['system_5ferror_2277',['system_error',['http://en.cppreference.com/w/cpp/error/system_error.html',0,'std']]] +]; diff --git a/search/classes_13.html b/search/classes_13.html new file mode 100644 index 000000000..6650a22ee --- /dev/null +++ b/search/classes_13.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_13.js b/search/classes_13.js new file mode 100644 index 000000000..9cd23f350 --- /dev/null +++ b/search/classes_13.js @@ -0,0 +1,25 @@ +var searchData= +[ + ['tera_2278',['tera',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['terminate_5fhandler_2279',['terminate_handler',['http://en.cppreference.com/w/cpp/error/terminate_handler.html',0,'std']]], + ['thread_2280',['thread',['http://en.cppreference.com/w/cpp/thread/thread.html',0,'std']]], + ['time_5fbase_2281',['time_base',['http://en.cppreference.com/w/cpp/locale/time_base.html',0,'std']]], + ['time_5fget_2282',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std']]], + ['time_5fget_5fbyname_2283',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std']]], + ['time_5fpoint_2284',['time_point',['http://en.cppreference.com/w/cpp/chrono/time_point.html',0,'std::chrono']]], + ['time_5fput_2285',['time_put',['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std']]], + ['time_5fput_5fbyname_2286',['time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std']]], + ['time_5ft_2287',['time_t',['http://en.cppreference.com/w/cpp/chrono/c/time_t.html',0,'std']]], + ['timed_5fmutex_2288',['timed_mutex',['http://en.cppreference.com/w/cpp/thread/timed_mutex.html',0,'std']]], + ['tm_2289',['tm',['http://en.cppreference.com/w/cpp/chrono/c/tm.html',0,'std']]], + ['tower_2290',['tower',['../d2/d2c/structtower.html',1,'']]], + ['treat_5fas_5ffloating_5fpoint_2291',['treat_as_floating_point',['http://en.cppreference.com/w/cpp/chrono/treat_as_floating_point.html',0,'std::chrono']]], + ['trie_2292',['Trie',['../dd/d2f/class_trie.html',1,'Trie'],['../d4/dd9/structtrie.html',1,'trie']]], + ['trienode_2293',['TrieNode',['../de/d48/struct_trie_1_1_trie_node.html',1,'Trie']]], + ['true_5ftype_2294',['true_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['try_5fto_5flock_5ft_2295',['try_to_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['tuple_2296',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], + ['tuple_3c_20int_2c_20int_2c_20int_20_3e_2297',['tuple< int, int, int >',['http://en.cppreference.com/w/cpp/utility/tuple.html',0,'std']]], + ['type_5findex_2298',['type_index',['http://en.cppreference.com/w/cpp/types/type_index.html',0,'std']]], + ['type_5finfo_2299',['type_info',['http://en.cppreference.com/w/cpp/types/type_info.html',0,'std']]] +]; diff --git a/search/classes_14.html b/search/classes_14.html new file mode 100644 index 000000000..af4ab2664 --- /dev/null +++ b/search/classes_14.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_14.js b/search/classes_14.js new file mode 100644 index 000000000..7981999a5 --- /dev/null +++ b/search/classes_14.js @@ -0,0 +1,36 @@ +var searchData= +[ + ['u16streampos_2300',['u16streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['u16string_2301',['u16string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['u32streampos_2302',['u32streampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['u32string_2303',['u32string',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['uint16_5ft_2304',['uint16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint32_5ft_2305',['uint32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint64_5ft_2306',['uint64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint8_5ft_2307',['uint8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5ffast16_5ft_2308',['uint_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5ffast32_5ft_2309',['uint_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5ffast64_5ft_2310',['uint_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5ffast8_5ft_2311',['uint_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5fleast16_5ft_2312',['uint_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5fleast32_5ft_2313',['uint_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5fleast64_5ft_2314',['uint_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uint_5fleast8_5ft_2315',['uint_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uintmax_5ft_2316',['uintmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['uintptr_5ft_2317',['uintptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['unary_5ffunction_2318',['unary_function',['http://en.cppreference.com/w/cpp/utility/functional/unary_function.html',0,'std']]], + ['unary_5fnegate_2319',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std']]], + ['underflow_5ferror_2320',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std']]], + ['underlying_5ftype_2321',['underlying_type',['http://en.cppreference.com/w/cpp/types/underlying_type.html',0,'std']]], + ['unexpected_5fhandler_2322',['unexpected_handler',['http://en.cppreference.com/w/cpp/error/unexpected_handler.html',0,'std']]], + ['uniform_5fint_5fdistribution_2323',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html',0,'std']]], + ['uniform_5freal_5fdistribution_2324',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution.html',0,'std']]], + ['unique_5flock_2325',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock.html',0,'std']]], + ['unique_5fptr_2326',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr.html',0,'std']]], + ['unordered_5fmap_2327',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmap_3c_20unsigned_20int_2c_20std_3a_3avector_3c_20unsigned_20int_20_3e_20_3e_2328',['unordered_map< unsigned int, std::vector< unsigned int > >',['http://en.cppreference.com/w/cpp/container/unordered_map.html',0,'std']]], + ['unordered_5fmultimap_2329',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap.html',0,'std']]], + ['unordered_5fmultiset_2330',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset.html',0,'std']]], + ['unordered_5fset_2331',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set.html',0,'std']]], + ['uses_5fallocator_2332',['uses_allocator',['http://en.cppreference.com/w/cpp/memory/uses_allocator.html',0,'std']]] +]; diff --git a/search/classes_15.html b/search/classes_15.html new file mode 100644 index 000000000..dfd7dc69f --- /dev/null +++ b/search/classes_15.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_15.js b/search/classes_15.js new file mode 100644 index 000000000..1dceb3376 --- /dev/null +++ b/search/classes_15.js @@ -0,0 +1,14 @@ +var searchData= +[ + ['va_5flist_2333',['va_list',['http://en.cppreference.com/w/cpp/utility/variadic/va_list.html',0,'']]], + ['valarray_2334',['valarray',['http://en.cppreference.com/w/cpp/numeric/valarray.html',0,'std']]], + ['value_5fcompare_2335',['value_compare',['http://en.cppreference.com/w/cpp/container/multimap/value_compare.html',0,'std::multimap< K, T >::value_compare'],['http://en.cppreference.com/w/cpp/container/map/value_compare.html',0,'std::map< K, T >::value_compare']]], + ['vector_2336',['vector',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20bool_20_3e_2337',['vector< bool >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20double_20_3e_2338',['vector< double >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20int_20_3e_2339',['vector< int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_2340',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20char_20_3e_2341',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20int_20_3e_2342',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20vector_3c_20int_20_3e_20_3e_2343',['vector< vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]] +]; diff --git a/search/classes_16.html b/search/classes_16.html new file mode 100644 index 000000000..44a2f3479 --- /dev/null +++ b/search/classes_16.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_16.js b/search/classes_16.js new file mode 100644 index 000000000..857ea178e --- /dev/null +++ b/search/classes_16.js @@ -0,0 +1,34 @@ +var searchData= +[ + ['wbuffer_5fconvert_2344',['wbuffer_convert',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert.html',0,'std']]], + ['wcerr_2345',['wcerr',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['wcin_2346',['wcin',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['wclog_2347',['wclog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['wcmatch_2348',['wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]], + ['wcout_2349',['wcout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['wcregex_5fiterator_2350',['wcregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], + ['wcregex_5ftoken_5fiterator_2351',['wcregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], + ['wcsub_5fmatch_2352',['wcsub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], + ['weak_5fptr_2353',['weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr.html',0,'std']]], + ['weibull_5fdistribution_2354',['weibull_distribution',['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution.html',0,'std']]], + ['wfilebuf_2355',['wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std']]], + ['wfstream_2356',['wfstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]], + ['wifstream_2357',['wifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]], + ['wiostream_2358',['wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]], + ['wistream_2359',['wistream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['wistringstream_2360',['wistringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]], + ['wofstream_2361',['wofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]], + ['wostream_2362',['wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['wostringstream_2363',['wostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]], + ['wregex_2364',['wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex.html',0,'std']]], + ['wsmatch_2365',['wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]], + ['wsregex_5fiterator_2366',['wsregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], + ['wsregex_5ftoken_5fiterator_2367',['wsregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], + ['wssub_5fmatch_2368',['wssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], + ['wstreambuf_2369',['wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf.html',0,'std']]], + ['wstreampos_2370',['wstreampos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['wstring_2371',['wstring',['http://en.cppreference.com/w/cpp/string/basic_string.html',0,'std']]], + ['wstring_5fconvert_2372',['wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert.html',0,'std']]], + ['wstringbuf_2373',['wstringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf.html',0,'std']]], + ['wstringstream_2374',['wstringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream.html',0,'std']]] +]; diff --git a/search/classes_17.html b/search/classes_17.html new file mode 100644 index 000000000..684f43038 --- /dev/null +++ b/search/classes_17.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_17.js b/search/classes_17.js new file mode 100644 index 000000000..3274e0826 --- /dev/null +++ b/search/classes_17.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['yocto_2375',['yocto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['yotta_2376',['yotta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]] +]; diff --git a/search/classes_18.html b/search/classes_18.html new file mode 100644 index 000000000..75260945b --- /dev/null +++ b/search/classes_18.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_18.js b/search/classes_18.js new file mode 100644 index 000000000..02cdbc6f0 --- /dev/null +++ b/search/classes_18.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['zetta_2377',['zetta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]] +]; diff --git a/search/classes_2.html b/search/classes_2.html new file mode 100644 index 000000000..9c253f2b6 --- /dev/null +++ b/search/classes_2.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_2.js b/search/classes_2.js new file mode 100644 index 000000000..eb70f80a4 --- /dev/null +++ b/search/classes_2.js @@ -0,0 +1,37 @@ +var searchData= +[ + ['catalog_1903',['catalog',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_byname::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages::catalog'],['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std::messages_base::catalog']]], + ['cauchy_5fdistribution_1904',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution.html',0,'std']]], + ['centi_1905',['centi',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['cerr_1906',['cerr',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['char_5ftraits_1907',['char_traits',['http://en.cppreference.com/w/cpp/string/char_traits.html',0,'std']]], + ['char_5ftype_1908',['char_type',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::char_type'],['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std::numpunct::char_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::char_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::char_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::char_type'],['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std::moneypunct::char_type'],['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std::collate::char_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::char_type'],['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std::messages::char_type']]], + ['chi_5fsquared_5fdistribution_1909',['chi_squared_distribution',['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution.html',0,'std']]], + ['cin_1910',['cin',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['cll_1911',['cll',['../d5/d15/classcll.html',1,'']]], + ['clock_5ft_1912',['clock_t',['http://en.cppreference.com/w/cpp/chrono/c/clock_t.html',0,'std']]], + ['clog_1913',['clog',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['cmatch_1914',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]], + ['codecvt_1915',['codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std']]], + ['codecvt_5fbase_1916',['codecvt_base',['http://en.cppreference.com/w/cpp/locale/codecvt_base.html',0,'std']]], + ['codecvt_5fbyname_1917',['codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std']]], + ['codecvt_5futf16_1918',['codecvt_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf16.html',0,'std']]], + ['codecvt_5futf8_1919',['codecvt_utf8',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8.html',0,'std']]], + ['codecvt_5futf8_5futf16_1920',['codecvt_utf8_utf16',['http://en.cppreference.com/w/cpp/locale/codecvt_utf8_utf16.html',0,'std']]], + ['collate_1921',['collate',['http://en.cppreference.com/w/cpp/locale/collate.html',0,'std']]], + ['collate_5fbyname_1922',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std']]], + ['common_5ftype_1923',['common_type',['http://en.cppreference.com/w/cpp/types/common_type.html',0,'std']]], + ['compare_1924',['compare',['../d1/db3/structcompare.html',1,'']]], + ['complex_1925',['complex',['http://en.cppreference.com/w/cpp/numeric/complex.html',0,'std']]], + ['condition_5fvariable_1926',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable.html',0,'std']]], + ['condition_5fvariable_5fany_1927',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any.html',0,'std']]], + ['conditional_1928',['conditional',['http://en.cppreference.com/w/cpp/types/conditional.html',0,'std']]], + ['cout_1929',['cout',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['cregex_5fiterator_1930',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator.html',0,'std']]], + ['cregex_5ftoken_5fiterator_1931',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator.html',0,'std']]], + ['csub_5fmatch_1932',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match.html',0,'std']]], + ['ctype_1933',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype.html',0,'std']]], + ['ctype_5fbase_1934',['ctype_base',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std']]], + ['ctype_5fbyname_1935',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std']]], + ['cyclecheck_1936',['CycleCheck',['../d3/dbb/class_cycle_check.html',1,'']]] +]; diff --git a/search/classes_3.html b/search/classes_3.html new file mode 100644 index 000000000..a89a0407b --- /dev/null +++ b/search/classes_3.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_3.js b/search/classes_3.js new file mode 100644 index 000000000..fa39594df --- /dev/null +++ b/search/classes_3.js @@ -0,0 +1,18 @@ +var searchData= +[ + ['deca_1937',['deca',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['decay_1938',['decay',['http://en.cppreference.com/w/cpp/types/decay.html',0,'std']]], + ['deci_1939',['deci',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['default_5fdelete_1940',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std']]], + ['default_5frandom_5fengine_1941',['default_random_engine',['http://en.cppreference.com/w/cpp/numeric/random.html',0,'std']]], + ['defer_5flock_5ft_1942',['defer_lock_t',['http://en.cppreference.com/w/cpp/thread/lock_tag_t.html',0,'std']]], + ['deque_1943',['deque',['http://en.cppreference.com/w/cpp/container/deque.html',0,'std']]], + ['discard_5fblock_5fengine_1944',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine.html',0,'std']]], + ['discrete_5fdistribution_1945',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution.html',0,'std']]], + ['divides_1946',['divides',['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std']]], + ['domain_5ferror_1947',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std']]], + ['double_5flinked_5flist_1948',['double_linked_list',['../d9/dee/classdouble__linked__list.html',1,'']]], + ['duration_1949',['duration',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]], + ['duration_5fvalues_1950',['duration_values',['http://en.cppreference.com/w/cpp/chrono/duration_values.html',0,'std::chrono']]], + ['dynarray_1951',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray.html',0,'std']]] +]; diff --git a/search/classes_4.html b/search/classes_4.html new file mode 100644 index 000000000..97fa6e88e --- /dev/null +++ b/search/classes_4.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_4.js b/search/classes_4.js new file mode 100644 index 000000000..3b8c2286d --- /dev/null +++ b/search/classes_4.js @@ -0,0 +1,20 @@ +var searchData= +[ + ['edge_1952',['Edge',['../d7/d77/class_edge.html',1,'']]], + ['enable_5fif_1953',['enable_if',['http://en.cppreference.com/w/cpp/types/enable_if.html',0,'std']]], + ['enable_5fshared_5ffrom_5fthis_1954',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this.html',0,'std']]], + ['entry_1955',['Entry',['../dd/d3b/struct_entry.html',1,'']]], + ['equal_5fto_1956',['equal_to',['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std']]], + ['errc_1957',['errc',['http://en.cppreference.com/w/cpp/error/errc.html',0,'std']]], + ['error_5fcategory_1958',['error_category',['http://en.cppreference.com/w/cpp/error/error_category.html',0,'std']]], + ['error_5fcode_1959',['error_code',['http://en.cppreference.com/w/cpp/error/error_code.html',0,'std']]], + ['error_5fcondition_1960',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition.html',0,'std']]], + ['event_5fcallback_1961',['event_callback',['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ios< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wfstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_iostream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wstringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ifstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::fstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_fstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::strstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ofstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::iostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_stringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wostringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::istrstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ios_base::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ostream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wiostream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::wistream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::ofstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_istringstream< Char >::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::stringstream::event_callback'],['http://en.cppreference.com/w/cpp/io/ios_base/event_callback.html',0,'std::basic_ifstream< Char >::event_callback']]], + ['exa_1962',['exa',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['exception_1963',['exception',['http://en.cppreference.com/w/cpp/error/exception.html',0,'std']]], + ['exception_5fptr_1964',['exception_ptr',['http://en.cppreference.com/w/cpp/error/exception_ptr.html',0,'std']]], + ['exponential_5fdistribution_1965',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution.html',0,'std']]], + ['extent_1966',['extent',['http://en.cppreference.com/w/cpp/types/extent.html',0,'std']]], + ['extern_5ftype_1967',['extern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::extern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::extern_type']]], + ['extreme_5fvalue_5fdistribution_1968',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution.html',0,'std']]] +]; diff --git a/search/classes_5.html b/search/classes_5.html new file mode 100644 index 000000000..fe82670c4 --- /dev/null +++ b/search/classes_5.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_5.js b/search/classes_5.js new file mode 100644 index 000000000..169e7fb5f --- /dev/null +++ b/search/classes_5.js @@ -0,0 +1,19 @@ +var searchData= +[ + ['facet_1969',['facet',['http://en.cppreference.com/w/cpp/locale/locale/facet.html',0,'std::locale']]], + ['failure_1970',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream< Char >::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream< Char >::failure']]], + ['false_5ftype_1971',['false_type',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['femto_1972',['femto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['file_1973',['FILE',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]], + ['filebuf_1974',['filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf.html',0,'std']]], + ['fisher_5ff_5fdistribution_1975',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution.html',0,'std']]], + ['forward_5fiterator_5ftag_1976',['forward_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['forward_5flist_1977',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list.html',0,'std']]], + ['fpos_1978',['fpos',['http://en.cppreference.com/w/cpp/io/fpos.html',0,'std']]], + ['fpos_5ft_1979',['fpos_t',['http://en.cppreference.com/w/cpp/io/c.html',0,'std']]], + ['front_5finsert_5fiterator_1980',['front_insert_iterator',['http://en.cppreference.com/w/cpp/iterator/front_insert_iterator.html',0,'std']]], + ['fstream_1981',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream.html',0,'std']]], + ['function_1982',['function',['http://en.cppreference.com/w/cpp/utility/functional/function.html',0,'std']]], + ['future_1983',['future',['http://en.cppreference.com/w/cpp/thread/future.html',0,'std']]], + ['future_5ferror_1984',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error.html',0,'std']]] +]; diff --git a/search/classes_6.html b/search/classes_6.html new file mode 100644 index 000000000..2b4a09e64 --- /dev/null +++ b/search/classes_6.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_6.js b/search/classes_6.js new file mode 100644 index 000000000..03e72ecc8 --- /dev/null +++ b/search/classes_6.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['gamma_5fdistribution_1985',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution.html',0,'std']]], + ['geometric_5fdistribution_1986',['geometric_distribution',['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution.html',0,'std']]], + ['giga_1987',['giga',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['graph_1988',['graph',['../dd/d9b/classgraph.html',1,'graph'],['../da/d9a/class_graph.html',1,'Graph']]], + ['greater_1989',['greater',['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std']]], + ['greater_5fequal_1990',['greater_equal',['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std']]] +]; diff --git a/search/classes_7.html b/search/classes_7.html new file mode 100644 index 000000000..f43072814 --- /dev/null +++ b/search/classes_7.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_7.js b/search/classes_7.js new file mode 100644 index 000000000..7a03c0d21 --- /dev/null +++ b/search/classes_7.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['has_5fvirtual_5fdestructor_1991',['has_virtual_destructor',['http://en.cppreference.com/w/cpp/types/has_virtual_destructor.html',0,'std']]], + ['hash_1992',['hash',['http://en.cppreference.com/w/cpp/utility/hash.html',0,'std']]], + ['hecto_1993',['hecto',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['high_5fresolution_5fclock_1994',['high_resolution_clock',['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock.html',0,'std::chrono']]], + ['hours_1995',['hours',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]] +]; diff --git a/search/classes_8.html b/search/classes_8.html new file mode 100644 index 000000000..822af8d8a --- /dev/null +++ b/search/classes_8.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_8.js b/search/classes_8.js new file mode 100644 index 000000000..ea3097184 --- /dev/null +++ b/search/classes_8.js @@ -0,0 +1,101 @@ +var searchData= +[ + ['id_1996',['id',['http://en.cppreference.com/w/cpp/thread/thread/id.html',0,'std::thread::id'],['http://en.cppreference.com/w/cpp/locale/locale/id.html',0,'std::locale::id']]], + ['ifstream_1997',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream.html',0,'std']]], + ['independent_5fbits_5fengine_1998',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine.html',0,'std']]], + ['initializer_5flist_1999',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list.html',0,'std']]], + ['input_5fiterator_5ftag_2000',['input_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['insert_5fiterator_2001',['insert_iterator',['http://en.cppreference.com/w/cpp/iterator/insert_iterator.html',0,'std']]], + ['int16_5ft_2002',['int16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int32_5ft_2003',['int32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int64_5ft_2004',['int64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int8_5ft_2005',['int8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast16_5ft_2006',['int_fast16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast32_5ft_2007',['int_fast32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast64_5ft_2008',['int_fast64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5ffast8_5ft_2009',['int_fast8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast16_5ft_2010',['int_least16_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast32_5ft_2011',['int_least32_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast64_5ft_2012',['int_least64_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['int_5fleast8_5ft_2013',['int_least8_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['integer_5fsequence_2014',['integer_sequence',['http://en.cppreference.com/w/cpp/utility/integer_sequence.html',0,'std']]], + ['integral_5fconstant_2015',['integral_constant',['http://en.cppreference.com/w/cpp/types/integral_constant.html',0,'std']]], + ['intern_5ftype_2016',['intern_type',['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_byname::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf8_utf16::intern_type'],['http://en.cppreference.com/w/cpp/locale/codecvt.html',0,'std::codecvt_utf16::intern_type']]], + ['intmax_5ft_2017',['intmax_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['intptr_5ft_2018',['intptr_t',['http://en.cppreference.com/w/cpp/types/integer.html',0,'std']]], + ['invalid_5fargument_2019',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std']]], + ['ios_5fbase_2020',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base.html',0,'std']]], + ['iostream_2021',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream.html',0,'std']]], + ['is_5fabstract_2022',['is_abstract',['http://en.cppreference.com/w/cpp/types/is_abstract.html',0,'std']]], + ['is_5farithmetic_2023',['is_arithmetic',['http://en.cppreference.com/w/cpp/types/is_arithmetic.html',0,'std']]], + ['is_5farray_2024',['is_array',['http://en.cppreference.com/w/cpp/types/is_array.html',0,'std']]], + ['is_5fassignable_2025',['is_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5fbase_5fof_2026',['is_base_of',['http://en.cppreference.com/w/cpp/types/is_base_of.html',0,'std']]], + ['is_5fbind_5fexpression_2027',['is_bind_expression',['http://en.cppreference.com/w/cpp/utility/functional/is_bind_expression.html',0,'std']]], + ['is_5fclass_2028',['is_class',['http://en.cppreference.com/w/cpp/types/is_class.html',0,'std']]], + ['is_5fcompound_2029',['is_compound',['http://en.cppreference.com/w/cpp/types/is_compound.html',0,'std']]], + ['is_5fconst_2030',['is_const',['http://en.cppreference.com/w/cpp/types/is_const.html',0,'std']]], + ['is_5fconstructible_2031',['is_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5fconvertible_2032',['is_convertible',['http://en.cppreference.com/w/cpp/types/is_convertible.html',0,'std']]], + ['is_5fcopy_5fassignable_2033',['is_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5fcopy_5fconstructible_2034',['is_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5fdefault_5fconstructible_2035',['is_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5fdestructible_2036',['is_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5fempty_2037',['is_empty',['http://en.cppreference.com/w/cpp/types/is_empty.html',0,'std']]], + ['is_5fenum_2038',['is_enum',['http://en.cppreference.com/w/cpp/types/is_enum.html',0,'std']]], + ['is_5ferror_5fcode_5fenum_2039',['is_error_code_enum',['http://en.cppreference.com/w/cpp/error/error_code/is_error_code_enum.html',0,'std']]], + ['is_5ferror_5fcondition_5fenum_2040',['is_error_condition_enum',['http://en.cppreference.com/w/cpp/error/error_condition/is_error_condition_enum.html',0,'std']]], + ['is_5ffloating_5fpoint_2041',['is_floating_point',['http://en.cppreference.com/w/cpp/types/is_floating_point.html',0,'std']]], + ['is_5ffunction_2042',['is_function',['http://en.cppreference.com/w/cpp/types/is_function.html',0,'std']]], + ['is_5ffundamental_2043',['is_fundamental',['http://en.cppreference.com/w/cpp/types/is_fundamental.html',0,'std']]], + ['is_5fintegral_2044',['is_integral',['http://en.cppreference.com/w/cpp/types/is_integral.html',0,'std']]], + ['is_5fliteral_5ftype_2045',['is_literal_type',['http://en.cppreference.com/w/cpp/types/is_literal_type.html',0,'std']]], + ['is_5flvalue_5freference_2046',['is_lvalue_reference',['http://en.cppreference.com/w/cpp/types/is_lvalue_reference.html',0,'std']]], + ['is_5fmember_5ffunction_5fpointer_2047',['is_member_function_pointer',['http://en.cppreference.com/w/cpp/types/is_member_function_pointer.html',0,'std']]], + ['is_5fmember_5fobject_5fpointer_2048',['is_member_object_pointer',['http://en.cppreference.com/w/cpp/types/is_member_object_pointer.html',0,'std']]], + ['is_5fmember_5fpointer_2049',['is_member_pointer',['http://en.cppreference.com/w/cpp/types/is_member_pointer.html',0,'std']]], + ['is_5fmove_5fassignable_2050',['is_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5fmove_5fconstructible_2051',['is_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5fnothrow_5fassignable_2052',['is_nothrow_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5fnothrow_5fconstructible_2053',['is_nothrow_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5fnothrow_5fcopy_5fassignable_2054',['is_nothrow_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5fnothrow_5fcopy_5fconstructible_2055',['is_nothrow_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5fnothrow_5fdefault_5fconstructible_2056',['is_nothrow_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5fnothrow_5fdestructible_2057',['is_nothrow_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5fnothrow_5fmove_5fassignable_2058',['is_nothrow_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5fnothrow_5fmove_5fconstructible_2059',['is_nothrow_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5fobject_2060',['is_object',['http://en.cppreference.com/w/cpp/types/is_object.html',0,'std']]], + ['is_5fplaceholder_2061',['is_placeholder',['http://en.cppreference.com/w/cpp/utility/functional/is_placeholder.html',0,'std']]], + ['is_5fpod_2062',['is_pod',['http://en.cppreference.com/w/cpp/types/is_pod.html',0,'std']]], + ['is_5fpointer_2063',['is_pointer',['http://en.cppreference.com/w/cpp/types/is_pointer.html',0,'std']]], + ['is_5fpolymorphic_2064',['is_polymorphic',['http://en.cppreference.com/w/cpp/types/is_polymorphic.html',0,'std']]], + ['is_5freference_2065',['is_reference',['http://en.cppreference.com/w/cpp/types/is_reference.html',0,'std']]], + ['is_5frvalue_5freference_2066',['is_rvalue_reference',['http://en.cppreference.com/w/cpp/types/is_rvalue_reference.html',0,'std']]], + ['is_5fsame_2067',['is_same',['http://en.cppreference.com/w/cpp/types/is_same.html',0,'std']]], + ['is_5fscalar_2068',['is_scalar',['http://en.cppreference.com/w/cpp/types/is_scalar.html',0,'std']]], + ['is_5fsigned_2069',['is_signed',['http://en.cppreference.com/w/cpp/types/is_signed.html',0,'std']]], + ['is_5fstandard_5flayout_2070',['is_standard_layout',['http://en.cppreference.com/w/cpp/types/is_standard_layout.html',0,'std']]], + ['is_5ftrivial_2071',['is_trivial',['http://en.cppreference.com/w/cpp/types/is_trivial.html',0,'std']]], + ['is_5ftrivially_5fassignable_2072',['is_trivially_assignable',['http://en.cppreference.com/w/cpp/types/is_assignable.html',0,'std']]], + ['is_5ftrivially_5fconstructible_2073',['is_trivially_constructible',['http://en.cppreference.com/w/cpp/types/is_constructible.html',0,'std']]], + ['is_5ftrivially_5fcopy_5fassignable_2074',['is_trivially_copy_assignable',['http://en.cppreference.com/w/cpp/types/is_copy_assignable.html',0,'std']]], + ['is_5ftrivially_5fcopy_5fconstructible_2075',['is_trivially_copy_constructible',['http://en.cppreference.com/w/cpp/types/is_copy_constructible.html',0,'std']]], + ['is_5ftrivially_5fcopyable_2076',['is_trivially_copyable',['http://en.cppreference.com/w/cpp/types/is_trivially_copyable.html',0,'std']]], + ['is_5ftrivially_5fdefault_5fconstructible_2077',['is_trivially_default_constructible',['http://en.cppreference.com/w/cpp/types/is_default_constructible.html',0,'std']]], + ['is_5ftrivially_5fdestructible_2078',['is_trivially_destructible',['http://en.cppreference.com/w/cpp/types/is_destructible.html',0,'std']]], + ['is_5ftrivially_5fmove_5fassignable_2079',['is_trivially_move_assignable',['http://en.cppreference.com/w/cpp/types/is_move_assignable.html',0,'std']]], + ['is_5ftrivially_5fmove_5fconstructible_2080',['is_trivially_move_constructible',['http://en.cppreference.com/w/cpp/types/is_move_constructible.html',0,'std']]], + ['is_5funion_2081',['is_union',['http://en.cppreference.com/w/cpp/types/is_union.html',0,'std']]], + ['is_5funsigned_2082',['is_unsigned',['http://en.cppreference.com/w/cpp/types/is_unsigned.html',0,'std']]], + ['is_5fvoid_2083',['is_void',['http://en.cppreference.com/w/cpp/types/is_void.html',0,'std']]], + ['is_5fvolatile_2084',['is_volatile',['http://en.cppreference.com/w/cpp/types/is_volatile.html',0,'std']]], + ['istream_2085',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream.html',0,'std']]], + ['istream_5fiterator_2086',['istream_iterator',['http://en.cppreference.com/w/cpp/iterator/istream_iterator.html',0,'std']]], + ['istreambuf_5fiterator_2087',['istreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/istreambuf_iterator.html',0,'std']]], + ['istringstream_2088',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream.html',0,'std']]], + ['istrstream_2089',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream.html',0,'std']]], + ['item_2090',['Item',['../db/d66/struct_item.html',1,'']]], + ['iter_5ftype_2091',['iter_type',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std::num_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std::money_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std::money_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_put.html',0,'std::time_put_byname::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get::iter_type'],['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std::num_put::iter_type'],['http://en.cppreference.com/w/cpp/locale/time_get.html',0,'std::time_get_byname::iter_type']]], + ['iterator_2092',['iterator',['http://en.cppreference.com/w/cpp/iterator/iterator.html',0,'std']]], + ['iterator_5ftraits_2093',['iterator_traits',['http://en.cppreference.com/w/cpp/iterator/iterator_traits.html',0,'std']]] +]; diff --git a/search/classes_9.html b/search/classes_9.html new file mode 100644 index 000000000..6f4b440f3 --- /dev/null +++ b/search/classes_9.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_9.js b/search/classes_9.js new file mode 100644 index 000000000..fe9b8ef17 --- /dev/null +++ b/search/classes_9.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['jmp_5fbuf_2094',['jmp_buf',['http://en.cppreference.com/w/cpp/utility/program/jmp_buf.html',0,'std']]] +]; diff --git a/search/classes_a.html b/search/classes_a.html new file mode 100644 index 000000000..dc28dfabd --- /dev/null +++ b/search/classes_a.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_a.js b/search/classes_a.js new file mode 100644 index 000000000..bde02e99f --- /dev/null +++ b/search/classes_a.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['kilo_2095',['kilo',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['knuth_5fb_2096',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine.html',0,'std']]] +]; diff --git a/search/classes_b.html b/search/classes_b.html new file mode 100644 index 000000000..df5f8486c --- /dev/null +++ b/search/classes_b.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_b.js b/search/classes_b.js new file mode 100644 index 000000000..8544dade8 --- /dev/null +++ b/search/classes_b.js @@ -0,0 +1,20 @@ +var searchData= +[ + ['large_5fnumber_2097',['large_number',['../db/d82/classlarge__number.html',1,'']]], + ['lca_2098',['lca',['../dd/df4/structlca.html',1,'']]], + ['lconv_2099',['lconv',['http://en.cppreference.com/w/cpp/locale/lconv.html',0,'std']]], + ['length_5ferror_2100',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std']]], + ['less_2101',['less',['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std']]], + ['less_5fequal_2102',['less_equal',['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std']]], + ['linear_5fcongruential_5fengine_2103',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std']]], + ['linkedlist_2104',['linkedlist',['../d0/dff/structlinkedlist.html',1,'']]], + ['list_2105',['list',['../d8/d10/structlist.html',1,'list'],['http://en.cppreference.com/w/cpp/container/list.html',0,'std::list< T >']]], + ['list_3c_20int_20_3e_2106',['list< int >',['../d8/d10/structlist.html',1,'']]], + ['locale_2107',['locale',['http://en.cppreference.com/w/cpp/locale/locale.html',0,'std']]], + ['lock_5fguard_2108',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard.html',0,'std']]], + ['logic_5ferror_2109',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std']]], + ['logical_5fand_2110',['logical_and',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std']]], + ['logical_5fnot_2111',['logical_not',['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std']]], + ['logical_5for_2112',['logical_or',['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std']]], + ['lognormal_5fdistribution_2113',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution.html',0,'std']]] +]; diff --git a/search/classes_c.html b/search/classes_c.html new file mode 100644 index 000000000..18e5b17d5 --- /dev/null +++ b/search/classes_c.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_c.js b/search/classes_c.js new file mode 100644 index 000000000..877545a0e --- /dev/null +++ b/search/classes_c.js @@ -0,0 +1,39 @@ +var searchData= +[ + ['make_5fsigned_2114',['make_signed',['http://en.cppreference.com/w/cpp/types/make_signed.html',0,'std']]], + ['make_5funsigned_2115',['make_unsigned',['http://en.cppreference.com/w/cpp/types/make_unsigned.html',0,'std']]], + ['map_2116',['map',['http://en.cppreference.com/w/cpp/container/map.html',0,'std']]], + ['mask_2117',['mask',['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_base::mask'],['http://en.cppreference.com/w/cpp/locale/ctype_base.html',0,'std::ctype_byname::mask']]], + ['match_5fresults_2118',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results.html',0,'std']]], + ['max_5falign_5ft_2119',['max_align_t',['http://en.cppreference.com/w/cpp/types/max_align_t.html',0,'std']]], + ['mbstate_5ft_2120',['mbstate_t',['http://en.cppreference.com/w/cpp/string/multibyte/mbstate_t.html',0,'std']]], + ['mega_2121',['mega',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['mersenne_5ftwister_5fengine_2122',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std']]], + ['messages_2123',['messages',['http://en.cppreference.com/w/cpp/locale/messages.html',0,'std']]], + ['messages_5fbase_2124',['messages_base',['http://en.cppreference.com/w/cpp/locale/messages_base.html',0,'std']]], + ['messages_5fbyname_2125',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std']]], + ['micro_2126',['micro',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['microseconds_2127',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]], + ['milli_2128',['milli',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['milliseconds_2129',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]], + ['minheap_2130',['MinHeap',['../d2/d05/class_min_heap.html',1,'']]], + ['minheapnode_2131',['MinHeapNode',['../d5/d29/struct_min_heap_node.html',1,'']]], + ['minstd_5frand_2132',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std']]], + ['minstd_5frand0_2133',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine.html',0,'std']]], + ['minus_2134',['minus',['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std']]], + ['minutes_2135',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]], + ['modulus_2136',['modulus',['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std']]], + ['money_5fbase_2137',['money_base',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std']]], + ['money_5fget_2138',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get.html',0,'std']]], + ['money_5fput_2139',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put.html',0,'std']]], + ['moneypunct_2140',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct.html',0,'std']]], + ['moneypunct_5fbyname_2141',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std']]], + ['move_5fiterator_2142',['move_iterator',['http://en.cppreference.com/w/cpp/iterator/move_iterator.html',0,'std']]], + ['mst_2143',['mst',['../d1/d77/structmst.html',1,'']]], + ['mt19937_2144',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std']]], + ['mt19937_5f64_2145',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html',0,'std']]], + ['multimap_2146',['multimap',['http://en.cppreference.com/w/cpp/container/multimap.html',0,'std']]], + ['multiplies_2147',['multiplies',['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std']]], + ['multiset_2148',['multiset',['http://en.cppreference.com/w/cpp/container/multiset.html',0,'std']]], + ['mutex_2149',['mutex',['http://en.cppreference.com/w/cpp/thread/mutex.html',0,'std']]] +]; diff --git a/search/classes_d.html b/search/classes_d.html new file mode 100644 index 000000000..e548fb3a8 --- /dev/null +++ b/search/classes_d.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_d.js b/search/classes_d.js new file mode 100644 index 000000000..eb35b60b2 --- /dev/null +++ b/search/classes_d.js @@ -0,0 +1,20 @@ +var searchData= +[ + ['nano_2150',['nano',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['nanoseconds_2151',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration.html',0,'std::chrono']]], + ['negate_2152',['negate',['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std']]], + ['negative_5fbinomial_5fdistribution_2153',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution.html',0,'std']]], + ['nested_5fexception_2154',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception.html',0,'std']]], + ['new_5fhandler_2155',['new_handler',['http://en.cppreference.com/w/cpp/memory/new/new_handler.html',0,'std']]], + ['node_2156',['Node',['../db/d8b/struct_node.html',1,'Node'],['../d5/da1/structnode.html',1,'node< Kind >']]], + ['node_3c_20type_20_3e_2157',['node< Type >',['../d5/da1/structnode.html',1,'']]], + ['normal_5fdistribution_2158',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution.html',0,'std']]], + ['not_5fequal_5fto_2159',['not_equal_to',['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std']]], + ['nothrow_5ft_2160',['nothrow_t',['http://en.cppreference.com/w/cpp/memory/new/nothrow_t.html',0,'std']]], + ['nullptr_5ft_2161',['nullptr_t',['http://en.cppreference.com/w/cpp/types/nullptr_t.html',0,'std']]], + ['num_5fget_2162',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get.html',0,'std']]], + ['num_5fput_2163',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put.html',0,'std']]], + ['numeric_5flimits_2164',['numeric_limits',['http://en.cppreference.com/w/cpp/types/numeric_limits.html',0,'std']]], + ['numpunct_2165',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct.html',0,'std']]], + ['numpunct_5fbyname_2166',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std']]] +]; diff --git a/search/classes_e.html b/search/classes_e.html new file mode 100644 index 000000000..1c4ddf9e4 --- /dev/null +++ b/search/classes_e.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_e.js b/search/classes_e.js new file mode 100644 index 000000000..8d44bbdbd --- /dev/null +++ b/search/classes_e.js @@ -0,0 +1,15 @@ +var searchData= +[ + ['ofstream_2167',['ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream.html',0,'std']]], + ['once_5fflag_2168',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std']]], + ['optional_2169',['optional',['http://en.cppreference.com/w/cpp/experimental/optional.html',0,'std::experimental']]], + ['ostream_2170',['ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream.html',0,'std']]], + ['ostream_5fiterator_2171',['ostream_iterator',['http://en.cppreference.com/w/cpp/iterator/ostream_iterator.html',0,'std']]], + ['ostreambuf_5fiterator_2172',['ostreambuf_iterator',['http://en.cppreference.com/w/cpp/iterator/ostreambuf_iterator.html',0,'std']]], + ['ostringstream_2173',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream.html',0,'std']]], + ['ostrstream_2174',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream.html',0,'std']]], + ['out_5fof_5frange_2175',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std']]], + ['output_5fiterator_5ftag_2176',['output_iterator_tag',['http://en.cppreference.com/w/cpp/iterator/iterator_tags.html',0,'std']]], + ['overflow_5ferror_2177',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std']]], + ['owner_5fless_2178',['owner_less',['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std']]] +]; diff --git a/search/classes_f.html b/search/classes_f.html new file mode 100644 index 000000000..fc6329168 --- /dev/null +++ b/search/classes_f.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/classes_f.js b/search/classes_f.js new file mode 100644 index 000000000..ce3be5b68 --- /dev/null +++ b/search/classes_f.js @@ -0,0 +1,20 @@ +var searchData= +[ + ['packaged_5ftask_2179',['packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task.html',0,'std']]], + ['pair_2180',['pair',['http://en.cppreference.com/w/cpp/utility/pair.html',0,'std']]], + ['pattern_2181',['pattern',['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct_byname::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_base::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::moneypunct::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_put::pattern'],['http://en.cppreference.com/w/cpp/locale/money_base.html',0,'std::money_get::pattern']]], + ['peta_2182',['peta',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['pico_2183',['pico',['http://en.cppreference.com/w/cpp/numeric/ratio/ratio.html',0,'std']]], + ['piecewise_5fconstant_5fdistribution_2184',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution.html',0,'std']]], + ['piecewise_5fconstruct_5ft_2185',['piecewise_construct_t',['http://en.cppreference.com/w/cpp/utility/piecewise_construct_t.html',0,'std']]], + ['piecewise_5flinear_5fdistribution_2186',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution.html',0,'std']]], + ['placeholders_2187',['placeholders',['http://en.cppreference.com/w/cpp/utility/functional/placeholders.html',0,'std']]], + ['plus_2188',['plus',['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std']]], + ['point_2189',['Point',['../d8/dc8/struct_point.html',1,'']]], + ['pointer_5fsafety_2190',['pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/pointer_safety.html',0,'std']]], + ['pointer_5ftraits_2191',['pointer_traits',['http://en.cppreference.com/w/cpp/memory/pointer_traits.html',0,'std']]], + ['poisson_5fdistribution_2192',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution.html',0,'std']]], + ['priority_5fqueue_2193',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue.html',0,'std']]], + ['promise_2194',['promise',['http://en.cppreference.com/w/cpp/thread/promise.html',0,'std']]], + ['ptrdiff_5ft_2195',['ptrdiff_t',['http://en.cppreference.com/w/cpp/types/ptrdiff_t.html',0,'std']]] +]; diff --git a/search/close.png b/search/close.png new file mode 100644 index 0000000000000000000000000000000000000000..9342d3dfeea7b7c4ee610987e717804b5a42ceb9 GIT binary patch literal 273 zcmV+s0q*{ZP)4(RlMby96)VwnbG{ zbe&}^BDn7x>$<{ck4zAK-=nT;=hHG)kmplIF${xqm8db3oX6wT3bvp`TE@m0cg;b) zBuSL}5?N7O(iZLdAlz@)b)Rd~DnSsSX&P5qC`XwuFwcAYLC+d2>+1(8on;wpt8QIC X2MT$R4iQDd00000NkvXXu0mjfia~GN literal 0 HcmV?d00001 diff --git a/search/defines_0.html b/search/defines_0.html new file mode 100644 index 000000000..54b9bc595 --- /dev/null +++ b/search/defines_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/defines_0.js b/search/defines_0.js new file mode 100644 index 000000000..86cb9c119 --- /dev/null +++ b/search/defines_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['_5ftarget_3922',['_target',['../dc/dfe/ternary__search_8cpp.html#a23ad617bfce1e7cf4591059c85c1a027',1,'ternary_search.cpp']]] +]; diff --git a/search/defines_1.html b/search/defines_1.html new file mode 100644 index 000000000..024d8be89 --- /dev/null +++ b/search/defines_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/defines_1.js b/search/defines_1.js new file mode 100644 index 000000000..dda62cd05 --- /dev/null +++ b/search/defines_1.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['absoluteprecision_3923',['absolutePrecision',['../dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc',1,'ternary_search.cpp']]], + ['accuracy_3924',['ACCURACY',['../da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689',1,'durand_kerner_roots.cpp']]] +]; diff --git a/search/defines_2.html b/search/defines_2.html new file mode 100644 index 000000000..9bc690997 --- /dev/null +++ b/search/defines_2.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/defines_2.js b/search/defines_2.js new file mode 100644 index 000000000..aa7a19359 --- /dev/null +++ b/search/defines_2.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['endl_3925',['endl',['../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258',1,'matrix_exponentiation.cpp']]] +]; diff --git a/search/defines_3.html b/search/defines_3.html new file mode 100644 index 000000000..7297f2e37 --- /dev/null +++ b/search/defines_3.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/defines_3.js b/search/defines_3.js new file mode 100644 index 000000000..987cfdb0b --- /dev/null +++ b/search/defines_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['hashmax_3926',['HASHMAX',['../d1/df3/hash__search_8cpp.html#a77c722016053a1d484aa177ce205b367',1,'hash_search.cpp']]] +]; diff --git a/search/defines_4.html b/search/defines_4.html new file mode 100644 index 000000000..9de0a4b6b --- /dev/null +++ b/search/defines_4.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/defines_4.js b/search/defines_4.js new file mode 100644 index 000000000..7bc26edb3 --- /dev/null +++ b/search/defines_4.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['lims_3927',['LIMS',['../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40',1,'qr_eigen_values.cpp']]], + ['ll_3928',['ll',['../d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba',1,'matrix_exponentiation.cpp']]] +]; diff --git a/search/defines_5.html b/search/defines_5.html new file mode 100644 index 000000000..e9052833b --- /dev/null +++ b/search/defines_5.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/defines_5.js b/search/defines_5.js new file mode 100644 index 000000000..149f414fc --- /dev/null +++ b/search/defines_5.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['max_3929',['MAX',['../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): power_for_huge_numbers.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): sieve_of_eratosthenes.cpp'],['../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): paranthesis_matching.cpp'],['../d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): hash_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326',1,'MAX(): ternary_search.cpp']]], + ['max_5fiterations_3930',['MAX_ITERATIONS',['../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS(): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS(): false_position.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14',1,'MAX_ITERATIONS(): newton_raphson_method.cpp']]], + ['max_5fnum_3931',['MAX_NUM',['../d9/d69/median__search_8cpp.html#a55bfdcfe7613d75fb48ec99c7bf4dd5e',1,'median_search.cpp']]], + ['min_5fdistance_3932',['MIN_DISTANCE',['../d4/def/kohonen__som__topology_8cpp.html#a549d41dcf9444ed7d6df1da3c73e7d16',1,'kohonen_som_topology.cpp']]] +]; diff --git a/search/defines_6.html b/search/defines_6.html new file mode 100644 index 000000000..73b166f0b --- /dev/null +++ b/search/defines_6.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/defines_6.js b/search/defines_6.js new file mode 100644 index 000000000..27ff65c69 --- /dev/null +++ b/search/defines_6.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['pb_3933',['pb',['../d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b',1,'matrix_exponentiation.cpp']]], + ['prime_3934',['PRIME',['../d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8',1,'rabin_karp.cpp']]] +]; diff --git a/search/files_0.html b/search/files_0.html new file mode 100644 index 000000000..182d7eb43 --- /dev/null +++ b/search/files_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_0.js b/search/files_0.js new file mode 100644 index 000000000..d87ed4d54 --- /dev/null +++ b/search/files_0.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['adaline_5flearning_2ecpp_2389',['adaline_learning.cpp',['../d5/db0/adaline__learning_8cpp.html',1,'']]], + ['addition_5frule_2ecpp_2390',['addition_rule.cpp',['../d6/d4a/addition__rule_8cpp.html',1,'']]], + ['avltree_2ecpp_2391',['avltree.cpp',['../d8/dee/avltree_8cpp.html',1,'']]] +]; diff --git a/search/files_1.html b/search/files_1.html new file mode 100644 index 000000000..9448113a1 --- /dev/null +++ b/search/files_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_1.js b/search/files_1.js new file mode 100644 index 000000000..88c2449ea --- /dev/null +++ b/search/files_1.js @@ -0,0 +1,13 @@ +var searchData= +[ + ['bayes_5ftheorem_2ecpp_2392',['bayes_theorem.cpp',['../d5/d67/bayes__theorem_8cpp.html',1,'']]], + ['binary_5fexponent_2ecpp_2393',['binary_exponent.cpp',['../de/dcf/binary__exponent_8cpp.html',1,'']]], + ['binary_5fsearch_2ecpp_2394',['binary_search.cpp',['../df/dd5/binary__search_8cpp.html',1,'']]], + ['binary_5fsearch_5ftree_2ecpp_2395',['binary_search_tree.cpp',['../d3/d26/binary__search__tree_8cpp.html',1,'']]], + ['binaryheap_2ecpp_2396',['binaryheap.cpp',['../de/dc3/binaryheap_8cpp.html',1,'']]], + ['binomial_5fdist_2ecpp_2397',['binomial_dist.cpp',['../d6/db0/binomial__dist_8cpp.html',1,'']]], + ['bisection_5fmethod_2ecpp_2398',['bisection_method.cpp',['../d7/d6a/bisection__method_8cpp.html',1,'']]], + ['brute_5fforce_5fstring_5fsearching_2ecpp_2399',['brute_force_string_searching.cpp',['../d3/d7d/brute__force__string__searching_8cpp.html',1,'']]], + ['bubble_5fsort_2ecpp_2400',['bubble_sort.cpp',['../d8/d13/bubble__sort_8cpp.html',1,'']]], + ['buzz_5fnumber_2ecpp_2401',['buzz_number.cpp',['../d1/d76/buzz__number_8cpp.html',1,'']]] +]; diff --git a/search/files_10.html b/search/files_10.html new file mode 100644 index 000000000..1adc7e5e8 --- /dev/null +++ b/search/files_10.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_10.js b/search/files_10.js new file mode 100644 index 000000000..67aec8c2f --- /dev/null +++ b/search/files_10.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['qr_5fdecompose_2eh_2456',['qr_decompose.h',['../d4/d68/qr__decompose_8h.html',1,'']]], + ['qr_5fdecomposition_2ecpp_2457',['qr_decomposition.cpp',['../d3/d24/qr__decomposition_8cpp.html',1,'']]], + ['qr_5feigen_5fvalues_2ecpp_2458',['qr_eigen_values.cpp',['../de/d75/qr__eigen__values_8cpp.html',1,'']]], + ['quick_5fsort_2ecpp_2459',['quick_sort.cpp',['../d1/d21/quick__sort_8cpp.html',1,'']]] +]; diff --git a/search/files_11.html b/search/files_11.html new file mode 100644 index 000000000..4c8b86306 --- /dev/null +++ b/search/files_11.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_11.js b/search/files_11.js new file mode 100644 index 000000000..9b1fb1fc0 --- /dev/null +++ b/search/files_11.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['rabin_5fkarp_2ecpp_2460',['rabin_karp.cpp',['../d6/dce/rabin__karp_8cpp.html',1,'']]], + ['realtime_5fstats_2ecpp_2461',['realtime_stats.cpp',['../d0/d08/realtime__stats_8cpp.html',1,'']]] +]; diff --git a/search/files_12.html b/search/files_12.html new file mode 100644 index 000000000..585c4309b --- /dev/null +++ b/search/files_12.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_12.js b/search/files_12.js new file mode 100644 index 000000000..857127f41 --- /dev/null +++ b/search/files_12.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['shell_5fsort2_2ecpp_2462',['shell_sort2.cpp',['../d4/d7a/shell__sort2_8cpp.html',1,'']]], + ['sieve_5fof_5feratosthenes_2ecpp_2463',['sieve_of_eratosthenes.cpp',['../d8/ddf/sieve__of__eratosthenes_8cpp.html',1,'']]], + ['smallest_5fcircle_2ecpp_2464',['smallest_circle.cpp',['../d0/d01/smallest__circle_8cpp.html',1,'']]], + ['sparse_5fmatrix_2ecpp_2465',['sparse_matrix.cpp',['../d3/d19/sparse__matrix_8cpp.html',1,'']]], + ['spiral_5fprint_2ecpp_2466',['spiral_print.cpp',['../db/d07/spiral__print_8cpp.html',1,'']]], + ['sqrt_5fdouble_2ecpp_2467',['sqrt_double.cpp',['../da/d24/sqrt__double_8cpp.html',1,'']]], + ['stairs_5fpattern_2ecpp_2468',['stairs_pattern.cpp',['../d5/def/stairs__pattern_8cpp.html',1,'']]], + ['string_5ffibonacci_2ecpp_2469',['string_fibonacci.cpp',['../de/d47/string__fibonacci_8cpp.html',1,'']]], + ['successive_5fapproximation_2ecpp_2470',['successive_approximation.cpp',['../df/dc8/successive__approximation_8cpp.html',1,'']]] +]; diff --git a/search/files_13.html b/search/files_13.html new file mode 100644 index 000000000..d2ac16979 --- /dev/null +++ b/search/files_13.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_13.js b/search/files_13.js new file mode 100644 index 000000000..f64463f36 --- /dev/null +++ b/search/files_13.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['ternary_5fsearch_2ecpp_2471',['ternary_search.cpp',['../dc/dfe/ternary__search_8cpp.html',1,'']]], + ['text_5fsearch_2ecpp_2472',['text_search.cpp',['../dc/db5/text__search_8cpp.html',1,'']]], + ['tower_5fof_5fhanoi_2ecpp_2473',['tower_of_hanoi.cpp',['../db/d3c/tower__of__hanoi_8cpp.html',1,'']]], + ['trie_5fmodern_2ecpp_2474',['trie_modern.cpp',['../dc/d93/trie__modern_8cpp.html',1,'']]] +]; diff --git a/search/files_14.html b/search/files_14.html new file mode 100644 index 000000000..8a65f99f8 --- /dev/null +++ b/search/files_14.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_14.js b/search/files_14.js new file mode 100644 index 000000000..175f379bf --- /dev/null +++ b/search/files_14.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['vector_5fimportant_5ffunctions_2ecpp_2475',['vector_important_functions.cpp',['../d3/d61/vector__important__functions_8cpp.html',1,'']]] +]; diff --git a/search/files_2.html b/search/files_2.html new file mode 100644 index 000000000..16c12b8c3 --- /dev/null +++ b/search/files_2.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_2.js b/search/files_2.js new file mode 100644 index 000000000..399b4b949 --- /dev/null +++ b/search/files_2.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['check_5fprime_2ecpp_2402',['check_prime.cpp',['../db/d93/check__prime_8cpp.html',1,'']]] +]; diff --git a/search/files_3.html b/search/files_3.html new file mode 100644 index 000000000..d1b79b97a --- /dev/null +++ b/search/files_3.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_3.js b/search/files_3.js new file mode 100644 index 000000000..6d79fe9b5 --- /dev/null +++ b/search/files_3.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['decimal_5fto_5fbinary_2ecpp_2403',['decimal_to_binary.cpp',['../df/d06/decimal__to__binary_8cpp.html',1,'']]], + ['decimal_5fto_5fhexadecimal_2ecpp_2404',['decimal_to_hexadecimal.cpp',['../da/de7/decimal__to__hexadecimal_8cpp.html',1,'']]], + ['decimal_5fto_5froman_5fnumeral_2ecpp_2405',['decimal_to_roman_numeral.cpp',['../de/d85/decimal__to__roman__numeral_8cpp.html',1,'']]], + ['double_5ffactorial_2ecpp_2406',['double_factorial.cpp',['../d7/d89/double__factorial_8cpp.html',1,'']]], + ['durand_5fkerner_5froots_2ecpp_2407',['durand_kerner_roots.cpp',['../da/df2/durand__kerner__roots_8cpp.html',1,'']]] +]; diff --git a/search/files_4.html b/search/files_4.html new file mode 100644 index 000000000..6c31a9d08 --- /dev/null +++ b/search/files_4.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_4.js b/search/files_4.js new file mode 100644 index 000000000..efb8cd2e5 --- /dev/null +++ b/search/files_4.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['eulers_5ftotient_5ffunction_2ecpp_2408',['eulers_totient_function.cpp',['../da/d23/eulers__totient__function_8cpp.html',1,'']]], + ['exponential_5fsearch_2ecpp_2409',['exponential_search.cpp',['../d8/d8a/exponential__search_8cpp.html',1,'']]], + ['extended_5feuclid_5falgorithm_2ecpp_2410',['extended_euclid_algorithm.cpp',['../d9/d5d/extended__euclid__algorithm_8cpp.html',1,'']]] +]; diff --git a/search/files_5.html b/search/files_5.html new file mode 100644 index 000000000..2ff640936 --- /dev/null +++ b/search/files_5.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_5.js b/search/files_5.js new file mode 100644 index 000000000..5144ecb69 --- /dev/null +++ b/search/files_5.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['factorial_2ecpp_2411',['factorial.cpp',['../d9/d00/factorial_8cpp.html',1,'']]], + ['false_5fposition_2ecpp_2412',['false_position.cpp',['../dd/d29/false__position_8cpp.html',1,'']]], + ['fast_5finterger_5finput_2ecpp_2413',['fast_interger_input.cpp',['../d4/de8/fast__interger__input_8cpp.html',1,'']]], + ['fast_5fpower_2ecpp_2414',['fast_power.cpp',['../d2/d0b/fast__power_8cpp.html',1,'']]], + ['fibonacci_2ecpp_2415',['fibonacci.cpp',['../d9/d89/fibonacci_8cpp.html',1,'']]], + ['fibonacci_5ffast_2ecpp_2416',['fibonacci_fast.cpp',['../d4/d32/fibonacci__fast_8cpp.html',1,'']]], + ['fibonacci_5flarge_2ecpp_2417',['fibonacci_large.cpp',['../de/de4/fibonacci__large_8cpp.html',1,'']]] +]; diff --git a/search/files_6.html b/search/files_6.html new file mode 100644 index 000000000..82e6890c1 --- /dev/null +++ b/search/files_6.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_6.js b/search/files_6.js new file mode 100644 index 000000000..3a1c8ead8 --- /dev/null +++ b/search/files_6.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['gaussian_5felimination_2ecpp_2418',['gaussian_elimination.cpp',['../d0/de2/gaussian__elimination_8cpp.html',1,'']]], + ['gcd_5fiterative_5feuclidean_2ecpp_2419',['gcd_iterative_euclidean.cpp',['../d4/da0/gcd__iterative__euclidean_8cpp.html',1,'']]], + ['gcd_5fof_5fn_5fnumbers_2ecpp_2420',['gcd_of_n_numbers.cpp',['../d1/d11/gcd__of__n__numbers_8cpp.html',1,'']]], + ['gcd_5frecursive_5feuclidean_2ecpp_2421',['gcd_recursive_euclidean.cpp',['../d4/d45/gcd__recursive__euclidean_8cpp.html',1,'']]] +]; diff --git a/search/files_7.html b/search/files_7.html new file mode 100644 index 000000000..7ce361d60 --- /dev/null +++ b/search/files_7.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_7.js b/search/files_7.js new file mode 100644 index 000000000..d7d71c0cd --- /dev/null +++ b/search/files_7.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['happy_5fnumber_2ecpp_2422',['happy_number.cpp',['../db/df3/happy__number_8cpp.html',1,'']]], + ['hash_5fsearch_2ecpp_2423',['hash_search.cpp',['../d1/df3/hash__search_8cpp.html',1,'']]] +]; diff --git a/search/files_8.html b/search/files_8.html new file mode 100644 index 000000000..49983b8de --- /dev/null +++ b/search/files_8.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_8.js b/search/files_8.js new file mode 100644 index 000000000..816d30561 --- /dev/null +++ b/search/files_8.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['interpolation_5fsearch_2ecpp_2424',['interpolation_search.cpp',['../d9/dd7/interpolation__search_8cpp.html',1,'']]], + ['interpolation_5fsearch2_2ecpp_2425',['interpolation_search2.cpp',['../df/d39/interpolation__search2_8cpp.html',1,'']]] +]; diff --git a/search/files_9.html b/search/files_9.html new file mode 100644 index 000000000..7cfea7e80 --- /dev/null +++ b/search/files_9.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_9.js b/search/files_9.js new file mode 100644 index 000000000..e550d9a74 --- /dev/null +++ b/search/files_9.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['jump_5fsearch_2ecpp_2426',['jump_search.cpp',['../d2/d22/jump__search_8cpp.html',1,'']]] +]; diff --git a/search/files_a.html b/search/files_a.html new file mode 100644 index 000000000..fe811baab --- /dev/null +++ b/search/files_a.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_a.js b/search/files_a.js new file mode 100644 index 000000000..0521f71cd --- /dev/null +++ b/search/files_a.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['knuth_5fmorris_5fpratt_2ecpp_2427',['knuth_morris_pratt.cpp',['../de/d6a/knuth__morris__pratt_8cpp.html',1,'']]], + ['kohonen_5fsom_5ftopology_2ecpp_2428',['kohonen_som_topology.cpp',['../d4/def/kohonen__som__topology_8cpp.html',1,'']]], + ['kohonen_5fsom_5ftrace_2ecpp_2429',['kohonen_som_trace.cpp',['../d9/d49/kohonen__som__trace_8cpp.html',1,'']]] +]; diff --git a/search/files_b.html b/search/files_b.html new file mode 100644 index 000000000..d6bdab86e --- /dev/null +++ b/search/files_b.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_b.js b/search/files_b.js new file mode 100644 index 000000000..9ad0c59d5 --- /dev/null +++ b/search/files_b.js @@ -0,0 +1,10 @@ +var searchData= +[ + ['large_5ffactorial_2ecpp_2430',['large_factorial.cpp',['../d6/d9d/large__factorial_8cpp.html',1,'']]], + ['large_5fnumber_2eh_2431',['large_number.h',['../d4/d86/large__number_8h.html',1,'']]], + ['least_5fcommon_5fmultiple_2ecpp_2432',['least_common_multiple.cpp',['../d4/d21/least__common__multiple_8cpp.html',1,'']]], + ['line_5fsegment_5fintersection_2ecpp_2433',['line_segment_intersection.cpp',['../d8/d6c/line__segment__intersection_8cpp.html',1,'']]], + ['linear_5fsearch_2ecpp_2434',['linear_search.cpp',['../d9/d02/linear__search_8cpp.html',1,'']]], + ['linkedlist_5fimplentation_5fusingarray_2ecpp_2435',['linkedlist_implentation_usingarray.cpp',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html',1,'']]], + ['lu_5fdecompose_2ecpp_2436',['lu_decompose.cpp',['../dd/d65/lu__decompose_8cpp.html',1,'']]] +]; diff --git a/search/files_c.html b/search/files_c.html new file mode 100644 index 000000000..20a22e943 --- /dev/null +++ b/search/files_c.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_c.js b/search/files_c.js new file mode 100644 index 000000000..185d857b5 --- /dev/null +++ b/search/files_c.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['matrix_5fexponentiation_2ecpp_2437',['matrix_exponentiation.cpp',['../d7/d35/matrix__exponentiation_8cpp.html',1,'']]], + ['median_5fsearch_2ecpp_2438',['median_search.cpp',['../d9/d69/median__search_8cpp.html',1,'']]], + ['modular_5finverse_5ffermat_5flittle_5ftheorem_2ecpp_2439',['modular_inverse_fermat_little_theorem.cpp',['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html',1,'']]] +]; diff --git a/search/files_d.html b/search/files_d.html new file mode 100644 index 000000000..82d215603 --- /dev/null +++ b/search/files_d.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_d.js b/search/files_d.js new file mode 100644 index 000000000..82eb0ebb0 --- /dev/null +++ b/search/files_d.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['newton_5fraphson_5fmethod_2ecpp_2440',['newton_raphson_method.cpp',['../de/dd3/newton__raphson__method_8cpp.html',1,'']]], + ['non_5frecursive_5fmerge_5fsort_2ecpp_2441',['non_recursive_merge_sort.cpp',['../d0/db6/non__recursive__merge__sort_8cpp.html',1,'']]], + ['number_5fof_5fpositive_5fdivisors_2ecpp_2442',['number_of_positive_divisors.cpp',['../d0/da2/number__of__positive__divisors_8cpp.html',1,'']]] +]; diff --git a/search/files_e.html b/search/files_e.html new file mode 100644 index 000000000..637cd5596 --- /dev/null +++ b/search/files_e.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_e.js b/search/files_e.js new file mode 100644 index 000000000..aff6d055a --- /dev/null +++ b/search/files_e.js @@ -0,0 +1,7 @@ +var searchData= +[ + ['ode_5fforward_5feuler_2ecpp_2443',['ode_forward_euler.cpp',['../db/dd3/ode__forward__euler_8cpp.html',1,'']]], + ['ode_5fmidpoint_5feuler_2ecpp_2444',['ode_midpoint_euler.cpp',['../d6/dd3/ode__midpoint__euler_8cpp.html',1,'']]], + ['ode_5fsemi_5fimplicit_5feuler_2ecpp_2445',['ode_semi_implicit_euler.cpp',['../d3/d06/ode__semi__implicit__euler_8cpp.html',1,'']]], + ['ordinary_5fleast_5fsquares_5fregressor_2ecpp_2446',['ordinary_least_squares_regressor.cpp',['../dc/d38/ordinary__least__squares__regressor_8cpp.html',1,'']]] +]; diff --git a/search/files_f.html b/search/files_f.html new file mode 100644 index 000000000..ac88a76d2 --- /dev/null +++ b/search/files_f.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/files_f.js b/search/files_f.js new file mode 100644 index 000000000..018fb07ef --- /dev/null +++ b/search/files_f.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['palindrome_5fof_5fnumber_2ecpp_2447',['palindrome_of_number.cpp',['../da/d9a/palindrome__of__number_8cpp.html',1,'']]], + ['paranthesis_5fmatching_2ecpp_2448',['paranthesis_matching.cpp',['../dc/dc5/paranthesis__matching_8cpp.html',1,'']]], + ['pascal_5ftriangle_2ecpp_2449',['pascal_triangle.cpp',['../dc/d1a/pascal__triangle_8cpp.html',1,'']]], + ['poisson_5fdist_2ecpp_2450',['poisson_dist.cpp',['../d9/d24/poisson__dist_8cpp.html',1,'']]], + ['power_5ffor_5fhuge_5fnumbers_2ecpp_2451',['power_for_huge_numbers.cpp',['../df/def/power__for__huge__numbers_8cpp.html',1,'']]], + ['primality_5ftest_2ecpp_2452',['primality_test.cpp',['../da/d7b/primality__test_8cpp.html',1,'']]], + ['prime_5ffactorization_2ecpp_2453',['prime_factorization.cpp',['../db/d0d/prime__factorization_8cpp.html',1,'']]], + ['prime_5fnumbers_2ecpp_2454',['prime_numbers.cpp',['../de/d9b/prime__numbers_8cpp.html',1,'']]], + ['primes_5fup_5fto_5fbillion_2ecpp_2455',['primes_up_to_billion.cpp',['../d4/d9c/primes__up__to__billion_8cpp.html',1,'']]] +]; diff --git a/search/functions_0.html b/search/functions_0.html new file mode 100644 index 000000000..4fcbb9cf8 --- /dev/null +++ b/search/functions_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_0.js b/search/functions_0.js new file mode 100644 index 000000000..edea8effe --- /dev/null +++ b/search/functions_0.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['_5fexit_2476',['_Exit',['http://en.cppreference.com/w/cpp/utility/program/_Exit.html',0,'std']]], + ['_5frandom_2477',['_random',['../d9/d66/group__machine__learning.html#gaf5ce14f026d6d231bef29161bac2b485',1,'kohonen_som_topology.cpp']]] +]; diff --git a/search/functions_1.html b/search/functions_1.html new file mode 100644 index 000000000..9b0e1f0f4 --- /dev/null +++ b/search/functions_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_1.js b/search/functions_1.js new file mode 100644 index 000000000..eea6bfbcf --- /dev/null +++ b/search/functions_1.js @@ -0,0 +1,77 @@ +var searchData= +[ + ['a_2478',['a',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::a()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::a()']]], + ['ab_2479',['ab',['../d7/d35/matrix__exponentiation_8cpp.html#a8bcf0bfddddfd7f6d0848703632d795d',1,'matrix_exponentiation.cpp']]], + ['abort_2480',['abort',['http://en.cppreference.com/w/cpp/utility/program/abort.html',0,'std']]], + ['abs_28float_29_2481',['abs(float)',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]], + ['abs_28int_29_2482',['abs(int)',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['accumulate_2483',['accumulate',['http://en.cppreference.com/w/cpp/algorithm/accumulate.html',0,'std']]], + ['acos_2484',['acos',['http://en.cppreference.com/w/cpp/numeric/math/acos.html',0,'std']]], + ['acosh_2485',['acosh',['http://en.cppreference.com/w/cpp/numeric/math/acosh.html',0,'std']]], + ['adaline_2486',['adaline',['../d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c',1,'machine_learning::adaline']]], + ['add_2487',['add',['../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35',1,'string_fibonacci.cpp']]], + ['add_5fdigit_2488',['add_digit',['../db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615',1,'large_number']]], + ['addedge_2489',['addEdge',['../da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5',1,'Graph::addEdge(Edge const &edge)'],['../da/d9a/class_graph.html#ac85c63bcca4764a621f9f8609a8e5910',1,'Graph::addEdge(unsigned int source, unsigned int destination)']]], + ['addition_5frule_5fdependent_2490',['addition_rule_dependent',['../d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0',1,'addition_rule.cpp']]], + ['addition_5frule_5findependent_2491',['addition_rule_independent',['../d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d',1,'addition_rule.cpp']]], + ['address_2492',['address',['http://en.cppreference.com/w/cpp/memory/allocator/address.html',0,'std::allocator']]], + ['addressof_2493',['addressof',['http://en.cppreference.com/w/cpp/memory/addressof.html',0,'std']]], + ['addvertices_2494',['addVertices',['../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413',1,'Graph']]], + ['adjacent_5fdifference_2495',['adjacent_difference',['http://en.cppreference.com/w/cpp/algorithm/adjacent_difference.html',0,'std']]], + ['adjacent_5ffind_2496',['adjacent_find',['http://en.cppreference.com/w/cpp/algorithm/adjacent_find.html',0,'std']]], + ['advance_2497',['advance',['http://en.cppreference.com/w/cpp/iterator/advance.html',0,'std']]], + ['align_2498',['align',['http://en.cppreference.com/w/cpp/memory/align.html',0,'std']]], + ['all_2499',['all',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['all_5fof_2500',['all_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['allocate_2501',['allocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/allocate.html',0,'std::allocator_traits::allocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/allocate.html',0,'std::allocator::allocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/allocate.html',0,'std::scoped_allocator_adaptor::allocate()']]], + ['allocate_5fshared_2502',['allocate_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/allocate_shared.html',0,'std']]], + ['allocator_2503',['allocator',['http://en.cppreference.com/w/cpp/memory/allocator/allocator.html',0,'std::allocator']]], + ['alpha_2504',['alpha',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], + ['always_5fnoconv_2505',['always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::always_noconv()']]], + ['ans_2506',['ans',['../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa',1,'matrix_exponentiation.cpp']]], + ['any_2507',['any',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['any_5fof_2508',['any_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['append_2509',['append',['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::basic_string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::wstring::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u16string::append()'],['http://en.cppreference.com/w/cpp/string/basic_string/append.html',0,'std::u32string::append()']]], + ['asctime_2510',['asctime',['http://en.cppreference.com/w/cpp/chrono/c/asctime.html',0,'std']]], + ['asin_2511',['asin',['http://en.cppreference.com/w/cpp/numeric/math/asin.html',0,'std']]], + ['asinh_2512',['asinh',['http://en.cppreference.com/w/cpp/numeric/math/asinh.html',0,'std']]], + ['assign_2513',['assign',['http://en.cppreference.com/w/cpp/container/vector/assign.html',0,'std::vector::assign()'],['http://en.cppreference.com/w/cpp/string/char_traits/assign.html',0,'std::char_traits::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::string::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::basic_regex::assign()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/assign.html',0,'std::wregex::assign()'],['http://en.cppreference.com/w/cpp/container/forward_list/assign.html',0,'std::forward_list::assign()'],['http://en.cppreference.com/w/cpp/error/error_code/assign.html',0,'std::error_code::assign()'],['http://en.cppreference.com/w/cpp/container/deque/assign.html',0,'std::deque::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::basic_string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::wstring::assign()'],['http://en.cppreference.com/w/cpp/utility/functional/function/assign.html',0,'std::function::assign()'],['http://en.cppreference.com/w/cpp/error/error_condition/assign.html',0,'std::error_condition::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u16string::assign()'],['http://en.cppreference.com/w/cpp/string/basic_string/assign.html',0,'std::u32string::assign()'],['http://en.cppreference.com/w/cpp/container/list/assign.html',0,'std::list::assign()']]], + ['async_2514',['async',['http://en.cppreference.com/w/cpp/thread/async.html',0,'std']]], + ['at_2515',['at',['http://en.cppreference.com/w/cpp/container/dynarray/at.html',0,'std::dynarray::at()'],['http://en.cppreference.com/w/cpp/container/vector/at.html',0,'std::vector::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::string::at()'],['http://en.cppreference.com/w/cpp/container/unordered_map/at.html',0,'std::unordered_map::at()'],['http://en.cppreference.com/w/cpp/container/deque/at.html',0,'std::deque::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::basic_string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::wstring::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u16string::at()'],['http://en.cppreference.com/w/cpp/string/basic_string/at.html',0,'std::u32string::at()'],['http://en.cppreference.com/w/cpp/container/map/at.html',0,'std::map::at()'],['http://en.cppreference.com/w/cpp/container/array/at.html',0,'std::array::at()']]], + ['at_5fquick_5fexit_2516',['at_quick_exit',['http://en.cppreference.com/w/cpp/utility/program/at_quick_exit.html',0,'std']]], + ['atan_2517',['atan',['http://en.cppreference.com/w/cpp/numeric/math/atan.html',0,'std']]], + ['atan2_2518',['atan2',['http://en.cppreference.com/w/cpp/numeric/math/atan2.html',0,'std']]], + ['atanh_2519',['atanh',['http://en.cppreference.com/w/cpp/numeric/math/atanh.html',0,'std']]], + ['atexit_2520',['atexit',['http://en.cppreference.com/w/cpp/utility/program/atexit.html',0,'std']]], + ['atof_2521',['atof',['http://en.cppreference.com/w/cpp/string/byte/atof.html',0,'std']]], + ['atoi_2522',['atoi',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atol_2523',['atol',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atoll_2524',['atoll',['http://en.cppreference.com/w/cpp/string/byte/atoi.html',0,'std']]], + ['atomic_2525',['atomic',['http://en.cppreference.com/w/cpp/atomic/atomic/atomic.html',0,'std::atomic']]], + ['atomic_5fcompare_5fexchange_5fstrong_2526',['atomic_compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fstrong_5fexplicit_2527',['atomic_compare_exchange_strong_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fweak_2528',['atomic_compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fcompare_5fexchange_5fweak_5fexplicit_2529',['atomic_compare_exchange_weak_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_compare_exchange.html',0,'std']]], + ['atomic_5fexchange_2530',['atomic_exchange',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]], + ['atomic_5fexchange_5fexplicit_2531',['atomic_exchange_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_exchange.html',0,'std']]], + ['atomic_5ffetch_5fadd_2532',['atomic_fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]], + ['atomic_5ffetch_5fadd_5fexplicit_2533',['atomic_fetch_add_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_add.html',0,'std']]], + ['atomic_5ffetch_5fand_2534',['atomic_fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fand_5fexplicit_2535',['atomic_fetch_and_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5for_2536',['atomic_fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]], + ['atomic_5ffetch_5for_5fexplicit_2537',['atomic_fetch_or_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_or.html',0,'std']]], + ['atomic_5ffetch_5fsub_2538',['atomic_fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fsub_5fexplicit_2539',['atomic_fetch_sub_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_sub.html',0,'std']]], + ['atomic_5ffetch_5fxor_2540',['atomic_fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]], + ['atomic_5ffetch_5fxor_5fexplicit_2541',['atomic_fetch_xor_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_fetch_xor.html',0,'std']]], + ['atomic_5fflag_2542',['atomic_flag',['http://en.cppreference.com/w/cpp/atomic/atomic_flag/atomic_flag.html',0,'std::atomic_flag']]], + ['atomic_5finit_2543',['atomic_init',['http://en.cppreference.com/w/cpp/atomic/atomic_init.html',0,'std']]], + ['atomic_5fis_5flock_5ffree_2544',['atomic_is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic_is_lock_free.html',0,'std']]], + ['atomic_5fload_2545',['atomic_load',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]], + ['atomic_5fload_5fexplicit_2546',['atomic_load_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_load.html',0,'std']]], + ['atomic_5fsignal_5ffence_2547',['atomic_signal_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_signal_fence.html',0,'std']]], + ['atomic_5fstore_2548',['atomic_store',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], + ['atomic_5fstore_5fexplicit_2549',['atomic_store_explicit',['http://en.cppreference.com/w/cpp/atomic/atomic_store.html',0,'std']]], + ['atomic_5fthread_5ffence_2550',['atomic_thread_fence',['http://en.cppreference.com/w/cpp/atomic/atomic_thread_fence.html',0,'std']]], + ['auto_5fptr_2551',['auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr/auto_ptr.html',0,'std::auto_ptr']]] +]; diff --git a/search/functions_10.html b/search/functions_10.html new file mode 100644 index 000000000..7a7a44490 --- /dev/null +++ b/search/functions_10.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_10.js b/search/functions_10.js new file mode 100644 index 000000000..0eebd4202 --- /dev/null +++ b/search/functions_10.js @@ -0,0 +1,74 @@ +var searchData= +[ + ['p_3272',['p',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/p.html',0,'std::bernoulli_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/p.html',0,'std::geometric_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution::p()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution::p()']]], + ['packaged_5ftask_3273',['packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task/packaged_task.html',0,'std::packaged_task']]], + ['pair_3274',['pair',['http://en.cppreference.com/w/cpp/utility/pair/pair.html',0,'std::pair']]], + ['param_3275',['param',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/param.html',0,'std::student_t_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/param.html',0,'std::extreme_value_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/param.html',0,'std::lognormal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/param.html',0,'std::discrete_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/param.html',0,'std::piecewise_constant_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/param.html',0,'std::poisson_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/param.html',0,'std::bernoulli_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/param.html',0,'std::exponential_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/param.html',0,'std::uniform_real_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/param.html',0,'std::geometric_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/param.html',0,'std::normal_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/param.html',0,'std::weibull_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/param.html',0,'std::negative_binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/param.html',0,'std::chi_squared_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/param.html',0,'std::piecewise_linear_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/param.html',0,'std::uniform_int_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/param.html',0,'std::fisher_f_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/param.html',0,'std::seed_seq::param()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/param.html',0,'std::gamma_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/param.html',0,'std::binomial_distribution::param()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/param.html',0,'std::cauchy_distribution::param()']]], + ['partial_5fsort_3276',['partial_sort',['http://en.cppreference.com/w/cpp/algorithm/partial_sort.html',0,'std']]], + ['partial_5fsort_5fcopy_3277',['partial_sort_copy',['http://en.cppreference.com/w/cpp/algorithm/partial_sort_copy.html',0,'std']]], + ['partial_5fsum_3278',['partial_sum',['http://en.cppreference.com/w/cpp/algorithm/partial_sum.html',0,'std']]], + ['partition_3279',['partition',['http://en.cppreference.com/w/cpp/algorithm/partition.html',0,'std::partition()'],['../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e',1,'sorting::partition()']]], + ['partition_5fcopy_3280',['partition_copy',['http://en.cppreference.com/w/cpp/algorithm/partition_copy.html',0,'std']]], + ['partition_5fpoint_3281',['partition_point',['http://en.cppreference.com/w/cpp/algorithm/partition_point.html',0,'std']]], + ['pascal_5ftriangle_3282',['pascal_triangle',['../dc/d1a/pascal__triangle_8cpp.html#afd3f52dd56ddedbf7af5d26a202a199e',1,'pascal_triangle.cpp']]], + ['pbackfail_3283',['pbackfail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wfilebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::wstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::strstreambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_stringbuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::basic_streambuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::filebuf::pbackfail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbackfail.html',0,'std::streambuf::pbackfail()']]], + ['pbase_3284',['pbase',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pbase()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pbase()']]], + ['pbump_3285',['pbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wfilebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::wstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::strstreambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_stringbuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::basic_streambuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::filebuf::pbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pbump.html',0,'std::streambuf::pbump()']]], + ['pcount_3286',['pcount',['http://en.cppreference.com/w/cpp/io/strstreambuf/pcount.html',0,'std::strstreambuf::pcount()'],['http://en.cppreference.com/w/cpp/io/strstream/pcount.html',0,'std::strstream::pcount()'],['http://en.cppreference.com/w/cpp/io/ostrstream/pcount.html',0,'std::ostrstream::pcount()']]], + ['peek_3287',['peek',['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_fstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::strstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_stringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istrstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wiostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_ifstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::istream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wfstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::basic_iostream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wstringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::wistringstream::peek()'],['http://en.cppreference.com/w/cpp/io/basic_istream/peek.html',0,'std::ifstream::peek()']]], + ['perror_3288',['perror',['http://en.cppreference.com/w/cpp/io/c/perror.html',0,'std']]], + ['phifunction_3289',['phiFunction',['../da/d23/eulers__totient__function_8cpp.html#a35e4874a3e1d67eb708dc57944c8aea0',1,'eulers_totient_function.cpp']]], + ['piecewise_5fconstant_5fdistribution_3290',['piecewise_constant_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/piecewise_constant_distribution.html',0,'std::piecewise_constant_distribution']]], + ['piecewise_5flinear_5fdistribution_3291',['piecewise_linear_distribution',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/piecewise_linear_distribution.html',0,'std::piecewise_linear_distribution']]], + ['point_3292',['Point',['../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a',1,'Point']]], + ['pointer_5fto_3293',['pointer_to',['http://en.cppreference.com/w/cpp/memory/pointer_traits/pointer_to.html',0,'std::pointer_traits']]], + ['pointincircle_3294',['PointInCircle',['../d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad',1,'smallest_circle.cpp']]], + ['poisson_5fdistribution_3295',['poisson_distribution',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/poisson_distribution.html',0,'std::poisson_distribution']]], + ['poisson_5fexpected_3296',['poisson_expected',['../d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71',1,'poisson_dist.cpp']]], + ['poisson_5frange_5fsuccesses_3297',['poisson_range_successes',['../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a',1,'poisson_dist.cpp']]], + ['poisson_5frate_3298',['poisson_rate',['../d9/d24/poisson__dist_8cpp.html#ac217ab9a06291f360d816700a6958ca8',1,'poisson_dist.cpp']]], + ['poisson_5fx_5fsuccesses_3299',['poisson_x_successes',['../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1',1,'poisson_dist.cpp']]], + ['poly_5ffunction_3300',['poly_function',['../da/df2/durand__kerner__roots_8cpp.html#a51637ff89e55ca749993d3e84b95d153',1,'durand_kerner_roots.cpp']]], + ['pop_3301',['pop',['http://en.cppreference.com/w/cpp/container/stack/pop.html',0,'std::stack::pop()'],['http://en.cppreference.com/w/cpp/container/queue/pop.html',0,'std::queue::pop()'],['http://en.cppreference.com/w/cpp/container/priority_queue/pop.html',0,'std::priority_queue::pop()'],['../d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc',1,'stack::pop()'],['../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664',1,'pop(): paranthesis_matching.cpp']]], + ['pop_5fback_3302',['pop_back',['http://en.cppreference.com/w/cpp/container/vector/pop_back.html',0,'std::vector::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::string::pop_back()'],['http://en.cppreference.com/w/cpp/container/deque/pop_back.html',0,'std::deque::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::basic_string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::wstring::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u16string::pop_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/pop_back.html',0,'std::u32string::pop_back()'],['http://en.cppreference.com/w/cpp/container/list/pop_back.html',0,'std::list::pop_back()']]], + ['pop_5ffront_3303',['pop_front',['http://en.cppreference.com/w/cpp/container/forward_list/pop_front.html',0,'std::forward_list::pop_front()'],['http://en.cppreference.com/w/cpp/container/deque/pop_front.html',0,'std::deque::pop_front()'],['http://en.cppreference.com/w/cpp/container/list/pop_front.html',0,'std::list::pop_front()']]], + ['pop_5fheap_3304',['pop_heap',['http://en.cppreference.com/w/cpp/algorithm/pop_heap.html',0,'std']]], + ['pos_5fformat_3305',['pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::pos_format()']]], + ['position_3306',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]], + ['positive_5fsign_3307',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()']]], + ['pow_3308',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]], + ['power_3309',['power',['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a5769b745458157ef2679949155684f3b',1,'power(const vector< vector< ll >> &A, ll p): matrix_exponentiation.cpp']]], + ['pptr_3310',['pptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::pptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::pptr()']]], + ['precision_3311',['precision',['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ios::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_fstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ios_base::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::strstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_stringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wostringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wiostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_ifstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::istream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ostrstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wfstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::basic_iostream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wofstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wstringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::wistringstream::precision()'],['http://en.cppreference.com/w/cpp/io/ios_base/precision.html',0,'std::ifstream::precision()']]], + ['predict_3312',['predict',['../d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3',1,'machine_learning::adaline']]], + ['predict_5fols_5fregressor_3313',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4bcaaf41c66da4d3a471dacef133def7',1,'ordinary_least_squares_regressor.cpp']]], + ['prefix_3314',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]], + ['prev_3315',['prev',['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std']]], + ['prev_5fpermutation_3316',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]], + ['prime_5ffactorization_3317',['prime_factorization',['../db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46',1,'prime_factorization.cpp']]], + ['primes_3318',['primes',['../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3',1,'prime_numbers.cpp']]], + ['print_3319',['print',['../d8/ddf/sieve__of__eratosthenes_8cpp.html#af50a5c87d27cfd3462745b37fb9b0f46',1,'sieve_of_eratosthenes.cpp']]], + ['printf_3320',['printf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['priority_5fqueue_3321',['priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/priority_queue.html',0,'std::priority_queue']]], + ['probabilities_3322',['probabilities',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/probabilities.html',0,'std::discrete_distribution']]], + ['problem_3323',['problem',['../db/dd3/ode__forward__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#abaeae8f62a018d197f0187a1c80a90fe',1,'problem(const double &x, std::valarray< double > *y, std::valarray< double > *dy): ode_semi_implicit_euler.cpp']]], + ['promise_3324',['promise',['http://en.cppreference.com/w/cpp/thread/promise/promise.html',0,'std::promise']]], + ['pubimbue_3325',['pubimbue',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::pubimbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::pubimbue()']]], + ['pubseekoff_3326',['pubseekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::pubseekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::pubseekoff()']]], + ['pubseekpos_3327',['pubseekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::pubseekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::pubseekpos()']]], + ['pubsetbuf_3328',['pubsetbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::pubsetbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::pubsetbuf()']]], + ['pubsync_3329',['pubsync',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::pubsync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::pubsync()']]], + ['push_3330',['push',['http://en.cppreference.com/w/cpp/container/stack/push.html',0,'std::stack::push()'],['http://en.cppreference.com/w/cpp/container/queue/push.html',0,'std::queue::push()'],['http://en.cppreference.com/w/cpp/container/priority_queue/push.html',0,'std::priority_queue::push()'],['../d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d',1,'stack::push()'],['../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095',1,'push(): paranthesis_matching.cpp']]], + ['push_5fback_3331',['push_back',['http://en.cppreference.com/w/cpp/container/vector/push_back.html',0,'std::vector::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::string::push_back()'],['http://en.cppreference.com/w/cpp/container/deque/push_back.html',0,'std::deque::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::basic_string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::wstring::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u16string::push_back()'],['http://en.cppreference.com/w/cpp/string/basic_string/push_back.html',0,'std::u32string::push_back()'],['http://en.cppreference.com/w/cpp/container/list/push_back.html',0,'std::list::push_back()']]], + ['push_5ffront_3332',['push_front',['http://en.cppreference.com/w/cpp/container/forward_list/push_front.html',0,'std::forward_list::push_front()'],['http://en.cppreference.com/w/cpp/container/deque/push_front.html',0,'std::deque::push_front()'],['http://en.cppreference.com/w/cpp/container/list/push_front.html',0,'std::list::push_front()']]], + ['push_5fheap_3333',['push_heap',['http://en.cppreference.com/w/cpp/algorithm/push_heap.html',0,'std']]], + ['put_3334',['put',['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_fstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::stringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::strstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_stringstream::put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wostringstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_ostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wiostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ofstream::put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::ostrstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wfstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::basic_iostream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wofstream::put()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/put.html',0,'std::wstringstream::put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::put()']]], + ['put_5fmoney_3335',['put_money',['http://en.cppreference.com/w/cpp/io/manip/put_money.html',0,'std']]], + ['put_5ftime_3336',['put_time',['http://en.cppreference.com/w/cpp/io/manip/put_time.html',0,'std']]], + ['putback_3337',['putback',['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_fstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::strstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_stringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istrstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wiostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_ifstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::istream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wfstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::basic_iostream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wstringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::wistringstream::putback()'],['http://en.cppreference.com/w/cpp/io/basic_istream/putback.html',0,'std::ifstream::putback()']]], + ['putc_3338',['putc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], + ['putchar_3339',['putchar',['http://en.cppreference.com/w/cpp/io/c/putchar.html',0,'std']]], + ['puts_3340',['puts',['http://en.cppreference.com/w/cpp/io/c/puts.html',0,'std']]], + ['putwchar_3341',['putwchar',['http://en.cppreference.com/w/cpp/io/c/putwchar.html',0,'std']]], + ['pword_3342',['pword',['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ios::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_fstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ios_base::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::strstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_stringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wostringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wiostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_ifstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::istream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ostrstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wfstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::basic_iostream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wofstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wstringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::wistringstream::pword()'],['http://en.cppreference.com/w/cpp/io/ios_base/pword.html',0,'std::ifstream::pword()']]] +]; diff --git a/search/functions_11.html b/search/functions_11.html new file mode 100644 index 000000000..e77ce3b2f --- /dev/null +++ b/search/functions_11.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_11.js b/search/functions_11.js new file mode 100644 index 000000000..4727f0784 --- /dev/null +++ b/search/functions_11.js @@ -0,0 +1,9 @@ +var searchData= +[ + ['qr_5fdecompose_3343',['qr_decompose',['../d2/d3b/namespaceqr__algorithm.html#ab1ac74497ffb2101040cc1efe3546de8',1,'qr_algorithm']]], + ['qsort_3344',['qsort',['http://en.cppreference.com/w/cpp/algorithm/qsort.html',0,'std']]], + ['queue_3345',['queue',['http://en.cppreference.com/w/cpp/container/queue/queue.html',0,'std::queue::queue()'],['../d2/d36/structqueue.html#a21381ee7f95daae0332665914780e970',1,'queue::queue()']]], + ['quick_5fexit_3346',['quick_exit',['http://en.cppreference.com/w/cpp/utility/program/quick_exit.html',0,'std']]], + ['quicksort_3347',['quickSort',['../d5/d91/namespacesorting.html#a50b66a1c652291b9a346ec7342967178',1,'sorting']]], + ['quiet_5fnan_3348',['quiet_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/quiet_NaN.html',0,'std::numeric_limits']]] +]; diff --git a/search/functions_12.html b/search/functions_12.html new file mode 100644 index 000000000..f6419149a --- /dev/null +++ b/search/functions_12.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_12.js b/search/functions_12.js new file mode 100644 index 000000000..08f4688c8 --- /dev/null +++ b/search/functions_12.js @@ -0,0 +1,72 @@ +var searchData= +[ + ['rabin_5fkarp_3349',['rabin_karp',['../d9/d03/namespacestring__search.html#a21c673d56cbf67b1d2ee4d869185b7d9',1,'string_search']]], + ['raise_3350',['raise',['http://en.cppreference.com/w/cpp/utility/program/raise.html',0,'std']]], + ['rand_3351',['rand',['http://en.cppreference.com/w/cpp/numeric/random/rand.html',0,'std']]], + ['random_5fdevice_3352',['random_device',['http://en.cppreference.com/w/cpp/numeric/random/random_device/random_device.html',0,'std::random_device']]], + ['random_5fshuffle_3353',['random_shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]], + ['range_5ferror_3354',['range_error',['http://en.cppreference.com/w/cpp/error/range_error.html',0,'std::range_error']]], + ['ranlux24_3355',['ranlux24',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux24']]], + ['ranlux24_5fbase_3356',['ranlux24_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux24_base']]], + ['ranlux48_3357',['ranlux48',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::ranlux48']]], + ['ranlux48_5fbase_3358',['ranlux48_base',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::ranlux48_base']]], + ['raw_5fstorage_5fiterator_3359',['raw_storage_iterator',['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/raw_storage_iterator.html',0,'std::raw_storage_iterator']]], + ['rbegin_3360',['rbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::rbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::rbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::rbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::rbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::rbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::rbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::rbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::rbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::rbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::rbegin()']]], + ['rdbuf_3361',['rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/rdbuf.html',0,'std::wbuffer_convert::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ios::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_fstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::strstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_stringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wostringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wiostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_ifstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::istream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ostrstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wfstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::basic_iostream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wofstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wstringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::wistringstream::rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdbuf.html',0,'std::ifstream::rdbuf()']]], + ['rdstate_3362',['rdstate',['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ios::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_fstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::strstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_stringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wostringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wiostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_ifstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::istream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ostrstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wfstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::basic_iostream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wofstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wstringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::wistringstream::rdstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/rdstate.html',0,'std::ifstream::rdstate()']]], + ['read_3363',['read',['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_fstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::strstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_stringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istrstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wiostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_ifstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::istream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wfstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::basic_iostream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wstringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::wistringstream::read()'],['http://en.cppreference.com/w/cpp/io/basic_istream/read.html',0,'std::ifstream::read()']]], + ['readsome_3364',['readsome',['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_fstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::strstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_stringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istrstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wiostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_ifstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::istream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wfstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::basic_iostream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wstringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::wistringstream::readsome()'],['http://en.cppreference.com/w/cpp/io/basic_istream/readsome.html',0,'std::ifstream::readsome()']]], + ['ready_3365',['ready',['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::match_results::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wsmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::smatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::wcmatch::ready()'],['http://en.cppreference.com/w/cpp/regex/match_results/ready.html',0,'std::cmatch::ready()']]], + ['real_3366',['real',['http://en.cppreference.com/w/cpp/numeric/complex/real.html',0,'std::complex']]], + ['realloc_3367',['realloc',['http://en.cppreference.com/w/cpp/memory/c/realloc.html',0,'std']]], + ['rec_5fternary_5fsearch_3368',['rec_ternary_search',['../dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead',1,'ternary_search.cpp']]], + ['recalculate_5fhash_3369',['recalculate_hash',['../d9/d03/namespacestring__search.html#aed769d565b705a9b3e0eb1ec74088893',1,'string_search']]], + ['recursive_5fmutex_3370',['recursive_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_mutex/recursive_mutex.html',0,'std::recursive_mutex']]], + ['recursive_5ftimed_5fmutex_3371',['recursive_timed_mutex',['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/recursive_timed_mutex.html',0,'std::recursive_timed_mutex']]], + ['ref_3372',['ref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], + ['reference_5fwrapper_3373',['reference_wrapper',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/reference_wrapper.html',0,'std::reference_wrapper']]], + ['regex_3374',['regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::regex']]], + ['regex_5ferror_3375',['regex_error',['http://en.cppreference.com/w/cpp/regex/regex_error/regex_error.html',0,'std::regex_error']]], + ['regex_5fiterator_3376',['regex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::regex_iterator']]], + ['regex_5fmatch_3377',['regex_match',['http://en.cppreference.com/w/cpp/regex/regex_match.html',0,'std']]], + ['regex_5freplace_3378',['regex_replace',['http://en.cppreference.com/w/cpp/regex/regex_replace.html',0,'std']]], + ['regex_5fsearch_3379',['regex_search',['http://en.cppreference.com/w/cpp/regex/regex_search.html',0,'std']]], + ['regex_5ftoken_5fiterator_3380',['regex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::regex_token_iterator']]], + ['regex_5ftraits_3381',['regex_traits',['http://en.cppreference.com/w/cpp/regex/regex_traits/regex_traits.html',0,'std::regex_traits']]], + ['register_5fcallback_3382',['register_callback',['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ios::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_fstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ios_base::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::strstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_stringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wostringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wiostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_ifstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::istream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ostrstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wfstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::basic_iostream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wofstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wstringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::wistringstream::register_callback()'],['http://en.cppreference.com/w/cpp/io/ios_base/register_callback.html',0,'std::ifstream::register_callback()']]], + ['rehash_3383',['rehash',['http://en.cppreference.com/w/cpp/container/unordered_map/rehash.html',0,'std::unordered_map::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/rehash.html',0,'std::unordered_multimap::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/rehash.html',0,'std::unordered_multiset::rehash()'],['http://en.cppreference.com/w/cpp/container/unordered_set/rehash.html',0,'std::unordered_set::rehash()']]], + ['release_3384',['release',['http://en.cppreference.com/w/cpp/thread/unique_lock/release.html',0,'std::unique_lock::release()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/release.html',0,'std::unique_ptr::release()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/release.html',0,'std::shared_lock::release()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/release.html',0,'std::auto_ptr::release()']]], + ['remainder_3385',['remainder',['http://en.cppreference.com/w/cpp/numeric/math/remainder.html',0,'std']]], + ['remove_3386',['remove',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove()']]], + ['remove_5fcopy_3387',['remove_copy',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], + ['remove_5fcopy_5fif_3388',['remove_copy_if',['http://en.cppreference.com/w/cpp/algorithm/remove_copy.html',0,'std']]], + ['remove_5fif_3389',['remove_if',['http://en.cppreference.com/w/cpp/container/forward_list/remove.html',0,'std::forward_list::remove_if()'],['http://en.cppreference.com/w/cpp/container/list/remove.html',0,'std::list::remove_if()'],['http://en.cppreference.com/w/cpp/algorithm/remove.html',0,'std::remove_if()']]], + ['removewordhelper_3390',['removeWordHelper',['../dd/d2f/class_trie.html#a95216ffc56cb9f8cede982cecb872af4',1,'Trie']]], + ['remquo_3391',['remquo',['http://en.cppreference.com/w/cpp/numeric/math/remquo.html',0,'std']]], + ['rename_3392',['rename',['http://en.cppreference.com/w/cpp/io/c/rename.html',0,'std']]], + ['rend_3393',['rend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::rend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::rend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::rend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::rend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::rend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::rend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::rend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::rend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::rend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::rend()']]], + ['replace_3394',['replace',['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::basic_string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::wstring::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u16string::replace()'],['http://en.cppreference.com/w/cpp/string/basic_string/replace.html',0,'std::u32string::replace()'],['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std::replace()']]], + ['replace_5fcopy_3395',['replace_copy',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], + ['replace_5fcopy_5fif_3396',['replace_copy_if',['http://en.cppreference.com/w/cpp/algorithm/replace_copy.html',0,'std']]], + ['replace_5fif_3397',['replace_if',['http://en.cppreference.com/w/cpp/algorithm/replace.html',0,'std']]], + ['reserve_3398',['reserve',['http://en.cppreference.com/w/cpp/container/vector/reserve.html',0,'std::vector::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_map/reserve.html',0,'std::unordered_map::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/reserve.html',0,'std::unordered_multimap::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::basic_string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::wstring::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/reserve.html',0,'std::unordered_multiset::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u16string::reserve()'],['http://en.cppreference.com/w/cpp/string/basic_string/reserve.html',0,'std::u32string::reserve()'],['http://en.cppreference.com/w/cpp/container/unordered_set/reserve.html',0,'std::unordered_set::reserve()']]], + ['reset_3399',['reset',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/reset.html',0,'std::student_t_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/reset.html',0,'std::extreme_value_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/reset.html',0,'std::lognormal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/reset.html',0,'std::weak_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/reset.html',0,'std::discrete_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/reset.html',0,'std::piecewise_constant_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/reset.html',0,'std::poisson_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/reset.html',0,'std::bernoulli_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html',0,'std::shared_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/reset.html',0,'std::exponential_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/reset.html',0,'std::uniform_real_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/reset.html',0,'std::geometric_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/reset.html',0,'std::normal_distribution::reset()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/reset.html',0,'std::unique_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/reset.html',0,'std::weibull_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/reset.html',0,'std::negative_binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/reset.html',0,'std::chi_squared_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/reset.html',0,'std::piecewise_linear_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/reset.html',0,'std::uniform_int_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/reset.html',0,'std::fisher_f_distribution::reset()'],['http://en.cppreference.com/w/cpp/utility/bitset/reset.html',0,'std::bitset::reset()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/reset.html',0,'std::auto_ptr::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/reset.html',0,'std::gamma_distribution::reset()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/reset.html',0,'std::packaged_task::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/reset.html',0,'std::binomial_distribution::reset()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/reset.html',0,'std::cauchy_distribution::reset()']]], + ['resetiosflags_3400',['resetiosflags',['http://en.cppreference.com/w/cpp/io/manip/resetiosflags.html',0,'std']]], + ['resize_3401',['resize',['http://en.cppreference.com/w/cpp/container/vector/resize.html',0,'std::vector::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::string::resize()'],['http://en.cppreference.com/w/cpp/container/forward_list/resize.html',0,'std::forward_list::resize()'],['http://en.cppreference.com/w/cpp/container/deque/resize.html',0,'std::deque::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::basic_string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::wstring::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u16string::resize()'],['http://en.cppreference.com/w/cpp/string/basic_string/resize.html',0,'std::u32string::resize()'],['http://en.cppreference.com/w/cpp/container/list/resize.html',0,'std::list::resize()']]], + ['rethrow_5fexception_3402',['rethrow_exception',['http://en.cppreference.com/w/cpp/error/rethrow_exception.html',0,'std']]], + ['rethrow_5fif_5fnested_3403',['rethrow_if_nested',['http://en.cppreference.com/w/cpp/error/rethrow_if_nested.html',0,'std']]], + ['rethrow_5fnested_3404',['rethrow_nested',['http://en.cppreference.com/w/cpp/error/nested_exception/rethrow_nested.html',0,'std::nested_exception']]], + ['return_5ftemporary_5fbuffer_3405',['return_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/return_temporary_buffer.html',0,'std']]], + ['reverse_3406',['reverse',['http://en.cppreference.com/w/cpp/container/forward_list/reverse.html',0,'std::forward_list::reverse()'],['http://en.cppreference.com/w/cpp/container/list/reverse.html',0,'std::list::reverse()'],['http://en.cppreference.com/w/cpp/algorithm/reverse.html',0,'std::reverse()']]], + ['reverse_5fcopy_3407',['reverse_copy',['http://en.cppreference.com/w/cpp/algorithm/reverse_copy.html',0,'std']]], + ['rewind_3408',['rewind',['http://en.cppreference.com/w/cpp/io/c/rewind.html',0,'std']]], + ['rfind_3409',['rfind',['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::basic_string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::wstring::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u16string::rfind()'],['http://en.cppreference.com/w/cpp/string/basic_string/rfind.html',0,'std::u32string::rfind()']]], + ['right_3410',['right',['../d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e',1,'MinHeap::right()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::right()']]], + ['rightrotate_3411',['rightRotate',['../d8/dee/avltree_8cpp.html#a4d93589966920b2756b84f8b92c54d1c',1,'avltree.cpp']]], + ['rint_3412',['rint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['rotate_3413',['rotate',['http://en.cppreference.com/w/cpp/algorithm/rotate.html',0,'std']]], + ['rotate_5fcopy_3414',['rotate_copy',['http://en.cppreference.com/w/cpp/algorithm/rotate_copy.html',0,'std']]], + ['round_3415',['round',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['round_5ferror_3416',['round_error',['http://en.cppreference.com/w/cpp/types/numeric_limits/round_error.html',0,'std::numeric_limits']]], + ['runtime_5ferror_3417',['runtime_error',['http://en.cppreference.com/w/cpp/error/runtime_error.html',0,'std::runtime_error']]] +]; diff --git a/search/functions_13.html b/search/functions_13.html new file mode 100644 index 000000000..65faa02d2 --- /dev/null +++ b/search/functions_13.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_13.js b/search/functions_13.js new file mode 100644 index 000000000..c7f05be2b --- /dev/null +++ b/search/functions_13.js @@ -0,0 +1,168 @@ +var searchData= +[ + ['s_3418',['s',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution']]], + ['save_5f2d_5fdata_3419',['save_2d_data',['../d9/d66/group__machine__learning.html#ga6c606bc85a3e9fd9d010f874ad760336',1,'kohonen_som_topology.cpp']]], + ['save_5fexact_5fsolution_3420',['save_exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#aa13517b8e5de1b75592052db7f7e237f',1,'save_exact_solution(const double &X0, const double &X_MAX, const double &step_size, const std::valarray< double > &Y0): ode_semi_implicit_euler.cpp']]], + ['save_5fnd_5fdata_3421',['save_nd_data',['../d9/d66/group__machine__learning.html#ga72699c805c19a6cc47a937a6f3378afa',1,'kohonen_som_trace.cpp']]], + ['save_5fu_5fmatrix_3422',['save_u_matrix',['../d8/d77/namespacemachine__learning.html#a1d577f5d95b774ae97eb6838852d0df5',1,'machine_learning']]], + ['sbumpc_3423',['sbumpc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wfilebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::wstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::strstreambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_stringbuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::basic_streambuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::filebuf::sbumpc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sbumpc.html',0,'std::streambuf::sbumpc()']]], + ['scalbln_3424',['scalbln',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]], + ['scalbn_3425',['scalbn',['http://en.cppreference.com/w/cpp/numeric/math/scalbn.html',0,'std']]], + ['scan_5fis_3426',['scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::scan_is()']]], + ['scanf_3427',['scanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['scientific_3428',['scientific',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['scoped_5fallocator_5fadaptor_3429',['scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor']]], + ['search_3430',['search',['../dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206',1,'Trie::search()'],['http://en.cppreference.com/w/cpp/algorithm/search.html',0,'std::search()']]], + ['search_5fn_3431',['search_n',['http://en.cppreference.com/w/cpp/algorithm/search_n.html',0,'std']]], + ['seconds_3432',['seconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::seconds']]], + ['seed_3433',['seed',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937_64::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux24_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux48::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::discard_block_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mersenne_twister_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/seed.html',0,'std::independent_bits_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::ranlux48_base::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/seed.html',0,'std::mt19937::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::shuffle_order_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/seed.html',0,'std::ranlux24::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::linear_congruential_engine::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/seed.html',0,'std::knuth_b::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/seed.html',0,'std::minstd_rand0::seed()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/seed.html',0,'std::subtract_with_carry_engine::seed()']]], + ['seed_5fseq_3434',['seed_seq',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/seed_seq.html',0,'std::seed_seq']]], + ['seekg_3435',['seekg',['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_fstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::strstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_stringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istrstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wiostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_ifstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::istream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wfstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::basic_iostream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wstringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::wistringstream::seekg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/seekg.html',0,'std::ifstream::seekg()']]], + ['seekoff_3436',['seekoff',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wfilebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::wstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::strstreambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_stringbuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::basic_streambuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::filebuf::seekoff()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekoff.html',0,'std::streambuf::seekoff()']]], + ['seekp_3437',['seekp',['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_fstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::strstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_stringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wostringstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_ostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wiostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::ostrstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wfstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::basic_iostream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wofstream::seekp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/seekp.html',0,'std::wstringstream::seekp()']]], + ['seekpos_3438',['seekpos',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wfilebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::wstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::strstreambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_stringbuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::basic_streambuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::filebuf::seekpos()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubseekpos.html',0,'std::streambuf::seekpos()']]], + ['select_5fon_5fcontainer_5fcopy_5fconstruction_3439',['select_on_container_copy_construction',['http://en.cppreference.com/w/cpp/memory/allocator_traits/select_on_container_copy_construction.html',0,'std::allocator_traits::select_on_container_copy_construction()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/select_on_container_copy_construction.html',0,'std::scoped_allocator_adaptor::select_on_container_copy_construction()']]], + ['semi_5fimplicit_5feuler_3440',['semi_implicit_euler',['../d6/d60/group__ode.html#ga3874d294ab00fe9ce8731c5b7991a089',1,'ode_semi_implicit_euler.cpp']]], + ['semi_5fimplicit_5feuler_5fstep_3441',['semi_implicit_euler_step',['../d6/d60/group__ode.html#ga827bf009831ddc477c5fa8891d5cb35f',1,'ode_semi_implicit_euler.cpp']]], + ['sentry_3442',['sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::sentry()']]], + ['set_3443',['set',['http://en.cppreference.com/w/cpp/container/set/set.html',0,'std::set::set()'],['http://en.cppreference.com/w/cpp/utility/bitset/set.html',0,'std::bitset::set()']]], + ['set_5fdifference_3444',['set_difference',['http://en.cppreference.com/w/cpp/algorithm/set_difference.html',0,'std']]], + ['set_5fexception_3445',['set_exception',['http://en.cppreference.com/w/cpp/thread/promise/set_exception.html',0,'std::promise']]], + ['set_5fexception_5fat_5fthread_5fexit_3446',['set_exception_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_exception_at_thread_exit.html',0,'std::promise']]], + ['set_5fintersection_3447',['set_intersection',['http://en.cppreference.com/w/cpp/algorithm/set_intersection.html',0,'std']]], + ['set_5fnew_5fhandler_3448',['set_new_handler',['http://en.cppreference.com/w/cpp/memory/new/set_new_handler.html',0,'std']]], + ['set_5frdbuf_3449',['set_rdbuf',['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ios::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_fstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::strstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_stringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wostringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wiostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_ifstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::istream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ostrstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wfstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::basic_iostream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wofstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wstringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::wistringstream::set_rdbuf()'],['http://en.cppreference.com/w/cpp/io/basic_ios/set_rdbuf.html',0,'std::ifstream::set_rdbuf()']]], + ['set_5fsymmetric_5fdifference_3450',['set_symmetric_difference',['http://en.cppreference.com/w/cpp/algorithm/set_symmetric_difference.html',0,'std']]], + ['set_5fterminate_3451',['set_terminate',['http://en.cppreference.com/w/cpp/error/set_terminate.html',0,'std']]], + ['set_5funexpected_3452',['set_unexpected',['http://en.cppreference.com/w/cpp/error/set_unexpected.html',0,'std']]], + ['set_5funion_3453',['set_union',['http://en.cppreference.com/w/cpp/algorithm/set_union.html',0,'std']]], + ['set_5fvalue_3454',['set_value',['http://en.cppreference.com/w/cpp/thread/promise/set_value.html',0,'std::promise']]], + ['set_5fvalue_5fat_5fthread_5fexit_3455',['set_value_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/promise/set_value_at_thread_exit.html',0,'std::promise']]], + ['setbase_3456',['setbase',['http://en.cppreference.com/w/cpp/io/manip/setbase.html',0,'std']]], + ['setbuf_3457',['setbuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wfilebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::wstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::strstreambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_stringbuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::basic_streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::filebuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsetbuf.html',0,'std::streambuf::setbuf()'],['http://en.cppreference.com/w/cpp/io/c/setbuf.html',0,'std::setbuf()']]], + ['setf_3458',['setf',['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ios::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_fstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ios_base::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::strstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_stringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wostringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wiostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_ifstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::istream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ostrstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wfstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::basic_iostream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wofstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wstringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::wistringstream::setf()'],['http://en.cppreference.com/w/cpp/io/ios_base/setf.html',0,'std::ifstream::setf()']]], + ['setfill_3459',['setfill',['http://en.cppreference.com/w/cpp/io/manip/setfill.html',0,'std']]], + ['setg_3460',['setg',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wfilebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::wstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::strstreambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_stringbuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::basic_streambuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::filebuf::setg()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setg.html',0,'std::streambuf::setg()']]], + ['setiosflags_3461',['setiosflags',['http://en.cppreference.com/w/cpp/io/manip/setiosflags.html',0,'std']]], + ['setlocale_3462',['setlocale',['http://en.cppreference.com/w/cpp/locale/setlocale.html',0,'std']]], + ['setp_3463',['setp',['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wfilebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::wstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::strstreambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_stringbuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::basic_streambuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::filebuf::setp()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/setp.html',0,'std::streambuf::setp()']]], + ['setprecision_3464',['setprecision',['http://en.cppreference.com/w/cpp/io/manip/setprecision.html',0,'std']]], + ['setstate_3465',['setstate',['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ios::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_fstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::strstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_stringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wostringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wiostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_ifstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::istream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ostrstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wfstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::basic_iostream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wofstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wstringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::wistringstream::setstate()'],['http://en.cppreference.com/w/cpp/io/basic_ios/setstate.html',0,'std::ifstream::setstate()']]], + ['setvbuf_3466',['setvbuf',['http://en.cppreference.com/w/cpp/io/c/setvbuf.html',0,'std']]], + ['setw_3467',['setw',['http://en.cppreference.com/w/cpp/io/manip/setw.html',0,'std']]], + ['sgetc_3468',['sgetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wfilebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::wstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::strstreambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_stringbuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::basic_streambuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::filebuf::sgetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetc.html',0,'std::streambuf::sgetc()']]], + ['sgetn_3469',['sgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::sgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::sgetn()']]], + ['sgn_3470',['sgn',['../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'sgn(T val): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2',1,'sgn(T val): false_position.cpp']]], + ['share_3471',['share',['http://en.cppreference.com/w/cpp/thread/future/share.html',0,'std::future']]], + ['shared_5ffrom_5fthis_3472',['shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/shared_from_this.html',0,'std::enable_shared_from_this']]], + ['shared_5ffuture_3473',['shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future/shared_future.html',0,'std::shared_future']]], + ['shared_5flock_3474',['shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/shared_lock.html',0,'std::shared_lock']]], + ['shared_5fptr_3475',['shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr/shared_ptr.html',0,'std::shared_ptr']]], + ['shared_5ftimed_5fmutex_3476',['shared_timed_mutex',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/shared_timed_mutex.html',0,'std::shared_timed_mutex']]], + ['shell_5fsort_3477',['shell_sort',['../d5/d91/namespacesorting.html#a5669396c6a6b1e14b97589b6e37980aa',1,'sorting::shell_sort(T *arr, size_t LEN)'],['../d5/d91/namespacesorting.html#a4d76603c54d3dc56146e92d10a043924',1,'sorting::shell_sort(T(&arr)[N])'],['../d5/d91/namespacesorting.html#af2c5b92cbfe73f63f6074c61b0a45331',1,'sorting::shell_sort(std::vector< T > *arr)']]], + ['show_3478',['show',['../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed',1,'tower_of_hanoi.cpp']]], + ['show_5fdata_3479',['show_data',['../d4/d7a/shell__sort2_8cpp.html#a951127aea9d7e1e53ea9ae0868633246',1,'show_data(T *arr, size_t LEN): shell_sort2.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a63aaff7cabfa3da2da8b9477b5fad9d6',1,'show_data(T(&arr)[N]): shell_sort2.cpp']]], + ['show_5fpascal_3480',['show_pascal',['../dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c',1,'pascal_triangle.cpp']]], + ['showbase_3481',['showbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], + ['showmanyc_3482',['showmanyc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wfilebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::wstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::strstreambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_stringbuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::basic_streambuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::filebuf::showmanyc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/showmanyc.html',0,'std::streambuf::showmanyc()']]], + ['showpoint_3483',['showpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], + ['showpos_3484',['showpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], + ['shrink_5fto_5ffit_3485',['shrink_to_fit',['http://en.cppreference.com/w/cpp/container/vector/shrink_to_fit.html',0,'std::vector::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/container/deque/shrink_to_fit.html',0,'std::deque::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::basic_string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::wstring::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u16string::shrink_to_fit()'],['http://en.cppreference.com/w/cpp/string/basic_string/shrink_to_fit.html',0,'std::u32string::shrink_to_fit()']]], + ['shuffle_3486',['shuffle',['http://en.cppreference.com/w/cpp/algorithm/random_shuffle.html',0,'std']]], + ['shuffle_5forder_5fengine_3487',['shuffle_order_engine',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::shuffle_order_engine']]], + ['sieve_3488',['Sieve',['../d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c',1,'Sieve(int64_t n): primes_up_to_billion.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#abce89d8999986f085c368969590376b8',1,'sieve(uint32_t N): sieve_of_eratosthenes.cpp']]], + ['sieveoferatosthenes_3489',['SieveOfEratosthenes',['../db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099',1,'prime_factorization.cpp']]], + ['signal_3490',['signal',['http://en.cppreference.com/w/cpp/utility/program/signal.html',0,'std']]], + ['signaling_5fnan_3491',['signaling_NaN',['http://en.cppreference.com/w/cpp/types/numeric_limits/signaling_NaN.html',0,'std::numeric_limits']]], + ['signbit_3492',['signbit',['http://en.cppreference.com/w/cpp/numeric/math/signbit.html',0,'std']]], + ['sin_3493',['sin',['http://en.cppreference.com/w/cpp/numeric/math/sin.html',0,'std']]], + ['sinh_3494',['sinh',['http://en.cppreference.com/w/cpp/numeric/math/sinh.html',0,'std']]], + ['size_3495',['size',['http://en.cppreference.com/w/cpp/container/dynarray/size.html',0,'std::dynarray::size()'],['http://en.cppreference.com/w/cpp/container/vector/size.html',0,'std::vector::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::match_results::size()'],['http://en.cppreference.com/w/cpp/container/multiset/size.html',0,'std::multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::size()'],['http://en.cppreference.com/w/cpp/container/set/size.html',0,'std::set::size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/size.html',0,'std::unordered_map::size()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/size.html',0,'std::initializer_list::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wsmatch::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::smatch::size()'],['http://en.cppreference.com/w/cpp/container/stack/size.html',0,'std::stack::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/size.html',0,'std::unordered_multimap::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::wcmatch::size()'],['http://en.cppreference.com/w/cpp/container/deque/size.html',0,'std::deque::size()'],['http://en.cppreference.com/w/cpp/container/queue/size.html',0,'std::queue::size()'],['http://en.cppreference.com/w/cpp/utility/bitset/size.html',0,'std::bitset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::size()'],['http://en.cppreference.com/w/cpp/container/priority_queue/size.html',0,'std::priority_queue::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/size.html',0,'std::unordered_multiset::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::size()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::size()'],['http://en.cppreference.com/w/cpp/container/list/size.html',0,'std::list::size()'],['http://en.cppreference.com/w/cpp/container/map/size.html',0,'std::map::size()'],['http://en.cppreference.com/w/cpp/regex/match_results/size.html',0,'std::cmatch::size()'],['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/size.html',0,'std::seed_seq::size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/size.html',0,'std::unordered_set::size()'],['http://en.cppreference.com/w/cpp/container/multimap/size.html',0,'std::multimap::size()'],['http://en.cppreference.com/w/cpp/container/array/size.html',0,'std::array::size()']]], + ['skipws_3496',['skipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], + ['sleep_5ffor_3497',['sleep_for',['http://en.cppreference.com/w/cpp/thread/sleep_for.html',0,'std::this_thread']]], + ['sleep_5funtil_3498',['sleep_until',['http://en.cppreference.com/w/cpp/thread/sleep_until.html',0,'std::this_thread']]], + ['smatch_3499',['smatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::smatch']]], + ['snextc_3500',['snextc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wfilebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::wstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::strstreambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_stringbuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::basic_streambuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::filebuf::snextc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/snextc.html',0,'std::streambuf::snextc()']]], + ['snprintf_3501',['snprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['sort_3502',['sort',['http://en.cppreference.com/w/cpp/container/forward_list/sort.html',0,'std::forward_list::sort()'],['http://en.cppreference.com/w/cpp/container/list/sort.html',0,'std::list::sort()'],['http://en.cppreference.com/w/cpp/algorithm/sort.html',0,'std::sort()']]], + ['sort_5fheap_3503',['sort_heap',['http://en.cppreference.com/w/cpp/algorithm/sort_heap.html',0,'std']]], + ['spiralprint_3504',['spiralPrint',['../db/d07/spiral__print_8cpp.html#a850d3f55e1a8d227176cdcc67352c197',1,'spiral_print.cpp']]], + ['splice_3505',['splice',['http://en.cppreference.com/w/cpp/container/list/splice.html',0,'std::list']]], + ['splice_5fafter_3506',['splice_after',['http://en.cppreference.com/w/cpp/container/forward_list/splice_after.html',0,'std::forward_list']]], + ['sprintf_3507',['sprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['sputbackc_3508',['sputbackc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wfilebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::wstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::strstreambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_stringbuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::basic_streambuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::filebuf::sputbackc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputbackc.html',0,'std::streambuf::sputbackc()']]], + ['sputc_3509',['sputc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wfilebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::wstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::strstreambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_stringbuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::basic_streambuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::filebuf::sputc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputc.html',0,'std::streambuf::sputc()']]], + ['sputn_3510',['sputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::sputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::sputn()']]], + ['sqrt_3511',['sqrt',['http://en.cppreference.com/w/cpp/numeric/math/sqrt.html',0,'std::sqrt()'],['../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc',1,'Sqrt(): sqrt_double.cpp']]], + ['srand_3512',['srand',['http://en.cppreference.com/w/cpp/numeric/random/srand.html',0,'std']]], + ['sregex_5fiterator_3513',['sregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::sregex_iterator']]], + ['sregex_5ftoken_5fiterator_3514',['sregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::sregex_token_iterator']]], + ['sscanf_3515',['sscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['ssub_5fmatch_3516',['ssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::ssub_match']]], + ['stable_5fpartition_3517',['stable_partition',['http://en.cppreference.com/w/cpp/algorithm/stable_partition.html',0,'std']]], + ['stable_5fsort_3518',['stable_sort',['http://en.cppreference.com/w/cpp/algorithm/stable_sort.html',0,'std']]], + ['stack_3519',['stack',['http://en.cppreference.com/w/cpp/container/stack/stack.html',0,'std::stack::stack()'],['../d1/dc2/classstack.html#a5b64337ec34b12e98458bb9b9d5f8f83',1,'stack::stack()']]], + ['state_3520',['state',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/state.html',0,'std::wbuffer_convert::state()'],['http://en.cppreference.com/w/cpp/locale/wstring_convert/state.html',0,'std::wstring_convert::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::wstreampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u16streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::streampos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::fpos::state()'],['http://en.cppreference.com/w/cpp/io/fpos/state.html',0,'std::u32streampos::state()']]], + ['static_5fpointer_5fcast_3521',['static_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['std_3522',['std',['../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1',1,'statistics::stats_computer1::std()'],['../d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e',1,'statistics::stats_computer2::std()']]], + ['stddev_3523',['stddev',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution']]], + ['stod_3524',['stod',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stof_3525',['stof',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stoi_3526',['stoi',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stol_3527',['stol',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['stold_3528',['stold',['http://en.cppreference.com/w/cpp/string/basic_string/stof.html',0,'std']]], + ['stoll_3529',['stoll',['http://en.cppreference.com/w/cpp/string/basic_string/stol.html',0,'std']]], + ['store_3530',['store',['http://en.cppreference.com/w/cpp/atomic/atomic/store.html',0,'std::atomic']]], + ['stoul_3531',['stoul',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], + ['stoull_3532',['stoull',['http://en.cppreference.com/w/cpp/string/basic_string/stoul.html',0,'std']]], + ['str_3533',['str',['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::match_results::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::basic_ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::wstringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wsmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::ostringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::smatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::stringstream::str()'],['http://en.cppreference.com/w/cpp/io/strstreambuf/str.html',0,'std::strstreambuf::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::wcmatch::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/str.html',0,'std::basic_stringbuf::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::str()'],['http://en.cppreference.com/w/cpp/io/strstream/str.html',0,'std::strstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::basic_stringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/str.html',0,'std::wostringstream::str()'],['http://en.cppreference.com/w/cpp/io/istrstream/str.html',0,'std::istrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::basic_istringstream::str()'],['http://en.cppreference.com/w/cpp/regex/match_results/str.html',0,'std::cmatch::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::istringstream::str()'],['http://en.cppreference.com/w/cpp/io/ostrstream/str.html',0,'std::ostrstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/str.html',0,'std::wstringstream::str()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/str.html',0,'std::wistringstream::str()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::str()']]], + ['strcat_3534',['strcat',['http://en.cppreference.com/w/cpp/string/byte/strcat.html',0,'std']]], + ['strchr_3535',['strchr',['http://en.cppreference.com/w/cpp/string/byte/strchr.html',0,'std']]], + ['strcmp_3536',['strcmp',['http://en.cppreference.com/w/cpp/string/byte/strcmp.html',0,'std']]], + ['strcoll_3537',['strcoll',['http://en.cppreference.com/w/cpp/string/byte/strcoll.html',0,'std']]], + ['strcpy_3538',['strcpy',['http://en.cppreference.com/w/cpp/string/byte/strcpy.html',0,'std']]], + ['strcspn_3539',['strcspn',['http://en.cppreference.com/w/cpp/string/byte/strcspn.html',0,'std']]], + ['streambuf_3540',['streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::streambuf']]], + ['strerror_3541',['strerror',['http://en.cppreference.com/w/cpp/string/byte/strerror.html',0,'std']]], + ['strftime_3542',['strftime',['http://en.cppreference.com/w/cpp/chrono/c/strftime.html',0,'std']]], + ['string_3543',['string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::string']]], + ['stringbuf_3544',['stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::stringbuf']]], + ['stringstream_3545',['stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::stringstream']]], + ['strlen_3546',['strlen',['http://en.cppreference.com/w/cpp/string/byte/strlen.html',0,'std']]], + ['strncat_3547',['strncat',['http://en.cppreference.com/w/cpp/string/byte/strncat.html',0,'std']]], + ['strncmp_3548',['strncmp',['http://en.cppreference.com/w/cpp/string/byte/strncmp.html',0,'std']]], + ['strncpy_3549',['strncpy',['http://en.cppreference.com/w/cpp/string/byte/strncpy.html',0,'std']]], + ['strpbrk_3550',['strpbrk',['http://en.cppreference.com/w/cpp/string/byte/strpbrk.html',0,'std']]], + ['strrchr_3551',['strrchr',['http://en.cppreference.com/w/cpp/string/byte/strrchr.html',0,'std']]], + ['strspn_3552',['strspn',['http://en.cppreference.com/w/cpp/string/byte/strspn.html',0,'std']]], + ['strstr_3553',['strstr',['http://en.cppreference.com/w/cpp/string/byte/strstr.html',0,'std']]], + ['strstream_3554',['strstream',['http://en.cppreference.com/w/cpp/io/strstream/strstream.html',0,'std::strstream']]], + ['strstreambuf_3555',['strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf/strstreambuf.html',0,'std::strstreambuf']]], + ['strtod_3556',['strtod',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtof_3557',['strtof',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtoimax_3558',['strtoimax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], + ['strtok_3559',['strtok',['http://en.cppreference.com/w/cpp/string/byte/strtok.html',0,'std']]], + ['strtol_3560',['strtol',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], + ['strtold_3561',['strtold',['http://en.cppreference.com/w/cpp/string/byte/strtof.html',0,'std']]], + ['strtoll_3562',['strtoll',['http://en.cppreference.com/w/cpp/string/byte/strtol.html',0,'std']]], + ['strtoul_3563',['strtoul',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], + ['strtoull_3564',['strtoull',['http://en.cppreference.com/w/cpp/string/byte/strtoul.html',0,'std']]], + ['strtoumax_3565',['strtoumax',['http://en.cppreference.com/w/cpp/string/byte/strtoimax.html',0,'std']]], + ['struzik_5fsearch_3566',['struzik_search',['../d8/d8a/exponential__search_8cpp.html#a67e9c84b4e2eb30e3c5170eabfbb363d',1,'exponential_search.cpp']]], + ['strxfrm_3567',['strxfrm',['http://en.cppreference.com/w/cpp/string/byte/strxfrm.html',0,'std']]], + ['student_5ft_5fdistribution_3568',['student_t_distribution',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/student_t_distribution.html',0,'std::student_t_distribution']]], + ['sub_5fmatch_3569',['sub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::sub_match']]], + ['substr_3570',['substr',['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::basic_string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::wstring::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u16string::substr()'],['http://en.cppreference.com/w/cpp/string/basic_string/substr.html',0,'std::u32string::substr()']]], + ['subtract_5fwith_5fcarry_5fengine_3571',['subtract_with_carry_engine',['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/subtract_with_carry_engine.html',0,'std::subtract_with_carry_engine']]], + ['suffix_3572',['suffix',['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::match_results::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wsmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::smatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::wcmatch::suffix()'],['http://en.cppreference.com/w/cpp/regex/match_results/suffix.html',0,'std::cmatch::suffix()']]], + ['sungetc_3573',['sungetc',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wfilebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::wstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::strstreambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_stringbuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::basic_streambuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::filebuf::sungetc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sungetc.html',0,'std::streambuf::sungetc()']]], + ['swap_3574',['swap',['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::fstream::swap()'],['http://en.cppreference.com/w/cpp/container/vector/swap.html',0,'std::vector::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::match_results::swap()'],['http://en.cppreference.com/w/cpp/container/multiset/swap.html',0,'std::multiset::swap()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/swap.html',0,'std::weak_ptr::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostream::swap()'],['http://en.cppreference.com/w/cpp/container/set/swap.html',0,'std::set::swap()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/swap.html',0,'std::unique_lock::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostringstream::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::regex::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_map/swap.html',0,'std::unordered_map::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::basic_regex::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_filebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstringbuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ios::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wsmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/tuple/swap.html',0,'std::tuple::swap()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/swap.html',0,'std::shared_ptr::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_fstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::stringbuf::swap()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/swap.html',0,'std::wregex::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::smatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wfilebuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::iostream::swap()'],['http://en.cppreference.com/w/cpp/container/stack/swap.html',0,'std::stack::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::wstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::stringstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/swap.html',0,'std::unordered_multimap::swap()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/swap.html',0,'std::unique_ptr::swap()'],['http://en.cppreference.com/w/cpp/container/forward_list/swap.html',0,'std::forward_list::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::strstreambuf::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostream::swap()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/swap.html',0,'std::shared_lock::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::wcmatch::swap()'],['http://en.cppreference.com/w/cpp/utility/pair/swap.html',0,'std::pair::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wifstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_stringbuf::swap()'],['http://en.cppreference.com/w/cpp/container/deque/swap.html',0,'std::deque::swap()'],['http://en.cppreference.com/w/cpp/thread/promise/swap.html',0,'std::promise::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::strstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::basic_streambuf::swap()'],['http://en.cppreference.com/w/cpp/container/queue/swap.html',0,'std::queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_stringstream::swap()'],['http://en.cppreference.com/w/cpp/thread/thread/swap.html',0,'std::thread::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::basic_string::swap()'],['http://en.cppreference.com/w/cpp/container/priority_queue/swap.html',0,'std::priority_queue::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wostringstream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::wstring::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istrstream::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/swap.html',0,'std::unordered_multiset::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ostream::swap()'],['http://en.cppreference.com/w/cpp/utility/functional/function/swap.html',0,'std::function::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::filebuf::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u16string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wiostream::swap()'],['http://en.cppreference.com/w/cpp/string/basic_string/swap.html',0,'std::u32string::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/list/swap.html',0,'std::list::swap()'],['http://en.cppreference.com/w/cpp/container/map/swap.html',0,'std::map::swap()'],['http://en.cppreference.com/w/cpp/regex/match_results/swap.html',0,'std::cmatch::swap()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/swap.html',0,'std::streambuf::swap()'],['http://en.cppreference.com/w/cpp/experimental/optional/swap.html',0,'std::experimental::optional::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::istream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ostrstream::swap()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/swap.html',0,'std::packaged_task::swap()'],['http://en.cppreference.com/w/cpp/container/unordered_set/swap.html',0,'std::unordered_set::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wfstream::swap()'],['http://en.cppreference.com/w/cpp/container/multimap/swap.html',0,'std::multimap::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::basic_iostream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wofstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wstringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::wistringstream::swap()'],['http://en.cppreference.com/w/cpp/io/basic_ios/swap.html',0,'std::ifstream::swap()'],['http://en.cppreference.com/w/cpp/container/array/swap.html',0,'std::array::swap()'],['http://en.cppreference.com/w/cpp/algorithm/swap.html',0,'std::swap()']]], + ['swap_5franges_3575',['swap_ranges',['http://en.cppreference.com/w/cpp/algorithm/swap_ranges.html',0,'std']]], + ['swprintf_3576',['swprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['swscanf_3577',['swscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], + ['sync_3578',['sync',['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_fstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wfilebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::wstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::strstreambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_stringbuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::strstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::basic_streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_stringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istrstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::filebuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wiostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_ifstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubsync.html',0,'std::streambuf::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::istream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wfstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::basic_iostream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wstringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::wistringstream::sync()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sync.html',0,'std::ifstream::sync()']]], + ['sync_5fwith_5fstdio_3579',['sync_with_stdio',['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ios::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_fstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ios_base::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::strstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_stringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wostringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wiostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_ifstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::istream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ostrstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wfstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::basic_iostream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wofstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wstringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::wistringstream::sync_with_stdio()'],['http://en.cppreference.com/w/cpp/io/ios_base/sync_with_stdio.html',0,'std::ifstream::sync_with_stdio()']]], + ['system_3580',['system',['http://en.cppreference.com/w/cpp/utility/program/system.html',0,'std']]], + ['system_5fcategory_3581',['system_category',['http://en.cppreference.com/w/cpp/error/system_category.html',0,'std']]], + ['system_5ferror_3582',['system_error',['http://en.cppreference.com/w/cpp/error/system_error/system_error.html',0,'std::system_error']]] +]; diff --git a/search/functions_14.html b/search/functions_14.html new file mode 100644 index 000000000..527223c5d --- /dev/null +++ b/search/functions_14.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_14.js b/search/functions_14.js new file mode 100644 index 000000000..6bcaf8504 --- /dev/null +++ b/search/functions_14.js @@ -0,0 +1,77 @@ +var searchData= +[ + ['t_3583',['t',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/params.html',0,'std::binomial_distribution']]], + ['tan_3584',['tan',['http://en.cppreference.com/w/cpp/numeric/math/tan.html',0,'std']]], + ['tanh_3585',['tanh',['http://en.cppreference.com/w/cpp/numeric/math/tanh.html',0,'std']]], + ['target_3586',['target',['http://en.cppreference.com/w/cpp/utility/functional/function/target.html',0,'std::function']]], + ['target_5ftype_3587',['target_type',['http://en.cppreference.com/w/cpp/utility/functional/function/target_type.html',0,'std::function']]], + ['tellg_3588',['tellg',['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_fstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::strstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_stringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istrstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wiostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_ifstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::istream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wfstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::basic_iostream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wstringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::wistringstream::tellg()'],['http://en.cppreference.com/w/cpp/io/basic_istream/tellg.html',0,'std::ifstream::tellg()']]], + ['tellp_3589',['tellp',['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_fstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::strstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_stringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wostringstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_ostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wiostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::ostrstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wfstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::basic_iostream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wofstream::tellp()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/tellp.html',0,'std::wstringstream::tellp()']]], + ['terminate_3590',['terminate',['http://en.cppreference.com/w/cpp/error/terminate.html',0,'std']]], + ['ternary_5fsearch_3591',['ternary_search',['../dc/dfe/ternary__search_8cpp.html#aef655a27eb82efa299bf9d0becf6e9c8',1,'ternary_search.cpp']]], + ['test_3592',['test',['http://en.cppreference.com/w/cpp/utility/bitset/test.html',0,'std::bitset::test()'],['../db/d82/classlarge__number.html#a959c5c1a982949bbf98e1ea0f9afe6a9',1,'large_number::test()'],['../d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002',1,'test(): smallest_circle.cpp']]], + ['test1_3593',['test1',['../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499',1,'test1(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a3f93b60e229b6683e24c4754a7106ee8',1,'test1(): large_factorial.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): durand_kerner_roots.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0',1,'test1(): qr_eigen_values.cpp']]], + ['test2_3594',['test2',['../d5/db0/adaline__learning_8cpp.html#a379f7488a305f2571f2932b319931f82',1,'test2(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): kohonen_som_trace.cpp'],['../d6/d9d/large__factorial_8cpp.html#a76aae4778fbe89a3d59fd61fbc050cfa',1,'test2(): large_factorial.cpp'],['../da/df2/durand__kerner__roots_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): durand_kerner_roots.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): qr_eigen_values.cpp'],['../d0/d01/smallest__circle_8cpp.html#a0283886819c7c140a023582b7269e2d0',1,'test2(): smallest_circle.cpp']]], + ['test3_3595',['test3',['../d5/db0/adaline__learning_8cpp.html#a992bdf1fdb0b9d414bcf7981d2d87aa9',1,'test3(double eta=0.01): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): kohonen_som_trace.cpp'],['../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e',1,'test3(): smallest_circle.cpp']]], + ['test_5f2d_5fclasses_3596',['test_2d_classes',['../d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755',1,'kohonen_som_topology.cpp']]], + ['test_5f3d_5fclasses_3597',['test_3d_classes',['../d9/d49/kohonen__som__trace_8cpp.html#a9ab8c79ffb674a63f151f282faeb723b',1,'kohonen_som_trace.cpp']]], + ['test_5f3d_5fclasses1_3598',['test_3d_classes1',['../d4/def/kohonen__som__topology_8cpp.html#ab3081e021270ba21a9fd88646f6a6e26',1,'kohonen_som_topology.cpp']]], + ['test_5f3d_5fclasses2_3599',['test_3d_classes2',['../d4/def/kohonen__som__topology_8cpp.html#a0e7435446ed7c763f7de79a468add2e0',1,'kohonen_som_topology.cpp']]], + ['test_5fand_5fset_3600',['test_and_set',['http://en.cppreference.com/w/cpp/atomic/atomic_flag/test_and_set.html',0,'std::atomic_flag']]], + ['test_5fcircle_3601',['test_circle',['../d9/d49/kohonen__som__trace_8cpp.html#ab47fb569e63648bd76e7edfdacc02dbd',1,'kohonen_som_trace.cpp']]], + ['test_5ff_3602',['test_f',['../d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d',1,'shell_sort2.cpp']]], + ['test_5ffunction_3603',['test_function',['../d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd',1,'realtime_stats.cpp']]], + ['test_5fint_3604',['test_int',['../d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e',1,'shell_sort2.cpp']]], + ['test_5flamniscate_3605',['test_lamniscate',['../d9/d49/kohonen__som__trace_8cpp.html#a412b7afa156306b1f8788643c91a1c60',1,'kohonen_som_trace.cpp']]], + ['tests_3606',['tests',['../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9',1,'least_common_multiple.cpp']]], + ['tgamma_3607',['tgamma',['http://en.cppreference.com/w/cpp/numeric/math/tgamma.html',0,'std']]], + ['th_3608',['TH',['../db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417',1,'tower_of_hanoi.cpp']]], + ['thousands_5fsep_3609',['thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::thousands_sep()']]], + ['thread_3610',['thread',['http://en.cppreference.com/w/cpp/thread/thread/thread.html',0,'std::thread']]], + ['throw_5fwith_5fnested_3611',['throw_with_nested',['http://en.cppreference.com/w/cpp/error/throw_with_nested.html',0,'std']]], + ['tie_3612',['tie',['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ios::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_fstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::strstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_stringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wostringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wiostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_ifstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::istream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ostrstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wfstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::basic_iostream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wofstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wstringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::wistringstream::tie()'],['http://en.cppreference.com/w/cpp/io/basic_ios/tie.html',0,'std::ifstream::tie()'],['http://en.cppreference.com/w/cpp/utility/tuple/tie.html',0,'std::tie()']]], + ['time_3613',['time',['http://en.cppreference.com/w/cpp/chrono/c/time.html',0,'std']]], + ['time_5fget_3614',['time_get',['http://en.cppreference.com/w/cpp/locale/time_get/time_get.html',0,'std::time_get']]], + ['time_5fget_5fbyname_3615',['time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname']]], + ['time_5fpoint_3616',['time_point',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point.html',0,'std::chrono::time_point']]], + ['time_5fpoint_5fcast_3617',['time_point_cast',['http://en.cppreference.com/w/cpp/chrono/time_point/time_point_cast.html',0,'std::chrono']]], + ['time_5fput_3618',['time_put',['http://en.cppreference.com/w/cpp/locale/time_put/time_put.html',0,'std::time_put']]], + ['time_5fput_5fbyname_3619',['time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname']]], + ['time_5fsince_5fepoch_3620',['time_since_epoch',['http://en.cppreference.com/w/cpp/chrono/time_point/time_since_epoch.html',0,'std::chrono::time_point']]], + ['timed_5fmutex_3621',['timed_mutex',['http://en.cppreference.com/w/cpp/thread/timed_mutex/timed_mutex.html',0,'std::timed_mutex']]], + ['tmpfile_3622',['tmpfile',['http://en.cppreference.com/w/cpp/io/c/tmpfile.html',0,'std']]], + ['tmpnam_3623',['tmpnam',['http://en.cppreference.com/w/cpp/io/c/tmpnam.html',0,'std']]], + ['to_5fbytes_3624',['to_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/to_bytes.html',0,'std::wstring_convert']]], + ['to_5fchar_5ftype_3625',['to_char_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_char_type.html',0,'std::char_traits']]], + ['to_5fint_5ftype_3626',['to_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/to_int_type.html',0,'std::char_traits']]], + ['to_5fstring_3627',['to_string',['http://en.cppreference.com/w/cpp/utility/bitset/to_string.html',0,'std::bitset::to_string()'],['http://en.cppreference.com/w/cpp/string/basic_string/to_string.html',0,'std::to_string()']]], + ['to_5ftime_5ft_3628',['to_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/to_time_t.html',0,'std::chrono::system_clock']]], + ['to_5fullong_3629',['to_ullong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ullong.html',0,'std::bitset']]], + ['to_5fulong_3630',['to_ulong',['http://en.cppreference.com/w/cpp/utility/bitset/to_ulong.html',0,'std::bitset']]], + ['to_5fwstring_3631',['to_wstring',['http://en.cppreference.com/w/cpp/string/basic_string/to_wstring.html',0,'std']]], + ['tolower_3632',['tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::tolower()'],['http://en.cppreference.com/w/cpp/string/byte/tolower.html',0,'std::tolower()']]], + ['tolowerroman_3633',['tolowerRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d',1,'decimal_to_roman_numeral.cpp']]], + ['top_3634',['top',['http://en.cppreference.com/w/cpp/container/stack/top.html',0,'std::stack::top()'],['http://en.cppreference.com/w/cpp/container/priority_queue/top.html',0,'std::priority_queue::top()'],['../d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344',1,'stack::top()']]], + ['toupper_3635',['toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::toupper()'],['http://en.cppreference.com/w/cpp/string/byte/toupper.html',0,'std::toupper()']]], + ['toupperroman_3636',['toupperRoman',['../de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979',1,'decimal_to_roman_numeral.cpp']]], + ['towctrans_3637',['towctrans',['http://en.cppreference.com/w/cpp/string/wide/towctrans.html',0,'std']]], + ['towlower_3638',['towlower',['http://en.cppreference.com/w/cpp/string/wide/towlower.html',0,'std']]], + ['towupper_3639',['towupper',['http://en.cppreference.com/w/cpp/string/wide/towupper.html',0,'std']]], + ['transform_3640',['transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::transform()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/transform.html',0,'std::regex_traits::transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::transform()'],['http://en.cppreference.com/w/cpp/algorithm/transform.html',0,'std::transform()']]], + ['transform_5fprimary_3641',['transform_primary',['http://en.cppreference.com/w/cpp/regex/regex_traits/transform_primary.html',0,'std::regex_traits']]], + ['translate_3642',['translate',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate.html',0,'std::regex_traits']]], + ['translate_5fnocase_3643',['translate_nocase',['http://en.cppreference.com/w/cpp/regex/regex_traits/translate_nocase.html',0,'std::regex_traits']]], + ['trianglearea_3644',['TriangleArea',['../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc',1,'smallest_circle.cpp']]], + ['trie_3645',['Trie',['../dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908',1,'Trie']]], + ['truename_3646',['truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::truename()']]], + ['trunc_3647',['trunc',['http://en.cppreference.com/w/cpp/numeric/math/trunc.html',0,'std']]], + ['try_5flock_3648',['try_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock.html',0,'std::unique_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/try_lock.html',0,'std::recursive_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock.html',0,'std::recursive_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock.html',0,'std::shared_lock::try_lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock.html',0,'std::timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/try_lock.html',0,'std::mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock.html',0,'std::shared_timed_mutex::try_lock()'],['http://en.cppreference.com/w/cpp/thread/try_lock.html',0,'std::try_lock()']]], + ['try_5flock_5ffor_3649',['try_lock_for',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_for.html',0,'std::unique_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_for.html',0,'std::recursive_timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_for.html',0,'std::shared_lock::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_for.html',0,'std::timed_mutex::try_lock_for()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_for.html',0,'std::shared_timed_mutex::try_lock_for()']]], + ['try_5flock_5fshared_3650',['try_lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5fshared_5ffor_3651',['try_lock_shared_for',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_for.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5fshared_5funtil_3652',['try_lock_shared_until',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_shared_until.html',0,'std::shared_timed_mutex']]], + ['try_5flock_5funtil_3653',['try_lock_until',['http://en.cppreference.com/w/cpp/thread/unique_lock/try_lock_until.html',0,'std::unique_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/try_lock_until.html',0,'std::recursive_timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/try_lock_until.html',0,'std::shared_lock::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/try_lock_until.html',0,'std::timed_mutex::try_lock_until()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/try_lock_until.html',0,'std::shared_timed_mutex::try_lock_until()']]], + ['tuple_3654',['tuple',['http://en.cppreference.com/w/cpp/utility/tuple/tuple.html',0,'std::tuple']]], + ['tuple_5fcat_3655',['tuple_cat',['http://en.cppreference.com/w/cpp/utility/tuple/tuple_cat.html',0,'std']]], + ['type_5findex_3656',['type_index',['http://en.cppreference.com/w/cpp/types/type_index/type_index.html',0,'std::type_index']]] +]; diff --git a/search/functions_15.html b/search/functions_15.html new file mode 100644 index 000000000..932bb87ba --- /dev/null +++ b/search/functions_15.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_15.js b/search/functions_15.js new file mode 100644 index 000000000..111039dc6 --- /dev/null +++ b/search/functions_15.js @@ -0,0 +1,41 @@ +var searchData= +[ + ['u16string_3657',['u16string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u16string']]], + ['u32string_3658',['u32string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::u32string']]], + ['uflow_3659',['uflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wfilebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::wstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::strstreambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_stringbuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::basic_streambuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::filebuf::uflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/uflow.html',0,'std::streambuf::uflow()']]], + ['unary_5fnegate_3660',['unary_negate',['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate']]], + ['uncaught_5fexception_3661',['uncaught_exception',['http://en.cppreference.com/w/cpp/error/uncaught_exception.html',0,'std']]], + ['undeclare_5fno_5fpointers_3662',['undeclare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_no_pointers.html',0,'std']]], + ['undeclare_5freachable_3663',['undeclare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/undeclare_reachable.html',0,'std']]], + ['underflow_3664',['underflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wfilebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::wstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::strstreambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_stringbuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::basic_streambuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::filebuf::underflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/underflow.html',0,'std::streambuf::underflow()']]], + ['underflow_5ferror_3665',['underflow_error',['http://en.cppreference.com/w/cpp/error/underflow_error.html',0,'std::underflow_error']]], + ['unexpected_3666',['unexpected',['http://en.cppreference.com/w/cpp/error/unexpected.html',0,'std']]], + ['unget_3667',['unget',['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_fstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::strstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_stringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istrstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wiostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_ifstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::istream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wfstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::basic_iostream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wstringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::wistringstream::unget()'],['http://en.cppreference.com/w/cpp/io/basic_istream/unget.html',0,'std::ifstream::unget()']]], + ['ungetc_3668',['ungetc',['http://en.cppreference.com/w/cpp/io/c/ungetc.html',0,'std']]], + ['ungetwc_3669',['ungetwc',['http://en.cppreference.com/w/cpp/io/c/ungetwc.html',0,'std']]], + ['uniform_5fint_5fdistribution_3670',['uniform_int_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/uniform_int_distribution.html',0,'std::uniform_int_distribution']]], + ['uniform_5freal_5fdistribution_3671',['uniform_real_distribution',['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/uniform_real_distribution.html',0,'std::uniform_real_distribution']]], + ['uninitialized_5fcopy_3672',['uninitialized_copy',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy.html',0,'std']]], + ['uninitialized_5fcopy_5fn_3673',['uninitialized_copy_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_copy_n.html',0,'std']]], + ['uninitialized_5ffill_3674',['uninitialized_fill',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill.html',0,'std']]], + ['uninitialized_5ffill_5fn_3675',['uninitialized_fill_n',['http://en.cppreference.com/w/cpp/memory/uninitialized_fill_n.html',0,'std']]], + ['unique_3676',['unique',['http://en.cppreference.com/w/cpp/memory/shared_ptr/unique.html',0,'std::shared_ptr::unique()'],['http://en.cppreference.com/w/cpp/container/forward_list/unique.html',0,'std::forward_list::unique()'],['http://en.cppreference.com/w/cpp/container/list/unique.html',0,'std::list::unique()'],['http://en.cppreference.com/w/cpp/algorithm/unique.html',0,'std::unique()']]], + ['unique_5fcopy_3677',['unique_copy',['http://en.cppreference.com/w/cpp/algorithm/unique_copy.html',0,'std']]], + ['unique_5flock_3678',['unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unique_lock.html',0,'std::unique_lock']]], + ['unique_5fptr_3679',['unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/unique_ptr.html',0,'std::unique_ptr']]], + ['unitbuf_3680',['unitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['unlock_3681',['unlock',['http://en.cppreference.com/w/cpp/thread/unique_lock/unlock.html',0,'std::unique_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/unlock.html',0,'std::recursive_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/unlock.html',0,'std::recursive_timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/unlock.html',0,'std::shared_lock::unlock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/unlock.html',0,'std::timed_mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/mutex/unlock.html',0,'std::mutex::unlock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock.html',0,'std::shared_timed_mutex::unlock()']]], + ['unlock_5fshared_3682',['unlock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/unlock_shared.html',0,'std::shared_timed_mutex']]], + ['unordered_5fmap_3683',['unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map.html',0,'std::unordered_map']]], + ['unordered_5fmultimap_3684',['unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/unordered_multimap.html',0,'std::unordered_multimap']]], + ['unordered_5fmultiset_3685',['unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/unordered_multiset.html',0,'std::unordered_multiset']]], + ['unordered_5fset_3686',['unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/unordered_set.html',0,'std::unordered_set']]], + ['unsetf_3687',['unsetf',['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ios::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_fstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ios_base::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::strstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_stringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wostringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wiostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_ifstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::istream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ostrstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wfstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::basic_iostream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wofstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wstringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::wistringstream::unsetf()'],['http://en.cppreference.com/w/cpp/io/ios_base/unsetf.html',0,'std::ifstream::unsetf()']]], + ['unshift_3688',['unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::unshift()']]], + ['update_5fstep_3689',['update_step',['../d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217',1,'extended_euclid_algorithm.cpp']]], + ['update_5fweights_3690',['update_weights',['../d8/d77/namespacemachine__learning.html#ac4010fe3a52a74e8b5b1aaadfe38b46f',1,'machine_learning::update_weights(const std::valarray< double > &X, std::vector< std::vector< std::valarray< double >>> *W, std::vector< std::valarray< double >> *D, double alpha, int R)'],['../d8/d77/namespacemachine__learning.html#a361674452869413536ee501f053129a8',1,'machine_learning::update_weights(const std::valarray< double > &x, std::vector< std::valarray< double >> *W, std::valarray< double > *D, double alpha, int R)']]], + ['upper_5fbound_3691',['upper_bound',['http://en.cppreference.com/w/cpp/container/multiset/upper_bound.html',0,'std::multiset::upper_bound()'],['http://en.cppreference.com/w/cpp/container/set/upper_bound.html',0,'std::set::upper_bound()'],['http://en.cppreference.com/w/cpp/container/map/upper_bound.html',0,'std::map::upper_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/upper_bound.html',0,'std::multimap::upper_bound()'],['http://en.cppreference.com/w/cpp/algorithm/upper_bound.html',0,'std::upper_bound()']]], + ['uppercase_3692',['uppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['use_5fcount_3693',['use_count',['http://en.cppreference.com/w/cpp/memory/weak_ptr/use_count.html',0,'std::weak_ptr']]], + ['use_5ffacet_3694',['use_facet',['http://en.cppreference.com/w/cpp/locale/use_facet.html',0,'std']]] +]; diff --git a/search/functions_16.html b/search/functions_16.html new file mode 100644 index 000000000..a42c03065 --- /dev/null +++ b/search/functions_16.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_16.js b/search/functions_16.js new file mode 100644 index 000000000..e5af06d07 --- /dev/null +++ b/search/functions_16.js @@ -0,0 +1,25 @@ +var searchData= +[ + ['valid_3695',['valid',['http://en.cppreference.com/w/cpp/thread/shared_future/valid.html',0,'std::shared_future::valid()'],['http://en.cppreference.com/w/cpp/thread/future/valid.html',0,'std::future::valid()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/valid.html',0,'std::packaged_task::valid()']]], + ['value_3696',['value',['http://en.cppreference.com/w/cpp/error/error_code/value.html',0,'std::error_code::value()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/value.html',0,'std::regex_traits::value()'],['http://en.cppreference.com/w/cpp/error/error_condition/value.html',0,'std::error_condition::value()'],['http://en.cppreference.com/w/cpp/experimental/optional/value.html',0,'std::experimental::optional::value()']]], + ['value_5fcomp_3697',['value_comp',['http://en.cppreference.com/w/cpp/container/multiset/value_comp.html',0,'std::multiset::value_comp()'],['http://en.cppreference.com/w/cpp/container/set/value_comp.html',0,'std::set::value_comp()'],['http://en.cppreference.com/w/cpp/container/map/value_comp.html',0,'std::map::value_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/value_comp.html',0,'std::multimap::value_comp()']]], + ['value_5for_3698',['value_or',['http://en.cppreference.com/w/cpp/experimental/optional/value_or.html',0,'std::experimental::optional']]], + ['variance_3699',['variance',['../d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92',1,'statistics::stats_computer1::variance()'],['../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555',1,'statistics::stats_computer2::variance()']]], + ['vector_3700',['vector',['http://en.cppreference.com/w/cpp/container/vector/vector.html',0,'std::vector']]], + ['vector_5fdot_3701',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]], + ['vector_5fmag_3702',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]], + ['vector_5fproj_3703',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a5422c76bfa322620de611083bd518d71',1,'qr_algorithm']]], + ['vfprintf_3704',['vfprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vfscanf_3705',['vfscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vfwprintf_3706',['vfwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vfwscanf_3707',['vfwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], + ['vprintf_3708',['vprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vscanf_3709',['vscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vsnprintf_3710',['vsnprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vsprintf_3711',['vsprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vsscanf_3712',['vsscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vswprintf_3713',['vswprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vswscanf_3714',['vswscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], + ['vwprintf_3715',['vwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vwscanf_3716',['vwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]] +]; diff --git a/search/functions_17.html b/search/functions_17.html new file mode 100644 index 000000000..dc805abb9 --- /dev/null +++ b/search/functions_17.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_17.js b/search/functions_17.js new file mode 100644 index 000000000..63e71d4bf --- /dev/null +++ b/search/functions_17.js @@ -0,0 +1,76 @@ +var searchData= +[ + ['wait_3717',['wait',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait.html',0,'std::condition_variable_any::wait()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait.html',0,'std::condition_variable::wait()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait.html',0,'std::shared_future::wait()'],['http://en.cppreference.com/w/cpp/thread/future/wait.html',0,'std::future::wait()']]], + ['wait_5ffor_3718',['wait_for',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_for.html',0,'std::condition_variable_any::wait_for()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_for.html',0,'std::condition_variable::wait_for()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_for.html',0,'std::shared_future::wait_for()'],['http://en.cppreference.com/w/cpp/thread/future/wait_for.html',0,'std::future::wait_for()']]], + ['wait_5funtil_3719',['wait_until',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/wait_until.html',0,'std::condition_variable_any::wait_until()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/wait_until.html',0,'std::condition_variable::wait_until()'],['http://en.cppreference.com/w/cpp/thread/shared_future/wait_until.html',0,'std::shared_future::wait_until()'],['http://en.cppreference.com/w/cpp/thread/future/wait_until.html',0,'std::future::wait_until()']]], + ['wbuffer_5fconvert_3720',['wbuffer_convert',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/wbuffer_convert.html',0,'std::wbuffer_convert']]], + ['wcmatch_3721',['wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wcmatch']]], + ['wcregex_5fiterator_3722',['wcregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wcregex_iterator']]], + ['wcregex_5ftoken_5fiterator_3723',['wcregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wcregex_token_iterator']]], + ['wcrtomb_3724',['wcrtomb',['http://en.cppreference.com/w/cpp/string/multibyte/wcrtomb.html',0,'std']]], + ['wcscat_3725',['wcscat',['http://en.cppreference.com/w/cpp/string/wide/wcscat.html',0,'std']]], + ['wcschr_3726',['wcschr',['http://en.cppreference.com/w/cpp/string/wide/wcschr.html',0,'std']]], + ['wcscmp_3727',['wcscmp',['http://en.cppreference.com/w/cpp/string/wide/wcscmp.html',0,'std']]], + ['wcscoll_3728',['wcscoll',['http://en.cppreference.com/w/cpp/string/wide/wcscoll.html',0,'std']]], + ['wcscpy_3729',['wcscpy',['http://en.cppreference.com/w/cpp/string/wide/wcscpy.html',0,'std']]], + ['wcscspn_3730',['wcscspn',['http://en.cppreference.com/w/cpp/string/wide/wcscspn.html',0,'std']]], + ['wcsftime_3731',['wcsftime',['http://en.cppreference.com/w/cpp/chrono/c/wcsftime.html',0,'std']]], + ['wcslen_3732',['wcslen',['http://en.cppreference.com/w/cpp/string/wide/wcslen.html',0,'std']]], + ['wcsncat_3733',['wcsncat',['http://en.cppreference.com/w/cpp/string/wide/wcsncat.html',0,'std']]], + ['wcsncmp_3734',['wcsncmp',['http://en.cppreference.com/w/cpp/string/wide/wcsncmp.html',0,'std']]], + ['wcsncpy_3735',['wcsncpy',['http://en.cppreference.com/w/cpp/string/wide/wcsncpy.html',0,'std']]], + ['wcspbrk_3736',['wcspbrk',['http://en.cppreference.com/w/cpp/string/wide/wcspbrk.html',0,'std']]], + ['wcsrchr_3737',['wcsrchr',['http://en.cppreference.com/w/cpp/string/wide/wcsrchr.html',0,'std']]], + ['wcsspn_3738',['wcsspn',['http://en.cppreference.com/w/cpp/string/wide/wcsspn.html',0,'std']]], + ['wcsstr_3739',['wcsstr',['http://en.cppreference.com/w/cpp/string/wide/wcsstr.html',0,'std']]], + ['wcstod_3740',['wcstod',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]], + ['wcstof_3741',['wcstof',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]], + ['wcstoimax_3742',['wcstoimax',['http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html',0,'std']]], + ['wcstok_3743',['wcstok',['http://en.cppreference.com/w/cpp/string/wide/wcstok.html',0,'std']]], + ['wcstol_3744',['wcstol',['http://en.cppreference.com/w/cpp/string/wide/wcstol.html',0,'std']]], + ['wcstold_3745',['wcstold',['http://en.cppreference.com/w/cpp/string/wide/wcstof.html',0,'std']]], + ['wcstoll_3746',['wcstoll',['http://en.cppreference.com/w/cpp/string/wide/wcstol.html',0,'std']]], + ['wcstombs_3747',['wcstombs',['http://en.cppreference.com/w/cpp/string/multibyte/wcstombs.html',0,'std']]], + ['wcstoul_3748',['wcstoul',['http://en.cppreference.com/w/cpp/string/wide/wcstoul.html',0,'std']]], + ['wcstoull_3749',['wcstoull',['http://en.cppreference.com/w/cpp/string/wide/wcstoul.html',0,'std']]], + ['wcstoumax_3750',['wcstoumax',['http://en.cppreference.com/w/cpp/string/wide/wcstoimax.html',0,'std']]], + ['wcsub_5fmatch_3751',['wcsub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wcsub_match']]], + ['wcsxfrm_3752',['wcsxfrm',['http://en.cppreference.com/w/cpp/string/wide/wcsxfrm.html',0,'std']]], + ['wctob_3753',['wctob',['http://en.cppreference.com/w/cpp/string/multibyte/wctob.html',0,'std']]], + ['wctomb_3754',['wctomb',['http://en.cppreference.com/w/cpp/string/multibyte/wctomb.html',0,'std']]], + ['wctrans_3755',['wctrans',['http://en.cppreference.com/w/cpp/string/wide/wctrans.html',0,'std']]], + ['wctype_3756',['wctype',['http://en.cppreference.com/w/cpp/string/wide/wctype.html',0,'std']]], + ['weak_5fptr_3757',['weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr/weak_ptr.html',0,'std::weak_ptr']]], + ['weibull_5fdistribution_3758',['weibull_distribution',['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/weibull_distribution.html',0,'std::weibull_distribution']]], + ['wfilebuf_3759',['wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::wfilebuf']]], + ['wfstream_3760',['wfstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::wfstream']]], + ['what_3761',['what',['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::runtime_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_new_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_typeid::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ios::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::logic_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_alloc::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_fstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_function_call::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::range_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::invalid_argument::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ios_base::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::out_of_range::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::domain_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::overflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::strstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_stringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::future_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wostringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_cast::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wiostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ofstream::failure::what()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_array_length::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::exception::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_optional_access::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::istream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ostrstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::bad_weak_ptr::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wfstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::basic_iostream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wofstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::underflow_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wstringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::regex_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::system_error::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::wistringstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::ifstream::failure::what()'],['http://en.cppreference.com/w/cpp/error/exception/what.html',0,'std::length_error::what()']]], + ['widen_3762',['widen',['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ofstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ios::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_fstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::strstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_stringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wostringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wiostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_istringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_ifstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istringstream::widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::istream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ostrstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wfstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::basic_iostream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wofstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wstringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::wistringstream::widen()'],['http://en.cppreference.com/w/cpp/io/basic_ios/widen.html',0,'std::ifstream::widen()']]], + ['width_3763',['width',['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ios::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_fstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ios_base::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::strstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_stringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wostringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wiostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_ifstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::istream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ostrstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wfstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::basic_iostream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wofstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wstringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::wistringstream::width()'],['http://en.cppreference.com/w/cpp/io/ios_base/width.html',0,'std::ifstream::width()']]], + ['wifstream_3764',['wifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::wifstream']]], + ['wiostream_3765',['wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::wiostream']]], + ['wistream_3766',['wistream',['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::wistream']]], + ['wistringstream_3767',['wistringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::wistringstream']]], + ['wmemchr_3768',['wmemchr',['http://en.cppreference.com/w/cpp/string/wide/wmemchr.html',0,'std']]], + ['wmemcmp_3769',['wmemcmp',['http://en.cppreference.com/w/cpp/string/wide/wmemcmp.html',0,'std']]], + ['wmemcpy_3770',['wmemcpy',['http://en.cppreference.com/w/cpp/string/wide/wmemcpy.html',0,'std']]], + ['wmemmove_3771',['wmemmove',['http://en.cppreference.com/w/cpp/string/wide/wmemmove.html',0,'std']]], + ['wmemset_3772',['wmemset',['http://en.cppreference.com/w/cpp/string/wide/wmemset.html',0,'std']]], + ['wofstream_3773',['wofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::wofstream']]], + ['wostream_3774',['wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::wostream']]], + ['wostringstream_3775',['wostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::wostringstream']]], + ['wprintf_3776',['wprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['wregex_3777',['wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::wregex']]], + ['write_3778',['write',['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_fstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::strstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_stringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wostringstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_ostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wiostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::ostrstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wfstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::basic_iostream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wofstream::write()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/write.html',0,'std::wstringstream::write()']]], + ['ws_3779',['ws',['http://en.cppreference.com/w/cpp/io/manip/ws.html',0,'std']]], + ['wscanf_3780',['wscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]], + ['wsmatch_3781',['wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::wsmatch']]], + ['wsregex_5fiterator_3782',['wsregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::wsregex_iterator']]], + ['wsregex_5ftoken_5fiterator_3783',['wsregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::wsregex_token_iterator']]], + ['wssub_5fmatch_3784',['wssub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::wssub_match']]], + ['wstreambuf_3785',['wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::wstreambuf']]], + ['wstring_3786',['wstring',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::wstring']]], + ['wstring_5fconvert_3787',['wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert/wstring_convert.html',0,'std::wstring_convert']]], + ['wstringbuf_3788',['wstringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::wstringbuf']]], + ['wstringstream_3789',['wstringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::wstringstream']]] +]; diff --git a/search/functions_18.html b/search/functions_18.html new file mode 100644 index 000000000..969c47752 --- /dev/null +++ b/search/functions_18.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_18.js b/search/functions_18.js new file mode 100644 index 000000000..60fdc4b65 --- /dev/null +++ b/search/functions_18.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['xalloc_3790',['xalloc',['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ios::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_fstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ios_base::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::strstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_stringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wostringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wiostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_ifstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::istream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ostrstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wfstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::basic_iostream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wofstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wstringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::wistringstream::xalloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/xalloc.html',0,'std::ifstream::xalloc()']]], + ['xsgetn_3791',['xsgetn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wfilebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::wstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::strstreambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_stringbuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::basic_streambuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::filebuf::xsgetn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sgetn.html',0,'std::streambuf::xsgetn()']]], + ['xsputn_3792',['xsputn',['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_filebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::stringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wfilebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::wstreambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::strstreambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_stringbuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::basic_streambuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::filebuf::xsputn()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/sputn.html',0,'std::streambuf::xsputn()']]] +]; diff --git a/search/functions_19.html b/search/functions_19.html new file mode 100644 index 000000000..5ca95eb6d --- /dev/null +++ b/search/functions_19.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_19.js b/search/functions_19.js new file mode 100644 index 000000000..b5a93e952 --- /dev/null +++ b/search/functions_19.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['yield_3793',['yield',['http://en.cppreference.com/w/cpp/thread/yield.html',0,'std::this_thread']]] +]; diff --git a/search/functions_1a.html b/search/functions_1a.html new file mode 100644 index 000000000..aac6cf0b8 --- /dev/null +++ b/search/functions_1a.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_1a.js b/search/functions_1a.js new file mode 100644 index 000000000..4888c656e --- /dev/null +++ b/search/functions_1a.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['zero_3794',['zero',['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::minutes::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::seconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::duration::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::milliseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::hours::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/zero.html',0,'std::chrono::duration_values::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::microseconds::zero()'],['http://en.cppreference.com/w/cpp/chrono/duration/zero.html',0,'std::chrono::nanoseconds::zero()']]] +]; diff --git a/search/functions_1b.html b/search/functions_1b.html new file mode 100644 index 000000000..c66ea08b1 --- /dev/null +++ b/search/functions_1b.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_1b.js b/search/functions_1b.js new file mode 100644 index 000000000..2560ead3c --- /dev/null +++ b/search/functions_1b.js @@ -0,0 +1,94 @@ +var searchData= +[ + ['_7eallocator_3795',['~allocator',['http://en.cppreference.com/w/cpp/memory/allocator/~allocator.html',0,'std::allocator']]], + ['_7eauto_5fptr_3796',['~auto_ptr',['http://en.cppreference.com/w/cpp/memory/auto_ptr/~auto_ptr.html',0,'std::auto_ptr']]], + ['_7ebasic_5ffilebuf_3797',['~basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::basic_filebuf']]], + ['_7ebasic_5fios_3798',['~basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios/~basic_ios.html',0,'std::basic_ios']]], + ['_7ebasic_5fiostream_3799',['~basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::basic_iostream']]], + ['_7ebasic_5fistream_3800',['~basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::basic_istream']]], + ['_7ebasic_5fostream_3801',['~basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::basic_ostream']]], + ['_7ebasic_5fregex_3802',['~basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::basic_regex']]], + ['_7ebasic_5fstreambuf_3803',['~basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::basic_streambuf']]], + ['_7ecmatch_3804',['~cmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::cmatch']]], + ['_7ecodecvt_3805',['~codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt/~codecvt.html',0,'std::codecvt']]], + ['_7ecodecvt_5fbyname_3806',['~codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname']]], + ['_7ecollate_3807',['~collate',['http://en.cppreference.com/w/cpp/locale/collate/~collate.html',0,'std::collate']]], + ['_7ecollate_5fbyname_3808',['~collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname']]], + ['_7econdition_5fvariable_3809',['~condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/~condition_variable.html',0,'std::condition_variable']]], + ['_7econdition_5fvariable_5fany_3810',['~condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/~condition_variable_any.html',0,'std::condition_variable_any']]], + ['_7ectype_3811',['~ctype',['http://en.cppreference.com/w/cpp/locale/ctype/~ctype.html',0,'std::ctype']]], + ['_7ectype_5fbyname_3812',['~ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]], + ['_7edeque_3813',['~deque',['http://en.cppreference.com/w/cpp/container/deque/~deque.html',0,'std::deque']]], + ['_7edynarray_3814',['~dynarray',['http://en.cppreference.com/w/cpp/container/dynarray/~dynarray.html',0,'std::dynarray']]], + ['_7eenable_5fshared_5ffrom_5fthis_3815',['~enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/~enable_shared_from_this.html',0,'std::enable_shared_from_this']]], + ['_7eerror_5fcategory_3816',['~error_category',['http://en.cppreference.com/w/cpp/error/error_category/~error_category.html',0,'std::error_category']]], + ['_7eexception_3817',['~exception',['http://en.cppreference.com/w/cpp/error/exception/~exception.html',0,'std::exception']]], + ['_7efilebuf_3818',['~filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::filebuf']]], + ['_7eforward_5flist_3819',['~forward_list',['http://en.cppreference.com/w/cpp/container/forward_list/~forward_list.html',0,'std::forward_list']]], + ['_7efunction_3820',['~function',['http://en.cppreference.com/w/cpp/utility/functional/function/~function.html',0,'std::function']]], + ['_7efuture_3821',['~future',['http://en.cppreference.com/w/cpp/thread/future/~future.html',0,'std::future']]], + ['_7eios_5fbase_3822',['~ios_base',['http://en.cppreference.com/w/cpp/io/ios_base/~ios_base.html',0,'std::ios_base']]], + ['_7eiostream_3823',['~iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::iostream']]], + ['_7eistream_3824',['~istream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::istream']]], + ['_7eistrstream_3825',['~istrstream',['http://en.cppreference.com/w/cpp/io/istrstream/~istrstream.html',0,'std::istrstream']]], + ['_7elist_3826',['~list',['http://en.cppreference.com/w/cpp/container/list/~list.html',0,'std::list']]], + ['_7elocale_3827',['~locale',['http://en.cppreference.com/w/cpp/locale/locale/~locale.html',0,'std::locale']]], + ['_7elock_5fguard_3828',['~lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard/~lock_guard.html',0,'std::lock_guard']]], + ['_7emap_3829',['~map',['http://en.cppreference.com/w/cpp/container/map/~map.html',0,'std::map']]], + ['_7ematch_5fresults_3830',['~match_results',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::match_results']]], + ['_7emessages_3831',['~messages',['http://en.cppreference.com/w/cpp/locale/messages/~messages.html',0,'std::messages']]], + ['_7emessages_5fbyname_3832',['~messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname']]], + ['_7emoney_5fget_3833',['~money_get',['http://en.cppreference.com/w/cpp/locale/money_get/~money_get.html',0,'std::money_get']]], + ['_7emoney_5fput_3834',['~money_put',['http://en.cppreference.com/w/cpp/locale/money_put/~money_put.html',0,'std::money_put']]], + ['_7emoneypunct_3835',['~moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct/~moneypunct.html',0,'std::moneypunct']]], + ['_7emoneypunct_5fbyname_3836',['~moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname']]], + ['_7emultimap_3837',['~multimap',['http://en.cppreference.com/w/cpp/container/multimap/~multimap.html',0,'std::multimap']]], + ['_7emultiset_3838',['~multiset',['http://en.cppreference.com/w/cpp/container/multiset/~multiset.html',0,'std::multiset']]], + ['_7enested_5fexception_3839',['~nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception/~nested_exception.html',0,'std::nested_exception']]], + ['_7enum_5fget_3840',['~num_get',['http://en.cppreference.com/w/cpp/locale/num_get/~num_get.html',0,'std::num_get']]], + ['_7enum_5fput_3841',['~num_put',['http://en.cppreference.com/w/cpp/locale/num_put/~num_put.html',0,'std::num_put']]], + ['_7enumpunct_3842',['~numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct/~numpunct.html',0,'std::numpunct']]], + ['_7enumpunct_5fbyname_3843',['~numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname']]], + ['_7eoptional_3844',['~optional',['http://en.cppreference.com/w/cpp/experimental/optional/~optional.html',0,'std::experimental::optional']]], + ['_7eostream_3845',['~ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::ostream']]], + ['_7eostrstream_3846',['~ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream/~ostrstream.html',0,'std::ostrstream']]], + ['_7epackaged_5ftask_3847',['~packaged_task',['http://en.cppreference.com/w/cpp/thread/packaged_task/~packaged_task.html',0,'std::packaged_task']]], + ['_7epriority_5fqueue_3848',['~priority_queue',['http://en.cppreference.com/w/cpp/container/priority_queue/~priority_queue.html',0,'std::priority_queue']]], + ['_7epromise_3849',['~promise',['http://en.cppreference.com/w/cpp/thread/promise/~promise.html',0,'std::promise']]], + ['_7equeue_3850',['~queue',['http://en.cppreference.com/w/cpp/container/queue/~queue.html',0,'std::queue::~queue()'],['../d2/d36/structqueue.html#ad215eee654953d25150bb25d5ac12b7c',1,'queue::~queue()']]], + ['_7eregex_3851',['~regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::regex']]], + ['_7escoped_5fallocator_5fadaptor_3852',['~scoped_allocator_adaptor',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/~scoped_allocator_adaptor.html',0,'std::scoped_allocator_adaptor']]], + ['_7esentry_3853',['~sentry',['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::~sentry()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::~sentry()']]], + ['_7eset_3854',['~set',['http://en.cppreference.com/w/cpp/container/set/~set.html',0,'std::set']]], + ['_7eshared_5ffuture_3855',['~shared_future',['http://en.cppreference.com/w/cpp/thread/shared_future/~shared_future.html',0,'std::shared_future']]], + ['_7eshared_5flock_3856',['~shared_lock',['http://en.cppreference.com/w/cpp/thread/shared_lock/~shared_lock.html',0,'std::shared_lock']]], + ['_7eshared_5fptr_3857',['~shared_ptr',['http://en.cppreference.com/w/cpp/memory/shared_ptr/~shared_ptr.html',0,'std::shared_ptr']]], + ['_7esmatch_3858',['~smatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::smatch']]], + ['_7estack_3859',['~stack',['http://en.cppreference.com/w/cpp/container/stack/~stack.html',0,'std::stack::~stack()'],['../d1/dc2/classstack.html#a0ac1dba9c7019acdc825b31d06eb0b71',1,'stack::~stack()']]], + ['_7estreambuf_3860',['~streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::streambuf']]], + ['_7estrstream_3861',['~strstream',['http://en.cppreference.com/w/cpp/io/strstream/~strstream.html',0,'std::strstream']]], + ['_7estrstreambuf_3862',['~strstreambuf',['http://en.cppreference.com/w/cpp/io/strstreambuf/~strstreambuf.html',0,'std::strstreambuf']]], + ['_7ethread_3863',['~thread',['http://en.cppreference.com/w/cpp/thread/thread/~thread.html',0,'std::thread']]], + ['_7etime_5fget_3864',['~time_get',['http://en.cppreference.com/w/cpp/locale/time_get/~time_get.html',0,'std::time_get']]], + ['_7etime_5fget_5fbyname_3865',['~time_get_byname',['http://en.cppreference.com/w/cpp/locale/time_get_byname.html',0,'std::time_get_byname']]], + ['_7etime_5fput_3866',['~time_put',['http://en.cppreference.com/w/cpp/locale/time_put/~time_put.html',0,'std::time_put']]], + ['_7etime_5fput_5fbyname_3867',['~time_put_byname',['http://en.cppreference.com/w/cpp/locale/time_put_byname.html',0,'std::time_put_byname']]], + ['_7eunique_5flock_3868',['~unique_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/~unique_lock.html',0,'std::unique_lock']]], + ['_7eunique_5fptr_3869',['~unique_ptr',['http://en.cppreference.com/w/cpp/memory/unique_ptr/~unique_ptr.html',0,'std::unique_ptr']]], + ['_7eunordered_5fmap_3870',['~unordered_map',['http://en.cppreference.com/w/cpp/container/unordered_map/~unordered_map.html',0,'std::unordered_map']]], + ['_7eunordered_5fmultimap_3871',['~unordered_multimap',['http://en.cppreference.com/w/cpp/container/unordered_multimap/~unordered_multimap.html',0,'std::unordered_multimap']]], + ['_7eunordered_5fmultiset_3872',['~unordered_multiset',['http://en.cppreference.com/w/cpp/container/unordered_multiset/~unordered_multiset.html',0,'std::unordered_multiset']]], + ['_7eunordered_5fset_3873',['~unordered_set',['http://en.cppreference.com/w/cpp/container/unordered_set/~unordered_set.html',0,'std::unordered_set']]], + ['_7evector_3874',['~vector',['http://en.cppreference.com/w/cpp/container/vector/~vector.html',0,'std::vector']]], + ['_7ewbuffer_5fconvert_3875',['~wbuffer_convert',['http://en.cppreference.com/w/cpp/locale/wbuffer_convert/~wbuffer_convert.html',0,'std::wbuffer_convert']]], + ['_7ewcmatch_3876',['~wcmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::wcmatch']]], + ['_7eweak_5fptr_3877',['~weak_ptr',['http://en.cppreference.com/w/cpp/memory/weak_ptr/~weak_ptr.html',0,'std::weak_ptr']]], + ['_7ewfilebuf_3878',['~wfilebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/~basic_filebuf.html',0,'std::wfilebuf']]], + ['_7ewiostream_3879',['~wiostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/~basic_iostream.html',0,'std::wiostream']]], + ['_7ewistream_3880',['~wistream',['http://en.cppreference.com/w/cpp/io/basic_istream/~basic_istream.html',0,'std::wistream']]], + ['_7ewostream_3881',['~wostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/~basic_ostream.html',0,'std::wostream']]], + ['_7ewregex_3882',['~wregex',['http://en.cppreference.com/w/cpp/regex/basic_regex/~basic_regex.html',0,'std::wregex']]], + ['_7ewsmatch_3883',['~wsmatch',['http://en.cppreference.com/w/cpp/regex/match_results/~match_results.html',0,'std::wsmatch']]], + ['_7ewstreambuf_3884',['~wstreambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/~basic_streambuf.html',0,'std::wstreambuf']]], + ['_7ewstring_5fconvert_3885',['~wstring_convert',['http://en.cppreference.com/w/cpp/locale/wstring_convert/~wstring_convert.html',0,'std::wstring_convert']]] +]; diff --git a/search/functions_2.html b/search/functions_2.html new file mode 100644 index 000000000..eb51f809f --- /dev/null +++ b/search/functions_2.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_2.js b/search/functions_2.js new file mode 100644 index 000000000..361955fab --- /dev/null +++ b/search/functions_2.js @@ -0,0 +1,59 @@ +var searchData= +[ + ['b_2552',['b',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/params.html',0,'std::extreme_value_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/params.html',0,'std::uniform_real_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/params.html',0,'std::weibull_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/params.html',0,'std::uniform_int_distribution::b()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/params.html',0,'std::cauchy_distribution::b()']]], + ['back_2553',['back',['http://en.cppreference.com/w/cpp/container/dynarray/back.html',0,'std::dynarray::back()'],['http://en.cppreference.com/w/cpp/container/vector/back.html',0,'std::vector::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::string::back()'],['http://en.cppreference.com/w/cpp/container/deque/back.html',0,'std::deque::back()'],['http://en.cppreference.com/w/cpp/container/queue/back.html',0,'std::queue::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::basic_string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::wstring::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u16string::back()'],['http://en.cppreference.com/w/cpp/string/basic_string/back.html',0,'std::u32string::back()'],['http://en.cppreference.com/w/cpp/container/list/back.html',0,'std::list::back()'],['http://en.cppreference.com/w/cpp/container/array/back.html',0,'std::array::back()']]], + ['back_5finserter_2554',['back_inserter',['http://en.cppreference.com/w/cpp/iterator/back_inserter.html',0,'std']]], + ['bad_2555',['bad',['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ios::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_fstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::strstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_stringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wostringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wiostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_ifstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::istream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ostrstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wfstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::basic_iostream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wofstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wstringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::wistringstream::bad()'],['http://en.cppreference.com/w/cpp/io/basic_ios/bad.html',0,'std::ifstream::bad()']]], + ['bad_5falloc_2556',['bad_alloc',['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc']]], + ['bad_5farray_5flength_2557',['bad_array_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_length.html',0,'std::bad_array_length']]], + ['bad_5farray_5fnew_5flength_2558',['bad_array_new_length',['http://en.cppreference.com/w/cpp/memory/new/bad_array_new_length/bad_array_new_length.html',0,'std::bad_array_new_length']]], + ['bad_5fcast_2559',['bad_cast',['http://en.cppreference.com/w/cpp/types/bad_cast/bad_cast.html',0,'std::bad_cast']]], + ['bad_5ffunction_5fcall_2560',['bad_function_call',['http://en.cppreference.com/w/cpp/utility/functional/bad_function_call.html',0,'std::bad_function_call']]], + ['bad_5foptional_5faccess_2561',['bad_optional_access',['http://en.cppreference.com/w/cpp/utility/bad_optional_access.html',0,'std::bad_optional_access']]], + ['bad_5ftypeid_2562',['bad_typeid',['http://en.cppreference.com/w/cpp/types/bad_typeid/bad_typeid.html',0,'std::bad_typeid']]], + ['bad_5fweak_5fptr_2563',['bad_weak_ptr',['http://en.cppreference.com/w/cpp/memory/bad_weak_ptr/bad_weak_ptr.html',0,'std::bad_weak_ptr']]], + ['base_2564',['base',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux48::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::discard_block_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/base.html',0,'std::independent_bits_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::shuffle_order_engine::base()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/base.html',0,'std::ranlux24::base()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/base.html',0,'std::knuth_b::base()']]], + ['basic_5ffilebuf_2565',['basic_filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::basic_filebuf']]], + ['basic_5ffstream_2566',['basic_fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::basic_fstream']]], + ['basic_5fifstream_2567',['basic_ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::basic_ifstream']]], + ['basic_5fios_2568',['basic_ios',['http://en.cppreference.com/w/cpp/io/basic_ios/basic_ios.html',0,'std::basic_ios']]], + ['basic_5fiostream_2569',['basic_iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::basic_iostream']]], + ['basic_5fistream_2570',['basic_istream',['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::basic_istream']]], + ['basic_5fistringstream_2571',['basic_istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::basic_istringstream']]], + ['basic_5fofstream_2572',['basic_ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::basic_ofstream']]], + ['basic_5fostream_2573',['basic_ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::basic_ostream']]], + ['basic_5fostringstream_2574',['basic_ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::basic_ostringstream']]], + ['basic_5fregex_2575',['basic_regex',['http://en.cppreference.com/w/cpp/regex/basic_regex/basic_regex.html',0,'std::basic_regex']]], + ['basic_5fstreambuf_2576',['basic_streambuf',['http://en.cppreference.com/w/cpp/io/basic_streambuf/basic_streambuf.html',0,'std::basic_streambuf']]], + ['basic_5fstring_2577',['basic_string',['http://en.cppreference.com/w/cpp/string/basic_string/basic_string.html',0,'std::basic_string']]], + ['basic_5fstringbuf_2578',['basic_stringbuf',['http://en.cppreference.com/w/cpp/io/basic_stringbuf/basic_stringbuf.html',0,'std::basic_stringbuf']]], + ['basic_5fstringstream_2579',['basic_stringstream',['http://en.cppreference.com/w/cpp/io/basic_stringstream/basic_stringstream.html',0,'std::basic_stringstream']]], + ['bayes_5fagivenb_2580',['bayes_AgivenB',['../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba',1,'bayes_theorem.cpp']]], + ['bayes_5fbgivena_2581',['bayes_BgivenA',['../d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f',1,'bayes_theorem.cpp']]], + ['before_2582',['before',['http://en.cppreference.com/w/cpp/types/type_info/before.html',0,'std::type_info']]], + ['before_5fbegin_2583',['before_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], + ['begin_2584',['begin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::begin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::begin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::begin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::begin()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/begin.html',0,'std::initializer_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::begin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::begin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::begin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::begin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::begin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::begin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::begin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::begin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::begin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::begin()'],['http://en.cppreference.com/w/cpp/iterator/begin.html',0,'std::begin()']]], + ['begin_28int_29_2585',['begin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::begin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::begin(int)()']]], + ['bernoulli_5fdistribution_2586',['bernoulli_distribution',['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/bernoulli_distribution.html',0,'std::bernoulli_distribution']]], + ['beta_2587',['beta',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/params.html',0,'std::gamma_distribution']]], + ['binary_5fnegate_2588',['binary_negate',['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate']]], + ['binary_5fs_2589',['binary_s',['../d8/d8a/exponential__search_8cpp.html#a0f697e2a3b5193324ab84bd4045088f7',1,'exponential_search.cpp']]], + ['binary_5fsearch_2590',['binary_search',['http://en.cppreference.com/w/cpp/algorithm/binary_search.html',0,'std::binary_search()'],['../df/dd5/binary__search_8cpp.html#a78df202b718cfe3c2c9216979b08298d',1,'binary_search(): binary_search.cpp']]], + ['bind_2591',['bind',['http://en.cppreference.com/w/cpp/utility/functional/bind.html',0,'std']]], + ['binexpo_2592',['binExpo',['../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73',1,'binExpo(int a, int b): binary_exponent.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4',1,'binExpo(int64_t a, int64_t b, int64_t m): modular_inverse_fermat_little_theorem.cpp']]], + ['binexpo_5falt_2593',['binExpo_alt',['../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f',1,'binary_exponent.cpp']]], + ['binomial_5fdistribution_2594',['binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/binomial_distribution.html',0,'std::binomial_distribution']]], + ['binomial_5fexpected_2595',['binomial_expected',['../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813',1,'binomial_dist.cpp']]], + ['binomial_5frange_5fsuccesses_2596',['binomial_range_successes',['../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25',1,'binomial_dist.cpp']]], + ['binomial_5fstandard_5fdeviation_2597',['binomial_standard_deviation',['../d6/db0/binomial__dist_8cpp.html#af09e51f513cee647d41192ab0a872cdc',1,'binomial_dist.cpp']]], + ['binomial_5fvariance_2598',['binomial_variance',['../d6/db0/binomial__dist_8cpp.html#acd4dd4558031e4c5d045c801f73d8861',1,'binomial_dist.cpp']]], + ['binomial_5fx_5fsuccesses_2599',['binomial_x_successes',['../d6/db0/binomial__dist_8cpp.html#a19ae0a6a2bd200fd1eb0e31b2bf4cc76',1,'binomial_dist.cpp']]], + ['bitset_2600',['bitset',['http://en.cppreference.com/w/cpp/utility/bitset/bitset.html',0,'std::bitset']]], + ['boolalpha_2601',['boolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], + ['brute_5fforce_2602',['brute_force',['../d9/d03/namespacestring__search.html#aeb2cd81064717aedd62bfb096b1a73d8',1,'string_search']]], + ['bsearch_2603',['bsearch',['http://en.cppreference.com/w/cpp/algorithm/bsearch.html',0,'std']]], + ['btowc_2604',['btowc',['http://en.cppreference.com/w/cpp/string/multibyte/btowc.html',0,'std']]], + ['bucket_2605',['bucket',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket.html',0,'std::unordered_map::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket.html',0,'std::unordered_multimap::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket.html',0,'std::unordered_multiset::bucket()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket.html',0,'std::unordered_set::bucket()']]], + ['bucket_5fcount_2606',['bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_count.html',0,'std::unordered_map::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_count.html',0,'std::unordered_multimap::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_count.html',0,'std::unordered_multiset::bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_count.html',0,'std::unordered_set::bucket_count()']]], + ['bucket_5fsize_2607',['bucket_size',['http://en.cppreference.com/w/cpp/container/unordered_map/bucket_size.html',0,'std::unordered_map::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/bucket_size.html',0,'std::unordered_multimap::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/bucket_size.html',0,'std::unordered_multiset::bucket_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/bucket_size.html',0,'std::unordered_set::bucket_size()']]] +]; diff --git a/search/functions_3.html b/search/functions_3.html new file mode 100644 index 000000000..e53b9d011 --- /dev/null +++ b/search/functions_3.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_3.js b/search/functions_3.js new file mode 100644 index 000000000..fdd9348af --- /dev/null +++ b/search/functions_3.js @@ -0,0 +1,71 @@ +var searchData= +[ + ['c16rtomb_2608',['c16rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c16rtomb.html',0,'std']]], + ['c32rtomb_2609',['c32rtomb',['http://en.cppreference.com/w/cpp/string/multibyte/c32rtomb.html',0,'std']]], + ['c_5fstr_2610',['c_str',['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::basic_string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::wstring::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u16string::c_str()'],['http://en.cppreference.com/w/cpp/string/basic_string/c_str.html',0,'std::u32string::c_str()']]], + ['call_5fonce_2611',['call_once',['http://en.cppreference.com/w/cpp/thread/call_once.html',0,'std']]], + ['calloc_2612',['calloc',['http://en.cppreference.com/w/cpp/memory/c/calloc.html',0,'std']]], + ['capacity_2613',['capacity',['http://en.cppreference.com/w/cpp/container/vector/capacity.html',0,'std::vector::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::basic_string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::wstring::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u16string::capacity()'],['http://en.cppreference.com/w/cpp/string/basic_string/capacity.html',0,'std::u32string::capacity()']]], + ['category_2614',['category',['http://en.cppreference.com/w/cpp/error/error_code/category.html',0,'std::error_code::category()'],['http://en.cppreference.com/w/cpp/error/error_condition/category.html',0,'std::error_condition::category()']]], + ['cauchy_5fdistribution_2615',['cauchy_distribution',['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/cauchy_distribution.html',0,'std::cauchy_distribution']]], + ['cbefore_5fbegin_2616',['cbefore_begin',['http://en.cppreference.com/w/cpp/container/forward_list/before_begin.html',0,'std::forward_list']]], + ['cbegin_2617',['cbegin',['http://en.cppreference.com/w/cpp/container/dynarray/begin.html',0,'std::dynarray::cbegin()'],['http://en.cppreference.com/w/cpp/container/vector/begin.html',0,'std::vector::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::match_results::cbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/begin.html',0,'std::multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::string::cbegin()'],['http://en.cppreference.com/w/cpp/container/set/begin.html',0,'std::set::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_map/begin.html',0,'std::unordered_map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wsmatch::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::smatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin.html',0,'std::unordered_multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/forward_list/begin.html',0,'std::forward_list::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::wcmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/deque/begin.html',0,'std::deque::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::basic_string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::wstring::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin.html',0,'std::unordered_multiset::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u16string::cbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/begin.html',0,'std::u32string::cbegin()'],['http://en.cppreference.com/w/cpp/container/list/begin.html',0,'std::list::cbegin()'],['http://en.cppreference.com/w/cpp/container/map/begin.html',0,'std::map::cbegin()'],['http://en.cppreference.com/w/cpp/regex/match_results/begin.html',0,'std::cmatch::cbegin()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin.html',0,'std::unordered_set::cbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/begin.html',0,'std::multimap::cbegin()'],['http://en.cppreference.com/w/cpp/container/array/begin.html',0,'std::array::cbegin()']]], + ['cbegin_28int_29_2618',['cbegin(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/begin2.html',0,'std::unordered_map::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/begin2.html',0,'std::unordered_multimap::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/begin2.html',0,'std::unordered_multiset::cbegin(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/begin2.html',0,'std::unordered_set::cbegin(int)()']]], + ['cbrt_2619',['cbrt',['http://en.cppreference.com/w/cpp/numeric/math/cbrt.html',0,'std']]], + ['ceil_2620',['ceil',['http://en.cppreference.com/w/cpp/numeric/math/ceil.html',0,'std']]], + ['cend_2621',['cend',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::cend()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::cend()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::cend()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::cend()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::cend()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::cend()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::cend()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::cend()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::cend()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::cend()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::cend()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::cend()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::cend()']]], + ['cend_28int_29_2622',['cend(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::cend(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::cend(int)()']]], + ['check_5fif_5fequal_2623',['check_if_equal',['../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd',1,'string_search']]], + ['check_5fsize_5fmatch_2624',['check_size_match',['../d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56',1,'machine_learning::adaline']]], + ['check_5ftermination_2625',['check_termination',['../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377',1,'durand_kerner_roots.cpp']]], + ['chi_5fsquared_5fdistribution_2626',['chi_squared_distribution',['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/chi_squared_distribution.html',0,'std::chi_squared_distribution']]], + ['circle_2627',['circle',['../d0/d01/smallest__circle_8cpp.html#a0b0676df8e4da7a08c7ccaecea344903',1,'smallest_circle.cpp']]], + ['classic_2628',['classic',['http://en.cppreference.com/w/cpp/locale/locale/classic.html',0,'std::locale']]], + ['clear_2629',['clear',['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::fstream::clear()'],['http://en.cppreference.com/w/cpp/container/vector/clear.html',0,'std::vector::clear()'],['http://en.cppreference.com/w/cpp/container/multiset/clear.html',0,'std::multiset::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostream::clear()'],['http://en.cppreference.com/w/cpp/container/set/clear.html',0,'std::set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_map/clear.html',0,'std::unordered_map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ios::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_fstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::stringstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/clear.html',0,'std::unordered_multimap::clear()'],['http://en.cppreference.com/w/cpp/container/forward_list/clear.html',0,'std::forward_list::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_code/clear.html',0,'std::error_code::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wifstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istream::clear()'],['http://en.cppreference.com/w/cpp/container/deque/clear.html',0,'std::deque::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::strstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_stringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::basic_string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wostringstream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::wstring::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/clear.html',0,'std::unordered_multiset::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ostream::clear()'],['http://en.cppreference.com/w/cpp/error/error_condition/clear.html',0,'std::error_condition::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u16string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wiostream::clear()'],['http://en.cppreference.com/w/cpp/string/basic_string/clear.html',0,'std::u32string::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_ifstream::clear()'],['http://en.cppreference.com/w/cpp/container/list/clear.html',0,'std::list::clear()'],['http://en.cppreference.com/w/cpp/container/map/clear.html',0,'std::map::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::istream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ostrstream::clear()'],['http://en.cppreference.com/w/cpp/container/unordered_set/clear.html',0,'std::unordered_set::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wfstream::clear()'],['http://en.cppreference.com/w/cpp/container/multimap/clear.html',0,'std::multimap::clear()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/clear.html',0,'std::atomic_flag::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::basic_iostream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wofstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wstringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::wistringstream::clear()'],['http://en.cppreference.com/w/cpp/io/basic_ios/clear.html',0,'std::ifstream::clear()'],['../d2/d36/structqueue.html#ab2019d91e28c06de325fb3076b93a930',1,'queue::clear()'],['../d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b',1,'stack::clear()']]], + ['clearerr_2630',['clearerr',['http://en.cppreference.com/w/cpp/io/c/clearerr.html',0,'std']]], + ['clock_2631',['clock',['http://en.cppreference.com/w/cpp/chrono/c/clock.html',0,'std']]], + ['close_2632',['close',['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::basic_ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::basic_filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::basic_fstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::wfilebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::wifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::close()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/close.html',0,'std::filebuf::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::ofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::basic_ifstream::close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::close()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/close.html',0,'std::wfstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/close.html',0,'std::wofstream::close()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/close.html',0,'std::ifstream::close()']]], + ['cmatch_2633',['cmatch',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::cmatch']]], + ['code_2634',['code',['http://en.cppreference.com/w/cpp/thread/future_error/code.html',0,'std::future_error::code()'],['http://en.cppreference.com/w/cpp/regex/regex_error/code.html',0,'std::regex_error::code()'],['http://en.cppreference.com/w/cpp/error/system_error/code.html',0,'std::system_error::code()']]], + ['codecvt_2635',['codecvt',['http://en.cppreference.com/w/cpp/locale/codecvt/codecvt.html',0,'std::codecvt']]], + ['codecvt_5fbyname_2636',['codecvt_byname',['http://en.cppreference.com/w/cpp/locale/codecvt_byname.html',0,'std::codecvt_byname']]], + ['collate_2637',['collate',['http://en.cppreference.com/w/cpp/locale/collate/collate.html',0,'std::collate']]], + ['collate_5fbyname_2638',['collate_byname',['http://en.cppreference.com/w/cpp/locale/collate_byname.html',0,'std::collate_byname']]], + ['combine_2639',['combine',['http://en.cppreference.com/w/cpp/locale/locale/combine.html',0,'std::locale']]], + ['comp_2640',['comp',['../d9/d69/median__search_8cpp.html#a3a66390d0e407dce4fcbf63a169c6c8f',1,'median_search.cpp']]], + ['compare_2641',['compare',['http://en.cppreference.com/w/cpp/string/char_traits/compare.html',0,'std::char_traits::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wcsub_match::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::wssub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::csub_match::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::ssub_match::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::basic_string::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::wstring::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u16string::compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::compare()'],['http://en.cppreference.com/w/cpp/string/basic_string/compare.html',0,'std::u32string::compare()'],['http://en.cppreference.com/w/cpp/regex/sub_match/compare.html',0,'std::sub_match::compare()'],['../d4/d7a/shell__sort2_8cpp.html#a7eb77daed2cf1513f6d68c47a1c2db1c',1,'compare(): shell_sort2.cpp']]], + ['compare_5fexchange_5fstrong_2642',['compare_exchange_strong',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], + ['compare_5fexchange_5fweak_2643',['compare_exchange_weak',['http://en.cppreference.com/w/cpp/atomic/atomic/compare_exchange.html',0,'std::atomic']]], + ['complex_2644',['complex',['http://en.cppreference.com/w/cpp/numeric/complex/complex.html',0,'std::complex']]], + ['complex_5fstr_2645',['complex_str',['../da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740',1,'durand_kerner_roots.cpp']]], + ['condition_5fvariable_2646',['condition_variable',['http://en.cppreference.com/w/cpp/thread/condition_variable/condition_variable.html',0,'std::condition_variable']]], + ['condition_5fvariable_5fany_2647',['condition_variable_any',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/condition_variable_any.html',0,'std::condition_variable_any']]], + ['const_5fpointer_5fcast_2648',['const_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['construct_2649',['construct',['http://en.cppreference.com/w/cpp/memory/allocator_traits/construct.html',0,'std::allocator_traits::construct()'],['http://en.cppreference.com/w/cpp/memory/allocator/construct.html',0,'std::allocator::construct()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/construct.html',0,'std::scoped_allocator_adaptor::construct()']]], + ['converted_2650',['converted',['http://en.cppreference.com/w/cpp/locale/wstring_convert/converted.html',0,'std::wstring_convert']]], + ['copy_2651',['copy',['http://en.cppreference.com/w/cpp/string/char_traits/copy.html',0,'std::char_traits::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::basic_string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::wstring::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u16string::copy()'],['http://en.cppreference.com/w/cpp/string/basic_string/copy.html',0,'std::u32string::copy()'],['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std::copy()']]], + ['copy_5fbackward_2652',['copy_backward',['http://en.cppreference.com/w/cpp/algorithm/copy_backward.html',0,'std']]], + ['copy_5fif_2653',['copy_if',['http://en.cppreference.com/w/cpp/algorithm/copy.html',0,'std']]], + ['copy_5fn_2654',['copy_n',['http://en.cppreference.com/w/cpp/algorithm/copy_n.html',0,'std']]], + ['copyfmt_2655',['copyfmt',['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ios::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_fstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::strstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_stringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wostringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wiostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_ifstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::istream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ostrstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wfstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::basic_iostream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wofstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wstringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::wistringstream::copyfmt()'],['http://en.cppreference.com/w/cpp/io/basic_ios/copyfmt.html',0,'std::ifstream::copyfmt()']]], + ['copysign_2656',['copysign',['http://en.cppreference.com/w/cpp/numeric/math/copysign.html',0,'std']]], + ['cos_2657',['cos',['http://en.cppreference.com/w/cpp/numeric/math/cos.html',0,'std']]], + ['cosh_2658',['cosh',['http://en.cppreference.com/w/cpp/numeric/math/cosh.html',0,'std']]], + ['count_2659',['count',['http://en.cppreference.com/w/cpp/container/multiset/count.html',0,'std::multiset::count()'],['http://en.cppreference.com/w/cpp/container/set/count.html',0,'std::set::count()'],['http://en.cppreference.com/w/cpp/container/unordered_map/count.html',0,'std::unordered_map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/count.html',0,'std::unordered_multimap::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::minutes::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::seconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::duration::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::milliseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::hours::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::microseconds::count()'],['http://en.cppreference.com/w/cpp/chrono/duration/count.html',0,'std::chrono::nanoseconds::count()'],['http://en.cppreference.com/w/cpp/utility/bitset/count.html',0,'std::bitset::count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/count.html',0,'std::unordered_multiset::count()'],['http://en.cppreference.com/w/cpp/container/map/count.html',0,'std::map::count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/count.html',0,'std::unordered_set::count()'],['http://en.cppreference.com/w/cpp/container/multimap/count.html',0,'std::multimap::count()'],['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std::count()']]], + ['count_5fif_2660',['count_if',['http://en.cppreference.com/w/cpp/algorithm/count.html',0,'std']]], + ['crbegin_2661',['crbegin',['http://en.cppreference.com/w/cpp/container/dynarray/rbegin.html',0,'std::dynarray::crbegin()'],['http://en.cppreference.com/w/cpp/container/vector/rbegin.html',0,'std::vector::crbegin()'],['http://en.cppreference.com/w/cpp/container/multiset/rbegin.html',0,'std::multiset::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::string::crbegin()'],['http://en.cppreference.com/w/cpp/container/set/rbegin.html',0,'std::set::crbegin()'],['http://en.cppreference.com/w/cpp/container/deque/rbegin.html',0,'std::deque::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::basic_string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::wstring::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u16string::crbegin()'],['http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html',0,'std::u32string::crbegin()'],['http://en.cppreference.com/w/cpp/container/list/rbegin.html',0,'std::list::crbegin()'],['http://en.cppreference.com/w/cpp/container/map/rbegin.html',0,'std::map::crbegin()'],['http://en.cppreference.com/w/cpp/container/multimap/rbegin.html',0,'std::multimap::crbegin()'],['http://en.cppreference.com/w/cpp/container/array/rbegin.html',0,'std::array::crbegin()']]], + ['create_5fhash_2662',['create_hash',['../d9/d03/namespacestring__search.html#a8fb0bc932ba8b582c9f4c71338d050f8',1,'string_search']]], + ['create_5flist_2663',['create_list',['../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5',1,'hash_search.cpp']]], + ['create_5fmatrix_2664',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a33cb0a68c36aa26fd599c7c66da86ed7',1,'qr_eigen_values.cpp']]], + ['createnode_2665',['createNode',['../d8/dee/avltree_8cpp.html#a1ecfaaea49d452772dbb2b28133e36e0',1,'avltree.cpp']]], + ['cref_2666',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], + ['cregex_5fiterator_2667',['cregex_iterator',['http://en.cppreference.com/w/cpp/regex/regex_iterator/regex_iterator.html',0,'std::cregex_iterator']]], + ['cregex_5ftoken_5fiterator_2668',['cregex_token_iterator',['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/regex_token_iterator.html',0,'std::cregex_token_iterator']]], + ['crend_2669',['crend',['http://en.cppreference.com/w/cpp/container/dynarray/rend.html',0,'std::dynarray::crend()'],['http://en.cppreference.com/w/cpp/container/vector/rend.html',0,'std::vector::crend()'],['http://en.cppreference.com/w/cpp/container/multiset/rend.html',0,'std::multiset::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::string::crend()'],['http://en.cppreference.com/w/cpp/container/set/rend.html',0,'std::set::crend()'],['http://en.cppreference.com/w/cpp/container/deque/rend.html',0,'std::deque::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::basic_string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::wstring::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u16string::crend()'],['http://en.cppreference.com/w/cpp/string/basic_string/rend.html',0,'std::u32string::crend()'],['http://en.cppreference.com/w/cpp/container/list/rend.html',0,'std::list::crend()'],['http://en.cppreference.com/w/cpp/container/map/rend.html',0,'std::map::crend()'],['http://en.cppreference.com/w/cpp/container/multimap/rend.html',0,'std::multimap::crend()'],['http://en.cppreference.com/w/cpp/container/array/rend.html',0,'std::array::crend()']]], + ['csub_5fmatch_2670',['csub_match',['http://en.cppreference.com/w/cpp/regex/sub_match/sub_match.html',0,'std::csub_match']]], + ['ctime_2671',['ctime',['http://en.cppreference.com/w/cpp/chrono/c/ctime.html',0,'std']]], + ['ctype_2672',['ctype',['http://en.cppreference.com/w/cpp/locale/ctype/ctype.html',0,'std::ctype']]], + ['ctype_5fbyname_2673',['ctype_byname',['http://en.cppreference.com/w/cpp/locale/ctype_byname.html',0,'std::ctype_byname']]], + ['curr_5fsymbol_2674',['curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::curr_symbol()']]], + ['current_5fexception_2675',['current_exception',['http://en.cppreference.com/w/cpp/error/current_exception.html',0,'std']]] +]; diff --git a/search/functions_4.html b/search/functions_4.html new file mode 100644 index 000000000..d049621bd --- /dev/null +++ b/search/functions_4.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_4.js b/search/functions_4.js new file mode 100644 index 000000000..d7e100821 --- /dev/null +++ b/search/functions_4.js @@ -0,0 +1,77 @@ +var searchData= +[ + ['data_2676',['data',['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()']]], + ['date_5forder_2677',['date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::date_order()']]], + ['deallocate_2678',['deallocate',['http://en.cppreference.com/w/cpp/memory/allocator_traits/deallocate.html',0,'std::allocator_traits::deallocate()'],['http://en.cppreference.com/w/cpp/memory/allocator/deallocate.html',0,'std::allocator::deallocate()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/deallocate.html',0,'std::scoped_allocator_adaptor::deallocate()']]], + ['dec_2679',['dec',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], + ['decimal_5fpoint_2680',['decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::decimal_point()']]], + ['declare_5fno_5fpointers_2681',['declare_no_pointers',['http://en.cppreference.com/w/cpp/memory/gc/declare_no_pointers.html',0,'std']]], + ['declare_5freachable_2682',['declare_reachable',['http://en.cppreference.com/w/cpp/memory/gc/declare_reachable.html',0,'std']]], + ['declval_2683',['declval',['http://en.cppreference.com/w/cpp/utility/declval.html',0,'std']]], + ['decreasekey_2684',['decreaseKey',['../d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5',1,'MinHeap']]], + ['default_5fdelete_2685',['default_delete',['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete']]], + ['default_5ferror_5fcondition_2686',['default_error_condition',['http://en.cppreference.com/w/cpp/error/error_code/default_error_condition.html',0,'std::error_code::default_error_condition()'],['http://en.cppreference.com/w/cpp/error/error_category/default_error_condition.html',0,'std::error_category::default_error_condition()']]], + ['defaultfloat_2687',['defaultfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['deletekey_2688',['deleteKey',['../d2/d05/class_min_heap.html#a37ac126eabb0c3ce04047172abccca29',1,'MinHeap']]], + ['deletenode_2689',['deleteNode',['../d8/dee/avltree_8cpp.html#a8286388b0743a716145639df3a33e541',1,'avltree.cpp']]], + ['denorm_5fmin_2690',['denorm_min',['http://en.cppreference.com/w/cpp/types/numeric_limits/denorm_min.html',0,'std::numeric_limits']]], + ['densities_2691',['densities',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::densities()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::densities()']]], + ['deque_2692',['deque',['http://en.cppreference.com/w/cpp/container/deque/deque.html',0,'std::deque']]], + ['dequeue_2693',['deQueue',['../d2/d36/structqueue.html#a089d4af5532e0a801f560070da6e1f86',1,'queue']]], + ['destroy_2694',['destroy',['http://en.cppreference.com/w/cpp/memory/allocator_traits/destroy.html',0,'std::allocator_traits::destroy()'],['http://en.cppreference.com/w/cpp/memory/allocator/destroy.html',0,'std::allocator::destroy()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/destroy.html',0,'std::scoped_allocator_adaptor::destroy()']]], + ['detach_2695',['detach',['http://en.cppreference.com/w/cpp/thread/thread/detach.html',0,'std::thread']]], + ['difftime_2696',['difftime',['http://en.cppreference.com/w/cpp/chrono/c/difftime.html',0,'std']]], + ['digit_5fchar_2697',['digit_char',['../db/d82/classlarge__number.html#af530d90830d385c76973658ff3214f98',1,'large_number']]], + ['direction_2698',['direction',['../d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655',1,'SegmentIntersection']]], + ['discard_2699',['discard',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937_64::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux24_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux48::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::discard_block_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mersenne_twister_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/discard.html',0,'std::independent_bits_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::ranlux48_base::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/discard.html',0,'std::mt19937::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::shuffle_order_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard.html',0,'std::ranlux24::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::linear_congruential_engine::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/discard.html',0,'std::knuth_b::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/discard.html',0,'std::minstd_rand0::discard()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/discard.html',0,'std::subtract_with_carry_engine::discard()']]], + ['discard_5fblock_5fengine_2700',['discard_block_engine',['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/discard_block_engine.html',0,'std::discard_block_engine']]], + ['discrete_5fdistribution_2701',['discrete_distribution',['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/discrete_distribution.html',0,'std::discrete_distribution']]], + ['display_2702',['display',['../d2/d36/structqueue.html#a26f48801df462ade003b50739196fa4c',1,'queue::display()'],['../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628',1,'stack::display()']]], + ['distance_2703',['distance',['http://en.cppreference.com/w/cpp/iterator/distance.html',0,'std']]], + ['div_2704',['div',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], + ['do_5falways_5fnoconv_2705',['do_always_noconv',['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_byname::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf8_utf16::do_always_noconv()'],['http://en.cppreference.com/w/cpp/locale/codecvt/always_noconv.html',0,'std::codecvt_utf16::do_always_noconv()']]], + ['do_5fclose_2706',['do_close',['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages_byname::do_close()'],['http://en.cppreference.com/w/cpp/locale/messages/close.html',0,'std::messages::do_close()']]], + ['do_5fcompare_2707',['do_compare',['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate_byname::do_compare()'],['http://en.cppreference.com/w/cpp/locale/collate/compare.html',0,'std::collate::do_compare()']]], + ['do_5fcurr_5fsymbol_2708',['do_curr_symbol',['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct_byname::do_curr_symbol()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/curr_symbol.html',0,'std::moneypunct::do_curr_symbol()']]], + ['do_5fdate_5forder_2709',['do_date_order',['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get::do_date_order()'],['http://en.cppreference.com/w/cpp/locale/time_get/date_order.html',0,'std::time_get_byname::do_date_order()']]], + ['do_5fdecimal_5fpoint_2710',['do_decimal_point',['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/decimal_point.html',0,'std::moneypunct::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct_byname::do_decimal_point()'],['http://en.cppreference.com/w/cpp/locale/numpunct/decimal_point.html',0,'std::numpunct::do_decimal_point()']]], + ['do_5fencoding_2711',['do_encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::do_encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::do_encoding()']]], + ['do_5ffalsename_2712',['do_falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_falsename()']]], + ['do_5ffrac_5fdigits_2713',['do_frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::do_frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::do_frac_digits()']]], + ['do_5fget_2714',['do_get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::do_get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::do_get()']]], + ['do_5fget_5fdate_2715',['do_get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::do_get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::do_get_date()']]], + ['do_5fget_5fmonthname_2716',['do_get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::do_get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::do_get_monthname()']]], + ['do_5fget_5ftime_2717',['do_get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::do_get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::do_get_time()']]], + ['do_5fget_5fweekday_2718',['do_get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::do_get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::do_get_weekday()']]], + ['do_5fget_5fyear_2719',['do_get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::do_get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::do_get_year()']]], + ['do_5fgrouping_2720',['do_grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::do_grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::do_grouping()']]], + ['do_5fhash_2721',['do_hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::do_hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::do_hash()']]], + ['do_5fin_2722',['do_in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::do_in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::do_in()']]], + ['do_5fis_2723',['do_is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::do_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::do_is()']]], + ['do_5flength_2724',['do_length',['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::do_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::do_length()']]], + ['do_5fmax_5flength_2725',['do_max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::do_max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::do_max_length()']]], + ['do_5fnarrow_2726',['do_narrow',['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::do_narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::do_narrow()']]], + ['do_5fneg_5fformat_2727',['do_neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_neg_format()']]], + ['do_5fnegative_5fsign_2728',['do_negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_negative_sign()']]], + ['do_5fopen_2729',['do_open',['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::do_open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::do_open()']]], + ['do_5fout_2730',['do_out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::do_out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::do_out()']]], + ['do_5fpos_5fformat_2731',['do_pos_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::do_pos_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::do_pos_format()']]], + ['do_5fpositive_5fsign_2732',['do_positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::do_positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::do_positive_sign()']]], + ['do_5fput_2733',['do_put',['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put_byname::do_put()'],['http://en.cppreference.com/w/cpp/locale/time_put/put.html',0,'std::time_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/num_put/put.html',0,'std::num_put::do_put()'],['http://en.cppreference.com/w/cpp/locale/money_put/put.html',0,'std::money_put::do_put()']]], + ['do_5fscan_5fis_2734',['do_scan_is',['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype_byname::do_scan_is()'],['http://en.cppreference.com/w/cpp/locale/ctype/scan_is.html',0,'std::ctype::do_scan_is()']]], + ['do_5fthousands_5fsep_2735',['do_thousands_sep',['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/thousands_sep.html',0,'std::moneypunct::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct_byname::do_thousands_sep()'],['http://en.cppreference.com/w/cpp/locale/numpunct/thousands_sep.html',0,'std::numpunct::do_thousands_sep()']]], + ['do_5ftolower_2736',['do_tolower',['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype_byname::do_tolower()'],['http://en.cppreference.com/w/cpp/locale/ctype/tolower.html',0,'std::ctype::do_tolower()']]], + ['do_5ftoupper_2737',['do_toupper',['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype_byname::do_toupper()'],['http://en.cppreference.com/w/cpp/locale/ctype/toupper.html',0,'std::ctype::do_toupper()']]], + ['do_5ftransform_2738',['do_transform',['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate_byname::do_transform()'],['http://en.cppreference.com/w/cpp/locale/collate/transform.html',0,'std::collate::do_transform()']]], + ['do_5ftruename_2739',['do_truename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::do_truename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::do_truename()']]], + ['do_5funshift_2740',['do_unshift',['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_byname::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf8_utf16::do_unshift()'],['http://en.cppreference.com/w/cpp/locale/codecvt/unshift.html',0,'std::codecvt_utf16::do_unshift()']]], + ['do_5fwiden_2741',['do_widen',['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype_byname::do_widen()'],['http://en.cppreference.com/w/cpp/locale/ctype/widen.html',0,'std::ctype::do_widen()']]], + ['domain_5ferror_2742',['domain_error',['http://en.cppreference.com/w/cpp/error/domain_error.html',0,'std::domain_error']]], + ['double_5ffactorial_5fiterative_2743',['double_factorial_iterative',['../d7/d89/double__factorial_8cpp.html#a0a3c417360400093891a9ccddaa4be26',1,'double_factorial.cpp']]], + ['double_5ffactorial_5frecursive_2744',['double_factorial_recursive',['../d7/d89/double__factorial_8cpp.html#a68ba20fed2ce427f6469c7689437829d',1,'double_factorial.cpp']]], + ['durand_5fkerner_5falgo_2745',['durand_kerner_algo',['../da/df2/durand__kerner__roots_8cpp.html#ac38b9cfd2a39d856e0feba3b5d241ded',1,'durand_kerner_roots.cpp']]], + ['duration_2746',['duration',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::duration']]], + ['duration_5fcast_2747',['duration_cast',['http://en.cppreference.com/w/cpp/chrono/duration/duration_cast.html',0,'std::chrono']]], + ['dynamic_5fpointer_5fcast_2748',['dynamic_pointer_cast',['http://en.cppreference.com/w/cpp/memory/shared_ptr/pointer_cast.html',0,'std']]], + ['dynarray_2749',['dynarray',['http://en.cppreference.com/w/cpp/container/dynarray/dynarray.html',0,'std::dynarray']]] +]; diff --git a/search/functions_5.html b/search/functions_5.html new file mode 100644 index 000000000..342487bc1 --- /dev/null +++ b/search/functions_5.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_5.js b/search/functions_5.js new file mode 100644 index 000000000..d2b636a8a --- /dev/null +++ b/search/functions_5.js @@ -0,0 +1,52 @@ +var searchData= +[ + ['eback_2750',['eback',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::eback()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::eback()']]], + ['edge_2751',['Edge',['../d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980',1,'Edge']]], + ['egptr_2752',['egptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::egptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::egptr()']]], + ['eigen_5fvalues_2753',['eigen_values',['../d2/d3b/namespaceqr__algorithm.html#a763896dbb4a7e95c4a1e614ac0819d66',1,'qr_algorithm']]], + ['emplace_2754',['emplace',['http://en.cppreference.com/w/cpp/container/vector/emplace.html',0,'std::vector::emplace()'],['http://en.cppreference.com/w/cpp/container/multiset/emplace.html',0,'std::multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/set/emplace.html',0,'std::set::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace.html',0,'std::unordered_map::emplace()'],['http://en.cppreference.com/w/cpp/container/stack/emplace.html',0,'std::stack::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace.html',0,'std::unordered_multimap::emplace()'],['http://en.cppreference.com/w/cpp/container/deque/emplace.html',0,'std::deque::emplace()'],['http://en.cppreference.com/w/cpp/container/queue/emplace.html',0,'std::queue::emplace()'],['http://en.cppreference.com/w/cpp/container/priority_queue/emplace.html',0,'std::priority_queue::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace.html',0,'std::unordered_multiset::emplace()'],['http://en.cppreference.com/w/cpp/container/list/emplace.html',0,'std::list::emplace()'],['http://en.cppreference.com/w/cpp/container/map/emplace.html',0,'std::map::emplace()'],['http://en.cppreference.com/w/cpp/experimental/optional/emplace.html',0,'std::experimental::optional::emplace()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace.html',0,'std::unordered_set::emplace()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace.html',0,'std::multimap::emplace()']]], + ['emplace_5fafter_2755',['emplace_after',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_after.html',0,'std::forward_list']]], + ['emplace_5fback_2756',['emplace_back',['http://en.cppreference.com/w/cpp/container/vector/emplace_back.html',0,'std::vector::emplace_back()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_back.html',0,'std::deque::emplace_back()'],['http://en.cppreference.com/w/cpp/container/list/emplace_back.html',0,'std::list::emplace_back()']]], + ['emplace_5ffront_2757',['emplace_front',['http://en.cppreference.com/w/cpp/container/forward_list/emplace_front.html',0,'std::forward_list::emplace_front()'],['http://en.cppreference.com/w/cpp/container/deque/emplace_front.html',0,'std::deque::emplace_front()'],['http://en.cppreference.com/w/cpp/container/list/emplace_front.html',0,'std::list::emplace_front()']]], + ['emplace_5fhint_2758',['emplace_hint',['http://en.cppreference.com/w/cpp/container/multiset/emplace_hint.html',0,'std::multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/set/emplace_hint.html',0,'std::set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_map/emplace_hint.html',0,'std::unordered_map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/emplace_hint.html',0,'std::unordered_multimap::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/emplace_hint.html',0,'std::unordered_multiset::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/map/emplace_hint.html',0,'std::map::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/unordered_set/emplace_hint.html',0,'std::unordered_set::emplace_hint()'],['http://en.cppreference.com/w/cpp/container/multimap/emplace_hint.html',0,'std::multimap::emplace_hint()']]], + ['empty_2759',['empty',['http://en.cppreference.com/w/cpp/container/dynarray/empty.html',0,'std::dynarray::empty()'],['http://en.cppreference.com/w/cpp/container/vector/empty.html',0,'std::vector::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::match_results::empty()'],['http://en.cppreference.com/w/cpp/container/multiset/empty.html',0,'std::multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::string::empty()'],['http://en.cppreference.com/w/cpp/container/set/empty.html',0,'std::set::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_map/empty.html',0,'std::unordered_map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wsmatch::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::smatch::empty()'],['http://en.cppreference.com/w/cpp/container/stack/empty.html',0,'std::stack::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/empty.html',0,'std::unordered_multimap::empty()'],['http://en.cppreference.com/w/cpp/container/forward_list/empty.html',0,'std::forward_list::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::wcmatch::empty()'],['http://en.cppreference.com/w/cpp/container/deque/empty.html',0,'std::deque::empty()'],['http://en.cppreference.com/w/cpp/container/queue/empty.html',0,'std::queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::basic_string::empty()'],['http://en.cppreference.com/w/cpp/container/priority_queue/empty.html',0,'std::priority_queue::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::wstring::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/empty.html',0,'std::unordered_multiset::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u16string::empty()'],['http://en.cppreference.com/w/cpp/string/basic_string/empty.html',0,'std::u32string::empty()'],['http://en.cppreference.com/w/cpp/container/list/empty.html',0,'std::list::empty()'],['http://en.cppreference.com/w/cpp/container/map/empty.html',0,'std::map::empty()'],['http://en.cppreference.com/w/cpp/regex/match_results/empty.html',0,'std::cmatch::empty()'],['http://en.cppreference.com/w/cpp/container/unordered_set/empty.html',0,'std::unordered_set::empty()'],['http://en.cppreference.com/w/cpp/container/multimap/empty.html',0,'std::multimap::empty()'],['http://en.cppreference.com/w/cpp/container/array/empty.html',0,'std::array::empty()']]], + ['enable_5fshared_5ffrom_5fthis_2760',['enable_shared_from_this',['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/enable_shared_from_this.html',0,'std::enable_shared_from_this']]], + ['encoding_2761',['encoding',['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_byname::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf8_utf16::encoding()'],['http://en.cppreference.com/w/cpp/locale/codecvt/encoding.html',0,'std::codecvt_utf16::encoding()']]], + ['end_2762',['end',['http://en.cppreference.com/w/cpp/container/dynarray/end.html',0,'std::dynarray::end()'],['http://en.cppreference.com/w/cpp/container/vector/end.html',0,'std::vector::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::match_results::end()'],['http://en.cppreference.com/w/cpp/container/multiset/end.html',0,'std::multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::string::end()'],['http://en.cppreference.com/w/cpp/container/set/end.html',0,'std::set::end()'],['http://en.cppreference.com/w/cpp/container/unordered_map/end.html',0,'std::unordered_map::end()'],['http://en.cppreference.com/w/cpp/utility/initializer_list/end.html',0,'std::initializer_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wsmatch::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::smatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end.html',0,'std::unordered_multimap::end()'],['http://en.cppreference.com/w/cpp/container/forward_list/end.html',0,'std::forward_list::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::wcmatch::end()'],['http://en.cppreference.com/w/cpp/container/deque/end.html',0,'std::deque::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::basic_string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::wstring::end()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end.html',0,'std::unordered_multiset::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u16string::end()'],['http://en.cppreference.com/w/cpp/string/basic_string/end.html',0,'std::u32string::end()'],['http://en.cppreference.com/w/cpp/container/list/end.html',0,'std::list::end()'],['http://en.cppreference.com/w/cpp/container/map/end.html',0,'std::map::end()'],['http://en.cppreference.com/w/cpp/regex/match_results/end.html',0,'std::cmatch::end()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end.html',0,'std::unordered_set::end()'],['http://en.cppreference.com/w/cpp/container/multimap/end.html',0,'std::multimap::end()'],['http://en.cppreference.com/w/cpp/container/array/end.html',0,'std::array::end()'],['http://en.cppreference.com/w/cpp/iterator/end.html',0,'std::end()']]], + ['end_28int_29_2763',['end(int)',['http://en.cppreference.com/w/cpp/container/unordered_map/end2.html',0,'std::unordered_map::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/end2.html',0,'std::unordered_multimap::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/end2.html',0,'std::unordered_multiset::end(int)()'],['http://en.cppreference.com/w/cpp/container/unordered_set/end2.html',0,'std::unordered_set::end(int)()']]], + ['endl_2764',['endl',['http://en.cppreference.com/w/cpp/io/manip/endl.html',0,'std']]], + ['ends_2765',['ends',['http://en.cppreference.com/w/cpp/io/manip/ends.html',0,'std']]], + ['enqueue_2766',['enQueue',['../d2/d36/structqueue.html#a592c0580551ec0d3b4d43e8198d8a377',1,'queue']]], + ['entropy_2767',['entropy',['http://en.cppreference.com/w/cpp/numeric/random/random_device/entropy.html',0,'std::random_device']]], + ['eof_2768',['eof',['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::fstream::eof()'],['http://en.cppreference.com/w/cpp/string/char_traits/eof.html',0,'std::char_traits::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ios::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_fstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::strstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_stringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wostringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wiostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_ifstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::istream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ostrstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wfstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::basic_iostream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wofstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wstringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::wistringstream::eof()'],['http://en.cppreference.com/w/cpp/io/basic_ios/eof.html',0,'std::ifstream::eof()']]], + ['epptr_2769',['epptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wfilebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::wstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::strstreambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_stringbuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::basic_streambuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::filebuf::epptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pptr.html',0,'std::streambuf::epptr()']]], + ['epsilon_2770',['epsilon',['http://en.cppreference.com/w/cpp/types/numeric_limits/epsilon.html',0,'std::numeric_limits']]], + ['eq_2771',['eq',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits::eq()'],['../d7/d6a/bisection__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): false_position.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#a2003b5b2dcfff0769b957ab5c968b03d',1,'eq(double i): newton_raphson_method.cpp'],['../df/dc8/successive__approximation_8cpp.html#a79c1d08919ff7780a5d7723172602389',1,'eq(float y): successive_approximation.cpp']]], + ['eq_5fder_2772',['eq_der',['../de/dd3/newton__raphson__method_8cpp.html#a3d3f7f41977394680af6ebbed96f3386',1,'newton_raphson_method.cpp']]], + ['eq_5fint_5ftype_2773',['eq_int_type',['http://en.cppreference.com/w/cpp/string/char_traits/eq_int_type.html',0,'std::char_traits']]], + ['eqd_2774',['eqd',['../df/dc8/successive__approximation_8cpp.html#ae89c36add7c55298c5195d0a83de1456',1,'successive_approximation.cpp']]], + ['equal_2775',['equal',['http://en.cppreference.com/w/cpp/algorithm/equal.html',0,'std']]], + ['equal_5frange_2776',['equal_range',['http://en.cppreference.com/w/cpp/container/multiset/equal_range.html',0,'std::multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/set/equal_range.html',0,'std::set::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_map/equal_range.html',0,'std::unordered_map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/equal_range.html',0,'std::unordered_multimap::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/equal_range.html',0,'std::unordered_multiset::equal_range()'],['http://en.cppreference.com/w/cpp/container/map/equal_range.html',0,'std::map::equal_range()'],['http://en.cppreference.com/w/cpp/container/unordered_set/equal_range.html',0,'std::unordered_set::equal_range()'],['http://en.cppreference.com/w/cpp/container/multimap/equal_range.html',0,'std::multimap::equal_range()'],['http://en.cppreference.com/w/cpp/algorithm/equal_range.html',0,'std::equal_range()']]], + ['equivalent_2777',['equivalent',['http://en.cppreference.com/w/cpp/error/error_category/equivalent.html',0,'std::error_category']]], + ['erase_2778',['erase',['http://en.cppreference.com/w/cpp/container/vector/erase.html',0,'std::vector::erase()'],['http://en.cppreference.com/w/cpp/container/multiset/erase.html',0,'std::multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::string::erase()'],['http://en.cppreference.com/w/cpp/container/set/erase.html',0,'std::set::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_map/erase.html',0,'std::unordered_map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/erase.html',0,'std::unordered_multimap::erase()'],['http://en.cppreference.com/w/cpp/container/deque/erase.html',0,'std::deque::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::basic_string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::wstring::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/erase.html',0,'std::unordered_multiset::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u16string::erase()'],['http://en.cppreference.com/w/cpp/string/basic_string/erase.html',0,'std::u32string::erase()'],['http://en.cppreference.com/w/cpp/container/list/erase.html',0,'std::list::erase()'],['http://en.cppreference.com/w/cpp/container/map/erase.html',0,'std::map::erase()'],['http://en.cppreference.com/w/cpp/container/unordered_set/erase.html',0,'std::unordered_set::erase()'],['http://en.cppreference.com/w/cpp/container/multimap/erase.html',0,'std::multimap::erase()']]], + ['erase_5fafter_2779',['erase_after',['http://en.cppreference.com/w/cpp/container/forward_list/erase_after.html',0,'std::forward_list']]], + ['erf_2780',['erf',['http://en.cppreference.com/w/cpp/numeric/math/erf.html',0,'std']]], + ['erfc_2781',['erfc',['http://en.cppreference.com/w/cpp/numeric/math/erfc.html',0,'std']]], + ['error_5fcategory_2782',['error_category',['http://en.cppreference.com/w/cpp/error/error_category/error_category.html',0,'std::error_category']]], + ['error_5fcode_2783',['error_code',['http://en.cppreference.com/w/cpp/error/error_code/error_code.html',0,'std::error_code']]], + ['error_5fcondition_2784',['error_condition',['http://en.cppreference.com/w/cpp/error/error_condition/error_condition.html',0,'std::error_condition']]], + ['exact_5fsolution_2785',['exact_solution',['../db/dd3/ode__forward__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#af3adf7b092a87868917ee5fb4255192b',1,'exact_solution(const double &x, std::valarray< double > *y): ode_semi_implicit_euler.cpp']]], + ['exception_2786',['exception',['http://en.cppreference.com/w/cpp/error/exception/exception.html',0,'std::exception']]], + ['exceptions_2787',['exceptions',['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ios::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_fstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::strstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_stringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wostringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wiostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_ifstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::istream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ostrstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wfstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::basic_iostream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wofstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wstringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::wistringstream::exceptions()'],['http://en.cppreference.com/w/cpp/io/basic_ios/exceptions.html',0,'std::ifstream::exceptions()']]], + ['exchange_2788',['exchange',['http://en.cppreference.com/w/cpp/atomic/atomic/exchange.html',0,'std::atomic']]], + ['exit_2789',['exit',['http://en.cppreference.com/w/cpp/utility/program/exit.html',0,'std']]], + ['exp_2790',['exp',['http://en.cppreference.com/w/cpp/numeric/math/exp.html',0,'std']]], + ['exp2_2791',['exp2',['http://en.cppreference.com/w/cpp/numeric/math/exp2.html',0,'std']]], + ['expired_2792',['expired',['http://en.cppreference.com/w/cpp/memory/weak_ptr/expired.html',0,'std::weak_ptr']]], + ['expm1_2793',['expm1',['http://en.cppreference.com/w/cpp/numeric/math/expm1.html',0,'std']]], + ['exponential_5fdistribution_2794',['exponential_distribution',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/exponential_distribution.html',0,'std::exponential_distribution']]], + ['extendedeuclid_2795',['extendedEuclid',['../d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d',1,'extended_euclid_algorithm.cpp']]], + ['extendedeuclid_5f1_2796',['extendedEuclid_1',['../d9/d5d/extended__euclid__algorithm_8cpp.html#a1792ac7c33aaf26b860ab55f5652ab25',1,'extended_euclid_algorithm.cpp']]], + ['extractmin_2797',['extractMin',['../d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980',1,'MinHeap']]], + ['extreme_5fvalue_5fdistribution_2798',['extreme_value_distribution',['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/extreme_value_distribution.html',0,'std::extreme_value_distribution']]] +]; diff --git a/search/functions_6.html b/search/functions_6.html new file mode 100644 index 000000000..4bf3bd63b --- /dev/null +++ b/search/functions_6.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_6.js b/search/functions_6.js new file mode 100644 index 000000000..8667d8cea --- /dev/null +++ b/search/functions_6.js @@ -0,0 +1,102 @@ +var searchData= +[ + ['fabs_2799',['fabs',['http://en.cppreference.com/w/cpp/numeric/math/fabs.html',0,'std']]], + ['facet_2800',['facet',['http://en.cppreference.com/w/cpp/locale/locale/facet/facet.html',0,'std::locale::facet']]], + ['fact_2801',['fact',['../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a',1,'poisson_dist.cpp']]], + ['factorial_2802',['factorial',['../d9/d00/factorial_8cpp.html#ae9945c15826a9c1b5c141db314b7f8b4',1,'factorial.cpp']]], + ['fail_2803',['fail',['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ios::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_fstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::strstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_stringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wostringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wiostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_ifstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::istream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ostrstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wfstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::basic_iostream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wofstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wstringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::wistringstream::fail()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fail.html',0,'std::ifstream::fail()']]], + ['failure_2804',['failure',['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ios::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_fstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ios_base::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::strstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_stringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wostringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wiostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_ifstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::istream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ostrstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wfstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::basic_iostream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wofstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wstringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::wistringstream::failure::failure()'],['http://en.cppreference.com/w/cpp/io/ios_base/failure.html',0,'std::ifstream::failure::failure()']]], + ['falsename_2805',['falsename',['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct_byname::falsename()'],['http://en.cppreference.com/w/cpp/locale/numpunct/truefalsename.html',0,'std::numpunct::falsename()']]], + ['fast_5fpower_5flinear_2806',['fast_power_linear',['../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d',1,'fast_power.cpp']]], + ['fast_5fpower_5frecursive_2807',['fast_power_recursive',['../d2/d0b/fast__power_8cpp.html#a8399b847626e5bba983cab7c7918b445',1,'fast_power.cpp']]], + ['fastinput_2808',['fastinput',['../d4/de8/fast__interger__input_8cpp.html#a4e097ac8509b717bdc8ab09ecd86ae82',1,'fast_interger_input.cpp']]], + ['fclose_2809',['fclose',['http://en.cppreference.com/w/cpp/io/c/fclose.html',0,'std']]], + ['fdim_2810',['fdim',['http://en.cppreference.com/w/cpp/numeric/math/fdim.html',0,'std']]], + ['feclearexcept_2811',['feclearexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feclearexcept.html',0,'std']]], + ['fegetenv_2812',['fegetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]], + ['fegetexceptflag_2813',['fegetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]], + ['fegetround_2814',['fegetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]], + ['feholdexcept_2815',['feholdexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feholdexcept.html',0,'std']]], + ['feof_2816',['feof',['http://en.cppreference.com/w/cpp/io/c/feof.html',0,'std']]], + ['feraiseexcept_2817',['feraiseexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/feraiseexcept.html',0,'std']]], + ['ferror_2818',['ferror',['http://en.cppreference.com/w/cpp/io/c/ferror.html',0,'std']]], + ['fesetenv_2819',['fesetenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feenv.html',0,'std']]], + ['fesetexceptflag_2820',['fesetexceptflag',['http://en.cppreference.com/w/cpp/numeric/fenv/feexceptflag.html',0,'std']]], + ['fesetround_2821',['fesetround',['http://en.cppreference.com/w/cpp/numeric/fenv/feround.html',0,'std']]], + ['fetch_5fadd_2822',['fetch_add',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_add.html',0,'std::atomic']]], + ['fetch_5fand_2823',['fetch_and',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_and.html',0,'std::atomic']]], + ['fetch_5for_2824',['fetch_or',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_or.html',0,'std::atomic']]], + ['fetch_5fsub_2825',['fetch_sub',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_sub.html',0,'std::atomic']]], + ['fetch_5fxor_2826',['fetch_xor',['http://en.cppreference.com/w/cpp/atomic/atomic/fetch_xor.html',0,'std::atomic']]], + ['fetestexcept_2827',['fetestexcept',['http://en.cppreference.com/w/cpp/numeric/fenv/fetestexcept.html',0,'std']]], + ['feupdateenv_2828',['feupdateenv',['http://en.cppreference.com/w/cpp/numeric/fenv/feupdateenv.html',0,'std']]], + ['fflush_2829',['fflush',['http://en.cppreference.com/w/cpp/io/c/fflush.html',0,'std']]], + ['fgetc_2830',['fgetc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]], + ['fgetpos_2831',['fgetpos',['http://en.cppreference.com/w/cpp/io/c/fgetpos.html',0,'std']]], + ['fgets_2832',['fgets',['http://en.cppreference.com/w/cpp/io/c/fgets.html',0,'std']]], + ['fgetwc_2833',['fgetwc',['http://en.cppreference.com/w/cpp/io/c/fgetwc.html',0,'std']]], + ['fgetws_2834',['fgetws',['http://en.cppreference.com/w/cpp/io/c/fgetws.html',0,'std']]], + ['fib_2835',['fib',['../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f',1,'fib(uint64_t n): fibonacci_fast.cpp'],['../de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db',1,'fib(uint64_t n): fibonacci_large.cpp']]], + ['fib_5faccurate_2836',['fib_Accurate',['../de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca',1,'string_fibonacci.cpp']]], + ['fibonacci_2837',['fibonacci',['../d9/d89/fibonacci_8cpp.html#a4bc27e88a3da5cc590f1f78622019a7b',1,'fibonacci.cpp']]], + ['filebuf_2838',['filebuf',['http://en.cppreference.com/w/cpp/io/basic_filebuf/basic_filebuf.html',0,'std::filebuf']]], + ['fill_2839',['fill',['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::fstream::fill()'],['http://en.cppreference.com/w/cpp/container/dynarray/fill.html',0,'std::dynarray::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ios::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_fstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::strstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_stringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wostringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wiostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_ifstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::istream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ostrstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wfstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::basic_iostream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wofstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wstringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::wistringstream::fill()'],['http://en.cppreference.com/w/cpp/io/basic_ios/fill.html',0,'std::ifstream::fill()'],['http://en.cppreference.com/w/cpp/container/array/fill.html',0,'std::array::fill()'],['http://en.cppreference.com/w/cpp/algorithm/fill.html',0,'std::fill()'],['../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780',1,'fill(): decimal_to_roman_numeral.cpp']]], + ['fill_5fn_2840',['fill_n',['http://en.cppreference.com/w/cpp/algorithm/fill_n.html',0,'std']]], + ['find_2841',['find',['http://en.cppreference.com/w/cpp/string/char_traits/find.html',0,'std::char_traits::find()'],['http://en.cppreference.com/w/cpp/container/multiset/find.html',0,'std::multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::string::find()'],['http://en.cppreference.com/w/cpp/container/set/find.html',0,'std::set::find()'],['http://en.cppreference.com/w/cpp/container/unordered_map/find.html',0,'std::unordered_map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/find.html',0,'std::unordered_multimap::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::basic_string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::wstring::find()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/find.html',0,'std::unordered_multiset::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u16string::find()'],['http://en.cppreference.com/w/cpp/string/basic_string/find.html',0,'std::u32string::find()'],['http://en.cppreference.com/w/cpp/container/map/find.html',0,'std::map::find()'],['http://en.cppreference.com/w/cpp/container/unordered_set/find.html',0,'std::unordered_set::find()'],['http://en.cppreference.com/w/cpp/container/multimap/find.html',0,'std::multimap::find()'],['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std::find()']]], + ['find_5fend_2842',['find_end',['http://en.cppreference.com/w/cpp/algorithm/find_end.html',0,'std']]], + ['find_5ffirst_5fnot_5fof_2843',['find_first_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::basic_string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::wstring::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u16string::find_first_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_not_of.html',0,'std::u32string::find_first_not_of()']]], + ['find_5ffirst_5fof_2844',['find_first_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::basic_string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::wstring::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u16string::find_first_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_first_of.html',0,'std::u32string::find_first_of()'],['http://en.cppreference.com/w/cpp/algorithm/find_first_of.html',0,'std::find_first_of()']]], + ['find_5fif_2845',['find_if',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], + ['find_5fif_5fnot_2846',['find_if_not',['http://en.cppreference.com/w/cpp/algorithm/find.html',0,'std']]], + ['find_5flast_5fnot_5fof_2847',['find_last_not_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::basic_string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::wstring::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u16string::find_last_not_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_not_of.html',0,'std::u32string::find_last_not_of()']]], + ['find_5flast_5fof_2848',['find_last_of',['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::basic_string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::wstring::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u16string::find_last_of()'],['http://en.cppreference.com/w/cpp/string/basic_string/find_last_of.html',0,'std::u32string::find_last_of()']]], + ['fisher_5ff_5fdistribution_2849',['fisher_f_distribution',['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/fisher_f_distribution.html',0,'std::fisher_f_distribution']]], + ['fit_2850',['fit',['../d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5',1,'machine_learning::adaline::fit(const std::vector< double > &x, const int &y)'],['../d6/d30/classmachine__learning_1_1adaline.html#a9f1c7cd34252a9ece5bbe7ba36799044',1,'machine_learning::adaline::fit(std::vector< double > const (&X)[N], const int *y)']]], + ['fit_5fols_5fregressor_2851',['fit_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a38ff1d954e9b7de93eb20e2dd101a045',1,'ordinary_least_squares_regressor.cpp']]], + ['fixed_2852',['fixed',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['flags_2853',['flags',['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::fstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostringstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::regex::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::basic_regex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ios::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_fstream::flags()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/flags.html',0,'std::wregex::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ios_base::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::strstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_stringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wostringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wiostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_ifstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::istream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ostrstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wfstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::basic_iostream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wofstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wstringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::wistringstream::flags()'],['http://en.cppreference.com/w/cpp/io/ios_base/flags.html',0,'std::ifstream::flags()']]], + ['flip_2854',['flip',['http://en.cppreference.com/w/cpp/utility/bitset/flip.html',0,'std::bitset']]], + ['floor_2855',['floor',['http://en.cppreference.com/w/cpp/numeric/math/floor.html',0,'std']]], + ['flush_2856',['flush',['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_fstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::strstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_stringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wostringstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_ostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wiostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::ostrstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wfstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::basic_iostream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wofstream::flush()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/flush.html',0,'std::wstringstream::flush()'],['http://en.cppreference.com/w/cpp/io/manip/flush.html',0,'std::flush()']]], + ['fma_2857',['fma',['http://en.cppreference.com/w/cpp/numeric/math/fma.html',0,'std']]], + ['fmax_2858',['fmax',['http://en.cppreference.com/w/cpp/numeric/math/fmax.html',0,'std']]], + ['fmin_2859',['fmin',['http://en.cppreference.com/w/cpp/numeric/math/fmin.html',0,'std']]], + ['fmod_2860',['fmod',['http://en.cppreference.com/w/cpp/numeric/math/fmod.html',0,'std']]], + ['fopen_2861',['fopen',['http://en.cppreference.com/w/cpp/io/c/fopen.html',0,'std']]], + ['for_5feach_2862',['for_each',['http://en.cppreference.com/w/cpp/algorithm/for_each.html',0,'std']]], + ['format_2863',['format',['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::match_results::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wsmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::smatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::wcmatch::format()'],['http://en.cppreference.com/w/cpp/regex/match_results/format.html',0,'std::cmatch::format()']]], + ['forward_2864',['forward',['http://en.cppreference.com/w/cpp/utility/forward.html',0,'std']]], + ['forward_5fas_5ftuple_2865',['forward_as_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/forward_as_tuple.html',0,'std']]], + ['forward_5feuler_2866',['forward_euler',['../d6/d60/group__ode.html#gae0509f8843e2bc42de2abbd00a14b7b9',1,'ode_forward_euler.cpp']]], + ['forward_5feuler_5fstep_2867',['forward_euler_step',['../d6/d60/group__ode.html#gaa197c6b7085ac9ea71abc4c063e6f52f',1,'ode_forward_euler.cpp']]], + ['forward_5flist_2868',['forward_list',['http://en.cppreference.com/w/cpp/container/forward_list/forward_list.html',0,'std::forward_list']]], + ['fpclassify_2869',['fpclassify',['http://en.cppreference.com/w/cpp/numeric/math/fpclassify.html',0,'std']]], + ['fprintf_2870',['fprintf',['http://en.cppreference.com/w/cpp/io/c/fprintf.html',0,'std']]], + ['fputc_2871',['fputc',['http://en.cppreference.com/w/cpp/io/c/fputc.html',0,'std']]], + ['fputs_2872',['fputs',['http://en.cppreference.com/w/cpp/io/c/fputs.html',0,'std']]], + ['fputwc_2873',['fputwc',['http://en.cppreference.com/w/cpp/io/c/fputwc.html',0,'std']]], + ['fputws_2874',['fputws',['http://en.cppreference.com/w/cpp/io/c/fputws.html',0,'std']]], + ['frac_5fdigits_2875',['frac_digits',['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct_byname::frac_digits()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/frac_digits.html',0,'std::moneypunct::frac_digits()']]], + ['fread_2876',['fread',['http://en.cppreference.com/w/cpp/io/c/fread.html',0,'std']]], + ['free_2877',['free',['http://en.cppreference.com/w/cpp/memory/c/free.html',0,'std']]], + ['freenode_2878',['freeNode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02',1,'linkedlist_implentation_usingarray.cpp']]], + ['freeze_2879',['freeze',['http://en.cppreference.com/w/cpp/io/strstreambuf/freeze.html',0,'std::strstreambuf::freeze()'],['http://en.cppreference.com/w/cpp/io/strstream/freeze.html',0,'std::strstream::freeze()'],['http://en.cppreference.com/w/cpp/io/ostrstream/freeze.html',0,'std::ostrstream::freeze()']]], + ['freopen_2880',['freopen',['http://en.cppreference.com/w/cpp/io/c/freopen.html',0,'std']]], + ['frexp_2881',['frexp',['http://en.cppreference.com/w/cpp/numeric/math/frexp.html',0,'std']]], + ['from_5fbytes_2882',['from_bytes',['http://en.cppreference.com/w/cpp/locale/wstring_convert/from_bytes.html',0,'std::wstring_convert']]], + ['from_5ftime_5ft_2883',['from_time_t',['http://en.cppreference.com/w/cpp/chrono/system_clock/from_time_t.html',0,'std::chrono::system_clock']]], + ['front_2884',['front',['http://en.cppreference.com/w/cpp/container/dynarray/front.html',0,'std::dynarray::front()'],['http://en.cppreference.com/w/cpp/container/vector/front.html',0,'std::vector::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::string::front()'],['http://en.cppreference.com/w/cpp/container/forward_list/front.html',0,'std::forward_list::front()'],['http://en.cppreference.com/w/cpp/container/deque/front.html',0,'std::deque::front()'],['http://en.cppreference.com/w/cpp/container/queue/front.html',0,'std::queue::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::basic_string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::wstring::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u16string::front()'],['http://en.cppreference.com/w/cpp/string/basic_string/front.html',0,'std::u32string::front()'],['http://en.cppreference.com/w/cpp/container/list/front.html',0,'std::list::front()'],['http://en.cppreference.com/w/cpp/container/array/front.html',0,'std::array::front()'],['../d2/d36/structqueue.html#a36d47fdbedc199609818385110d9f922',1,'queue::front()']]], + ['front_5finserter_2885',['front_inserter',['http://en.cppreference.com/w/cpp/iterator/front_inserter.html',0,'std']]], + ['fscanf_2886',['fscanf',['http://en.cppreference.com/w/cpp/io/c/fscanf.html',0,'std']]], + ['fseek_2887',['fseek',['http://en.cppreference.com/w/cpp/io/c/fseek.html',0,'std']]], + ['fsetpos_2888',['fsetpos',['http://en.cppreference.com/w/cpp/io/c/fsetpos.html',0,'std']]], + ['fstream_2889',['fstream',['http://en.cppreference.com/w/cpp/io/basic_fstream/basic_fstream.html',0,'std::fstream']]], + ['ftell_2890',['ftell',['http://en.cppreference.com/w/cpp/io/c/ftell.html',0,'std']]], + ['function_2891',['function',['http://en.cppreference.com/w/cpp/utility/functional/function/function.html',0,'std::function']]], + ['future_2892',['future',['http://en.cppreference.com/w/cpp/thread/future/future.html',0,'std::future']]], + ['future_5fcategory_2893',['future_category',['http://en.cppreference.com/w/cpp/thread/future/future_category.html',0,'std']]], + ['future_5ferror_2894',['future_error',['http://en.cppreference.com/w/cpp/thread/future_error/future_error.html',0,'std::future_error']]], + ['fwprintf_2895',['fwprintf',['http://en.cppreference.com/w/cpp/io/c/fwprintf.html',0,'std']]], + ['fwrite_2896',['fwrite',['http://en.cppreference.com/w/cpp/io/c/fwrite.html',0,'std']]], + ['fwscanf_2897',['fwscanf',['http://en.cppreference.com/w/cpp/io/c/fwscanf.html',0,'std']]] +]; diff --git a/search/functions_7.html b/search/functions_7.html new file mode 100644 index 000000000..d7ad9dd8a --- /dev/null +++ b/search/functions_7.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_7.js b/search/functions_7.js new file mode 100644 index 000000000..c7504dea6 --- /dev/null +++ b/search/functions_7.js @@ -0,0 +1,53 @@ +var searchData= +[ + ['gamma_5fdistribution_2898',['gamma_distribution',['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/gamma_distribution.html',0,'std::gamma_distribution']]], + ['gbump_2899',['gbump',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wfilebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::wstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::strstreambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_stringbuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::basic_streambuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::filebuf::gbump()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gbump.html',0,'std::streambuf::gbump()']]], + ['gcd_2900',['gcd',['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#a25034543c20f271da04fb24ad2b2747a',1,'gcd(int *a, int n): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e',1,'gcd(int num1, int num2): gcd_recursive_euclidean.cpp'],['../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563',1,'gcd(unsigned int x, unsigned int y): least_common_multiple.cpp']]], + ['gcount_2901',['gcount',['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_fstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::strstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_stringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istrstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wiostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_ifstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::istream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wfstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::basic_iostream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wstringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::wistringstream::gcount()'],['http://en.cppreference.com/w/cpp/io/basic_istream/gcount.html',0,'std::ifstream::gcount()']]], + ['genarray_2902',['genArray',['../db/d07/spiral__print_8cpp.html#acfff36db81326fb990a643ab198ee8a5',1,'spiral_print.cpp']]], + ['generate_2903',['generate',['http://en.cppreference.com/w/cpp/numeric/random/seed_seq/generate.html',0,'std::seed_seq::generate()'],['http://en.cppreference.com/w/cpp/algorithm/generate.html',0,'std::generate()']]], + ['generate_5fcanonical_2904',['generate_canonical',['http://en.cppreference.com/w/cpp/numeric/random/generate_canonical.html',0,'std']]], + ['generate_5fn_2905',['generate_n',['http://en.cppreference.com/w/cpp/algorithm/generate_n.html',0,'std']]], + ['generic_5fcategory_2906',['generic_category',['http://en.cppreference.com/w/cpp/error/generic_category.html',0,'std']]], + ['geometric_5fdistribution_2907',['geometric_distribution',['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/geometric_distribution.html',0,'std::geometric_distribution']]], + ['get_2908',['get',['http://en.cppreference.com/w/cpp/locale/money_get/get.html',0,'std::money_get::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::fstream::get()'],['http://en.cppreference.com/w/cpp/locale/num_get/get.html',0,'std::num_get::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get::get()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/get.html',0,'std::shared_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_fstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::iostream::get()'],['http://en.cppreference.com/w/cpp/thread/shared_future/get.html',0,'std::shared_future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::stringstream::get()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/get.html',0,'std::unique_ptr::get()'],['http://en.cppreference.com/w/cpp/thread/future/get.html',0,'std::future::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wifstream::get()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::strstream::get()'],['http://en.cppreference.com/w/cpp/locale/time_get/get.html',0,'std::time_get_byname::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_stringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istrstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wiostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_istringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_ifstream::get()'],['http://en.cppreference.com/w/cpp/locale/messages/get.html',0,'std::messages::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istringstream::get()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/get.html',0,'std::auto_ptr::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::istream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wfstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::basic_iostream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wstringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::wistringstream::get()'],['http://en.cppreference.com/w/cpp/io/basic_istream/get.html',0,'std::ifstream::get()']]], + ['get_5fallocator_2909',['get_allocator',['http://en.cppreference.com/w/cpp/container/vector/get_allocator.html',0,'std::vector::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::match_results::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multiset/get_allocator.html',0,'std::multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/set/get_allocator.html',0,'std::set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator.html',0,'std::unordered_map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wsmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::smatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/get_allocator.html',0,'std::unordered_multimap::get_allocator()'],['http://en.cppreference.com/w/cpp/container/forward_list/get_allocator.html',0,'std::forward_list::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::wcmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/deque/get_allocator.html',0,'std::deque::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::basic_string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::wstring::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/get_allocator.html',0,'std::unordered_multiset::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u16string::get_allocator()'],['http://en.cppreference.com/w/cpp/string/basic_string/get_allocator.html',0,'std::u32string::get_allocator()'],['http://en.cppreference.com/w/cpp/container/list/get_allocator.html',0,'std::list::get_allocator()'],['http://en.cppreference.com/w/cpp/container/map/get_allocator.html',0,'std::map::get_allocator()'],['http://en.cppreference.com/w/cpp/regex/match_results/get_allocator.html',0,'std::cmatch::get_allocator()'],['http://en.cppreference.com/w/cpp/container/unordered_set/get_allocator.html',0,'std::unordered_set::get_allocator()'],['http://en.cppreference.com/w/cpp/container/multimap/get_allocator.html',0,'std::multimap::get_allocator()']]], + ['get_5fclock_5fdiff_2910',['get_clock_diff',['../d4/def/kohonen__som__topology_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a2256c10b16edba377b64a44b6c656908',1,'get_clock_diff(clock_t start_t, clock_t end_t): kohonen_som_trace.cpp']]], + ['get_5fdate_2911',['get_date',['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get::get_date()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_date.html',0,'std::time_get_byname::get_date()']]], + ['get_5fdeleter_2912',['get_deleter',['http://en.cppreference.com/w/cpp/memory/unique_ptr/get_deleter.html',0,'std::unique_ptr']]], + ['get_5ffuture_2913',['get_future',['http://en.cppreference.com/w/cpp/thread/promise/get_future.html',0,'std::promise::get_future()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/get_future.html',0,'std::packaged_task::get_future()']]], + ['get_5fid_2914',['get_id',['http://en.cppreference.com/w/cpp/thread/thread/get_id.html',0,'std::thread::get_id()'],['http://en.cppreference.com/w/cpp/thread/get_id.html',0,'std::this_thread::get_id()']]], + ['get_5finput_2915',['get_input',['../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1',1,'ternary_search.cpp']]], + ['get_5finverse_2916',['get_inverse',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98ab8f75d981088369b89b8be2182483',1,'ordinary_least_squares_regressor.cpp']]], + ['get_5fmin_5f2d_2917',['get_min_2d',['../d9/d66/group__machine__learning.html#gab53c14440b2b2dd3172c66afc5c2f63f',1,'kohonen_som_topology.cpp']]], + ['get_5fmoney_2918',['get_money',['http://en.cppreference.com/w/cpp/io/manip/get_money.html',0,'std']]], + ['get_5fmonthname_2919',['get_monthname',['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get::get_monthname()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_monthname.html',0,'std::time_get_byname::get_monthname()']]], + ['get_5fnew_5fhandler_2920',['get_new_handler',['http://en.cppreference.com/w/cpp/memory/new/get_new_handler.html',0,'std']]], + ['get_5fpointer_5fsafety_2921',['get_pointer_safety',['http://en.cppreference.com/w/cpp/memory/gc/get_pointer_safety.html',0,'std']]], + ['get_5ftemporary_5fbuffer_2922',['get_temporary_buffer',['http://en.cppreference.com/w/cpp/memory/get_temporary_buffer.html',0,'std']]], + ['get_5fterminate_2923',['get_terminate',['http://en.cppreference.com/w/cpp/error/get_terminate.html',0,'std']]], + ['get_5ftime_2924',['get_time',['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get::get_time()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_time.html',0,'std::time_get_byname::get_time()'],['http://en.cppreference.com/w/cpp/io/manip/get_time.html',0,'std::get_time()']]], + ['get_5ftranspose_2925',['get_transpose',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05',1,'ordinary_least_squares_regressor.cpp']]], + ['get_5funexpected_2926',['get_unexpected',['http://en.cppreference.com/w/cpp/error/get_unexpected.html',0,'std']]], + ['get_5fweekday_2927',['get_weekday',['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get::get_weekday()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_weekday.html',0,'std::time_get_byname::get_weekday()']]], + ['get_5fyear_2928',['get_year',['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get::get_year()'],['http://en.cppreference.com/w/cpp/locale/time_get/get_year.html',0,'std::time_get_byname::get_year()']]], + ['getadjlist_2929',['getAdjList',['../da/d9a/class_graph.html#ae8959064e179573cc48f8cee99115c07',1,'Graph']]], + ['getbalance_2930',['getBalance',['../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546',1,'avltree.cpp']]], + ['getc_2931',['getc',['http://en.cppreference.com/w/cpp/io/c/fgetc.html',0,'std']]], + ['getchar_2932',['getchar',['http://en.cppreference.com/w/cpp/io/c/getchar.html',0,'std']]], + ['getenv_2933',['getenv',['http://en.cppreference.com/w/cpp/utility/program/getenv.html',0,'std']]], + ['getfailurearray_2934',['getFailureArray',['../d9/d03/namespacestring__search.html#aa422aab133d4ed5e5d6022a7f701271f',1,'string_search']]], + ['getline_2935',['getline',['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_fstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::strstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_stringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istrstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wiostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_ifstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::istream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wfstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::basic_iostream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wstringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::wistringstream::getline()'],['http://en.cppreference.com/w/cpp/io/basic_istream/getline.html',0,'std::ifstream::getline()'],['http://en.cppreference.com/w/cpp/string/basic_string/getline.html',0,'std::getline()']]], + ['getloc_2936',['getloc',['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::regex::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::basic_regex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ios::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_fstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/getloc.html',0,'std::wregex::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wfilebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ios_base::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::wstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::strstreambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wifstream::getloc()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/getloc.html',0,'std::regex_traits::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_stringbuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::strstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::basic_streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_stringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wostringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ostream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::filebuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wiostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_ifstream::getloc()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/getloc.html',0,'std::streambuf::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::istream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ostrstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wfstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::basic_iostream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wofstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wstringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::wistringstream::getloc()'],['http://en.cppreference.com/w/cpp/io/ios_base/getloc.html',0,'std::ifstream::getloc()']]], + ['getmin_2937',['getMin',['../d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130',1,'MinHeap']]], + ['getnode_2938',['getnode',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be',1,'linkedlist_implentation_usingarray.cpp']]], + ['gets_2939',['gets',['http://en.cppreference.com/w/cpp/io/c/gets.html',0,'std']]], + ['getvertices_2940',['getVertices',['../da/d9a/class_graph.html#a8aa88a88269773cc4dba255dec035898',1,'Graph']]], + ['getwchar_2941',['getwchar',['http://en.cppreference.com/w/cpp/io/c/getwchar.html',0,'std']]], + ['global_2942',['global',['http://en.cppreference.com/w/cpp/locale/locale/global.html',0,'std::locale']]], + ['gmtime_2943',['gmtime',['http://en.cppreference.com/w/cpp/chrono/c/gmtime.html',0,'std']]], + ['good_2944',['good',['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ios::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_fstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::strstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_stringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wostringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wiostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_ifstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::istream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ostrstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wfstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::basic_iostream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wofstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wstringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::wistringstream::good()'],['http://en.cppreference.com/w/cpp/io/basic_ios/good.html',0,'std::ifstream::good()']]], + ['gptr_2945',['gptr',['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wfilebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::wstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::strstreambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_stringbuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::basic_streambuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::filebuf::gptr()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/gptr.html',0,'std::streambuf::gptr()']]], + ['graph_2946',['Graph',['../da/d9a/class_graph.html#ae30edce9b4e7c6347e67edc343f366d8',1,'Graph::Graph(unsigned int vertices, AdjList const &adjList)'],['../da/d9a/class_graph.html#a8c95e00effaea0cd9404dd74cd802ae3',1,'Graph::Graph(unsigned int vertices, AdjList &&adjList)'],['../da/d9a/class_graph.html#aa99d44d3179d5bbbfa84a5031cf80cb1',1,'Graph::Graph(unsigned int vertices, std::vector< Edge > const &edges)']]], + ['grouping_2947',['grouping',['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/grouping.html',0,'std::moneypunct::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct_byname::grouping()'],['http://en.cppreference.com/w/cpp/locale/numpunct/grouping.html',0,'std::numpunct::grouping()']]] +]; diff --git a/search/functions_8.html b/search/functions_8.html new file mode 100644 index 000000000..8600cab52 --- /dev/null +++ b/search/functions_8.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_8.js b/search/functions_8.js new file mode 100644 index 000000000..d12aaae4a --- /dev/null +++ b/search/functions_8.js @@ -0,0 +1,16 @@ +var searchData= +[ + ['h_2948',['h',['../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001',1,'hash_search.cpp']]], + ['hardware_5fconcurrency_2949',['hardware_concurrency',['http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html',0,'std::thread']]], + ['has_5ffacet_2950',['has_facet',['http://en.cppreference.com/w/cpp/locale/has_facet.html',0,'std']]], + ['haschildren_2951',['hasChildren',['../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb',1,'Trie']]], + ['hash_2952',['hash',['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate_byname::hash()'],['http://en.cppreference.com/w/cpp/utility/hash/hash.html',0,'std::hash::hash()'],['http://en.cppreference.com/w/cpp/locale/collate/hash.html',0,'std::collate::hash()']]], + ['hash_5fcode_2953',['hash_code',['http://en.cppreference.com/w/cpp/types/type_info/hash_code.html',0,'std::type_info::hash_code()'],['http://en.cppreference.com/w/cpp/types/type_index/hash_code.html',0,'std::type_index::hash_code()']]], + ['hash_5ffunction_2954',['hash_function',['http://en.cppreference.com/w/cpp/container/unordered_map/hash_function.html',0,'std::unordered_map::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/hash_function.html',0,'std::unordered_multimap::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/hash_function.html',0,'std::unordered_multiset::hash_function()'],['http://en.cppreference.com/w/cpp/container/unordered_set/hash_function.html',0,'std::unordered_set::hash_function()']]], + ['hash_5fsearch_2955',['hash_search',['../d1/df3/hash__search_8cpp.html#a36ea13c16028f18ef2d5ff47f3fda7a2',1,'hash_search.cpp']]], + ['height_2956',['height',['../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83',1,'avltree.cpp']]], + ['hex_2957',['hex',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], + ['hexfloat_2958',['hexfloat',['http://en.cppreference.com/w/cpp/io/manip/fixed.html',0,'std']]], + ['hours_2959',['hours',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::hours']]], + ['hypot_2960',['hypot',['http://en.cppreference.com/w/cpp/numeric/math/hypot.html',0,'std']]] +]; diff --git a/search/functions_9.html b/search/functions_9.html new file mode 100644 index 000000000..76e3e2ca8 --- /dev/null +++ b/search/functions_9.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_9.js b/search/functions_9.js new file mode 100644 index 000000000..2441cd800 --- /dev/null +++ b/search/functions_9.js @@ -0,0 +1,86 @@ +var searchData= +[ + ['id_2961',['id',['http://en.cppreference.com/w/cpp/locale/locale/id/id.html',0,'std::locale::id::id()'],['http://en.cppreference.com/w/cpp/thread/thread/id/id.html',0,'std::thread::id::id()']]], + ['ifstream_2962',['ifstream',['http://en.cppreference.com/w/cpp/io/basic_ifstream/basic_ifstream.html',0,'std::ifstream']]], + ['ignore_2963',['ignore',['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_fstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::strstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_stringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istrstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wiostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_ifstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::istream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wfstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::basic_iostream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wstringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::wistringstream::ignore()'],['http://en.cppreference.com/w/cpp/io/basic_istream/ignore.html',0,'std::ifstream::ignore()']]], + ['ilogb_2964',['ilogb',['http://en.cppreference.com/w/cpp/numeric/math/ilogb.html',0,'std']]], + ['imag_2965',['imag',['http://en.cppreference.com/w/cpp/numeric/complex/imag.html',0,'std::complex']]], + ['imbue_2966',['imbue',['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::regex::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::basic_regex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::basic_ios::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_fstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/imbue.html',0,'std::wregex::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wfilebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/ios_base/imbue.html',0,'std::ios_base::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::wstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::strstreambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wifstream::imbue()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/imbue.html',0,'std::regex_traits::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_stringbuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::strstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::basic_streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_stringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wostringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::filebuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wiostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_ifstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/pubimbue.html',0,'std::streambuf::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::istream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ostrstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wfstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::basic_iostream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wofstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wstringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::wistringstream::imbue()'],['http://en.cppreference.com/w/cpp/io/basic_ios/imbue.html',0,'std::ifstream::imbue()']]], + ['in_2967',['in',['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_byname::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf8_utf16::in()'],['http://en.cppreference.com/w/cpp/locale/codecvt/in.html',0,'std::codecvt_utf16::in()']]], + ['in_5favail_2968',['in_avail',['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wfilebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::wstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::strstreambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_stringbuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::basic_streambuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::filebuf::in_avail()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/in_avail.html',0,'std::streambuf::in_avail()']]], + ['includes_2969',['includes',['http://en.cppreference.com/w/cpp/algorithm/includes.html',0,'std']]], + ['independent_5fbits_5fengine_2970',['independent_bits_engine',['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/independent_bits_engine.html',0,'std::independent_bits_engine']]], + ['infinity_2971',['infinity',['http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html',0,'std::numeric_limits']]], + ['init_2972',['init',['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ios::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_fstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::strstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_stringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wostringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wiostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_ifstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::istream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ostrstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wfstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::basic_iostream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wofstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wstringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::wistringstream::init()'],['http://en.cppreference.com/w/cpp/io/basic_ios/init.html',0,'std::ifstream::init()'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a02fd73d861ef2e4aabb38c0c9ff82947',1,'init(): sieve_of_eratosthenes.cpp']]], + ['initializer_5flist_2973',['initializer_list',['http://en.cppreference.com/w/cpp/utility/initializer_list/initializer_list.html',0,'std::initializer_list']]], + ['inner_5fallocator_2974',['inner_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/inner_allocator.html',0,'std::scoped_allocator_adaptor']]], + ['inner_5fproduct_2975',['inner_product',['http://en.cppreference.com/w/cpp/algorithm/inner_product.html',0,'std']]], + ['inplace_5fmerge_2976',['inplace_merge',['http://en.cppreference.com/w/cpp/algorithm/inplace_merge.html',0,'std']]], + ['insert_2977',['insert',['http://en.cppreference.com/w/cpp/container/vector/insert.html',0,'std::vector::insert()'],['http://en.cppreference.com/w/cpp/container/multiset/insert.html',0,'std::multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::string::insert()'],['http://en.cppreference.com/w/cpp/container/set/insert.html',0,'std::set::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_map/insert.html',0,'std::unordered_map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/insert.html',0,'std::unordered_multimap::insert()'],['http://en.cppreference.com/w/cpp/container/deque/insert.html',0,'std::deque::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::basic_string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::wstring::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/insert.html',0,'std::unordered_multiset::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u16string::insert()'],['http://en.cppreference.com/w/cpp/string/basic_string/insert.html',0,'std::u32string::insert()'],['http://en.cppreference.com/w/cpp/container/list/insert.html',0,'std::list::insert()'],['http://en.cppreference.com/w/cpp/container/map/insert.html',0,'std::map::insert()'],['http://en.cppreference.com/w/cpp/container/unordered_set/insert.html',0,'std::unordered_set::insert()'],['http://en.cppreference.com/w/cpp/container/multimap/insert.html',0,'std::multimap::insert()'],['../dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2',1,'Trie::insert()'],['../d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a',1,'insert(): avltree.cpp']]], + ['insert_5fafter_2978',['insert_after',['http://en.cppreference.com/w/cpp/container/forward_list/insert_after.html',0,'std::forward_list']]], + ['insertatthebeginning_2979',['insertAtTheBeginning',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df',1,'linkedlist_implentation_usingarray.cpp']]], + ['inserter_2980',['inserter',['http://en.cppreference.com/w/cpp/iterator/inserter.html',0,'std']]], + ['insertkey_2981',['insertKey',['../d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82',1,'MinHeap']]], + ['internal_2982',['internal',['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std']]], + ['interpolation_5fsearch_2983',['interpolation_search',['../d9/dd7/interpolation__search_8cpp.html#a9805865b5c5ca6b0fdf95fd86132625a',1,'interpolation_search.cpp']]], + ['interpolationsearch_2984',['InterpolationSearch',['../df/d39/interpolation__search2_8cpp.html#aa3ec659ec8394d186c761df81ad1f629',1,'interpolation_search2.cpp']]], + ['intervals_2985',['intervals',['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/params.html',0,'std::piecewise_constant_distribution::intervals()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/params.html',0,'std::piecewise_linear_distribution::intervals()']]], + ['invalid_5fargument_2986',['invalid_argument',['http://en.cppreference.com/w/cpp/error/invalid_argument.html',0,'std::invalid_argument']]], + ['ios_5fbase_2987',['ios_base',['http://en.cppreference.com/w/cpp/io/ios_base/ios_base.html',0,'std::ios_base']]], + ['iostream_2988',['iostream',['http://en.cppreference.com/w/cpp/io/basic_iostream/basic_iostream.html',0,'std::iostream']]], + ['iota_2989',['iota',['http://en.cppreference.com/w/cpp/algorithm/iota.html',0,'std']]], + ['is_2990',['is',['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype_byname::is()'],['http://en.cppreference.com/w/cpp/locale/ctype/is.html',0,'std::ctype::is()']]], + ['is_5fhappy_2991',['is_happy',['../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7',1,'happy_number.cpp']]], + ['is_5fheap_2992',['is_heap',['http://en.cppreference.com/w/cpp/algorithm/is_heap.html',0,'std']]], + ['is_5fheap_5funtil_2993',['is_heap_until',['http://en.cppreference.com/w/cpp/algorithm/is_heap_until.html',0,'std']]], + ['is_5flock_5ffree_2994',['is_lock_free',['http://en.cppreference.com/w/cpp/atomic/atomic/is_lock_free.html',0,'std::atomic']]], + ['is_5fopen_2995',['is_open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::basic_ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::basic_filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::basic_fstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::wfilebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::wifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/is_open.html',0,'std::filebuf::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::ofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::basic_ifstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/is_open.html',0,'std::wfstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html',0,'std::wofstream::is_open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/is_open.html',0,'std::ifstream::is_open()']]], + ['is_5fpartitioned_2996',['is_partitioned',['http://en.cppreference.com/w/cpp/algorithm/is_partitioned.html',0,'std']]], + ['is_5fpermutation_2997',['is_permutation',['http://en.cppreference.com/w/cpp/algorithm/is_permutation.html',0,'std']]], + ['is_5fprime_2998',['is_prime',['../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532',1,'check_prime.cpp']]], + ['is_5fsorted_2999',['is_sorted',['http://en.cppreference.com/w/cpp/algorithm/is_sorted.html',0,'std']]], + ['is_5fsorted_5funtil_3000',['is_sorted_until',['http://en.cppreference.com/w/cpp/algorithm/is_sorted_until.html',0,'std']]], + ['is_5fsquare_3001',['is_square',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f',1,'ordinary_least_squares_regressor.cpp']]], + ['isalnum_3002',['isalnum',['http://en.cppreference.com/w/cpp/string/byte/isalnum.html',0,'std']]], + ['isalpha_3003',['isalpha',['http://en.cppreference.com/w/cpp/string/byte/isalpha.html',0,'std']]], + ['isblank_3004',['isblank',['http://en.cppreference.com/w/cpp/string/byte/isblank.html',0,'std']]], + ['iscntrl_3005',['iscntrl',['http://en.cppreference.com/w/cpp/string/byte/iscntrl.html',0,'std']]], + ['isctype_3006',['isctype',['http://en.cppreference.com/w/cpp/regex/regex_traits/isctype.html',0,'std::regex_traits']]], + ['iscyclicbfs_3007',['isCyclicBFS',['../d3/dbb/class_cycle_check.html#a399292a33edf87499daa52b51315aca5',1,'CycleCheck']]], + ['iscyclicdfs_3008',['isCyclicDFS',['../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474',1,'CycleCheck']]], + ['iscyclicdfshelper_3009',['isCyclicDFSHelper',['../d3/dbb/class_cycle_check.html#a2f4485c08b45e7a21a2e86f9c3f01d8b',1,'CycleCheck']]], + ['isdigit_3010',['isdigit',['http://en.cppreference.com/w/cpp/string/byte/isdigit.html',0,'std']]], + ['isemptyqueue_3011',['isEmptyQueue',['../d2/d36/structqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31',1,'queue']]], + ['isemptystack_3012',['isEmptyStack',['../d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a',1,'stack']]], + ['isfinite_3013',['isfinite',['http://en.cppreference.com/w/cpp/numeric/math/isfinite.html',0,'std']]], + ['isgraph_3014',['isgraph',['http://en.cppreference.com/w/cpp/string/byte/isgraph.html',0,'std']]], + ['isinf_3015',['isinf',['http://en.cppreference.com/w/cpp/numeric/math/isinf.html',0,'std']]], + ['islower_3016',['islower',['http://en.cppreference.com/w/cpp/string/byte/islower.html',0,'std']]], + ['isnan_3017',['isnan',['http://en.cppreference.com/w/cpp/numeric/math/isnan.html',0,'std']]], + ['isnormal_3018',['isnormal',['http://en.cppreference.com/w/cpp/numeric/math/isnormal.html',0,'std']]], + ['isprime_3019',['IsPrime',['../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf',1,'IsPrime(int number): primality_test.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd',1,'isPrime(int64_t m): modular_inverse_fermat_little_theorem.cpp']]], + ['isprint_3020',['isprint',['http://en.cppreference.com/w/cpp/string/byte/isprint.html',0,'std']]], + ['ispunct_3021',['ispunct',['http://en.cppreference.com/w/cpp/string/byte/ispunct.html',0,'std']]], + ['isspace_3022',['isspace',['http://en.cppreference.com/w/cpp/string/byte/isspace.html',0,'std']]], + ['istream_3023',['istream',['http://en.cppreference.com/w/cpp/io/basic_istream/basic_istream.html',0,'std::istream']]], + ['istringstream_3024',['istringstream',['http://en.cppreference.com/w/cpp/io/basic_istringstream/basic_istringstream.html',0,'std::istringstream']]], + ['istrstream_3025',['istrstream',['http://en.cppreference.com/w/cpp/io/istrstream/istrstream.html',0,'std::istrstream']]], + ['isupper_3026',['isupper',['http://en.cppreference.com/w/cpp/string/byte/isupper.html',0,'std']]], + ['iswalnum_3027',['iswalnum',['http://en.cppreference.com/w/cpp/string/wide/iswalnum.html',0,'std']]], + ['iswalpha_3028',['iswalpha',['http://en.cppreference.com/w/cpp/string/wide/iswalpha.html',0,'std']]], + ['iswblank_3029',['iswblank',['http://en.cppreference.com/w/cpp/string/wide/iswblank.html',0,'std']]], + ['iswcntrl_3030',['iswcntrl',['http://en.cppreference.com/w/cpp/string/wide/iswcntrl.html',0,'std']]], + ['iswctype_3031',['iswctype',['http://en.cppreference.com/w/cpp/string/wide/iswctype.html',0,'std']]], + ['iswdigit_3032',['iswdigit',['http://en.cppreference.com/w/cpp/string/wide/iswdigit.html',0,'std']]], + ['iswgraph_3033',['iswgraph',['http://en.cppreference.com/w/cpp/string/wide/iswgraph.html',0,'std']]], + ['iswlower_3034',['iswlower',['http://en.cppreference.com/w/cpp/string/wide/iswlower.html',0,'std']]], + ['iswprint_3035',['iswprint',['http://en.cppreference.com/w/cpp/string/wide/iswprint.html',0,'std']]], + ['iswpunct_3036',['iswpunct',['http://en.cppreference.com/w/cpp/string/wide/iswpunct.html',0,'std']]], + ['iswspace_3037',['iswspace',['http://en.cppreference.com/w/cpp/string/wide/iswspace.html',0,'std']]], + ['iswupper_3038',['iswupper',['http://en.cppreference.com/w/cpp/string/wide/iswupper.html',0,'std']]], + ['iswxdigit_3039',['iswxdigit',['http://en.cppreference.com/w/cpp/string/wide/iswxdigit.html',0,'std']]], + ['isxdigit_3040',['isxdigit',['http://en.cppreference.com/w/cpp/string/byte/isxdigit.html',0,'std']]], + ['it_5fternary_5fsearch_3041',['it_ternary_search',['../dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0',1,'ternary_search.cpp']]], + ['iter_5fswap_3042',['iter_swap',['http://en.cppreference.com/w/cpp/algorithm/iter_swap.html',0,'std']]], + ['iword_3043',['iword',['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ios::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_fstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ios_base::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::strstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_stringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wostringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wiostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_ifstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::istream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ostrstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wfstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::basic_iostream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wofstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wstringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::wistringstream::iword()'],['http://en.cppreference.com/w/cpp/io/ios_base/iword.html',0,'std::ifstream::iword()']]] +]; diff --git a/search/functions_a.html b/search/functions_a.html new file mode 100644 index 000000000..81836b95a --- /dev/null +++ b/search/functions_a.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_a.js b/search/functions_a.js new file mode 100644 index 000000000..1fff60f8b --- /dev/null +++ b/search/functions_a.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['join_3044',['join',['http://en.cppreference.com/w/cpp/thread/thread/join.html',0,'std::thread']]], + ['joinable_3045',['joinable',['http://en.cppreference.com/w/cpp/thread/thread/joinable.html',0,'std::thread']]], + ['jumpsearch_3046',['jumpSearch',['../d2/d22/jump__search_8cpp.html#ab49fd8f401bfc71f63b74711390cccf0',1,'jump_search.cpp']]] +]; diff --git a/search/functions_b.html b/search/functions_b.html new file mode 100644 index 000000000..8c270d25f --- /dev/null +++ b/search/functions_b.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_b.js b/search/functions_b.js new file mode 100644 index 000000000..52a2a644e --- /dev/null +++ b/search/functions_b.js @@ -0,0 +1,11 @@ +var searchData= +[ + ['k_3047',['k',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/params.html',0,'std::negative_binomial_distribution']]], + ['key_5fcomp_3048',['key_comp',['http://en.cppreference.com/w/cpp/container/multiset/key_comp.html',0,'std::multiset::key_comp()'],['http://en.cppreference.com/w/cpp/container/set/key_comp.html',0,'std::set::key_comp()'],['http://en.cppreference.com/w/cpp/container/map/key_comp.html',0,'std::map::key_comp()'],['http://en.cppreference.com/w/cpp/container/multimap/key_comp.html',0,'std::multimap::key_comp()']]], + ['key_5feq_3049',['key_eq',['http://en.cppreference.com/w/cpp/container/unordered_map/key_eq.html',0,'std::unordered_map::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/key_eq.html',0,'std::unordered_multimap::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/key_eq.html',0,'std::unordered_multiset::key_eq()'],['http://en.cppreference.com/w/cpp/container/unordered_set/key_eq.html',0,'std::unordered_set::key_eq()']]], + ['kill_5fdependency_3050',['kill_dependency',['http://en.cppreference.com/w/cpp/atomic/kill_dependency.html',0,'std']]], + ['kmp_3051',['kmp',['../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93',1,'string_search']]], + ['knuth_5fb_3052',['knuth_b',['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/shuffle_order_engine.html',0,'std::knuth_b']]], + ['kohonen_5fsom_3053',['kohonen_som',['../d8/d77/namespacemachine__learning.html#adc731720947b4bc2ab047c141e7d0299',1,'machine_learning']]], + ['kohonen_5fsom_5ftracer_3054',['kohonen_som_tracer',['../d8/d77/namespacemachine__learning.html#acc6a28f40512dbda75ab1a3969248898',1,'machine_learning']]] +]; diff --git a/search/functions_c.html b/search/functions_c.html new file mode 100644 index 000000000..af1234d02 --- /dev/null +++ b/search/functions_c.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_c.js b/search/functions_c.js new file mode 100644 index 000000000..2d6fbd3f3 --- /dev/null +++ b/search/functions_c.js @@ -0,0 +1,46 @@ +var searchData= +[ + ['labs_3055',['labs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['lambda_3056',['lambda',['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/lambda.html',0,'std::exponential_distribution']]], + ['large_5fnumber_3057',['large_number',['../db/d82/classlarge__number.html#a10119a83839e65962621b73df46a5337',1,'large_number::large_number()'],['../db/d82/classlarge__number.html#af4598f1f2794b5e17e10c25e0501e41a',1,'large_number::large_number(int n)'],['../db/d82/classlarge__number.html#a0b1efd203274e38a67b78937dfb9b872',1,'large_number::large_number(const large_number &a)'],['../db/d82/classlarge__number.html#a76ddf1ed1b00fb8c107ea56f7f91e42f',1,'large_number::large_number(std::vector< unsigned char > &vec)']]], + ['lcm_3058',['lcm',['../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25',1,'least_common_multiple.cpp']]], + ['ldexp_3059',['ldexp',['http://en.cppreference.com/w/cpp/numeric/math/ldexp.html',0,'std']]], + ['ldiv_3060',['ldiv',['http://en.cppreference.com/w/cpp/numeric/math/div.html',0,'std']]], + ['left_3061',['left',['../d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca',1,'MinHeap::left()'],['http://en.cppreference.com/w/cpp/io/manip/left.html',0,'std::left()']]], + ['leftrotate_3062',['leftRotate',['../d8/dee/avltree_8cpp.html#aed58f3cea338a9d7bdcb9a4cfc6c7a78',1,'avltree.cpp']]], + ['lenghtline_3063',['LenghtLine',['../d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a',1,'smallest_circle.cpp']]], + ['length_3064',['length',['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::match_results::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt::length()'],['http://en.cppreference.com/w/cpp/string/char_traits/length.html',0,'std::char_traits::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_byname::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wsmatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wcsub_match::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::smatch::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf8_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::wcmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::wssub_match::length()'],['http://en.cppreference.com/w/cpp/regex/regex_traits/length.html',0,'std::regex_traits::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::csub_match::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::ssub_match::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::basic_string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::wstring::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u16string::length()'],['http://en.cppreference.com/w/cpp/string/basic_string/size.html',0,'std::u32string::length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/length.html',0,'std::codecvt_utf16::length()'],['http://en.cppreference.com/w/cpp/regex/match_results/length.html',0,'std::cmatch::length()'],['http://en.cppreference.com/w/cpp/regex/sub_match/length.html',0,'std::sub_match::length()']]], + ['length_5ferror_3065',['length_error',['http://en.cppreference.com/w/cpp/error/length_error.html',0,'std::length_error']]], + ['levelorder_3066',['levelOrder',['../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59',1,'avltree.cpp']]], + ['lexicographical_5fcompare_3067',['lexicographical_compare',['http://en.cppreference.com/w/cpp/algorithm/lexicographical_compare.html',0,'std']]], + ['lgamma_3068',['lgamma',['http://en.cppreference.com/w/cpp/numeric/math/lgamma.html',0,'std']]], + ['linear_5fcongruential_5fengine_3069',['linear_congruential_engine',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::linear_congruential_engine']]], + ['linearsearch_3070',['LinearSearch',['../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84',1,'linear_search.cpp']]], + ['list_3071',['list',['http://en.cppreference.com/w/cpp/container/list/list.html',0,'std::list']]], + ['llabs_3072',['llabs',['http://en.cppreference.com/w/cpp/numeric/math/abs.html',0,'std']]], + ['llrint_3073',['llrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['llround_3074',['llround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['load_3075',['load',['http://en.cppreference.com/w/cpp/atomic/atomic/load.html',0,'std::atomic']]], + ['load_5ffactor_3076',['load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/load_factor.html',0,'std::unordered_map::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/load_factor.html',0,'std::unordered_multimap::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/load_factor.html',0,'std::unordered_multiset::load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/load_factor.html',0,'std::unordered_set::load_factor()']]], + ['locale_3077',['locale',['http://en.cppreference.com/w/cpp/locale/locale/locale.html',0,'std::locale']]], + ['localeconv_3078',['localeconv',['http://en.cppreference.com/w/cpp/locale/localeconv.html',0,'std']]], + ['localtime_3079',['localtime',['http://en.cppreference.com/w/cpp/chrono/c/localtime.html',0,'std']]], + ['lock_3080',['lock',['http://en.cppreference.com/w/cpp/memory/weak_ptr/lock.html',0,'std::weak_ptr::lock()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/lock.html',0,'std::unique_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/lock.html',0,'std::recursive_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/lock.html',0,'std::recursive_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/lock.html',0,'std::shared_lock::lock()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/lock.html',0,'std::timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/mutex/lock.html',0,'std::mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock.html',0,'std::shared_timed_mutex::lock()'],['http://en.cppreference.com/w/cpp/thread/lock.html',0,'std::lock()']]], + ['lock_5fguard_3081',['lock_guard',['http://en.cppreference.com/w/cpp/thread/lock_guard/lock_guard.html',0,'std::lock_guard']]], + ['lock_5fshared_3082',['lock_shared',['http://en.cppreference.com/w/cpp/thread/shared_timed_mutex/lock_shared.html',0,'std::shared_timed_mutex']]], + ['log_3083',['log',['http://en.cppreference.com/w/cpp/numeric/math/log.html',0,'std']]], + ['log10_3084',['log10',['http://en.cppreference.com/w/cpp/numeric/math/log10.html',0,'std']]], + ['log1p_3085',['log1p',['http://en.cppreference.com/w/cpp/numeric/math/log1p.html',0,'std']]], + ['logb_3086',['logb',['http://en.cppreference.com/w/cpp/numeric/math/logb.html',0,'std']]], + ['logic_5ferror_3087',['logic_error',['http://en.cppreference.com/w/cpp/error/logic_error.html',0,'std::logic_error']]], + ['lognormal_5fdistribution_3088',['lognormal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/lognormal_distribution.html',0,'std::lognormal_distribution']]], + ['longjmp_3089',['longjmp',['http://en.cppreference.com/w/cpp/utility/program/longjmp.html',0,'std']]], + ['lookup_5fclassname_3090',['lookup_classname',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_classname.html',0,'std::regex_traits']]], + ['lookup_5fcollatename_3091',['lookup_collatename',['http://en.cppreference.com/w/cpp/regex/regex_traits/lookup_collatename.html',0,'std::regex_traits']]], + ['lower_5fbound_3092',['lower_bound',['http://en.cppreference.com/w/cpp/container/multiset/lower_bound.html',0,'std::multiset::lower_bound()'],['http://en.cppreference.com/w/cpp/container/set/lower_bound.html',0,'std::set::lower_bound()'],['http://en.cppreference.com/w/cpp/container/map/lower_bound.html',0,'std::map::lower_bound()'],['http://en.cppreference.com/w/cpp/container/multimap/lower_bound.html',0,'std::multimap::lower_bound()'],['http://en.cppreference.com/w/cpp/algorithm/lower_bound.html',0,'std::lower_bound()']]], + ['lowest_3093',['lowest',['http://en.cppreference.com/w/cpp/types/numeric_limits/lowest.html',0,'std::numeric_limits']]], + ['lrint_3094',['lrint',['http://en.cppreference.com/w/cpp/numeric/math/rint.html',0,'std']]], + ['lround_3095',['lround',['http://en.cppreference.com/w/cpp/numeric/math/round.html',0,'std']]], + ['lt_3096',['lt',['http://en.cppreference.com/w/cpp/string/char_traits/cmp.html',0,'std::char_traits']]], + ['lu_5fdecomposition_3097',['lu_decomposition',['../dd/d65/lu__decompose_8cpp.html#af703fd0afe349e567d7a82350e03cace',1,'lu_decompose.cpp']]] +]; diff --git a/search/functions_d.html b/search/functions_d.html new file mode 100644 index 000000000..71165945c --- /dev/null +++ b/search/functions_d.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_d.js b/search/functions_d.js new file mode 100644 index 000000000..7d649ffb4 --- /dev/null +++ b/search/functions_d.js @@ -0,0 +1,78 @@ +var searchData= +[ + ['m_3098',['m',['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/params.html',0,'std::lognormal_distribution::m()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::m()']]], + ['main_3099',['main',['../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): avltree.cpp'],['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linkedlist_implentation_usingarray.cpp'],['../dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): trie_modern.cpp'],['../d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): line_segment_intersection.cpp'],['../d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): adaline_learning.cpp'],['../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_topology.cpp'],['../d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): kohonen_som_trace.cpp'],['../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binary_exponent.cpp'],['../db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): check_prime.cpp'],['../d7/d89/double__factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): double_factorial.cpp'],['../da/d23/eulers__totient__function_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): eulers_totient_function.cpp'],['../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): extended_euclid_algorithm.cpp'],['../d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): factorial.cpp'],['../d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_power.cpp'],['../d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci.cpp'],['../d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fibonacci_fast.cpp'],['../d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_iterative_euclidean.cpp'],['../d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_of_n_numbers.cpp'],['../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gcd_recursive_euclidean.cpp'],['../d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): large_factorial.cpp'],['../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): least_common_multiple.cpp'],['../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): modular_inverse_fermat_little_theorem.cpp'],['../d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): number_of_positive_divisors.cpp'],['../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): power_for_huge_numbers.cpp'],['../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_factorization.cpp'],['../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): prime_numbers.cpp'],['../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primes_up_to_billion.cpp'],['../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): realtime_stats.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sieve_of_eratosthenes.cpp'],['../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sqrt_double.cpp'],['../de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): string_fibonacci.cpp'],['../d7/d6a/bisection__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bisection_method.cpp'],['../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): false_position.cpp'],['../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): gaussian_elimination.cpp'],['../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): lu_decompose.cpp'],['../de/dd3/newton__raphson__method_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): newton_raphson_method.cpp'],['../db/dd3/ode__forward__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_forward_euler.cpp'],['../d6/dd3/ode__midpoint__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_midpoint_euler.cpp'],['../d3/d06/ode__semi__implicit__euler_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): ode_semi_implicit_euler.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ordinary_least_squares_regressor.cpp'],['../d3/d24/qr__decomposition_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): qr_decomposition.cpp'],['../de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627',1,'main(int argc, char **argv): qr_eigen_values.cpp'],['../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): successive_approximation.cpp'],['../d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): buzz_number.cpp'],['../da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): decimal_to_hexadecimal.cpp'],['../de/d85/decimal__to__roman__numeral_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): decimal_to_roman_numeral.cpp'],['../d4/de8/fast__interger__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): fast_interger_input.cpp'],['../db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): happy_number.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): matrix_exponentiation.cpp'],['../da/d9a/palindrome__of__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): palindrome_of_number.cpp'],['../dc/d1a/pascal__triangle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): pascal_triangle.cpp'],['../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): primality_test.cpp'],['../d0/d01/smallest__circle_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): smallest_circle.cpp'],['../d3/d19/sparse__matrix_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): sparse_matrix.cpp'],['../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): spiral_print.cpp'],['../d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): stairs_pattern.cpp'],['../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): tower_of_hanoi.cpp'],['../d3/d61/vector__important__functions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): vector_important_functions.cpp'],['../d6/d4a/addition__rule_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): addition_rule.cpp'],['../d5/d67/bayes__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): bayes_theorem.cpp'],['../d6/db0/binomial__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): binomial_dist.cpp'],['../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): poisson_dist.cpp'],['../df/dd5/binary__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089',1,'main(int argc, char const *argv[]): binary_search.cpp'],['../d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): exponential_search.cpp'],['../d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): hash_search.cpp'],['../d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search.cpp'],['../df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): interpolation_search2.cpp'],['../d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): linear_search.cpp'],['../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): median_search.cpp'],['../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): ternary_search.cpp'],['../dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): text_search.cpp'],['../d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): quick_sort.cpp'],['../d4/d7a/shell__sort2_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97',1,'main(int argc, char *argv[]): shell_sort2.cpp'],['../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): brute_force_string_searching.cpp'],['../de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4',1,'main(): knuth_morris_pratt.cpp'],['../d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe',1,'main(void): rabin_karp.cpp']]], + ['make_5fexception_5fptr_3100',['make_exception_ptr',['http://en.cppreference.com/w/cpp/error/make_exception_ptr.html',0,'std']]], + ['make_5fheap_3101',['make_heap',['http://en.cppreference.com/w/cpp/algorithm/make_heap.html',0,'std']]], + ['make_5fmove_5fiterator_3102',['make_move_iterator',['http://en.cppreference.com/w/cpp/iterator/make_move_iterator.html',0,'std']]], + ['make_5foptional_3103',['make_optional',['http://en.cppreference.com/w/cpp/experimental/optional/make_optional.html',0,'std::experimental']]], + ['make_5fpair_3104',['make_pair',['http://en.cppreference.com/w/cpp/utility/pair/make_pair.html',0,'std']]], + ['make_5fready_5fat_5fthread_5fexit_3105',['make_ready_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/packaged_task/make_ready_at_thread_exit.html',0,'std::packaged_task']]], + ['make_5fshared_3106',['make_shared',['http://en.cppreference.com/w/cpp/memory/shared_ptr/make_shared.html',0,'std']]], + ['make_5ftuple_3107',['make_tuple',['http://en.cppreference.com/w/cpp/utility/tuple/make_tuple.html',0,'std']]], + ['malloc_3108',['malloc',['http://en.cppreference.com/w/cpp/memory/c/malloc.html',0,'std']]], + ['map_3109',['map',['http://en.cppreference.com/w/cpp/container/map/map.html',0,'std::map']]], + ['mark_5fcount_3110',['mark_count',['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::basic_regex::mark_count()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/mark_count.html',0,'std::wregex::mark_count()']]], + ['mat_5fmul_3111',['mat_mul',['../de/d75/qr__eigen__values_8cpp.html#a7558fd7779bf207157ced66f275951a0',1,'qr_eigen_values.cpp']]], + ['match_5fresults_3112',['match_results',['http://en.cppreference.com/w/cpp/regex/match_results/match_results.html',0,'std::match_results']]], + ['max_3113',['max',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/max.html',0,'std::student_t_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937_64::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux24_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/max.html',0,'std::extreme_value_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/max.html',0,'std::lognormal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/max.html',0,'std::discrete_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux48::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/max.html',0,'std::piecewise_constant_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/max.html',0,'std::poisson_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/max.html',0,'std::bernoulli_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::discard_block_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/max.html',0,'std::exponential_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/max.html',0,'std::uniform_real_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/max.html',0,'std::geometric_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mersenne_twister_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/max.html',0,'std::independent_bits_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/max.html',0,'std::normal_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand::max()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/max.html',0,'std::weibull_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::ranlux48_base::max()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/max.html',0,'std::negative_binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/max.html',0,'std::mt19937::max()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/max.html',0,'std::chi_squared_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/max.html',0,'std::piecewise_linear_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::shuffle_order_engine::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::minutes::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::seconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::duration::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::milliseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::hours::max()'],['http://en.cppreference.com/w/cpp/chrono/time_point/max.html',0,'std::chrono::time_point::max()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/max.html',0,'std::chrono::duration_values::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::microseconds::max()'],['http://en.cppreference.com/w/cpp/chrono/duration/max.html',0,'std::chrono::nanoseconds::max()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/max.html',0,'std::numeric_limits::max()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/max.html',0,'std::uniform_int_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/max.html',0,'std::fisher_f_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/max.html',0,'std::ranlux24::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::linear_congruential_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/max.html',0,'std::knuth_b::max()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/max.html',0,'std::minstd_rand0::max()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/max.html',0,'std::gamma_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/max.html',0,'std::binomial_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/max.html',0,'std::cauchy_distribution::max()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/max.html',0,'std::subtract_with_carry_engine::max()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/max.html',0,'std::random_device::max()'],['http://en.cppreference.com/w/cpp/algorithm/max.html',0,'std::max()']]], + ['max_5fbucket_5fcount_3114',['max_bucket_count',['http://en.cppreference.com/w/cpp/container/unordered_map/max_bucket_count.html',0,'std::unordered_map::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_bucket_count.html',0,'std::unordered_multimap::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_bucket_count.html',0,'std::unordered_multiset::max_bucket_count()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_bucket_count.html',0,'std::unordered_set::max_bucket_count()']]], + ['max_5felement_3115',['max_element',['http://en.cppreference.com/w/cpp/algorithm/max_element.html',0,'std']]], + ['max_5flength_3116',['max_length',['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_byname::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf8_utf16::max_length()'],['http://en.cppreference.com/w/cpp/locale/codecvt/max_length.html',0,'std::codecvt_utf16::max_length()']]], + ['max_5fload_5ffactor_3117',['max_load_factor',['http://en.cppreference.com/w/cpp/container/unordered_map/max_load_factor.html',0,'std::unordered_map::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_load_factor.html',0,'std::unordered_multimap::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_load_factor.html',0,'std::unordered_multiset::max_load_factor()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_load_factor.html',0,'std::unordered_set::max_load_factor()']]], + ['max_5fsize_3118',['max_size',['http://en.cppreference.com/w/cpp/container/dynarray/max_size.html',0,'std::dynarray::max_size()'],['http://en.cppreference.com/w/cpp/container/vector/max_size.html',0,'std::vector::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::match_results::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator_traits/max_size.html',0,'std::allocator_traits::max_size()'],['http://en.cppreference.com/w/cpp/container/multiset/max_size.html',0,'std::multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::string::max_size()'],['http://en.cppreference.com/w/cpp/container/set/max_size.html',0,'std::set::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_map/max_size.html',0,'std::unordered_map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wsmatch::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::smatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/max_size.html',0,'std::unordered_multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/forward_list/max_size.html',0,'std::forward_list::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::wcmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/deque/max_size.html',0,'std::deque::max_size()'],['http://en.cppreference.com/w/cpp/memory/allocator/max_size.html',0,'std::allocator::max_size()'],['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/max_size.html',0,'std::scoped_allocator_adaptor::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::basic_string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::wstring::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/max_size.html',0,'std::unordered_multiset::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u16string::max_size()'],['http://en.cppreference.com/w/cpp/string/basic_string/max_size.html',0,'std::u32string::max_size()'],['http://en.cppreference.com/w/cpp/container/list/max_size.html',0,'std::list::max_size()'],['http://en.cppreference.com/w/cpp/container/map/max_size.html',0,'std::map::max_size()'],['http://en.cppreference.com/w/cpp/regex/match_results/max_size.html',0,'std::cmatch::max_size()'],['http://en.cppreference.com/w/cpp/container/unordered_set/max_size.html',0,'std::unordered_set::max_size()'],['http://en.cppreference.com/w/cpp/container/multimap/max_size.html',0,'std::multimap::max_size()'],['http://en.cppreference.com/w/cpp/container/array/max_size.html',0,'std::array::max_size()']]], + ['mblen_3119',['mblen',['http://en.cppreference.com/w/cpp/string/multibyte/mblen.html',0,'std']]], + ['mbrlen_3120',['mbrlen',['http://en.cppreference.com/w/cpp/string/multibyte/mbrlen.html',0,'std']]], + ['mbrtoc16_3121',['mbrtoc16',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc16.html',0,'std']]], + ['mbrtoc32_3122',['mbrtoc32',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtoc32.html',0,'std']]], + ['mbrtowc_3123',['mbrtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbrtowc.html',0,'std']]], + ['mbsinit_3124',['mbsinit',['http://en.cppreference.com/w/cpp/string/multibyte/mbsinit.html',0,'std']]], + ['mbsrtowcs_3125',['mbsrtowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbsrtowcs.html',0,'std']]], + ['mbstowcs_3126',['mbstowcs',['http://en.cppreference.com/w/cpp/string/multibyte/mbstowcs.html',0,'std']]], + ['mbtowc_3127',['mbtowc',['http://en.cppreference.com/w/cpp/string/multibyte/mbtowc.html',0,'std']]], + ['mean_3128',['mean',['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/mean.html',0,'std::poisson_distribution::mean()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/params.html',0,'std::normal_distribution::mean()'],['../d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b',1,'statistics::stats_computer1::mean()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a8290966ad468f2a8c266d008bc60720e',1,'statistics::stats_computer2::mean()']]], + ['mem_5ffn_3129',['mem_fn',['http://en.cppreference.com/w/cpp/utility/functional/mem_fn.html',0,'std']]], + ['memchr_3130',['memchr',['http://en.cppreference.com/w/cpp/string/byte/memchr.html',0,'std']]], + ['memcmp_3131',['memcmp',['http://en.cppreference.com/w/cpp/string/byte/memcmp.html',0,'std']]], + ['memcpy_3132',['memcpy',['http://en.cppreference.com/w/cpp/string/byte/memcpy.html',0,'std']]], + ['memmove_3133',['memmove',['http://en.cppreference.com/w/cpp/string/byte/memmove.html',0,'std']]], + ['memset_3134',['memset',['http://en.cppreference.com/w/cpp/string/byte/memset.html',0,'std']]], + ['merge_3135',['merge',['http://en.cppreference.com/w/cpp/container/forward_list/merge.html',0,'std::forward_list::merge()'],['http://en.cppreference.com/w/cpp/container/list/merge.html',0,'std::list::merge()'],['http://en.cppreference.com/w/cpp/algorithm/merge.html',0,'std::merge()'],['../d5/d91/namespacesorting.html#aa26de383227859210f14dcf12201a079',1,'sorting::merge()']]], + ['mersenne_5ftwister_5fengine_3136',['mersenne_twister_engine',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mersenne_twister_engine']]], + ['message_3137',['message',['http://en.cppreference.com/w/cpp/error/error_code/message.html',0,'std::error_code::message()'],['http://en.cppreference.com/w/cpp/error/error_category/message.html',0,'std::error_category::message()'],['http://en.cppreference.com/w/cpp/error/error_condition/message.html',0,'std::error_condition::message()']]], + ['messages_3138',['messages',['http://en.cppreference.com/w/cpp/locale/messages/messages.html',0,'std::messages']]], + ['messages_5fbyname_3139',['messages_byname',['http://en.cppreference.com/w/cpp/locale/messages_byname.html',0,'std::messages_byname']]], + ['method1_3140',['method1',['../df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11',1,'decimal_to_binary.cpp']]], + ['method2_3141',['method2',['../df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7',1,'decimal_to_binary.cpp']]], + ['microseconds_3142',['microseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::microseconds']]], + ['midpoint_5feuler_3143',['midpoint_euler',['../d6/d60/group__ode.html#ga36ff0710861ca39d957046c0b09b2985',1,'ode_midpoint_euler.cpp']]], + ['midpoint_5feuler_5fstep_3144',['midpoint_euler_step',['../d6/d60/group__ode.html#ga8c319db420c3d97a83e9dcca803b6812',1,'ode_midpoint_euler.cpp']]], + ['milliseconds_3145',['milliseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::milliseconds']]], + ['min_3146',['min',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/min.html',0,'std::student_t_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937_64::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux24_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/min.html',0,'std::extreme_value_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/min.html',0,'std::lognormal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/min.html',0,'std::discrete_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux48::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/min.html',0,'std::piecewise_constant_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/poisson_distribution/min.html',0,'std::poisson_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/bernoulli_distribution/min.html',0,'std::bernoulli_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::discard_block_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/min.html',0,'std::exponential_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_real_distribution/min.html',0,'std::uniform_real_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/geometric_distribution/min.html',0,'std::geometric_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mersenne_twister_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/min.html',0,'std::independent_bits_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/min.html',0,'std::normal_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand::min()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/min.html',0,'std::weibull_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::ranlux48_base::min()'],['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/min.html',0,'std::negative_binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/min.html',0,'std::mt19937::min()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/min.html',0,'std::chi_squared_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/min.html',0,'std::piecewise_linear_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::shuffle_order_engine::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::minutes::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::seconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::duration::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::milliseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::hours::min()'],['http://en.cppreference.com/w/cpp/chrono/time_point/min.html',0,'std::chrono::time_point::min()'],['http://en.cppreference.com/w/cpp/chrono/duration_values/min.html',0,'std::chrono::duration_values::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::microseconds::min()'],['http://en.cppreference.com/w/cpp/chrono/duration/min.html',0,'std::chrono::nanoseconds::min()'],['http://en.cppreference.com/w/cpp/types/numeric_limits/min.html',0,'std::numeric_limits::min()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/min.html',0,'std::uniform_int_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/min.html',0,'std::fisher_f_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/min.html',0,'std::ranlux24::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::linear_congruential_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/min.html',0,'std::knuth_b::min()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/min.html',0,'std::minstd_rand0::min()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/min.html',0,'std::gamma_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/binomial_distribution/min.html',0,'std::binomial_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/min.html',0,'std::cauchy_distribution::min()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/min.html',0,'std::subtract_with_carry_engine::min()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/min.html',0,'std::random_device::min()'],['http://en.cppreference.com/w/cpp/algorithm/min.html',0,'std::min()']]], + ['min_5felement_3147',['min_element',['http://en.cppreference.com/w/cpp/algorithm/min_element.html',0,'std']]], + ['minheap_3148',['MinHeap',['../d2/d05/class_min_heap.html#ad89ca80a217655a735d266618197965e',1,'MinHeap']]], + ['minheapify_3149',['MinHeapify',['../d2/d05/class_min_heap.html#aaef438c1056492cb62c4a4d9035b5cad',1,'MinHeap']]], + ['minmax_3150',['minmax',['http://en.cppreference.com/w/cpp/algorithm/minmax.html',0,'std']]], + ['minmax_5felement_3151',['minmax_element',['http://en.cppreference.com/w/cpp/algorithm/minmax_element.html',0,'std']]], + ['minstd_5frand_3152',['minstd_rand',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand']]], + ['minstd_5frand0_3153',['minstd_rand0',['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/linear_congruential_engine.html',0,'std::minstd_rand0']]], + ['minutes_3154',['minutes',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::minutes']]], + ['minvalue_3155',['minValue',['../d8/dee/avltree_8cpp.html#adb8e952bf1c266bae84111b9d6a12015',1,'avltree.cpp']]], + ['mismatch_3156',['mismatch',['http://en.cppreference.com/w/cpp/algorithm/mismatch.html',0,'std']]], + ['mktime_3157',['mktime',['http://en.cppreference.com/w/cpp/chrono/c/mktime.html',0,'std']]], + ['modf_3158',['modf',['http://en.cppreference.com/w/cpp/numeric/math/modf.html',0,'std']]], + ['money_5fget_3159',['money_get',['http://en.cppreference.com/w/cpp/locale/money_get/money_get.html',0,'std::money_get']]], + ['money_5fput_3160',['money_put',['http://en.cppreference.com/w/cpp/locale/money_put/money_put.html',0,'std::money_put']]], + ['moneypunct_3161',['moneypunct',['http://en.cppreference.com/w/cpp/locale/moneypunct/moneypunct.html',0,'std::moneypunct']]], + ['moneypunct_5fbyname_3162',['moneypunct_byname',['http://en.cppreference.com/w/cpp/locale/moneypunct_byname.html',0,'std::moneypunct_byname']]], + ['mov_3163',['mov',['../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d',1,'tower_of_hanoi.cpp']]], + ['move_3164',['move',['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::fstream::move()'],['http://en.cppreference.com/w/cpp/string/char_traits/move.html',0,'std::char_traits::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ios::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_fstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::strstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_stringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wostringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wiostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_ifstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::istream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ostrstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wfstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::basic_iostream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wofstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wstringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::wistringstream::move()'],['http://en.cppreference.com/w/cpp/io/basic_ios/move.html',0,'std::ifstream::move()'],['http://en.cppreference.com/w/cpp/utility/move.html',0,'std::move()']]], + ['move_5fbackward_3165',['move_backward',['http://en.cppreference.com/w/cpp/algorithm/move_backward.html',0,'std']]], + ['move_5fif_5fnoexcept_3166',['move_if_noexcept',['http://en.cppreference.com/w/cpp/utility/move_if_noexcept.html',0,'std']]], + ['mt19937_3167',['mt19937',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937']]], + ['mt19937_5f64_3168',['mt19937_64',['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/mersenne_twister_engine.html',0,'std::mt19937_64']]], + ['multimap_3169',['multimap',['http://en.cppreference.com/w/cpp/container/multimap/multimap.html',0,'std::multimap']]], + ['multiply_3170',['multiply',['../db/d82/classlarge__number.html#a2f5571e66305cf68bb8283e4aeda58bc',1,'large_number::multiply()'],['../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9',1,'multiply(int x, int res[], int res_size): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#ac62a499b83c7895dd0aa69da1b64c904',1,'multiply(const vector< vector< ll >> &A, const vector< vector< ll >> &B): matrix_exponentiation.cpp']]], + ['multiset_3171',['multiset',['http://en.cppreference.com/w/cpp/container/multiset/multiset.html',0,'std::multiset']]], + ['mutex_3172',['mutex',['http://en.cppreference.com/w/cpp/thread/unique_lock/mutex.html',0,'std::unique_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/mutex.html',0,'std::shared_lock::mutex()'],['http://en.cppreference.com/w/cpp/thread/mutex/mutex.html',0,'std::mutex::mutex()']]] +]; diff --git a/search/functions_e.html b/search/functions_e.html new file mode 100644 index 000000000..705e3de16 --- /dev/null +++ b/search/functions_e.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_e.js b/search/functions_e.js new file mode 100644 index 000000000..f5dbf3fb7 --- /dev/null +++ b/search/functions_e.js @@ -0,0 +1,48 @@ +var searchData= +[ + ['n_3173',['n',['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/n.html',0,'std::student_t_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/n.html',0,'std::chi_squared_distribution::n()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/params.html',0,'std::fisher_f_distribution::n()']]], + ['name_3174',['name',['http://en.cppreference.com/w/cpp/locale/locale/name.html',0,'std::locale::name()'],['http://en.cppreference.com/w/cpp/error/error_category/name.html',0,'std::error_category::name()'],['http://en.cppreference.com/w/cpp/types/type_info/name.html',0,'std::type_info::name()'],['http://en.cppreference.com/w/cpp/types/type_index/name.html',0,'std::type_index::name()']]], + ['nan_3175',['nan',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nanf_3176',['nanf',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nanl_3177',['nanl',['http://en.cppreference.com/w/cpp/numeric/math/nan.html',0,'std']]], + ['nanoseconds_3178',['nanoseconds',['http://en.cppreference.com/w/cpp/chrono/duration/duration.html',0,'std::chrono::nanoseconds']]], + ['narrow_3179',['narrow',['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ofstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype_byname::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ios::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_fstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::strstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_stringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wostringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wiostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_istringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_ifstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istringstream::narrow()'],['http://en.cppreference.com/w/cpp/locale/ctype/narrow.html',0,'std::ctype::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::istream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ostrstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wfstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::basic_iostream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wofstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wstringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::wistringstream::narrow()'],['http://en.cppreference.com/w/cpp/io/basic_ios/narrow.html',0,'std::ifstream::narrow()']]], + ['native_5fhandle_3180',['native_handle',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/native_handle.html',0,'std::condition_variable_any::native_handle()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/native_handle.html',0,'std::condition_variable::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_mutex/native_handle.html',0,'std::recursive_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/recursive_timed_mutex/native_handle.html',0,'std::recursive_timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/thread/native_handle.html',0,'std::thread::native_handle()'],['http://en.cppreference.com/w/cpp/thread/timed_mutex/native_handle.html',0,'std::timed_mutex::native_handle()'],['http://en.cppreference.com/w/cpp/thread/mutex/native_handle.html',0,'std::mutex::native_handle()']]], + ['ncr_3181',['nCr',['../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a',1,'binomial_dist.cpp']]], + ['nearbyint_3182',['nearbyint',['http://en.cppreference.com/w/cpp/numeric/math/nearbyint.html',0,'std']]], + ['neg_5fformat_3183',['neg_format',['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct_byname::neg_format()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/pos_format.html',0,'std::moneypunct::neg_format()']]], + ['negative_5fbinomial_5fdistribution_3184',['negative_binomial_distribution',['http://en.cppreference.com/w/cpp/numeric/random/negative_binomial_distribution/negative_binomial_distribution.html',0,'std::negative_binomial_distribution']]], + ['negative_5fsign_3185',['negative_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::negative_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::negative_sign()']]], + ['nested_5fexception_3186',['nested_exception',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_exception.html',0,'std::nested_exception']]], + ['nested_5fptr_3187',['nested_ptr',['http://en.cppreference.com/w/cpp/error/nested_exception/nested_ptr.html',0,'std::nested_exception']]], + ['new_5fval_3188',['new_val',['../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2',1,'statistics::stats_computer1::new_val()'],['../d8/dab/classstatistics_1_1stats__computer2.html#ade6de704deea24fdc88077b3d9a0d534',1,'statistics::stats_computer2::new_val()']]], + ['next_3189',['next',['http://en.cppreference.com/w/cpp/iterator/next.html',0,'std']]], + ['next_5fpermutation_3190',['next_permutation',['http://en.cppreference.com/w/cpp/algorithm/next_permutation.html',0,'std']]], + ['nextafter_3191',['nextafter',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], + ['nexttoward_3192',['nexttoward',['http://en.cppreference.com/w/cpp/numeric/math/nextafter.html',0,'std']]], + ['noboolalpha_3193',['noboolalpha',['http://en.cppreference.com/w/cpp/io/manip/boolalpha.html',0,'std']]], + ['non_5frecursive_5fmerge_5fsort_3194',['non_recursive_merge_sort',['../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)'],['../d5/d91/namespacesorting.html#a27236b8d3df3832e1f1225576a122534',1,'sorting::non_recursive_merge_sort(const Iterator first, const size_t n)'],['../d5/d91/namespacesorting.html#ae97f4dd815654c4682f564afd718e824',1,'sorting::non_recursive_merge_sort(const Iterator first, const Iterator last)']]], + ['none_3195',['none',['http://en.cppreference.com/w/cpp/utility/bitset/all_any_none.html',0,'std::bitset']]], + ['none_5fof_3196',['none_of',['http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html',0,'std']]], + ['normal_5fdistribution_3197',['normal_distribution',['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/normal_distribution.html',0,'std::normal_distribution']]], + ['noshowbase_3198',['noshowbase',['http://en.cppreference.com/w/cpp/io/manip/showbase.html',0,'std']]], + ['noshowpoint_3199',['noshowpoint',['http://en.cppreference.com/w/cpp/io/manip/showpoint.html',0,'std']]], + ['noshowpos_3200',['noshowpos',['http://en.cppreference.com/w/cpp/io/manip/showpos.html',0,'std']]], + ['noskipws_3201',['noskipws',['http://en.cppreference.com/w/cpp/io/manip/skipws.html',0,'std']]], + ['not1_3202',['not1',['http://en.cppreference.com/w/cpp/utility/functional/not1.html',0,'std']]], + ['not2_3203',['not2',['http://en.cppreference.com/w/cpp/utility/functional/not2.html',0,'std']]], + ['not_5feof_3204',['not_eof',['http://en.cppreference.com/w/cpp/string/char_traits/not_eof.html',0,'std::char_traits']]], + ['notify_5fall_3205',['notify_all',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_all.html',0,'std::condition_variable_any::notify_all()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_all.html',0,'std::condition_variable::notify_all()']]], + ['notify_5fall_5fat_5fthread_5fexit_3206',['notify_all_at_thread_exit',['http://en.cppreference.com/w/cpp/thread/notify_all_at_thread_exit.html',0,'std']]], + ['notify_5fone_3207',['notify_one',['http://en.cppreference.com/w/cpp/thread/condition_variable_any/notify_one.html',0,'std::condition_variable_any::notify_one()'],['http://en.cppreference.com/w/cpp/thread/condition_variable/notify_one.html',0,'std::condition_variable::notify_one()']]], + ['nounitbuf_3208',['nounitbuf',['http://en.cppreference.com/w/cpp/io/manip/unitbuf.html',0,'std']]], + ['nouppercase_3209',['nouppercase',['http://en.cppreference.com/w/cpp/io/manip/uppercase.html',0,'std']]], + ['now_3210',['now',['http://en.cppreference.com/w/cpp/chrono/steady_clock/now.html',0,'std::chrono::steady_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/system_clock/now.html',0,'std::chrono::system_clock::now()'],['http://en.cppreference.com/w/cpp/chrono/high_resolution_clock/now.html',0,'std::chrono::high_resolution_clock::now()']]], + ['nth_5felement_3211',['nth_element',['http://en.cppreference.com/w/cpp/algorithm/nth_element.html',0,'std']]], + ['num_5fdigits_3212',['num_digits',['../db/d82/classlarge__number.html#a2305a82e7b372617419337b2d2119c7d',1,'large_number']]], + ['num_5fget_3213',['num_get',['http://en.cppreference.com/w/cpp/locale/num_get/num_get.html',0,'std::num_get']]], + ['num_5fput_3214',['num_put',['http://en.cppreference.com/w/cpp/locale/num_put/num_put.html',0,'std::num_put']]], + ['number_5fof_5fpositive_5fdivisors_3215',['number_of_positive_divisors',['../d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb',1,'number_of_positive_divisors.cpp']]], + ['numpunct_3216',['numpunct',['http://en.cppreference.com/w/cpp/locale/numpunct/numpunct.html',0,'std::numpunct']]], + ['numpunct_5fbyname_3217',['numpunct_byname',['http://en.cppreference.com/w/cpp/locale/numpunct_byname.html',0,'std::numpunct_byname']]] +]; diff --git a/search/functions_f.html b/search/functions_f.html new file mode 100644 index 000000000..7de862ca3 --- /dev/null +++ b/search/functions_f.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/functions_f.js b/search/functions_f.js new file mode 100644 index 000000000..f84a3c67c --- /dev/null +++ b/search/functions_f.js @@ -0,0 +1,57 @@ +var searchData= +[ + ['oct_3218',['oct',['http://en.cppreference.com/w/cpp/io/manip/hex.html',0,'std']]], + ['ofstream_3219',['ofstream',['http://en.cppreference.com/w/cpp/io/basic_ofstream/basic_ofstream.html',0,'std::ofstream']]], + ['on_5fsegment_3220',['on_segment',['../d4/db4/struct_segment_intersection.html#a008941b2272866c64cdaf959afa939bf',1,'SegmentIntersection']]], + ['once_5fflag_3221',['once_flag',['http://en.cppreference.com/w/cpp/thread/once_flag.html',0,'std::once_flag']]], + ['open_3222',['open',['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::basic_ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::basic_filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::basic_fstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::wfilebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::wifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages_byname::open()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/open.html',0,'std::filebuf::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::ofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::basic_ifstream::open()'],['http://en.cppreference.com/w/cpp/locale/messages/open.html',0,'std::messages::open()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/open.html',0,'std::wfstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/open.html',0,'std::wofstream::open()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/open.html',0,'std::ifstream::open()']]], + ['opening_3223',['opening',['../dc/dc5/paranthesis__matching_8cpp.html#ade525d33459755a32ba21e1b6910ff21',1,'paranthesis_matching.cpp']]], + ['operator_20auto_5fptr_3c_20y_20_3e_3224',['operator auto_ptr< Y >',['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator_auto_ptr.html',0,'std::auto_ptr']]], + ['operator_20bool_3225',['operator bool',['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator_bool.html',0,'std::unique_lock::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ios::operator bool()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator_bool.html',0,'std::shared_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_fstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_fstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator_bool.html',0,'std::unique_ptr::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator_bool.html',0,'std::shared_lock::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_code/operator_bool.html',0,'std::error_code::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::strstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::strstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_stringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_stringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wostringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wostringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::basic_ostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator_bool.html',0,'std::function::operator bool()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator_bool.html',0,'std::error_condition::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wiostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wiostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_ifstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator_bool.html',0,'std::experimental::optional::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::istream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::istream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ostrstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::ostrstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wfstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wfstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::basic_iostream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::basic_iostream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wofstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/sentry.html',0,'std::wofstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wstringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wstringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::wistringstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::wistringstream::sentry::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator_bool.html',0,'std::ifstream::operator bool()'],['http://en.cppreference.com/w/cpp/io/basic_istream/sentry.html',0,'std::ifstream::sentry::operator bool()']]], + ['operator_20string_5ftype_3226',['operator string_type',['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wcsub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::wssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::csub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::ssub_match::operator string_type()'],['http://en.cppreference.com/w/cpp/regex/sub_match/str.html',0,'std::sub_match::operator string_type()']]], + ['operator_20t_3227',['operator T',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_T.html',0,'std::atomic']]], + ['operator_20t_26_3228',['operator T&',['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/get.html',0,'std::reference_wrapper']]], + ['operator_21_3229',['operator!',['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ios::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_fstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::strstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_stringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wostringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wiostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_ifstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::istream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ostrstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wfstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::basic_iostream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wofstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wstringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::wistringstream::operator!()'],['http://en.cppreference.com/w/cpp/io/basic_ios/operator!.html',0,'std::ifstream::operator!()']]], + ['operator_21_3d_3230',['operator!=',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator!=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator!=()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator!=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator!=()']]], + ['operator_25_3d_3231',['operator%=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator%=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator%=()']]], + ['operator_26_3d_3232',['operator&=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator&=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator&=()']]], + ['operator_28_29_3233',['operator()',['http://en.cppreference.com/w/cpp/utility/functional/logical_and.html',0,'std::logical_and::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/modulus.html',0,'std::modulus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/student_t_distribution/operator().html',0,'std::student_t_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937_64::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux24_base::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/extreme_value_distribution/operator().html',0,'std::extreme_value_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/lognormal_distribution/operator().html',0,'std::lognormal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater_equal.html',0,'std::greater_equal::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discrete_distribution/operator().html',0,'std::discrete_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux48::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_constant_distribution/operator().html',0,'std::piecewise_constant_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less_equal.html',0,'std::less_equal::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_or.html',0,'std::logical_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/binary_negate.html',0,'std::binary_negate::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::discard_block_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/exponential_distribution/operator().html',0,'std::exponential_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mersenne_twister_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/negate.html',0,'std::negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/not_equal_to.html',0,'std::not_equal_to::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/independent_bits_engine/operator().html',0,'std::independent_bits_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/normal_distribution/operator().html',0,'std::normal_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand::operator()()'],['http://en.cppreference.com/w/cpp/locale/locale/operator().html',0,'std::locale::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/equal_to.html',0,'std::equal_to::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/divides.html',0,'std::divides::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/weibull_distribution/operator().html',0,'std::weibull_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/less.html',0,'std::less::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/multiplies.html',0,'std::multiplies::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator().html',0,'std::reference_wrapper::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::ranlux48_base::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_not.html',0,'std::bit_not::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine/operator().html',0,'std::mt19937::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/chi_squared_distribution/operator().html',0,'std::chi_squared_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/piecewise_linear_distribution/operator().html',0,'std::piecewise_linear_distribution::operator()()'],['http://en.cppreference.com/w/cpp/utility/hash/operator().html',0,'std::hash::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::shuffle_order_engine::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/greater.html',0,'std::greater::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_and.html',0,'std::bit_and::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution/operator().html',0,'std::uniform_int_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/fisher_f_distribution/operator().html',0,'std::fisher_f_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/discard_block_engine/operator().html',0,'std::ranlux24::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/plus.html',0,'std::plus::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/bit_or.html',0,'std::bit_or::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/unary_negate.html',0,'std::unary_negate::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator().html',0,'std::function::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/minus.html',0,'std::minus::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::linear_congruential_engine::operator()()'],['http://en.cppreference.com/w/cpp/memory/owner_less.html',0,'std::owner_less::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/shuffle_order_engine/operator().html',0,'std::knuth_b::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/linear_congruential_engine/operator().html',0,'std::minstd_rand0::operator()()'],['http://en.cppreference.com/w/cpp/utility/functional/logical_not.html',0,'std::logical_not::operator()()'],['http://en.cppreference.com/w/cpp/memory/default_delete.html',0,'std::default_delete::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/gamma_distribution/operator().html',0,'std::gamma_distribution::operator()()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator().html',0,'std::packaged_task::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/cauchy_distribution/operator().html',0,'std::cauchy_distribution::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/subtract_with_carry_engine/operator().html',0,'std::subtract_with_carry_engine::operator()()'],['http://en.cppreference.com/w/cpp/numeric/random/random_device/operator().html',0,'std::random_device::operator()()']]], + ['operator_2a_3234',['operator*',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator*()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator*()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator*()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator*.html',0,'std::raw_storage_iterator::operator*()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ab6171f4db68a5e50ae0f3500a63acd26',1,'operator*(std::vector< std::vector< T >> const &A, std::vector< std::vector< T >> const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a64d9dd5c5816d6d907b00e5f4b0372a5',1,'operator*(std::vector< std::vector< T >> const &A, std::vector< T > const &B): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a9b2b5da35a6ba8ae203c33739ef0b91d',1,'operator*(float const scalar, std::vector< T > const &A): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aecef32c2a4f39a3f7398949256d180a6',1,'operator*(std::vector< T > const &A, float const scalar): ordinary_least_squares_regressor.cpp']]], + ['operator_2a_3d_3235',['operator*=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator*=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator*=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator*=()'],['../db/d82/classlarge__number.html#ab1af3e0f425cdf7ea2039c9dcfe22f0b',1,'large_number::operator*=()']]], + ['operator_2b_3236',['operator+',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator+()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator+()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator+()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0',1,'operator+(): ordinary_least_squares_regressor.cpp']]], + ['operator_2b_2b_3237',['operator++',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator_arith.html',0,'std::raw_storage_iterator::operator++()'],['../db/d82/classlarge__number.html#a622d84883180ff42f04955909adea5a9',1,'large_number::operator++()'],['../db/d82/classlarge__number.html#ac4fafa6289295419d48d444f0ae4b706',1,'large_number::operator++(int)']]], + ['operator_2b_2b_28int_29_3238',['operator++(int)',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::regex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::sregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wcregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::cregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wsregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator++(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::cregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_arith.html',0,'std::wsregex_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::wcregex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::regex_token_iterator::operator++(int)()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_arith.html',0,'std::sregex_token_iterator::operator++(int)()']]], + ['operator_2b_3d_3239',['operator+=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator+=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator+=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator+=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator+=()'],['../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e',1,'large_number::operator+=()']]], + ['operator_2d_3240',['operator-',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::minutes::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::seconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::duration::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::milliseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::hours::operator-()'],['http://en.cppreference.com/w/cpp/chrono/time_point/operator_arith.html',0,'std::chrono::time_point::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::microseconds::operator-()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith.html',0,'std::chrono::nanoseconds::operator-()'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a31be3fe36e76b87d5616ff8e7918cd24',1,'operator-(): ordinary_least_squares_regressor.cpp']]], + ['operator_2d_2d_3241',['operator--',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--()']]], + ['operator_2d_2d_28int_29_3242',['operator--(int)',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::minutes::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::seconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::duration::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::milliseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::hours::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::microseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith2.html',0,'std::chrono::nanoseconds::operator--(int)()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith.html',0,'std::atomic::operator--(int)()']]], + ['operator_2d_3d_3243',['operator-=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator-=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator-=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator-=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator-=()']]], + ['operator_2d_3e_3244',['operator->',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::regex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::sregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator*.html',0,'std::shared_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wcregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::cregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator*.html',0,'std::unique_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wsregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::cregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator*.html',0,'std::wsregex_iterator::operator->()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator*.html',0,'std::experimental::optional::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::wcregex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::regex_token_iterator::operator->()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator*.html',0,'std::auto_ptr::operator->()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator*.html',0,'std::sregex_token_iterator::operator->()']]], + ['operator_2f_3245',['operator/',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a30acf52af3184bc22274234ef5a73536',1,'ordinary_least_squares_regressor.cpp']]], + ['operator_2f_3d_3246',['operator/=',['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::minutes::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::seconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::duration::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::milliseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::hours::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::microseconds::operator/=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator_arith3.html',0,'std::chrono::nanoseconds::operator/=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator_arith.html',0,'std::complex::operator/=()']]], + ['operator_3c_3247',['operator<',['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<()']]], + ['operator_3c_3c_3248',['operator<<',['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_fstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::strstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_stringstream::operator<<()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator<<()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_ltlt.html',0,'std::thread::id::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wostringstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_ostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wiostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::ostrstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wfstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::basic_iostream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wofstream::operator<<()'],['http://en.cppreference.com/w/cpp/io/basic_ostream/operator_ltlt.html',0,'std::wstringstream::operator<<()'],['../dd/d65/lu__decompose_8cpp.html#a98eb5807f21b783c341cab402ced6732',1,'operator<<(std::ostream &out, std::vector< std::vector< T >> const &v): lu_decompose.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98eb5807f21b783c341cab402ced6732',1,'operator<<(std::ostream &out, std::vector< std::vector< T >> const &v): ordinary_least_squares_regressor.cpp'],['../dc/d38/ordinary__least__squares__regressor_8cpp.html#aa799b4cec1681219887d89d037cfab50',1,'operator<<(std::ostream &out, std::vector< T > const &v): ordinary_least_squares_regressor.cpp'],['../d2/d3b/namespaceqr__algorithm.html#a7c63c78d6839b8ad73b77c161210b514',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< std::valarray< T >> const &v)'],['../d2/d3b/namespaceqr__algorithm.html#a240edf2b6b5942c0e5f2c9d3e326797f',1,'qr_algorithm::operator<<(std::ostream &out, std::valarray< T > const &v)']]], + ['operator_3c_3c_3d_3249',['operator<<=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset']]], + ['operator_3c_3d_3250',['operator<=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator<=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator<=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator<=()']]], + ['operator_3d_3251',['operator=',['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::basic_ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::fstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::regex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/container/vector/operator=.html',0,'std::vector::operator=()'],['http://en.cppreference.com/w/cpp/container/multiset/operator=.html',0,'std::multiset::operator=()'],['http://en.cppreference.com/w/cpp/memory/weak_ptr/operator=.html',0,'std::weak_ptr::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::string::operator=()'],['http://en.cppreference.com/w/cpp/container/set/operator=.html',0,'std::set::operator=()'],['http://en.cppreference.com/w/cpp/thread/unique_lock/operator=.html',0,'std::unique_lock::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::basic_ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::regex::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator=.html',0,'std::unordered_map::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::basic_regex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::basic_filebuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::wstringbuf::operator=()'],['http://en.cppreference.com/w/cpp/utility/tuple/operator=.html',0,'std::tuple::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::sregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/operator=.html',0,'std::shared_ptr::operator=()'],['http://en.cppreference.com/w/cpp/memory/new/bad_alloc.html',0,'std::bad_alloc::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::ostringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::basic_fstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wcregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/basic_regex/operator=.html',0,'std::wregex::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::cregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::wfilebuf::operator=()'],['http://en.cppreference.com/w/cpp/container/stack/operator=.html',0,'std::stack::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_future/operator=.html',0,'std::shared_future::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::wstreambuf::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::stringstream::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multimap/operator=.html',0,'std::unordered_multimap::operator=()'],['http://en.cppreference.com/w/cpp/memory/unique_ptr/operator=.html',0,'std::unique_ptr::operator=()'],['http://en.cppreference.com/w/cpp/container/forward_list/operator=.html',0,'std::forward_list::operator=()'],['http://en.cppreference.com/w/cpp/locale/locale/operator=.html',0,'std::locale::operator=()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/operator=.html',0,'std::shared_lock::operator=()'],['http://en.cppreference.com/w/cpp/memory/enable_shared_from_this/operator=.html',0,'std::enable_shared_from_this::operator=()'],['http://en.cppreference.com/w/cpp/thread/future/operator=.html',0,'std::future::operator=()'],['http://en.cppreference.com/w/cpp/utility/pair/operator=.html',0,'std::pair::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wsregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/error/error_code/operator=.html',0,'std::error_code::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::wifstream::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/reference_wrapper/operator=.html',0,'std::reference_wrapper::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::minutes::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::seconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::duration::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::milliseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::hours::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::microseconds::operator=()'],['http://en.cppreference.com/w/cpp/chrono/duration/operator=.html',0,'std::chrono::nanoseconds::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringbuf/operator=.html',0,'std::basic_stringbuf::operator=()'],['http://en.cppreference.com/w/cpp/container/deque/operator=.html',0,'std::deque::operator=()'],['http://en.cppreference.com/w/cpp/thread/promise/operator=.html',0,'std::promise::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::basic_streambuf::operator=()'],['http://en.cppreference.com/w/cpp/container/queue/operator=.html',0,'std::queue::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic/operator=.html',0,'std::atomic::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::basic_stringstream::operator=()'],['http://en.cppreference.com/w/cpp/thread/thread/operator=.html',0,'std::thread::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::basic_string::operator=()'],['http://en.cppreference.com/w/cpp/container/priority_queue/operator=.html',0,'std::priority_queue::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ostringstream/operator=.html',0,'std::wostringstream::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::cregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::wstring::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_multiset/operator=.html',0,'std::unordered_multiset::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator=.html',0,'std::wsregex_iterator::operator=()'],['http://en.cppreference.com/w/cpp/utility/functional/function/operator=.html',0,'std::function::operator=()'],['http://en.cppreference.com/w/cpp/error/error_condition/operator=.html',0,'std::error_condition::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_filebuf/operator=.html',0,'std::filebuf::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u16string::operator=()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator=.html',0,'std::u32string::operator=()'],['http://en.cppreference.com/w/cpp/numeric/complex/operator=.html',0,'std::complex::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::ofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::basic_istringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::basic_ifstream::operator=()'],['http://en.cppreference.com/w/cpp/container/list/operator=.html',0,'std::list::operator=()'],['http://en.cppreference.com/w/cpp/container/map/operator=.html',0,'std::map::operator=()'],['http://en.cppreference.com/w/cpp/error/exception/operator=.html',0,'std::exception::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/operator=.html',0,'std::streambuf::operator=()'],['http://en.cppreference.com/w/cpp/experimental/optional/operator=.html',0,'std::experimental::optional::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::wcregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::regex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::istringstream::operator=()'],['http://en.cppreference.com/w/cpp/error/nested_exception/operator=.html',0,'std::nested_exception::operator=()'],['http://en.cppreference.com/w/cpp/memory/auto_ptr/operator=.html',0,'std::auto_ptr::operator=()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator=.html',0,'std::sregex_token_iterator::operator=()'],['http://en.cppreference.com/w/cpp/thread/packaged_task/operator=.html',0,'std::packaged_task::operator=()'],['http://en.cppreference.com/w/cpp/container/unordered_set/operator=.html',0,'std::unordered_set::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_fstream/operator=.html',0,'std::wfstream::operator=()'],['http://en.cppreference.com/w/cpp/container/multimap/operator=.html',0,'std::multimap::operator=()'],['http://en.cppreference.com/w/cpp/atomic/atomic_flag/operator=.html',0,'std::atomic_flag::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ofstream/operator=.html',0,'std::wofstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_stringstream/operator=.html',0,'std::wstringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_istringstream/operator=.html',0,'std::wistringstream::operator=()'],['http://en.cppreference.com/w/cpp/io/basic_ifstream/operator=.html',0,'std::ifstream::operator=()'],['http://en.cppreference.com/w/cpp/memory/raw_storage_iterator/operator=.html',0,'std::raw_storage_iterator::operator=()'],['../d1/dc2/classstack.html#a61370d5fbaf9ec6bca4a8c114c1058e1',1,'stack::operator=()'],['../db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb',1,'large_number::operator=()']]], + ['operator_3d_3d_3252',['operator==',['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::regex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::sregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wcregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::cregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/locale/locale/operator_cmp.html',0,'std::locale::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wsregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/error/error_category/operator_cmp.html',0,'std::error_category::operator==()'],['http://en.cppreference.com/w/cpp/types/type_info/operator_cmp.html',0,'std::type_info::operator==()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_cmp.html',0,'std::bitset::operator==()'],['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::cregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_iterator/operator_cmp.html',0,'std::wsregex_iterator::operator==()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::wcregex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::regex_token_iterator::operator==()'],['http://en.cppreference.com/w/cpp/regex/regex_token_iterator/operator_cmp.html',0,'std::sregex_token_iterator::operator==()']]], + ['operator_3e_3253',['operator>',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>()']]], + ['operator_3e_3d_3254',['operator>=',['http://en.cppreference.com/w/cpp/thread/thread/id/operator_cmp.html',0,'std::thread::id::operator>=()'],['http://en.cppreference.com/w/cpp/types/type_index/operator_cmp.html',0,'std::type_index::operator>=()'],['http://en.cppreference.com/w/cpp/utility/rel_ops/operator_cmp.html',0,'std::rel_ops::operator>=()']]], + ['operator_3e_3e_3255',['operator>>',['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_fstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::strstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_stringstream::operator>>()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istrstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wiostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_ifstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::istream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wfstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::basic_iostream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wstringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::wistringstream::operator>>()'],['http://en.cppreference.com/w/cpp/io/basic_istream/operator_gtgt.html',0,'std::ifstream::operator>>()']]], + ['operator_3e_3e_3d_3256',['operator>>=',['http://en.cppreference.com/w/cpp/utility/bitset/operator_ltltgtgt.html',0,'std::bitset']]], + ['operator_5b_5d_3257',['operator[]',['http://en.cppreference.com/w/cpp/container/dynarray/operator_at.html',0,'std::dynarray::operator[]()'],['http://en.cppreference.com/w/cpp/container/vector/operator_at.html',0,'std::vector::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::match_results::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::string::operator[]()'],['http://en.cppreference.com/w/cpp/container/unordered_map/operator_at.html',0,'std::unordered_map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wsmatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::smatch::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::wcmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/deque/operator_at.html',0,'std::deque::operator[]()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_at.html',0,'std::bitset::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::basic_string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::wstring::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u16string::operator[]()'],['http://en.cppreference.com/w/cpp/string/basic_string/operator_at.html',0,'std::u32string::operator[]()'],['http://en.cppreference.com/w/cpp/container/map/operator_at.html',0,'std::map::operator[]()'],['http://en.cppreference.com/w/cpp/regex/match_results/operator_at.html',0,'std::cmatch::operator[]()'],['http://en.cppreference.com/w/cpp/container/array/operator_at.html',0,'std::array::operator[]()'],['../db/d82/classlarge__number.html#ace19126cf343a09efc0010735f6e3a8d',1,'large_number::operator[]()']]], + ['operator_5e_3d_3258',['operator^=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator^=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator^=()']]], + ['operator_7c_3d_3259',['operator|=',['http://en.cppreference.com/w/cpp/atomic/atomic/operator_arith2.html',0,'std::atomic::operator|=()'],['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset::operator|=()']]], + ['operator_7e_3260',['operator~',['http://en.cppreference.com/w/cpp/utility/bitset/operator_logic.html',0,'std::bitset']]], + ['optional_3261',['optional',['http://en.cppreference.com/w/cpp/experimental/optional/optional.html',0,'std::experimental::optional']]], + ['ostream_3262',['ostream',['http://en.cppreference.com/w/cpp/io/basic_ostream/basic_ostream.html',0,'std::ostream']]], + ['ostringstream_3263',['ostringstream',['http://en.cppreference.com/w/cpp/io/basic_ostringstream/basic_ostringstream.html',0,'std::ostringstream']]], + ['ostrstream_3264',['ostrstream',['http://en.cppreference.com/w/cpp/io/ostrstream/ostrstream.html',0,'std::ostrstream']]], + ['out_3265',['out',['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_byname::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf8_utf16::out()'],['http://en.cppreference.com/w/cpp/locale/codecvt/out.html',0,'std::codecvt_utf16::out()']]], + ['out_5fof_5frange_3266',['out_of_range',['http://en.cppreference.com/w/cpp/error/out_of_range.html',0,'std::out_of_range']]], + ['outer_5fallocator_3267',['outer_allocator',['http://en.cppreference.com/w/cpp/memory/scoped_allocator_adaptor/outer_allocator.html',0,'std::scoped_allocator_adaptor']]], + ['overflow_3268',['overflow',['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wfilebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::wstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::strstreambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_stringbuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::basic_streambuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::filebuf::overflow()'],['http://en.cppreference.com/w/cpp/io/basic_streambuf/overflow.html',0,'std::streambuf::overflow()']]], + ['overflow_5ferror_3269',['overflow_error',['http://en.cppreference.com/w/cpp/error/overflow_error.html',0,'std::overflow_error']]], + ['owner_5fbefore_3270',['owner_before',['http://en.cppreference.com/w/cpp/memory/weak_ptr/owner_before.html',0,'std::weak_ptr::owner_before()'],['http://en.cppreference.com/w/cpp/memory/shared_ptr/owner_before.html',0,'std::shared_ptr::owner_before()']]], + ['owns_5flock_3271',['owns_lock',['http://en.cppreference.com/w/cpp/thread/unique_lock/owns_lock.html',0,'std::unique_lock::owns_lock()'],['http://en.cppreference.com/w/cpp/thread/shared_lock/owns_lock.html',0,'std::shared_lock::owns_lock()']]] +]; diff --git a/search/groups_0.html b/search/groups_0.html new file mode 100644 index 000000000..5d72bbb0a --- /dev/null +++ b/search/groups_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/groups_0.js b/search/groups_0.js new file mode 100644 index 000000000..6e074058c --- /dev/null +++ b/search/groups_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['machine_20learning_20algorithms_3935',['Machine Learning Algorithms',['../d9/d66/group__machine__learning.html',1,'']]] +]; diff --git a/search/groups_1.html b/search/groups_1.html new file mode 100644 index 000000000..290949351 --- /dev/null +++ b/search/groups_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/groups_1.js b/search/groups_1.js new file mode 100644 index 000000000..b9a8d9956 --- /dev/null +++ b/search/groups_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['ordinary_20differential_20equations_3936',['Ordinary Differential Equations',['../d6/d60/group__ode.html',1,'']]] +]; diff --git a/search/mag_sel.png b/search/mag_sel.png new file mode 100644 index 0000000000000000000000000000000000000000..39c0ed52a25dd9d080ee0d42ae6c6042bdfa04d7 GIT binary patch literal 465 zcmeAS@N?(olHy`uVBq!ia0vp^B0wz6!2%?$TA$hhDVB6cUq=Rpjs4tz5?O(Kg=CK) zUj~NU84L`?eGCi_EEpJ?t}-xGu`@87+QPtK?83kxQ`TapwHK(CDaqU2h2ejD|C#+j z9%q3^WHAE+w=f7ZGR&GI0Tg5}@$_|Nf5gMiEhFgvHvB$N=!mC_V~EE2vzPXI9ZnEo zd+1zHor@dYLod2Y{ z@R$7$Z!PXTbY$|@#T!bMzm?`b<(R`cbw(gxJHzu zB$lLFB^RXvDF!10LknF)BV7aY5JN*NBMU1-b8Q0yD+2>vd*|CI8glbfGSez?Ylunu RoetE%;OXk;vd$@?2>>CYplSdB literal 0 HcmV?d00001 diff --git a/search/namespaces_0.html b/search/namespaces_0.html new file mode 100644 index 000000000..f0de5a9b8 --- /dev/null +++ b/search/namespaces_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/namespaces_0.js b/search/namespaces_0.js new file mode 100644 index 000000000..3b805dea6 --- /dev/null +++ b/search/namespaces_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['machine_5flearning_2378',['machine_learning',['../d8/d77/namespacemachine__learning.html',1,'']]] +]; diff --git a/search/namespaces_1.html b/search/namespaces_1.html new file mode 100644 index 000000000..1a95a8ef6 --- /dev/null +++ b/search/namespaces_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/namespaces_1.js b/search/namespaces_1.js new file mode 100644 index 000000000..dfef027e4 --- /dev/null +++ b/search/namespaces_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['qr_5falgorithm_2379',['qr_algorithm',['../d2/d3b/namespaceqr__algorithm.html',1,'']]] +]; diff --git a/search/namespaces_2.html b/search/namespaces_2.html new file mode 100644 index 000000000..8d7d0cee4 --- /dev/null +++ b/search/namespaces_2.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/namespaces_2.js b/search/namespaces_2.js new file mode 100644 index 000000000..dcaeeb177 --- /dev/null +++ b/search/namespaces_2.js @@ -0,0 +1,12 @@ +var searchData= +[ + ['chrono_2380',['chrono',['http://en.cppreference.com/w/d4/d0c/namespacestd_1_1chrono.html',0,'std']]], + ['experimental_2381',['experimental',['http://en.cppreference.com/w/de/d97/namespacestd_1_1experimental.html',0,'std']]], + ['regex_5fconstants_2382',['regex_constants',['http://en.cppreference.com/w/db/da4/namespacestd_1_1regex__constants.html',0,'std']]], + ['rel_5fops_2383',['rel_ops',['http://en.cppreference.com/w/da/d42/namespacestd_1_1rel__ops.html',0,'std']]], + ['sorting_2384',['sorting',['../d5/d91/namespacesorting.html',1,'']]], + ['statistics_2385',['statistics',['../d2/dcf/namespacestatistics.html',1,'']]], + ['std_2386',['std',['../d8/dcc/namespacestd.html',1,'']]], + ['string_5fsearch_2387',['string_search',['../d9/d03/namespacestring__search.html',1,'']]], + ['this_5fthread_2388',['this_thread',['http://en.cppreference.com/w/d7/dbf/namespacestd_1_1this__thread.html',0,'std']]] +]; diff --git a/search/nomatches.html b/search/nomatches.html new file mode 100644 index 000000000..437732089 --- /dev/null +++ b/search/nomatches.html @@ -0,0 +1,12 @@ + + + + + + + +
    +
    No Matches
    +
    + + diff --git a/search/pages_0.html b/search/pages_0.html new file mode 100644 index 000000000..ca7755f40 --- /dev/null +++ b/search/pages_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/pages_0.js b/search/pages_0.js new file mode 100644 index 000000000..a401d3060 --- /dev/null +++ b/search/pages_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['contribution_20guidelines_3937',['CONTRIBUTION GUIDELINES',['../d6/dcd/md__c_o_n_t_r_i_b_u_t_i_n_g.html',1,'']]] +]; diff --git a/search/pages_1.html b/search/pages_1.html new file mode 100644 index 000000000..4e469b4ad --- /dev/null +++ b/search/pages_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/pages_1.js b/search/pages_1.js new file mode 100644 index 000000000..22ae15391 --- /dev/null +++ b/search/pages_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['list_20of_20all_20files_3938',['List of all files',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html',1,'']]] +]; diff --git a/search/pages_2.html b/search/pages_2.html new file mode 100644 index 000000000..702915305 --- /dev/null +++ b/search/pages_2.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/pages_2.js b/search/pages_2.js new file mode 100644 index 000000000..b9290b09e --- /dev/null +++ b/search/pages_2.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['prime_20factorization_3939',['Prime factorization',['../d7/d7f/section.html',1,'']]] +]; diff --git a/search/pages_3.html b/search/pages_3.html new file mode 100644 index 000000000..fce1ba40c --- /dev/null +++ b/search/pages_3.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/pages_3.js b/search/pages_3.js new file mode 100644 index 000000000..03f109400 --- /dev/null +++ b/search/pages_3.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['the_20algorithms_20_2d_20c_2b_2b_3940',['The Algorithms - C++',['../index.html',1,'']]], + ['todo_20list_3941',['Todo List',['../dd/da0/todo.html',1,'']]] +]; diff --git a/search/related_0.html b/search/related_0.html new file mode 100644 index 000000000..1b314088e --- /dev/null +++ b/search/related_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/related_0.js b/search/related_0.js new file mode 100644 index 000000000..c78c6d934 --- /dev/null +++ b/search/related_0.js @@ -0,0 +1,8 @@ +var searchData= +[ + ['operator_21_3d_3917',['operator!=',['../db/d82/classlarge__number.html#a72ae1ef050c4c28c50952ecab22d4b94',1,'large_number']]], + ['operator_2b_3918',['operator+',['../db/d82/classlarge__number.html#a70d23d67535e67030db570e56c00e16d',1,'large_number']]], + ['operator_3c_3c_3919',['operator<<',['../d6/d30/classmachine__learning_1_1adaline.html#a1d821a24e1503d468c95d4acedca58b3',1,'machine_learning::adaline::operator<<()'],['../db/d82/classlarge__number.html#a778428c4761b6ea5e7770743f0eab5ab',1,'large_number::operator<<()']]], + ['operator_3d_3d_3920',['operator==',['../db/d82/classlarge__number.html#a7ba872b9a3ce1f3da6c06c5409663cca',1,'large_number']]], + ['operator_3e_3e_3921',['operator>>',['../d7/d7c/classstatistics_1_1stats__computer1.html#ab5b4bfecdf391cae7edb1fe98548b846',1,'statistics::stats_computer1::operator>>()'],['../d8/dab/classstatistics_1_1stats__computer2.html#a7e7a1a2b0a03df0a70cac40d193421d2',1,'statistics::stats_computer2::operator>>()']]] +]; diff --git a/search/search.css b/search/search.css new file mode 100644 index 000000000..3cf9df94a --- /dev/null +++ b/search/search.css @@ -0,0 +1,271 @@ +/*---------------- Search Box */ + +#FSearchBox { + float: left; +} + +#MSearchBox { + white-space : nowrap; + float: none; + margin-top: 8px; + right: 0px; + width: 170px; + height: 24px; + z-index: 102; +} + +#MSearchBox .left +{ + display:block; + position:absolute; + left:10px; + width:20px; + height:19px; + background:url('search_l.png') no-repeat; + background-position:right; +} + +#MSearchSelect { + display:block; + position:absolute; + width:20px; + height:19px; +} + +.left #MSearchSelect { + left:4px; +} + +.right #MSearchSelect { + right:5px; +} + +#MSearchField { + display:block; + position:absolute; + height:19px; + background:url('search_m.png') repeat-x; + border:none; + width:115px; + margin-left:20px; + padding-left:4px; + color: #909090; + outline: none; + font: 9pt Arial, Verdana, sans-serif; + -webkit-border-radius: 0px; +} + +#FSearchBox #MSearchField { + margin-left:15px; +} + +#MSearchBox .right { + display:block; + position:absolute; + right:10px; + top:8px; + width:20px; + height:19px; + background:url('search_r.png') no-repeat; + background-position:left; +} + +#MSearchClose { + display: none; + position: absolute; + top: 4px; + background : none; + border: none; + margin: 0px 4px 0px 0px; + padding: 0px 0px; + outline: none; +} + +.left #MSearchClose { + left: 6px; +} + +.right #MSearchClose { + right: 2px; +} + +.MSearchBoxActive #MSearchField { + color: #000000; +} + +/*---------------- Search filter selection */ + +#MSearchSelectWindow { + display: none; + position: absolute; + left: 0; top: 0; + border: 1px solid #90A5CE; + background-color: #F9FAFC; + z-index: 10001; + padding-top: 4px; + padding-bottom: 4px; + -moz-border-radius: 4px; + -webkit-border-top-left-radius: 4px; + -webkit-border-top-right-radius: 4px; + -webkit-border-bottom-left-radius: 4px; + -webkit-border-bottom-right-radius: 4px; + -webkit-box-shadow: 5px 5px 5px rgba(0, 0, 0, 0.15); +} + +.SelectItem { + font: 8pt Arial, Verdana, sans-serif; + padding-left: 2px; + padding-right: 12px; + border: 0px; +} + +span.SelectionMark { + margin-right: 4px; + font-family: monospace; + outline-style: none; + text-decoration: none; +} + +a.SelectItem { + display: block; + outline-style: none; + color: #000000; + text-decoration: none; + padding-left: 6px; + padding-right: 12px; +} + +a.SelectItem:focus, +a.SelectItem:active { + color: #000000; + outline-style: none; + text-decoration: none; +} + +a.SelectItem:hover { + color: #FFFFFF; + background-color: #3D578C; + outline-style: none; + text-decoration: none; + cursor: pointer; + display: block; +} + +/*---------------- Search results window */ + +iframe#MSearchResults { + width: 60ex; + height: 15em; +} + +#MSearchResultsWindow { + display: none; + position: absolute; + left: 0; top: 0; + border: 1px solid #000; + background-color: #EEF1F7; + z-index:10000; +} + +/* ----------------------------------- */ + + +#SRIndex { + clear:both; + padding-bottom: 15px; +} + +.SREntry { + font-size: 10pt; + padding-left: 1ex; +} + +.SRPage .SREntry { + font-size: 8pt; + padding: 1px 5px; +} + +body.SRPage { + margin: 5px 2px; +} + +.SRChildren { + padding-left: 3ex; padding-bottom: .5em +} + +.SRPage .SRChildren { + display: none; +} + +.SRSymbol { + font-weight: bold; + color: #425E97; + font-family: Arial, Verdana, sans-serif; + text-decoration: none; + outline: none; +} + +a.SRScope { + display: block; + color: #425E97; + font-family: Arial, Verdana, sans-serif; + text-decoration: none; + outline: none; +} + +a.SRSymbol:focus, a.SRSymbol:active, +a.SRScope:focus, a.SRScope:active { + text-decoration: underline; +} + +span.SRScope { + padding-left: 4px; +} + +.SRPage .SRStatus { + padding: 2px 5px; + font-size: 8pt; + font-style: italic; +} + +.SRResult { + display: none; +} + +DIV.searchresults { + margin-left: 10px; + margin-right: 10px; +} + +/*---------------- External search page results */ + +.searchresult { + background-color: #F0F3F8; +} + +.pages b { + color: white; + padding: 5px 5px 3px 5px; + background-image: url("../tab_a.png"); + background-repeat: repeat-x; + text-shadow: 0 1px 1px #000000; +} + +.pages { + line-height: 17px; + margin-left: 4px; + text-decoration: none; +} + +.hl { + font-weight: bold; +} + +#searchresults { + margin-bottom: 20px; +} + +.searchpages { + margin-top: 10px; +} + diff --git a/search/search.js b/search/search.js new file mode 100644 index 000000000..ff2b8c81b --- /dev/null +++ b/search/search.js @@ -0,0 +1,814 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + + The MIT License (MIT) + + Copyright (C) 1997-2020 by Dimitri van Heesch + + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: + + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. + + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file + */ +function convertToId(search) +{ + var result = ''; + for (i=0;i do a search + { + this.Search(); + } + } + + this.OnSearchSelectKey = function(evt) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==40 && this.searchIndex0) // Up + { + this.searchIndex--; + this.OnSelectItem(this.searchIndex); + } + else if (e.keyCode==13 || e.keyCode==27) + { + this.OnSelectItem(this.searchIndex); + this.CloseSelectionWindow(); + this.DOMSearchField().focus(); + } + return false; + } + + // --------- Actions + + // Closes the results window. + this.CloseResultsWindow = function() + { + this.DOMPopupSearchResultsWindow().style.display = 'none'; + this.DOMSearchClose().style.display = 'none'; + this.Activate(false); + } + + this.CloseSelectionWindow = function() + { + this.DOMSearchSelectWindow().style.display = 'none'; + } + + // Performs a search. + this.Search = function() + { + this.keyTimeout = 0; + + // strip leading whitespace + var searchValue = this.DOMSearchField().value.replace(/^ +/, ""); + + var code = searchValue.toLowerCase().charCodeAt(0); + var idxChar = searchValue.substr(0, 1).toLowerCase(); + if ( 0xD800 <= code && code <= 0xDBFF && searchValue > 1) // surrogate pair + { + idxChar = searchValue.substr(0, 2); + } + + var resultsPage; + var resultsPageWithSearch; + var hasResultsPage; + + var idx = indexSectionsWithContent[this.searchIndex].indexOf(idxChar); + if (idx!=-1) + { + var hexCode=idx.toString(16); + resultsPage = this.resultsPath + '/' + indexSectionNames[this.searchIndex] + '_' + hexCode + '.html'; + resultsPageWithSearch = resultsPage+'?'+escape(searchValue); + hasResultsPage = true; + } + else // nothing available for this search term + { + resultsPage = this.resultsPath + '/nomatches.html'; + resultsPageWithSearch = resultsPage; + hasResultsPage = false; + } + + window.frames.MSearchResults.location = resultsPageWithSearch; + var domPopupSearchResultsWindow = this.DOMPopupSearchResultsWindow(); + + if (domPopupSearchResultsWindow.style.display!='block') + { + var domSearchBox = this.DOMSearchBox(); + this.DOMSearchClose().style.display = 'inline'; + if (this.insideFrame) + { + var domPopupSearchResults = this.DOMPopupSearchResults(); + domPopupSearchResultsWindow.style.position = 'relative'; + domPopupSearchResultsWindow.style.display = 'block'; + var width = document.body.clientWidth - 8; // the -8 is for IE :-( + domPopupSearchResultsWindow.style.width = width + 'px'; + domPopupSearchResults.style.width = width + 'px'; + } + else + { + var domPopupSearchResults = this.DOMPopupSearchResults(); + var left = getXPos(domSearchBox) + 150; // domSearchBox.offsetWidth; + var top = getYPos(domSearchBox) + 20; // domSearchBox.offsetHeight + 1; + domPopupSearchResultsWindow.style.display = 'block'; + left -= domPopupSearchResults.offsetWidth; + domPopupSearchResultsWindow.style.top = top + 'px'; + domPopupSearchResultsWindow.style.left = left + 'px'; + } + } + + this.lastSearchValue = searchValue; + this.lastResultsPage = resultsPage; + } + + // -------- Activation Functions + + // Activates or deactivates the search panel, resetting things to + // their default values if necessary. + this.Activate = function(isActive) + { + if (isActive || // open it + this.DOMPopupSearchResultsWindow().style.display == 'block' + ) + { + this.DOMSearchBox().className = 'MSearchBoxActive'; + + var searchField = this.DOMSearchField(); + + if (searchField.value == this.searchLabel) // clear "Search" term upon entry + { + searchField.value = ''; + this.searchActive = true; + } + } + else if (!isActive) // directly remove the panel + { + this.DOMSearchBox().className = 'MSearchBoxInactive'; + this.DOMSearchField().value = this.searchLabel; + this.searchActive = false; + this.lastSearchValue = '' + this.lastResultsPage = ''; + } + } +} + +// ----------------------------------------------------------------------- + +// The class that handles everything on the search results page. +function SearchResults(name) +{ + // The number of matches from the last run of . + this.lastMatchCount = 0; + this.lastKey = 0; + this.repeatOn = false; + + // Toggles the visibility of the passed element ID. + this.FindChildElement = function(id) + { + var parentElement = document.getElementById(id); + var element = parentElement.firstChild; + + while (element && element!=parentElement) + { + if (element.nodeName == 'DIV' && element.className == 'SRChildren') + { + return element; + } + + if (element.nodeName == 'DIV' && element.hasChildNodes()) + { + element = element.firstChild; + } + else if (element.nextSibling) + { + element = element.nextSibling; + } + else + { + do + { + element = element.parentNode; + } + while (element && element!=parentElement && !element.nextSibling); + + if (element && element!=parentElement) + { + element = element.nextSibling; + } + } + } + } + + this.Toggle = function(id) + { + var element = this.FindChildElement(id); + if (element) + { + if (element.style.display == 'block') + { + element.style.display = 'none'; + } + else + { + element.style.display = 'block'; + } + } + } + + // Searches for the passed string. If there is no parameter, + // it takes it from the URL query. + // + // Always returns true, since other documents may try to call it + // and that may or may not be possible. + this.Search = function(search) + { + if (!search) // get search word from URL + { + search = window.location.search; + search = search.substring(1); // Remove the leading '?' + search = unescape(search); + } + + search = search.replace(/^ +/, ""); // strip leading spaces + search = search.replace(/ +$/, ""); // strip trailing spaces + search = search.toLowerCase(); + search = convertToId(search); + + var resultRows = document.getElementsByTagName("div"); + var matches = 0; + + var i = 0; + while (i < resultRows.length) + { + var row = resultRows.item(i); + if (row.className == "SRResult") + { + var rowMatchName = row.id.toLowerCase(); + rowMatchName = rowMatchName.replace(/^sr\d*_/, ''); // strip 'sr123_' + + if (search.length<=rowMatchName.length && + rowMatchName.substr(0, search.length)==search) + { + row.style.display = 'block'; + matches++; + } + else + { + row.style.display = 'none'; + } + } + i++; + } + document.getElementById("Searching").style.display='none'; + if (matches == 0) // no results + { + document.getElementById("NoMatches").style.display='block'; + } + else // at least one result + { + document.getElementById("NoMatches").style.display='none'; + } + this.lastMatchCount = matches; + return true; + } + + // return the first item with index index or higher that is visible + this.NavNext = function(index) + { + var focusItem; + while (1) + { + var focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') + { + break; + } + else if (!focusItem) // last element + { + break; + } + focusItem=null; + index++; + } + return focusItem; + } + + this.NavPrev = function(index) + { + var focusItem; + while (1) + { + var focusName = 'Item'+index; + focusItem = document.getElementById(focusName); + if (focusItem && focusItem.parentNode.parentNode.style.display=='block') + { + break; + } + else if (!focusItem) // last element + { + break; + } + focusItem=null; + index--; + } + return focusItem; + } + + this.ProcessKeys = function(e) + { + if (e.type == "keydown") + { + this.repeatOn = false; + this.lastKey = e.keyCode; + } + else if (e.type == "keypress") + { + if (!this.repeatOn) + { + if (this.lastKey) this.repeatOn = true; + return false; // ignore first keypress after keydown + } + } + else if (e.type == "keyup") + { + this.lastKey = 0; + this.repeatOn = false; + } + return this.lastKey!=0; + } + + this.Nav = function(evt,itemIndex) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) // Up + { + var newIndex = itemIndex-1; + var focusItem = this.NavPrev(newIndex); + if (focusItem) + { + var child = this.FindChildElement(focusItem.parentNode.parentNode.id); + if (child && child.style.display == 'block') // children visible + { + var n=0; + var tmpElem; + while (1) // search for last child + { + tmpElem = document.getElementById('Item'+newIndex+'_c'+n); + if (tmpElem) + { + focusItem = tmpElem; + } + else // found it! + { + break; + } + n++; + } + } + } + if (focusItem) + { + focusItem.focus(); + } + else // return focus to search field + { + parent.document.getElementById("MSearchField").focus(); + } + } + else if (this.lastKey==40) // Down + { + var newIndex = itemIndex+1; + var focusItem; + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem && elem.style.display == 'block') // children visible + { + focusItem = document.getElementById('Item'+itemIndex+'_c0'); + } + if (!focusItem) focusItem = this.NavNext(newIndex); + if (focusItem) focusItem.focus(); + } + else if (this.lastKey==39) // Right + { + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'block'; + } + else if (this.lastKey==37) // Left + { + var item = document.getElementById('Item'+itemIndex); + var elem = this.FindChildElement(item.parentNode.parentNode.id); + if (elem) elem.style.display = 'none'; + } + else if (this.lastKey==27) // Escape + { + parent.searchBox.CloseResultsWindow(); + parent.document.getElementById("MSearchField").focus(); + } + else if (this.lastKey==13) // Enter + { + return true; + } + return false; + } + + this.NavChild = function(evt,itemIndex,childIndex) + { + var e = (evt) ? evt : window.event; // for IE + if (e.keyCode==13) return true; + if (!this.ProcessKeys(e)) return false; + + if (this.lastKey==38) // Up + { + if (childIndex>0) + { + var newIndex = childIndex-1; + document.getElementById('Item'+itemIndex+'_c'+newIndex).focus(); + } + else // already at first child, jump to parent + { + document.getElementById('Item'+itemIndex).focus(); + } + } + else if (this.lastKey==40) // Down + { + var newIndex = childIndex+1; + var elem = document.getElementById('Item'+itemIndex+'_c'+newIndex); + if (!elem) // last child, jump to parent next parent + { + elem = this.NavNext(itemIndex+1); + } + if (elem) + { + elem.focus(); + } + } + else if (this.lastKey==27) // Escape + { + parent.searchBox.CloseResultsWindow(); + parent.document.getElementById("MSearchField").focus(); + } + else if (this.lastKey==13) // Enter + { + return true; + } + return false; + } +} + +function setKeyActions(elem,action) +{ + elem.setAttribute('onkeydown',action); + elem.setAttribute('onkeypress',action); + elem.setAttribute('onkeyup',action); +} + +function setClassAttr(elem,attr) +{ + elem.setAttribute('class',attr); + elem.setAttribute('className',attr); +} + +function createResults() +{ + var results = document.getElementById("SRResults"); + for (var e=0; e(R!W8j_r#qQ#gnr4kAxdU#F0+OBry$Z+ z_0PMi;P|#{d%mw(dnw=jM%@$onTJa%@6Nm3`;2S#nwtVFJI#`U@2Q@@JCCctagvF- z8H=anvo~dTmJ2YA%wA6IHRv%{vxvUm|R)kgZeo zmX%Zb;mpflGZdXCTAgit`||AFzkI#z&(3d4(htA?U2FOL4WF6wY&TB#n3n*I4+hl| z*NBpo#FA92vEu822WQ%mvv4FO#qs` BFGc_W literal 0 HcmV?d00001 diff --git a/search/search_r.png b/search/search_r.png new file mode 100644 index 0000000000000000000000000000000000000000..1af5d21ee13e070d7600f1c4657fde843b953a69 GIT binary patch literal 553 zcmeAS@N?(olHy`uVBq!ia0vp^LO?9c!2%@BXHTsJQY`6?zK#qG8~eHcB(ehe3dtTp zz6=bxGZ+|(`xqD=STHa&U1eaXVrO7DwS|Gf*oA>XrmV$GYcEhOQT(QLuS{~ooZ2P@v=Xc@RKW@Irliv8_;wroU0*)0O?temdsA~70jrdux+`@W7 z-N(<(C)L?hOO?KV{>8(jC{hpKsws)#Fh zvsO>IB+gb@b+rGWaO&!a9Z{!U+fV*s7TS>fdt&j$L%^U@Epd$~Nl7e8wMs5Z1yT$~ z28I^8hDN#u<{^fLRz?<9hUVG^237_Jy7tbuQ8eV{r(~v8;?@w8^gA7>fx*+&&t;uc GLK6VEQpiUD literal 0 HcmV?d00001 diff --git a/search/searchdata.js b/search/searchdata.js new file mode 100644 index 000000000..45d3d2fad --- /dev/null +++ b/search/searchdata.js @@ -0,0 +1,45 @@ +var indexSectionsWithContent = +{ + 0: "_abcdefghijklmnopqrstuvwxyz~", + 1: "abcdefghijklmnopqrstuvwyz", + 2: "mqs", + 3: "abcdefghijklmnopqrstv", + 4: "_abcdefghijklmnopqrstuvwxyz~", + 5: "_acdefhikmnpqstvwxy", + 6: "ln", + 7: "o", + 8: "_aehlmp", + 9: "mo", + 10: "clpt" +}; + +var indexSectionNames = +{ + 0: "all", + 1: "classes", + 2: "namespaces", + 3: "files", + 4: "functions", + 5: "variables", + 6: "typedefs", + 7: "related", + 8: "defines", + 9: "groups", + 10: "pages" +}; + +var indexSectionLabels = +{ + 0: "All", + 1: "Classes", + 2: "Namespaces", + 3: "Files", + 4: "Functions", + 5: "Variables", + 6: "Typedefs", + 7: "Friends", + 8: "Macros", + 9: "Modules", + 10: "Pages" +}; + diff --git a/search/typedefs_0.html b/search/typedefs_0.html new file mode 100644 index 000000000..43353ee58 --- /dev/null +++ b/search/typedefs_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/typedefs_0.js b/search/typedefs_0.js new file mode 100644 index 000000000..0cbf5c562 --- /dev/null +++ b/search/typedefs_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['link_3915',['link',['../d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6',1,'hash_search.cpp']]] +]; diff --git a/search/typedefs_1.html b/search/typedefs_1.html new file mode 100644 index 000000000..84e9542d4 --- /dev/null +++ b/search/typedefs_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/typedefs_1.js b/search/typedefs_1.js new file mode 100644 index 000000000..a0f3021f6 --- /dev/null +++ b/search/typedefs_1.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['node_3916',['node',['../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555',1,'hash_search.cpp']]] +]; diff --git a/search/variables_0.html b/search/variables_0.html new file mode 100644 index 000000000..9ce246b1f --- /dev/null +++ b/search/variables_0.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_0.js b/search/variables_0.js new file mode 100644 index 000000000..8451e8fbd --- /dev/null +++ b/search/variables_0.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['_5fdigits_3886',['_digits',['../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57',1,'large_number']]] +]; diff --git a/search/variables_1.html b/search/variables_1.html new file mode 100644 index 000000000..5802cecda --- /dev/null +++ b/search/variables_1.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_1.js b/search/variables_1.js new file mode 100644 index 000000000..0d5a4212d --- /dev/null +++ b/search/variables_1.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['a_3887',['a',['../d7/d35/matrix__exponentiation_8cpp.html#a9ecd98ce0064e2f7f97bb6a92f58ee72',1,'matrix_exponentiation.cpp']]], + ['accuracy_3888',['accuracy',['../d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3',1,'machine_learning::adaline']]], + ['availarray_3889',['AvailArray',['../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c',1,'linkedlist_implentation_usingarray.cpp']]] +]; diff --git a/search/variables_10.html b/search/variables_10.html new file mode 100644 index 000000000..3099e8d32 --- /dev/null +++ b/search/variables_10.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_10.js b/search/variables_10.js new file mode 100644 index 000000000..5e143982d --- /dev/null +++ b/search/variables_10.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['weights_3912',['weights',['../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492',1,'machine_learning::adaline']]] +]; diff --git a/search/variables_11.html b/search/variables_11.html new file mode 100644 index 000000000..cbf6c81d5 --- /dev/null +++ b/search/variables_11.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_11.js b/search/variables_11.js new file mode 100644 index 000000000..63757a691 --- /dev/null +++ b/search/variables_11.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['x_3913',['x',['../d8/dc8/struct_point.html#ab99c56589bc8ad5fa5071387110a5bc7',1,'Point']]] +]; diff --git a/search/variables_12.html b/search/variables_12.html new file mode 100644 index 000000000..3f0f7f498 --- /dev/null +++ b/search/variables_12.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_12.js b/search/variables_12.js new file mode 100644 index 000000000..6c0ee09cd --- /dev/null +++ b/search/variables_12.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['y_3914',['y',['../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7',1,'Point::y()'],['../d8/dc8/struct_point.html#afa38be143ae800e6ad69ce8ed4df62d8',1,'Point::y()']]] +]; diff --git a/search/variables_2.html b/search/variables_2.html new file mode 100644 index 000000000..00291e594 --- /dev/null +++ b/search/variables_2.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_2.js b/search/variables_2.js new file mode 100644 index 000000000..0a615b767 --- /dev/null +++ b/search/variables_2.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['capacity_3890',['capacity',['../d2/d05/class_min_heap.html#a88b4aa3e66392a3eabbf2517a9a79a02',1,'MinHeap']]] +]; diff --git a/search/variables_3.html b/search/variables_3.html new file mode 100644 index 000000000..0e5389be7 --- /dev/null +++ b/search/variables_3.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_3.js b/search/variables_3.js new file mode 100644 index 000000000..6108417a5 --- /dev/null +++ b/search/variables_3.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['data_3891',['data',['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'hash_search.cpp']]] +]; diff --git a/search/variables_4.html b/search/variables_4.html new file mode 100644 index 000000000..789a86b74 --- /dev/null +++ b/search/variables_4.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_4.js b/search/variables_4.js new file mode 100644 index 000000000..ef44babf6 --- /dev/null +++ b/search/variables_4.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['eta_3892',['eta',['../d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda',1,'machine_learning::adaline']]] +]; diff --git a/search/variables_5.html b/search/variables_5.html new file mode 100644 index 000000000..c7873eb91 --- /dev/null +++ b/search/variables_5.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_5.js b/search/variables_5.js new file mode 100644 index 000000000..a01119de0 --- /dev/null +++ b/search/variables_5.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['f_3893',['f',['../d4/d32/fibonacci__fast_8cpp.html#a3ba232425d45f9e9c0b87a8cf7ab69d9',1,'fibonacci_fast.cpp']]], + ['factors_3894',['factors',['../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b',1,'prime_factorization.cpp']]] +]; diff --git a/search/variables_6.html b/search/variables_6.html new file mode 100644 index 000000000..a5885889b --- /dev/null +++ b/search/variables_6.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_6.js b/search/variables_6.js new file mode 100644 index 000000000..19c8ad3ee --- /dev/null +++ b/search/variables_6.js @@ -0,0 +1,6 @@ +var searchData= +[ + ['harr_3895',['harr',['../d2/d05/class_min_heap.html#a34a93a87967308eb516328c0aca3c48e',1,'MinHeap']]], + ['hashtab_3896',['hashtab',['../d1/df3/hash__search_8cpp.html#af413b1740073db54796642b0ab814d6d',1,'hash_search.cpp']]], + ['heap_5fsize_3897',['heap_size',['../d2/d05/class_min_heap.html#ae4d358bf063bb196a1945b3fb99b4913',1,'MinHeap']]] +]; diff --git a/search/variables_7.html b/search/variables_7.html new file mode 100644 index 000000000..b09b295ec --- /dev/null +++ b/search/variables_7.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_7.js b/search/variables_7.js new file mode 100644 index 000000000..2d9cba98c --- /dev/null +++ b/search/variables_7.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['isprime_3898',['isprime',['../db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23',1,'isprime(): prime_factorization.cpp'],['../d8/ddf/sieve__of__eratosthenes_8cpp.html#a0560e21edb54d5ad8d80b2d80348ce22',1,'isprime(): sieve_of_eratosthenes.cpp']]] +]; diff --git a/search/variables_8.html b/search/variables_8.html new file mode 100644 index 000000000..a479f8e0d --- /dev/null +++ b/search/variables_8.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_8.js b/search/variables_8.js new file mode 100644 index 000000000..518cd34f9 --- /dev/null +++ b/search/variables_8.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['k_3899',['k',['../d7/d35/matrix__exponentiation_8cpp.html#afcf0d19607cd0edd8ae333d2b9c220c0',1,'matrix_exponentiation.cpp']]], + ['key_3900',['key',['../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c',1,'list']]] +]; diff --git a/search/variables_9.html b/search/variables_9.html new file mode 100644 index 000000000..97cc440a0 --- /dev/null +++ b/search/variables_9.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_9.js b/search/variables_9.js new file mode 100644 index 000000000..0e20336f6 --- /dev/null +++ b/search/variables_9.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['max_3901',['MAX',['../d4/d32/fibonacci__fast_8cpp.html#a692ac7187ee88621a9f78fca78ec498d',1,'fibonacci_fast.cpp']]] +]; diff --git a/search/variables_a.html b/search/variables_a.html new file mode 100644 index 000000000..010744863 --- /dev/null +++ b/search/variables_a.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_a.js b/search/variables_a.js new file mode 100644 index 000000000..cfbc40722 --- /dev/null +++ b/search/variables_a.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['next_3902',['next',['../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f',1,'list']]] +]; diff --git a/search/variables_b.html b/search/variables_b.html new file mode 100644 index 000000000..e5b2fd95d --- /dev/null +++ b/search/variables_b.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_b.js b/search/variables_b.js new file mode 100644 index 000000000..53c6318e4 --- /dev/null +++ b/search/variables_b.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['prime_3903',['prime',['../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95',1,'primes_up_to_billion.cpp']]], + ['prime_5fnumbers_3904',['prime_numbers',['../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe',1,'prime_factorization.cpp']]] +]; diff --git a/search/variables_c.html b/search/variables_c.html new file mode 100644 index 000000000..f3e998917 --- /dev/null +++ b/search/variables_c.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_c.js b/search/variables_c.js new file mode 100644 index 000000000..937a801ae --- /dev/null +++ b/search/variables_c.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['queuefront_3905',['queueFront',['../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5',1,'queue']]], + ['queuerear_3906',['queueRear',['../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5',1,'queue']]] +]; diff --git a/search/variables_d.html b/search/variables_d.html new file mode 100644 index 000000000..478ae0edb --- /dev/null +++ b/search/variables_d.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_d.js b/search/variables_d.js new file mode 100644 index 000000000..40b0a9ce1 --- /dev/null +++ b/search/variables_d.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['stack_3907',['stack',['../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7',1,'paranthesis_matching.cpp']]], + ['stacktop_3908',['stackTop',['../d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453',1,'stack']]] +]; diff --git a/search/variables_e.html b/search/variables_e.html new file mode 100644 index 000000000..8f22eb94c --- /dev/null +++ b/search/variables_e.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_e.js b/search/variables_e.js new file mode 100644 index 000000000..b43be978c --- /dev/null +++ b/search/variables_e.js @@ -0,0 +1,5 @@ +var searchData= +[ + ['test_5fset_3909',['test_set',['../d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123',1,'brute_force_string_searching.cpp']]], + ['top_3910',['top',['../d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d',1,'tower::top()'],['../dc/dc5/paranthesis__matching_8cpp.html#af93f4f37fc2ad9c37af4a715423b110c',1,'top(): paranthesis_matching.cpp']]] +]; diff --git a/search/variables_f.html b/search/variables_f.html new file mode 100644 index 000000000..5dc917951 --- /dev/null +++ b/search/variables_f.html @@ -0,0 +1,36 @@ + + + + + + + + + +
    +
    Loading...
    +
    + +
    Searching...
    +
    No Matches
    + +
    + + diff --git a/search/variables_f.js b/search/variables_f.js new file mode 100644 index 000000000..59c5586fc --- /dev/null +++ b/search/variables_f.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['values_3911',['values',['../d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9',1,'tower']]] +]; diff --git a/splitbar.png b/splitbar.png new file mode 100644 index 0000000000000000000000000000000000000000..fe895f2c58179b471a22d8320b39a4bd7312ec8e GIT binary patch literal 314 zcmeAS@N?(olHy`uVBq!ia0vp^Yzz!63>-{AmhX=Jf(#6djGiuzAr*{o?=JLmPLyc> z_*`QK&+BH@jWrYJ7>r6%keRM@)Qyv8R=enp0jiI>aWlGyB58O zFVR20d+y`K7vDw(hJF3;>dD*3-?v=<8M)@x|EEGLnJsniYK!2U1 Y!`|5biEc?d1`HDhPgg&ebxsLQ02F6;9RL6T literal 0 HcmV?d00001 diff --git a/svgpan.js b/svgpan.js new file mode 100644 index 000000000..2678d3846 --- /dev/null +++ b/svgpan.js @@ -0,0 +1,323 @@ +/* + @licstart The following is the entire license notice for the JavaScript code in this file. + The code below is based on SVGPan Library 1.2 and was modified for doxygen + to support both zooming and panning via the mouse and via embedded buttons. + + This code is licensed under the following BSD license: + + Copyright 2009-2010 Andrea Leofreddi . All rights reserved. + + Redistribution and use in source and binary forms, with or without modification, are + permitted provided that the following conditions are met: + + 1. Redistributions of source code must retain the above copyright notice, this list of + conditions and the following disclaimer. + + 2. Redistributions in binary form must reproduce the above copyright notice, this list + of conditions and the following disclaimer in the documentation and/or other materials + provided with the distribution. + + THIS SOFTWARE IS PROVIDED BY Andrea Leofreddi ``AS IS'' AND ANY EXPRESS OR IMPLIED + WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND + FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL Andrea Leofreddi OR + CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR + CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR + SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON + ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING + NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF + ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. + + The views and conclusions contained in the software and documentation are those of the + authors and should not be interpreted as representing official policies, either expressed + or implied, of Andrea Leofreddi. + + @licend The above is the entire license notice for the JavaScript code in this file + */ + +var root = document.documentElement; +var state = 'none'; +var stateOrigin; +var stateTf = root.createSVGMatrix(); +var cursorGrab = ' url("data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAA4AAAAOCAMAAAAolt3jAAAAGXRFWHRTb2Z0d2FyZQBBZG9iZSBJbWFnZVJlYWR5ccllPAAAAAlQTFRFAAAA////////c3ilYwAAAAN0Uk5T//8A18oNQQAAAD1JREFUeNp0zlEKACAIA9Bt9z90bZBZkQj29qFBEuBOzQHSnWTTyckEfqUuZgFvslH4ch3qLCO/Kr8cAgwATw4Ax6XRCcoAAAAASUVORK5CYII="), move'; +var zoomSteps = 10; +var zoomInFactor; +var zoomOutFactor; +var windowWidth; +var windowHeight; +var svgDoc; +var minZoom; +var maxZoom; +if (!window) window=this; + +/** + * Show the graph in the middle of the view, scaled to fit + */ +function show() +{ + if (window.innerHeight) // Firefox + { + windowWidth = window.innerWidth; + windowHeight = window.innerHeight; + } + else if (document.documentElement.clientWidth) // Chrome/Safari + { + windowWidth = document.documentElement.clientWidth + windowHeight = document.documentElement.clientHeight + } + if (!windowWidth || !windowHeight) // failsafe + { + windowWidth = 800; + windowHeight = 600; + } + minZoom = Math.min(Math.min(viewHeight,windowHeight)/viewHeight,Math.min(viewWidth,windowWidth)/viewWidth); + maxZoom = minZoom+1.5; + zoomInFactor = Math.pow(maxZoom/minZoom,1.0/zoomSteps); + zoomOutFactor = 1.0/zoomInFactor; + + var g = svgDoc.getElementById('viewport'); + try + { + var bb = g.getBBox(); // this can throw an exception if css { display: none } + var tx = (windowWidth-viewWidth*minZoom+8)/(2*minZoom); + var ty = viewHeight+(windowHeight-viewHeight*minZoom)/(2*minZoom); + var a = 'scale('+minZoom+') rotate(0) translate('+tx+' '+ty+')'; + g.setAttribute('transform',a); + } + catch(e) {} +} + +/** + * Register handlers + */ +function init(evt) +{ + svgDoc = evt.target.ownerDocument; + try { + if (top.window && top.window.registerShow) { // register show function in html doc for dynamic sections + top.window.registerShow(sectionId,show); + } + } catch(e) { + // ugh, we are not allowed to talk to the parent; can happen with Chrome when viewing pages + // locally, since they treat every local page as having a different origin + } + show(); + + setAttributes(root, { + "onmousedown" : "handleMouseDown(evt)", + "onmousemove" : "handleMouseMove(evt)", + "onmouseup" : "handleMouseUp(evt)" + }); + + if (window.addEventListener) + { + if (navigator.userAgent.toLowerCase().indexOf('webkit') >= 0 || + navigator.userAgent.toLowerCase().indexOf("opera") >= 0 || + navigator.appVersion.indexOf("MSIE") != -1) + { + window.addEventListener('mousewheel', handleMouseWheel, false); // Chrome/Safari/IE9 + } + else + { + window.addEventListener('DOMMouseScroll', handleMouseWheel, false); // Others + } + } +} + +window.onresize=function() +{ + if (svgDoc) { show(); } +} + +/** + * Instance an SVGPoint object with given event coordinates. + */ +function getEventPoint(evt) +{ + var p = root.createSVGPoint(); + p.x = evt.clientX; + p.y = evt.clientY; + return p; +} + +/** + * Sets the current transform matrix of an element. + */ +function setCTM(element, matrix) +{ + var s = "matrix(" + matrix.a + "," + matrix.b + "," + matrix.c + "," + matrix.d + "," + matrix.e + "," + matrix.f + ")"; + element.setAttribute("transform", s); +} + +/** + * Sets attributes of an element. + */ +function setAttributes(element, attributes) +{ + for (i in attributes) + element.setAttributeNS(null, i, attributes[i]); +} + +function doZoom(g,point,zoomFactor) +{ + var p = point.matrixTransform(g.getCTM().inverse()); + var k = root.createSVGMatrix().translate(p.x, p.y).scale(zoomFactor).translate(-p.x, -p.y); + var n = g.getCTM().multiply(k); + var s = Math.max(n.a,n.d); + if (s>maxZoom) n=n.translate(p.x,p.y).scale(maxZoom/s).translate(-p.x,-p.y); + else if (s'); + d.write('Print SVG'); + d.write(''); + d.write('
    '+xs+'
    '); + d.write(''); + d.write(''); + d.close(); + } catch(e) { + alert('Failed to open popup window needed for printing!\n'+e.message); + } +} +/* @license-end */ diff --git a/sync_off.png b/sync_off.png new file mode 100644 index 0000000000000000000000000000000000000000..3b443fc62892114406e3d399421b2a881b897acc GIT binary patch literal 853 zcmV-b1FHOqP)oT|#XixUYy%lpuf3i8{fX!o zUyDD0jOrAiT^tq>fLSOOABs-#u{dV^F$b{L9&!2=9&RmV;;8s^x&UqB$PCj4FdKbh zoB1WTskPUPu05XzFbA}=KZ-GP1fPpAfSs>6AHb12UlR%-i&uOlTpFNS7{jm@mkU1V zh`nrXr~+^lsV-s1dkZOaI|kYyVj3WBpPCY{n~yd%u%e+d=f%`N0FItMPtdgBb@py; zq@v6NVArhyTC7)ULw-Jy8y42S1~4n(3LkrW8mW(F-4oXUP3E`e#g**YyqI7h-J2zK zK{m9##m4ri!7N>CqQqCcnI3hqo1I;Yh&QLNY4T`*ptiQGozK>FF$!$+84Z`xwmeMh zJ0WT+OH$WYFALEaGj2_l+#DC3t7_S`vHpSivNeFbP6+r50cO8iu)`7i%Z4BTPh@_m3Tk!nAm^)5Bqnr%Ov|Baunj#&RPtRuK& z4RGz|D5HNrW83-#ydk}tVKJrNmyYt-sTxLGlJY5nc&Re zU4SgHNPx8~Yxwr$bsju?4q&%T1874xxzq+_%?h8_ofw~(bld=o3iC)LUNR*BY%c0y zWd_jX{Y8`l%z+ol1$@Qa?Cy!(0CVIEeYpKZ`(9{z>3$CIe;pJDQk$m3p}$>xBm4lb zKo{4S)`wdU9Ba9jJbVJ0C=SOefZe%d$8=2r={nu<_^a3~>c#t_U6dye5)JrR(_a^E f@}b6j1K9lwFJq@>o)+Ry00000NkvXXu0mjfWa5j* literal 0 HcmV?d00001 diff --git a/sync_on.png b/sync_on.png new file mode 100644 index 0000000000000000000000000000000000000000..e08320fb64e6fa33b573005ed6d8fe294e19db76 GIT binary patch literal 845 zcmV-T1G4;yP)Y;xxyHF2B5Wzm| zOOGupOTn@c(JmBOl)e;XMNnZuiTJP>rM8<|Q`7I_))aP?*T)ow&n59{}X4$3Goat zgjs?*aasfbrokzG5cT4K=uG`E14xZl@z)F={P0Y^?$4t z>v!teRnNZym<6h{7sLyF1V0HsfEl+l6TrZpsfr1}luH~F7L}ktXu|*uVX^RG$L0`K zWs3j|0tIvVe(N%_?2{(iCPFGf#B6Hjy6o&}D$A%W%jfO8_W%ZO#-mh}EM$LMn7joJ z05dHr!5Y92g+31l<%i1(=L1a1pXX+OYnalY>31V4K}BjyRe3)9n#;-cCVRD_IG1fT zOKGeNY8q;TL@K{dj@D^scf&VCs*-Jb>8b>|`b*osv52-!A?BpbYtTQBns5EAU**$m zSnVSm(teh>tQi*S*A>#ySc=n;`BHz`DuG4&g4Kf8lLhca+zvZ7t7RflD6-i-mcK=M z!=^P$*u2)bkY5asG4gsss!Hn%u~>}kIW`vMs%lJLH+u*9<4PaV_c6U`KqWXQH%+Nu zTv41O(^ZVi@qhjQdG!fbZw&y+2o!iYymO^?ud3{P*HdoX83YV*Uu_HB=?U&W9%AU# z80}k1SS-CXTU7dcQlsm<^oYLxVSseqY6NO}dc`Nj?8vrhNuCdm@^{a3AQ_>6myOj+ z`1RsLUXF|dm|3k7s2jD(B{rzE>WI2scH8i1;=O5Cc9xB3^aJk%fQjqsu+kH#0=_5a z0nCE8@dbQa-|YIuUVvG0L_IwHMEhOj$Mj4Uq05 X8=0q~qBNan00000NkvXXu0mjfptF>5 literal 0 HcmV?d00001 diff --git a/tab_a.png b/tab_a.png new file mode 100644 index 0000000000000000000000000000000000000000..3b725c41c5a527a3a3e40097077d0e206a681247 GIT binary patch literal 142 zcmeAS@N?(olHy`uVBq!ia0vp^j6kfy!2~3aiye;!QlXwMjv*C{Z|8b*H5dputLHD# z=<0|*y7z(Vor?d;H&?EG&cXR}?!j-Lm&u1OOI7AIF5&c)RFE;&p0MYK>*Kl@eiymD r@|NpwKX@^z+;{u_Z~trSBfrMKa%3`zocFjEXaR$#tDnm{r-UW|TZ1%4 literal 0 HcmV?d00001 diff --git a/tab_b.png b/tab_b.png new file mode 100644 index 0000000000000000000000000000000000000000..e2b4a8638cb3496a016eaed9e16ffc12846dea18 GIT binary patch literal 169 zcmeAS@N?(olHy`uVBq!ia0vp^j6kfy!2~3aiye;!QU#tajv*C{Z}0l@H7kg?K0Lnr z!j&C6_(~HV9oQ0Pa6x{-v0AGV_E?vLn=ZI-;YrdjIl`U`uzuDWSP?o#Dmo{%SgM#oan kX~E1%D-|#H#QbHoIja2U-MgvsK&LQxy85}Sb4q9e0Efg%P5=M^ literal 0 HcmV?d00001 diff --git a/tabs.css b/tabs.css new file mode 100644 index 000000000..85a0cd5b5 --- /dev/null +++ b/tabs.css @@ -0,0 +1 @@ +.sm{position:relative;z-index:9999}.sm,.sm ul,.sm li{display:block;list-style:none;margin:0;padding:0;line-height:normal;direction:ltr;text-align:left;-webkit-tap-highlight-color:rgba(0,0,0,0)}.sm-rtl,.sm-rtl ul,.sm-rtl li{direction:rtl;text-align:right}.sm>li>h1,.sm>li>h2,.sm>li>h3,.sm>li>h4,.sm>li>h5,.sm>li>h6{margin:0;padding:0}.sm ul{display:none}.sm li,.sm a{position:relative}.sm a{display:block}.sm a.disabled{cursor:not-allowed}.sm:after{content:"\00a0";display:block;height:0;font:0/0 serif;clear:both;visibility:hidden;overflow:hidden}.sm,.sm *,.sm *:before,.sm *:after{-moz-box-sizing:border-box;-webkit-box-sizing:border-box;box-sizing:border-box}.sm-dox{background-image:url("tab_b.png")}.sm-dox a,.sm-dox a:focus,.sm-dox a:hover,.sm-dox a:active{padding:0 12px;padding-right:43px;font-family:"Lucida Grande","Geneva","Helvetica",Arial,sans-serif;font-size:13px;font-weight:bold;line-height:36px;text-decoration:none;text-shadow:0 1px 1px rgba(255,255,255,0.9);color:#283a5d;outline:0}.sm-dox a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox a.current{color:#d23600}.sm-dox a.disabled{color:#bbb}.sm-dox a span.sub-arrow{position:absolute;top:50%;margin-top:-14px;left:auto;right:3px;width:28px;height:28px;overflow:hidden;font:bold 12px/28px monospace!important;text-align:center;text-shadow:none;background:rgba(255,255,255,0.5);-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox a.highlighted span.sub-arrow:before{display:block;content:'-'}.sm-dox>li:first-child>a,.sm-dox>li:first-child>:not(ul) a{-moz-border-radius:5px 5px 0 0;-webkit-border-radius:5px;border-radius:5px 5px 0 0}.sm-dox>li:last-child>a,.sm-dox>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul{-moz-border-radius:0 0 5px 5px;-webkit-border-radius:0;border-radius:0 0 5px 5px}.sm-dox>li:last-child>a.highlighted,.sm-dox>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>a.highlighted,.sm-dox>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>ul>li:last-child>*:not(ul) a.highlighted{-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox ul{background:rgba(162,162,162,0.1)}.sm-dox ul a,.sm-dox ul a:focus,.sm-dox ul a:hover,.sm-dox ul a:active{font-size:12px;border-left:8px solid transparent;line-height:36px;text-shadow:none;background-color:white;background-image:none}.sm-dox ul a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox ul ul a,.sm-dox ul ul a:hover,.sm-dox ul ul a:focus,.sm-dox ul ul a:active{border-left:16px solid transparent}.sm-dox ul ul ul a,.sm-dox ul ul ul a:hover,.sm-dox ul ul ul a:focus,.sm-dox ul ul ul a:active{border-left:24px solid transparent}.sm-dox ul ul ul ul a,.sm-dox ul ul ul ul a:hover,.sm-dox ul ul ul ul a:focus,.sm-dox ul ul ul ul a:active{border-left:32px solid transparent}.sm-dox ul ul ul ul ul a,.sm-dox ul ul ul ul ul a:hover,.sm-dox ul ul ul ul ul a:focus,.sm-dox ul ul ul ul ul a:active{border-left:40px solid transparent}@media(min-width:768px){.sm-dox ul{position:absolute;width:12em}.sm-dox li{float:left}.sm-dox.sm-rtl li{float:right}.sm-dox ul li,.sm-dox.sm-rtl ul li,.sm-dox.sm-vertical li{float:none}.sm-dox a{white-space:nowrap}.sm-dox ul a,.sm-dox.sm-vertical a{white-space:normal}.sm-dox .sm-nowrap>li>a,.sm-dox .sm-nowrap>li>:not(ul) a{white-space:nowrap}.sm-dox{padding:0 10px;background-image:url("tab_b.png");line-height:36px}.sm-dox a span.sub-arrow{top:50%;margin-top:-2px;right:12px;width:0;height:0;border-width:4px;border-style:solid dashed dashed dashed;border-color:#283a5d transparent transparent transparent;background:transparent;-moz-border-radius:0;-webkit-border-radius:0;border-radius:0}.sm-dox a,.sm-dox a:focus,.sm-dox a:active,.sm-dox a:hover,.sm-dox a.highlighted{padding:0 12px;background-image:url("tab_s.png");background-repeat:no-repeat;background-position:right;-moz-border-radius:0!important;-webkit-border-radius:0;border-radius:0!important}.sm-dox a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox a:hover span.sub-arrow{border-color:white transparent transparent transparent}.sm-dox a.has-submenu{padding-right:24px}.sm-dox li{border-top:0}.sm-dox>li>ul:before,.sm-dox>li>ul:after{content:'';position:absolute;top:-18px;left:30px;width:0;height:0;overflow:hidden;border-width:9px;border-style:dashed dashed solid dashed;border-color:transparent transparent #bbb transparent}.sm-dox>li>ul:after{top:-16px;left:31px;border-width:8px;border-color:transparent transparent #fff transparent}.sm-dox ul{border:1px solid #bbb;padding:5px 0;background:#fff;-moz-border-radius:5px!important;-webkit-border-radius:5px;border-radius:5px!important;-moz-box-shadow:0 5px 9px rgba(0,0,0,0.2);-webkit-box-shadow:0 5px 9px rgba(0,0,0,0.2);box-shadow:0 5px 9px rgba(0,0,0,0.2)}.sm-dox ul a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-color:transparent transparent transparent #555;border-style:dashed dashed dashed solid}.sm-dox ul a,.sm-dox ul a:hover,.sm-dox ul a:focus,.sm-dox ul a:active,.sm-dox ul a.highlighted{color:#555;background-image:none;border:0!important;color:#555;background-image:none}.sm-dox ul a:hover{background-image:url("tab_a.png");background-repeat:repeat-x;color:white;text-shadow:0 1px 1px black}.sm-dox ul a:hover span.sub-arrow{border-color:transparent transparent transparent white}.sm-dox span.scroll-up,.sm-dox span.scroll-down{position:absolute;display:none;visibility:hidden;overflow:hidden;background:#fff;height:36px}.sm-dox span.scroll-up:hover,.sm-dox span.scroll-down:hover{background:#eee}.sm-dox span.scroll-up:hover span.scroll-up-arrow,.sm-dox span.scroll-up:hover span.scroll-down-arrow{border-color:transparent transparent #d23600 transparent}.sm-dox span.scroll-down:hover span.scroll-down-arrow{border-color:#d23600 transparent transparent transparent}.sm-dox span.scroll-up-arrow,.sm-dox span.scroll-down-arrow{position:absolute;top:0;left:50%;margin-left:-6px;width:0;height:0;overflow:hidden;border-width:6px;border-style:dashed dashed solid dashed;border-color:transparent transparent #555 transparent}.sm-dox span.scroll-down-arrow{top:8px;border-style:solid dashed dashed dashed;border-color:#555 transparent transparent transparent}.sm-dox.sm-rtl a.has-submenu{padding-right:12px;padding-left:24px}.sm-dox.sm-rtl a span.sub-arrow{right:auto;left:12px}.sm-dox.sm-rtl.sm-vertical a.has-submenu{padding:10px 20px}.sm-dox.sm-rtl.sm-vertical a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-rtl>li>ul:before{left:auto;right:30px}.sm-dox.sm-rtl>li>ul:after{left:auto;right:31px}.sm-dox.sm-rtl ul a.has-submenu{padding:10px 20px!important}.sm-dox.sm-rtl ul a span.sub-arrow{right:auto;left:8px;border-style:dashed solid dashed dashed;border-color:transparent #555 transparent transparent}.sm-dox.sm-vertical{padding:10px 0;-moz-border-radius:5px;-webkit-border-radius:5px;border-radius:5px}.sm-dox.sm-vertical a{padding:10px 20px}.sm-dox.sm-vertical a:hover,.sm-dox.sm-vertical a:focus,.sm-dox.sm-vertical a:active,.sm-dox.sm-vertical a.highlighted{background:#fff}.sm-dox.sm-vertical a.disabled{background-image:url("tab_b.png")}.sm-dox.sm-vertical a span.sub-arrow{right:8px;top:50%;margin-top:-5px;border-width:5px;border-style:dashed dashed dashed solid;border-color:transparent transparent transparent #555}.sm-dox.sm-vertical>li>ul:before,.sm-dox.sm-vertical>li>ul:after{display:none}.sm-dox.sm-vertical ul a{padding:10px 20px}.sm-dox.sm-vertical ul a:hover,.sm-dox.sm-vertical ul a:focus,.sm-dox.sm-vertical ul a:active,.sm-dox.sm-vertical ul a.highlighted{background:#eee}.sm-dox.sm-vertical ul a.disabled{background:#fff}} \ No newline at end of file