backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-17 12:02:22 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 67e26cfbae

Browse Source
This commit is contained in:
github-actions
2020-11-22 17:38:23 +00:00
parent a3bea7d7bd
commit 706b4eea3b
394 changed files with 8360 additions and 6581 deletions
Download Patch File Download Diff File Expand all files Collapse all files

85
annotated.html
View File

@@ -128,49 +128,52 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_6_0_0_0_"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">DenseLayer</a></td><td class="desc"></td></tr> <tr id="row_6_0_0_0_"><td class="entry"><span style="width:64px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">DenseLayer</a></td><td class="desc"></td></tr>
<tr id="row_6_0_1_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">NeuralNetwork</a></td><td class="desc"></td></tr> <tr id="row_6_0_1_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">NeuralNetwork</a></td><td class="desc"></td></tr>
<tr id="row_6_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html" target="_self">adaline</a></td><td class="desc"></td></tr> <tr id="row_6_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html" target="_self">adaline</a></td><td class="desc"></td></tr>
<tr id="row_7_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">Other algorithms </td></tr> <tr id="row_7_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html" title="STL class.">std::vector</a> </td></tr>
<tr id="row_7_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_7_0_" class="arrow" onclick="toggleFolder('7_0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr> <tr id="row_7_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_7_0_" class="arrow" onclick="toggleFolder('7_0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>ncr_modulo_p</b></td><td class="desc"></td></tr>
<tr id="row_7_0_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr> <tr id="row_7_0_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
<tr id="row_8_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing">quadratic probing</a> algorithm </td></tr> <tr id="row_8_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">Other algorithms </td></tr>
<tr id="row_8_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr> <tr id="row_8_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_8_0_" class="arrow" onclick="toggleFolder('8_0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
<tr id="row_9_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr> <tr id="row_8_0_0_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_9_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_9_0_" class="arrow" onclick="toggleFolder('9_0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr> <tr id="row_9_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing">quadratic probing</a> algorithm </td></tr>
<tr id="row_9_0_0_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr> <tr id="row_9_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
<tr id="row_9_0_1_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr> <tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
<tr id="row_9_0_2_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr> <tr id="row_10_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_10_0_" class="arrow" onclick="toggleFolder('10_0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr> <tr id="row_10_0_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_10_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr> <tr id="row_10_0_1_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_10_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr> <tr id="row_10_0_2_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_11_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr> <tr id="row_11_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr> <tr id="row_11_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
<tr id="row_13_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr> <tr id="row_11_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr> <tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_15_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr> <tr id="row_13_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr> <tr id="row_14_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr> <tr id="row_15_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr> <tr id="row_16_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr> <tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr> <tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr> <tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr> <tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr> <tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr> <tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr> <tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr> <tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_27_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr> <tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr> <tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_27_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_29_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr> <tr id="row_29_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr> <tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr> <tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr> <tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr> <tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr> <tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr> <tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr> <tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr> <tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr> <tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_39_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_39_" class="arrow" onclick="toggleFolder('39_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr> <tr id="row_39_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_39_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr> <tr id="row_40_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_40_" class="arrow" onclick="toggleFolder('40_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_40_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
</table> </table>
</div><!-- directory --> </div><!-- directory -->
</div><!-- contents --> </div><!-- contents -->

5
annotated_dup.js
View File

@@ -7,6 +7,7 @@ var annotated_dup =
[ "graph", "df/dce/namespacegraph.html", "df/dce/namespacegraph" ], [ "graph", "df/dce/namespacegraph.html", "df/dce/namespacegraph" ],
[ "linear_probing", "d8/d89/namespacelinear__probing.html", "d8/d89/namespacelinear__probing" ], [ "linear_probing", "d8/d89/namespacelinear__probing.html", "d8/d89/namespacelinear__probing" ],
[ "machine_learning", "d8/d77/namespacemachine__learning.html", "d8/d77/namespacemachine__learning" ], [ "machine_learning", "d8/d77/namespacemachine__learning.html", "d8/d77/namespacemachine__learning" ],
[ "math", "dd/d47/namespacemath.html", "dd/d47/namespacemath" ],
[ "others", "d0/d6f/namespaceothers.html", "d0/d6f/namespaceothers" ], [ "others", "d0/d6f/namespaceothers.html", "d0/d6f/namespaceothers" ],
[ "quadratic_probing", "d4/dd2/namespacequadratic__probing.html", "d4/dd2/namespacequadratic__probing" ], [ "quadratic_probing", "d4/dd2/namespacequadratic__probing.html", "d4/dd2/namespacequadratic__probing" ],
[ "range_queries", "dd/d69/namespacerange__queries.html", "dd/d69/namespacerange__queries" ], [ "range_queries", "dd/d69/namespacerange__queries.html", "dd/d69/namespacerange__queries" ],
@@ -28,12 +29,12 @@ var annotated_dup =
[ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ], [ "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" ], [ "MinHeapNode", "d5/d29/struct_min_heap_node.html", "d5/d29/struct_min_heap_node" ],
[ "mst", "d1/d77/structmst.html", "d1/d77/structmst" ], [ "mst", "d1/d77/structmst.html", "d1/d77/structmst" ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ], [ "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" ], [ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
[ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ], [ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ],
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ], [ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ], [ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
[ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ], [ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ],
[ "stack", "d1/dc2/classstack.html", "d1/dc2/classstack" ], [ "stack", "d1/dc2/classstack.html", "d1/dc2/classstack" ],

63
classes.html
View File

@@ -98,19 +98,19 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<table class="classindex"> <table class="classindex">
<tr><td rowspan="2" valign="bottom"><a name="letter_a"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;a&#160;&#160;</div></td></tr></table> <tr><td rowspan="2" valign="bottom"><a name="letter_a"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;a&#160;&#160;</div></td></tr></table>
</td> </td>
<td valign="top"><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> (<a class="el" href="d0/d65/namespacedouble__hashing.html">double_hashing</a>)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> (<a class="el" href="d4/dd2/namespacequadratic__probing.html">quadratic_probing</a>)&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;l&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_l"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;l&#160;&#160;</div></td></tr></table>
</td> </td>
<td valign="top"><a class="el" href="db/d8b/struct_node.html">Node</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d5/da1/structnode.html">node</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="db/d19/structlinear__probing_1_1_entry.html">Entry</a> (<a class="el" href="d8/d89/namespacelinear__probing.html">linear_probing</a>)&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;p&#160;&#160;</div></td></tr></table>
</td>
<td valign="top"><a class="el" href="dd/d4f/class_solution.html">Solution</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="dd/d4f/class_solution.html">Solution</a>&#160;&#160;&#160;</td>
</tr> </tr>
<tr><td valign="top"><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> (<a class="el" href="d0/d65/namespacedouble__hashing.html">double_hashing</a>)&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_p"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;p&#160;&#160;</div></td></tr></table>
</td>
<td valign="top"><a class="el" href="d1/dc2/classstack.html">stack</a>&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html">adaline</a> (<a class="el" href="d8/d77/namespacemachine__learning.html">machine_learning</a>)&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html">adaline</a> (<a class="el" href="d8/d77/namespacemachine__learning.html">machine_learning</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> (<a class="el" href="d4/dd2/namespacequadratic__probing.html">quadratic_probing</a>)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="db/d19/structlinear__probing_1_1_entry.html">Entry</a> (<a class="el" href="d8/d89/namespacelinear__probing.html">linear_probing</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="db/d82/classlarge__number.html">large_number</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="db/d82/classlarge__number.html">large_number</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> (others::postfix_expression)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> (others::postfix_expression)&#160;&#160;&#160;</td>
</tr> </tr>
@@ -119,48 +119,48 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<td rowspan="2" valign="bottom"><a name="letter_f"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;f&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_f"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;f&#160;&#160;</div></td></tr></table>
</td> </td>
<td valign="top"><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> (data_structures::linked_list)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> (data_structures::linked_list)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d8/dc8/struct_point.html">Point</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d1/dc2/classstack.html">stack</a>&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a>&#160;&#160;&#160;</td>
</tr> </tr>
<tr><td valign="top"><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d8/dc8/struct_point.html">Point</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="d9/d90/struct_btree.html">Btree</a>&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="d9/d90/struct_btree.html">Btree</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dd/d91/class_fenwick_tree.html">FenwickTree</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="dd/d91/class_fenwick_tree.html">FenwickTree</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d8/d10/structlist.html">list</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d8/d10/structlist.html">list</a>&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_q"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;q&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_q"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;q&#160;&#160;</div></td></tr></table>
</td> </td>
<td valign="top"><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)&#160;&#160;&#160;</td>
</tr> </tr>
<tr><td rowspan="2" valign="bottom"><a name="letter_c"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;c&#160;&#160;</div></td></tr></table> <tr><td rowspan="2" valign="bottom"><a name="letter_c"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;c&#160;&#160;</div></td></tr></table>
</td> </td>
<td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;g&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_g"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;g&#160;&#160;</div></td></tr></table>
</td> </td>
<td valign="top"><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> (data_structures::linked_list)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> (data_structures::linked_list)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dd/d1b/structquery.html">query</a>&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_t"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;t&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_t"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;t&#160;&#160;</div></td></tr></table>
</td> </td>
</tr> </tr>
<tr><td valign="top"><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dd/d1b/structquery.html">query</a>&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="d5/d15/classcll.html">cll</a>&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="d5/d15/classcll.html">cll</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="da/d9a/class_graph.html">Graph</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">Graph</a> (graph::is_graph_bipartite)&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_m"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;m&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_m"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;m&#160;&#160;</div></td></tr></table>
</td> </td>
<td valign="top"><a class="el" href="dc/db5/struct_queue.html">Queue</a>&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="d1/db3/structcompare.html">compare</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dc/d61/classgraph_1_1_graph.html">Graph</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="db/da9/classqueue.html">queue</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="db/da9/classqueue.html">queue</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d2/d2c/structtower.html">tower</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d2/d2c/structtower.html">tower</a>&#160;&#160;&#160;</td>
</tr> </tr>
<tr><td valign="top"><a class="el" href="d1/db3/structcompare.html">compare</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="da/d9a/class_graph.html">Graph</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="dc/db5/struct_queue.html">Queue</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a> (range_queries::heavy_light_decomposition)&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="da/d5a/class_complex.html">Complex</a>&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="da/d5a/class_complex.html">Complex</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">Graph</a> (graph::is_graph_bipartite)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="dc/d61/classgraph_1_1_graph.html">Graph</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a> (range_queries::heavy_light_decomposition)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d0/d3e/classdata__structures_1_1trie.html">trie</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)&#160;&#160;&#160;</td>
</tr> </tr>
<tr><td valign="top"><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_h"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;h&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_h"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;h&#160;&#160;</div></td></tr></table>
@@ -172,7 +172,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
</tr> </tr>
<tr><td valign="top"><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a>&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d1/d77/structmst.html">mst</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d1/d77/structmst.html">mst</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d0/d3e/classdata__structures_1_1trie.html">trie</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a>&#160;&#160;&#160;</td>
</tr> </tr>
<tr><td rowspan="2" valign="bottom"><a name="letter_d"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;d&#160;&#160;</div></td></tr></table> <tr><td rowspan="2" valign="bottom"><a name="letter_d"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;d&#160;&#160;</div></td></tr></table>
</td> </td>
@@ -180,29 +180,30 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;n&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_n"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;n&#160;&#160;</div></td></tr></table>
</td> </td>
<td valign="top"><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a>&#160;&#160;&#160;</td> <td></td></tr>
</tr>
<tr><td valign="top"><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html">HillCipher</a> (<a class="el" href="d6/d4e/namespaceciphers.html">ciphers</a>)&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html">HillCipher</a> (<a class="el" href="d6/d4e/namespaceciphers.html">ciphers</a>)&#160;&#160;&#160;</td>
<td rowspan="2" valign="bottom"><a name="letter_s"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;s&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_s"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;s&#160;&#160;</div></td></tr></table>
</td> </td>
<td></td></tr> <td></td></tr>
<tr><td valign="top"><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html">HKGraph</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)&#160;&#160;&#160;</td>
<td></td></tr> <td></td></tr>
<tr><td valign="top"><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a>&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD</a> (range_queries::heavy_light_decomposition)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html">HLD</a> (range_queries::heavy_light_decomposition)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a>&#160;&#160;&#160;</td>
<td></td></tr> <td></td></tr>
<tr><td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;e&#160;&#160;</div></td></tr></table> <tr><td rowspan="2" valign="bottom"><a name="letter_e"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;e&#160;&#160;</div></td></tr></table>
</td> </td>
<td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;i&#160;&#160;</div></td></tr></table> <td rowspan="2" valign="bottom"><a name="letter_i"></a><table border="0" cellspacing="0" cellpadding="0"><tr><td><div class="ah">&#160;&#160;i&#160;&#160;</div></td></tr></table>
</td> </td>
<td valign="top"><a class="el" href="d5/da1/structnode.html">node</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="db/d8b/struct_node.html">Node</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a> (range_queries::heavy_light_decomposition)&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a> (range_queries::heavy_light_decomposition)&#160;&#160;&#160;</td>
<td></td></tr> <td></td></tr>
<tr><td></td><td></td><td></td></tr> <tr><td valign="top"><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)&#160;&#160;&#160;</td>
<td></td></tr>
<tr><td valign="top"><a class="el" href="d7/d77/class_edge.html">Edge</a>&#160;&#160;&#160;</td> <tr><td valign="top"><a class="el" href="d7/d77/class_edge.html">Edge</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="db/d66/struct_item.html">Item</a>&#160;&#160;&#160;</td> <td valign="top"><a class="el" href="db/d66/struct_item.html">Item</a>&#160;&#160;&#160;</td>
<td></td><td></td><td></td></tr> <td></td><td></td><td></td></tr>

4
d0/d58/classgraph_1_1_rooted_tree.html
View File

@@ -120,8 +120,8 @@ Public Member Functions</h2></td></tr>
<tr class="inherit_header pub_methods_classgraph_1_1_graph"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr> <tr class="inherit_header pub_methods_classgraph_1_1_graph"><td colspan="2" onclick="javascript:toggleInherit('pub_methods_classgraph_1_1_graph')"><img src="../../closed.png" alt="-"/>&#160;Public Member Functions inherited from <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td></tr>
<tr class="memitem:a877b2cba40d8d46dde6fb4209effed19 inherit pub_methods_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a> (T u, T v, bool bidir=true)</td></tr> <tr class="memitem:a877b2cba40d8d46dde6fb4209effed19 inherit pub_methods_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a> (T u, T v, bool bidir=true)</td></tr>
<tr class="separator:a877b2cba40d8d46dde6fb4209effed19 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a877b2cba40d8d46dde6fb4209effed19 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6e3efabd5e401ef0f47c179866e7454e inherit pub_methods_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a6e3efabd5e401ef0f47c179866e7454e">breadth_first_search</a> (T src)</td></tr> <tr class="memitem:ab1a1a96cd4cddf0d4feb02855c4c16af inherit pub_methods_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ab1a1a96cd4cddf0d4feb02855c4c16af">breadth_first_search</a> (T src)</td></tr>
<tr class="separator:a6e3efabd5e401ef0f47c179866e7454e inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:ab1a1a96cd4cddf0d4feb02855c4c16af inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a> (size_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges)</td></tr> <tr class="memitem:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a> (size_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges)</td></tr>
<tr class="memdesc:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph"><td class="mdescLeft">&#160;</td><td class="mdescRight">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices. <a href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">More...</a><br /></td></tr> <tr class="memdesc:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph"><td class="mdescLeft">&#160;</td><td class="mdescRight">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices. <a href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">More...</a><br /></td></tr>
<tr class="separator:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a8839fa14bff19d2deab4a618447c13e5 inherit pub_methods_classgraph_1_1_graph"><td class="memSeparator" colspan="2">&#160;</td></tr>

8
d1/d52/lcm__sum_8cpp__incl.map
View File

@@ -1,6 +1,6 @@
<map id="math/lcm_sum.cpp" name="math/lcm_sum.cpp"> <map id="math/lcm_sum.cpp" name="math/lcm_sum.cpp">
<area shape="rect" id="node1" title="An algorithm to calculate the sum of LCM: ." alt="" coords="68,5,201,32"/> <area shape="rect" id="node1" title="An algorithm to calculate the sum of LCM: ." alt="" coords="65,5,198,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,77,107"/> <area shape="rect" id="node2" title=" " alt="" coords="5,80,71,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="102,80,167,107"/> <area shape="rect" id="node3" title=" " alt="" coords="95,80,167,107"/>
<area shape="rect" id="node4" title=" " alt="" coords="192,80,251,107"/> <area shape="rect" id="node4" title=" " alt="" coords="191,80,250,107"/>
</map> </map>

2
d1/d52/lcm__sum_8cpp__incl.md5
View File

@@ -1 +1 @@
acc4337c653d091bda98ad7d1e66fdae 09ae301aa1edf1f178eb8d1fbe3b49ea

32
d1/d52/lcm__sum_8cpp__incl.svg
View File

@@ -5,16 +5,16 @@
--> -->
<!-- Title: math/lcm_sum.cpp Pages: 1 --> <!-- Title: math/lcm_sum.cpp Pages: 1 -->
<svg width="192pt" height="84pt" <svg width="192pt" height="84pt"
viewBox="0.00 0.00 192.00 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 191.50 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)">
<title>math/lcm_sum.cpp</title> <title>math/lcm_sum.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 188,-80 188,4 -4,4"/> <polygon fill="white" stroke="transparent" points="-4,4 -4,-80 187.5,-80 187.5,4 -4,4"/>
<!-- Node1 --> <!-- Node1 -->
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="An algorithm to calculate the sum of LCM: ."> <g id="a_node1"><a xlink:title="An algorithm to calculate the sum of LCM: .">
<polygon fill="#bfbfbf" stroke="black" points="47,-56.5 47,-75.5 147,-75.5 147,-56.5 47,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="44.5,-56.5 44.5,-75.5 144.5,-75.5 144.5,-56.5 44.5,-56.5"/>
<text text-anchor="middle" x="97" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/lcm_sum.cpp</text> <text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/lcm_sum.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -22,46 +22,46 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M85.75,-56.32C75.2,-48.18 59.2,-35.84 46.56,-26.09"/> <path fill="none" stroke="midnightblue" d="M83.25,-56.32C72.7,-48.18 56.7,-35.84 44.06,-26.09"/>
<polygon fill="midnightblue" stroke="midnightblue" points="48.51,-23.17 38.45,-19.83 44.23,-28.71 48.51,-23.17"/> <polygon fill="midnightblue" stroke="midnightblue" points="46.01,-23.17 35.95,-19.83 41.73,-28.71 46.01,-23.17"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72.5,-0.5 72.5,-19.5 121.5,-19.5 121.5,-0.5 72.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="67.5,-0.5 67.5,-19.5 121.5,-19.5 121.5,-0.5 67.5,-0.5"/>
<text text-anchor="middle" x="97" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text> <text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M97,-56.08C97,-49.01 97,-38.86 97,-29.99"/> <path fill="none" stroke="midnightblue" d="M94.5,-56.08C94.5,-49.01 94.5,-38.86 94.5,-29.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="100.5,-29.75 97,-19.75 93.5,-29.75 100.5,-29.75"/> <polygon fill="midnightblue" stroke="midnightblue" points="98,-29.75 94.5,-19.75 91,-29.75 98,-29.75"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:title=" "> <g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="140,-0.5 140,-19.5 184,-19.5 184,-0.5 140,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="139.5,-0.5 139.5,-19.5 183.5,-19.5 183.5,-0.5 139.5,-0.5"/>
<text text-anchor="middle" x="162" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text> <text text-anchor="middle" x="161.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M107.44,-56.32C117.15,-48.26 131.82,-36.08 143.5,-26.37"/> <path fill="none" stroke="midnightblue" d="M105.26,-56.32C115.27,-48.26 130.39,-36.08 142.43,-26.37"/>
<polygon fill="midnightblue" stroke="midnightblue" points="145.91,-28.92 151.37,-19.83 141.44,-23.53 145.91,-28.92"/> <polygon fill="midnightblue" stroke="midnightblue" points="144.95,-28.83 150.54,-19.83 140.56,-23.38 144.95,-28.83"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.8 KiB

After

Width:  |  Height:  |  Size: 2.8 KiB

6
d1/d6d/queue__using__array_8cpp__incl.map
View File

@@ -1,5 +1,5 @@
<map id="data_structures/queue_using_array.cpp" name="data_structures/queue_using_array.cpp"> <map id="data_structures/queue_using_array.cpp" name="data_structures/queue_using_array.cpp">
<area shape="rect" id="node1" title="Implementation of Linear Queue using array." alt="" coords="9,5,159,47"/> <area shape="rect" id="node1" title="Implementation of Linear Queue using array." alt="" coords="5,5,156,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/> <area shape="rect" id="node2" title=" " alt="" coords="13,95,63,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,95,152,121"/> <area shape="rect" id="node3" title=" " alt="" coords="87,95,159,121"/>
</map> </map>

2
d1/d6d/queue__using__array_8cpp__incl.md5
View File

@@ -1 +1 @@
531e2cf0e1ec125b5b629a3919e25196 2cf082df046ba59d0e5b4301523a3680

22
d1/d6d/queue__using__array_8cpp__incl.svg
View File

@@ -13,9 +13,9 @@
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Implementation of Linear Queue using array."> <g id="a_node1"><a xlink:title="Implementation of Linear Queue using array.">
<polygon fill="#bfbfbf" stroke="black" points="2.5,-56.5 2.5,-86.5 115.5,-86.5 115.5,-56.5 2.5,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="0,-56.5 0,-86.5 113,-86.5 113,-56.5 0,-56.5"/>
<text text-anchor="start" x="10.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/queue</text> <text text-anchor="start" x="8" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/queue</text>
<text text-anchor="middle" x="59" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array.cpp</text> <text text-anchor="middle" x="56.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -23,31 +23,31 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="5.5,-0.5 5.5,-19.5 43.5,-19.5 43.5,-0.5 5.5,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M51.42,-56.4C46.96,-48.11 41.28,-37.55 36.52,-28.71"/> <path fill="none" stroke="midnightblue" d="M48.92,-56.4C44.46,-48.11 38.78,-37.55 34.02,-28.71"/>
<polygon fill="midnightblue" stroke="midnightblue" points="39.48,-26.81 31.66,-19.66 33.31,-30.12 39.48,-26.81"/> <polygon fill="midnightblue" stroke="midnightblue" points="36.98,-26.81 29.16,-19.66 30.81,-30.12 36.98,-26.81"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 110,-19.5 110,-0.5 72,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="61.5,-0.5 61.5,-19.5 115.5,-19.5 115.5,-0.5 61.5,-0.5"/>
<text text-anchor="middle" x="91" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text> <text text-anchor="middle" x="88.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M66.58,-56.4C71.04,-48.11 76.72,-37.55 81.48,-28.71"/> <path fill="none" stroke="midnightblue" d="M64.08,-56.4C68.54,-48.11 74.22,-37.55 78.98,-28.71"/>
<polygon fill="midnightblue" stroke="midnightblue" points="84.69,-30.12 86.34,-19.66 78.52,-26.81 84.69,-30.12"/> <polygon fill="midnightblue" stroke="midnightblue" points="82.19,-30.12 83.84,-19.66 76.02,-26.81 82.19,-30.12"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.4 KiB

After

Width:  |  Height:  |  Size: 2.4 KiB

151
d1/da6/rungekutta_8cpp.html
View File

@@ -100,9 +100,9 @@ $(document).ready(function(){initNavTree('d1/da6/rungekutta_8cpp.html','../../')
<p><a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods">Runge Kutta fourth order</a> method implementation <p><a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods">Runge Kutta fourth order</a> method implementation
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br /> <code>#include &lt;vector&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for rungekutta.cpp:</div> Include dependency graph for rungekutta.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -126,7 +126,7 @@ Functions</h2></td></tr>
<tr class="separator:a7b9f40c7b5e9749cc550f19be3dc8856"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a7b9f40c7b5e9749cc550f19be3dc8856"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr><td colspan="2"><div class="groupHeader"></div></td></tr> <tr><td colspan="2"><div class="groupHeader"></div></td></tr>
<tr class="memitem:a450497475f5607333f9aca8f88901579"><td class="memItemLeft" align="right" valign="top">static double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a> (double x, double y)</td></tr> <tr class="memitem:a450497475f5607333f9aca8f88901579"><td class="memItemLeft" align="right" valign="top">static double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a> (double x, double y)</td></tr>
<tr class="memdesc:a450497475f5607333f9aca8f88901579"><td class="mdescLeft">&#160;</td><td class="mdescRight">asserting the test functions <a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">More...</a><br /></td></tr> <tr class="memdesc:a450497475f5607333f9aca8f88901579"><td class="mdescLeft">&#160;</td><td class="mdescRight">for using the vector container <a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">More...</a><br /></td></tr>
<tr class="separator:a450497475f5607333f9aca8f88901579"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a450497475f5607333f9aca8f88901579"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr> <tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests to check algorithm implementation. <a href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr> <tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Tests to check algorithm implementation. <a href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
@@ -174,9 +174,9 @@ Functions</h2></td></tr>
</table> </table>
</div><div class="memdoc"> </div><div class="memdoc">
<p>asserting the test functions </p> <p>for using the vector container </p>
<p>for io operations for using the vector container</p> <p>asserting the test functions for io operations</p>
<p>The <a class="el" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" title="asserting the test functions">change()</a> function is used to return the updated iterative value corresponding to the given function </p><dl class="params"><dt>Parameters</dt><dd> <p>The <a class="el" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" title="for using the vector container">change()</a> function is used to return the updated iterative value corresponding to the given function </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params"> <table class="params">
<tr><td class="paramname">x</td><td>is the value corresponding to the x coordinate </td></tr> <tr><td class="paramname">x</td><td>is the value corresponding to the x coordinate </td></tr>
<tr><td class="paramname">y</td><td>is the value corresponding to the y coordinate </td></tr> <tr><td class="paramname">y</td><td>is the value corresponding to the y coordinate </td></tr>
@@ -186,10 +186,7 @@ Functions</h2></td></tr>
<dl class="section return"><dt>Returns</dt><dd>the computed function value at that call </dd></dl> <dl class="section return"><dt>Returns</dt><dd>the computed function value at that call </dd></dl>
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a0">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd> <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a0">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd>
</dl> </dl>
<div class="fragment"><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>&#160;{ </div> <div class="fragment"><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160;{ <span class="keywordflow">return</span> ((x - y) / 2.0); }</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; <span class="keywordflow">return</span> ((x - y)/2.0); </div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; </div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160;} </div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
@@ -211,11 +208,10 @@ Functions</h2></td></tr>
<p>Main function. </p> <p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160;{ </div> <div class="fragment"><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; {</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; </div> <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; <a class="code" href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// Execute the tests</span></div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <a class="code" href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// Execute the tests</span></div> <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="keywordflow">return</span> 0; </div> <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160;}</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160;} </div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -276,47 +272,41 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>the value of y at thr required value of x from the initial conditions </dd></dl> <dl class="section return"><dt>Returns</dt><dd>the value of y at thr required value of x from the initial conditions </dd></dl>
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd> <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/numerical_methods/rungekutta.cpp</a>.</dd>
</dl> </dl>
<div class="fragment"><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;{ </div> <div class="fragment"><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; {</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; </div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="comment">// Count number of iterations</span></div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="comment">// Count number of iterations </span></div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="comment">// using step size or</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="comment">// using step size or </span></div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="comment">// step height h</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="comment">// step height h </span></div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; </div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; </div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="comment">// n calucates the number of iterations</span></div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; </div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="comment">// k1, k2, k3, k4 are the Runge Kutta variables</span></div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="comment">// n calucates the number of iterations</span></div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="comment">// used for calculation of y at each iteration</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="comment">// k1, k2, k3, k4 are the Runge Kutta variables </span></div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; </div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="comment">// used for calculation of y at each iteration</span></div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <span class="keyword">auto</span> n = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((x - init_x) / <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; </div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="comment">// used a vector container for the variables</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keyword">auto</span> n = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((x - init_x) / <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>); </div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> k(4, 0.0);</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <span class="comment">// used a vector container for the variables</span></div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; </div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> k(4,0.0);</div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="comment">// Iterate for number of iterations</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; </div> <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; </div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; </div> <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keywordtype">double</span> y = init_y;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="comment">// Iterate for number of iterations </span></div> <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; ++i) {</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; </div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <span class="comment">// Apply Runge Kutta Formulas</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <span class="keywordtype">double</span> y = init_y; </div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="comment">// to find next value of y</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=1; i&lt;=n; ++i) </div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; k[0] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x, y);</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; { </div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; k[1] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5 * <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5 * k[0]);</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; </div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; k[2] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5 * <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5 * k[1]);</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="comment">// Apply Runge Kutta Formulas </span></div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; k[3] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + k[2]);</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="comment">// to find next value of y </span></div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; </div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; k[0] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>*<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x, y); </div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="comment">// Update next value of y</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; k[1] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>*<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5*<a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5*k[0]); </div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; </div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; k[2] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>*<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5*<a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5*k[1]); </div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; y += (1.0 / 6.0) * (k[0] + 2 * k[1] + 2 * k[2] + k[3]);</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; k[3] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>*<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + k[2]); </div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; </div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; </div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="comment">// Update next value of x</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; </div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; </div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="comment">// Update next value of y </span></div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; init_x += <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; </div> <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; }</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; y += (1.0/6.0)*(k[0] + 2*k[1] + 2*k[2] + k[3]);</div> <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; </div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; </div> <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="keywordflow">return</span> y;</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="comment">// Update next value of x </span></div> <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160;}</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; </div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; init_x += <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>; </div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; } </div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; </div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="keywordflow">return</span> y; </div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160;} </div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -351,24 +341,31 @@ Here is the call graph for this function:</div>
<p>Tests to check algorithm implementation. </p> <p>Tests to check algorithm implementation. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; {</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of precomputed values\n&quot;</span>;</div> <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of &quot;</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; </div> <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; <span class="stringliteral">&quot;precomputed values\n&quot;</span>;</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; </div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordtype">double</span> valfirst=<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(2,3,4,0.2); <span class="comment">// Tests the function with pre calculated values</span></div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; assert(valfirst==3.10363932323749570);</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keywordtype">double</span> valfirst = <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; </div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; 2, 3, 4, 0.2); <span class="comment">// Tests the function with pre calculated values</span></div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; assert(valfirst == 3.10363932323749570);</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keywordtype">double</span> valsec=<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(1,2,5,0.1); <span class="comment">// The value of step changed</span></div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; assert(valsec==3.40600589380261409);</div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; </div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; </div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <span class="keywordtype">double</span> valsec = <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keywordtype">double</span> valthird=<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(-1,3,4,0.1); <span class="comment">// Tested with negative value</span></div> <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; 1, 2, 5, 0.1); <span class="comment">// The value of step changed</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; assert(valthird==2.49251005860244268);</div> <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; assert(valsec == 3.40600589380261409);</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div> <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; }</div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; </div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span></div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keywordtype">double</span> valthird = <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; -1, 3, 4, 0.1); <span class="comment">// Tested with negative value</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; assert(valthird == 2.49251005860244268);</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160;}</div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
@@ -377,9 +374,9 @@ Here is the call graph for this function:</div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; double &gt;</a></div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; double &gt;</a></div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div> <div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">asserting the test functions</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:31</div></div> <div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">for using the vector container</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:33</div></div>
<div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:56</div></div> <div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:57</div></div>
<div class="ttc" id="arungekutta_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Tests to check algorithm implementation.</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:105</div></div> <div class="ttc" id="arungekutta_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Tests to check algorithm implementation.</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:100</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

2
d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.map
View File

@@ -1,5 +1,5 @@
<map id="numerical_methods::runge_kutta::rungeKutta" name="numerical_methods::runge_kutta::rungeKutta"> <map id="numerical_methods::runge_kutta::rungeKutta" name="numerical_methods::runge_kutta::rungeKutta">
<area shape="rect" id="node1" title="the Runge Kutta method finds the value of integration of a function in the given limits...." alt="" coords="5,29,167,71"/> <area shape="rect" id="node1" title="the Runge Kutta method finds the value of integration of a function in the given limits...." alt="" coords="5,29,167,71"/>
<area shape="rect" id="node2" href="$d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" title="asserting the test functions" alt="" coords="215,11,279,38"/> <area shape="rect" id="node2" href="$d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" title="for using the vector container" alt="" coords="215,11,279,38"/>
<area shape="rect" id="node3" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="227,62,266,89"/> <area shape="rect" id="node3" href="$d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001" title=" " alt="" coords="227,62,266,89"/>
</map> </map>

2
d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.md5
View File

@@ -1 +1 @@
b6f029e30ef280b3989d6def4d5f776b 746dae0baf8790ac88152850876f7391

2
d1/da6/rungekutta_8cpp_a7b9f40c7b5e9749cc550f19be3dc8856_cgraph.svg
View File

@@ -28,7 +28,7 @@
<!-- Node2 --> <!-- Node2 -->
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" target="_top" xlink:title="asserting the test functions"> <g id="a_node2"><a xlink:href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579" target="_top" xlink:title="for using the vector container">
<polygon fill="white" stroke="black" points="157,-38.5 157,-57.5 205,-57.5 205,-38.5 157,-38.5"/> <polygon fill="white" stroke="black" points="157,-38.5 157,-57.5 205,-57.5 205,-38.5 157,-38.5"/>
<text text-anchor="middle" x="181" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">change</text> <text text-anchor="middle" x="181" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">change</text>
</a> </a>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.0 KiB

After

Width:  |  Height:  |  Size: 3.0 KiB

59
d1/dbb/n__choose__r_8cpp.html
View File

@@ -100,8 +100,8 @@ $(document).ready(function(){initNavTree('d1/dbb/n__choose__r_8cpp.html','../../
<p><a href="https://en.wikipedia.org/wiki/Combination">Combinations</a> n choose r function implementation <p><a href="https://en.wikipedia.org/wiki/Combination">Combinations</a> n choose r function implementation
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br /> <code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for n_choose_r.cpp:</div> Include dependency graph for n_choose_r.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -168,10 +168,10 @@ Functions</h2></td></tr>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; {</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <a class="code" href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// executing tests</span></div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <a class="code" href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// executing tests</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160;}</div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -206,28 +206,27 @@ Here is the call graph for this function:</div>
<p>Test implementations. </p> <p>Test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; {</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="comment">// First test on 5 choose 2</span></div> <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="comment">// First test on 5 choose 2</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; uint8_t t = <a class="code" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(5, 2);</div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; uint8_t t = <a class="code" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(5, 2);</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;10 is the answer but function says otherwise.\n&quot;</span>,</div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;10 is the answer but function says otherwise.\n&quot;</span>, t == 10));</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; t == 10));</div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;First test passes.&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="comment">// Second test on 5 choose 3</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="comment">// Second test on 5 choose 3</span></div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; t = <a class="code" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(5, 3);</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; t = <a class="code" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(5, 3);</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; assert(</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;10 is the answer but the function says otherwise.\n&quot;</span>,</div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; ((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;10 is the answer but the function says otherwise.\n&quot;</span>, t == 10));</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; t == 10));</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Second test passes.&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="comment">// Third test on 3 choose 2</span></div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="comment">// Third test on 3 choose 2</span></div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; t = <a class="code" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(3, 2);</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; t = <a class="code" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(3, 2);</div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; assert(</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;3 is the answer but the function says otherwise.\n&quot;</span>,</div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; ((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;3 is the answer but the function says otherwise.\n&quot;</span>, t == 3));</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; t == 3));</div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Third test passes.&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <span class="comment">// Fourth test on 10 choose 4</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="comment">// Fourth test on 10 choose 4</span></div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; t = <a class="code" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(10, 4);</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; t = <a class="code" href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a>(10, 4);</div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;210 is the answer but the function says otherwise.\n&quot;</span>,</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; assert(((<span class="keywordtype">void</span>)<span class="stringliteral">&quot;210 is the answer but the function says otherwise.\n&quot;</span>,</div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; t == 210));</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; t == 210));</div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Fourth test passes.&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160;}</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -239,9 +238,9 @@ Here is the call graph for this function:</div>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:49</div></div> <div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:52</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="anamespacemath_html_a6e2dff75c5de70455b90c799d6ad6967"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a></div><div class="ttdeci">T n_choose_r(T n, T r)</div><div class="ttdoc">This is the function implementation of .</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:33</div></div> <div class="ttc" id="anamespacemath_html_a6e2dff75c5de70455b90c799d6ad6967"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a></div><div class="ttdeci">T n_choose_r(T n, T r)</div><div class="ttdoc">This is the function implementation of .</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:35</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div> <div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

2
d1/dbe/lu__decomposition_8h.html
View File

@@ -319,7 +319,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt; double &gt;</a></div></div> <div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt; double &gt;</a></div></div>
<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition:</b> lu_decomposition.h:29</div></div> <div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition:</b> lu_decomposition.h:29</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

30
d1/dbe/lu__decomposition_8h_source.html
View File

@@ -200,11 +200,12 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a024b8bc4755863315456d573a6732377"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">check_termination</a></div><div class="ttdeci">bool check_termination(long double delta)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:91</div></div> <div class="ttc" id="adurand__kerner__roots_8cpp_html_a024b8bc4755863315456d573a6732377"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a024b8bc4755863315456d573a6732377">check_termination</a></div><div class="ttdeci">bool check_termination(long double delta)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:91</div></div>
<div class="ttc" id="asqrt__double_8cpp_html_ae662282ad0740d2063ac404ca3bd74fc"><div class="ttname"><a href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a></div><div class="ttdeci">double Sqrt(double a)</div><div class="ttdef"><b>Definition:</b> sqrt_double.cpp:16</div></div> <div class="ttc" id="asqrt__double_8cpp_html_ae662282ad0740d2063ac404ca3bd74fc"><div class="ttname"><a href="../../da/d24/sqrt__double_8cpp.html#ae662282ad0740d2063ac404ca3bd74fc">Sqrt</a></div><div class="ttdeci">double Sqrt(double a)</div><div class="ttdef"><b>Definition:</b> sqrt_double.cpp:16</div></div>
<div class="ttc" id="ancr__modulo__p_8cpp_html_af0a3e6827f41c151e47451f5ff98b1f1"><div class="ttname"><a href="../../de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">tests</a></div><div class="ttdeci">static void tests(math::ncr_modulo_p::NCRModuloP ncrObj)</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:124</div></div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div> <div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:70</div></div> <div class="ttc" id="anumber__of__positive__divisors_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> number_of_positive_divisors.cpp:70</div></div>
<div class="ttc" id="aleast__common__multiple_8cpp_html_aa8d0e241db517813725e721a152e3a25"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a></div><div class="ttdeci">unsigned int lcm(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:43</div></div> <div class="ttc" id="aleast__common__multiple_8cpp_html_aa8d0e241db517813725e721a152e3a25"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#aa8d0e241db517813725e721a152e3a25">lcm</a></div><div class="ttdeci">unsigned int lcm(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:43</div></div>
<div class="ttc" id="aleast__common__multiple_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:50</div></div> <div class="ttc" id="aleast__common__multiple_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:50</div></div>
<div class="ttc" id="anamespacemath_html_a04065193d190d605e1f0d0d93a87e244"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a></div><div class="ttdeci">uint64_t lcmSum(const uint16_t &amp;num)</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:28</div></div> <div class="ttc" id="anamespacemath_html_a04065193d190d605e1f0d0d93a87e244"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a></div><div class="ttdeci">uint64_t lcmSum(const uint16_t &amp;num)</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:29</div></div>
<div class="ttc" id="aprime__factorization_8cpp_html_af097796783684712b8326e5b82bfd4fe"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a></div><div class="ttdeci">std::vector&lt; int &gt; prime_numbers</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:16</div></div> <div class="ttc" id="aprime__factorization_8cpp_html_af097796783684712b8326e5b82bfd4fe"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_numbers</a></div><div class="ttdeci">std::vector&lt; int &gt; prime_numbers</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:16</div></div>
<div class="ttc" id="aprimes__up__to__billion_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> primes_up_to_billion.cpp:26</div></div> <div class="ttc" id="aprimes__up__to__billion_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> primes_up_to_billion.cpp:26</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_a7e7a1a2b0a03df0a70cac40d193421d2"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#a7e7a1a2b0a03df0a70cac40d193421d2">statistics::stats_computer2::operator&gt;&gt;</a></div><div class="ttdeci">friend std::istream &amp; operator&gt;&gt;(std::istream &amp;input, stats_computer2 &amp;stat)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:97</div></div> <div class="ttc" id="aclassstatistics_1_1stats__computer2_html_a7e7a1a2b0a03df0a70cac40d193421d2"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#a7e7a1a2b0a03df0a70cac40d193421d2">statistics::stats_computer2::operator&gt;&gt;</a></div><div class="ttdeci">friend std::istream &amp; operator&gt;&gt;(std::istream &amp;input, stats_computer2 &amp;stat)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:97</div></div>
@@ -215,28 +216,30 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="auniform_int_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution</a></div></div> <div class="ttc" id="auniform_int_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution</a></div></div>
<div class="ttc" id="aprime__numbers_8cpp_html_a3b91f208e8365c95a295cfe3e67df5c3"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(int max)</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:12</div></div> <div class="ttc" id="aprime__numbers_8cpp_html_a3b91f208e8365c95a295cfe3e67df5c3"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#a3b91f208e8365c95a295cfe3e67df5c3">primes</a></div><div class="ttdeci">std::vector&lt; int &gt; primes(int max)</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:12</div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:125</div></div> <div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:125</div></div>
<div class="ttc" id="afalse__position_8cpp_html_a7d69b49dc37da1c02b3ab8c7fe783494"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494">numerical_methods::false_position::regula_falsi</a></div><div class="ttdeci">static float regula_falsi(float x1, float x2, float y1, float y2)</div><div class="ttdoc">This function finds root of the equation in given interval i.e. (x1,x2).</div><div class="ttdef"><b>Definition:</b> false_position.cpp:54</div></div> <div class="ttc" id="afalse__position_8cpp_html_a7d69b49dc37da1c02b3ab8c7fe783494"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a7d69b49dc37da1c02b3ab8c7fe783494">numerical_methods::false_position::regula_falsi</a></div><div class="ttdeci">static float regula_falsi(float x1, float x2, float y1, float y2)</div><div class="ttdoc">This function finds root of the equation in given interval i.e. (x1,x2).</div><div class="ttdef"><b>Definition:</b> false_position.cpp:55</div></div>
<div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div> <div class="ttc" id="aclock_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock_t.html">std::clock_t</a></div></div>
<div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for io operations</div></div> <div class="ttc" id="anamespacenumerical__methods_html"><div class="ttname"><a href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a></div><div class="ttdoc">for io operations</div></div>
<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition:</b> gcd_iterative_euclidean.cpp:15</div></div>
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:592</div></div> <div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:592</div></div>
<div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div> <div class="ttc" id="apair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></div></div>
<div class="ttc" id="abrent__method__extrema_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:204</div></div> <div class="ttc" id="abrent__method__extrema_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:204</div></div>
<div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div> <div class="ttc" id="acos_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/cos.html">std::cos</a></div><div class="ttdeci">T cos(T... args)</div></div>
<div class="ttc" id="abrent__method__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:23</div></div> <div class="ttc" id="abrent__method__extrema_8cpp_html_a002b2f4894492820fe708b1b7e7c5e70"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a002b2f4894492820fe708b1b7e7c5e70">EPSILON</a></div><div class="ttdeci">#define EPSILON</div><div class="ttdoc">system accuracy limit</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:23</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; uint64_t &gt;</a></div></div>
<div class="ttc" id="alu__decompose_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition:</b> lu_decompose.cpp:66</div></div> <div class="ttc" id="alu__decompose_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../dd/d65/lu__decompose_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition:</b> lu_decompose.cpp:66</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div> <div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">math::ncr_modulo_p::NCRModuloP</a></div><div class="ttdoc">Class which contains all methods required for calculating nCr mod p.</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:31</div></div>
<div class="ttc" id="amodular__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> modular_exponentiation.cpp:60</div></div> <div class="ttc" id="amodular__exponentiation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/d6d/modular__exponentiation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> modular_exponentiation.cpp:60</div></div>
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:25</div></div> <div class="ttc" id="apower__for__huge__numbers_8cpp_html_aa141a7904f0c4668bac112d652a3acf9"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#aa141a7904f0c4668bac112d652a3acf9">multiply</a></div><div class="ttdeci">int multiply(int x, int res[], int res_size)</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:25</div></div>
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:549</div></div> <div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:549</div></div>
<div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:49</div></div> <div class="ttc" id="an__choose__r_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/dbb/n__choose__r_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:52</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div> <div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:65</div></div> <div class="ttc" id="asieve__of__eratosthenes_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:65</div></div>
<div class="ttc" id="afalse__position_8cpp_html_a85a6ec58b5064d63d4f0df3854496713"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713">numerical_methods::false_position::eq</a></div><div class="ttdeci">static float eq(float x)</div><div class="ttdoc">This function gives the value of f(x) for given x.</div><div class="ttdef"><b>Definition:</b> false_position.cpp:44</div></div> <div class="ttc" id="afalse__position_8cpp_html_a85a6ec58b5064d63d4f0df3854496713"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713">numerical_methods::false_position::eq</a></div><div class="ttdeci">static float eq(float x)</div><div class="ttdoc">This function gives the value of f(x) for given x.</div><div class="ttdef"><b>Definition:</b> false_position.cpp:44</div></div>
<div class="ttc" id="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:65</div></div> <div class="ttc" id="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:65</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a60fa6579eab0db3c1c0ab1bf6d651be3"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve</a></div><div class="ttdeci">std::vector&lt; bool &gt; sieve(uint32_t N)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:26</div></div> <div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a60fa6579eab0db3c1c0ab1bf6d651be3"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve</a></div><div class="ttdeci">std::vector&lt; bool &gt; sieve(uint32_t N)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:26</div></div>
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a3bada3e58ad8d1b00918db2ffe83a740"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740">complex_str</a></div><div class="ttdeci">const char * complex_str(const std::complex&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:76</div></div> <div class="ttc" id="adurand__kerner__roots_8cpp_html_a3bada3e58ad8d1b00918db2ffe83a740"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a3bada3e58ad8d1b00918db2ffe83a740">complex_str</a></div><div class="ttdeci">const char * complex_str(const std::complex&lt; double &gt; &amp;x)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:76</div></div>
<div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> sum_of_binomial_coefficient.cpp:36</div></div> <div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> sum_of_binomial_coefficient.cpp:37</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function in the interval Expected result: .</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:123</div></div> <div class="ttc" id="agolden__search__extrema_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdoc">Test function to find maxima for the function in the interval Expected result: .</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:123</div></div>
<div class="ttc" id="abrent__method__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the real root of a function in the given interval.</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:35</div></div> <div class="ttc" id="abrent__method__extrema_8cpp_html_a1aa76a6d5fd4d333f9072beff1dc486b"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">get_minima</a></div><div class="ttdeci">double get_minima(const std::function&lt; double(double)&gt; &amp;f, double lim_a, double lim_b)</div><div class="ttdoc">Get the real root of a function in the given interval.</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:35</div></div>
<div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div> <div class="ttc" id="asetfill_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setfill.html">std::setfill</a></div><div class="ttdeci">T setfill(T... args)</div></div>
@@ -244,11 +247,12 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="abisection__method_8cpp_html_a1ab31b90bc584c635ec159468ceed9b2"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2">sgn</a></div><div class="ttdeci">int sgn(T val)</div><div class="ttdef"><b>Definition:</b> bisection_method.cpp:32</div></div> <div class="ttc" id="abisection__method_8cpp_html_a1ab31b90bc584c635ec159468ceed9b2"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2">sgn</a></div><div class="ttdeci">int sgn(T val)</div><div class="ttdef"><b>Definition:</b> bisection_method.cpp:32</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_af57e942d49f4fd70f059f224b4ac07e1"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">statistics::stats_computer1::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:48</div></div> <div class="ttc" id="aclassstatistics_1_1stats__computer1_html_af57e942d49f4fd70f059f224b4ac07e1"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">statistics::stats_computer1::std</a></div><div class="ttdeci">double std() const</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:48</div></div>
<div class="ttc" id="aprime__factorization_8cpp_html_acfb0df439a4beae5a34ef131ce737c1b"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b">factors</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int, int &gt; &gt; factors</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:19</div></div> <div class="ttc" id="aprime__factorization_8cpp_html_acfb0df439a4beae5a34ef131ce737c1b"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#acfb0df439a4beae5a34ef131ce737c1b">factors</a></div><div class="ttdeci">std::vector&lt; std::pair&lt; int, int &gt; &gt; factors</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:19</div></div>
<div class="ttc" id="an__choose__r_8cpp_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:78</div></div> <div class="ttc" id="an__choose__r_8cpp_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:80</div></div>
<div class="ttc" id="aprime__factorization_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:62</div></div> <div class="ttc" id="aprime__factorization_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> prime_factorization.cpp:62</div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_a798398d5bfd375a3c0ce68100842f6f5"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a798398d5bfd375a3c0ce68100842f6f5">reverse_binary</a></div><div class="ttdeci">std::vector&lt; T &gt; reverse_binary(T num)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:19</div></div> <div class="ttc" id="amiller__rabin_8cpp_html_a798398d5bfd375a3c0ce68100842f6f5"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a798398d5bfd375a3c0ce68100842f6f5">reverse_binary</a></div><div class="ttdeci">std::vector&lt; T &gt; reverse_binary(T num)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:19</div></div>
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div> <div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:56</div></div> <div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae249a2af508aa94266023ce8aa81426f"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power</a></div><div class="ttdeci">void power(int x, int n)</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:56</div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a57c168cd6eb85718eab97da658a698ad"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">math::ncr_modulo_p::NCRModuloP::p</a></div><div class="ttdeci">uint64_t p</div><div class="ttdoc">stores precomputed factorial(i) % p value</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:34</div></div>
<div class="ttc" id="agolden__search__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find minima for the function in the interval Expected result = 2.</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:78</div></div> <div class="ttc" id="agolden__search__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d6/d7a/golden__search__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find minima for the function in the interval Expected result = 2.</div><div class="ttdef"><b>Definition:</b> golden_search_extrema.cpp:78</div></div>
<div class="ttc" id="acheck__prime_8cpp_html_aa18b3517017d99bb4024853bddba5532"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a></div><div class="ttdeci">bool is_prime(T num)</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:22</div></div> <div class="ttc" id="acheck__prime_8cpp_html_aa18b3517017d99bb4024853bddba5532"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a></div><div class="ttdeci">bool is_prime(T num)</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:22</div></div>
<div class="ttc" id="aprime__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:26</div></div> <div class="ttc" id="aprime__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> prime_numbers.cpp:26</div></div>
@@ -271,16 +275,18 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="ainfinity_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html">std::numeric_limits::infinity</a></div><div class="ttdeci">T infinity(T... args)</div></div> <div class="ttc" id="ainfinity_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/numeric_limits/infinity.html">std::numeric_limits::infinity</a></div><div class="ttdeci">T infinity(T... args)</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="abasic_ofstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="afalse__position_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> false_position.cpp:106</div></div> <div class="ttc" id="afalse__position_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> false_position.cpp:102</div></div>
<div class="ttc" id="aisinf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html">std::isinf</a></div><div class="ttdeci">T isinf(T... args)</div></div> <div class="ttc" id="aisinf_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/isinf.html">std::isinf</a></div><div class="ttdeci">T isinf(T... args)</div></div>
<div class="ttc" id="alcm__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:96</div></div> <div class="ttc" id="alcm__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:96</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:89</div></div> <div class="ttc" id="aclassstatistics_1_1stats__computer2_html_af6198817084276113b3c064e87ce0555"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html#af6198817084276113b3c064e87ce0555">statistics::stats_computer2::variance</a></div><div class="ttdeci">double variance() const</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:89</div></div>
<div class="ttc" id="aleast__common__multiple_8cpp_html_a8ba1fc66e4134ab25b2602b323150563"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">gcd</a></div><div class="ttdeci">unsigned int gcd(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:16</div></div> <div class="ttc" id="aleast__common__multiple_8cpp_html_a8ba1fc66e4134ab25b2602b323150563"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#a8ba1fc66e4134ab25b2602b323150563">gcd</a></div><div class="ttdeci">unsigned int gcd(unsigned int x, unsigned int y)</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:16</div></div>
<div class="ttc" id="asqrt__double_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sqrt_double.cpp:42</div></div> <div class="ttc" id="asqrt__double_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d24/sqrt__double_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> sqrt_double.cpp:42</div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_af3d41271912f9fa50b774c96c51874b9"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9">math::ncr_modulo_p::NCRModuloP::NCRModuloP</a></div><div class="ttdeci">NCRModuloP(const uint64_t &amp;size, const uint64_t &amp;mod)</div><div class="ttdoc">the p from (nCr % p)</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:41</div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_ad6c2c67ea416d0e80003a88623f98b29"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a></div><div class="ttdeci">T modular_exponentiation(T base, const std::vector&lt; T &gt; &amp;rev_binary_exponent, T mod)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:43</div></div> <div class="ttc" id="amiller__rabin_8cpp_html_ad6c2c67ea416d0e80003a88623f98b29"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ad6c2c67ea416d0e80003a88623f98b29">modular_exponentiation</a></div><div class="ttdeci">T modular_exponentiation(T base, const std::vector&lt; T &gt; &amp;rev_binary_exponent, T mod)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:43</div></div>
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a51637ff89e55ca749993d3e84b95d153"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a51637ff89e55ca749993d3e84b95d153">poly_function</a></div><div class="ttdeci">std::complex&lt; double &gt; poly_function(const std::valarray&lt; double &gt; &amp;coeffs, std::complex&lt; double &gt; x)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:53</div></div> <div class="ttc" id="adurand__kerner__roots_8cpp_html_a51637ff89e55ca749993d3e84b95d153"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a51637ff89e55ca749993d3e84b95d153">poly_function</a></div><div class="ttdeci">std::complex&lt; double &gt; poly_function(const std::valarray&lt; double &gt; &amp;coeffs, std::complex&lt; double &gt; x)</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:53</div></div>
<div class="ttc" id="alu__decompose_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> lu_decompose.cpp:84</div></div> <div class="ttc" id="alu__decompose_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../dd/d65/lu__decompose_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> lu_decompose.cpp:84</div></div>
<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt; double &gt;</a></div></div> <div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt; double &gt;</a></div></div>
<div class="ttc" id="ancr__modulo__p_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dab/ncr__modulo__p_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:137</div></div>
<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div> <div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
<div class="ttc" id="adurand__kerner__roots_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:207</div></div> <div class="ttc" id="adurand__kerner__roots_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../da/df2/durand__kerner__roots_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.cpp:207</div></div>
<div class="ttc" id="agaussian__elimination_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gaussian_elimination.cpp:9</div></div> <div class="ttc" id="agaussian__elimination_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/de2/gaussian__elimination_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gaussian_elimination.cpp:9</div></div>
@@ -290,6 +296,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="aclassstatistics_1_1stats__computer2_html"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a></div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:72</div></div> <div class="ttc" id="aclassstatistics_1_1stats__computer2_html"><div class="ttname"><a href="../../d8/dab/classstatistics_1_1stats__computer2.html">statistics::stats_computer2</a></div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:72</div></div>
<div class="ttc" id="anamespacemath_html_a8d8e81a7cd59644b311ef9adb268f5f0"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a></div><div class="ttdeci">bool magic_number(const uint64_t &amp;n)</div><div class="ttdef"><b>Definition:</b> magic_number.cpp:32</div></div> <div class="ttc" id="anamespacemath_html_a8d8e81a7cd59644b311ef9adb268f5f0"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0">math::magic_number</a></div><div class="ttdeci">bool magic_number(const uint64_t &amp;n)</div><div class="ttdef"><b>Definition:</b> magic_number.cpp:32</div></div>
<div class="ttc" id="amagic__number_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition:</b> magic_number.cpp:51</div></div> <div class="ttc" id="amagic__number_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test function.</div><div class="ttdef"><b>Definition:</b> magic_number.cpp:51</div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a6b95277f5f527beacc8d0f3bc91fcd08"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08">math::ncr_modulo_p::NCRModuloP::ncr</a></div><div class="ttdeci">int64_t ncr(const uint64_t &amp;n, const uint64_t &amp;r, const uint64_t &amp;p)</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:92</div></div>
<div class="ttc" id="arealtime__stats_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:158</div></div> <div class="ttc" id="arealtime__stats_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:158</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector&lt; bool &gt; &amp;is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div> <div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a235843bdf82d2a6cc8596ae8fd3b8df9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a235843bdf82d2a6cc8596ae8fd3b8df9">print</a></div><div class="ttdeci">void print(uint32_t N, const std::vector&lt; bool &gt; &amp;is_prime)</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:44</div></div>
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div> <div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
@@ -302,10 +309,10 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="amiller__rabin_8cpp_html_a6f9c31c1047aa3191676d64571d4c506"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506">miller_test</a></div><div class="ttdeci">bool miller_test(T d, T num)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:73</div></div> <div class="ttc" id="amiller__rabin_8cpp_html_a6f9c31c1047aa3191676d64571d4c506"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a6f9c31c1047aa3191676d64571d4c506">miller_test</a></div><div class="ttdeci">bool miller_test(T d, T num)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:73</div></div>
<div class="ttc" id="aleast__common__multiple_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:78</div></div> <div class="ttc" id="aleast__common__multiple_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> least_common_multiple.cpp:78</div></div>
<div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition:</b> lu_decomposition.h:29</div></div> <div class="ttc" id="alu__decomposition_8h_html_a75b8a228c6419ecda6077255d6d60509"><div class="ttname"><a href="../../d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition</a></div><div class="ttdeci">int lu_decomposition(const matrix&lt; T &gt; &amp;A, matrix&lt; double &gt; *L, matrix&lt; double &gt; *U)</div><div class="ttdef"><b>Definition:</b> lu_decomposition.h:29</div></div>
<div class="ttc" id="anamespacemath_html_a6e2dff75c5de70455b90c799d6ad6967"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a></div><div class="ttdeci">T n_choose_r(T n, T r)</div><div class="ttdoc">This is the function implementation of .</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:33</div></div> <div class="ttc" id="anamespacemath_html_a6e2dff75c5de70455b90c799d6ad6967"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967">math::n_choose_r</a></div><div class="ttdeci">T n_choose_r(T n, T r)</div><div class="ttdoc">This is the function implementation of .</div><div class="ttdef"><b>Definition:</b> n_choose_r.cpp:35</div></div>
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:505</div></div> <div class="ttc" id="aheavy__light__decomposition_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:505</div></div>
<div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_a4c6eefd1254eab3e8d34bf02c205e0f4"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a></div><div class="ttdeci">int64_t binExpo(int64_t a, int64_t b, int64_t m)</div><div class="ttdef"><b>Definition:</b> modular_inverse_fermat_little_theorem.cpp:52</div></div> <div class="ttc" id="amodular__inverse__fermat__little__theorem_8cpp_html_a4c6eefd1254eab3e8d34bf02c205e0f4"><div class="ttname"><a href="../../d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a4c6eefd1254eab3e8d34bf02c205e0f4">binExpo</a></div><div class="ttdeci">int64_t binExpo(int64_t a, int64_t b, int64_t m)</div><div class="ttdef"><b>Definition:</b> modular_inverse_fermat_little_theorem.cpp:52</div></div>
<div class="ttc" id="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition:</b> sum_of_binomial_coefficient.cpp:24</div></div> <div class="ttc" id="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition:</b> sum_of_binomial_coefficient.cpp:26</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div> <div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_aa13bf7c38de112f71921a5525d71a2f2"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:32</div></div> <div class="ttc" id="aclassstatistics_1_1stats__computer1_html_aa13bf7c38de112f71921a5525d71a2f2"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2">statistics::stats_computer1::new_val</a></div><div class="ttdeci">void new_val(T x)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:32</div></div>
<div class="ttc" id="abrent__method__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find root for the function in the interval Expected result: .</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:165</div></div> <div class="ttc" id="abrent__method__extrema_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdoc">Test function to find root for the function in the interval Expected result: .</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:165</div></div>
@@ -317,6 +324,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::cbegin</a></div><div class="ttdeci">T cbegin(T... args)</div></div> <div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::cbegin</a></div><div class="ttdeci">T cbegin(T... args)</div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:183</div></div> <div class="ttc" id="amiller__rabin_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:183</div></div>
<div class="ttc" id="anamespacemath_html_afcd07701d73ed65cd616bcba02737f3d"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a></div><div class="ttdeci">uint64_t power(uint64_t a, uint64_t b, uint64_t c)</div><div class="ttdoc">This function calculates a raised to exponent b under modulo c using modular exponentiation.</div><div class="ttdef"><b>Definition:</b> modular_exponentiation.cpp:35</div></div> <div class="ttc" id="anamespacemath_html_afcd07701d73ed65cd616bcba02737f3d"><div class="ttname"><a href="../../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d">math::power</a></div><div class="ttdeci">uint64_t power(uint64_t a, uint64_t b, uint64_t c)</div><div class="ttdoc">This function calculates a raised to exponent b under modulo c using modular exponentiation.</div><div class="ttdef"><b>Definition:</b> modular_exponentiation.cpp:35</div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a0431ec5c876e1154d8e1e5f89e1ab34a"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a">math::ncr_modulo_p::NCRModuloP::modInverse</a></div><div class="ttdeci">int64_t modInverse(const uint64_t &amp;a, const uint64_t &amp;m)</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:76</div></div>
<div class="ttc" id="astrtof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">std::strtod</a></div><div class="ttdeci">T strtod(T... args)</div></div> <div class="ttc" id="astrtof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strtof.html">std::strtod</a></div><div class="ttdeci">T strtod(T... args)</div></div>
<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for std::vector</div></div> <div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for std::vector</div></div>
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:82</div></div> <div class="ttc" id="apower__for__huge__numbers_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:82</div></div>
@@ -332,11 +340,13 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="asum__of__digits_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> sum_of_digits.cpp:40</div></div> <div class="ttc" id="asum__of__digits_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d4/d83/sum__of__digits_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> sum_of_digits.cpp:40</div></div>
<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div> <div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
<div class="ttc" id="anamespacencr__modulo__p_html"><div class="ttname"><a href="../../d4/db9/namespacencr__modulo__p.html">ncr_modulo_p</a></div><div class="ttdoc">Functions for nCr modulo p implementation.</div></div>
<div class="ttc" id="abrent__method__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find root for the function in the interval Expected result = 2.</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:143</div></div> <div class="ttc" id="abrent__method__extrema_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../db/d01/brent__method__extrema_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test function to find root for the function in the interval Expected result = 2.</div><div class="ttdef"><b>Definition:</b> brent_method_extrema.cpp:143</div></div>
<div class="ttc" id="astring__fibonacci_8cpp_html_a28052eee05d43c2ebc5147c52bd50c35"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a></div><div class="ttdeci">std::string add(std::string a, std::string b)</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:24</div></div> <div class="ttc" id="astring__fibonacci_8cpp_html_a28052eee05d43c2ebc5147c52bd50c35"><div class="ttname"><a href="../../de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">add</a></div><div class="ttdeci">std::string add(std::string a, std::string b)</div><div class="ttdef"><b>Definition:</b> string_fibonacci.cpp:24</div></div>
<div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div> <div class="ttc" id="amake_pair_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/pair/make_pair.html">std::make_pair</a></div><div class="ttdeci">T make_pair(T... args)</div></div>
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div> <div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
<div class="ttc" id="abisection__method_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a></div><div class="ttdeci">#define MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations to check.</div><div class="ttdef"><b>Definition:</b> bisection_method.cpp:22</div></div> <div class="ttc" id="abisection__method_8cpp_html_a0a3abbca80bc98e7abcb3ae73abe0f14"><div class="ttname"><a href="../../d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">MAX_ITERATIONS</a></div><div class="ttdeci">#define MAX_ITERATIONS</div><div class="ttdoc">Maximum number of iterations to check.</div><div class="ttdef"><b>Definition:</b> bisection_method.cpp:22</div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_afde201f4687740454302c444f507a926"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926">math::ncr_modulo_p::NCRModuloP::gcdExtended</a></div><div class="ttdeci">uint64_t gcdExtended(const uint64_t &amp;a, const uint64_t &amp;b, int64_t *x, int64_t *y)</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:56</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::cend</a></div><div class="ttdeci">T cend(T... args)</div></div> <div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::cend</a></div><div class="ttdeci">T cend(T... args)</div></div>
<div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:56</div></div> <div class="ttc" id="asieve__of__eratosthenes_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> sieve_of_eratosthenes.cpp:56</div></div>
<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div> <div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
@@ -359,7 +369,7 @@ $(document).ready(function(){initNavTree('d1/dbe/lu__decomposition_8h_source.htm
<div class="ttc" id="apower__for__huge__numbers_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:10</div></div> <div class="ttc" id="apower__for__huge__numbers_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> power_for_huge_numbers.cpp:10</div></div>
<div class="ttc" id="aclassstatistics_1_1stats__computer1_html_ab5b4bfecdf391cae7edb1fe98548b846"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#ab5b4bfecdf391cae7edb1fe98548b846">statistics::stats_computer1::operator&gt;&gt;</a></div><div class="ttdeci">friend std::istream &amp; operator&gt;&gt;(std::istream &amp;input, stats_computer1 &amp;stat)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:53</div></div> <div class="ttc" id="aclassstatistics_1_1stats__computer1_html_ab5b4bfecdf391cae7edb1fe98548b846"><div class="ttname"><a href="../../d7/d7c/classstatistics_1_1stats__computer1.html#ab5b4bfecdf391cae7edb1fe98548b846">statistics::stats_computer1::operator&gt;&gt;</a></div><div class="ttdeci">friend std::istream &amp; operator&gt;&gt;(std::istream &amp;input, stats_computer1 &amp;stat)</div><div class="ttdef"><b>Definition:</b> realtime_stats.cpp:53</div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:157</div></div> <div class="ttc" id="amiller__rabin_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:157</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div> <div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
<div class="ttc" id="aprimes__up__to__billion_8cpp_html_ac0f4b77b901ddb15dab4c4dee1ac6e95"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a></div><div class="ttdeci">char prime[100000000]</div><div class="ttdef"><b>Definition:</b> primes_up_to_billion.cpp:10</div></div> <div class="ttc" id="aprimes__up__to__billion_8cpp_html_ac0f4b77b901ddb15dab4c4dee1ac6e95"><div class="ttname"><a href="../../d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">prime</a></div><div class="ttdeci">char prime[100000000]</div><div class="ttdef"><b>Definition:</b> primes_up_to_billion.cpp:10</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>

46
d1/dcc/wiggle__sort_8cpp.html
View File

@@ -100,11 +100,11 @@ $(document).ready(function(){initNavTree('d1/dcc/wiggle__sort_8cpp.html','../../
<p><a href="https://leetcode.com/problems/wiggle-sort-ii/">Wiggle Sort Algorithm</a> Implementation <p><a href="https://leetcode.com/problems/wiggle-sort-ii/">Wiggle Sort Algorithm</a> Implementation
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br /> <code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;ctime&gt;</code><br /> <code>#include &lt;ctime&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for wiggle_sort.cpp:</div> Include dependency graph for wiggle_sort.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -169,27 +169,25 @@ template&lt;typename T &gt; </div>
</dl> </dl>
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd> <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a1">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
</dl> </dl>
<div class="fragment"><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; {</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; </div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; uint32_t size = arr.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; uint32_t size = arr.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; </div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; </div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> out(</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> out(arr); <span class="comment">// create a copy of input vector. this way, the original input vector does not get modified. a sorted array is is returned.</span></div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; arr); <span class="comment">// create a copy of input vector. this way, the original input</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; </div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="comment">// vector does not get modified. a sorted array is is returned.</span></div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; size ; i +=2) {</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; </div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; </div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i += 2) {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">if</span>(i &gt; 0 &amp;&amp; out[i-1] &gt; out[i]) {</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordflow">if</span> (i &gt; 0 &amp;&amp; out[i - 1] &gt; out[i]) {</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(out[i],out[i-1]); <span class="comment">//swapping the two values</span></div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(out[i], out[i - 1]); <span class="comment">// swapping the two values</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; }</div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; }</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; </div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; </div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordflow">if</span>(i &lt; size - 1 &amp;&amp; out[i] &lt; out[i+1]) {</div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">if</span> (i &lt; size - 1 &amp;&amp; out[i] &lt; out[i + 1]) {</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(out[i],out[i+1]); <span class="comment">//swapping the two values</span></div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(out[i], out[i + 1]); <span class="comment">// swapping the two values</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; }</div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; }</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; </div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; }</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; }</div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; </div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; </div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="keywordflow">return</span> out; <span class="comment">// returns the sorted vector</span></div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <span class="keywordflow">return</span> out; <span class="comment">//returns the sorted vector</span></div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160;}</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; </div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; }</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">

2
d2/d0b/fast__power_8cpp.html
View File

@@ -287,7 +287,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div> <div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
<div class="ttc" id="afast__power_8cpp_html_a0d4e3f0099a6975b74a314a35bd0f94d"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a></div><div class="ttdeci">double fast_power_linear(T a, T b)</div><div class="ttdef"><b>Definition:</b> fast_power.cpp:50</div></div> <div class="ttc" id="afast__power_8cpp_html_a0d4e3f0099a6975b74a314a35bd0f94d"><div class="ttname"><a href="../../d2/d0b/fast__power_8cpp.html#a0d4e3f0099a6975b74a314a35bd0f94d">fast_power_linear</a></div><div class="ttdeci">double fast_power_linear(T a, T b)</div><div class="ttdef"><b>Definition:</b> fast_power.cpp:50</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

12
d3/d28/wiggle__sort_8cpp__incl.map
View File

@@ -1,8 +1,8 @@
<map id="sorting/wiggle_sort.cpp" name="sorting/wiggle_sort.cpp"> <map id="sorting/wiggle_sort.cpp" name="sorting/wiggle_sort.cpp">
<area shape="rect" id="node1" title="Wiggle Sort Algorithm Implementation" alt="" coords="151,5,307,32"/> <area shape="rect" id="node1" title="Wiggle Sort Algorithm Implementation" alt="" coords="143,5,299,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,77,107"/> <area shape="rect" id="node2" title=" " alt="" coords="5,80,80,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,80,176,107"/> <area shape="rect" id="node3" title=" " alt="" coords="105,80,170,107"/>
<area shape="rect" id="node4" title=" " alt="" coords="200,80,259,107"/> <area shape="rect" id="node4" title=" " alt="" coords="194,80,249,107"/>
<area shape="rect" id="node5" title=" " alt="" coords="283,80,349,107"/> <area shape="rect" id="node5" title=" " alt="" coords="273,80,345,107"/>
<area shape="rect" id="node6" title=" " alt="" coords="373,80,427,107"/> <area shape="rect" id="node6" title=" " alt="" coords="369,80,428,107"/>
</map> </map>

2
d3/d28/wiggle__sort_8cpp__incl.md5
View File

@@ -1 +1 @@
c4ff8c6be45c83f726af287eb1a30584 c9d14f19164ecd879857386b51dd4fec

48
d3/d28/wiggle__sort_8cpp__incl.svg
View File

@@ -5,16 +5,16 @@
--> -->
<!-- Title: sorting/wiggle_sort.cpp Pages: 1 --> <!-- Title: sorting/wiggle_sort.cpp Pages: 1 -->
<svg width="325pt" height="84pt" <svg width="325pt" height="84pt"
viewBox="0.00 0.00 324.50 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 325.00 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)">
<title>sorting/wiggle_sort.cpp</title> <title>sorting/wiggle_sort.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 320.5,-80 320.5,4 -4,4"/> <polygon fill="white" stroke="transparent" points="-4,4 -4,-80 321,-80 321,4 -4,4"/>
<!-- Node1 --> <!-- Node1 -->
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Wiggle Sort Algorithm Implementation"> <g id="a_node1"><a xlink:title="Wiggle Sort Algorithm Implementation">
<polygon fill="#bfbfbf" stroke="black" points="109.5,-56.5 109.5,-75.5 226.5,-75.5 226.5,-56.5 109.5,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="103.5,-56.5 103.5,-75.5 220.5,-75.5 220.5,-56.5 103.5,-56.5"/>
<text text-anchor="middle" x="168" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">sorting/wiggle_sort.cpp</text> <text text-anchor="middle" x="162" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">sorting/wiggle_sort.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -22,76 +22,76 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 56,-19.5 56,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M145.66,-56.44C122.25,-47.48 85.26,-33.31 58.81,-23.18"/> <path fill="none" stroke="midnightblue" d="M140.77,-56.44C118.62,-47.52 83.68,-33.44 58.56,-23.32"/>
<polygon fill="midnightblue" stroke="midnightblue" points="59.83,-19.82 49.24,-19.52 57.32,-26.36 59.83,-19.82"/> <polygon fill="midnightblue" stroke="midnightblue" points="59.72,-20.01 49.13,-19.52 57.1,-26.5 59.72,-20.01"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 128,-19.5 128,-0.5 72,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="74.5,-0.5 74.5,-19.5 123.5,-19.5 123.5,-0.5 74.5,-0.5"/>
<text text-anchor="middle" x="100" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text> <text text-anchor="middle" x="99" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M157.07,-56.32C146.83,-48.18 131.28,-35.84 119,-26.09"/> <path fill="none" stroke="midnightblue" d="M151.88,-56.32C142.47,-48.26 128.26,-36.08 116.93,-26.37"/>
<polygon fill="midnightblue" stroke="midnightblue" points="121.13,-23.31 111.12,-19.83 116.78,-28.79 121.13,-23.31"/> <polygon fill="midnightblue" stroke="midnightblue" points="119.18,-23.68 109.31,-19.83 114.62,-29 119.18,-23.68"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:title=" "> <g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="146,-0.5 146,-19.5 190,-19.5 190,-0.5 146,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="141.5,-0.5 141.5,-19.5 182.5,-19.5 182.5,-0.5 141.5,-0.5"/>
<text text-anchor="middle" x="168" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text> <text text-anchor="middle" x="162" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M168,-56.08C168,-49.01 168,-38.86 168,-29.99"/> <path fill="none" stroke="midnightblue" d="M162,-56.08C162,-49.01 162,-38.86 162,-29.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="171.5,-29.75 168,-19.75 164.5,-29.75 171.5,-29.75"/> <polygon fill="midnightblue" stroke="midnightblue" points="165.5,-29.75 162,-19.75 158.5,-29.75 165.5,-29.75"/>
</g> </g>
<!-- Node5 --> <!-- Node5 -->
<g id="node5" class="node"> <g id="node5" class="node">
<title>Node5</title> <title>Node5</title>
<g id="a_node5"><a xlink:title=" "> <g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="208.5,-0.5 208.5,-19.5 257.5,-19.5 257.5,-0.5 208.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="201,-0.5 201,-19.5 255,-19.5 255,-0.5 201,-0.5"/>
<text text-anchor="middle" x="233" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text> <text text-anchor="middle" x="228" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node5 --> <!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge"> <g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title> <title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M178.44,-56.32C188.15,-48.26 202.82,-36.08 214.5,-26.37"/> <path fill="none" stroke="midnightblue" d="M172.6,-56.32C182.46,-48.26 197.35,-36.08 209.22,-26.37"/>
<polygon fill="midnightblue" stroke="midnightblue" points="216.91,-28.92 222.37,-19.83 212.44,-23.53 216.91,-28.92"/> <polygon fill="midnightblue" stroke="midnightblue" points="211.68,-28.88 217.2,-19.83 207.25,-23.46 211.68,-28.88"/>
</g> </g>
<!-- Node6 --> <!-- Node6 -->
<g id="node6" class="node"> <g id="node6" class="node">
<title>Node6</title> <title>Node6</title>
<g id="a_node6"><a xlink:title=" "> <g id="a_node6"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="275.5,-0.5 275.5,-19.5 316.5,-19.5 316.5,-0.5 275.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="273,-0.5 273,-19.5 317,-19.5 317,-0.5 273,-0.5"/>
<text text-anchor="middle" x="296" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</text> <text text-anchor="middle" x="295" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node6 --> <!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge"> <g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title> <title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M188.28,-56.44C209.35,-47.56 242.52,-33.56 266.49,-23.45"/> <path fill="none" stroke="midnightblue" d="M183.07,-56.44C205.06,-47.52 239.73,-33.44 264.66,-23.32"/>
<polygon fill="midnightblue" stroke="midnightblue" points="267.96,-26.63 275.81,-19.52 265.24,-20.18 267.96,-26.63"/> <polygon fill="midnightblue" stroke="midnightblue" points="266.08,-26.52 274.02,-19.52 263.44,-20.04 266.08,-26.52"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

26
d3/d40/graph__coloring_8cpp.html
View File

@@ -185,7 +185,7 @@ Functions</h2></td></tr>
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:39</div></div> <div class="ttc" id="atower__of__hanoi_8cpp_html_af4cfc41e546f1f8d25f01e0804e8b61d"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#af4cfc41e546f1f8d25f01e0804e8b61d">mov</a></div><div class="ttdeci">void mov(tower *From, tower *To)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:39</div></div>
<div class="ttc" id="anamespacemerge__insertion_html"><div class="ttname"><a href="../../de/d0a/namespacemerge__insertion.html">merge_insertion</a></div><div class="ttdoc">Combined Intersion-Merge sorting algorithm.</div></div> <div class="ttc" id="anamespacemerge__insertion_html"><div class="ttname"><a href="../../de/d0a/namespacemerge__insertion.html">merge_insertion</a></div><div class="ttdoc">Combined Intersion-Merge sorting algorithm.</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_a302672a25ef4561eb41b4f9ef8e518b2"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a302672a25ef4561eb41b4f9ef8e518b2">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:50</div></div> <div class="ttc" id="aradix__sort2_8cpp_html_a302672a25ef4561eb41b4f9ef8e518b2"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a302672a25ef4561eb41b4f9ef8e518b2">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:49</div></div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div> <div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="aknuth__morris__pratt_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> knuth_morris_pratt.cpp:76</div></div> <div class="ttc" id="aknuth__morris__pratt_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> knuth_morris_pratt.cpp:76</div></div>
<div class="ttc" id="afenwick__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fenwick_tree.cpp:69</div></div> <div class="ttc" id="afenwick__tree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fenwick_tree.cpp:69</div></div>
@@ -322,7 +322,7 @@ Functions</h2></td></tr>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:14</div></div> <div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:14</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div> <div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="apigeonhole__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> pigeonhole_sort.cpp:127</div></div> <div class="ttc" id="apigeonhole__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> pigeonhole_sort.cpp:127</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_a8df9406972cda58c209b30ebae295daa"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a8df9406972cda58c209b30ebae295daa">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:79</div></div> <div class="ttc" id="aradix__sort2_8cpp_html_a8df9406972cda58c209b30ebae295daa"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a8df9406972cda58c209b30ebae295daa">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:80</div></div>
<div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:14</div></div> <div class="ttc" id="astruct_point_html_a2e1b5fb2b2a83571f5c0bc0f66a73cf7"><div class="ttname"><a href="../../d8/dc8/struct_point.html#a2e1b5fb2b2a83571f5c0bc0f66a73cf7">Point::y</a></div><div class="ttdeci">int y</div><div class="ttdoc">Point respect to x coordinate.</div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:14</div></div>
<div class="ttc" id="anamespaceqr__algorithm_html_a763896dbb4a7e95c4a1e614ac0819d66"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a763896dbb4a7e95c4a1e614ac0819d66">qr_algorithm::eigen_values</a></div><div class="ttdeci">std::valarray&lt; double &gt; eigen_values(std::valarray&lt; std::valarray&lt; double &gt;&gt; *A, bool print_intermediates=false)</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.cpp:98</div></div> <div class="ttc" id="anamespaceqr__algorithm_html_a763896dbb4a7e95c4a1e614ac0819d66"><div class="ttname"><a href="../../d2/d3b/namespaceqr__algorithm.html#a763896dbb4a7e95c4a1e614ac0819d66">qr_algorithm::eigen_values</a></div><div class="ttdeci">std::valarray&lt; double &gt; eigen_values(std::valarray&lt; std::valarray&lt; double &gt;&gt; *A, bool print_intermediates=false)</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.cpp:98</div></div>
<div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div> <div class="ttc" id="aclock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/clock.html">std::clock</a></div><div class="ttdeci">T clock(T... args)</div></div>
@@ -370,7 +370,7 @@ Functions</h2></td></tr>
<div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></div> <div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></div>
<div class="ttc" id="ahappy__number_8cpp_html_a00ccdb1166a7c83ac3c33ac67a2532b7"><div class="ttname"><a href="../../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">is_happy</a></div><div class="ttdeci">bool is_happy(T n)</div><div class="ttdef"><b>Definition:</b> happy_number.cpp:14</div></div> <div class="ttc" id="ahappy__number_8cpp_html_a00ccdb1166a7c83ac3c33ac67a2532b7"><div class="ttname"><a href="../../db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">is_happy</a></div><div class="ttdeci">bool is_happy(T n)</div><div class="ttdef"><b>Definition:</b> happy_number.cpp:14</div></div>
<div class="ttc" id="anamespacestring__search_html_aebe07cea289a13142503d98be7df11fd"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a></div><div class="ttdeci">bool check_if_equal(const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</div><div class="ttdef"><b>Definition:</b> rabin_karp.cpp:60</div></div> <div class="ttc" id="anamespacestring__search_html_aebe07cea289a13142503d98be7df11fd"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a></div><div class="ttdeci">bool check_if_equal(const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</div><div class="ttdef"><b>Definition:</b> rabin_karp.cpp:60</div></div>
<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:84</div></div> <div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:85</div></div>
<div class="ttc" id="amedian__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> median_search.cpp:128</div></div> <div class="ttc" id="amedian__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> median_search.cpp:128</div></div>
<div class="ttc" id="aternary__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> ternary_search.cpp:134</div></div> <div class="ttc" id="aternary__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> ternary_search.cpp:134</div></div>
<div class="ttc" id="abinomial__dist_8cpp_html_a76ed6ce71415fb400b65f0656cef3d25"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a></div><div class="ttdeci">double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)</div><div class="ttdef"><b>Definition:</b> binomial_dist.cpp:74</div></div> <div class="ttc" id="abinomial__dist_8cpp_html_a76ed6ce71415fb400b65f0656cef3d25"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a76ed6ce71415fb400b65f0656cef3d25">binomial_range_successes</a></div><div class="ttdeci">double binomial_range_successes(double n, double p, double lower_bound, double upper_bound)</div><div class="ttdef"><b>Definition:</b> binomial_dist.cpp:74</div></div>
@@ -380,9 +380,9 @@ Functions</h2></td></tr>
<div class="ttc" id="ato_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></div><div class="ttdeci">T to_string(T... args)</div></div> <div class="ttc" id="ato_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></div><div class="ttdeci">T to_string(T... args)</div></div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt; float, 20 &gt;</a></div></div> <div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt; float, 20 &gt;</a></div></div>
<div class="ttc" id="anamespacestring__search_html_a26a58225ce7d3fa9d4c2f5349a65ed93"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93">string_search::kmp</a></div><div class="ttdeci">bool kmp(const std::string &amp;pattern, const std::string &amp;text)</div><div class="ttdef"><b>Definition:</b> knuth_morris_pratt.cpp:56</div></div> <div class="ttc" id="anamespacestring__search_html_a26a58225ce7d3fa9d4c2f5349a65ed93"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#a26a58225ce7d3fa9d4c2f5349a65ed93">string_search::kmp</a></div><div class="ttdeci">bool kmp(const std::string &amp;pattern, const std::string &amp;text)</div><div class="ttdef"><b>Definition:</b> knuth_morris_pratt.cpp:56</div></div>
<div class="ttc" id="awiggle__sort_8cpp_html_a52955ecf8669ff6c5b9b1e66bd7db41d"><div class="ttname"><a href="../../d1/dcc/wiggle__sort_8cpp.html#a52955ecf8669ff6c5b9b1e66bd7db41d">sorting::wiggle_sort::wiggleSort</a></div><div class="ttdeci">std::vector&lt; T &gt; wiggleSort(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Function used for sorting the elements in wave form.</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:51</div></div> <div class="ttc" id="awiggle__sort_8cpp_html_a52955ecf8669ff6c5b9b1e66bd7db41d"><div class="ttname"><a href="../../d1/dcc/wiggle__sort_8cpp.html#a52955ecf8669ff6c5b9b1e66bd7db41d">sorting::wiggle_sort::wiggleSort</a></div><div class="ttdeci">std::vector&lt; T &gt; wiggleSort(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Function used for sorting the elements in wave form.</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:53</div></div>
<div class="ttc" id="apoisson__dist_8cpp_html_ad9c9e74079278ca10e3b97a8d5391c9a"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a></div><div class="ttdeci">double poisson_range_successes(double expected, double lower, double upper)</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:54</div></div> <div class="ttc" id="apoisson__dist_8cpp_html_ad9c9e74079278ca10e3b97a8d5391c9a"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_range_successes</a></div><div class="ttdeci">double poisson_range_successes(double expected, double lower, double upper)</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:54</div></div>
<div class="ttc" id="acycle__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> cycle_sort.cpp:81</div></div> <div class="ttc" id="acycle__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> cycle_sort.cpp:86</div></div>
<div class="ttc" id="atower__of__hanoi_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:65</div></div> <div class="ttc" id="atower__of__hanoi_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:65</div></div>
<div class="ttc" id="anamespacesorting_html_a140d913e42fb94176a0b2c8b29a80420"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">sorting::non_recursive_merge_sort</a></div><div class="ttdeci">void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)</div><div class="ttdoc">bottom-up merge sort which sorts elements in a non-decreasing order</div><div class="ttdef"><b>Definition:</b> non_recursive_merge_sort.cpp:25</div></div> <div class="ttc" id="anamespacesorting_html_a140d913e42fb94176a0b2c8b29a80420"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420">sorting::non_recursive_merge_sort</a></div><div class="ttdeci">void non_recursive_merge_sort(const Iterator first, const Iterator last, const size_t n)</div><div class="ttdoc">bottom-up merge sort which sorts elements in a non-decreasing order</div><div class="ttdef"><b>Definition:</b> non_recursive_merge_sort.cpp:25</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a722cc7cf2c3e4d15583601a48b09776f"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f">range_queries::heavy_light_decomposition::HLD::label</a></div><div class="ttdeci">int label</div><div class="ttdoc">utility member to assign labels in dfs_labels()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:338</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a722cc7cf2c3e4d15583601a48b09776f"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a722cc7cf2c3e4d15583601a48b09776f">range_queries::heavy_light_decomposition::HLD::label</a></div><div class="ttdeci">int label</div><div class="ttdoc">utility member to assign labels in dfs_labels()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:338</div></div>
@@ -393,7 +393,7 @@ Functions</h2></td></tr>
<div class="ttc" id="apigeonhole__sort_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition:</b> pigeonhole_sort.cpp:68</div></div> <div class="ttc" id="apigeonhole__sort_8cpp_html_a34b8683a2b429de5cce57e6d733ec817"><div class="ttname"><a href="../../dd/da8/pigeonhole__sort_8cpp.html#a34b8683a2b429de5cce57e6d733ec817">test_1</a></div><div class="ttdeci">static void test_1()</div><div class="ttdef"><b>Definition:</b> pigeonhole_sort.cpp:68</div></div>
<div class="ttc" id="anamespacesorting_html_a2f8bc626eb57acae24a94636a23af6a1"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a></div><div class="ttdeci">void gnomeSort(T *arr, int size)</div><div class="ttdef"><b>Definition:</b> gnome_sort.cpp:34</div></div> <div class="ttc" id="anamespacesorting_html_a2f8bc626eb57acae24a94636a23af6a1"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a2f8bc626eb57acae24a94636a23af6a1">sorting::gnomeSort</a></div><div class="ttdeci">void gnomeSort(T *arr, int size)</div><div class="ttdef"><b>Definition:</b> gnome_sort.cpp:34</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:87</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_a350157a5fb79f76fceae33fc84171203"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a350157a5fb79f76fceae33fc84171203">range_queries::heavy_light_decomposition::Tree::t_par</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; t_par</div><div class="ttdoc">a matrix to store every node's 2^kth parent</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:87</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:100</div></div> <div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:102</div></div>
<div class="ttc" id="asmallest__circle_8cpp_html_a94682a4a70d5906857ca09de5b9fb2cc"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a></div><div class="ttdeci">double TriangleArea(const Point &amp;A, const Point &amp;B, const Point &amp;C)</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:54</div></div> <div class="ttc" id="asmallest__circle_8cpp_html_a94682a4a70d5906857ca09de5b9fb2cc"><div class="ttname"><a href="../../d0/d01/smallest__circle_8cpp.html#a94682a4a70d5906857ca09de5b9fb2cc">TriangleArea</a></div><div class="ttdeci">double TriangleArea(const Point &amp;A, const Point &amp;B, const Point &amp;C)</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:54</div></div>
<div class="ttc" id="abrute__force__string__searching_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> brute_force_string_searching.cpp:47</div></div> <div class="ttc" id="abrute__force__string__searching_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d7d/brute__force__string__searching_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> brute_force_string_searching.cpp:47</div></div>
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></div></div> <div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></div></div>
@@ -421,7 +421,7 @@ Functions</h2></td></tr>
<div class="ttc" id="apostfix__evaluation_8cpp_html_a6a8eeb7d346d5cd6335d9780fb7c0f15"><div class="ttname"><a href="../../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a></div><div class="ttdeci">static void test_function_1()</div><div class="ttdoc">Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.</div><div class="ttdef"><b>Definition:</b> postfix_evaluation.cpp:146</div></div> <div class="ttc" id="apostfix__evaluation_8cpp_html_a6a8eeb7d346d5cd6335d9780fb7c0f15"><div class="ttname"><a href="../../d7/d75/postfix__evaluation_8cpp.html#a6a8eeb7d346d5cd6335d9780fb7c0f15">test_function_1</a></div><div class="ttdeci">static void test_function_1()</div><div class="ttdoc">Test function 1 with input array {'2', '3', '1', '*', '+', '9', '-'}.</div><div class="ttdef"><b>Definition:</b> postfix_evaluation.cpp:146</div></div>
<div class="ttc" id="apoisson__dist_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:65</div></div> <div class="ttc" id="apoisson__dist_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:65</div></div>
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div> <div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
<div class="ttc" id="acycle__sort_8cpp_html_ad0cfe2e54b1d3f9d0ca648265d917c6a"><div class="ttname"><a href="../../de/d07/cycle__sort_8cpp.html#ad0cfe2e54b1d3f9d0ca648265d917c6a">sorting::cycle_sort::cycleSort</a></div><div class="ttdeci">std::vector&lt; T &gt; cycleSort(const std::vector&lt; T &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements cycleSort.</div><div class="ttdef"><b>Definition:</b> cycle_sort.cpp:35</div></div> <div class="ttc" id="acycle__sort_8cpp_html_ad0cfe2e54b1d3f9d0ca648265d917c6a"><div class="ttname"><a href="../../de/d07/cycle__sort_8cpp.html#ad0cfe2e54b1d3f9d0ca648265d917c6a">sorting::cycle_sort::cycleSort</a></div><div class="ttdeci">std::vector&lt; T &gt; cycleSort(const std::vector&lt; T &gt; &amp;in_arr)</div><div class="ttdoc">The main function implements cycleSort.</div><div class="ttdef"><b>Definition:</b> cycle_sort.cpp:39</div></div>
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div> <div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div> <div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<div class="ttc" id="abinomial__dist_8cpp_html_a4416a7bc7fa87201883c54cdc4c82813"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a></div><div class="ttdeci">double binomial_expected(double n, double p)</div><div class="ttdef"><b>Definition:</b> binomial_dist.cpp:22</div></div> <div class="ttc" id="abinomial__dist_8cpp_html_a4416a7bc7fa87201883c54cdc4c82813"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a4416a7bc7fa87201883c54cdc4c82813">binomial_expected</a></div><div class="ttdeci">double binomial_expected(double n, double p)</div><div class="ttdef"><b>Definition:</b> binomial_dist.cpp:22</div></div>
@@ -454,7 +454,7 @@ Functions</h2></td></tr>
<div class="ttc" id="ahash__search_8cpp_html_ad0831425f1389166a9518f422d0c6ec5"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a></div><div class="ttdeci">void create_list(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:55</div></div> <div class="ttc" id="ahash__search_8cpp_html_ad0831425f1389166a9518f422d0c6ec5"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a></div><div class="ttdeci">void create_list(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:55</div></div>
<div class="ttc" id="apoisson__dist_8cpp_html_a63ffd347e75d5ed7a518cbcfbfeec71a"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a></div><div class="ttdeci">double fact(double x)</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:30</div></div> <div class="ttc" id="apoisson__dist_8cpp_html_a63ffd347e75d5ed7a518cbcfbfeec71a"><div class="ttname"><a href="../../d9/d24/poisson__dist_8cpp.html#a63ffd347e75d5ed7a518cbcfbfeec71a">fact</a></div><div class="ttdeci">double fact(double x)</div><div class="ttdef"><b>Definition:</b> poisson_dist.cpp:30</div></div>
<div class="ttc" id="ahorspool_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function that calls test function.</div><div class="ttdef"><b>Definition:</b> horspool.cpp:119</div></div> <div class="ttc" id="ahorspool_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function that calls test function.</div><div class="ttdef"><b>Definition:</b> horspool.cpp:119</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:115</div></div> <div class="ttc" id="aradix__sort2_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:117</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_ad3b942be27a1b0fe3cff6cb6edf01294"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294">range_queries::heavy_light_decomposition::SG::set_sret_init</a></div><div class="ttdeci">void set_sret_init(X new_sret_init)</div><div class="ttdoc">Set the initialization for the query data type, based on requirement.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:329</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_s_g_html_ad3b942be27a1b0fe3cff6cb6edf01294"><div class="ttname"><a href="../../d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#ad3b942be27a1b0fe3cff6cb6edf01294">range_queries::heavy_light_decomposition::SG::set_sret_init</a></div><div class="ttdeci">void set_sret_init(X new_sret_init)</div><div class="ttdoc">Set the initialization for the query data type, based on requirement.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:329</div></div>
<div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div> <div class="ttc" id="aexp_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/exp.html">std::exp</a></div><div class="ttdeci">T exp(T... args)</div></div>
<div class="ttc" id="afast__integer__input_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fast_integer_input.cpp:39</div></div> <div class="ttc" id="afast__integer__input_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/df0/fast__integer__input_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> fast_integer_input.cpp:39</div></div>
@@ -477,18 +477,18 @@ Functions</h2></td></tr>
<div class="ttc" id="aspiral__print_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> spiral_print.cpp:69</div></div> <div class="ttc" id="aspiral__print_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d07/spiral__print_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> spiral_print.cpp:69</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:16</div></div> <div class="ttc" id="aparanthesis__matching_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:16</div></div>
<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdef"><b>Definition:</b> stack.h:26</div></div> <div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdef"><b>Definition:</b> stack.h:26</div></div>
<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">asserting the test functions</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:31</div></div> <div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">for using the vector container</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:33</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a5769b745458157ef2679949155684f3b"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a5769b745458157ef2679949155684f3b">power</a></div><div class="ttdeci">vector&lt; vector&lt; ll &gt; &gt; power(const vector&lt; vector&lt; ll &gt;&gt; &amp;A, ll p)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:76</div></div> <div class="ttc" id="amatrix__exponentiation_8cpp_html_a5769b745458157ef2679949155684f3b"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a5769b745458157ef2679949155684f3b">power</a></div><div class="ttdeci">vector&lt; vector&lt; ll &gt; &gt; power(const vector&lt; vector&lt; ll &gt;&gt; &amp;A, ll p)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:76</div></div>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_a0cba4fbf287ab8cb978ed7f8fef886b1"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a></div><div class="ttdeci">static void InsertionSort(std::array&lt; T, N &gt; *A, size_t start, size_t end)</div><div class="ttdoc">Insertion merge algorithm.</div><div class="ttdef"><b>Definition:</b> merge_insertion_sort.cpp:37</div></div> <div class="ttc" id="amerge__insertion__sort_8cpp_html_a0cba4fbf287ab8cb978ed7f8fef886b1"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#a0cba4fbf287ab8cb978ed7f8fef886b1">sorting::merge_insertion::InsertionSort</a></div><div class="ttdeci">static void InsertionSort(std::array&lt; T, N &gt; *A, size_t start, size_t end)</div><div class="ttdoc">Insertion merge algorithm.</div><div class="ttdef"><b>Definition:</b> merge_insertion_sort.cpp:37</div></div>
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div> <div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
<div class="ttc" id="asuccessive__approximation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> successive_approximation.cpp:20</div></div> <div class="ttc" id="asuccessive__approximation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> successive_approximation.cpp:20</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a1b336474d17eff1aa4be73d4068dc725"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">range_queries::heavy_light_decomposition::HLD::h_parent</a></div><div class="ttdeci">std::vector&lt; int &gt; h_parent</div><div class="ttdoc">stores the top of the heavy chain from a node</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:341</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a1b336474d17eff1aa4be73d4068dc725"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a1b336474d17eff1aa4be73d4068dc725">range_queries::heavy_light_decomposition::HLD::h_parent</a></div><div class="ttdeci">std::vector&lt; int &gt; h_parent</div><div class="ttdoc">stores the top of the heavy chain from a node</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:341</div></div>
<div class="ttc" id="agroup__sorting_html_gaa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:109</div></div> <div class="ttc" id="agroup__sorting_html_gaa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:106</div></div>
<div class="ttc" id="acount_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a></div><div class="ttdeci">T count(T... args)</div></div> <div class="ttc" id="acount_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a></div><div class="ttdeci">T count(T... args)</div></div>
<div class="ttc" id="ainsertion__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> insertion_sort.cpp:109</div></div> <div class="ttc" id="ainsertion__sort_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> insertion_sort.cpp:109</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a4dfbf5d9df825eeb63b294c6849bdcab"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab">range_queries::heavy_light_decomposition::HLD::query</a></div><div class="ttdeci">X query(int a, int b)</div><div class="ttdoc">This function returns the sum of node values in the simple path from from node_1 to node_2.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:489</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_a4dfbf5d9df825eeb63b294c6849bdcab"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a4dfbf5d9df825eeb63b294c6849bdcab">range_queries::heavy_light_decomposition::HLD::query</a></div><div class="ttdeci">X query(int a, int b)</div><div class="ttdoc">This function returns the sum of node values in the simple path from from node_1 to node_2.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:489</div></div>
<div class="ttc" id="alinear__search_8cpp_html_a84ac3988a534eb60ca351ed6caf56d84"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a></div><div class="ttdeci">int LinearSearch(int *array, int size, int key)</div><div class="ttdef"><b>Definition:</b> linear_search.cpp:16</div></div> <div class="ttc" id="alinear__search_8cpp_html_a84ac3988a534eb60ca351ed6caf56d84"><div class="ttname"><a href="../../d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">LinearSearch</a></div><div class="ttdeci">int LinearSearch(int *array, int size, int key)</div><div class="ttdef"><b>Definition:</b> linear_search.cpp:16</div></div>
<div class="ttc" id="acycle__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> cycle_sort.cpp:101</div></div> <div class="ttc" id="acycle__sort_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> cycle_sort.cpp:107</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">std::string::empty</a></div><div class="ttdeci">T empty(T... args)</div></div> <div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/empty.html">std::string::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div> <div class="ttc" id="aassign_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/assign.html">std::vector::assign</a></div><div class="ttdeci">T assign(T... args)</div></div>
<div class="ttc" id="aprimality__test_8cpp_html_a2bfa6adead2bdcbf1dac94cbe08d7eaf"><div class="ttname"><a href="../../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a></div><div class="ttdeci">bool IsPrime(int number)</div><div class="ttdef"><b>Definition:</b> primality_test.cpp:18</div></div> <div class="ttc" id="aprimality__test_8cpp_html_a2bfa6adead2bdcbf1dac94cbe08d7eaf"><div class="ttname"><a href="../../da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">IsPrime</a></div><div class="ttdeci">bool IsPrime(int number)</div><div class="ttdef"><b>Definition:</b> primality_test.cpp:18</div></div>
@@ -512,7 +512,7 @@ Functions</h2></td></tr>
<div class="ttc" id="aclassstack_html_a7289037c059aaad492b4d68e6bd54453"><div class="ttname"><a href="../../d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453">stack::stackTop</a></div><div class="ttdeci">node&lt; Type &gt; * stackTop</div><div class="ttdef"><b>Definition:</b> stack.h:146</div></div> <div class="ttc" id="aclassstack_html_a7289037c059aaad492b4d68e6bd54453"><div class="ttname"><a href="../../d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453">stack::stackTop</a></div><div class="ttdeci">node&lt; Type &gt; * stackTop</div><div class="ttdef"><b>Definition:</b> stack.h:146</div></div>
<div class="ttc" id="aqr__eigen__values_8cpp_html_aee57a411f07599034f5ceb8cc7d65b40"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><div class="ttdeci">#define LIMS</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.cpp:20</div></div> <div class="ttc" id="aqr__eigen__values_8cpp_html_aee57a411f07599034f5ceb8cc7d65b40"><div class="ttname"><a href="../../de/d75/qr__eigen__values_8cpp.html#aee57a411f07599034f5ceb8cc7d65b40">LIMS</a></div><div class="ttdeci">#define LIMS</div><div class="ttdef"><b>Definition:</b> qr_eigen_values.cpp:20</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div> <div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:56</div></div> <div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:57</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:20</div></div> <div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:20</div></div>
<div class="ttc" id="abayes__theorem_8cpp_html_a655bfe51252468d232dc639a340656ba"><div class="ttname"><a href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a></div><div class="ttdeci">double bayes_AgivenB(double BgivenA, double A, double B)</div><div class="ttdef"><b>Definition:</b> bayes_theorem.cpp:14</div></div> <div class="ttc" id="abayes__theorem_8cpp_html_a655bfe51252468d232dc639a340656ba"><div class="ttname"><a href="../../d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba">bayes_AgivenB</a></div><div class="ttdeci">double bayes_AgivenB(double BgivenA, double A, double B)</div><div class="ttdef"><b>Definition:</b> bayes_theorem.cpp:14</div></div>
<div class="ttc" id="aclass_fenwick_tree_html_ade1d6a3d49af9d9df33e2fb26cab1699"><div class="ttname"><a href="../../dd/d91/class_fenwick_tree.html#ade1d6a3d49af9d9df33e2fb26cab1699">FenwickTree::sum</a></div><div class="ttdeci">int sum(int id)</div><div class="ttdef"><b>Definition:</b> fenwick_tree.cpp:54</div></div> <div class="ttc" id="aclass_fenwick_tree_html_ade1d6a3d49af9d9df33e2fb26cab1699"><div class="ttname"><a href="../../dd/d91/class_fenwick_tree.html#ade1d6a3d49af9d9df33e2fb26cab1699">FenwickTree::sum</a></div><div class="ttdeci">int sum(int id)</div><div class="ttdef"><b>Definition:</b> fenwick_tree.cpp:54</div></div>
@@ -522,7 +522,7 @@ Functions</h2></td></tr>
<div class="ttc" id="amerge__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test code using random arrays.</div><div class="ttdef"><b>Definition:</b> merge_insertion_sort.cpp:132</div></div> <div class="ttc" id="amerge__insertion__sort_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/d7b/merge__insertion__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test code using random arrays.</div><div class="ttdef"><b>Definition:</b> merge_insertion_sort.cpp:132</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab916d554afa8ca5230b4310c2c69fae0"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0">range_queries::heavy_light_decomposition::Tree::change_root</a></div><div class="ttdeci">void change_root(int new_root)</div><div class="ttdoc">Set the root for the tree.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:167</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_tree_html_ab916d554afa8ca5230b4310c2c69fae0"><div class="ttname"><a href="../../d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ab916d554afa8ca5230b4310c2c69fae0">range_queries::heavy_light_decomposition::Tree::change_root</a></div><div class="ttdeci">void change_root(int new_root)</div><div class="ttdoc">Set the root for the tree.</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:167</div></div>
<div class="ttc" id="aclass_fenwick_tree_html_a70f8c261393ca09ec1ad716ac806ead6"><div class="ttname"><a href="../../dd/d91/class_fenwick_tree.html#a70f8c261393ca09ec1ad716ac806ead6">FenwickTree::FenwickTree</a></div><div class="ttdeci">FenwickTree(int x)</div><div class="ttdef"><b>Definition:</b> fenwick_tree.cpp:39</div></div> <div class="ttc" id="aclass_fenwick_tree_html_a70f8c261393ca09ec1ad716ac806ead6"><div class="ttname"><a href="../../dd/d91/class_fenwick_tree.html#a70f8c261393ca09ec1ad716ac806ead6">FenwickTree::FenwickTree</a></div><div class="ttdeci">FenwickTree(int x)</div><div class="ttdef"><b>Definition:</b> fenwick_tree.cpp:39</div></div>
<div class="ttc" id="arungekutta_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Tests to check algorithm implementation.</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:105</div></div> <div class="ttc" id="arungekutta_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Tests to check algorithm implementation.</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:100</div></div>
<div class="ttc" id="astruct_point_html_ae2d6fb1b3fd3a96169d963d62e37130a"><div class="ttname"><a href="../../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point::Point</a></div><div class="ttdeci">Point(double a=0.f, double b=0.f)</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:23</div></div> <div class="ttc" id="astruct_point_html_ae2d6fb1b3fd3a96169d963d62e37130a"><div class="ttname"><a href="../../d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point::Point</a></div><div class="ttdeci">Point(double a=0.f, double b=0.f)</div><div class="ttdef"><b>Definition:</b> smallest_circle.cpp:23</div></div>
<div class="ttc" id="aprimality__test_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> primality_test.cpp:31</div></div> <div class="ttc" id="aprimality__test_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d7b/primality__test_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> primality_test.cpp:31</div></div>
<div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_aa86a91ae0cd7898990a8170a2f2c9cda"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">range_queries::heavy_light_decomposition::HLD::h_label</a></div><div class="ttdeci">std::vector&lt; int &gt; h_label</div><div class="ttdoc">stores the label of a node</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:339</div></div> <div class="ttc" id="aclassrange__queries_1_1heavy__light__decomposition_1_1_h_l_d_html_aa86a91ae0cd7898990a8170a2f2c9cda"><div class="ttname"><a href="../../d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">range_queries::heavy_light_decomposition::HLD::h_label</a></div><div class="ttdeci">std::vector&lt; int &gt; h_label</div><div class="ttdoc">stores the label of a node</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:339</div></div>

7
d3/d78/namespacelinear__algebra.html
View File

@@ -95,11 +95,12 @@ $(document).ready(function(){initNavTree('d3/d78/namespacelinear__algebra.html',
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<p>Linear Algebra algorithms. <p>for io operations
<a href="../../d3/d78/namespacelinear__algebra.html#details">More...</a></p> <a href="../../d3/d78/namespacelinear__algebra.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Linear Algebra algorithms. </p> <div class="textblock"><p>for io operations </p>
<p>for io operations for assert for fabs for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html" title="STL class.">std::array</a> </p> <p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html" title="STL class.">std::array</a> for assert for fabs</p>
<p>Linear Algebra algorithms </p>
</div></div><!-- contents --> </div></div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<!-- start footer part --> <!-- start footer part -->

6
d4/d25/ncr__modulo__p_8cpp__incl.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="math/ncr_modulo_p.cpp" name="math/ncr_modulo_p.cpp">
<area shape="rect" id="node1" title="This program aims at calculating nCr modulo p." alt="" coords="51,5,212,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,71,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,80,167,107"/>
<area shape="rect" id="node4" title=" " alt="" coords="191,80,250,107"/>
</map>

1
d4/d25/ncr__modulo__p_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
006cb186b27e8facecca8929d53746ae

67
d4/d25/ncr__modulo__p_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,67 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: math/ncr_modulo_p.cpp Pages: 1 -->
<svg width="192pt" height="84pt"
viewBox="0.00 0.00 191.50 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)">
<title>math/ncr_modulo_p.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 187.5,-80 187.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="This program aims at calculating nCr modulo p.">
<polygon fill="#bfbfbf" stroke="black" points="34,-56.5 34,-75.5 155,-75.5 155,-56.5 34,-56.5"/>
<text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/ncr_modulo_p.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M83.25,-56.32C72.7,-48.18 56.7,-35.84 44.06,-26.09"/>
<polygon fill="midnightblue" stroke="midnightblue" points="46.01,-23.17 35.95,-19.83 41.73,-28.71 46.01,-23.17"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67.5,-0.5 67.5,-19.5 121.5,-19.5 121.5,-0.5 67.5,-0.5"/>
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M94.5,-56.08C94.5,-49.01 94.5,-38.86 94.5,-29.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="98,-29.75 94.5,-19.75 91,-29.75 98,-29.75"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="139.5,-0.5 139.5,-19.5 183.5,-19.5 183.5,-0.5 139.5,-0.5"/>
<text text-anchor="middle" x="161.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M105.26,-56.32C115.27,-48.26 130.39,-36.08 142.43,-26.37"/>
<polygon fill="midnightblue" stroke="midnightblue" points="144.95,-28.83 150.54,-19.83 140.56,-23.38 144.95,-28.83"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.9 KiB

8
d4/d86/large__number_8h_source.html
View File

@@ -424,7 +424,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="aclass_complex_html_a889215b7b004a3e7ec4d785ca5e7a2ba"><div class="ttname"><a href="../../da/d5a/class_complex.html#a889215b7b004a3e7ec4d785ca5e7a2ba">Complex::operator=</a></div><div class="ttdeci">const Complex &amp; operator=(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Compl...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:160</div></div> <div class="ttc" id="aclass_complex_html_a889215b7b004a3e7ec4d785ca5e7a2ba"><div class="ttname"><a href="../../da/d5a/class_complex.html#a889215b7b004a3e7ec4d785ca5e7a2ba">Complex::operator=</a></div><div class="ttdeci">const Complex &amp; operator=(const Complex &amp;other)</div><div class="ttdoc">Operator overload of '=' on Complex class. Operator overload to be able to copy RHS instance of Compl...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:160</div></div>
<div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gcd_recursive_euclidean.cpp:42</div></div> <div class="ttc" id="agcd__recursive__euclidean_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> gcd_recursive_euclidean.cpp:42</div></div>
<div class="ttc" id="aclasslarge__number_html_ac09a05ec4aafb4d9e0b4440d6f0e2a93"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number::num_digits</a></div><div class="ttdeci">size_t num_digits() const</div><div class="ttdef"><b>Definition:</b> large_number.h:130</div></div> <div class="ttc" id="aclasslarge__number_html_ac09a05ec4aafb4d9e0b4440d6f0e2a93"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac09a05ec4aafb4d9e0b4440d6f0e2a93">large_number::num_digits</a></div><div class="ttdeci">size_t num_digits() const</div><div class="ttdef"><b>Definition:</b> large_number.h:130</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:135</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:136</div></div>
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div> <div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
<div class="ttc" id="aclasslarge__number_html_ac27b399ed872731758ec33ebb102730e"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e">large_number::operator+=</a></div><div class="ttdeci">large_number &amp; operator+=(large_number n)</div><div class="ttdef"><b>Definition:</b> large_number.h:192</div></div> <div class="ttc" id="aclasslarge__number_html_ac27b399ed872731758ec33ebb102730e"><div class="ttname"><a href="../../db/d82/classlarge__number.html#ac27b399ed872731758ec33ebb102730e">large_number::operator+=</a></div><div class="ttdeci">large_number &amp; operator+=(large_number n)</div><div class="ttdef"><b>Definition:</b> large_number.h:192</div></div>
<div class="ttc" id="acheck__prime_8cpp_html_aa18b3517017d99bb4024853bddba5532"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a></div><div class="ttdeci">bool is_prime(T num)</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:22</div></div> <div class="ttc" id="acheck__prime_8cpp_html_aa18b3517017d99bb4024853bddba5532"><div class="ttname"><a href="../../db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">is_prime</a></div><div class="ttdeci">bool is_prime(T num)</div><div class="ttdef"><b>Definition:</b> check_prime.cpp:22</div></div>
@@ -452,12 +452,12 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="aclass_complex_html_a8d5427f6c42c15283031d73e1418c59d"><div class="ttname"><a href="../../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d">Complex::operator~</a></div><div class="ttdeci">Complex operator~() const</div><div class="ttdoc">Operator overload of '~' on Complex class. Operator overload of the BITWISE NOT which gives us the co...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:130</div></div> <div class="ttc" id="aclass_complex_html_a8d5427f6c42c15283031d73e1418c59d"><div class="ttname"><a href="../../da/d5a/class_complex.html#a8d5427f6c42c15283031d73e1418c59d">Complex::operator~</a></div><div class="ttdeci">Complex operator~() const</div><div class="ttdoc">Operator overload of '~' on Complex class. Operator overload of the BITWISE NOT which gives us the co...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:130</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_af738b2a6921f0a6868bb7c5b4c0d18e0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#af738b2a6921f0a6868bb7c5b4c0d18e0">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;os, const Complex &amp;num)</div><div class="ttdoc">Operator overload of '&lt;&lt;' of ostream for Complex class. Overloaded insersion operator to accommodate ...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:186</div></div> <div class="ttc" id="acomplex__numbers_8cpp_html_af738b2a6921f0a6868bb7c5b4c0d18e0"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#af738b2a6921f0a6868bb7c5b4c0d18e0">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;os, const Complex &amp;num)</div><div class="ttdoc">Operator overload of '&lt;&lt;' of ostream for Complex class. Overloaded insersion operator to accommodate ...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:186</div></div>
<div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div> <div class="ttc" id="areal_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/real.html">std::complex::real</a></div><div class="ttdeci">T real(T... args)</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_a493fbaa7a94e3b7ca573111237bb3742"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a></div><div class="ttdeci">uint64_t fiboSum(uint64_t n, uint64_t m)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:89</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_a493fbaa7a94e3b7ca573111237bb3742"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#a493fbaa7a94e3b7ca573111237bb3742">math::fibonacci_sum::fiboSum</a></div><div class="ttdeci">uint64_t fiboSum(uint64_t n, uint64_t m)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:90</div></div>
<div class="ttc" id="aclasslarge__number_html_aeb22d2aae39d1b1e0bd39c7f47b333eb"><div class="ttname"><a href="../../db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb">large_number::operator=</a></div><div class="ttdeci">large_number &amp; operator=(const large_number &amp;b)</div><div class="ttdef"><b>Definition:</b> large_number.h:229</div></div> <div class="ttc" id="aclasslarge__number_html_aeb22d2aae39d1b1e0bd39c7f47b333eb"><div class="ttname"><a href="../../db/d82/classlarge__number.html#aeb22d2aae39d1b1e0bd39c7f47b333eb">large_number::operator=</a></div><div class="ttdeci">large_number &amp; operator=(const large_number &amp;b)</div><div class="ttdef"><b>Definition:</b> large_number.h:229</div></div>
<div class="ttc" id="aextended__euclid__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:87</div></div> <div class="ttc" id="aextended__euclid__algorithm_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> extended_euclid_algorithm.cpp:87</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a5712edca101204eca8accdb1e096707f"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a></div><div class="ttdeci">uint64_t fib(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:30</div></div> <div class="ttc" id="afibonacci__fast_8cpp_html_a5712edca101204eca8accdb1e096707f"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a5712edca101204eca8accdb1e096707f">fib</a></div><div class="ttdeci">uint64_t fib(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:30</div></div>
<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:100</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:101</div></div>
<div class="ttc" id="acomplex__numbers_8cpp_html_a5a73e9d4e68af8cedb95bd0864054b89"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89">operator==</a></div><div class="ttdeci">bool operator==(const Complex &amp;a, const Complex &amp;b)</div><div class="ttdoc">Operator overload of '==' on Complex class. Logical Equal overload for our Complex class.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:175</div></div> <div class="ttc" id="acomplex__numbers_8cpp_html_a5a73e9d4e68af8cedb95bd0864054b89"><div class="ttname"><a href="../../d5/d67/complex__numbers_8cpp.html#a5a73e9d4e68af8cedb95bd0864054b89">operator==</a></div><div class="ttdeci">bool operator==(const Complex &amp;a, const Complex &amp;b)</div><div class="ttdoc">Operator overload of '==' on Complex class. Logical Equal overload for our Complex class.</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:175</div></div>
<div class="ttc" id="aclasslarge__number_html_af2b3ec9c35842d3a46ac7326f268af57"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number::_digits</a></div><div class="ttdeci">std::vector&lt; unsigned char &gt; _digits</div><div class="ttdef"><b>Definition:</b> large_number.h:285</div></div> <div class="ttc" id="aclasslarge__number_html_af2b3ec9c35842d3a46ac7326f268af57"><div class="ttname"><a href="../../db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number::_digits</a></div><div class="ttdeci">std::vector&lt; unsigned char &gt; _digits</div><div class="ttdef"><b>Definition:</b> large_number.h:285</div></div>
<div class="ttc" id="ais_integral_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a></div></div> <div class="ttc" id="ais_integral_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/is_integral.html">std::is_integral</a></div></div>
@@ -504,7 +504,7 @@ $(document).ready(function(){initNavTree('d4/d86/large__number_8h_source.html','
<div class="ttc" id="aclasslarge__number_html_a70d23d67535e67030db570e56c00e16d"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a70d23d67535e67030db570e56c00e16d">large_number::operator+</a></div><div class="ttdeci">friend large_number &amp; operator+(const large_number &amp;a, const T &amp;b)</div><div class="ttdef"><b>Definition:</b> large_number.h:220</div></div> <div class="ttc" id="aclasslarge__number_html_a70d23d67535e67030db570e56c00e16d"><div class="ttname"><a href="../../db/d82/classlarge__number.html#a70d23d67535e67030db570e56c00e16d">large_number::operator+</a></div><div class="ttdeci">friend large_number &amp; operator+(const large_number &amp;a, const T &amp;b)</div><div class="ttdef"><b>Definition:</b> large_number.h:220</div></div>
<div class="ttc" id="acheck__amicable__pair_8cpp_html_afeb67e204ec7de02ad152c11df4d1e01"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:48</div></div> <div class="ttc" id="acheck__amicable__pair_8cpp_html_afeb67e204ec7de02ad152c11df4d1e01"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">are_amicable</a></div><div class="ttdeci">bool are_amicable(int x, int y)</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:48</div></div>
<div class="ttc" id="acheck__amicable__pair_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:68</div></div> <div class="ttc" id="acheck__amicable__pair_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/df6/check__amicable__pair_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> check_amicable_pair.cpp:68</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div> <div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->

48
d4/d9d/sum__of__binomial__coefficient_8cpp.html
View File

@@ -100,8 +100,8 @@ $(document).ready(function(){initNavTree('d4/d9d/sum__of__binomial__coefficient_
<p>Algorithm to find sum of binomial coefficients of a given positive integer. <p>Algorithm to find sum of binomial coefficients of a given positive integer.
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br /> <code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for sum_of_binomial_coefficient.cpp:</div> Include dependency graph for sum_of_binomial_coefficient.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -148,10 +148,10 @@ Functions</h2></td></tr>
<p>Main function. </p> <p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160;{ </div> <div class="fragment"><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; {</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <a class="code" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="code" href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; <span class="keywordflow">return</span> 0; </div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160;} </div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -184,27 +184,27 @@ Here is the call graph for this function:</div>
</table> </table>
</div><div class="memdoc"> </div><div class="memdoc">
<p>Function for testing binomialCoeffSum function. test cases and assert statement. </p><dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl> <p>Function for testing binomialCoeffSum function. test cases and assert statement. </p><dl class="section return"><dt>Returns</dt><dd><code>void</code> </dd></dl>
<div class="fragment"><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160;{</div> <div class="fragment"><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160; {</div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordtype">int</span> test_case_1 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(2);</div> <div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160; <span class="keywordtype">int</span> test_case_1 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(2);</div>
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; assert(test_case_1==4);</div> <div class="line"><a name="l00039"></a><span class="lineno"> 39</span>&#160; assert(test_case_1 == 4);</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Test_case_1 Passed!&quot;</span>&lt;&lt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_1 Passed!&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; </div> <div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; </div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keywordtype">int</span> test_case_2 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(3);</div> <div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <span class="keywordtype">int</span> test_case_2 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(3);</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; assert(test_case_2==8);</div> <div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; assert(test_case_2 == 8);</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Test_case_2 Passed!&quot;</span>&lt;&lt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_2 Passed!&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; </div> <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; </div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordtype">int</span> test_case_3 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(4);</div> <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordtype">int</span> test_case_3 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(4);</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; assert(test_case_3==16);</div> <div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; assert(test_case_3 == 16);</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Test_case_3 Passed!&quot;</span>&lt;&lt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_3 Passed!&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; </div> <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; </div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordtype">int</span> test_case_4 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(5);</div> <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordtype">int</span> test_case_4 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(5);</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; assert(test_case_4==32);</div> <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; assert(test_case_4 == 32);</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Test_case_4 Passed!&quot;</span>&lt;&lt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_4 Passed!&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; </div> <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; </div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordtype">int</span> test_case_5 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(7);</div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordtype">int</span> test_case_5 = <a class="code" href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a>(7);</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; assert(test_case_5==128);</div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; assert(test_case_5 == 128);</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a>&lt;&lt;<span class="stringliteral">&quot;Test_case_5 Passed!&quot;</span>&lt;&lt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test_case_5 Passed!&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; } </div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -216,9 +216,9 @@ Here is the call graph for this function:</div>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> sum_of_binomial_coefficient.cpp:36</div></div> <div class="ttc" id="asum__of__binomial__coefficient_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d9d/sum__of__binomial__coefficient_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> sum_of_binomial_coefficient.cpp:37</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition:</b> sum_of_binomial_coefficient.cpp:24</div></div> <div class="ttc" id="anamespacemath_html_ae1ca505751f5a6d3977b86372cfe75ea"><div class="ttname"><a href="../../dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea">math::binomialCoeffSum</a></div><div class="ttdeci">uint64_t binomialCoeffSum(uint64_t n)</div><div class="ttdef"><b>Definition:</b> sum_of_binomial_coefficient.cpp:26</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div> <div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

112
d4/db9/namespacencr__modulo__p.html Normal file
View File

@@ -0,0 +1,112 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: ncr_modulo_p Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.20 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d4/db9/namespacencr__modulo__p.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">ncr_modulo_p Namespace Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html">nCr modulo p</a> implementation.
<a href="../../d4/db9/namespacencr__modulo__p.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html">nCr modulo p</a> implementation. </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d4/db9/namespacencr__modulo__p.html">ncr_modulo_p</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
</ul>
</div>
</body>
</html>

358
d5/d33/gram__schmidt_8cpp.html
View File

@@ -100,21 +100,22 @@ $(document).ready(function(){initNavTree('d5/d33/gram__schmidt_8cpp.html','../..
<p><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process">Gram Schmidt Orthogonalisation Process</a> <p><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process">Gram Schmidt Orthogonalisation Process</a>
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;array&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br /> <code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cmath&gt;</code><br /> <code>#include &lt;cmath&gt;</code><br />
<code>#include &lt;array&gt;</code><br /> <code>#include &lt;iostream&gt;</code><br />
<code>#include &quot;math.h&quot;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for gram_schmidt.cpp:</div> Include dependency graph for gram_schmidt.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d96/gram__schmidt_8cpp__incl.svg" width="331" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe> <div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/d96/gram__schmidt_8cpp__incl.svg" width="419" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div> </div>
</div> </div>
</div><table class="memberdecls"> </div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr> Namespaces</h2></td></tr>
<tr class="memitem:d3/d78/namespacelinear__algebra"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d78/namespacelinear__algebra.html">linear_algebra</a></td></tr> <tr class="memitem:d3/d78/namespacelinear__algebra"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/d78/namespacelinear__algebra.html">linear_algebra</a></td></tr>
<tr class="memdesc:d3/d78/namespacelinear__algebra"><td class="mdescLeft">&#160;</td><td class="mdescRight">Linear Algebra algorithms. <br /></td></tr> <tr class="memdesc:d3/d78/namespacelinear__algebra"><td class="mdescLeft">&#160;</td><td class="mdescRight">for io operations <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/d0f/namespacegram__schmidt"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d0f/namespacegram__schmidt.html">gram_schmidt</a></td></tr> <tr class="memitem:d4/d0f/namespacegram__schmidt"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d0f/namespacegram__schmidt.html">gram_schmidt</a></td></tr>
<tr class="memdesc:d4/d0f/namespacegram__schmidt"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process">Gram Schmidt Orthogonalisation Process</a> <br /></td></tr> <tr class="memdesc:d4/d0f/namespacegram__schmidt"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process">Gram Schmidt Orthogonalisation Process</a> <br /></td></tr>
@@ -138,8 +139,6 @@ Functions</h2></td></tr>
</table> </table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process">Gram Schmidt Orthogonalisation Process</a> </p> <div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process">Gram Schmidt Orthogonalisation Process</a> </p>
<p><br />
</p>
<p>Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.</p> <p>Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.</p>
<h3><a class="anchor" id="autotoc_md62"></a> <h3><a class="anchor" id="autotoc_md62"></a>
Algorithm</h3> Algorithm</h3>
@@ -189,15 +188,15 @@ Algorithm</h3>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; {</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vector &quot;</span> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vector &quot;</span> &lt;&lt; i + 1 &lt;&lt; <span class="stringliteral">&quot;: &quot;</span>;</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; B[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; B[i][j] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; }</div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; }</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; }</div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; }</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160;}</div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160;}</div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
@@ -241,13 +240,13 @@ Algorithm</h3>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd>sum </dd></dl> <dl class="section return"><dt>Returns</dt><dd>sum </dd></dl>
<div class="fragment"><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordtype">double</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">sum</a> = 0;</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordtype">double</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">sum</a> = 0;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <a class="code" href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">sum</a> += x[i] * y[i];</div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <a class="code" href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">sum</a> += x[i] * y[i];</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; }</div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; }</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">sum</a>;</div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">sum</a>;</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;}</div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -313,47 +312,58 @@ Here is the call graph for this function:</div>
<p>projected array created</p> <p>projected array created</p>
<p>we take the projection with all the previous vector and add them.</p> <p>we take the projection with all the previous vector and add them.</p>
<p>subtract total projection vector from the input vector</p> <p>subtract total projection vector from the input vector</p>
<div class="fragment"><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; {</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="keywordflow">if</span> (c &lt; r) { <span class="comment">/// we check whether appropriate dimensions are given or not.</span></div> <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; <span class="keywordflow">if</span> (c &lt; r) { <span class="comment">/// we check whether appropriate dimensions are given or not.</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div> <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Dimension of vector is less than number of vector, hence &quot;</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; &lt;&lt; <span class="stringliteral">&quot;Dimension of vector is less than number of vector, hence \n first &quot;</span></div> <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <span class="stringliteral">&quot;\n first &quot;</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; &lt;&lt; c &lt;&lt; <span class="stringliteral">&quot; vectors are orthogonalised\n&quot;</span>;</div> <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; &lt;&lt; c &lt;&lt; <span class="stringliteral">&quot; vectors are orthogonalised\n&quot;</span>;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; r = c;</div> <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; r = c;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; }</div> <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; }</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; </div> <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; </div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <span class="keywordtype">int</span> k = 1;</div> <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; <span class="keywordtype">int</span> k = 1;</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; </div> <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; </div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <span class="keywordflow">while</span> (k &lt;= r) {</div> <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="keywordflow">while</span> (k &lt;= r) {</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <span class="keywordflow">if</span> (k == 1) {</div> <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="keywordflow">if</span> (k == 1) {</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; j++) B[0][j] = A[0][j]; <span class="comment">///First vector is copied as it is.</span></div> <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; j++)</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160;<span class="comment"></span> }</div> <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; B[0][j] = A[0][j]; <span class="comment">/// First vector is copied as it is.</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; </div> <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160;<span class="comment"></span> }</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="keywordflow">else</span> {</div> <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; </div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 10&gt;</a> all_projection{}; <span class="comment">///array to store projections</span></div> <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div> <div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 10&gt;</a></div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; all_projection[i] = 0; <span class="comment">///First initialised to zero</span></div> <div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; all_projection{}; <span class="comment">/// array to store projections</span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160;<span class="comment"></span> }</div> <div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; </div> <div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; all_projection[i] = 0; <span class="comment">/// First initialised to zero</span></div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <span class="keywordtype">int</span> l = 1;</div> <div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160;<span class="comment"></span> }</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <span class="keywordflow">while</span> (l &lt; k) {</div> <div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; </div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 10&gt;</a> temp{}; <span class="comment">///to store previous projected array</span></div> <div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; <span class="keywordtype">int</span> l = 1;</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160;<span class="comment"></span> <span class="keywordtype">double</span> factor; <span class="comment">///to store the factor by which the previous array will change </span></div> <div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <span class="keywordflow">while</span> (l &lt; k) {</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160;<span class="comment"></span> factor = <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">projection</a>(A[k - 1], B[l - 1], c);</div> <div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;double, 10&gt;</a></div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; c; ++i)</div> <div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; temp{}; <span class="comment">/// to store previous projected array</span></div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; temp[i] = B[l - 1][i] * factor; <span class="comment">///projected array created</span></div> <div class="line"><a name="l00150"></a><span class="lineno"> 150</span>&#160;<span class="comment"></span> <span class="keywordtype">double</span> factor = NAN; <span class="comment">/// to store the factor by which the</span></div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div> <div class="line"><a name="l00151"></a><span class="lineno"> 151</span>&#160;<span class="comment"></span><span class="comment"> /// previous array will change</span></div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; all_projection[j] = all_projection[j] + temp[j]; <span class="comment">///we take the projection with all the previous vector and add them.</span></div> <div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160;<span class="comment"></span> factor = <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">projection</a>(A[k - 1], B[l - 1], c);</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160;<span class="comment"></span> }</div> <div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; l++;</div> <div class="line"><a name="l00154"></a><span class="lineno"> 154</span>&#160; temp[i] = B[l - 1][i] * factor; <span class="comment">/// projected array created</span></div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; }</div> <div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160;<span class="comment"></span> }</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div> <div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; B[k - 1][i] = A[k - 1][i] - all_projection[i]; <span class="comment">///subtract total projection vector from the input vector</span></div> <div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; all_projection[j] =</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160;<span class="comment"></span> }</div> <div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; all_projection[j] +</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; }</div> <div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; temp[j]; <span class="comment">/// we take the projection with all the</span></div>
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>&#160; k++;</div> <div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160;<span class="comment"></span><span class="comment"> /// previous vector and add them.</span></div>
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>&#160; }</div> <div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160;<span class="comment"></span> }</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; display(r, c, B); <span class="comment">//for displaying orthogoanlised vectors</span></div> <div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; l++;</div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160;}</div> <div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; }</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; c; ++i) {</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; B[k - 1][i] =</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; A[k - 1][i] -</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; all_projection[i]; <span class="comment">/// subtract total projection vector</span></div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160;<span class="comment"></span><span class="comment"> /// from the input vector</span></div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160;<span class="comment"></span> }</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; }</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; k++;</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; }</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; display(r, c, B); <span class="comment">// for displaying orthogoanlised vectors</span></div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -387,45 +397,49 @@ Here is the call graph for this function:</div>
<p>Input of vectors is taken</p> <p>Input of vectors is taken</p>
<p>To check whether vectors are orthogonal or not</p> <p>To check whether vectors are orthogonal or not</p>
<p>take make the process numerically stable, upper bound for the dot product take 0.1</p> <p>take make the process numerically stable, upper bound for the dot product take 0.1</p>
<div class="fragment"><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; {</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <span class="keywordtype">int</span> r=0, c=0;</div> <div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; <span class="keywordtype">int</span> r = 0, c = 0;</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// perform self tests</span></div> <div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// perform self tests</span></div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the dimension of your vectors\n&quot;</span>;</div> <div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the dimension of your vectors\n&quot;</span>;</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; c;</div> <div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; c;</div>
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of vectors you will enter\n&quot;</span>;</div> <div class="line"><a name="l00253"></a><span class="lineno"> 253</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter the number of vectors you will enter\n&quot;</span>;</div>
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; r;</div> <div class="line"><a name="l00254"></a><span class="lineno"> 254</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; r;</div>
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; </div> <div class="line"><a name="l00255"></a><span class="lineno"> 255</span>&#160; </div>
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt;</div> <div class="line"><a name="l00256"></a><span class="lineno"> 256</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt;</div>
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; A{}; <span class="comment">///a 2-D array for storing all vectors</span></div> <div class="line"><a name="l00257"></a><span class="lineno"> 257</span>&#160; A{}; <span class="comment">/// a 2-D array for storing all vectors</span></div>
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; B = {</div> <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; B = {</div>
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; {0}}; <span class="comment">/// a 2-D array for storing orthogonalised vectors</span></div> <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; {0}}; <span class="comment">/// a 2-D array for storing orthogonalised vectors</span></div>
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160;<span class="comment"></span><span class="comment"> /// storing vectors in array A</span></div> <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160;<span class="comment"></span><span class="comment"> /// storing vectors in array A</span></div>
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div> <div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r; ++i) {</div>
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter vector &quot;</span> &lt;&lt; i + 1 &lt;&lt;<span class="charliteral">&#39;\n&#39;</span>; <span class="comment">///Input of vectors is taken</span></div> <div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter vector &quot;</span> &lt;&lt; i + 1</div>
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div> <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>; <span class="comment">/// Input of vectors is taken</span></div>
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Value &quot;</span> &lt;&lt; j + 1 &lt;&lt; <span class="stringliteral">&quot;th of vector: &quot;</span>;</div> <div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; c; ++j) {</div>
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; A[i][j];</div> <div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Value &quot;</span> &lt;&lt; j + 1 &lt;&lt; <span class="stringliteral">&quot;th of vector: &quot;</span>;</div>
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; }</div> <div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; A[i][j];</div>
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt;<span class="charliteral">&#39;\n&#39;</span>;</div> <div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; }</div>
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; }</div> <div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; </div> <div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; }</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a>(r, c, A, B);</div> <div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; </div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; </div> <div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a>(r, c, A, B);</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; <span class="keywordtype">double</span> dot = 0;</div> <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; </div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; <span class="keywordtype">int</span> flag = 1; <span class="comment">///To check whether vectors are orthogonal or not</span></div> <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; <span class="keywordtype">double</span> dot = 0;</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r - 1; ++i) {</div> <div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; <span class="keywordtype">int</span> flag = 1; <span class="comment">/// To check whether vectors are orthogonal or not</span></div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; r; ++j) {</div> <div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; r - 1; ++i) {</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; dot = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(linear_algebra::gram_schmidt::dot_product(B[i], B[j], c));</div> <div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; r; ++j) {</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160; <span class="keywordflow">if</span> (dot &gt; 0.1) <span class="comment">/// take make the process numerically stable, upper bound for the dot product take 0.1</span></div> <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; dot =</div>
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160;<span class="comment"></span> {</div> <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(linear_algebra::gram_schmidt::dot_product(B[i], B[j], c));</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; flag = 0;</div> <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; <span class="keywordflow">if</span> (dot &gt; 0.1) <span class="comment">/// take make the process numerically stable, upper</span></div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; <span class="keywordflow">break</span>;</div> <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160;<span class="comment"></span><span class="comment"> /// bound for the dot product take 0.1</span></div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; }</div> <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160;<span class="comment"></span> {</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; }</div> <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; flag = 0;</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; }</div> <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; <span class="keywordflow">if</span> (flag == 0) <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>; </div> <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; }</div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; }</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160;}</div> <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; }</div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; <span class="keywordflow">if</span> (flag == 0)</div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -479,12 +493,17 @@ Here is the call graph for this function:</div>
<p>The dot product of two vectors is taken</p> <p>The dot product of two vectors is taken</p>
<p>The norm of the second vector is taken.</p> <p>The norm of the second vector is taken.</p>
<p>multiply that factor with every element in a 3rd vector, whose initial values are same as the 2nd vector.</p> <p>multiply that factor with every element in a 3rd vector, whose initial values are same as the 2nd vector.</p>
<div class="fragment"><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; {</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keywordtype">double</span> dot = <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">dot_product</a>(x, y, c); <span class="comment">///The dot product of two vectors is taken</span></div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <span class="keywordtype">double</span> dot =</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;<span class="comment"></span> <span class="keywordtype">double</span> anorm = <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">dot_product</a>(y, y, c); <span class="comment">///The norm of the second vector is taken.</span></div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">dot_product</a>(x, y, c); <span class="comment">/// The dot product of two vectors is taken</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160;<span class="comment"></span> <span class="keywordtype">double</span> factor = dot / anorm; <span class="comment">///multiply that factor with every element in a 3rd vector, whose initial values are same as the 2nd vector.</span></div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160;<span class="comment"></span> <span class="keywordtype">double</span> anorm =</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;<span class="comment"></span> <span class="keywordflow">return</span> factor;</div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">dot_product</a>(y, y, c); <span class="comment">/// The norm of the second vector is taken.</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160;}</div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160;<span class="comment"></span> <span class="keywordtype">double</span> factor =</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; dot /</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; anorm; <span class="comment">/// multiply that factor with every element in a 3rd vector,</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160;<span class="comment"></span><span class="comment"> /// whose initial values are same as the 2nd vector.</span></div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160;<span class="comment"></span> <span class="keywordflow">return</span> factor;</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -517,71 +536,80 @@ Here is the call graph for this function:</div>
</table> </table>
</div><div class="memdoc"> </div><div class="memdoc">
<p>Test Function. Process has been tested for 3 Sample Inputs </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <p>Test Function. Process has been tested for 3 Sample Inputs </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; {</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a1 = {</div> <div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a1 = {</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; {{1, 0, 1, 0}, {1, 1, 1, 1}, {0, 1, 2, 1}}};</div> <div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; {{1, 0, 1, 0}, {1, 1, 1, 1}, {0, 1, 2, 1}}};</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b1 = {{0}};</div> <div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b1 = {{0}};</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordtype">double</span> dot1 = 0;</div> <div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; <span class="keywordtype">double</span> dot1 = 0;</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a>(3, 4, a1, b1);</div> <div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a>(3, 4, a1, b1);</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; <span class="keywordtype">int</span> flag = 1;</div> <div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; <span class="keywordtype">int</span> flag = 1;</div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; ++i)</div> <div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 2; ++i) {</div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 3; ++j) {</div> <div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 3; ++j) {</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; dot1 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(linear_algebra::gram_schmidt::dot_product(b1[i], b1[j], 4));</div> <div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; dot1 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(</div>
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>&#160; <span class="keywordflow">if</span> (dot1 &gt; 0.1) {</div> <div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; linear_algebra::gram_schmidt::dot_product(b1[i], b1[j], 4));</div>
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>&#160; flag = 0;</div> <div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; <span class="keywordflow">if</span> (dot1 &gt; 0.1) {</div>
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>&#160; <span class="keywordflow">break</span>;</div> <div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; flag = 0;</div>
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>&#160; }</div> <div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>&#160; }</div> <div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; }</div>
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>&#160; <span class="keywordflow">if</span> (flag == 0) <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div> <div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; }</div>
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>&#160; assert(flag == 1);</div> <div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; }</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 1\n &quot;</span>;</div> <div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; <span class="keywordflow">if</span> (flag == 0)</div>
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>&#160; </div> <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a2 = {{{3, 1}, {2, 2}}};</div> <div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; assert(flag == 1);</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b2 = {{0}};</div> <div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 1\n &quot;</span>;</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; <span class="keywordtype">double</span> dot2 = 0;</div> <div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; </div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a>(2, 2, a2, b2);</div> <div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a2 = {{{3, 1}, {2, 2}}};</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; flag = 1;</div> <div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b2 = {{0}};</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i)</div> <div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; <span class="keywordtype">double</span> dot2 = 0;</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div> <div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a>(2, 2, a2, b2);</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; dot2 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(linear_algebra::gram_schmidt::dot_product(b2[i], b2[j], 2));</div> <div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160; flag = 1;</div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; <span class="keywordflow">if</span> (dot2 &gt; 0.1) {</div> <div class="line"><a name="l00208"></a><span class="lineno"> 208</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i) {</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; flag = 0;</div> <div class="line"><a name="l00209"></a><span class="lineno"> 209</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="keywordflow">break</span>;</div> <div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; dot2 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; }</div> <div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; linear_algebra::gram_schmidt::dot_product(b2[i], b2[j], 2));</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; }</div> <div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; <span class="keywordflow">if</span> (dot2 &gt; 0.1) {</div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; <span class="keywordflow">if</span> (flag == 0) <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div> <div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; flag = 0;</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; assert(flag == 1);</div> <div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 2\n&quot;</span>;</div> <div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; }</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; </div> <div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; }</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a3 = {{{1, 2, 2}, {-4, 3, 2}}};</div> <div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160; }</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b3 = {{0}};</div> <div class="line"><a name="l00218"></a><span class="lineno"> 218</span>&#160; <span class="keywordflow">if</span> (flag == 0)</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="keywordtype">double</span> dot3 = 0;</div> <div class="line"><a name="l00219"></a><span class="lineno"> 219</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a>(2, 3, a3, b3);</div> <div class="line"><a name="l00220"></a><span class="lineno"> 220</span>&#160; assert(flag == 1);</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; flag = 1;</div> <div class="line"><a name="l00221"></a><span class="lineno"> 221</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 2\n&quot;</span>;</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i)</div> <div class="line"><a name="l00222"></a><span class="lineno"> 222</span>&#160; </div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div> <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; a3 = {{{1, 2, 2}, {-4, 3, 2}}};</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; dot3 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(linear_algebra::gram_schmidt::dot_product(b3[i], b3[j], 3));</div> <div class="line"><a name="l00224"></a><span class="lineno"> 224</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;std::array&lt;double, 10&gt;</a>, 20&gt; b3 = {{0}};</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; <span class="keywordflow">if</span> (dot3 &gt; 0.1) {</div> <div class="line"><a name="l00225"></a><span class="lineno"> 225</span>&#160; <span class="keywordtype">double</span> dot3 = 0;</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; flag = 0;</div> <div class="line"><a name="l00226"></a><span class="lineno"> 226</span>&#160; <a class="code" href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a>(2, 3, a3, b3);</div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; <span class="keywordflow">break</span>;</div> <div class="line"><a name="l00227"></a><span class="lineno"> 227</span>&#160; flag = 1;</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160; }</div> <div class="line"><a name="l00228"></a><span class="lineno"> 228</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 1; ++i) {</div>
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>&#160; }</div> <div class="line"><a name="l00229"></a><span class="lineno"> 229</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j &lt; 2; ++j) {</div>
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>&#160; <span class="keywordflow">if</span> (flag == 0) <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span> ;</div> <div class="line"><a name="l00230"></a><span class="lineno"> 230</span>&#160; dot3 = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">fabs</a>(</div>
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>&#160; assert(flag == 1);</div> <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>&#160; linear_algebra::gram_schmidt::dot_product(b3[i], b3[j], 3));</div>
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 3\n&quot;</span>;</div> <div class="line"><a name="l00232"></a><span class="lineno"> 232</span>&#160; <span class="keywordflow">if</span> (dot3 &gt; 0.1) {</div>
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>&#160;}</div> <div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; flag = 0;</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="keywordflow">break</span>;</div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; }</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; }</div>
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>&#160; }</div>
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>&#160; <span class="keywordflow">if</span> (flag == 0)</div>
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Vectors are linearly dependent\n&quot;</span>;</div>
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>&#160; assert(flag == 1);</div>
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test Case 3\n&quot;</span>;</div>
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>&#160;}</div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:155</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:181</div></div>
<div class="ttc" id="afabs_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a></div><div class="ttdeci">T fabs(T... args)</div></div> <div class="ttc" id="afabs_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/fabs.html">std::fabs</a></div><div class="ttdeci">T fabs(T... args)</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_aed4d308f46ca1d91e348ca260ec1d2fb"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">linear_algebra::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:53</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_aed4d308f46ca1d91e348ca260ec1d2fb"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">linear_algebra::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:59</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_a46e459aff5eafffb5ad9ceb129b4d274"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">linear_algebra::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:71</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_a46e459aff5eafffb5ad9ceb129b4d274"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">linear_algebra::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:79</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_aa31ca28f60c880802462335eedc5d91f"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a></div><div class="ttdeci">void gram_schmidt(int r, const int &amp;c, const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;A, std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; B)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:107</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_aa31ca28f60c880802462335eedc5d91f"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa31ca28f60c880802462335eedc5d91f">linear_algebra::gram_schmidt::gram_schmidt</a></div><div class="ttdeci">void gram_schmidt(int r, const int &amp;c, const std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; &amp;A, std::array&lt; std::array&lt; double, 10 &gt;, 20 &gt; B)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:121</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div> <div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
<!-- start footer part --> <!-- start footer part -->

61
d5/d4c/group__sorting.html
View File

@@ -184,26 +184,22 @@ template&lt;typename T &gt; </div>
</dl> </dl>
<dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd> <dl class="section examples"><dt>Examples</dt><dd><a class="el" href="../../dd/db0/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2sorting_2wiggle_sort_8cpp-example.html#a4">/Users/runner/work/C-Plus-Plus/C-Plus-Plus/sorting/wiggle_sort.cpp</a>.</dd>
</dl> </dl>
<div class="fragment"><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; {</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; </div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; uint32_t size = arr.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; uint32_t size = arr.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; </div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; </div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted elements are as follows: &quot;</span>;</div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Sorted elements are as follows: &quot;</span>;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; </div> <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; </div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[&quot;</span>;</div> <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[&quot;</span>;</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; </div> <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; </div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0 ; i &lt; size ; i++ ) {</div> <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; size; i++) {</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; </div> <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i];</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; arr[i] ;</div> <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="keywordflow">if</span> (i != size - 1) {</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <span class="keywordflow">if</span>(i != size - 1) {</div> <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, &quot;</span>;</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;, &quot;</span> ;</div> <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; }</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; }</div> <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; }</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; </div> <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; </div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; }</div> <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;]&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; </div> <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160;}</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;]&quot;</span>&lt;&lt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; </div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160;}</div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
@@ -484,26 +480,25 @@ Here is the call graph for this function:</div>
</table> </table>
</div><div class="memdoc"> </div><div class="memdoc">
<p>Test function </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <p>Test function </p><dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; {</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; </div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>)); <span class="comment">// initialize random number generator</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>)); <span class="comment">// initialize random number generator</span></div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; </div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; </div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> data1(100);</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> data1(100);</div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;d : data1) { <span class="comment">// generate random numbers between -5.0 and 4.99</span></div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> &amp;d: data1) { <span class="comment">// generate random numbers between -5.0 and 4.99</span></div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; d = float(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000 - 500) / 100.f;</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; d = float(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() % 1000 - 500) / 100.f;</div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; }</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; }</div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; </div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> sorted = sorting::wiggle_sort::wiggleSort&lt;float&gt;(data1);</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; </div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <a class="code" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(sorted);</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; </div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; </div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;float&gt;</a> sorted = sorting::wiggle_sort::wiggleSort&lt;float&gt;(data1);</div> <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <span class="keywordflow">for</span> (uint32_t j = 0; j &lt; data1.size(); j += 2) {</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; </div> <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; assert(data1[j] &lt;= data1[j + 1] &amp;&amp;</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <a class="code" href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a>(sorted);</div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; data1[j + 1] &gt;= data1[j + 2]); <span class="comment">// check the validation condition</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; </div> <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; }</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <span class="keywordflow">for</span>(uint32_t j = 0; j &lt; data1.size(); j+=2) {</div> <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; </div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; assert(data1[j] &lt;= data1[j+1] &amp;&amp; data1[j+1] &gt;= data1[j+2]); <span class="comment">// check the validation condition</span></div> <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; }</div> <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160;}</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; </div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1 passed\n&quot;</span>;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; </div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -522,7 +517,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition:</b> merge_sort.cpp:71</div></div> <div class="ttc" id="agroup__sorting_html_gab6b14fea48d9841e29b9fc26be6e05d7"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">mergeSort</a></div><div class="ttdeci">void mergeSort(int *arr, int l, int r)</div><div class="ttdef"><b>Definition:</b> merge_sort.cpp:71</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition:</b> merge_sort.cpp:33</div></div> <div class="ttc" id="agroup__sorting_html_ga460c61cd948203b4816bef2accb3fc73"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge</a></div><div class="ttdeci">void merge(int *arr, int l, int m, int r)</div><div class="ttdef"><b>Definition:</b> merge_sort.cpp:33</div></div>
<div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:84</div></div> <div class="ttc" id="agroup__sorting_html_ga135e4c638e3bcf548bd122b5f49a3e72"><div class="ttname"><a href="../../d5/d4c/group__sorting.html#ga135e4c638e3bcf548bd122b5f49a3e72">displayElements</a></div><div class="ttdeci">static void displayElements(const std::vector&lt; T &gt; &amp;arr)</div><div class="ttdoc">Utility function used for printing the elements. Prints elements of the array after they're sorted us...</div><div class="ttdef"><b>Definition:</b> wiggle_sort.cpp:85</div></div>
<div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div> <div class="ttc" id="arand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a></div><div class="ttdeci">T rand(T... args)</div></div>
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div> <div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div> <div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>

6
d5/d55/classgraph_1_1_rooted_tree-members.html
View File

@@ -98,9 +98,9 @@ $(document).ready(function(){initNavTree('d0/d58/classgraph_1_1_rooted_tree.html
<p>This is the complete list of members for <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a>, including all inherited members.</p> <p>This is the complete list of members for <a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a>, including all inherited members.</p>
<table class="directory"> <table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(T u, T v, bool bidir=true)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(T u, T v, bool bidir=true)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">adjacency_list</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr> <tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a6e3efabd5e401ef0f47c179866e7454e">breadth_first_search</a>(T src)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ab1a1a96cd4cddf0d4feb02855c4c16af">breadth_first_search</a>(T src)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>Graph</b>() (defined in <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a>)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr bgcolor="#f0f0f0"><td class="entry"><b>Graph</b>()=default (defined in <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a>)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a>(size_t N, const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a>(size_t N, const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a></td><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></td><td class="entry"></td></tr> <tr><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3">level</a></td><td class="entry"><a class="el" href="../../d0/d58/classgraph_1_1_rooted_tree.html">graph::RootedTree</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"></td></tr> <tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"></td></tr>

2
d5/d67/complex__numbers_8cpp.html
View File

@@ -368,7 +368,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="acomplex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex.html">std::complex</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div> <div class="ttc" id="aimag_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/complex/imag.html">std::complex::imag</a></div><div class="ttdeci">T imag(T... args)</div></div>
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div> <div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

6
d5/d83/lcm__sum_8cpp.html
View File

@@ -100,8 +100,8 @@ $(document).ready(function(){initNavTree('d5/d83/lcm__sum_8cpp.html','../../');
<p>An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\). <p>An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\).
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br /> <code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br /> <code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for lcm_sum.cpp:</div> Include dependency graph for lcm_sum.cpp:</div>
@@ -224,7 +224,7 @@ Here is the call graph for this function:</div>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="anamespacemath_html_a04065193d190d605e1f0d0d93a87e244"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a></div><div class="ttdeci">uint64_t lcmSum(const uint16_t &amp;num)</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:28</div></div> <div class="ttc" id="anamespacemath_html_a04065193d190d605e1f0d0d93a87e244"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a04065193d190d605e1f0d0d93a87e244">math::lcmSum</a></div><div class="ttdeci">uint64_t lcmSum(const uint16_t &amp;num)</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:29</div></div>
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:592</div></div> <div class="ttc" id="aheavy__light__decomposition_8cpp_html_af31ec5409537703d9c8a47350386b32a"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a">test_3</a></div><div class="ttdeci">static void test_3()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:592</div></div>
<div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:549</div></div> <div class="ttc" id="aheavy__light__decomposition_8cpp_html_a458410412185a5f09199deaff7157a8d"><div class="ttname"><a href="../../d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d">test_2</a></div><div class="ttdeci">static void test_2()</div><div class="ttdef"><b>Definition:</b> heavy_light_decomposition.cpp:549</div></div>
<div class="ttc" id="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:65</div></div> <div class="ttc" id="alcm__sum_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d83/lcm__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> lcm_sum.cpp:65</div></div>

1
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@@ -275,6 +275,7 @@ Math</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_exponentiation.cpp">Modular Exponentiation</a></li> <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_exponentiation.cpp">Modular Exponentiation</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_inverse_fermat_little_theorem.cpp">Modular Inverse Fermat Little Theorem</a></li> <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/modular_inverse_fermat_little_theorem.cpp">Modular Inverse Fermat Little Theorem</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/n_choose_r.cpp">N Choose R</a></li> <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/n_choose_r.cpp">N Choose R</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/ncr_modulo_p.cpp">Ncr Modulo P</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/number_of_positive_divisors.cpp">Number Of Positive Divisors</a></li> <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/number_of_positive_divisors.cpp">Number Of Positive Divisors</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/power_for_huge_numbers.cpp">Power For Huge Numbers</a></li> <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/power_for_huge_numbers.cpp">Power For Huge Numbers</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/prime_factorization.cpp">Prime Factorization</a></li> <li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/prime_factorization.cpp">Prime Factorization</a></li>

156
d5/d90/palindrome__partitioning_8cpp.html
View File

@@ -100,11 +100,11 @@ $(document).ready(function(){initNavTree('d5/d90/palindrome__partitioning_8cpp.h
<p>Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make. <p>Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make.
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br /> <code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;climits&gt;</code><br /> <code>#include &lt;climits&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for palindrome_partitioning.cpp:</div> Include dependency graph for palindrome_partitioning.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -134,7 +134,8 @@ Functions</h2></td></tr>
</table> </table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make. </p> <div class="textblock"><p>Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make. </p>
<p>palindrome partitioning uses dynamic programming and goes to all the possible partitions to find the minimum you are given a string and you need to give minimum number of partitions needed to divide it into a number of palindromes <a href="https://www.geeksforgeeks.org/palindrome-partitioning-dp-17/">Palindrome Partitioning</a> overall time complexity O(n^2) For example: example 1:- String : "nitik" Output : 2 =&gt; "n | iti | k" For example: example 2:- String : "ababbbabbababa" Output : 3 =&gt; "aba | b | bbabb | ababa" </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/sujaykaushik008">Sujay Kaushik</a> </dd></dl> <p>palindrome partitioning uses dynamic programming and goes to all the possible partitions to find the minimum you are given a string and you need to give minimum number of partitions needed to divide it into a number of palindromes <a href="https://www.geeksforgeeks.org/palindrome-partitioning-dp-17/">Palindrome Partitioning</a> overall time complexity O(n^2) For example: example 1:- String : "nitik" Output : 2 =&gt; "n
| iti | k" For example: example 2:- String : "ababbbabbababa" Output : 3 =&gt; "aba | b | bbabb | ababa" </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/sujaykaushik008">Sujay Kaushik</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2> </div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a> <a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2> <h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>
@@ -154,10 +155,10 @@ Functions</h2></td></tr>
<p>Main function. </p> <p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; {</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <a class="code" href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div> <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <a class="code" href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160;}</div> <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -189,49 +190,52 @@ Here is the call graph for this function:</div>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd>minimum number of partitions </dd></dl> <dl class="section return"><dt>Returns</dt><dd>minimum number of partitions </dd></dl>
<div class="fragment"><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; {</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; </div> <div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordtype">int</span> n = str.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; <span class="keywordtype">int</span> n = str.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div> <div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; </div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; </div> <div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="comment">// creating lookup table for minimum number of cuts</span></div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="comment">// creating lookup table for minimum number of cuts</span></div> <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a> &gt; cuts(n, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(n, 0));</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;int&gt;</a> &gt; cuts(n, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a>(n, 0));</div> <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; </div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; </div> <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; <span class="comment">// creating lookup table for palindrome checking</span></div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="comment">// creating lookup table for palindrome checking</span></div> <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a> &gt; is_palindrome(n,</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;bool&gt;</a> &gt; is_palindrome(n, <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(n, <span class="keyword">false</span>));</div> <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;bool&gt;</a>(n, <span class="keyword">false</span>));</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; </div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; </div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="comment">// initialization</span></div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="comment">// initialization</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; is_palindrome[i][i] = <span class="keyword">true</span>;</div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; is_palindrome[i][i] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; cuts[i][i] = 0;</div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; cuts[i][i] = 0;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; }</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; }</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; </div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> len = 2; len &lt;= n; len++) {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start_index = 0; start_index &lt; n - len + 1; start_index++) {</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; </div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; </div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordtype">int</span> end_index = start_index + len - 1;</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> len = 2; len &lt;= n; len++) {</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; </div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> start_index = 0; start_index &lt; n - len + 1; start_index++) {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordflow">if</span> (len == 2) {</div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordtype">int</span> end_index = start_index + len - 1;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; is_palindrome[start_index][end_index] = (str[start_index] == str[end_index]);</div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; </div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; } <span class="keywordflow">else</span> {</div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">if</span> (len == 2) {</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; is_palindrome[start_index][end_index] =</div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; is_palindrome[start_index][end_index] =</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; (str[start_index] == str[end_index]) &amp;&amp; is_palindrome[start_index + 1][end_index - 1];</div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; (str[start_index] == str[end_index]);</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; }</div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; </div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; is_palindrome[start_index][end_index] =</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="keywordflow">if</span> (is_palindrome[start_index][end_index]) {</div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; (str[start_index] == str[end_index]) &amp;&amp;</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; cuts[start_index][end_index] = 0;</div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; is_palindrome[start_index + 1][end_index - 1];</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; } <span class="keywordflow">else</span> {</div> <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; }</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; cuts[start_index][end_index] = INT_MAX;</div> <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; </div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a> = start_index; <a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a> &lt;= end_index - 1; <a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a>++) {</div> <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">if</span> (is_palindrome[start_index][end_index]) {</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; cuts[start_index][end_index] = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(cuts[start_index][end_index],</div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; cuts[start_index][end_index] = 0;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; cuts[start_index][<a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a>] +</div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; cuts[<a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a> + 1][end_index] + 1);</div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; cuts[start_index][end_index] = INT_MAX;</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; }</div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a> = start_index; <a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a> &lt;= end_index - 1;</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; }</div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a>++) {</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; }</div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; cuts[start_index][end_index] =</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; }</div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(cuts[start_index][end_index],</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; </div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; cuts[start_index][<a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a>] +</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordflow">return</span> cuts[0][n - 1];</div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; cuts[<a class="code" href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">partition</a> + 1][end_index] + 1);</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; }</div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; }</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; }</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; }</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; }</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; </div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <span class="keywordflow">return</span> cuts[0][n - 1];</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -266,29 +270,31 @@ Here is the call graph for this function:</div>
<p>Test Function. </p> <p>Test Function. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; {</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="comment">// custom input vector</span></div> <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <span class="comment">// custom input vector</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> custom_input{<span class="stringliteral">&quot;nitik&quot;</span>, <span class="stringliteral">&quot;ababbbabbababa&quot;</span>, <span class="stringliteral">&quot;abdc&quot;</span>};</div> <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::string&gt;</a> custom_input{<span class="stringliteral">&quot;nitik&quot;</span>, <span class="stringliteral">&quot;ababbbabbababa&quot;</span>, <span class="stringliteral">&quot;abdc&quot;</span>};</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; </div> <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; </div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="comment">// calculated output vector by pal_part Function</span></div> <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; <span class="comment">// calculated output vector by pal_part Function</span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> calculated_output(3);</div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> calculated_output(3);</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; </div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; </div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; calculated_output[i] = <a class="code" href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a>(custom_input[i]);</div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; calculated_output[i] =</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; }</div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <a class="code" href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a>(</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; </div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; custom_input[i]);</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="comment">// expected output vector</span></div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; }</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected_output{2, 3, 3};</div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; </div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; </div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <span class="comment">// expected output vector</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="comment">// Testing implementation via assert function</span></div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> expected_output{2, 3, 3};</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; <span class="comment">// It will throw error if any of the expected test fails</span></div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; </div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="comment">// Else it will give nothing</span></div> <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <span class="comment">// Testing implementation via assert function</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div> <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="comment">// It will throw error if any of the expected test fails</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; assert(expected_output[i] == calculated_output[i]);</div> <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <span class="comment">// Else it will give nothing</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; }</div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 3; i++) {</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; </div> <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; assert(expected_output[i] == calculated_output[i]);</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div> <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; }</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160;}</div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; </div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests passed successfully!\n&quot;</span>;</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160;}</div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
@@ -296,11 +302,11 @@ Here is the call graph for this function:</div>
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div> <div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:92</div></div> <div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:98</div></div>
<div class="ttc" id="anamespacesorting_html_a7e7f25f31c50523990437abf2ac3907e"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">sorting::partition</a></div><div class="ttdeci">int partition(int arr[], int low, int high)</div><div class="ttdef"><b>Definition:</b> quick_sort.cpp:37</div></div> <div class="ttc" id="anamespacesorting_html_a7e7f25f31c50523990437abf2ac3907e"><div class="ttname"><a href="../../d5/d91/namespacesorting.html#a7e7f25f31c50523990437abf2ac3907e">sorting::partition</a></div><div class="ttdeci">int partition(int arr[], int low, int high)</div><div class="ttdef"><b>Definition:</b> quick_sort.cpp:37</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div> <div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:42</div></div> <div class="ttc" id="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:45</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

3
d5/d91/namespacesorting.html
View File

@@ -163,13 +163,12 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Sorting algorithms. </p> <div class="textblock"><p>Sorting algorithms. </p>
<p>for io operations</p> <p>for io operations</p>
<p>for a macro called assert which can be used to verify assumptions</p>
<p>Sorting Algorithms.</p> <p>Sorting Algorithms.</p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html" title="STL class.">std::vector</a></p> <p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html" title="STL class.">std::vector</a></p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> for assert for io operations</p> <p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a> for assert for io operations</p>
<p>Sorting algorithms</p> <p>Sorting algorithms</p>
<p>Sorting algorithms</p> <p>Sorting algorithms</p>
<p>header files for io operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html" title="STL class.">std::vector</a> for collection of functions</p> <p>header files for collection of functions for a macro called assert which can be used to verify assumptions for io operations</p>
<p>Sorting algorithms </p> <p>Sorting algorithms </p>
</div><h2 class="groupheader">Function Documentation</h2> </div><h2 class="groupheader">Function Documentation</h2>
<a id="a70a6a99d554280c326f80355c4d2c494"></a> <a id="a70a6a99d554280c326f80355c4d2c494"></a>

72
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html
View File

@@ -131,7 +131,7 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="..
<tr class="memdesc:a9883dfcceede9a42227d2d313ae86f85"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of tail of the array. <br /></td></tr> <tr class="memdesc:a9883dfcceede9a42227d2d313ae86f85"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of tail of the array. <br /></td></tr>
<tr class="separator:a9883dfcceede9a42227d2d313ae86f85"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a9883dfcceede9a42227d2d313ae86f85"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memItemLeft" align="right" valign="top"><a id="ae69a0bf6c9921b37c516c8a4d2fb904d"></a> <tr class="memitem:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memItemLeft" align="right" valign="top"><a id="ae69a0bf6c9921b37c516c8a4d2fb904d"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int16_t, <a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a></td></tr> <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int16_t, <a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a> {}</td></tr>
<tr class="memdesc:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="mdescLeft">&#160;</td><td class="mdescRight">All stored data. <br /></td></tr> <tr class="memdesc:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="mdescLeft">&#160;</td><td class="mdescRight">All stored data. <br /></td></tr>
<tr class="separator:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table> </table>
@@ -156,20 +156,20 @@ int8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="..
<p>Delete element from back of the queue. </p> <p>Delete element from back of the queue. </p>
<p>Remove element that is located at the first of the queue.</p> <p>Remove element that is located at the first of the queue.</p>
<dl class="section return"><dt>Returns</dt><dd>data that is deleted if queue is not empty </dd></dl> <dl class="section return"><dt>Returns</dt><dd>data that is deleted if queue is not empty </dd></dl>
<div class="fragment"><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; {</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; int8_t d{0};</div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; int8_t d{0};</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nstack is empty &quot;</span>;</div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nstack is empty &quot;</span>;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>) {</div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>) {</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; d = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>);</div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; d = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>);</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> = -1;</div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> = -1;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; } <span class="keywordflow">else</span> {</div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; d = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>++);</div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; d = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>++);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; }</div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; }</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; </div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; </div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keywordflow">return</span> d;</div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="keywordflow">return</span> d;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160;}</div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -196,13 +196,13 @@ Here is the call graph for this function:</div>
<p>Show all saved data. </p> <p>Show all saved data. </p>
<p>Utility function to show all elements in the queue. </p> <p>Utility function to show all elements in the queue. </p>
<div class="fragment"><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; {</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div> <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div> <div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; } <span class="keywordflow">else</span> {</div> <div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="keywordflow">for</span> (int16_t i{<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>}; i &lt;= <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>; ++i) <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div> <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="keywordflow">for</span> (int16_t i{<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>}; i &lt;= <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>; ++i) <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; }</div> <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; }</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160;}</div> <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -236,18 +236,18 @@ Here is the call graph for this function:</div>
</table> </table>
</dd> </dd>
</dl> </dl>
<div class="fragment"><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; {</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> == <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1) {</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> == <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1) {</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is full&quot;</span>;</div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is full&quot;</span>;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1 &amp;&amp; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> == -1) {</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1 &amp;&amp; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> == -1) {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = 0;</div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = 0;</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> = 0;</div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> = 0;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> &lt; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()) {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; ++<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; }</div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> &lt; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()) {</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;}</div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; ++<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>;</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; }</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -262,12 +262,12 @@ Here is the call graph for this function:</div>
</ul> </ul>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2f676f2f249eb36dfd49711a03e9e67e"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array::front</a></div><div class="ttdeci">int8_t front</div><div class="ttdoc">Index of head of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:46</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2f676f2f249eb36dfd49711a03e9e67e"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array::front</a></div><div class="ttdeci">int8_t front</div><div class="ttdoc">Index of head of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:49</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(T... args)</div></div> <div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/at.html">std::array::at</a></div><div class="ttdeci">T at(T... args)</div></div> <div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/at.html">std::array::at</a></div><div class="ttdeci">T at(T... args)</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a9883dfcceede9a42227d2d313ae86f85"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array::rear</a></div><div class="ttdeci">int8_t rear</div><div class="ttdoc">Index of tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:47</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a9883dfcceede9a42227d2d313ae86f85"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array::rear</a></div><div class="ttdeci">int8_t rear</div><div class="ttdoc">Index of tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:50</div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_ae69a0bf6c9921b37c516c8a4d2fb904d"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array::arr</a></div><div class="ttdeci">std::array&lt; int16_t, max_size &gt; arr</div><div class="ttdoc">All stored data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:48</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_ae69a0bf6c9921b37c516c8a4d2fb904d"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array::arr</a></div><div class="ttdeci">std::array&lt; int16_t, max_size &gt; arr</div><div class="ttdoc">All stored data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:51</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

4
d6/d42/miller__rabin_8cpp.html
View File

@@ -463,7 +463,7 @@ Here is the call graph for this function:</div>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="afibonacci__sum_8cpp_html_a7cf5feaf168b88e74544da59ed830311"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311">math::fibonacci_sum::power</a></div><div class="ttdeci">math::fibonacci_sum::matrix power(math::fibonacci_sum::matrix T, uint64_t ex)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:56</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_a7cf5feaf168b88e74544da59ed830311"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311">math::fibonacci_sum::power</a></div><div class="ttdeci">math::fibonacci_sum::matrix power(math::fibonacci_sum::matrix T, uint64_t ex)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:57</div></div>
<div class="ttc" id="auniform_int_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution</a></div></div> <div class="ttc" id="auniform_int_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution</a></div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:125</div></div> <div class="ttc" id="amiller__rabin_8cpp_html_a901288288ef5ebe8e97414cc30797cce"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a901288288ef5ebe8e97414cc30797cce">miller_rabin_primality_test</a></div><div class="ttdeci">bool miller_rabin_primality_test(T num, T repeats)</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:125</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
@@ -478,7 +478,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::cbegin</a></div><div class="ttdeci">T cbegin(T... args)</div></div> <div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::cbegin</a></div><div class="ttdeci">T cbegin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::cend</a></div><div class="ttdeci">T cend(T... args)</div></div> <div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::cend</a></div><div class="ttdeci">T cend(T... args)</div></div>
<div class="ttc" id="amiller__rabin_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:157</div></div> <div class="ttc" id="amiller__rabin_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> miller_rabin.cpp:157</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

2
d6/d9d/large__factorial_8cpp.html
View File

@@ -312,7 +312,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div> <div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::scientific</a></div><div class="ttdeci">T scientific(T... args)</div></div> <div class="ttc" id="afixed_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/fixed.html">std::scientific</a></div><div class="ttdeci">T scientific(T... args)</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

397
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html Normal file
View File

@@ -0,0 +1,397 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math::ncr_modulo_p::NCRModuloP Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.20 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../de/d1e/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">math::ncr_modulo_p::NCRModuloP Class Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Class which contains all methods required for calculating nCr mod p.
<a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for math::ncr_modulo_p::NCRModuloP:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg" width="166" height="231"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:af3d41271912f9fa50b774c96c51874b9"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9">NCRModuloP</a> (const uint64_t &amp;size, const uint64_t &amp;mod)</td></tr>
<tr class="memdesc:af3d41271912f9fa50b774c96c51874b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">the p from (nCr % p) <a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9">More...</a><br /></td></tr>
<tr class="separator:af3d41271912f9fa50b774c96c51874b9"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:afde201f4687740454302c444f507a926"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926">gcdExtended</a> (const uint64_t &amp;a, const uint64_t &amp;b, int64_t *x, int64_t *y)</td></tr>
<tr class="separator:afde201f4687740454302c444f507a926"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0431ec5c876e1154d8e1e5f89e1ab34a"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a">modInverse</a> (const uint64_t &amp;a, const uint64_t &amp;m)</td></tr>
<tr class="separator:a0431ec5c876e1154d8e1e5f89e1ab34a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6b95277f5f527beacc8d0f3bc91fcd08"><td class="memItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08">ncr</a> (const uint64_t &amp;n, const uint64_t &amp;r, const uint64_t &amp;<a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a>)</td></tr>
<tr class="separator:a6b95277f5f527beacc8d0f3bc91fcd08"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:aed5b4a9e4fd57fe23812293d4a0f30c1"><td class="memItemLeft" align="right" valign="top"><a id="aed5b4a9e4fd57fe23812293d4a0f30c1"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; uint64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>fac</b> {}</td></tr>
<tr class="separator:aed5b4a9e4fd57fe23812293d4a0f30c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a57c168cd6eb85718eab97da658a698ad"><td class="memItemLeft" align="right" valign="top"><a id="a57c168cd6eb85718eab97da658a698ad"></a>
uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a> = 0</td></tr>
<tr class="memdesc:a57c168cd6eb85718eab97da658a698ad"><td class="mdescLeft">&#160;</td><td class="mdescRight">stores precomputed factorial(i) % p value <br /></td></tr>
<tr class="separator:a57c168cd6eb85718eab97da658a698ad"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Class which contains all methods required for calculating nCr mod p. </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="af3d41271912f9fa50b774c96c51874b9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af3d41271912f9fa50b774c96c51874b9">&#9670;&nbsp;</a></span>NCRModuloP()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">math::ncr_modulo_p::NCRModuloP::NCRModuloP </td>
<td>(</td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>size</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>mod</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>the p from (nCr % p) </p>
<p>Constructor which precomputes the values of n! % mod from n=0 to size and stores them in vector 'fac' @params[in] the numbers 'size', 'mod' </p>
<div class="fragment"><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160; {</div>
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>&#160; <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a> = mod;</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160; fac = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a>(size);</div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160; fac[0] = 1;</div>
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= size; i++) {</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; fac[i] = (fac[i - 1] * i) % <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a>;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; }</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="afde201f4687740454302c444f507a926"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afde201f4687740454302c444f507a926">&#9670;&nbsp;</a></span>gcdExtended()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">uint64_t math::ncr_modulo_p::NCRModuloP::gcdExtended </td>
<td>(</td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>b</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t *&#160;</td>
<td class="paramname"><em>x</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t *&#160;</td>
<td class="paramname"><em>y</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds the value of x, y such that a*x + b*y = gcd(a,b)</p>
<p>@params[in] the numbers 'a', 'b' and address of 'x' and 'y' from above equation </p><dl class="section return"><dt>Returns</dt><dd>the gcd of a and b </dd></dl>
<div class="fragment"><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; {</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordflow">if</span> (a == 0) {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; *x = 0, *y = 1;</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="keywordflow">return</span> b;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; }</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; </div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; int64_t x1 = 0, y1 = 0;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; uint64_t <a class="code" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a> = <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926">gcdExtended</a>(b % a, a, &amp;x1, &amp;y1);</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; </div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; *x = y1 - (b / a) * x1;</div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; *y = x1;</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a>;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_afde201f4687740454302c444f507a926_cgraph.svg" width="296" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a0431ec5c876e1154d8e1e5f89e1ab34a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0431ec5c876e1154d8e1e5f89e1ab34a">&#9670;&nbsp;</a></span>modInverse()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int64_t math::ncr_modulo_p::NCRModuloP::modInverse </td>
<td>(</td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>m</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Find modular inverse of a with m i.e. a number x such that (a*x)m = 1</p>
<p>@params[in] the numbers 'a' and 'm' from above equation </p><dl class="section return"><dt>Returns</dt><dd>the modular inverse of a </dd></dl>
<div class="fragment"><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; {</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; int64_t x = 0, y = 0;</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; uint64_t g = <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926">gcdExtended</a>(a, m, &amp;x, &amp;y);</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="keywordflow">if</span> (g != 1) { <span class="comment">// modular inverse doesn&#39;t exist</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; int64_t res = ((x + m) % m);</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordflow">return</span> res;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; }</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a0431ec5c876e1154d8e1e5f89e1ab34a_cgraph.svg" width="531" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a6b95277f5f527beacc8d0f3bc91fcd08"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6b95277f5f527beacc8d0f3bc91fcd08">&#9670;&nbsp;</a></span>ncr()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">int64_t math::ncr_modulo_p::NCRModuloP::ncr </td>
<td>(</td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>n</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>r</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>p</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Find nCr % p</p>
<p>@params[in] the numbers 'n', 'r' and 'p' </p><dl class="section return"><dt>Returns</dt><dd>the value nCr % p </dd></dl>
<div class="fragment"><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; {</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="comment">// Base cases</span></div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="keywordflow">if</span> (r &gt; n) {</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; }</div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="keywordflow">if</span> (r == 1) {</div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <span class="keywordflow">return</span> n % <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a>;</div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; }</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; <span class="keywordflow">if</span> (r == 0 || r == n) {</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <span class="keywordflow">return</span> 1;</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; }</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="comment">// fac is a global array with fac[r] = (r! % p)</span></div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; int64_t denominator = <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a">modInverse</a>(fac[r], <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a>);</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="keywordflow">if</span> (denominator &lt; 0) { <span class="comment">// modular inverse doesn&#39;t exist</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; }</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; denominator = (denominator * <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a">modInverse</a>(fac[n - r], <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a>)) % <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a>;</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="keywordflow">if</span> (denominator &lt; 0) { <span class="comment">// modular inverse doesn&#39;t exist</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; }</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordflow">return</span> (fac[n] * denominator) % <a class="code" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">p</a>;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph.svg" width="100%" height="300"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>math/<a class="el" href="../../de/dab/ncr__modulo__p_8cpp.html">ncr_modulo_p.cpp</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="agcd__iterative__euclidean_8cpp_html_ae48807fa2b7000afae599e67f327545e"><div class="ttname"><a href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e">gcd</a></div><div class="ttdeci">int gcd(int num1, int num2)</div><div class="ttdef"><b>Definition:</b> gcd_iterative_euclidean.cpp:15</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; uint64_t &gt;</a></div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a57c168cd6eb85718eab97da658a698ad"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad">math::ncr_modulo_p::NCRModuloP::p</a></div><div class="ttdeci">uint64_t p</div><div class="ttdoc">stores precomputed factorial(i) % p value</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:34</div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_a0431ec5c876e1154d8e1e5f89e1ab34a"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a">math::ncr_modulo_p::NCRModuloP::modInverse</a></div><div class="ttdeci">int64_t modInverse(const uint64_t &amp;a, const uint64_t &amp;m)</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:76</div></div>
<div class="ttc" id="aclassmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_html_afde201f4687740454302c444f507a926"><div class="ttname"><a href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926">math::ncr_modulo_p::NCRModuloP::gcdExtended</a></div><div class="ttdeci">uint64_t gcdExtended(const uint64_t &amp;a, const uint64_t &amp;b, int64_t *x, int64_t *y)</div><div class="ttdef"><b>Definition:</b> ncr_modulo_p.cpp:56</div></div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dd/d47/namespacemath.html">math</a></li><li class="navelem"><b>ncr_modulo_p</b></li><li class="navelem"><a class="el" href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
</ul>
</div>
</body>
</html>

9
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.js Normal file
View File

@@ -0,0 +1,9 @@
var classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p =
[
[ "NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#af3d41271912f9fa50b774c96c51874b9", null ],
[ "gcdExtended", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926", null ],
[ "modInverse", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a", null ],
[ "ncr", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a6b95277f5f527beacc8d0f3bc91fcd08", null ],
[ "fac", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#aed5b4a9e4fd57fe23812293d4a0f30c1", null ],
[ "p", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a57c168cd6eb85718eab97da658a698ad", null ]
];

5
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a0431ec5c876e1154d8e1e5f89e1ab34a_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="math::ncr_modulo_p::NCRModuloP::modInverse" name="math::ncr_modulo_p::NCRModuloP::modInverse">
<area shape="rect" id="node1" title=" " alt="" coords="5,5,192,47"/>
<area shape="rect" id="node2" href="$d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926" title=" " alt="" coords="240,5,435,47"/>
<area shape="rect" id="node3" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="483,13,525,39"/>
</map>

1
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a0431ec5c876e1154d8e1e5f89e1ab34a_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
e1fb048ed00e8c3654adecc462b29fc1

54
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a0431ec5c876e1154d8e1e5f89e1ab34a_cgraph.svg Normal file
View File

@@ -0,0 +1,54 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: math::ncr_modulo_p::NCRModuloP::modInverse Pages: 1 -->
<svg width="398pt" height="39pt"
viewBox="0.00 0.00 398.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>math::ncr_modulo_p::NCRModuloP::modInverse</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 394,-35 394,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 140,-30.5 140,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="70" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::modInverse</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="176,-0.5 176,-30.5 322,-30.5 322,-0.5 176,-0.5"/>
<text text-anchor="start" x="184" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="249" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::gcdExtended</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M140.19,-15.5C148.63,-15.5 157.3,-15.5 165.9,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="165.94,-19 175.94,-15.5 165.94,-12 165.94,-19"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="358,-6 358,-25 390,-25 390,-6 358,-6"/>
<text text-anchor="middle" x="374" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M322.26,-15.5C331.26,-15.5 339.93,-15.5 347.49,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="347.67,-19 357.67,-15.5 347.67,-12 347.67,-19"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.7 KiB

6
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="math::ncr_modulo_p::NCRModuloP::ncr" name="math::ncr_modulo_p::NCRModuloP::ncr">
<area shape="rect" id="node1" title=" " alt="" coords="5,5,145,47"/>
<area shape="rect" id="node2" href="$d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a" title=" " alt="" coords="193,5,380,47"/>
<area shape="rect" id="node3" href="$d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926" title=" " alt="" coords="428,5,623,47"/>
<area shape="rect" id="node4" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="671,13,713,39"/>
</map>

1
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
e5d1a12ad0580534755405f5b3336a69

158
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph.svg Normal file
View File

@@ -0,0 +1,158 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: math::ncr_modulo_p::NCRModuloP::ncr Pages: 1 -->
<!--zoomable 39 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="text/javascript"><![CDATA[
var edges = document.getElementsByTagName('g');
if (edges && edges.length) {
for (var i=0;i<edges.length;i++) {
if (edges[i].id.substr(0,4)=='edge') {
edges[i].setAttribute('class','edge');
}
}
}
]]></script>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
</use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
</use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="dirArrow">
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040">
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
</use>
</g>
</defs>
<script type="text/javascript">
var viewWidth = 539;
var viewHeight = 39;
var sectionId = 'dynsection-3';
</script>
<script xlink:href="../../svgpan.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>math::ncr_modulo_p::NCRModuloP::ncr</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 535,-35 535,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 105,-30.5 105,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="52.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::ncr</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="141,-0.5 141,-30.5 281,-30.5 281,-0.5 141,-0.5"/>
<text text-anchor="start" x="149" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="211" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::modInverse</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M105.18,-15.5C113.37,-15.5 122,-15.5 130.65,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="130.79,-19 140.79,-15.5 130.79,-12 130.79,-19"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="317,-0.5 317,-30.5 463,-30.5 463,-0.5 317,-0.5"/>
<text text-anchor="start" x="325" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="390" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::gcdExtended</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M281.19,-15.5C289.63,-15.5 298.3,-15.5 306.9,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="306.94,-19 316.94,-15.5 306.94,-12 306.94,-19"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="499,-6 499,-25 531,-25 531,-6 499,-6"/>
<text text-anchor="middle" x="515" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M463.26,-15.5C472.26,-15.5 480.93,-15.5 488.49,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="488.67,-19 498.67,-15.5 488.67,-12 488.67,-19"/>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 8.6 KiB

70
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_a6b95277f5f527beacc8d0f3bc91fcd08_cgraph_org.svg Normal file
View File

@@ -0,0 +1,70 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: math::ncr_modulo_p::NCRModuloP::ncr Pages: 1 -->
<svg width="539pt" height="39pt"
viewBox="0.00 0.00 539.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>math::ncr_modulo_p::NCRModuloP::ncr</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 535,-35 535,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 105,-30.5 105,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="52.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::ncr</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#a0431ec5c876e1154d8e1e5f89e1ab34a" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="141,-0.5 141,-30.5 281,-30.5 281,-0.5 141,-0.5"/>
<text text-anchor="start" x="149" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="211" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::modInverse</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M105.18,-15.5C113.37,-15.5 122,-15.5 130.65,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="130.79,-19 140.79,-15.5 130.79,-12 130.79,-19"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html#afde201f4687740454302c444f507a926" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="317,-0.5 317,-30.5 463,-30.5 463,-0.5 317,-0.5"/>
<text text-anchor="start" x="325" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="390" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::gcdExtended</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M281.19,-15.5C289.63,-15.5 298.3,-15.5 306.9,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="306.94,-19 316.94,-15.5 306.94,-12 306.94,-19"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="499,-6 499,-25 531,-25 531,-6 499,-6"/>
<text text-anchor="middle" x="515" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M463.26,-15.5C472.26,-15.5 480.93,-15.5 488.49,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="488.67,-19 498.67,-15.5 488.67,-12 488.67,-19"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.5 KiB

4
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_afde201f4687740454302c444f507a926_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="math::ncr_modulo_p::NCRModuloP::gcdExtended" name="math::ncr_modulo_p::NCRModuloP::gcdExtended">
<area shape="rect" id="node1" title=" " alt="" coords="5,5,200,47"/>
<area shape="rect" id="node2" href="$d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" title=" " alt="" coords="248,13,291,39"/>
</map>

1
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_afde201f4687740454302c444f507a926_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
eaa069eefb2747bae686cbd0113361ed

38
d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p_afde201f4687740454302c444f507a926_cgraph.svg Normal file
View File

@@ -0,0 +1,38 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: math::ncr_modulo_p::NCRModuloP::gcdExtended Pages: 1 -->
<svg width="222pt" height="39pt"
viewBox="0.00 0.00 222.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>math::ncr_modulo_p::NCRModuloP::gcdExtended</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 218,-35 218,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title=" ">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 146,-30.5 146,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="73" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP::gcdExtended</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d4/da0/gcd__iterative__euclidean_8cpp.html#ae48807fa2b7000afae599e67f327545e" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="182,-6 182,-25 214,-25 214,-6 182,-6"/>
<text text-anchor="middle" x="198" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">gcd</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M146.26,-15.5C155.26,-15.5 163.93,-15.5 171.49,-15.5"/>
<polygon fill="midnightblue" stroke="midnightblue" points="171.67,-19 181.67,-15.5 171.67,-12 171.67,-19"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB

12
d6/dec/breadth__first__search_8cpp__incl.map
View File

@@ -1,11 +1,11 @@
<map id="graph/breadth_first_search.cpp" name="graph/breadth_first_search.cpp"> <map id="graph/breadth_first_search.cpp" name="graph/breadth_first_search.cpp">
<area shape="rect" id="node1" title="Breadth First Search Algorithm (Breadth First Search)" alt="" coords="296,5,427,47"/> <area shape="rect" id="node1" title="Breadth First Search Algorithm (Breadth First Search)" alt="" coords="279,5,409,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,80,121"/> <area shape="rect" id="node2" title=" " alt="" coords="5,95,80,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="105,95,170,121"/> <area shape="rect" id="node3" title=" " alt="" coords="105,95,170,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="195,95,267,121"/> <area shape="rect" id="node4" title=" " alt="" coords="195,95,267,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="291,95,349,121"/> <area shape="rect" id="node5" title=" " alt="" coords="291,95,330,121"/>
<area shape="rect" id="node6" title=" " alt="" coords="373,95,432,121"/> <area shape="rect" id="node6" title=" " alt="" coords="354,95,401,121"/>
<area shape="rect" id="node7" title=" " alt="" coords="457,95,503,121"/> <area shape="rect" id="node7" title=" " alt="" coords="425,95,482,121"/>
<area shape="rect" id="node8" title=" " alt="" coords="527,95,566,121"/> <area shape="rect" id="node8" title=" " alt="" coords="506,95,561,121"/>
<area shape="rect" id="node9" title=" " alt="" coords="590,95,645,121"/> <area shape="rect" id="node9" title=" " alt="" coords="585,95,644,121"/>
</map> </map>

2
d6/dec/breadth__first__search_8cpp__incl.md5
View File

@@ -1 +1 @@
b65025ea9c14343c016c8976b8722b95 e4486f438862a7518c2ad8177f8e2e1d

64
d6/dec/breadth__first__search_8cpp__incl.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846) <!-- Generated by graphviz version 2.44.1 (20200629.0846)
--> -->
<!-- Title: graph/breadth_first_search.cpp Pages: 1 --> <!-- Title: graph/breadth_first_search.cpp Pages: 1 -->
<svg width="488pt" height="95pt" <svg width="487pt" height="95pt"
viewBox="0.00 0.00 487.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 487.00 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>graph/breadth_first_search.cpp</title> <title>graph/breadth_first_search.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 483.5,-91 483.5,4 -4,4"/> <polygon fill="white" stroke="transparent" points="-4,4 -4,-91 483,-91 483,4 -4,4"/>
<!-- Node1 --> <!-- Node1 -->
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Breadth First Search Algorithm (Breadth First Search)"> <g id="a_node1"><a xlink:title="Breadth First Search Algorithm (Breadth First Search)">
<polygon fill="#bfbfbf" stroke="black" points="218,-56.5 218,-86.5 316,-86.5 316,-56.5 218,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="205,-56.5 205,-86.5 303,-86.5 303,-56.5 205,-56.5"/>
<text text-anchor="start" x="226" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph/breadth_first</text> <text text-anchor="start" x="213" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph/breadth_first</text>
<text text-anchor="middle" x="267" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search.cpp</text> <text text-anchor="middle" x="254" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_search.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -31,8 +31,8 @@
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M217.77,-58.24C172.8,-47.05 107.23,-30.72 66.13,-20.49"/> <path fill="none" stroke="midnightblue" d="M204.96,-57.59C163.25,-46.61 104.21,-31.06 66.01,-21.01"/>
<polygon fill="midnightblue" stroke="midnightblue" points="66.78,-17.05 56.23,-18.03 65.09,-23.84 66.78,-17.05"/> <polygon fill="midnightblue" stroke="midnightblue" points="66.85,-17.61 56.29,-18.45 65.07,-24.38 66.85,-17.61"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
@@ -46,8 +46,8 @@
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M227.19,-56.4C198.5,-46.24 160.19,-32.67 132.94,-23.02"/> <path fill="none" stroke="midnightblue" d="M217.27,-56.4C191.03,-46.33 156.07,-32.91 130.98,-23.28"/>
<polygon fill="midnightblue" stroke="midnightblue" points="134.04,-19.7 123.45,-19.66 131.7,-26.3 134.04,-19.7"/> <polygon fill="midnightblue" stroke="midnightblue" points="132.14,-19.97 121.55,-19.66 129.64,-26.51 132.14,-19.97"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
@@ -61,83 +61,83 @@
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M243.78,-56.4C228.21,-46.95 207.8,-34.56 192.24,-25.11"/> <path fill="none" stroke="midnightblue" d="M233.86,-56.4C220.61,-47.13 203.32,-35.03 189.92,-25.65"/>
<polygon fill="midnightblue" stroke="midnightblue" points="193.62,-21.86 183.26,-19.66 189.99,-27.84 193.62,-21.86"/> <polygon fill="midnightblue" stroke="midnightblue" points="191.57,-22.53 181.37,-19.66 187.55,-28.26 191.57,-22.53"/>
</g> </g>
<!-- Node5 --> <!-- Node5 -->
<g id="node5" class="node"> <g id="node5" class="node">
<title>Node5</title> <title>Node5</title>
<g id="a_node5"><a xlink:title=" "> <g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="214.5,-0.5 214.5,-19.5 257.5,-19.5 257.5,-0.5 214.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="214.5,-0.5 214.5,-19.5 243.5,-19.5 243.5,-0.5 214.5,-0.5"/>
<text text-anchor="middle" x="236" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text> <text text-anchor="middle" x="229" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">list</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node5 --> <!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge"> <g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title> <title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M259.65,-56.4C255.33,-48.11 249.83,-37.55 245.23,-28.71"/> <path fill="none" stroke="midnightblue" d="M248.08,-56.4C244.63,-48.2 240.25,-37.78 236.56,-28.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="248.24,-26.91 240.51,-19.66 242.03,-30.14 248.24,-26.91"/> <polygon fill="midnightblue" stroke="midnightblue" points="239.74,-27.52 232.64,-19.66 233.28,-30.23 239.74,-27.52"/>
</g> </g>
<!-- Node6 --> <!-- Node6 -->
<g id="node6" class="node"> <g id="node6" class="node">
<title>Node6</title> <title>Node6</title>
<g id="a_node6"><a xlink:title=" "> <g id="a_node6"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="276,-0.5 276,-19.5 320,-19.5 320,-0.5 276,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="261.5,-0.5 261.5,-19.5 296.5,-19.5 296.5,-0.5 261.5,-0.5"/>
<text text-anchor="middle" x="298" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text> <text text-anchor="middle" x="279" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">map</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node6 --> <!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge"> <g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title> <title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M274.35,-56.4C278.67,-48.11 284.17,-37.55 288.77,-28.71"/> <path fill="none" stroke="midnightblue" d="M259.92,-56.4C263.37,-48.2 267.75,-37.78 271.44,-28.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="291.97,-30.14 293.49,-19.66 285.76,-26.91 291.97,-30.14"/> <polygon fill="midnightblue" stroke="midnightblue" points="274.72,-30.23 275.36,-19.66 268.26,-27.52 274.72,-30.23"/>
</g> </g>
<!-- Node7 --> <!-- Node7 -->
<g id="node7" class="node"> <g id="node7" class="node">
<title>Node7</title> <title>Node7</title>
<g id="a_node7"><a xlink:title=" "> <g id="a_node7"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="338.5,-0.5 338.5,-19.5 373.5,-19.5 373.5,-0.5 338.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="314.5,-0.5 314.5,-19.5 357.5,-19.5 357.5,-0.5 314.5,-0.5"/>
<text text-anchor="middle" x="356" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">map</text> <text text-anchor="middle" x="336" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">queue</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node7 --> <!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge"> <g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title> <title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M288.09,-56.4C302.09,-47.04 320.41,-34.79 334.49,-25.38"/> <path fill="none" stroke="midnightblue" d="M273.43,-56.4C286.21,-47.13 302.89,-35.03 315.81,-25.65"/>
<polygon fill="midnightblue" stroke="midnightblue" points="336.68,-28.13 343.05,-19.66 332.79,-22.31 336.68,-28.13"/> <polygon fill="midnightblue" stroke="midnightblue" points="318.03,-28.36 324.07,-19.66 313.92,-22.7 318.03,-28.36"/>
</g> </g>
<!-- Node8 --> <!-- Node8 -->
<g id="node8" class="node"> <g id="node8" class="node">
<title>Node8</title> <title>Node8</title>
<g id="a_node8"><a xlink:title=" "> <g id="a_node8"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="391.5,-0.5 391.5,-19.5 420.5,-19.5 420.5,-0.5 391.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="375.5,-0.5 375.5,-19.5 416.5,-19.5 416.5,-0.5 375.5,-0.5"/>
<text text-anchor="middle" x="406" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">list</text> <text text-anchor="middle" x="396" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">string</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node8 --> <!-- Node1&#45;&gt;Node8 -->
<g id="edge7" class="edge"> <g id="edge7" class="edge">
<title>Node1&#45;&gt;Node8</title> <title>Node1&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M299.94,-56.4C325.12,-45.62 359.24,-31.02 381.91,-21.31"/> <path fill="none" stroke="midnightblue" d="M287.65,-56.4C311.48,-46.42 343.15,-33.15 366.09,-23.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="383.33,-24.51 391.15,-17.36 380.58,-18.07 383.33,-24.51"/> <polygon fill="midnightblue" stroke="midnightblue" points="367.47,-26.75 375.34,-19.66 364.76,-20.29 367.47,-26.75"/>
</g> </g>
<!-- Node9 --> <!-- Node9 -->
<g id="node9" class="node"> <g id="node9" class="node">
<title>Node9</title> <title>Node9</title>
<g id="a_node9"><a xlink:title=" "> <g id="a_node9"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="438.5,-0.5 438.5,-19.5 479.5,-19.5 479.5,-0.5 438.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="435,-0.5 435,-19.5 479,-19.5 479,-0.5 435,-0.5"/>
<text text-anchor="middle" x="459" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">string</text> <text text-anchor="middle" x="457" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node9 --> <!-- Node1&#45;&gt;Node9 -->
<g id="edge8" class="edge"> <g id="edge8" class="edge">
<title>Node1&#45;&gt;Node9</title> <title>Node1&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M312.32,-56.47C342.86,-47.01 384.29,-34.17 428.85,-20.35"/> <path fill="none" stroke="midnightblue" d="M301.85,-56.47C339.99,-45.3 392.3,-29.96 425.38,-20.27"/>
<polygon fill="midnightblue" stroke="midnightblue" points="429.89,-23.7 438.41,-17.39 427.82,-17.01 429.89,-23.7"/> <polygon fill="midnightblue" stroke="midnightblue" points="426.38,-23.62 434.99,-17.45 424.41,-16.91 426.38,-23.62"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.2 KiB

After

Width:  |  Height:  |  Size: 6.2 KiB

6
d6/df6/n__choose__r_8cpp__incl.map
View File

@@ -1,5 +1,5 @@
<map id="math/n_choose_r.cpp" name="math/n_choose_r.cpp"> <map id="math/n_choose_r.cpp" name="math/n_choose_r.cpp">
<area shape="rect" id="node1" title="Combinations n choose r function implementation" alt="" coords="15,5,161,32"/> <area shape="rect" id="node1" title="Combinations n choose r function implementation" alt="" coords="11,5,158,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,77,107"/> <area shape="rect" id="node2" title=" " alt="" coords="5,80,71,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="102,80,167,107"/> <area shape="rect" id="node3" title=" " alt="" coords="95,80,167,107"/>
</map> </map>

2
d6/df6/n__choose__r_8cpp__incl.md5
View File

@@ -1 +1 @@
b43e907afd9dfacf15ee78723042ddad c691523357a50bf08809bca22457dcf5

20
d6/df6/n__choose__r_8cpp__incl.svg
View File

@@ -13,8 +13,8 @@
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Combinations n choose r function implementation"> <g id="a_node1"><a xlink:title="Combinations n choose r function implementation">
<polygon fill="#bfbfbf" stroke="black" points="7,-56.5 7,-75.5 117,-75.5 117,-56.5 7,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="4.5,-56.5 4.5,-75.5 114.5,-75.5 114.5,-56.5 4.5,-56.5"/>
<text text-anchor="middle" x="62" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/n_choose_r.cpp</text> <text text-anchor="middle" x="59.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/n_choose_r.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -22,31 +22,31 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M56.22,-56.08C51.33,-48.53 44.17,-37.49 38.17,-28.23"/> <path fill="none" stroke="midnightblue" d="M53.72,-56.08C48.83,-48.53 41.67,-37.49 35.67,-28.23"/>
<polygon fill="midnightblue" stroke="midnightblue" points="41.05,-26.24 32.67,-19.75 35.17,-30.05 41.05,-26.24"/> <polygon fill="midnightblue" stroke="midnightblue" points="38.55,-26.24 30.17,-19.75 32.67,-30.05 38.55,-26.24"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72.5,-0.5 72.5,-19.5 121.5,-19.5 121.5,-0.5 72.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="67.5,-0.5 67.5,-19.5 121.5,-19.5 121.5,-0.5 67.5,-0.5"/>
<text text-anchor="middle" x="97" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text> <text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M67.78,-56.08C72.67,-48.53 79.83,-37.49 85.83,-28.23"/> <path fill="none" stroke="midnightblue" d="M65.28,-56.08C70.17,-48.53 77.33,-37.49 83.33,-28.23"/>
<polygon fill="midnightblue" stroke="midnightblue" points="88.83,-30.05 91.33,-19.75 82.95,-26.24 88.83,-30.05"/> <polygon fill="midnightblue" stroke="midnightblue" points="86.33,-30.05 88.83,-19.75 80.45,-26.24 86.33,-30.05"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

4
d7/d00/list__array_8cpp.html
View File

@@ -97,8 +97,8 @@ $(document).ready(function(){initNavTree('d7/d00/list__array_8cpp.html','../../'
<div class="title">list_array.cpp File Reference</div> </div> <div class="title">list_array.cpp File Reference</div> </div>
</div><!--header--> </div><!--header-->
<div class="contents"> <div class="contents">
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;array&gt;</code><br />
<code>#include &lt;array&gt;</code><br /> <code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for list_array.cpp:</div> Include dependency graph for list_array.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">

18
d7/de0/stack_8h_source.html
View File

@@ -252,7 +252,7 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
<div class="ttc" id="anamespacequeue__using__array_html"><div class="ttname"><a href="../../d9/d70/namespacequeue__using__array.html">queue_using_array</a></div><div class="ttdoc">Functions for Queue using Array implementation.</div></div> <div class="ttc" id="anamespacequeue__using__array_html"><div class="ttname"><a href="../../d9/d70/namespacequeue__using__array.html">queue_using_array</a></div><div class="ttdoc">Functions for Queue using Array implementation.</div></div>
<div class="ttc" id="astructdata__structures_1_1_node_html_a54a6777e72b639c3ee6446a541db8e78"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78">data_structures::Node::Node</a></div><div class="ttdeci">Node(int key, int level, void *value=nullptr)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:44</div></div> <div class="ttc" id="astructdata__structures_1_1_node_html_a54a6777e72b639c3ee6446a541db8e78"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78">data_structures::Node::Node</a></div><div class="ttdeci">Node(int key, int level, void *value=nullptr)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:44</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt; Node &gt;</a></div></div> <div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr&lt; Node &gt;</a></div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2f676f2f249eb36dfd49711a03e9e67e"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array::front</a></div><div class="ttdeci">int8_t front</div><div class="ttdoc">Index of head of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:46</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2f676f2f249eb36dfd49711a03e9e67e"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array::front</a></div><div class="ttdeci">int8_t front</div><div class="ttdoc">Index of head of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:49</div></div>
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a812611f80b8079268dbb19cc4e9bee5c"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList::displayList</a></div><div class="ttdeci">void displayList()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:191</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a812611f80b8079268dbb19cc4e9bee5c"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList::displayList</a></div><div class="ttdeci">void displayList()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:191</div></div>
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a3e249c2c35a8b7f5ffd2d77fee60d650"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">data_structures::SkipList::level</a></div><div class="ttdeci">int level</div><div class="ttdoc">Maximum level of the skiplist.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:56</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a3e249c2c35a8b7f5ffd2d77fee60d650"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">data_structures::SkipList::level</a></div><div class="ttdeci">int level</div><div class="ttdoc">Maximum level of the skiplist.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:56</div></div>
<div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:27</div></div> <div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:27</div></div>
@@ -262,22 +262,22 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div> <div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></div> <div class="ttc" id="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:40</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:43</div></div>
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="askip__list_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:212</div></div> <div class="ttc" id="askip__list_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:212</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div> <div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="astructdata__structures_1_1_node_html"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html">data_structures::Node</a></div><div class="ttdef"><b>Definition:</b> skip_list.cpp:33</div></div> <div class="ttc" id="astructdata__structures_1_1_node_html"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html">data_structures::Node</a></div><div class="ttdef"><b>Definition:</b> skip_list.cpp:33</div></div>
<div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:96</div></div> <div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:96</div></div>
<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/at.html">std::array::at</a></div><div class="ttdeci">T at(T... args)</div></div> <div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/at.html">std::array::at</a></div><div class="ttdeci">T at(T... args)</div></div>
<div class="ttc" id="aqueue__using__array_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:109</div></div> <div class="ttc" id="aqueue__using__array_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:111</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="astructdata__structures_1_1_node_html_a6b973b0bded99b0c0bd84e887bf8c731"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">data_structures::Node::value</a></div><div class="ttdeci">void * value</div><div class="ttdoc">pointer of value</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:35</div></div> <div class="ttc" id="astructdata__structures_1_1_node_html_a6b973b0bded99b0c0bd84e887bf8c731"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">data_structures::Node::value</a></div><div class="ttdeci">void * value</div><div class="ttdoc">pointer of value</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:35</div></div>
<div class="ttc" id="aclassstack__linked_list_html"><div class="ttname"><a href="../../d2/dc4/classstack__linked_list.html">stack_linkedList</a></div><div class="ttdef"><b>Definition:</b> queue_using_linkedlist.cpp:10</div></div> <div class="ttc" id="aclassstack__linked_list_html"><div class="ttname"><a href="../../d2/dc4/classstack__linked_list.html">stack_linkedList</a></div><div class="ttdef"><b>Definition:</b> queue_using_linkedlist.cpp:10</div></div>
<div class="ttc" id="aqueue__using__two__stacks_8cpp_html_a831ded10ecad88c14a8e22b96f4c1863"><div class="ttname"><a href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a></div><div class="ttdeci">void queue_test()</div><div class="ttdef"><b>Definition:</b> queue_using_two_stacks.cpp:101</div></div> <div class="ttc" id="aqueue__using__two__stacks_8cpp_html_a831ded10ecad88c14a8e22b96f4c1863"><div class="ttname"><a href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a></div><div class="ttdeci">void queue_test()</div><div class="ttdef"><b>Definition:</b> queue_using_two_stacks.cpp:101</div></div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt; int16_t, max_size &gt;</a></div></div> <div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt; int16_t, max_size &gt;</a></div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a9883dfcceede9a42227d2d313ae86f85"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array::rear</a></div><div class="ttdeci">int8_t rear</div><div class="ttdoc">Index of tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:47</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a9883dfcceede9a42227d2d313ae86f85"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array::rear</a></div><div class="ttdeci">int8_t rear</div><div class="ttdoc">Index of tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:50</div></div>
<div class="ttc" id="astructlinkedlist_html"><div class="ttname"><a href="../../d0/dff/structlinkedlist.html">linkedlist</a></div><div class="ttdef"><b>Definition:</b> queue_using_linkedlist.cpp:6</div></div> <div class="ttc" id="astructlinkedlist_html"><div class="ttname"><a href="../../d0/dff/structlinkedlist.html">linkedlist</a></div><div class="ttdef"><b>Definition:</b> queue_using_linkedlist.cpp:6</div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_ae69a0bf6c9921b37c516c8a4d2fb904d"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array::arr</a></div><div class="ttdeci">std::array&lt; int16_t, max_size &gt; arr</div><div class="ttdoc">All stored data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:48</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_ae69a0bf6c9921b37c516c8a4d2fb904d"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array::arr</a></div><div class="ttdeci">std::array&lt; int16_t, max_size &gt; arr</div><div class="ttdoc">All stored data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:51</div></div>
<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">Data Structures algorithms.</div></div> <div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">Data Structures algorithms.</div></div>
<div class="ttc" id="aclassstack_html_a5705c3926dcf5fd3f9c964467a50b81d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d">stack::push</a></div><div class="ttdeci">void push(Type item)</div><div class="ttdef"><b>Definition:</b> stack.h:83</div></div> <div class="ttc" id="aclassstack_html_a5705c3926dcf5fd3f9c964467a50b81d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d">stack::push</a></div><div class="ttdeci">void push(Type item)</div><div class="ttdef"><b>Definition:</b> stack.h:83</div></div>
<div class="ttc" id="astructdata__structures_1_1_node_html_ac75aa86a598357c5c882ec6a1174aa68"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">data_structures::Node::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key integer</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:34</div></div> <div class="ttc" id="astructdata__structures_1_1_node_html_ac75aa86a598357c5c882ec6a1174aa68"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">data_structures::Node::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key integer</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:34</div></div>
@@ -297,7 +297,7 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
<div class="ttc" id="atower__of__hanoi_8cpp_html_a746d9a3984bba88fd6dd91978f6931ed"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed">show</a></div><div class="ttdeci">void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:19</div></div> <div class="ttc" id="atower__of__hanoi_8cpp_html_a746d9a3984bba88fd6dd91978f6931ed"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed">show</a></div><div class="ttdeci">void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:19</div></div>
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_aa3f3813e9896792fc86b296547689ba4"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4">data_structures::SkipList::randomLevel</a></div><div class="ttdeci">int randomLevel()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:75</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_aa3f3813e9896792fc86b296547689ba4"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4">data_structures::SkipList::randomLevel</a></div><div class="ttdeci">int randomLevel()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:75</div></div>
<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdef"><b>Definition:</b> stack.h:26</div></div> <div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdef"><b>Definition:</b> stack.h:26</div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &amp;)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:55</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &amp;)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:58</div></div>
<div class="ttc" id="aclassstack_html_a67f65710c376f67d1ba3bde45a9cb628"><div class="ttname"><a href="../../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628">stack::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> stack.h:29</div></div> <div class="ttc" id="aclassstack_html_a67f65710c376f67d1ba3bde45a9cb628"><div class="ttname"><a href="../../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628">stack::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> stack.h:29</div></div>
<div class="ttc" id="aclassstack_html_a066e4505155b009913c47b2648b1067a"><div class="ttname"><a href="../../d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack()</div><div class="ttdef"><b>Definition:</b> stack.h:80</div></div> <div class="ttc" id="aclassstack_html_a066e4505155b009913c47b2648b1067a"><div class="ttname"><a href="../../d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack()</div><div class="ttdef"><b>Definition:</b> stack.h:80</div></div>
<div class="ttc" id="astructnode_html_a42309387b3fa0237ec200c025071ad37"><div class="ttname"><a href="../../d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37">node::data</a></div><div class="ttdeci">Type data</div><div class="ttdoc">data at current node</div><div class="ttdef"><b>Definition:</b> stack.h:17</div></div> <div class="ttc" id="astructnode_html_a42309387b3fa0237ec200c025071ad37"><div class="ttname"><a href="../../d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37">node::data</a></div><div class="ttdeci">Type data</div><div class="ttdoc">data at current node</div><div class="ttdef"><b>Definition:</b> stack.h:17</div></div>
@@ -305,17 +305,17 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
<div class="ttc" id="aclassstack_html_a7289037c059aaad492b4d68e6bd54453"><div class="ttname"><a href="../../d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453">stack::stackTop</a></div><div class="ttdeci">node&lt; Type &gt; * stackTop</div><div class="ttdef"><b>Definition:</b> stack.h:146</div></div> <div class="ttc" id="aclassstack_html_a7289037c059aaad492b4d68e6bd54453"><div class="ttname"><a href="../../d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453">stack::stackTop</a></div><div class="ttdeci">node&lt; Type &gt; * stackTop</div><div class="ttdef"><b>Definition:</b> stack.h:146</div></div>
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_ad7e392386d7db622185d6f7c718e4f16"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">data_structures::SkipList::header</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; header</div><div class="ttdoc">Pointer to the header node.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:57</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_ad7e392386d7db622185d6f7c718e4f16"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">data_structures::SkipList::header</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; header</div><div class="ttdoc">Pointer to the header node.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:57</div></div>
<div class="ttc" id="aclassstack_html_a0ac1dba9c7019acdc825b31d06eb0b71"><div class="ttname"><a href="../../d1/dc2/classstack.html#a0ac1dba9c7019acdc825b31d06eb0b71">stack::~stack</a></div><div class="ttdeci">~stack()</div><div class="ttdef"><b>Definition:</b> stack.h:77</div></div> <div class="ttc" id="aclassstack_html_a0ac1dba9c7019acdc825b31d06eb0b71"><div class="ttname"><a href="../../d1/dc2/classstack.html#a0ac1dba9c7019acdc825b31d06eb0b71">stack::~stack</a></div><div class="ttdeci">~stack()</div><div class="ttdef"><b>Definition:</b> stack.h:77</div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:72</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:75</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_aae41c72130114bf31204cde6873b6095"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">push</a></div><div class="ttdeci">void push(char ch)</div><div class="ttdoc">push byte to stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:26</div></div> <div class="ttc" id="aparanthesis__matching_8cpp_html_aae41c72130114bf31204cde6873b6095"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">push</a></div><div class="ttdeci">void push(char ch)</div><div class="ttdoc">push byte to stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:26</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_a6d25c7dfbfeb52c3cb9d1b56ab49b664"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a></div><div class="ttdeci">char pop()</div><div class="ttdoc">pop a byte out of stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:29</div></div> <div class="ttc" id="aparanthesis__matching_8cpp_html_a6d25c7dfbfeb52c3cb9d1b56ab49b664"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a></div><div class="ttdeci">char pop()</div><div class="ttdoc">pop a byte out of stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:29</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="anamespacedata__structures_html_a903639d8e6f955dd8d5c263781455d61"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">data_structures::PROBABILITY</a></div><div class="ttdeci">constexpr float PROBABILITY</div><div class="ttdoc">Current probability for &quot;coin toss&quot;.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:28</div></div> <div class="ttc" id="anamespacedata__structures_html_a903639d8e6f955dd8d5c263781455d61"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">data_structures::PROBABILITY</a></div><div class="ttdeci">constexpr float PROBABILITY</div><div class="ttdoc">Current probability for &quot;coin toss&quot;.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:28</div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:90</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:93</div></div>
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a2249e3ab2f8a0f2334b90635202de4f2"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a2249e3ab2f8a0f2334b90635202de4f2">data_structures::SkipList::searchElement</a></div><div class="ttdeci">void * searchElement(int key)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:170</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a2249e3ab2f8a0f2334b90635202de4f2"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a2249e3ab2f8a0f2334b90635202de4f2">data_structures::SkipList::searchElement</a></div><div class="ttdeci">void * searchElement(int key)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:170</div></div>
<div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a40a4042bdf0b6683b5f21ae7854de8a9"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList::insertElement</a></div><div class="ttdeci">void insertElement(int key, void *value)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:90</div></div> <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a40a4042bdf0b6683b5f21ae7854de8a9"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList::insertElement</a></div><div class="ttdeci">void insertElement(int key, void *value)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:90</div></div>
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div> <div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
<div class="ttc" id="aclassstack_html_a5cc5efbbd4ea14b3e378580f1388423b"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> stack.h:112</div></div> <div class="ttc" id="aclassstack_html_a5cc5efbbd4ea14b3e378580f1388423b"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> stack.h:112</div></div>
<div class="ttc" id="aqueue__using__array_8cpp_html_a2d49e79bd164c298912db252970520d8"><div class="ttname"><a href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a></div><div class="ttdeci">constexpr uint16_t max_size</div><div class="ttdoc">for std::array</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:22</div></div> <div class="ttc" id="aqueue__using__array_8cpp_html_a2d49e79bd164c298912db252970520d8"><div class="ttname"><a href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a></div><div class="ttdeci">constexpr uint16_t max_size</div><div class="ttdoc">for io operations</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:23</div></div>
<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div> <div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

121
d8/d61/radix__sort2_8cpp.html
View File

@@ -100,10 +100,10 @@ $(document).ready(function(){initNavTree('d8/d61/radix__sort2_8cpp.html','../../
<p>Algorithm of <a href="https://en.wikipedia.org/wiki/Radix_sort">Radix sort</a> <p>Algorithm of <a href="https://en.wikipedia.org/wiki/Radix_sort">Radix sort</a>
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br /> <code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for radix_sort2.cpp:</div> Include dependency graph for radix_sort2.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -160,10 +160,10 @@ Functions</h2></td></tr>
<p>Main function. </p> <p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; {</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <a class="code" href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// execute the tests</span></div> <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <a class="code" href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// execute the tests</span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160;}</div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -197,20 +197,21 @@ Here is the call graph for this function:</div>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd>sorted vector </dd></dl> <dl class="section return"><dt>Returns</dt><dd>sorted vector </dd></dl>
<div class="fragment"><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; {</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; uint64_t max_ele = *<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">max_element</a>(ar.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()); <span class="comment">// returns the max element.</span></div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; uint64_t max_ele =</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> temp = ar;</div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; *<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">max_element</a>(ar.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()); <span class="comment">// returns the max element.</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; max_ele / i &gt; 0;</div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> temp = ar;</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; i *= 10) { <span class="comment">// loop breaks when i &gt; max_ele because no further digits</span></div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; max_ele / i &gt; 0;</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="comment">// left to makes changes in aray.</span></div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; i *= 10) { <span class="comment">// loop breaks when i &gt; max_ele because no further digits</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; temp = <a class="code" href="../../d8/d61/radix__sort2_8cpp.html#a302672a25ef4561eb41b4f9ef8e518b2">step_ith</a>(i,temp);</div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="comment">// left to makes changes in aray.</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; }</div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; temp = <a class="code" href="../../d8/d61/radix__sort2_8cpp.html#a302672a25ef4561eb41b4f9ef8e518b2">step_ith</a>(i, temp);</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="keywordflow">for</span> (uint64_t i : temp) {</div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; }</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div> <div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; <span class="keywordflow">for</span> (uint64_t i : temp) {</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; }</div> <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div> <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; }</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="keywordflow">return</span> temp;</div> <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; }</div> <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="keywordflow">return</span> temp;</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -255,30 +256,30 @@ Here is the call graph for this function:</div>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html" title="STL class.">std::vector</a> sorted till ith digit </dd></dl> <dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html" title="STL class.">std::vector</a> sorted till ith digit </dd></dl>
<div class="fragment"><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; { <span class="comment">// sorting according to current digit.</span></div> <div class="fragment"><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; { <span class="comment">// sorting according to current digit.</span></div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; <span class="keywordtype">int</span> n = ar.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div> <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keywordtype">int</span> n = ar.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> position(10, 0);</div> <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint32_t&gt;</a> position(10, 0);</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; position[(ar[i] / cur_digit) %</div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; position[(ar[i] / cur_digit) %</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; 10]++; <span class="comment">// counting frequency of 0-9 at cur_digit.</span></div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; 10]++; <span class="comment">// counting frequency of 0-9 at cur_digit.</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; }</div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; }</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordtype">int</span> cur = 0;</div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordtype">int</span> cur = 0;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 10; ++i) {</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; 10; ++i) {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordtype">int</span> a = position[i];</div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="keywordtype">int</span> a = position[i];</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; position[i] = cur; <span class="comment">// assingning starting position of 0-9.</span></div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; position[i] = cur; <span class="comment">// assingning starting position of 0-9.</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; cur += a;</div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; cur += a;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; }</div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; }</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> temp(n);</div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> temp(n);</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div> <div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; temp[position[(ar[i] / cur_digit) % 10]] =</div> <div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; temp[position[(ar[i] / cur_digit) % 10]] =</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160; ar[i]; <span class="comment">// storing ar[i] in ar[i]&#39;s cur_digit expected position of</span></div> <div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; ar[i]; <span class="comment">// storing ar[i] in ar[i]&#39;s cur_digit expected position of</span></div>
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>&#160; <span class="comment">// this step.</span></div> <div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <span class="comment">// this step.</span></div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; position[(ar[i] / cur_digit) %</div> <div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; position[(ar[i] / cur_digit) %</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; 10]++; <span class="comment">// incrementing ar[i]&#39;s cur_digit position by 1, as</span></div> <div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; 10]++; <span class="comment">// incrementing ar[i]&#39;s cur_digit position by 1, as</span></div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <span class="comment">// current place used by ar[i].</span></div> <div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="comment">// current place used by ar[i].</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; }</div> <div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; }</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <span class="keywordflow">return</span> temp;</div> <div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keywordflow">return</span> temp;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; }</div> <div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -315,17 +316,17 @@ Here is the call graph for this function:</div>
<dl class="section return"><dt>Returns</dt><dd>none </dd></dl> <dl class="section return"><dt>Returns</dt><dd>none </dd></dl>
<p>Test 1</p> <p>Test 1</p>
<p>Test 2</p> <p>Test 2</p>
<div class="fragment"><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; {<span class="comment"></span></div> <div class="fragment"><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; {<span class="comment"></span></div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160;<span class="comment"> /// Test 1</span></div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160;<span class="comment"> /// Test 1</span></div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> ar1 = {432, 234, 143, 332, 123};</div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> ar1 = {432, 234, 143, 332, 123};</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; ar1 = <a class="code" href="../../d8/d61/radix__sort2_8cpp.html#a8df9406972cda58c209b30ebae295daa">sorting::radix_sort::radix</a>(ar1);</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; ar1 = <a class="code" href="../../d8/d61/radix__sort2_8cpp.html#a8df9406972cda58c209b30ebae295daa">sorting::radix_sort::radix</a>(ar1);</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(ar1.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar1.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));<span class="comment"></span></div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(ar1.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar1.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));<span class="comment"></span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160;<span class="comment"> /// Test 2</span></div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160;<span class="comment"> /// Test 2</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> ar2 = {213, 3214, 123, 111, 112, 142,</div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> ar2 = {213, 3214, 123, 111, 112, 142,</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; 133, 132, 32, 12, 113};</div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; 133, 132, 32, 12, 113};</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; ar2 = <a class="code" href="../../d8/d61/radix__sort2_8cpp.html#a8df9406972cda58c209b30ebae295daa">sorting::radix_sort::radix</a>(ar2);</div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; ar2 = <a class="code" href="../../d8/d61/radix__sort2_8cpp.html#a8df9406972cda58c209b30ebae295daa">sorting::radix_sort::radix</a>(ar2);</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(ar2.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar2.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; assert(<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a>(ar2.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/begin.html">begin</a>(), ar2.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/end.html">end</a>()));</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160;}</div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -337,14 +338,14 @@ Here is the call graph for this function:</div>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="aradix__sort2_8cpp_html_a302672a25ef4561eb41b4f9ef8e518b2"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a302672a25ef4561eb41b4f9ef8e518b2">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:50</div></div> <div class="ttc" id="aradix__sort2_8cpp_html_a302672a25ef4561eb41b4f9ef8e518b2"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a302672a25ef4561eb41b4f9ef8e518b2">sorting::radix_sort::step_ith</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; step_ith(uint16_t cur_digit, const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector according to current digit using stable sorting.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:49</div></div>
<div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div> <div class="ttc" id="amax_element_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max_element.html">std::max_element</a></div><div class="ttdeci">T max_element(T... args)</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; uint64_t &gt;</a></div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div> <div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div> <div class="ttc" id="ais_sorted_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html">std::is_sorted</a></div><div class="ttdeci">T is_sorted(T... args)</div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_a8df9406972cda58c209b30ebae295daa"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a8df9406972cda58c209b30ebae295daa">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:79</div></div> <div class="ttc" id="aradix__sort2_8cpp_html_a8df9406972cda58c209b30ebae295daa"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a8df9406972cda58c209b30ebae295daa">sorting::radix_sort::radix</a></div><div class="ttdeci">std::vector&lt; uint64_t &gt; radix(const std::vector&lt; uint64_t &gt; &amp;ar)</div><div class="ttdoc">Function to sort vector digit by digit.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:80</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:100</div></div> <div class="ttc" id="aradix__sort2_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Function to test the above algorithm.</div><div class="ttdef"><b>Definition:</b> radix_sort2.cpp:102</div></div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div> <div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/begin.html">std::vector::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div> <div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/end.html">std::vector::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->

2
d8/d69/classgraph_1_1_h_k_graph.html
View File

@@ -471,7 +471,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:76</div></div> <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a976ee239402cc2726a280e781c706d77"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">graph::HKGraph::pair_v</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_v</div><div class="ttdoc">value of vertex 'v' ranges from 1 to n</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:76</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:75</div></div> <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a86ebff8a70cbfedd05281993d5d1987b"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b">graph::HKGraph::pair_u</a></div><div class="ttdeci">std::vector&lt; int &gt; pair_u</div><div class="ttdoc">value of vertex 'u' ranges from 1 to m</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:75</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:191</div></div> <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_ae794950cb3407b6b47d3dc986cf714c0"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0">graph::HKGraph::dfs</a></div><div class="ttdeci">bool dfs(int u)</div><div class="ttdoc">This functions checks whether an augmenting path is available exists beginning with free vertex u.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:191</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

2
d8/d77/namespacemachine__learning.html
View File

@@ -1996,7 +1996,7 @@ template&lt;typename T &gt; </div>
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div> <div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div> <div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
<div class="ttc" id="aprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">std::ostream::precision</a></div><div class="ttdeci">T precision(T... args)</div></div> <div class="ttc" id="aprecision_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/ios_base/precision.html">std::ostream::precision</a></div><div class="ttdeci">T precision(T... args)</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div> <div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
<div class="ttc" id="anow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a></div><div class="ttdeci">T now(T... args)</div></div> <div class="ttc" id="anow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/system_clock/now.html">std::chrono::system_clock::now</a></div><div class="ttdeci">T now(T... args)</div></div>

38
d8/d95/vector__ops_8hpp_source.html
View File

@@ -612,7 +612,6 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a6aef65b40347c4606662cad4dd2e14d3"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">graph::is_graph_bipartite::Graph::Graph</a></div><div class="ttdeci">Graph(int size)</div><div class="ttdoc">Constructor that initializes the graph on creation.</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:65</div></div> <div class="ttc" id="aclassgraph_1_1is__graph__bipartite_1_1_graph_html_a6aef65b40347c4606662cad4dd2e14d3"><div class="ttname"><a href="../../de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">graph::is_graph_bipartite::Graph::Graph</a></div><div class="ttdeci">Graph(int size)</div><div class="ttdoc">Constructor that initializes the graph on creation.</div><div class="ttdef"><b>Definition:</b> is_graph_bipartite.cpp:65</div></div>
<div class="ttc" id="amath_2armstrong__number_8cpp_html_aab733299b170fa5a752503f95f090fcd"><div class="ttname"><a href="../../d4/d5d/math_2armstrong__number_8cpp.html#aab733299b170fa5a752503f95f090fcd">number_of_digits</a></div><div class="ttdeci">int number_of_digits(int num)</div><div class="ttdef"><b>Definition:</b> armstrong_number.cpp:21</div></div> <div class="ttc" id="amath_2armstrong__number_8cpp_html_aab733299b170fa5a752503f95f090fcd"><div class="ttname"><a href="../../d4/d5d/math_2armstrong__number_8cpp.html#aab733299b170fa5a752503f95f090fcd">number_of_digits</a></div><div class="ttdeci">int number_of_digits(int num)</div><div class="ttdef"><b>Definition:</b> armstrong_number.cpp:21</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html_a3ab95bb3ba618a7e883ead8ee696c25c"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">graph::Graph::adjacency_list</a></div><div class="ttdeci">std::map&lt; T, std::list&lt; T &gt; &gt; adjacency_list</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:69</div></div>
<div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:36</div></div> <div class="ttc" id="astructdouble__hashing_1_1_entry_html"><div class="ttname"><a href="../../d9/dde/structdouble__hashing_1_1_entry.html">double_hashing::Entry</a></div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:36</div></div>
<div class="ttc" id="ashowpoint_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/showpoint.html">std::showpoint</a></div><div class="ttdeci">T showpoint(T... args)</div></div> <div class="ttc" id="ashowpoint_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/showpoint.html">std::showpoint</a></div><div class="ttdeci">T showpoint(T... args)</div></div>
<div class="ttc" id="aclassstack_html_a6cd4b95d5de00d41b2491392338384dc"><div class="ttname"><a href="../../d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition:</b> stack.h:99</div></div> <div class="ttc" id="aclassstack_html_a6cd4b95d5de00d41b2491392338384dc"><div class="ttname"><a href="../../d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition:</b> stack.h:99</div></div>
@@ -644,9 +643,9 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a8809e6df990f37c85c06474dd955cb2b"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a8809e6df990f37c85c06474dd955cb2b">machine_learning::neural_network::layers::DenseLayer::operator=</a></div><div class="ttdeci">DenseLayer &amp; operator=(const DenseLayer &amp;layer)=default</div></div> <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a8809e6df990f37c85c06474dd955cb2b"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a8809e6df990f37c85c06474dd955cb2b">machine_learning::neural_network::layers::DenseLayer::operator=</a></div><div class="ttdeci">DenseLayer &amp; operator=(const DenseLayer &amp;layer)=default</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:155</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:181</div></div>
<div class="ttc" id="anamespaceis__graph__bipartite_html"><div class="ttname"><a href="../../de/d83/namespaceis__graph__bipartite.html">is_graph_bipartite</a></div><div class="ttdoc">Functions for checking whether a graph is bipartite or not.</div></div> <div class="ttc" id="anamespaceis__graph__bipartite_html"><div class="ttname"><a href="../../de/d83/namespaceis__graph__bipartite.html">is_graph_bipartite</a></div><div class="ttdoc">Functions for checking whether a graph is bipartite or not.</div></div>
<div class="ttc" id="acoin__change__topdown_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:70</div></div> <div class="ttc" id="acoin__change__topdown_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:74</div></div>
<div class="ttc" id="afibonacci__fast_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div> <div class="ttc" id="afibonacci__fast_8cpp_html_a392fb874e547e582e9c66a08a1f23326"><div class="ttname"><a href="../../d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">MAX</a></div><div class="ttdeci">#define MAX</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.cpp:27</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a4dd9a9df9f8f05327bcf7b58b0a86576"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a4dd9a9df9f8f05327bcf7b58b0a86576">machine_learning::pop_back</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_back(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:119</div></div> <div class="ttc" id="anamespacemachine__learning_html_a4dd9a9df9f8f05327bcf7b58b0a86576"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a4dd9a9df9f8f05327bcf7b58b0a86576">machine_learning::pop_back</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_back(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:119</div></div>
<div class="ttc" id="aclass_graph_html_ac5a4d9a4f894a179198936042c778413"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph::addVertices</a></div><div class="ttdeci">void addVertices(unsigned int num=1)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:118</div></div> <div class="ttc" id="aclass_graph_html_ac5a4d9a4f894a179198936042c778413"><div class="ttname"><a href="../../da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph::addVertices</a></div><div class="ttdeci">void addVertices(unsigned int num=1)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:118</div></div>
@@ -662,7 +661,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="anamespacemachine__learning_html_a2055c2f3a076b3d4146aade5eb35666d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a2055c2f3a076b3d4146aade5eb35666d">machine_learning::operator/</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator/(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:365</div></div> <div class="ttc" id="anamespacemachine__learning_html_a2055c2f3a076b3d4146aade5eb35666d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a2055c2f3a076b3d4146aade5eb35666d">machine_learning::operator/</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; operator/(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const T &amp;val)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:365</div></div>
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a67249e31221231cf3aaf3cfd870372d0"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0">operator+</a></div><div class="ttdeci">std::vector&lt; T &gt; operator+(std::vector&lt; T &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:204</div></div> <div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a67249e31221231cf3aaf3cfd870372d0"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a67249e31221231cf3aaf3cfd870372d0">operator+</a></div><div class="ttdeci">std::vector&lt; T &gt; operator+(std::vector&lt; T &gt; const &amp;A, std::vector&lt; T &gt; const &amp;B)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:204</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:69</div></div> <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a6f5a9fdbb83ef731d739ba6707e21c3c"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c">graph::HKGraph::n</a></div><div class="ttdeci">int n</div><div class="ttdoc">n is the number of vertices on right side of Bipartite Graph</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:69</div></div>
<div class="ttc" id="anamespacelinear__algebra_html"><div class="ttname"><a href="../../d3/d78/namespacelinear__algebra.html">linear_algebra</a></div><div class="ttdoc">Linear Algebra algorithms.</div></div> <div class="ttc" id="anamespacelinear__algebra_html"><div class="ttname"><a href="../../d3/d78/namespacelinear__algebra.html">linear_algebra</a></div><div class="ttdoc">for io operations</div></div>
<div class="ttc" id="anamespacelinear__probing_html_a75d779938df7ebc68581d922b60a2541"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:98</div></div> <div class="ttc" id="anamespacelinear__probing_html_a75d779938df7ebc68581d922b60a2541"><div class="ttname"><a href="../../d8/d89/namespacelinear__probing.html#a75d779938df7ebc68581d922b60a2541">linear_probing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> linear_probing_hash_table.cpp:98</div></div>
<div class="ttc" id="anamespacemachine__learning_html_ad9d119e7520fa5c2d2428433f578c0bc"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad9d119e7520fa5c2d2428433f578c0bc">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:102</div></div> <div class="ttc" id="anamespacemachine__learning_html_ad9d119e7520fa5c2d2428433f578c0bc"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#ad9d119e7520fa5c2d2428433f578c0bc">machine_learning::pop_front</a></div><div class="ttdeci">std::valarray&lt; T &gt; pop_front(const std::valarray&lt; T &gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:102</div></div>
<div class="ttc" id="anamespacedouble__hashing_html"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></div><div class="ttdoc">An implementation of hash table using double hashing algorithm.</div></div> <div class="ttc" id="anamespacedouble__hashing_html"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></div><div class="ttdoc">An implementation of hash table using double hashing algorithm.</div></div>
@@ -698,14 +697,14 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="ashortest__common__supersequence_8cpp_html_ad2ee8d7e67da9f6eb85146b08dad95e6"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a></div><div class="ttdeci">std::string scs(const std::string &amp;str1, const std::string &amp;str2)</div><div class="ttdef"><b>Definition:</b> shortest_common_supersequence.cpp:42</div></div> <div class="ttc" id="ashortest__common__supersequence_8cpp_html_ad2ee8d7e67da9f6eb85146b08dad95e6"><div class="ttname"><a href="../../d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6">dynamic_programming::shortest_common_supersequence::scs</a></div><div class="ttdeci">std::string scs(const std::string &amp;str1, const std::string &amp;str2)</div><div class="ttdef"><b>Definition:</b> shortest_common_supersequence.cpp:42</div></div>
<div class="ttc" id="akohonen__som__topology_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:582</div></div> <div class="ttc" id="akohonen__som__topology_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:582</div></div>
<div class="ttc" id="aclass_trie_html_a6d10eb1669453395d1900ebd401954fb"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">Trie::hasChildren</a></div><div class="ttdeci">static bool hasChildren(std::shared_ptr&lt; TrieNode &gt; node)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:41</div></div> <div class="ttc" id="aclass_trie_html_a6d10eb1669453395d1900ebd401954fb"><div class="ttname"><a href="../../dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb">Trie::hasChildren</a></div><div class="ttdeci">static bool hasChildren(std::shared_ptr&lt; TrieNode &gt; node)</div><div class="ttdef"><b>Definition:</b> trie_modern.cpp:41</div></div>
<div class="ttc" id="a0__1__knapsack_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> 0_1_knapsack.cpp:95</div></div> <div class="ttc" id="a0__1__knapsack_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> 0_1_knapsack.cpp:96</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:120</div></div> <div class="ttc" id="anamespacedouble__hashing_html_ac2adfce49ac57f6dbd1778d2c1ce0d2b"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b">double_hashing::putProber</a></div><div class="ttdeci">bool putProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:120</div></div>
<div class="ttc" id="aspirograph_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:268</div></div> <div class="ttc" id="aspirograph_8cpp_html_a3c04138a5bfe5d72780bb7e82a18e627"><div class="ttname"><a href="../../da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">main</a></div><div class="ttdeci">int main(int argc, char **argv)</div><div class="ttdef"><b>Definition:</b> spirograph.cpp:268</div></div>
<div class="ttc" id="aclass_graph_html_adcbd1b60cab30b97c54d700eee8e456d"><div class="ttname"><a href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:68</div></div> <div class="ttc" id="aclass_graph_html_adcbd1b60cab30b97c54d700eee8e456d"><div class="ttname"><a href="../../da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph::Graph</a></div><div class="ttdeci">Graph(unsigned int vertices, AdjList adjList)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:68</div></div>
<div class="ttc" id="arandom_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a></div></div> <div class="ttc" id="arandom_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random.html">std::default_random_engine</a></div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3b49011c09cf90a116ab53bef61cd95a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">function to add edge from u to v</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:242</div></div> <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a3b49011c09cf90a116ab53bef61cd95a"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph::addEdge</a></div><div class="ttdeci">void addEdge(int u, int v)</div><div class="ttdoc">function to add edge from u to v</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:242</div></div>
<div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">std::queue::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div> <div class="ttc" id="aemplace_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/emplace.html">std::queue::emplace</a></div><div class="ttdeci">T emplace(T... args)</div></div>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:92</div></div> <div class="ttc" id="apalindrome__partitioning_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:98</div></div>
<div class="ttc" id="anamespacegraph_html_a9fc2ded2807582edf398e6d7c7114914"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9fc2ded2807582edf398e6d7c7114914">graph::getConnectedComponents</a></div><div class="ttdeci">int getConnectedComponents(const std::vector&lt; std::vector&lt; int &gt;&gt; *adj)</div><div class="ttdoc">Function that perfoms depth first search algorithm on graph and calculated the number of connected co...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:77</div></div> <div class="ttc" id="anamespacegraph_html_a9fc2ded2807582edf398e6d7c7114914"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a9fc2ded2807582edf398e6d7c7114914">graph::getConnectedComponents</a></div><div class="ttdeci">int getConnectedComponents(const std::vector&lt; std::vector&lt; int &gt;&gt; *adj)</div><div class="ttdoc">Function that perfoms depth first search algorithm on graph and calculated the number of connected co...</div><div class="ttdef"><b>Definition:</b> connected_components.cpp:77</div></div>
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:212</div></div> <div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html_a42589cc39d6bbff6c997152f1b96e356"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor::populate_up</a></div><div class="ttdeci">void populate_up()</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:212</div></div>
<div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="abasic_stringstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_stringstream.html">std::stringstream</a></div><div class="ttdoc">STL class.</div></div>
@@ -767,10 +766,10 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div> <div class="ttc" id="asqrt_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sqrt.html">std::sqrt</a></div><div class="ttdeci">T sqrt(T... args)</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_af4c937d823c412d99fbe60c99dbf0a4f"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a></div><div class="ttdeci">int stack_idx</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:23</div></div> <div class="ttc" id="aparanthesis__matching_8cpp_html_af4c937d823c412d99fbe60c99dbf0a4f"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#af4c937d823c412d99fbe60c99dbf0a4f">stack_idx</a></div><div class="ttdeci">int stack_idx</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:23</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html_a8930d1470d132b19e430d1c71f94c904"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:74</div></div> <div class="ttc" id="aclassgraph_1_1_graph_html_a8930d1470d132b19e430d1c71f94c904"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">graph::Graph::number_of_vertices</a></div><div class="ttdeci">int number_of_vertices() const</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:74</div></div>
<div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:137</div></div> <div class="ttc" id="abreadth__first__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:139</div></div>
<div class="ttc" id="akadane2_8cpp_html_af3029007a422a914a85c0b0122f1c7b4"><div class="ttname"><a href="../../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a></div><div class="ttdeci">int maxSubArray(const std::array&lt; int, N &gt; &amp;n)</div><div class="ttdoc">maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...</div><div class="ttdef"><b>Definition:</b> kadane2.cpp:42</div></div> <div class="ttc" id="akadane2_8cpp_html_af3029007a422a914a85c0b0122f1c7b4"><div class="ttname"><a href="../../db/dca/kadane2_8cpp.html#af3029007a422a914a85c0b0122f1c7b4">dynamic_programming::kadane::maxSubArray</a></div><div class="ttdeci">int maxSubArray(const std::array&lt; int, N &gt; &amp;n)</div><div class="ttdoc">maxSubArray function is used to calculate the maximum sum subarray and returns the value of maximum s...</div><div class="ttdef"><b>Definition:</b> kadane2.cpp:42</div></div>
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a36494e26ff36d6e15c1022bb9a1ee848"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">machine_learning::neural_network::NeuralNetwork::evaluate_from_csv</a></div><div class="ttdeci">void evaluate_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:638</div></div> <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a36494e26ff36d6e15c1022bb9a1ee848"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">machine_learning::neural_network::NeuralNetwork::evaluate_from_csv</a></div><div class="ttdeci">void evaluate_from_csv(const std::string &amp;file_name, const bool &amp;last_label, const bool &amp;normalize, const int &amp;slip_lines=1)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:638</div></div>
<div class="ttc" id="abreadth__first__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:184</div></div> <div class="ttc" id="abreadth__first__search_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:186</div></div>
<div class="ttc" id="akohonen__som__trace_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:233</div></div> <div class="ttc" id="akohonen__som__trace_8cpp_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:233</div></div>
<div class="ttc" id="aclear_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/clear.html">std::vector::clear</a></div><div class="ttdeci">T clear(T... args)</div></div> <div class="ttc" id="aclear_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/clear.html">std::vector::clear</a></div><div class="ttdeci">T clear(T... args)</div></div>
<div class="ttc" id="aclasshash__chain_html_a6b4b4de1a8c96f98a63a77f650a9dcff"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">hash_chain::add</a></div><div class="ttdeci">void add(int x, int h)</div><div class="ttdoc">create and add a new node with a give value and at a given height</div><div class="ttdef"><b>Definition:</b> chaining.cpp:45</div></div> <div class="ttc" id="aclasshash__chain_html_a6b4b4de1a8c96f98a63a77f650a9dcff"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">hash_chain::add</a></div><div class="ttdeci">void add(int x, int h)</div><div class="ttdoc">create and add a new node with a give value and at a given height</div><div class="ttdef"><b>Definition:</b> chaining.cpp:45</div></div>
@@ -794,7 +793,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a98eb5807f21b783c341cab402ced6732"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98eb5807f21b783c341cab402ced6732">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;v)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:22</div></div> <div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a98eb5807f21b783c341cab402ced6732"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a98eb5807f21b783c341cab402ced6732">operator&lt;&lt;</a></div><div class="ttdeci">std::ostream &amp; operator&lt;&lt;(std::ostream &amp;out, std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;v)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:22</div></div>
<div class="ttc" id="aclass_cycle_check_html_ad9a270ffba3a68539b92272c702e3474"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a></div><div class="ttdeci">static bool isCyclicDFS(Graph const &amp;graph)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:212</div></div> <div class="ttc" id="aclass_cycle_check_html_ad9a270ffba3a68539b92272c702e3474"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html#ad9a270ffba3a68539b92272c702e3474">CycleCheck::isCyclicDFS</a></div><div class="ttdeci">static bool isCyclicDFS(Graph const &amp;graph)</div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:212</div></div>
<div class="ttc" id="agraph_2dijkstra_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:113</div></div> <div class="ttc" id="agraph_2dijkstra_8cpp_html_a88ec9ad42717780d6caaff9d3d6977f9"><div class="ttname"><a href="../../d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">tests</a></div><div class="ttdeci">void tests()</div><div class="ttdef"><b>Definition:</b> dijkstra.cpp:113</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_aed4d308f46ca1d91e348ca260ec1d2fb"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">linear_algebra::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:53</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_aed4d308f46ca1d91e348ca260ec1d2fb"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#aed4d308f46ca1d91e348ca260ec1d2fb">linear_algebra::gram_schmidt::dot_product</a></div><div class="ttdeci">double dot_product(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:59</div></div>
<div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:537</div></div> <div class="ttc" id="akohonen__som__topology_8cpp_html_a6d0455dd5c30adda100e95f0423c786e"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a></div><div class="ttdeci">void test3()</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:537</div></div>
<div class="ttc" id="aclass_cycle_check_html"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html">CycleCheck</a></div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:158</div></div> <div class="ttc" id="aclass_cycle_check_html"><div class="ttname"><a href="../../d3/dbb/class_cycle_check.html">CycleCheck</a></div><div class="ttdef"><b>Definition:</b> cycle_check_directed_graph.cpp:158</div></div>
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a0ee425af6fd83a033c021128b8253f52"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a0ee425af6fd83a033c021128b8253f52">machine_learning::neural_network::NeuralNetwork::evaluate</a></div><div class="ttdeci">void evaluate(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt;&gt;&gt; &amp;X, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt;&gt;&gt; &amp;Y)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:606</div></div> <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1_neural_network_html_a0ee425af6fd83a033c021128b8253f52"><div class="ttname"><a href="../../d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a0ee425af6fd83a033c021128b8253f52">machine_learning::neural_network::NeuralNetwork::evaluate</a></div><div class="ttdeci">void evaluate(const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt;&gt;&gt; &amp;X, const std::vector&lt; std::vector&lt; std::valarray&lt; double &gt;&gt;&gt; &amp;Y)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:606</div></div>
@@ -812,9 +811,9 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aadaline__learning_8cpp_html_a52053d88ea1bcbbed9aca67ab4eeb499"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">test1</a></div><div class="ttdeci">void test1(double eta=0.01)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:224</div></div> <div class="ttc" id="aadaline__learning_8cpp_html_a52053d88ea1bcbbed9aca67ab4eeb499"><div class="ttname"><a href="../../d5/db0/adaline__learning_8cpp.html#a52053d88ea1bcbbed9aca67ab4eeb499">test1</a></div><div class="ttdeci">void test1(double eta=0.01)</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:224</div></div>
<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/at.html">std::vector::at</a></div><div class="ttdeci">T at(T... args)</div></div> <div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/at.html">std::vector::at</a></div><div class="ttdeci">T at(T... args)</div></div>
<div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:96</div></div> <div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:96</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_a46e459aff5eafffb5ad9ceb129b4d274"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">linear_algebra::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:71</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_a46e459aff5eafffb5ad9ceb129b4d274"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#a46e459aff5eafffb5ad9ceb129b4d274">linear_algebra::gram_schmidt::projection</a></div><div class="ttdeci">double projection(const std::array&lt; double, 10 &gt; &amp;x, const std::array&lt; double, 10 &gt; &amp;y, const int &amp;c)</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:79</div></div>
<div class="ttc" id="anamespaceneural__network_html"><div class="ttname"><a href="../../d0/d2e/namespaceneural__network.html">neural_network</a></div><div class="ttdoc">Neural Network or Multilayer Perceptron.</div></div> <div class="ttc" id="anamespaceneural__network_html"><div class="ttname"><a href="../../d0/d2e/namespaceneural__network.html">neural_network</a></div><div class="ttdoc">Neural Network or Multilayer Perceptron.</div></div>
<div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:45</div></div> <div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:47</div></div>
<div class="ttc" id="anamespacegraph_html_a2e6017a54d445819ede9adcf33240e1a"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search(const std::vector&lt; std::vector&lt; size_t &gt;&gt; &amp;adj, size_t start)</div><div class="ttdoc">initiates depth first search algorithm.</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:99</div></div> <div class="ttc" id="anamespacegraph_html_a2e6017a54d445819ede9adcf33240e1a"><div class="ttname"><a href="../../df/dce/namespacegraph.html#a2e6017a54d445819ede9adcf33240e1a">graph::depth_first_search</a></div><div class="ttdeci">void depth_first_search(const std::vector&lt; std::vector&lt; size_t &gt;&gt; &amp;adj, size_t start)</div><div class="ttdoc">initiates depth first search algorithm.</div><div class="ttdef"><b>Definition:</b> depth_first_search.cpp:99</div></div>
<div class="ttc" id="aclasshash__chain_html_ae9ddce410015ed8dda6380130d82d6c2"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain::_mod</a></div><div class="ttdeci">int _mod</div><div class="ttdoc">modulus of the class</div><div class="ttdef"><b>Definition:</b> chaining.cpp:27</div></div> <div class="ttc" id="aclasshash__chain_html_ae9ddce410015ed8dda6380130d82d6c2"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain::_mod</a></div><div class="ttdeci">int _mod</div><div class="ttdoc">modulus of the class</div><div class="ttdef"><b>Definition:</b> chaining.cpp:27</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
@@ -850,7 +849,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aneural__network_8cpp_html_a45d3e30406712ada3d9713ece3c1b153"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153">machine_learning::neural_network::util_functions::square</a></div><div class="ttdeci">double square(const double &amp;x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:106</div></div> <div class="ttc" id="aneural__network_8cpp_html_a45d3e30406712ada3d9713ece3c1b153"><div class="ttname"><a href="../../d2/d58/neural__network_8cpp.html#a45d3e30406712ada3d9713ece3c1b153">machine_learning::neural_network::util_functions::square</a></div><div class="ttdeci">double square(const double &amp;x)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:106</div></div>
<div class="ttc" id="achaining_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> chaining.cpp:133</div></div> <div class="ttc" id="achaining_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> chaining.cpp:133</div></div>
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:103</div></div> <div class="ttc" id="ahamiltons__cycle_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:103</div></div>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:120</div></div> <div class="ttc" id="apalindrome__partitioning_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:128</div></div>
<div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/erase.html">std::set::erase</a></div><div class="ttdeci">T erase(T... args)</div></div> <div class="ttc" id="aerase_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set/erase.html">std::set::erase</a></div><div class="ttdeci">T erase(T... args)</div></div>
<div class="ttc" id="aclassmachine__learning_1_1adaline_html_a4cd8fe438032fedaa66f93bfd66f5492"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">machine_learning::adaline::weights</a></div><div class="ttdeci">std::vector&lt; double &gt; weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:209</div></div> <div class="ttc" id="aclassmachine__learning_1_1adaline_html_a4cd8fe438032fedaa66f93bfd66f5492"><div class="ttname"><a href="../../d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">machine_learning::adaline::weights</a></div><div class="ttdeci">std::vector&lt; double &gt; weights</div><div class="ttdoc">weights of the neural network</div><div class="ttdef"><b>Definition:</b> adaline_learning.cpp:209</div></div>
<div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt; double &gt;</a></div></div> <div class="ttc" id="avalarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/valarray.html">std::valarray&lt; double &gt;</a></div></div>
@@ -873,6 +872,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:77</div></div> <div class="ttc" id="aclassgraph_1_1_graph_html_a59940c462861f2fcf4951d1b6c084e6a"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">graph::Graph::neighbors</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; int &gt; &gt; neighbors</div><div class="ttdoc">for each vertex it stores a list indicies of its neighbors</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:77</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:161</div></div> <div class="ttc" id="anamespacedouble__hashing_html_af4981819aae8bc7e7beeaef02615e30d"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#af4981819aae8bc7e7beeaef02615e30d">double_hashing::rehash</a></div><div class="ttdeci">void rehash()</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:161</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:36</div></div> <div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:36</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html_ab1a1a96cd4cddf0d4feb02855c4c16af"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#ab1a1a96cd4cddf0d4feb02855c4c16af">graph::Graph::breadth_first_search</a></div><div class="ttdeci">std::map&lt; T, bool &gt; breadth_first_search(T src)</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:96</div></div>
<div class="ttc" id="aclassstack_html_a5705c3926dcf5fd3f9c964467a50b81d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d">stack::push</a></div><div class="ttdeci">void push(Type item)</div><div class="ttdef"><b>Definition:</b> stack.h:83</div></div> <div class="ttc" id="aclassstack_html_a5705c3926dcf5fd3f9c964467a50b81d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d">stack::push</a></div><div class="ttdeci">void push(Type item)</div><div class="ttdef"><b>Definition:</b> stack.h:83</div></div>
<div class="ttc" id="akohonen__som__trace_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:315</div></div> <div class="ttc" id="akohonen__som__trace_8cpp_html_a0283886819c7c140a023582b7269e2d0"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#a0283886819c7c140a023582b7269e2d0">test2</a></div><div class="ttdeci">void test2()</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:315</div></div>
<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div><div class="ttdoc">STL class.</div></div>
@@ -907,10 +907,10 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition:</b> bellman_ford.cpp:7</div></div> <div class="ttc" id="aclass_edge_html"><div class="ttname"><a href="../../d7/d77/class_edge.html">Edge</a></div><div class="ttdef"><b>Definition:</b> bellman_ford.cpp:7</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a05b9445c6ab65053b9bf9897a96af82d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a05b9445c6ab65053b9bf9897a96af82d">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; minmax_scaler(const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt;&gt;&gt; &amp;A, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:269</div></div> <div class="ttc" id="anamespacemachine__learning_html_a05b9445c6ab65053b9bf9897a96af82d"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a05b9445c6ab65053b9bf9897a96af82d">machine_learning::minmax_scaler</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; std::valarray&lt; T &gt; &gt; &gt; minmax_scaler(const std::vector&lt; std::vector&lt; std::valarray&lt; T &gt;&gt;&gt; &amp;A, const T &amp;low, const T &amp;high)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:269</div></div>
<div class="ttc" id="astructquadratic__probing_1_1_entry_html_a9df1118010a233d13ab3dd699bcb513e"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">quadratic_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:38</div></div> <div class="ttc" id="astructquadratic__probing_1_1_entry_html_a9df1118010a233d13ab3dd699bcb513e"><div class="ttname"><a href="../../da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">quadratic_probing::Entry::Entry</a></div><div class="ttdeci">Entry(int key=notPresent)</div><div class="ttdoc">constructor</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:38</div></div>
<div class="ttc" id="a0__1__knapsack_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> 0_1_knapsack.cpp:125</div></div> <div class="ttc" id="a0__1__knapsack_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> 0_1_knapsack.cpp:126</div></div>
<div class="ttc" id="aclassstack_html_a21c0bb6ce7dcfe445cc12031977ea344"><div class="ttname"><a href="../../d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344">stack::top</a></div><div class="ttdeci">Type top()</div><div class="ttdef"><b>Definition:</b> stack.h:93</div></div> <div class="ttc" id="aclassstack_html_a21c0bb6ce7dcfe445cc12031977ea344"><div class="ttname"><a href="../../d1/dc2/classstack.html#a21c0bb6ce7dcfe445cc12031977ea344">stack::top</a></div><div class="ttdeci">Type top()</div><div class="ttdef"><b>Definition:</b> stack.h:93</div></div>
<div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:55</div></div> <div class="ttc" id="aclassgeometry_1_1jarvis_1_1_convexhull_html"><div class="ttname"><a href="../../d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">geometry::jarvis::Convexhull</a></div><div class="ttdef"><b>Definition:</b> jarvis_algorithm.cpp:55</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html_a877b2cba40d8d46dde6fb4209effed19"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph::add_edge</a></div><div class="ttdeci">void add_edge(T u, T v, bool bidir=true)</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:72</div></div> <div class="ttc" id="aclassgraph_1_1_graph_html_a877b2cba40d8d46dde6fb4209effed19"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph::add_edge</a></div><div class="ttdeci">void add_edge(T u, T v, bool bidir=true)</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:74</div></div>
<div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:133</div></div> <div class="ttc" id="aclassgraph_1_1_h_k_graph_html_a7491add14d9fc04f679114ca6d6f0f93"><div class="ttname"><a href="../../d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph::bfs</a></div><div class="ttdeci">bool bfs()</div><div class="ttdoc">This function checks for the possibility of augmented path availability.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:133</div></div>
<div class="ttc" id="ahamiltons__cycle_8cpp_html_a0ceb473236b5dc53a85e281ef528dd96"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0ceb473236b5dc53a85e281ef528dd96">hamilton_cycle</a></div><div class="ttdeci">bool hamilton_cycle(const std::vector&lt; std::vector&lt; bool &gt;&gt; &amp;routes)</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:30</div></div> <div class="ttc" id="ahamiltons__cycle_8cpp_html_a0ceb473236b5dc53a85e281ef528dd96"><div class="ttname"><a href="../../dd/d0c/hamiltons__cycle_8cpp.html#a0ceb473236b5dc53a85e281ef528dd96">hamilton_cycle</a></div><div class="ttdeci">bool hamilton_cycle(const std::vector&lt; std::vector&lt; bool &gt;&gt; &amp;routes)</div><div class="ttdef"><b>Definition:</b> hamiltons_cycle.cpp:30</div></div>
<div class="ttc" id="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:134</div></div> <div class="ttc" id="aclassdata__structures_1_1trie_html_aeac27cfd397d2dd3f2f519efffafeeab"><div class="ttname"><a href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a></div><div class="ttdeci">bool deleteString(const std::string &amp;str, int index)</div><div class="ttdef"><b>Definition:</b> trie_tree.cpp:134</div></div>
@@ -938,7 +938,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="ahopcroft__karp_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:306</div></div> <div class="ttc" id="ahopcroft__karp_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> hopcroft_karp.cpp:306</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a29f543e2626bad58907661e1e45028a6"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">double_hashing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:133</div></div> <div class="ttc" id="anamespacedouble__hashing_html_a29f543e2626bad58907661e1e45028a6"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a29f543e2626bad58907661e1e45028a6">double_hashing::searchingProber</a></div><div class="ttdeci">bool searchingProber(const Entry &amp;entry, int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:133</div></div>
<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div> <div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
<div class="ttc" id="agram__schmidt_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:213</div></div> <div class="ttc" id="agram__schmidt_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main Function.</div><div class="ttdef"><b>Definition:</b> gram_schmidt.cpp:248</div></div>
<div class="ttc" id="aclasshash__chain_html_a48236d44349c3ebce4774b706f4f8a0f"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain::next</a></div><div class="ttdeci">std::shared_ptr&lt; struct Node &gt; next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition:</b> chaining.cpp:23</div></div> <div class="ttc" id="aclasshash__chain_html_a48236d44349c3ebce4774b706f4f8a0f"><div class="ttname"><a href="../../dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain::next</a></div><div class="ttdeci">std::shared_ptr&lt; struct Node &gt; next</div><div class="ttdoc">pointer to the next node</div><div class="ttdef"><b>Definition:</b> chaining.cpp:23</div></div>
<div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:145</div></div> <div class="ttc" id="aclassgraph_1_1_lowest_common_ancestor_html"><div class="ttname"><a href="../../d9/d23/classgraph_1_1_lowest_common_ancestor.html">graph::LowestCommonAncestor</a></div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:145</div></div>
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a35ab6f1b2840f89a858ca36b78739b69"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a35ab6f1b2840f89a858ca36b78739b69">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;kernel)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:183</div></div> <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html_a35ab6f1b2840f89a858ca36b78739b69"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a35ab6f1b2840f89a858ca36b78739b69">machine_learning::neural_network::layers::DenseLayer::DenseLayer</a></div><div class="ttdeci">DenseLayer(const int &amp;neurons, const std::string &amp;activation, const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;kernel)</div><div class="ttdef"><b>Definition:</b> neural_network.cpp:183</div></div>
@@ -1022,7 +1022,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">machine_learning::neural_network::layers::DenseLayer</a></div><div class="ttdef"><b>Definition:</b> neural_network.cpp:125</div></div> <div class="ttc" id="aclassmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer_html"><div class="ttname"><a href="../../dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">machine_learning::neural_network::layers::DenseLayer</a></div><div class="ttdef"><b>Definition:</b> neural_network.cpp:125</div></div>
<div class="ttc" id="akohonen__som__topology_8cpp_html_a6b5e744876fd980a3451cbb385d4e755"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(std::vector&lt; std::valarray&lt; double &gt;&gt; *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:330</div></div> <div class="ttc" id="akohonen__som__topology_8cpp_html_a6b5e744876fd980a3451cbb385d4e755"><div class="ttname"><a href="../../d4/def/kohonen__som__topology_8cpp.html#a6b5e744876fd980a3451cbb385d4e755">test_2d_classes</a></div><div class="ttdeci">void test_2d_classes(std::vector&lt; std::valarray&lt; double &gt;&gt; *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.cpp:330</div></div>
<div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:108</div></div> <div class="ttc" id="aclassgraph_1_1_rooted_tree_html_ab22a97bf6209a085fc2d788c3c0dacbe"><div class="ttname"><a href="../../d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree::root</a></div><div class="ttdeci">int root</div><div class="ttdoc">Index of the root vertex.</div><div class="ttdef"><b>Definition:</b> lowest_common_ancestor.cpp:108</div></div>
<div class="ttc" id="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:42</div></div> <div class="ttc" id="apalindrome__partitioning_8cpp_html_a52ee22882858d2b1cf04293f02ed839a"><div class="ttname"><a href="../../d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a">dynamic_programming::palindrome_partitioning::pal_part</a></div><div class="ttdeci">int pal_part(const std::string &amp;str)</div><div class="ttdef"><b>Definition:</b> palindrome_partitioning.cpp:45</div></div>
<div class="ttc" id="arange_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="arange_error_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/range_error.html">std::range_error</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:12</div></div> <div class="ttc" id="astruct_point_html"><div class="ttname"><a href="../../d8/dc8/struct_point.html">Point</a></div><div class="ttdef"><b>Definition:</b> line_segment_intersection.cpp:12</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a6ef38e5947aef609f908bfbfeaf11d75"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6ef38e5947aef609f908bfbfeaf11d75">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; hadamard_product(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:494</div></div> <div class="ttc" id="anamespacemachine__learning_html_a6ef38e5947aef609f908bfbfeaf11d75"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6ef38e5947aef609f908bfbfeaf11d75">machine_learning::hadamard_product</a></div><div class="ttdeci">std::vector&lt; std::valarray&lt; T &gt; &gt; hadamard_product(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;B)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:494</div></div>
@@ -1055,6 +1055,7 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="anamespacemachine__learning_html_a4d136cbf20e3126ed9b934ab2d03f18b"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a4d136cbf20e3126ed9b934ab2d03f18b">machine_learning::zeroes_initialization</a></div><div class="ttdeci">void zeroes_initialization(std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:213</div></div> <div class="ttc" id="anamespacemachine__learning_html_a4d136cbf20e3126ed9b934ab2d03f18b"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a4d136cbf20e3126ed9b934ab2d03f18b">machine_learning::zeroes_initialization</a></div><div class="ttdeci">void zeroes_initialization(std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A, const std::pair&lt; size_t, size_t &gt; &amp;shape)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:213</div></div>
<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div> <div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div>
<div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="aset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/set.html">std::set</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html_acebf0505d625b043bb9c8c27c7a8def0"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">graph::Graph::adjacency_list</a></div><div class="ttdeci">std::map&lt; T, std::list&lt; T &gt; &gt; adjacency_list</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:69</div></div>
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a30acf52af3184bc22274234ef5a73536"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a30acf52af3184bc22274234ef5a73536">operator/</a></div><div class="ttdeci">std::vector&lt; float &gt; operator/(std::vector&lt; T &gt; const &amp;A, float const scalar)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:174</div></div> <div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a30acf52af3184bc22274234ef5a73536"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a30acf52af3184bc22274234ef5a73536">operator/</a></div><div class="ttdeci">std::vector&lt; float &gt; operator/(std::vector&lt; T &gt; const &amp;A, float const scalar)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:174</div></div>
<div class="ttc" id="anamespacemachine__learning_html_acc6a28f40512dbda75ab1a3969248898"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acc6a28f40512dbda75ab1a3969248898">machine_learning::kohonen_som_tracer</a></div><div class="ttdeci">void kohonen_som_tracer(const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;X, std::vector&lt; std::valarray&lt; double &gt;&gt; *W, double alpha_min)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:149</div></div> <div class="ttc" id="anamespacemachine__learning_html_acc6a28f40512dbda75ab1a3969248898"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#acc6a28f40512dbda75ab1a3969248898">machine_learning::kohonen_som_tracer</a></div><div class="ttdeci">void kohonen_som_tracer(const std::vector&lt; std::valarray&lt; double &gt;&gt; &amp;X, std::vector&lt; std::valarray&lt; double &gt;&gt; *W, double alpha_min)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:149</div></div>
<div class="ttc" id="anamespaceutil__functions_html"><div class="ttname"><a href="../../d3/d17/namespaceutil__functions.html">util_functions</a></div><div class="ttdoc">Various utility functions used in Neural network.</div></div> <div class="ttc" id="anamespaceutil__functions_html"><div class="ttname"><a href="../../d3/d17/namespaceutil__functions.html">util_functions</a></div><div class="ttdoc">Various utility functions used in Neural network.</div></div>
@@ -1071,13 +1072,12 @@ $(document).ready(function(){initNavTree('d8/d95/vector__ops_8hpp_source.html','
<div class="ttc" id="ahash_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash</a></div></div> <div class="ttc" id="ahash_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/hash.html">std::hash</a></div></div>
<div class="ttc" id="akohonen__som__trace_8cpp_html_ab47fb569e63648bd76e7edfdacc02dbd"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#ab47fb569e63648bd76e7edfdacc02dbd">test_circle</a></div><div class="ttdeci">void test_circle(std::vector&lt; std::valarray&lt; double &gt;&gt; *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:196</div></div> <div class="ttc" id="akohonen__som__trace_8cpp_html_ab47fb569e63648bd76e7edfdacc02dbd"><div class="ttname"><a href="../../d9/d49/kohonen__som__trace_8cpp.html#ab47fb569e63648bd76e7edfdacc02dbd">test_circle</a></div><div class="ttdeci">void test_circle(std::vector&lt; std::valarray&lt; double &gt;&gt; *data)</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.cpp:196</div></div>
<div class="ttc" id="aquadratic__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:246</div></div> <div class="ttc" id="aquadratic__probing__hash__table_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> quadratic_probing_hash_table.cpp:246</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="acut__rod_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:71</div></div> <div class="ttc" id="acut__rod_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:71</div></div>
<div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div> <div class="ttc" id="anamespacemachine__learning_html_a5305cc18d11943d3dc0d66e70d7e9c44"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a5305cc18d11943d3dc0d66e70d7e9c44">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt;&gt; &amp;A)</div><div class="ttdef"><b>Definition:</b> vector_ops.hpp:232</div></div>
<div class="ttc" id="astack_8h_html"><div class="ttname"><a href="../../d7/de0/stack_8h.html">stack.h</a></div><div class="ttdoc">This class specifies the basic operation on a stack as a linked list.</div></div> <div class="ttc" id="astack_8h_html"><div class="ttname"><a href="../../d7/de0/stack_8h.html">stack.h</a></div><div class="ttdoc">This class specifies the basic operation on a stack as a linked list.</div></div>
<div class="ttc" id="acut__rod_8cpp_html_ae550b90e6057a7f976c9d643f706c4f5"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#ae550b90e6057a7f976c9d643f706c4f5">dynamic_programming::cut_rod::maxProfitByCuttingRod</a></div><div class="ttdeci">int maxProfitByCuttingRod(const std::array&lt; int, T &gt; &amp;price, const int n)</div><div class="ttdoc">Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:44</div></div> <div class="ttc" id="acut__rod_8cpp_html_ae550b90e6057a7f976c9d643f706c4f5"><div class="ttname"><a href="../../d6/d10/cut__rod_8cpp.html#ae550b90e6057a7f976c9d643f706c4f5">dynamic_programming::cut_rod::maxProfitByCuttingRod</a></div><div class="ttdeci">int maxProfitByCuttingRod(const std::array&lt; int, T &gt; &amp;price, const int n)</div><div class="ttdoc">Cuts the rod in different pieces and stores the maximum profit for each piece of the rod.</div><div class="ttdef"><b>Definition:</b> cut_rod.cpp:44</div></div>
<div class="ttc" id="acoin__change__topdown_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:86</div></div> <div class="ttc" id="acoin__change__topdown_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:91</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html_a6e3efabd5e401ef0f47c179866e7454e"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a6e3efabd5e401ef0f47c179866e7454e">graph::Graph::breadth_first_search</a></div><div class="ttdeci">std::map&lt; T, bool &gt; breadth_first_search(T src)</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:94</div></div>
<div class="ttc" id="abasic_ifstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">std::ifstream</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="abasic_ifstream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ifstream.html">std::ifstream</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a889f9de199fa793497c864d8e493af05"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05">get_transpose</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; T &gt; &gt; get_transpose(std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:300</div></div> <div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a889f9de199fa793497c864d8e493af05"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05">get_transpose</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; T &gt; &gt; get_transpose(std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:300</div></div>

11
d8/d96/gram__schmidt_8cpp__incl.map
View File

@@ -1,7 +1,8 @@
<map id="linear_algebra/gram_schmidt.cpp" name="linear_algebra/gram_schmidt.cpp"> <map id="linear_algebra/gram_schmidt.cpp" name="linear_algebra/gram_schmidt.cpp">
<area shape="rect" id="node1" title="Gram Schmidt Orthogonalisation Process" alt="" coords="110,5,245,47"/> <area shape="rect" id="node1" title="Gram Schmidt Orthogonalisation Process" alt="" coords="133,5,267,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/> <area shape="rect" id="node2" title=" " alt="" coords="5,95,56,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="102,95,167,121"/> <area shape="rect" id="node3" title=" " alt="" coords="81,95,146,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="192,95,251,121"/> <area shape="rect" id="node4" title=" " alt="" coords="171,95,229,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="275,95,325,121"/> <area shape="rect" id="node5" title=" " alt="" coords="253,95,325,121"/>
<area shape="rect" id="node6" title=" " alt="" coords="350,95,413,121"/>
</map> </map>

2
d8/d96/gram__schmidt_8cpp__incl.md5
View File

@@ -1 +1 @@
0742438f0791023906f8b71fe551db42 c8eaa796cc07a53ade29d1f52e95a9e8

59
d8/d96/gram__schmidt_8cpp__incl.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846) <!-- Generated by graphviz version 2.44.1 (20200629.0846)
--> -->
<!-- Title: linear_algebra/gram_schmidt.cpp Pages: 1 --> <!-- Title: linear_algebra/gram_schmidt.cpp Pages: 1 -->
<svg width="248pt" height="95pt" <svg width="314pt" height="95pt"
viewBox="0.00 0.00 248.00 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 313.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>linear_algebra/gram_schmidt.cpp</title> <title>linear_algebra/gram_schmidt.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 244,-91 244,4 -4,4"/> <polygon fill="white" stroke="transparent" points="-4,4 -4,-91 309.5,-91 309.5,4 -4,4"/>
<!-- Node1 --> <!-- Node1 -->
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Gram Schmidt Orthogonalisation Process"> <g id="a_node1"><a xlink:title="Gram Schmidt Orthogonalisation Process">
<polygon fill="#bfbfbf" stroke="black" points="78.5,-56.5 78.5,-86.5 179.5,-86.5 179.5,-56.5 78.5,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="95.5,-56.5 95.5,-86.5 196.5,-86.5 196.5,-56.5 95.5,-56.5"/>
<text text-anchor="start" x="86.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">linear_algebra/gram</text> <text text-anchor="start" x="103.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">linear_algebra/gram</text>
<text text-anchor="middle" x="129" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_schmidt.cpp</text> <text text-anchor="middle" x="146" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_schmidt.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -23,61 +23,76 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 38,-19.5 38,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="19" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M104.83,-56.4C88.48,-46.86 66.99,-34.32 50.73,-24.84"/> <path fill="none" stroke="midnightblue" d="M115.9,-56.4C94.88,-46.55 67.03,-33.5 46.58,-23.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="52.24,-21.67 41.84,-19.66 48.72,-27.72 52.24,-21.67"/> <polygon fill="midnightblue" stroke="midnightblue" points="48.02,-20.73 37.48,-19.66 45.05,-27.07 48.02,-20.73"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72.5,-0.5 72.5,-19.5 121.5,-19.5 121.5,-0.5 72.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="56.5,-0.5 56.5,-19.5 105.5,-19.5 105.5,-0.5 56.5,-0.5"/>
<text text-anchor="middle" x="97" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text> <text text-anchor="middle" x="81" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M121.42,-56.4C116.96,-48.11 111.28,-37.55 106.52,-28.71"/> <path fill="none" stroke="midnightblue" d="M130.6,-56.4C120.76,-47.4 108.01,-35.72 97.89,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="109.48,-26.81 101.66,-19.66 103.31,-30.12 109.48,-26.81"/> <polygon fill="midnightblue" stroke="midnightblue" points="100.2,-23.83 90.46,-19.66 95.47,-28.99 100.2,-23.83"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:title=" "> <g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="140,-0.5 140,-19.5 184,-19.5 184,-0.5 140,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="124,-0.5 124,-19.5 168,-19.5 168,-0.5 124,-0.5"/>
<text text-anchor="middle" x="162" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text> <text text-anchor="middle" x="146" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M136.82,-56.4C141.47,-48.02 147.4,-37.33 152.34,-28.42"/> <path fill="none" stroke="midnightblue" d="M146,-56.4C146,-48.47 146,-38.46 146,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="155.41,-30.1 157.2,-19.66 149.29,-26.71 155.41,-30.1"/> <polygon fill="midnightblue" stroke="midnightblue" points="149.5,-29.66 146,-19.66 142.5,-29.66 149.5,-29.66"/>
</g> </g>
<!-- Node5 --> <!-- Node5 -->
<g id="node5" class="node"> <g id="node5" class="node">
<title>Node5</title> <title>Node5</title>
<g id="a_node5"><a xlink:title=" "> <g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="202,-0.5 202,-19.5 240,-19.5 240,-0.5 202,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="186,-0.5 186,-19.5 240,-19.5 240,-0.5 186,-0.5"/>
<text text-anchor="middle" x="221" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text> <text text-anchor="middle" x="213" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node5 --> <!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge"> <g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title> <title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M150.8,-56.4C165.41,-46.95 184.57,-34.56 199.18,-25.11"/> <path fill="none" stroke="midnightblue" d="M161.88,-56.4C172.02,-47.4 185.16,-35.72 195.59,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="201.12,-28.03 207.61,-19.66 197.32,-22.15 201.12,-28.03"/> <polygon fill="midnightblue" stroke="midnightblue" points="198.1,-28.92 203.25,-19.66 193.45,-23.68 198.1,-28.92"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="258.5,-0.5 258.5,-19.5 305.5,-19.5 305.5,-0.5 258.5,-0.5"/>
<text text-anchor="middle" x="282" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">math.h</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M178.23,-56.4C200.84,-46.51 230.84,-33.38 252.76,-23.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="254.45,-26.87 262.21,-19.66 251.65,-20.46 254.45,-26.87"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 4.2 KiB

10
d8/de0/radix__sort2_8cpp__incl.map
View File

@@ -1,7 +1,7 @@
<map id="sorting/radix_sort2.cpp" name="sorting/radix_sort2.cpp"> <map id="sorting/radix_sort2.cpp" name="sorting/radix_sort2.cpp">
<area shape="rect" id="node1" title="Algorithm of Radix sort" alt="" coords="99,5,253,32"/> <area shape="rect" id="node1" title="Algorithm of Radix sort" alt="" coords="107,5,261,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,77,107"/> <area shape="rect" id="node2" title=" " alt="" coords="5,80,80,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,80,160,107"/> <area shape="rect" id="node3" title=" " alt="" coords="105,80,170,107"/>
<area shape="rect" id="node4" title=" " alt="" coords="184,80,259,107"/> <area shape="rect" id="node4" title=" " alt="" coords="195,80,267,107"/>
<area shape="rect" id="node5" title=" " alt="" coords="283,80,349,107"/> <area shape="rect" id="node5" title=" " alt="" coords="291,80,349,107"/>
</map> </map>

2
d8/de0/radix__sort2_8cpp__incl.md5
View File

@@ -1 +1 @@
38335a6bd4a1654e7328a1833ddf523a a49955af9d461677eb93b5f1f210c7ea

40
d8/de0/radix__sort2_8cpp__incl.svg
View File

@@ -5,16 +5,16 @@
--> -->
<!-- Title: sorting/radix_sort2.cpp Pages: 1 --> <!-- Title: sorting/radix_sort2.cpp Pages: 1 -->
<svg width="266pt" height="84pt" <svg width="266pt" height="84pt"
viewBox="0.00 0.00 265.50 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 266.00 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)">
<title>sorting/radix_sort2.cpp</title> <title>sorting/radix_sort2.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 261.5,-80 261.5,4 -4,4"/> <polygon fill="white" stroke="transparent" points="-4,4 -4,-80 262,-80 262,4 -4,4"/>
<!-- Node1 --> <!-- Node1 -->
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Algorithm of Radix sort"> <g id="a_node1"><a xlink:title="Algorithm of Radix sort">
<polygon fill="#bfbfbf" stroke="black" points="70,-56.5 70,-75.5 186,-75.5 186,-56.5 70,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="76,-56.5 76,-75.5 192,-75.5 192,-56.5 76,-56.5"/>
<text text-anchor="middle" x="128" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">sorting/radix_sort2.cpp</text> <text text-anchor="middle" x="134" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">sorting/radix_sort2.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -22,61 +22,61 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 56,-19.5 56,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M111.77,-56.32C95.65,-47.7 70.7,-34.36 52.04,-24.39"/> <path fill="none" stroke="midnightblue" d="M116.97,-56.32C99.97,-47.66 73.62,-34.24 54.01,-24.25"/>
<polygon fill="midnightblue" stroke="midnightblue" points="53.66,-21.28 43.19,-19.65 50.36,-27.46 53.66,-21.28"/> <polygon fill="midnightblue" stroke="midnightblue" points="55.49,-21.08 44.99,-19.65 52.31,-27.31 55.49,-21.08"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 116,-19.5 116,-0.5 72,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="74.5,-0.5 74.5,-19.5 123.5,-19.5 123.5,-0.5 74.5,-0.5"/>
<text text-anchor="middle" x="94" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text> <text text-anchor="middle" x="99" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M122.39,-56.08C117.63,-48.53 110.68,-37.49 104.85,-28.23"/> <path fill="none" stroke="midnightblue" d="M128.22,-56.08C123.33,-48.53 116.17,-37.49 110.17,-28.23"/>
<polygon fill="midnightblue" stroke="midnightblue" points="107.8,-26.35 99.51,-19.75 101.88,-30.08 107.8,-26.35"/> <polygon fill="midnightblue" stroke="midnightblue" points="113.05,-26.24 104.67,-19.75 107.17,-30.05 113.05,-26.24"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:title=" "> <g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="134,-0.5 134,-19.5 190,-19.5 190,-0.5 134,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="142,-0.5 142,-19.5 196,-19.5 196,-0.5 142,-0.5"/>
<text text-anchor="middle" x="162" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text> <text text-anchor="middle" x="169" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M133.61,-56.08C138.37,-48.53 145.32,-37.49 151.15,-28.23"/> <path fill="none" stroke="midnightblue" d="M139.78,-56.08C144.67,-48.53 151.83,-37.49 157.83,-28.23"/>
<polygon fill="midnightblue" stroke="midnightblue" points="154.12,-30.08 156.49,-19.75 148.2,-26.35 154.12,-30.08"/> <polygon fill="midnightblue" stroke="midnightblue" points="160.83,-30.05 163.33,-19.75 154.95,-26.24 160.83,-30.05"/>
</g> </g>
<!-- Node5 --> <!-- Node5 -->
<g id="node5" class="node"> <g id="node5" class="node">
<title>Node5</title> <title>Node5</title>
<g id="a_node5"><a xlink:title=" "> <g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="208.5,-0.5 208.5,-19.5 257.5,-19.5 257.5,-0.5 208.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="214,-0.5 214,-19.5 258,-19.5 258,-0.5 214,-0.5"/>
<text text-anchor="middle" x="233" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text> <text text-anchor="middle" x="236" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node5 --> <!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge"> <g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title> <title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M144.87,-56.32C161.71,-47.66 187.81,-34.24 207.24,-24.25"/> <path fill="none" stroke="midnightblue" d="M150.39,-56.32C166.67,-47.7 191.87,-34.36 210.72,-24.39"/>
<polygon fill="midnightblue" stroke="midnightblue" points="208.88,-27.34 216.17,-19.65 205.68,-21.12 208.88,-27.34"/> <polygon fill="midnightblue" stroke="midnightblue" points="212.45,-27.43 219.65,-19.65 209.18,-21.24 212.45,-27.43"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.5 KiB

After

Width:  |  Height:  |  Size: 3.5 KiB

76
d8/df0/queue__using__array_8cpp.html
View File

@@ -102,8 +102,8 @@ $(document).ready(function(){initNavTree('d8/df0/queue__using__array_8cpp.html',
<p>Implementation of Linear <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using array</a>. <p>Implementation of Linear <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using array</a>.
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;array&gt;</code><br />
<code>#include &lt;array&gt;</code><br /> <code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for queue_using_array.cpp:</div> Include dependency graph for queue_using_array.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -135,7 +135,7 @@ Functions</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
Variables</h2></td></tr> Variables</h2></td></tr>
<tr class="memitem:a2d49e79bd164c298912db252970520d8"><td class="memItemLeft" align="right" valign="top">constexpr uint16_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a> {10}</td></tr> <tr class="memitem:a2d49e79bd164c298912db252970520d8"><td class="memItemLeft" align="right" valign="top">constexpr uint16_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a> {10}</td></tr>
<tr class="memdesc:a2d49e79bd164c298912db252970520d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html" title="STL class.">std::array</a> <a href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">More...</a><br /></td></tr> <tr class="memdesc:a2d49e79bd164c298912db252970520d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">for io operations <a href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">More...</a><br /></td></tr>
<tr class="separator:a2d49e79bd164c298912db252970520d8"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a2d49e79bd164c298912db252970520d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table> </table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -167,35 +167,35 @@ Algorithm</h3>
<p>Main function. </p> <p>Main function. </p>
<p>Allows the user to add and delete values from the queue. Also allows user to display values in the queue. </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <p>Allows the user to add and delete values from the queue. Also allows user to display values in the queue. </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; {</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordtype">int</span> op{0}, <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{0};</div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordtype">int</span> op{0}, <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{0};</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a> ob;</div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a> ob;</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; </div> <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; </div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1. enqueue(Insertion) &quot;</span>;</div> <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1. enqueue(Insertion) &quot;</span>;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n2. dequeue(Deletion)&quot;</span>;</div> <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n2. dequeue(Deletion)&quot;</span>;</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n3. Display&quot;</span>;</div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n3. Display&quot;</span>;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n4. Exit&quot;</span>;</div> <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n4. Exit&quot;</span>;</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter your choice &quot;</span>;</div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter your choice &quot;</span>;</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; op;</div> <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; op;</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keywordflow">if</span> (op == 1) {</div> <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <span class="keywordflow">if</span> (op == 1) {</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter data &quot;</span>;</div> <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter data &quot;</span>;</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div> <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(<a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div> <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(<a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 2) {</div> <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 2) {</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>();</div> <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>();</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\ndequeue element is:\t&quot;</span> &lt;&lt; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div> <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\ndequeue element is:\t&quot;</span> &lt;&lt; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 3) {</div> <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 3) {</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>();</div> <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>();</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 4) {</div> <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 4) {</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(0);</div> <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(0);</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; } <span class="keywordflow">else</span> {</div> <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nWrong choice &quot;</span>;</div> <div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nWrong choice &quot;</span>;</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; }</div> <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; }</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; }</div> <div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; }</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; </div> <div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; </div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160;}</div> <div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -226,20 +226,20 @@ Here is the call graph for this function:</div>
</table> </table>
</div><div class="memdoc"> </div><div class="memdoc">
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html" title="STL class.">std::array</a> </p> <p>for io operations </p>
<p>for io operations Maximum size of the queue </p> <p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html" title="STL class.">std::array</a> Maximum size of the queue </p>
</div> </div>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:40</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:43</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:24</div></div> <div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:24</div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &amp;)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:55</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &amp;)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:58</div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:72</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:75</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:90</div></div> <div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:93</div></div>
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div> <div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

2
d9/d03/namespacestring__search.html
View File

@@ -539,7 +539,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="anamespacestring__search_html_aebe07cea289a13142503d98be7df11fd"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a></div><div class="ttdeci">bool check_if_equal(const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</div><div class="ttdef"><b>Definition:</b> rabin_karp.cpp:60</div></div> <div class="ttc" id="anamespacestring__search_html_aebe07cea289a13142503d98be7df11fd"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aebe07cea289a13142503d98be7df11fd">string_search::check_if_equal</a></div><div class="ttdeci">bool check_if_equal(const std::string &amp;str1, const std::string &amp;str2, int start1, int end1, int start2, int end2)</div><div class="ttdef"><b>Definition:</b> rabin_karp.cpp:60</div></div>
<div class="ttc" id="asubstr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">std::string::substr</a></div><div class="ttdeci">T substr(T... args)</div></div> <div class="ttc" id="asubstr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/substr.html">std::string::substr</a></div><div class="ttdeci">T substr(T... args)</div></div>
<div class="ttc" id="anamespacestring__search_html_aa422aab133d4ed5e5d6022a7f701271f"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aa422aab133d4ed5e5d6022a7f701271f">string_search::getFailureArray</a></div><div class="ttdeci">std::vector&lt; int &gt; getFailureArray(const std::string &amp;pattern)</div><div class="ttdef"><b>Definition:</b> knuth_morris_pratt.cpp:33</div></div> <div class="ttc" id="anamespacestring__search_html_aa422aab133d4ed5e5d6022a7f701271f"><div class="ttname"><a href="../../d9/d03/namespacestring__search.html#aa422aab133d4ed5e5d6022a7f701271f">string_search::getFailureArray</a></div><div class="ttdeci">std::vector&lt; int &gt; getFailureArray(const std::string &amp;pattern)</div><div class="ttdef"><b>Definition:</b> knuth_morris_pratt.cpp:33</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

76
d9/d31/coin__change__topdown_8cpp.html
View File

@@ -100,10 +100,10 @@ $(document).ready(function(){initNavTree('d9/d31/coin__change__topdown_8cpp.html
<p><a href="https://leetcode.com/problems/coin-change/">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount. <p><a href="https://leetcode.com/problems/coin-change/">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount.
<a href="#details">More...</a></p> <a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br /> <div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;climits&gt;</code><br /> <code>#include &lt;climits&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader"> </div><div class="textblock"><div class="dynheader">
Include dependency graph for coin_change_topdown.cpp:</div> Include dependency graph for coin_change_topdown.cpp:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -159,10 +159,10 @@ Functions</h2></td></tr>
<p>Main function. </p> <p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; {</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <a class="code" href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div> <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <a class="code" href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160;}</div> <div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -224,23 +224,24 @@ template&lt;typename T &gt; </div>
</dd> </dd>
</dl> </dl>
<dl class="section return"><dt>Returns</dt><dd>minimum number of coins </dd></dl> <dl class="section return"><dt>Returns</dt><dd>minimum number of coins </dd></dl>
<div class="fragment"><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; {</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <span class="keywordflow">if</span>(n==0){</div> <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordflow">if</span> (n == 0) {</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; }</div> <div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; }</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; <span class="keywordflow">if</span>(dp[n]!=0){</div> <div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keywordflow">if</span> (dp[n] != 0) {</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">return</span> dp[n];</div> <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">return</span> dp[n];</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; }</div> <div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; }</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <span class="keywordtype">int</span> <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>=INT_MAX; <span class="comment">//variable to store min coins</span></div> <div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keywordtype">int</span> <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a> = INT_MAX; <span class="comment">// variable to store min coins</span></div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i=0;i&lt;t;i++){</div> <div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; t; i++) {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <span class="keywordflow">if</span>(n-coins[i]&gt;=0){ <span class="comment">//if after subtracting the current denomination is it greater than 0 or not</span></div> <div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <span class="keywordflow">if</span> (n - coins[i] &gt;= 0) { <span class="comment">// if after subtracting the current</span></div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <span class="keywordtype">int</span> sub=<a class="code" href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">mincoins</a>(n-coins[i],coins,t,dp);</div> <div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; <span class="comment">// denomination is it greater than 0 or not</span></div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>=<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>,sub+1);</div> <div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <span class="keywordtype">int</span> sub = <a class="code" href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">mincoins</a>(n - coins[i], coins, t, dp);</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; }</div> <div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a> = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a>(<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>, sub + 1);</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; }</div> <div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; }</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; dp[n]=<a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>;</div> <div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; }</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <span class="keywordflow">return</span> dp[n]; <span class="comment">//returns minimum number of coins</span></div> <div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; dp[n] = <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a>;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; }</div> <div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <span class="keywordflow">return</span> dp[n]; <span class="comment">// returns minimum number of coins</span></div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -275,17 +276,18 @@ Here is the call graph for this function:</div>
<p>Test implementations. </p> <p>Test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; {</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <span class="comment">// example 1: number of coins=3 and minimum coins required=3(7,7,1)</span></div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <span class="comment">// example 1: number of coins=3 and minimum coins required=3(7,7,1)</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <span class="keyword">const</span> int64_t n1 = 15;</div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="keyword">const</span> int64_t n1 = 15;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keyword">const</span> int8_t t1=3, a1=0;</div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <span class="keyword">const</span> int8_t t1 = 3, a1 = 0;</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 1...&quot;</span>;</div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nTest 1...&quot;</span>;</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr1 {1,7,10};</div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> arr1{1, 7, 10};</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> dp1 (n1+1);</div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> dp1(n1 + 1);</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; <a class="code" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(dp1.begin(),dp1.end(),a1);</div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <a class="code" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(dp1.begin(), dp1.end(), a1);</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; assert(dynamic_programming::mincoins_topdown::mincoins(n1, arr1, t1, dp1)==3);</div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; assert(dynamic_programming::mincoins_topdown::mincoins(n1, arr1, t1, dp1) ==</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; 3);</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160;}</div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -297,11 +299,11 @@ Here is the call graph for this function:</div>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="acoin__change__topdown_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:70</div></div> <div class="ttc" id="acoin__change__topdown_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:74</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div> <div class="ttc" id="amatrix__exponentiation_8cpp_html_ad8389ed58fd0ec66df248014775ad1fa"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a></div><div class="ttdeci">ll ans(ll n)</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:91</div></div>
<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition:</b> decimal_to_roman_numeral.cpp:15</div></div> <div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition:</b> decimal_to_roman_numeral.cpp:15</div></div>
<div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:45</div></div> <div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="../../d9/d31/coin__change__topdown_8cpp.html#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition:</b> coin_change_topdown.cpp:47</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div> <div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->

2
d9/d66/group__machine__learning.html
View File

@@ -449,7 +449,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="aptrdiff_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/ptrdiff_t.html">std::ptrdiff_t</a></div></div> <div class="ttc" id="aptrdiff_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/ptrdiff_t.html">std::ptrdiff_t</a></div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div> <div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/end.html">std::end</a></div><div class="ttdeci">T end(T... args)</div></div>
<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div> <div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

12
d9/d88/palindrome__partitioning_8cpp__incl.map
View File

@@ -1,8 +1,8 @@
<map id="dynamic_programming/palindrome_partitioning.cpp" name="dynamic_programming/palindrome_partitioning.cpp"> <map id="dynamic_programming/palindrome_partitioning.cpp" name="dynamic_programming/palindrome_partitioning.cpp">
<area shape="rect" id="node1" title="Implements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to..." alt="" coords="129,5,313,47"/> <area shape="rect" id="node1" title="Implements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to..." alt="" coords="132,5,316,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/> <area shape="rect" id="node2" title=" " alt="" coords="5,95,80,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,95,160,121"/> <area shape="rect" id="node3" title=" " alt="" coords="105,95,170,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="184,95,259,121"/> <area shape="rect" id="node4" title=" " alt="" coords="194,95,254,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="283,95,349,121"/> <area shape="rect" id="node5" title=" " alt="" coords="279,95,351,121"/>
<area shape="rect" id="node6" title=" " alt="" coords="373,95,433,121"/> <area shape="rect" id="node6" title=" " alt="" coords="375,95,433,121"/>
</map> </map>

2
d9/d88/palindrome__partitioning_8cpp__incl.md5
View File

@@ -1 +1 @@
3af984c89a8bcdaeff81896bc48fa028 3f8e9cc3d35fb5d5ab1cf150e0bf5cbf

50
d9/d88/palindrome__partitioning_8cpp__incl.svg
View File

@@ -5,17 +5,17 @@
--> -->
<!-- Title: dynamic_programming/palindrome_partitioning.cpp Pages: 1 --> <!-- Title: dynamic_programming/palindrome_partitioning.cpp Pages: 1 -->
<svg width="329pt" height="95pt" <svg width="329pt" height="95pt"
viewBox="0.00 0.00 328.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"> viewBox="0.00 0.00 329.00 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)"> <g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>dynamic_programming/palindrome_partitioning.cpp</title> <title>dynamic_programming/palindrome_partitioning.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 324.5,-91 324.5,4 -4,4"/> <polygon fill="white" stroke="transparent" points="-4,4 -4,-91 325,-91 325,4 -4,4"/>
<!-- Node1 --> <!-- Node1 -->
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Implements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to..."> <g id="a_node1"><a xlink:title="Implements Palindrome Partitioning algorithm, giving you the minimum number of partitions you need to...">
<polygon fill="#bfbfbf" stroke="black" points="93,-56.5 93,-86.5 231,-86.5 231,-56.5 93,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="95,-56.5 95,-86.5 233,-86.5 233,-56.5 95,-56.5"/>
<text text-anchor="start" x="101" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text> <text text-anchor="start" x="103" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="162" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">/palindrome_partitioning.cpp</text> <text text-anchor="middle" x="164" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">/palindrome_partitioning.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -23,76 +23,76 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 56,-19.5 56,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M130.01,-56.4C107.56,-46.51 77.79,-33.38 56.02,-23.79"/> <path fill="none" stroke="midnightblue" d="M131.77,-56.4C109.16,-46.51 79.16,-33.38 57.24,-23.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="57.21,-20.49 46.64,-19.66 54.38,-26.89 57.21,-20.49"/> <polygon fill="midnightblue" stroke="midnightblue" points="58.35,-20.46 47.79,-19.66 55.55,-26.87 58.35,-20.46"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 116,-19.5 116,-0.5 72,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="74.5,-0.5 74.5,-19.5 123.5,-19.5 123.5,-0.5 74.5,-0.5"/>
<text text-anchor="middle" x="94" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text> <text text-anchor="middle" x="99" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M145.88,-56.4C135.6,-47.4 122.25,-35.72 111.67,-26.47"/> <path fill="none" stroke="midnightblue" d="M148.6,-56.4C138.76,-47.4 126.01,-35.72 115.89,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="113.73,-23.61 103.89,-19.66 109.12,-28.88 113.73,-23.61"/> <polygon fill="midnightblue" stroke="midnightblue" points="118.2,-23.83 108.46,-19.66 113.47,-28.99 118.2,-23.83"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:title=" "> <g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="134,-0.5 134,-19.5 190,-19.5 190,-0.5 134,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="141.5,-0.5 141.5,-19.5 186.5,-19.5 186.5,-0.5 141.5,-0.5"/>
<text text-anchor="middle" x="162" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">algorithm</text> <text text-anchor="middle" x="164" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">climits</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M162,-56.4C162,-48.47 162,-38.46 162,-29.86"/> <path fill="none" stroke="midnightblue" d="M164,-56.4C164,-48.47 164,-38.46 164,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="165.5,-29.66 162,-19.66 158.5,-29.66 165.5,-29.66"/> <polygon fill="midnightblue" stroke="midnightblue" points="167.5,-29.66 164,-19.66 160.5,-29.66 167.5,-29.66"/>
</g> </g>
<!-- Node5 --> <!-- Node5 -->
<g id="node5" class="node"> <g id="node5" class="node">
<title>Node5</title> <title>Node5</title>
<g id="a_node5"><a xlink:title=" "> <g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="208.5,-0.5 208.5,-19.5 257.5,-19.5 257.5,-0.5 208.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="205,-0.5 205,-19.5 259,-19.5 259,-0.5 205,-0.5"/>
<text text-anchor="middle" x="233" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text> <text text-anchor="middle" x="232" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node5 --> <!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge"> <g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title> <title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M178.83,-56.4C189.67,-47.31 203.78,-35.49 214.87,-26.19"/> <path fill="none" stroke="midnightblue" d="M180.12,-56.4C190.4,-47.4 203.75,-35.72 214.33,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="217.25,-28.76 222.67,-19.66 212.76,-23.4 217.25,-28.76"/> <polygon fill="midnightblue" stroke="midnightblue" points="216.88,-28.88 222.11,-19.66 212.27,-23.61 216.88,-28.88"/>
</g> </g>
<!-- Node6 --> <!-- Node6 -->
<g id="node6" class="node"> <g id="node6" class="node">
<title>Node6</title> <title>Node6</title>
<g id="a_node6"><a xlink:title=" "> <g id="a_node6"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="275.5,-0.5 275.5,-19.5 320.5,-19.5 320.5,-0.5 275.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="277,-0.5 277,-19.5 321,-19.5 321,-0.5 277,-0.5"/>
<text text-anchor="middle" x="298" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">climits</text> <text text-anchor="middle" x="299" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node6 --> <!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge"> <g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title> <title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M194.23,-56.4C216.84,-46.51 246.84,-33.38 268.76,-23.79"/> <path fill="none" stroke="midnightblue" d="M195.99,-56.4C218.44,-46.51 248.21,-33.38 269.98,-23.79"/>
<polygon fill="midnightblue" stroke="midnightblue" points="270.45,-26.87 278.21,-19.66 267.65,-20.46 270.45,-26.87"/> <polygon fill="midnightblue" stroke="midnightblue" points="271.62,-26.89 279.36,-19.66 268.79,-20.49 271.62,-26.89"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.3 KiB

After

Width:  |  Height:  |  Size: 4.3 KiB

2
da/d23/eulers__totient__function_8cpp.html
View File

@@ -174,7 +174,7 @@ Some known values are:</p><ul>
</div> </div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

2
da/d5a/class_complex.html
View File

@@ -549,7 +549,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div> <div class="ttc" id="asin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/sin.html">std::sin</a></div><div class="ttdeci">T sin(T... args)</div></div>
<div class="ttc" id="aclass_complex_html_af8aacf982e2e6c142921bc850f6dc974"><div class="ttname"><a href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">Complex::imag</a></div><div class="ttdeci">double imag() const</div><div class="ttdoc">Member function to get imaginary value of our complex number. Member function (getter) to access the ...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:70</div></div> <div class="ttc" id="aclass_complex_html_af8aacf982e2e6c142921bc850f6dc974"><div class="ttname"><a href="../../da/d5a/class_complex.html#af8aacf982e2e6c142921bc850f6dc974">Complex::imag</a></div><div class="ttdeci">double imag() const</div><div class="ttdoc">Member function to get imaginary value of our complex number. Member function (getter) to access the ...</div><div class="ttdef"><b>Definition:</b> complex_numbers.cpp:70</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

2
da/df2/durand__kerner__roots_8cpp.html
View File

@@ -573,7 +573,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div> <div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
<div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div> <div class="ttc" id="ais_open_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ofstream/is_open.html">std::ofstream::is_open</a></div><div class="ttdeci">T is_open(T... args)</div></div>
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div> <div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(T... args)</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div> <div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

77
db/d16/0__1__knapsack_8cpp.html
View File

@@ -161,11 +161,11 @@ Algorithm</h3>
<p>Main function. </p> <p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl> <dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; {</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <span class="comment">// Testing</span></div> <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; <span class="comment">// Testing</span></div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; <a class="code" href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div> <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; <a class="code" href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>();</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; <span class="keywordflow">return</span> 0;</div> <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160;}</div> <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -251,16 +251,17 @@ template&lt;size_t n&gt; </div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <span class="keywordtype">int</span> profit2 = maxValue[i - 1][j];</div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <span class="keywordtype">int</span> profit2 = maxValue[i - 1][j];</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; </div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; </div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; maxValue[i][j] = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(profit1, profit2);</div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; maxValue[i][j] = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(profit1, profit2);</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; } <span class="keywordflow">else</span></div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="comment">// as weight of current item is greater than allowed weight, so</span></div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="comment">// as weight of current item is greater than allowed weight, so</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="comment">// maxProfit will be profit obtained by excluding current item.</span></div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; <span class="comment">// maxProfit will be profit obtained by excluding current item.</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; maxValue[i][j] = maxValue[i - 1][j];</div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; maxValue[i][j] = maxValue[i - 1][j];</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; }</div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; }</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; }</div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; }</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; </div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; }</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="comment">// returning maximum value</span></div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; </div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="keywordflow">return</span> maxValue[items][capacity];</div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="comment">// returning maximum value</span></div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160;}</div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <span class="keywordflow">return</span> maxValue[items][capacity];</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -295,31 +296,31 @@ Here is the call graph for this function:</div>
<p>Function to test above algorithm. </p> <p>Function to test above algorithm. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl> <dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; {</div> <div class="fragment"><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; {</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; <span class="comment">// Test 1</span></div> <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="comment">// Test 1</span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> n1 = 3; <span class="comment">// number of items</span></div> <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> n1 = 3; <span class="comment">// number of items</span></div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n1&gt;</a> weight1 = {10, 20, 30}; <span class="comment">// weight of each item</span></div> <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n1&gt;</a> weight1 = {10, 20, 30}; <span class="comment">// weight of each item</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n1&gt;</a> value1 = {60, 100, 120}; <span class="comment">// value of each item</span></div> <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n1&gt;</a> value1 = {60, 100, 120}; <span class="comment">// value of each item</span></div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> capacity1 = 50; <span class="comment">// capacity of carrying bag</span></div> <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> capacity1 = 50; <span class="comment">// capacity of carrying bag</span></div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> max_value1 = <a class="code" href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a>(</div> <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> max_value1 = <a class="code" href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a>(</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; capacity1, weight1, value1);</div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; capacity1, weight1, value1);</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> expected_max_value1 = 220;</div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> expected_max_value1 = 220;</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; assert(max_value1 == expected_max_value1);</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; assert(max_value1 == expected_max_value1);</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n1 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n1 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; &lt;&lt; max_value1 &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; &lt;&lt; max_value1 &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160; </div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; </div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="comment">// Test 2</span></div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="comment">// Test 2</span></div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> n2 = 4; <span class="comment">// number of items</span></div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> n2 = 4; <span class="comment">// number of items</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n2&gt;</a> weight2 = {24, 10, 10, 7}; <span class="comment">// weight of each item</span></div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n2&gt;</a> weight2 = {24, 10, 10, 7}; <span class="comment">// weight of each item</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n2&gt;</a> value2 = {24, 18, 18, 10}; <span class="comment">// value of each item</span></div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt;int, n2&gt;</a> value2 = {24, 18, 18, 10}; <span class="comment">// value of each item</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> capacity2 = 25; <span class="comment">// capacity of carrying bag</span></div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> capacity2 = 25; <span class="comment">// capacity of carrying bag</span></div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> max_value2 = <a class="code" href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a>(</div> <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> max_value2 = <a class="code" href="../../db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1">dynamic_programming::knapsack::maxKnapsackValue</a>(</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; capacity2, weight2, value2);</div> <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; capacity2, weight2, value2);</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> expected_max_value2 = 36;</div> <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> expected_max_value2 = 36;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; assert(max_value2 == expected_max_value2);</div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; assert(max_value2 == expected_max_value2);</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n2 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div> <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Maximum Knapsack value with &quot;</span> &lt;&lt; n2 &lt;&lt; <span class="stringliteral">&quot; items is &quot;</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; &lt;&lt; max_value2 &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div> <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; &lt;&lt; max_value2 &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160;}</div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
@@ -332,7 +333,7 @@ Here is the call graph for this function:</div>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="a0__1__knapsack_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> 0_1_knapsack.cpp:95</div></div> <div class="ttc" id="a0__1__knapsack_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Function to test above algorithm.</div><div class="ttdef"><b>Definition:</b> 0_1_knapsack.cpp:96</div></div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div> <div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>

6
db/d1e/classgraph_1_1_graph-members.html
View File

@@ -98,9 +98,9 @@ $(document).ready(function(){initNavTree('dc/d61/classgraph_1_1_graph.html','../
<p>This is the complete list of members for <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a>, including all inherited members.</p> <p>This is the complete list of members for <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a>, including all inherited members.</p>
<table class="directory"> <table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(T u, T v, bool bidir=true)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a>(T u, T v, bool bidir=true)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">adjacency_list</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr> <tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a6e3efabd5e401ef0f47c179866e7454e">breadth_first_search</a>(T src)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ab1a1a96cd4cddf0d4feb02855c4c16af">breadth_first_search</a>(T src)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>Graph</b>() (defined in <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a>)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr bgcolor="#f0f0f0"><td class="entry"><b>Graph</b>()=default (defined in <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a>)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a>(size_t N, const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a>(size_t N, const std::vector&lt; std::pair&lt; int, int &gt; &gt; &amp;undirected_edges)</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"></td></tr> <tr><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a">neighbors</a></td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>() const</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr> <tr class="even"><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904">number_of_vertices</a>() const</td><td class="entry"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>

5
db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="math::ncr_modulo_p::NCRModuloP" name="math::ncr_modulo_p::NCRModuloP">
<area shape="rect" id="node1" title="Class which contains all methods required for calculating nCr mod p." alt="" coords="13,184,153,225"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,95,160,121"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="35,5,130,32"/>
</map>

1
db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
e054920c214599e55bac3d877308bbd2

55
db/d66/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p__coll__graph.svg Normal file
View File

@@ -0,0 +1,55 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: math::ncr_modulo_p::NCRModuloP Pages: 1 -->
<svg width="124pt" height="173pt"
viewBox="0.00 0.00 124.00 173.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 169)">
<title>math::ncr_modulo_p::NCRModuloP</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-169 120,-169 120,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Class which contains all methods required for calculating nCr mod p.">
<polygon fill="#bfbfbf" stroke="black" points="5.5,-0.5 5.5,-30.5 110.5,-30.5 110.5,-0.5 5.5,-0.5"/>
<text text-anchor="start" x="13.5" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::ncr_modulo_p</text>
<text text-anchor="middle" x="58" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::NCRModuloP</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-78.5 0,-97.5 116,-97.5 116,-78.5 0,-78.5"/>
<text text-anchor="middle" x="58" y="-85.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector&lt; uint64_t &gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node2&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58,-68.24C58,-56.41 58,-41.38 58,-30.58"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="54.5,-68.36 58,-78.36 61.5,-68.36 54.5,-68.36"/>
<text text-anchor="middle" x="66.5" y="-52" font-family="Helvetica,sans-Serif" font-size="10.00"> fac</text>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="22.5,-145.5 22.5,-164.5 93.5,-164.5 93.5,-145.5 22.5,-145.5"/>
<text text-anchor="middle" x="58" y="-152.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M58,-135.04C58,-122.67 58,-107.12 58,-97.63"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="54.5,-135.23 58,-145.23 61.5,-135.23 54.5,-135.23"/>
<text text-anchor="middle" x="79.5" y="-119" font-family="Helvetica,sans-Serif" font-size="10.00"> elements</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.8 KiB

2
db/d93/check__prime_8cpp.html
View File

@@ -215,7 +215,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div> <div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

10
dc/d29/coin__change__topdown_8cpp__incl.map
View File

@@ -1,7 +1,7 @@
<map id="dynamic_programming/coin_change_topdown.cpp" name="dynamic_programming/coin_change_topdown.cpp"> <map id="dynamic_programming/coin_change_topdown.cpp" name="dynamic_programming/coin_change_topdown.cpp">
<area shape="rect" id="node1" title="Minimum coins change problem is a problem used to find the minimum number of coins required to comple..." alt="" coords="83,5,263,47"/> <area shape="rect" id="node1" title="Minimum coins change problem is a problem used to find the minimum number of coins required to comple..." alt="" coords="80,5,260,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/> <area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,95,160,121"/> <area shape="rect" id="node3" title=" " alt="" coords="95,95,155,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="185,95,250,121"/> <area shape="rect" id="node4" title=" " alt="" coords="179,95,251,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="274,95,334,121"/> <area shape="rect" id="node5" title=" " alt="" coords="275,95,334,121"/>
</map> </map>

2
dc/d29/coin__change__topdown_8cpp__incl.md5
View File

@@ -1 +1 @@
bfb82388f373aae8405462e8423467eb f997c846942bf3c30d149388ebdb5556

38
dc/d29/coin__change__topdown_8cpp__incl.svg
View File

@@ -13,9 +13,9 @@
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Minimum coins change problem is a problem used to find the minimum number of coins required to comple..."> <g id="a_node1"><a xlink:title="Minimum coins change problem is a problem used to find the minimum number of coins required to comple...">
<polygon fill="#bfbfbf" stroke="black" points="58.5,-56.5 58.5,-86.5 193.5,-86.5 193.5,-56.5 58.5,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="56,-56.5 56,-86.5 191,-86.5 191,-56.5 56,-56.5"/>
<text text-anchor="start" x="66.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text> <text text-anchor="start" x="64" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="126" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">/coin_change_topdown.cpp</text> <text text-anchor="middle" x="123.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">/coin_change_topdown.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -23,61 +23,61 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M102.54,-56.4C86.67,-46.86 65.81,-34.32 50.03,-24.84"/> <path fill="none" stroke="midnightblue" d="M100.04,-56.4C84.17,-46.86 63.31,-34.32 47.53,-24.84"/>
<polygon fill="midnightblue" stroke="midnightblue" points="51.78,-21.81 41.41,-19.66 48.17,-27.81 51.78,-21.81"/> <polygon fill="midnightblue" stroke="midnightblue" points="49.28,-21.81 38.91,-19.66 45.67,-27.81 49.28,-21.81"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 116,-19.5 116,-0.5 72,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="67,-0.5 67,-19.5 112,-19.5 112,-0.5 67,-0.5"/>
<text text-anchor="middle" x="94" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text> <text text-anchor="middle" x="89.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">climits</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M118.42,-56.4C113.96,-48.11 108.28,-37.55 103.52,-28.71"/> <path fill="none" stroke="midnightblue" d="M115.44,-56.4C110.65,-48.02 104.54,-37.33 99.46,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="106.48,-26.81 98.66,-19.66 100.31,-30.12 106.48,-26.81"/> <polygon fill="midnightblue" stroke="midnightblue" points="102.45,-26.6 94.45,-19.66 96.37,-30.08 102.45,-26.6"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:title=" "> <g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="134.5,-0.5 134.5,-19.5 183.5,-19.5 183.5,-0.5 134.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="130.5,-0.5 130.5,-19.5 184.5,-19.5 184.5,-0.5 130.5,-0.5"/>
<text text-anchor="middle" x="159" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text> <text text-anchor="middle" x="157.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M133.82,-56.4C138.47,-48.02 144.4,-37.33 149.34,-28.42"/> <path fill="none" stroke="midnightblue" d="M131.56,-56.4C136.35,-48.02 142.46,-37.33 147.54,-28.42"/>
<polygon fill="midnightblue" stroke="midnightblue" points="152.41,-30.1 154.2,-19.66 146.29,-26.71 152.41,-30.1"/> <polygon fill="midnightblue" stroke="midnightblue" points="150.63,-30.08 152.55,-19.66 144.55,-26.6 150.63,-30.08"/>
</g> </g>
<!-- Node5 --> <!-- Node5 -->
<g id="node5" class="node"> <g id="node5" class="node">
<title>Node5</title> <title>Node5</title>
<g id="a_node5"><a xlink:title=" "> <g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="201.5,-0.5 201.5,-19.5 246.5,-19.5 246.5,-0.5 201.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="202.5,-0.5 202.5,-19.5 246.5,-19.5 246.5,-0.5 202.5,-0.5"/>
<text text-anchor="middle" x="224" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">climits</text> <text text-anchor="middle" x="224.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node5 --> <!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge"> <g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title> <title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M149.22,-56.4C164.79,-46.95 185.2,-34.56 200.76,-25.11"/> <path fill="none" stroke="midnightblue" d="M147.44,-56.4C163.63,-46.86 184.91,-34.32 201,-24.84"/>
<polygon fill="midnightblue" stroke="midnightblue" points="203.01,-27.84 209.74,-19.66 199.38,-21.86 203.01,-27.84"/> <polygon fill="midnightblue" stroke="midnightblue" points="202.96,-27.75 209.8,-19.66 199.41,-21.72 202.96,-27.75"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.7 KiB

After

Width:  |  Height:  |  Size: 3.7 KiB

2
dc/d38/ordinary__least__squares__regressor_8cpp.html
View File

@@ -1063,7 +1063,7 @@ template&lt;typename T &gt; </div>
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4261f3c3c3dfdb86f3004eb8aaffea8d"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a></div><div class="ttdeci">void ols_test()</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:369</div></div> <div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a4261f3c3c3dfdb86f3004eb8aaffea8d"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a4261f3c3c3dfdb86f3004eb8aaffea8d">ols_test</a></div><div class="ttdeci">void ols_test()</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:369</div></div>
<div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div> <div class="ttc" id="asetw_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/setw.html">std::setw</a></div><div class="ttdeci">T setw(T... args)</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div> <div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:75</div></div> <div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a889f9de199fa793497c864d8e493af05"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05">get_transpose</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; T &gt; &gt; get_transpose(std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:300</div></div> <div class="ttc" id="aordinary__least__squares__regressor_8cpp_html_a889f9de199fa793497c864d8e493af05"><div class="ttname"><a href="../../dc/d38/ordinary__least__squares__regressor_8cpp.html#a889f9de199fa793497c864d8e493af05">get_transpose</a></div><div class="ttdeci">std::vector&lt; std::vector&lt; T &gt; &gt; get_transpose(std::vector&lt; std::vector&lt; T &gt;&gt; const &amp;A)</div><div class="ttdef"><b>Definition:</b> ordinary_least_squares_regressor.cpp:300</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->

130
dc/d61/classgraph_1_1_graph.html
View File

@@ -116,8 +116,8 @@ Collaboration diagram for graph::Graph&lt; T &gt;:</div>
Public Member Functions</h2></td></tr> Public Member Functions</h2></td></tr>
<tr class="memitem:a877b2cba40d8d46dde6fb4209effed19"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a> (T u, T v, bool bidir=true)</td></tr> <tr class="memitem:a877b2cba40d8d46dde6fb4209effed19"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">add_edge</a> (T u, T v, bool bidir=true)</td></tr>
<tr class="separator:a877b2cba40d8d46dde6fb4209effed19"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a877b2cba40d8d46dde6fb4209effed19"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6e3efabd5e401ef0f47c179866e7454e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a6e3efabd5e401ef0f47c179866e7454e">breadth_first_search</a> (T src)</td></tr> <tr class="memitem:ab1a1a96cd4cddf0d4feb02855c4c16af"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, bool &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#ab1a1a96cd4cddf0d4feb02855c4c16af">breadth_first_search</a> (T src)</td></tr>
<tr class="separator:a6e3efabd5e401ef0f47c179866e7454e"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:ab1a1a96cd4cddf0d4feb02855c4c16af"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8839fa14bff19d2deab4a618447c13e5"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a> (size_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges)</td></tr> <tr class="memitem:a8839fa14bff19d2deab4a618447c13e5"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">Graph</a> (size_t N, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a>&lt; int, int &gt; &gt; &amp;undirected_edges)</td></tr>
<tr class="memdesc:a8839fa14bff19d2deab4a618447c13e5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices. <a href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">More...</a><br /></td></tr> <tr class="memdesc:a8839fa14bff19d2deab4a618447c13e5"><td class="mdescLeft">&#160;</td><td class="mdescRight">Populate the adjacency list for each vertex in the graph. Assumes that evey edge is a pair of valid vertex indices. <a href="../../dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">More...</a><br /></td></tr>
<tr class="separator:a8839fa14bff19d2deab4a618447c13e5"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:a8839fa14bff19d2deab4a618447c13e5"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -133,8 +133,8 @@ Public Attributes</h2></td></tr>
</table><table class="memberdecls"> </table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a> <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr> Private Attributes</h2></td></tr>
<tr class="memitem:a3ab95bb3ba618a7e883ead8ee696c25c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">adjacency_list</a></td></tr> <tr class="memitem:acebf0505d625b043bb9c8c27c7a8def0"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt; T, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; T &gt; &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a></td></tr>
<tr class="separator:a3ab95bb3ba618a7e883ead8ee696c25c"><td class="memSeparator" colspan="2">&#160;</td></tr> <tr class="separator:acebf0505d625b043bb9c8c27c7a8def0"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table> </table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2> <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template&lt;typename T&gt;<br /> <div class="textblock"><h3>template&lt;typename T&gt;<br />
@@ -246,26 +246,27 @@ template&lt;typename T &gt; </div>
</div><div class="memdoc"> </div><div class="memdoc">
<p>add_edge(u,v,bidir) is used to add an edge between node u and node v by default , bidir is made true , i.e graph is bidirectional . It means if edge(u,v) is added then u--&gt;v and v--&gt;u both edges exist.</p> <p>add_edge(u,v,bidir) is used to add an edge between node u and node v by default , bidir is made true , i.e graph is bidirectional . It means if edge(u,v) is added then u--&gt;v and v--&gt;u both edges exist.</p>
<p>to make the graph unidirectional pass the third parameter of add_edge as false which will</p> <p>to make the graph unidirectional pass the third parameter of add_edge as false which will</p>
<div class="fragment"><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; {<span class="comment"></span></div> <div class="fragment"><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; {<span class="comment"></span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160;<span class="comment"> /**</span></div> <div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160;<span class="comment"> /**</span></div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;<span class="comment"> * add_edge(u,v,bidir) is used to add an edge between node u and node v</span></div> <div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;<span class="comment"> * add_edge(u,v,bidir) is used to add an edge between node u and</span></div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160;<span class="comment"> * by default , bidir is made true , i.e graph is bidirectional .</span></div> <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160;<span class="comment"> * node v by default , bidir is made true , i.e graph is</span></div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160;<span class="comment"> * It means if edge(u,v) is added then u--&gt;v and v--&gt;u both edges exist.</span></div> <div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160;<span class="comment"> * bidirectional . It means if edge(u,v) is added then u--&gt;v and</span></div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160;<span class="comment"> *</span></div> <div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;<span class="comment"> * v--&gt;u both edges exist.</span></div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160;<span class="comment"> * to make the graph unidirectional pass the third parameter of add_edge as</span></div> <div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160;<span class="comment"> *</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;<span class="comment"> * false which will</span></div> <div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160;<span class="comment"> * to make the graph unidirectional pass the third parameter of</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160;<span class="comment"> */</span></div> <div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160;<span class="comment"> * add_edge as false which will</span></div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">adjacency_list</a>[u].push_back(v); <span class="comment">// u--&gt;v edge added</span></div> <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160;<span class="comment"> */</span></div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keywordflow">if</span>(bidir==<span class="keyword">true</span>){</div> <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[u].push_back(v); <span class="comment">// u--&gt;v edge added</span></div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="comment">// if graph is bidirectional</span></div> <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keywordflow">if</span> (bidir == <span class="keyword">true</span>) {</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">adjacency_list</a>[v].push_back(u); <span class="comment">// v--&gt;u edge added</span></div> <div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; <span class="comment">// if graph is bidirectional</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; }</div> <div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[v].push_back(u); <span class="comment">// v--&gt;u edge added</span></div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; }</div> <div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; }</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; }</div>
</div><!-- fragment --> </div><!-- fragment -->
</div> </div>
</div> </div>
<a id="a6e3efabd5e401ef0f47c179866e7454e"></a> <a id="ab1a1a96cd4cddf0d4feb02855c4c16af"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6e3efabd5e401ef0f47c179866e7454e">&#9670;&nbsp;</a></span>breadth_first_search()</h2> <h2 class="memtitle"><span class="permalink"><a href="#ab1a1a96cd4cddf0d4feb02855c4c16af">&#9670;&nbsp;</a></span>breadth_first_search()</h2>
<div class="memitem"> <div class="memitem">
<div class="memproto"> <div class="memproto">
@@ -276,7 +277,7 @@ template&lt;typename T &gt; </div>
<td class="mlabels-left"> <td class="mlabels-left">
<table class="memname"> <table class="memname">
<tr> <tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt;T,bool&gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::breadth_first_search </td> <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt;T, bool&gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::breadth_first_search </td>
<td>(</td> <td>(</td>
<td class="paramtype">T&#160;</td> <td class="paramtype">T&#160;</td>
<td class="paramname"><em>src</em></td><td>)</td> <td class="paramname"><em>src</em></td><td>)</td>
@@ -300,47 +301,48 @@ template&lt;typename T &gt; </div>
<p>check every vertex connected to the node which are still unvisited</p> <p>check every vertex connected to the node which are still unvisited</p>
<p>if the neighbour is unvisited , push it into the queue</p> <p>if the neighbour is unvisited , push it into the queue</p>
<p>mark the neighbour as visited</p> <p>mark the neighbour as visited</p>
<div class="fragment"><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; {<span class="comment"></span></div> <div class="fragment"><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160; {<span class="comment"></span></div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160;<span class="comment"> /// mapping to keep track of all visited nodes </span></div> <div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160;<span class="comment"> /// mapping to keep track of all visited nodes</span></div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;T,bool&gt;</a> visited;<span class="comment"></span></div> <div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map&lt;T, bool&gt;</a> visited;<span class="comment"></span></div>
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>&#160;<span class="comment"> /// initialise every possible vertex to map to false</span></div> <div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160;<span class="comment"> /// initialise every possible vertex to map to false</span></div>
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>&#160;<span class="comment"> /// initially none of the vertices are unvisited</span></div> <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160;<span class="comment"> /// initially none of the vertices are unvisited</span></div>
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span>(<span class="keyword">auto</span> <span class="keyword">const</span> &amp;adjlist: <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">adjacency_list</a>){</div> <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160;<span class="comment"></span> <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;adjlist : <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>) {</div>
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; visited[adjlist.first]=<span class="keyword">false</span>;</div> <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; visited[adjlist.first] = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <span class="keywordflow">for</span>(<span class="keyword">auto</span> <span class="keyword">const</span> &amp;<a class="code" href="../../d5/da1/structnode.html">node</a>:<a class="code" href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">adjacency_list</a>[adjlist.first]){</div> <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; <span class="keywordflow">for</span> (<span class="keyword">auto</span> <span class="keyword">const</span> &amp;<a class="code" href="../../d5/da1/structnode.html">node</a> : <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[adjlist.first]) {</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; visited[<a class="code" href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>]=<span class="keyword">false</span>;</div> <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; visited[<a class="code" href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>] = <span class="keyword">false</span>;</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; }</div> <div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; }</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; }</div> <div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160; }</div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; <span class="comment"></span></div> <div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160;<span class="comment"> /// queue to store the nodes which are yet to be traversed</span></div> <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160;<span class="comment"> /// queue to store the nodes which are yet to be traversed</span></div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;T&gt;</a> tracker;</div> <div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160;<span class="comment"></span> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;T&gt;</a> tracker;</div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160; <span class="comment"></span></div> <div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160;<span class="comment"> /// push the source vertex to queue to begin traversing </span></div> <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160;<span class="comment"> /// push the source vertex to queue to begin traversing</span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160;<span class="comment"></span> tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(src);<span class="comment"></span></div> <div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160;<span class="comment"></span> tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(src);<span class="comment"></span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160;<span class="comment"> ///mark the source vertex as visited</span></div> <div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160;<span class="comment"> /// mark the source vertex as visited</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160;<span class="comment"></span> visited[src]=<span class="keyword">true</span>;</div> <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160;<span class="comment"></span> visited[src] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <span class="keywordflow">while</span>(!tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()){<span class="comment"></span></div> <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <span class="keywordflow">while</span> (!tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {<span class="comment"></span></div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160;<span class="comment"> /// traverse the graph till no connected vertex are left </span></div> <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160;<span class="comment"> /// traverse the graph till no connected vertex are left</span></div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160;<span class="comment"> /// extract a node from queue for further traversal</span></div> <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160;<span class="comment"> /// extract a node from queue for further traversal</span></div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160;<span class="comment"></span> T <a class="code" href="../../d5/da1/structnode.html">node</a> = tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();<span class="comment"></span></div> <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160;<span class="comment"></span> T <a class="code" href="../../d5/da1/structnode.html">node</a> = tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>();<span class="comment"></span></div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160;<span class="comment"> /// remove the node from the queue</span></div> <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160;<span class="comment"> /// remove the node from the queue</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160;<span class="comment"></span> tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div> <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160;<span class="comment"></span> tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>();</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <span class="keywordflow">for</span>(T <span class="keyword">const</span> &amp;neighbour : <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">adjacency_list</a>[<a class="code" href="../../d5/da1/structnode.html">node</a>]){<span class="comment"></span></div> <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <span class="keywordflow">for</span> (T <span class="keyword">const</span> &amp;neighbour : <a class="code" href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">adjacency_list</a>[<a class="code" href="../../d5/da1/structnode.html">node</a>]) {<span class="comment"></span></div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160;<span class="comment"> /// check every vertex connected to the node which are still unvisited</span></div> <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160;<span class="comment"> /// check every vertex connected to the node which are still</span></div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160;<span class="comment"></span> <span class="keywordflow">if</span>(!visited[neighbour]){<span class="comment"></span></div> <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160;<span class="comment"> /// unvisited</span></div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160;<span class="comment"> /// if the neighbour is unvisited , push it into the queue</span></div> <div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160;<span class="comment"></span> <span class="keywordflow">if</span> (!visited[neighbour]) {<span class="comment"></span></div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160;<span class="comment"></span> tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(neighbour);<span class="comment"></span></div> <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160;<span class="comment"> /// if the neighbour is unvisited , push it into the queue</span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160;<span class="comment"> /// mark the neighbour as visited</span></div> <div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160;<span class="comment"></span> tracker.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(neighbour);<span class="comment"></span></div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160;<span class="comment"></span> visited[neighbour]=<span class="keyword">true</span>;</div> <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160;<span class="comment"> /// mark the neighbour as visited</span></div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; }</div> <div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160;<span class="comment"></span> visited[neighbour] = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; }</div> <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; }</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; }</div> <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; }</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; <span class="keywordflow">return</span> visited;</div> <div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; }</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; }</div> <div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <span class="keywordflow">return</span> visited;</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; }</div>
</div><!-- fragment --><div class="dynheader"> </div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div> Here is the call graph for this function:</div>
<div class="dyncontent"> <div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d61/classgraph_1_1_graph_a6e3efabd5e401ef0f47c179866e7454e_cgraph.svg" width="334" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe> <div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d61/classgraph_1_1_graph_ab1a1a96cd4cddf0d4feb02855c4c16af_cgraph.svg" width="334" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div> </div>
</div> </div>
@@ -382,8 +384,8 @@ Here is the call graph for this function:</div>
</div> </div>
</div> </div>
<h2 class="groupheader">Member Data Documentation</h2> <h2 class="groupheader">Member Data Documentation</h2>
<a id="a3ab95bb3ba618a7e883ead8ee696c25c"></a> <a id="acebf0505d625b043bb9c8c27c7a8def0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3ab95bb3ba618a7e883ead8ee696c25c">&#9670;&nbsp;</a></span>adjacency_list</h2> <h2 class="memtitle"><span class="permalink"><a href="#acebf0505d625b043bb9c8c27c7a8def0">&#9670;&nbsp;</a></span>adjacency_list</h2>
<div class="memitem"> <div class="memitem">
<div class="memproto"> <div class="memproto">
@@ -394,7 +396,7 @@ template&lt;typename T &gt; </div>
<td class="mlabels-left"> <td class="mlabels-left">
<table class="memname"> <table class="memname">
<tr> <tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt;T,<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt;T&gt; &gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::adjacency_list</td> <td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a>&lt;T, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt;T&gt; &gt; <a class="el" href="../../dc/d61/classgraph_1_1_graph.html">graph::Graph</a>&lt; T &gt;::adjacency_list</td>
</tr> </tr>
</table> </table>
</td> </td>
@@ -413,7 +415,6 @@ template&lt;typename T &gt; </div>
</ul> </ul>
</div><!-- contents --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="aclassgraph_1_1_graph_html_a3ab95bb3ba618a7e883ead8ee696c25c"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">graph::Graph::adjacency_list</a></div><div class="ttdeci">std::map&lt; T, std::list&lt; T &gt; &gt; adjacency_list</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:69</div></div>
<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div> <div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div> <div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div> <div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div>
@@ -426,6 +427,7 @@ template&lt;typename T &gt; </div>
<div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div><div class="ttdoc">STL class.</div></div> <div class="ttc" id="amap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/map.html">std::map</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div> <div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div> <div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
<div class="ttc" id="aclassgraph_1_1_graph_html_acebf0505d625b043bb9c8c27c7a8def0"><div class="ttname"><a href="../../dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0">graph::Graph::adjacency_list</a></div><div class="ttdeci">std::map&lt; T, std::list&lt; T &gt; &gt; adjacency_list</div><div class="ttdef"><b>Definition:</b> breadth_first_search.cpp:69</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

6
dc/d61/classgraph_1_1_graph.js
View File

@@ -1,10 +1,10 @@
var classgraph_1_1_graph = var classgraph_1_1_graph =
[ [
[ "Graph", "dc/d61/classgraph_1_1_graph.html#a1b3d8b89e184169360b5485e8dbe347e", null ], [ "Graph", "dc/d61/classgraph_1_1_graph.html#a190c0eb4739b6a8dfc1c3f684e66d937", null ],
[ "Graph", "dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5", null ], [ "Graph", "dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5", null ],
[ "add_edge", "dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19", null ], [ "add_edge", "dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19", null ],
[ "breadth_first_search", "dc/d61/classgraph_1_1_graph.html#a6e3efabd5e401ef0f47c179866e7454e", null ], [ "breadth_first_search", "dc/d61/classgraph_1_1_graph.html#ab1a1a96cd4cddf0d4feb02855c4c16af", null ],
[ "number_of_vertices", "dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904", null ], [ "number_of_vertices", "dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904", null ],
[ "adjacency_list", "dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c", null ], [ "adjacency_list", "dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0", null ],
[ "neighbors", "dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a", null ] [ "neighbors", "dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a", null ]
]; ];

0
dc/d61/classgraph_1_1_graph_a6e3efabd5e401ef0f47c179866e7454e_cgraph.map → dc/d61/classgraph_1_1_graph_ab1a1a96cd4cddf0d4feb02855c4c16af_cgraph.map
View File

0
dc/d61/classgraph_1_1_graph_a6e3efabd5e401ef0f47c179866e7454e_cgraph.md5 → dc/d61/classgraph_1_1_graph_ab1a1a96cd4cddf0d4feb02855c4c16af_cgraph.md5
View File

0
dc/d61/classgraph_1_1_graph_a6e3efabd5e401ef0f47c179866e7454e_cgraph.svg → dc/d61/classgraph_1_1_graph_ab1a1a96cd4cddf0d4feb02855c4c16af_cgraph.svg
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.1 KiB

After

Width:  |  Height:  |  Size: 4.1 KiB

178
dc/dc4/_2_users_2runner_2work_2_c-_plus-_plus_2_c-_plus-_plus_2numerical_methods_2rungekutta_8cpp-example.html
View File

@@ -98,38 +98,36 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu
<div class="fragment"><div class="line"><span class="comment">/**</span></div> <div class="fragment"><div class="line"><span class="comment">/**</span></div>
<div class="line"><span class="comment"> * @{</span></div> <div class="line"><span class="comment"> * @{</span></div>
<div class="line"><span class="comment"> * \file</span></div> <div class="line"><span class="comment"> * \file</span></div>
<div class="line"><span class="comment"> * \brief [Runge Kutta fourth order](https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods) method implementation</span></div> <div class="line"><span class="comment"> * \brief [Runge Kutta fourth</span></div>
<div class="line"><span class="comment"> * order](https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods) method</span></div>
<div class="line"><span class="comment"> * implementation</span></div>
<div class="line"><span class="comment"> *</span></div> <div class="line"><span class="comment"> *</span></div>
<div class="line"><span class="comment"> * \author [Rudra Prasad Das](http://github.com/rudra697)</span></div> <div class="line"><span class="comment"> * \author [Rudra Prasad Das](http://github.com/rudra697)</span></div>
<div class="line"><span class="comment"> *</span></div> <div class="line"><span class="comment"> *</span></div>
<div class="line"><span class="comment"> * \details</span></div> <div class="line"><span class="comment"> * \details</span></div>
<div class="line"><span class="comment"> * It solves the unknown value of y </span></div> <div class="line"><span class="comment"> * It solves the unknown value of y</span></div>
<div class="line"><span class="comment"> * for a given value of x</span></div> <div class="line"><span class="comment"> * for a given value of x</span></div>
<div class="line"><span class="comment"> * only first order differential equations</span></div> <div class="line"><span class="comment"> * only first order differential equations</span></div>
<div class="line"><span class="comment"> * can be solved</span></div> <div class="line"><span class="comment"> * can be solved</span></div>
<div class="line"><span class="comment"> * \example</span></div> <div class="line"><span class="comment"> * \example</span></div>
<div class="line"><span class="comment"> * it solves \frac{\mathrm{d} y}{\mathrm{d} x}= \frac{\left ( x-y \right )}{2}</span></div> <div class="line"><span class="comment"> * it solves \frac{\mathrm{d} y}{\mathrm{d} x}= \frac{\left ( x-y \right )}{2}</span></div>
<div class="line"><span class="comment"> * given x for given initial </span></div> <div class="line"><span class="comment"> * given x for given initial</span></div>
<div class="line"><span class="comment"> * conditions</span></div> <div class="line"><span class="comment"> * conditions</span></div>
<div class="line"><span class="comment"> * There can be many such equations </span></div> <div class="line"><span class="comment"> * There can be many such equations</span></div>
<div class="line"><span class="comment"> */</span></div> <div class="line"><span class="comment"> */</span></div>
<div class="line"><span class="preprocessor">#include &lt;iostream&gt;</span> <span class="comment">/// for io operations</span></div> <div class="line"><span class="preprocessor">#include &lt;cassert&gt;</span> <span class="comment">/// asserting the test functions</span></div>
<div class="line"><span class="comment"></span><span class="preprocessor">#include &lt;vector&gt;</span> <span class="comment">/// for using the vector container</span></div> <div class="line"><span class="comment"></span><span class="preprocessor">#include &lt;iostream&gt;</span> <span class="comment">/// for io operations</span></div>
<div class="line"><span class="comment"></span><span class="preprocessor">#include &lt;cassert&gt;</span> <span class="comment">/// asserting the test functions</span></div> <div class="line"><span class="comment"></span><span class="preprocessor">#include &lt;vector&gt;</span> <span class="comment">/// for using the vector container</span></div>
<div class="line"><span class="comment"></span><span class="comment"></span> </div> <div class="line"><span class="comment"></span><span class="comment"></span> </div>
<div class="line"><span class="comment">/**</span></div> <div class="line"><span class="comment">/**</span></div>
<div class="line"><span class="comment"> * @brief The change() function is used </span></div> <div class="line"><span class="comment"> * @brief The change() function is used</span></div>
<div class="line"><span class="comment"> * to return the updated iterative value corresponding </span></div> <div class="line"><span class="comment"> * to return the updated iterative value corresponding</span></div>
<div class="line"><span class="comment"> * to the given function</span></div> <div class="line"><span class="comment"> * to the given function</span></div>
<div class="line"><span class="comment"> * @param x is the value corresponding to the x coordinate</span></div> <div class="line"><span class="comment"> * @param x is the value corresponding to the x coordinate</span></div>
<div class="line"><span class="comment"> * @param y is the value corresponding to the y coordinate </span></div> <div class="line"><span class="comment"> * @param y is the value corresponding to the y coordinate</span></div>
<div class="line"><span class="comment"> * @returns the computed function value at that call</span></div> <div class="line"><span class="comment"> * @returns the computed function value at that call</span></div>
<div class="line"><span class="comment"> */</span></div> <div class="line"><span class="comment"> */</span></div>
<div class="line"><span class="keyword">static</span> <span class="keywordtype">double</span> <a name="a0"></a><a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(<span class="keywordtype">double</span> x, <span class="keywordtype">double</span> y) </div> <div class="line"><span class="keyword">static</span> <span class="keywordtype">double</span> <a name="a0"></a><a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(<span class="keywordtype">double</span> x, <span class="keywordtype">double</span> y) { <span class="keywordflow">return</span> ((x - y) / 2.0); }</div>
<div class="line">{ </div>
<div class="line"> <span class="keywordflow">return</span> ((x - y)/2.0); </div>
<div class="line"> </div>
<div class="line">} </div>
<div class="line"><span class="comment"></span> </div> <div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">/**</span></div> <div class="line"><span class="comment">/**</span></div>
<div class="line"><span class="comment"> * @namespace numerical_methods</span></div> <div class="line"><span class="comment"> * @namespace numerical_methods</span></div>
@@ -138,98 +136,98 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu
<div class="line"><span class="keyword">namespace </span><a class="code" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {<span class="comment"></span></div> <div class="line"><span class="keyword">namespace </span><a class="code" href="../../d1/de0/namespacenumerical__methods.html">numerical_methods</a> {<span class="comment"></span></div>
<div class="line"><span class="comment">/**</span></div> <div class="line"><span class="comment">/**</span></div>
<div class="line"><span class="comment"> * @namespace runge_kutta</span></div> <div class="line"><span class="comment"> * @namespace runge_kutta</span></div>
<div class="line"><span class="comment"> * @brief Functions for [Runge Kutta fourth order](https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods) method</span></div> <div class="line"><span class="comment"> * @brief Functions for [Runge Kutta fourth</span></div>
<div class="line"><span class="comment"> * order](https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods) method</span></div>
<div class="line"><span class="comment"> */</span></div> <div class="line"><span class="comment"> */</span></div>
<div class="line"><span class="keyword">namespace </span><a class="code" href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a> {<span class="comment"></span></div> <div class="line"><span class="keyword">namespace </span><a class="code" href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a> {<span class="comment"></span></div>
<div class="line"><span class="comment">/**</span></div> <div class="line"><span class="comment">/**</span></div>
<div class="line"><span class="comment"> * @brief the Runge Kutta method finds the value of integration of a function in the given limits.</span></div> <div class="line"><span class="comment"> * @brief the Runge Kutta method finds the value of integration of a function in</span></div>
<div class="line"><span class="comment"> * the lower limit of integration as the initial value and the upper limit is the given x</span></div> <div class="line"><span class="comment"> * the given limits. the lower limit of integration as the initial value and the</span></div>
<div class="line"><span class="comment"> * upper limit is the given x</span></div>
<div class="line"><span class="comment"> * @param init_x is the value of initial x and is updated after each call</span></div> <div class="line"><span class="comment"> * @param init_x is the value of initial x and is updated after each call</span></div>
<div class="line"><span class="comment"> * @param init_y is the value of initial x and is updated after each call</span></div> <div class="line"><span class="comment"> * @param init_y is the value of initial x and is updated after each call</span></div>
<div class="line"><span class="comment"> * @param x is current iteration at which the function needs to be evaluated</span></div> <div class="line"><span class="comment"> * @param x is current iteration at which the function needs to be evaluated</span></div>
<div class="line"><span class="comment"> * @param h is the step value </span></div> <div class="line"><span class="comment"> * @param h is the step value</span></div>
<div class="line"><span class="comment"> * @returns the value of y at thr required value of x from the initial conditions</span></div> <div class="line"><span class="comment"> * @returns the value of y at thr required value of x from the initial</span></div>
<div class="line"><span class="comment"> * conditions</span></div>
<div class="line"><span class="comment"> */</span></div> <div class="line"><span class="comment"> */</span></div>
<div class="line"><span class="keywordtype">double</span> <a name="a1"></a><a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">rungeKutta</a>(<span class="keywordtype">double</span> init_x, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;init_y, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;<a name="a2"></a><a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>) </div> <div class="line"><span class="keywordtype">double</span> <a name="a1"></a><a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">rungeKutta</a>(<span class="keywordtype">double</span> init_x, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;init_y, <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;x,</div>
<div class="line">{ </div> <div class="line"> <span class="keyword">const</span> <span class="keywordtype">double</span> &amp;<a name="a2"></a><a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>) {</div>
<div class="line"> </div> <div class="line"> <span class="comment">// Count number of iterations</span></div>
<div class="line"> <span class="comment">// Count number of iterations </span></div> <div class="line"> <span class="comment">// using step size or</span></div>
<div class="line"> <span class="comment">// using step size or </span></div> <div class="line"> <span class="comment">// step height h</span></div>
<div class="line"> <span class="comment">// step height h </span></div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"> <span class="comment">// n calucates the number of iterations</span></div>
<div class="line"> <span class="comment">// k1, k2, k3, k4 are the Runge Kutta variables </span></div>
<div class="line"> <span class="comment">// used for calculation of y at each iteration</span></div>
<div class="line"> </div>
<div class="line"> <span class="keyword">auto</span> n = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((x - init_x) / <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>); </div>
<div class="line"> <span class="comment">// used a vector container for the variables</span></div>
<div class="line"> <a name="_a3"></a><a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> k(4,0.0);</div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"> <span class="comment">// Iterate for number of iterations </span></div>
<div class="line"> </div>
<div class="line"> <span class="keywordtype">double</span> y = init_y; </div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i=1; i&lt;=n; ++i) </div>
<div class="line"> { </div>
<div class="line"> </div>
<div class="line"> <span class="comment">// Apply Runge Kutta Formulas </span></div>
<div class="line"> <span class="comment">// to find next value of y </span></div>
<div class="line"> k[0] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>*<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x, y); </div>
<div class="line"> k[1] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>*<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5*<a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5*k[0]); </div>
<div class="line"> k[2] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>*<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5*<a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5*k[1]); </div>
<div class="line"> k[3] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>*<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + k[2]); </div>
<div class="line"> </div>
<div class="line"> </div>
<div class="line"> <span class="comment">// Update next value of y </span></div>
<div class="line"> </div>
<div class="line"> y += (1.0/6.0)*(k[0] + 2*k[1] + 2*k[2] + k[3]);</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// Update next value of x </span></div>
<div class="line"> </div>
<div class="line"> init_x += <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>; </div>
<div class="line"> } </div>
<div class="line"> </div> <div class="line"> </div>
<div class="line"> <span class="keywordflow">return</span> y; </div> <div class="line"> <span class="comment">// n calucates the number of iterations</span></div>
<div class="line">} </div> <div class="line"> <span class="comment">// k1, k2, k3, k4 are the Runge Kutta variables</span></div>
<div class="line">} <span class="comment">// namespace runge_kutta</span></div> <div class="line"> <span class="comment">// used for calculation of y at each iteration</span></div>
<div class="line">} <span class="comment">// namespace numerical_methods</span></div> <div class="line"> </div>
<div class="line"> <span class="keyword">auto</span> n = <span class="keyword">static_cast&lt;</span>uint64_t<span class="keyword">&gt;</span>((x - init_x) / <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>);</div>
<div class="line"> <span class="comment">// used a vector container for the variables</span></div>
<div class="line"> <a name="_a3"></a><a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;double&gt;</a> k(4, 0.0);</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// Iterate for number of iterations</span></div>
<div class="line"> </div>
<div class="line"> <span class="keywordtype">double</span> y = init_y;</div>
<div class="line"> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt;= n; ++i) {</div>
<div class="line"> <span class="comment">// Apply Runge Kutta Formulas</span></div>
<div class="line"> <span class="comment">// to find next value of y</span></div>
<div class="line"> k[0] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x, y);</div>
<div class="line"> k[1] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5 * <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5 * k[0]);</div>
<div class="line"> k[2] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + 0.5 * <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + 0.5 * k[1]);</div>
<div class="line"> k[3] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a> * <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a>(init_x + <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>, y + k[2]);</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// Update next value of y</span></div>
<div class="line"> </div>
<div class="line"> y += (1.0 / 6.0) * (k[0] + 2 * k[1] + 2 * k[2] + k[3]);</div>
<div class="line"> </div>
<div class="line"> <span class="comment">// Update next value of x</span></div>
<div class="line"> </div>
<div class="line"> init_x += <a class="code" href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a>;</div>
<div class="line"> }</div>
<div class="line"> </div>
<div class="line"> <span class="keywordflow">return</span> y;</div>
<div class="line">}</div>
<div class="line">} <span class="comment">// namespace runge_kutta</span></div>
<div class="line">} <span class="comment">// namespace numerical_methods</span></div>
<div class="line"><span class="comment"></span> </div> <div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">/**</span></div> <div class="line"><span class="comment">/**</span></div>
<div class="line"><span class="comment"> * @brief Tests to check algorithm implementation.</span></div> <div class="line"><span class="comment"> * @brief Tests to check algorithm implementation.</span></div>
<div class="line"><span class="comment"> * @returns void </span></div> <div class="line"><span class="comment"> * @returns void</span></div>
<div class="line"><span class="comment"> */</span></div> <div class="line"><span class="comment"> */</span></div>
<div class="line"> <span class="keyword">static</span> <span class="keywordtype">void</span> <a name="a4"></a><a class="code" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>()</div> <div class="line"><span class="keyword">static</span> <span class="keywordtype">void</span> <a name="a4"></a><a class="code" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
<div class="line"> {</div> <div class="line"> <a name="_a5"></a><a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of &quot;</span></div>
<div class="line"> <a name="_a5"></a><a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;The Runge Kutta function will be tested on the basis of precomputed values\n&quot;</span>;</div> <div class="line"> <span class="stringliteral">&quot;precomputed values\n&quot;</span>;</div>
<div class="line"> </div> <div class="line"> </div>
<div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div> <div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 1....&quot;</span></div>
<div class="line"> <span class="keywordtype">double</span> valfirst=<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(2,3,4,0.2); <span class="comment">// Tests the function with pre calculated values</span></div> <div class="line"> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"> assert(valfirst==3.10363932323749570);</div> <div class="line"> <span class="keywordtype">double</span> valfirst = <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
<div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div> <div class="line"> 2, 3, 4, 0.2); <span class="comment">// Tests the function with pre calculated values</span></div>
<div class="line"> assert(valfirst == 3.10363932323749570);</div>
<div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 1\n&quot;</span>;</div>
<div class="line"> </div> <div class="line"> </div>
<div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div> <div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 2....&quot;</span></div>
<div class="line"> <span class="keywordtype">double</span> valsec=<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(1,2,5,0.1); <span class="comment">// The value of step changed</span></div> <div class="line"> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"> assert(valsec==3.40600589380261409);</div> <div class="line"> <span class="keywordtype">double</span> valsec = <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
<div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div> <div class="line"> 1, 2, 5, 0.1); <span class="comment">// The value of step changed</span></div>
<div class="line"> assert(valsec == 3.40600589380261409);</div>
<div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 2\n&quot;</span>;</div>
<div class="line"> </div> <div class="line"> </div>
<div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div> <div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Test 3....&quot;</span></div>
<div class="line"> <span class="keywordtype">double</span> valthird=<a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(-1,3,4,0.1); <span class="comment">// Tested with negative value</span></div> <div class="line"> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"> assert(valthird==2.49251005860244268);</div> <div class="line"> <span class="keywordtype">double</span> valthird = <a class="code" href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a>(</div>
<div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div> <div class="line"> -1, 3, 4, 0.1); <span class="comment">// Tested with negative value</span></div>
<div class="line"> }</div> <div class="line"> assert(valthird == 2.49251005860244268);</div>
<div class="line"> </div> <div class="line"> <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Passed Test 3\n&quot;</span>;</div>
<div class="line"> <span class="comment"></span></div> <div class="line">}</div>
<div class="line"><span class="comment"></span> </div>
<div class="line"><span class="comment">/**</span></div> <div class="line"><span class="comment">/**</span></div>
<div class="line"><span class="comment"> * @brief Main function</span></div> <div class="line"><span class="comment"> * @brief Main function</span></div>
<div class="line"><span class="comment"> * @returns 0 on exit </span></div> <div class="line"><span class="comment"> * @returns 0 on exit</span></div>
<div class="line"><span class="comment"> */</span></div> <div class="line"><span class="comment"> */</span></div>
<div class="line"><span class="keywordtype">int</span> <a name="a6"></a><a class="code" href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() </div> <div class="line"><span class="keywordtype">int</span> <a name="a6"></a><a class="code" href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
<div class="line">{ </div>
<div class="line"> </div>
<div class="line"> <a class="code" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// Execute the tests</span></div> <div class="line"> <a class="code" href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// Execute the tests</span></div>
<div class="line"> <span class="keywordflow">return</span> 0; </div> <div class="line"> <span class="keywordflow">return</span> 0;</div>
<div class="line">} </div> <div class="line">}</div>
</div><!-- fragment --> </div><!-- contents --> </div><!-- fragment --> </div><!-- contents -->
</div><!-- doc-content --> </div><!-- doc-content -->
<div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:84</div></div> <div class="ttc" id="arat__maze_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../dc/d5a/rat__maze_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> rat_maze.cpp:84</div></div>
@@ -239,8 +237,8 @@ $(document).ready(function(){initNavTree('dc/dc4/_2_users_2runner_2work_2_c-_plu
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div> <div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div> <div class="ttc" id="ahash__search_8cpp_html_a566eaf0ffafd50bc61e644561fd27001"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a566eaf0ffafd50bc61e644561fd27001">h</a></div><div class="ttdeci">int h(int key)</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:45</div></div>
<div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></div> <div class="ttc" id="anamespacerunge__kutta_html"><div class="ttname"><a href="../../d2/de7/namespacerunge__kutta.html">runge_kutta</a></div><div class="ttdoc">Functions for Runge Kutta fourth order method.</div></div>
<div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">asserting the test functions</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:31</div></div> <div class="ttc" id="arungekutta_8cpp_html_a450497475f5607333f9aca8f88901579"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a450497475f5607333f9aca8f88901579">change</a></div><div class="ttdeci">static double change(double x, double y)</div><div class="ttdoc">for using the vector container</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:33</div></div>
<div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:56</div></div> <div class="ttc" id="arungekutta_8cpp_html_a7b9f40c7b5e9749cc550f19be3dc8856"><div class="ttname"><a href="../../d1/da6/rungekutta_8cpp.html#a7b9f40c7b5e9749cc550f19be3dc8856">numerical_methods::runge_kutta::rungeKutta</a></div><div class="ttdeci">double rungeKutta(double init_x, const double &amp;init_y, const double &amp;x, const double &amp;h)</div><div class="ttdoc">the Runge Kutta method finds the value of integration of a function in the given limits....</div><div class="ttdef"><b>Definition:</b> rungekutta.cpp:57</div></div>
<!-- start footer part --> <!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! --> <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul> <ul>

8
dc/dc7/rungekutta_8cpp__incl.map
View File

@@ -1,6 +1,6 @@
<map id="numerical_methods/rungekutta.cpp" name="numerical_methods/rungekutta.cpp"> <map id="numerical_methods/rungekutta.cpp" name="numerical_methods/rungekutta.cpp">
<area shape="rect" id="node1" title="Runge Kutta fourth order method implementation" alt="" coords="18,5,243,32"/> <area shape="rect" id="node1" title="Runge Kutta fourth order method implementation" alt="" coords="19,5,244,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,77,107"/> <area shape="rect" id="node2" title=" " alt="" coords="5,80,71,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,80,160,107"/> <area shape="rect" id="node3" title=" " alt="" coords="95,80,167,107"/>
<area shape="rect" id="node4" title=" " alt="" coords="185,80,250,107"/> <area shape="rect" id="node4" title=" " alt="" coords="191,80,250,107"/>
</map> </map>

2
dc/dc7/rungekutta_8cpp__incl.md5
View File

@@ -1 +1 @@
71964ee4e0ecca036604e5639b0cff75 2f5eeb5441327c16bafde8672cd37515

28
dc/dc7/rungekutta_8cpp__incl.svg
View File

@@ -13,8 +13,8 @@
<g id="node1" class="node"> <g id="node1" class="node">
<title>Node1</title> <title>Node1</title>
<g id="a_node1"><a xlink:title="Runge Kutta fourth order method implementation"> <g id="a_node1"><a xlink:title="Runge Kutta fourth order method implementation">
<polygon fill="#bfbfbf" stroke="black" points="9.5,-56.5 9.5,-75.5 178.5,-75.5 178.5,-56.5 9.5,-56.5"/> <polygon fill="#bfbfbf" stroke="black" points="10,-56.5 10,-75.5 179,-75.5 179,-56.5 10,-56.5"/>
<text text-anchor="middle" x="94" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/rungekutta.cpp</text> <text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">numerical_methods/rungekutta.cpp</text>
</a> </a>
</g> </g>
</g> </g>
@@ -22,46 +22,46 @@
<g id="node2" class="node"> <g id="node2" class="node">
<title>Node2</title> <title>Node2</title>
<g id="a_node2"><a xlink:title=" "> <g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text> <text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node2 --> <!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge"> <g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title> <title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M83.24,-56.32C73.23,-48.26 58.11,-36.08 46.07,-26.37"/> <path fill="none" stroke="midnightblue" d="M83.25,-56.32C72.7,-48.18 56.7,-35.84 44.06,-26.09"/>
<polygon fill="midnightblue" stroke="midnightblue" points="47.94,-23.38 37.96,-19.83 43.55,-28.83 47.94,-23.38"/> <polygon fill="midnightblue" stroke="midnightblue" points="46.01,-23.17 35.95,-19.83 41.73,-28.71 46.01,-23.17"/>
</g> </g>
<!-- Node3 --> <!-- Node3 -->
<g id="node3" class="node"> <g id="node3" class="node">
<title>Node3</title> <title>Node3</title>
<g id="a_node3"><a xlink:title=" "> <g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 116,-19.5 116,-0.5 72,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="67.5,-0.5 67.5,-19.5 121.5,-19.5 121.5,-0.5 67.5,-0.5"/>
<text text-anchor="middle" x="94" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text> <text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node3 --> <!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge"> <g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title> <title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M94,-56.08C94,-49.01 94,-38.86 94,-29.99"/> <path fill="none" stroke="midnightblue" d="M94.5,-56.08C94.5,-49.01 94.5,-38.86 94.5,-29.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="97.5,-29.75 94,-19.75 90.5,-29.75 97.5,-29.75"/> <polygon fill="midnightblue" stroke="midnightblue" points="98,-29.75 94.5,-19.75 91,-29.75 98,-29.75"/>
</g> </g>
<!-- Node4 --> <!-- Node4 -->
<g id="node4" class="node"> <g id="node4" class="node">
<title>Node4</title> <title>Node4</title>
<g id="a_node4"><a xlink:title=" "> <g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="134.5,-0.5 134.5,-19.5 183.5,-19.5 183.5,-0.5 134.5,-0.5"/> <polygon fill="white" stroke="#bfbfbf" points="139.5,-0.5 139.5,-19.5 183.5,-19.5 183.5,-0.5 139.5,-0.5"/>
<text text-anchor="middle" x="159" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text> <text text-anchor="middle" x="161.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a> </a>
</g> </g>
</g> </g>
<!-- Node1&#45;&gt;Node4 --> <!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge"> <g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title> <title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M104.44,-56.32C114.15,-48.26 128.82,-36.08 140.5,-26.37"/> <path fill="none" stroke="midnightblue" d="M105.26,-56.32C115.27,-48.26 130.39,-36.08 142.43,-26.37"/>
<polygon fill="midnightblue" stroke="midnightblue" points="142.91,-28.92 148.37,-19.83 138.44,-23.53 142.91,-28.92"/> <polygon fill="midnightblue" stroke="midnightblue" points="144.95,-28.83 150.54,-19.83 140.56,-23.38 144.95,-28.83"/>
</g> </g>
</g> </g>
</svg> </svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.9 KiB

After

Width:  |  Height:  |  Size: 2.9 KiB

Some files were not shown because too many files have changed in this diff Show More