backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 9a58357372

Browse Source
This commit is contained in:
github-actions
2022-01-19 15:37:46 +00:00
parent 2cab28c905
commit dfedbcef8a
219 changed files with 2538 additions and 1699 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
annotated.html
View File

@@ -149,9 +149,10 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_6_1_0_0_" style="display:none;"><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_1_1_" style="display:none;"><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_2_" style="display:none;"><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_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9658;</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 M_PI definition and pow() </td></tr>
<tr id="row_7_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9658;</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/numeric/random/rand.html">std::rand</a> </td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_7_0_" class="arrow" onclick="toggleFolder('7_0_')">&#9658;</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" style="display:none;"><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_7_1_" class="even" style="display:none;"><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/d4f/structmath_1_1_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
<tr id="row_8_0_" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_8_0_" class="arrow" onclick="toggleFolder('8_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>circular_linked_list</b></td><td class="desc"></td></tr>
<tr id="row_8_0_0_" style="display:none;"><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="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr>
@@ -205,8 +206,8 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_16_0_" style="display:none;"><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="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </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/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></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="d5/d15/classcll.html" target="_self">cll</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="d1/db3/structcompare.html" target="_self">compare</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="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </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="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </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="d1/db3/structcompare.html" target="_self">compare</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="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_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="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</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="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
@@ -224,8 +225,8 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<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="d2/d05/class_min_heap.html" target="_self">MinHeap</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="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</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/d77/structmst.html" target="_self">mst</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="db/d8b/struct_node.html" target="_self">Node</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="d5/da1/structnode.html" target="_self">node</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="d5/da1/structnode.html" target="_self">node</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="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_40_" 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_41_"><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_42_" 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/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>

7
annotated_dup.js
View File

@@ -75,7 +75,8 @@ var annotated_dup =
[ "math", "dd/d47/namespacemath.html", [
[ "ncr_modulo_p", null, [
[ "NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p" ]
] ]
] ],
[ "Point", "de/d4f/structmath_1_1_point.html", null ]
] ],
[ "operations_on_datastructures", "da/d6d/namespaceoperations__on__datastructures.html", [
[ "circular_linked_list", null, [
@@ -148,8 +149,8 @@ var annotated_dup =
[ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ],
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Complex", "da/d5a/class_complex.html", "da/d5a/class_complex" ],
[ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
@@ -167,8 +168,8 @@ var annotated_dup =
[ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ],
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ],
[ "mst", "d1/d77/structmst.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Node", "db/d8b/struct_node.html", null ],
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
[ "query", "dd/d1b/structquery.html", null ],
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],

6
classes.html
View File

@@ -103,7 +103,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d9/dde/classbinary__search__tree.html">binary_search_tree</a></dd><dd><a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">BinaryTree</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree::bst_node</a></dd><dd><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">BT</a> (others::recursive_tree_traversals)</dd><dd><a class="el" href="d9/d90/struct_btree.html">Btree</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_C" name="letter_C">C</a></dt>
<dd><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dd><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_D" name="letter_D">D</a></dt>
<dd><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)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd><dd><a class="el" href="dd/d1f/classdsu.html">dsu</a></dd></dl>
@@ -130,10 +130,10 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a></dd><dd><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a></dd><dd><a class="el" href="d1/d77/structmst.html">mst</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_N" name="letter_N">N</a></dt>
<dd><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)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> (data_structures::linked_list)</dd><dd><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>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> (others::recursive_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
<dd><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)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> (data_structures::linked_list)</dd><dd><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>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> (others::recursive_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_P" name="letter_P">P</a></dt>
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> (geometry::grahamscan)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> (geometry::grahamscan)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="de/d4f/structmath_1_1_point.html">Point</a> (<a class="el" href="dd/d47/namespacemath.html">math</a>)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_Q" name="letter_Q">Q</a></dt>
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><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)</dd></dl>

251
d0/d51/approximate__pi_8cpp.html Normal file
View File

@@ -0,0 +1,251 @@
<!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=11"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/approximate_pi.cpp File 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 id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;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.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d0/d51/approximate__pi_8cpp.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="#nested-classes">Classes</a> &#124;
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">approximate_pi.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a>.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
<code>#include &lt;cstdlib&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for approximate_pi.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d27/approximate__pi_8cpp__incl.svg" width="251" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d4f/structmath_1_1_point.html">math::Point</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:abf7f2a6d91f1ca6c89698792aea3f188"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../d8/dc8/struct_point.html">Point</a> &gt; &amp;pts)</td></tr>
<tr class="separator:abf7f2a6d91f1ca6c89698792aea3f188"><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="../../d0/d51/approximate__pi_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <a href="../../d0/d51/approximate__pi_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d51/approximate__pi_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../d0/d51/approximate__pi_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">More...</a><br /></td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><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 >Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a>. </p>
<p >We take a random point P with coordinates (x, y) such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. If x² + y² ≤ 1, then the point is inside the quarter disk of radius 1, otherwise the point is outside. We know that the probability of the point being inside the quarter disk is equal to π/4 double approx(vector&lt;Point&gt; &amp;pts) which will use the points pts (drawn at random) to return an estimate of the number π </p><dl class="section note"><dt>Note</dt><dd>This implementation is better than naive recursive or iterative approach.</dd></dl>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Qannaf" target="_blank">Qannaf AL-SAHMI</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&nbsp;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>argc</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char *&#160;</td>
<td class="paramname"><em>argv</em>[]&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">argc</td><td>commandline argument count (ignored) </td></tr>
<tr><td class="paramname">argv</td><td>commandline array of arguments (ignored) </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 75</span> {</div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_function" href="../../d0/d51/approximate__pi_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 77</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 78</span>}</div>
<div class="ttc" id="aapproximate__pi_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d0/d51/approximate__pi_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> approximate_pi.cpp:58</div></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="../../d0/d51/approximate__pi_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="356" height="139"><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="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&nbsp;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 58</span> {</div>
<div class="line"><span class="lineno"> 59</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;math::Point&gt;</a> rands;</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> i = 0; i &lt; 100000; i++) {</div>
<div class="line"><span class="lineno"> 61</span> <a class="code hl_struct" href="../../de/d4f/structmath_1_1_point.html">math::Point</a> p;</div>
<div class="line"><span class="lineno"> 62</span> p.x = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() / (double)RAND_MAX; <span class="comment">// 0 &lt;= x &lt;= 1</span></div>
<div class="line"><span class="lineno"> 63</span> p.y = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() / (double)RAND_MAX; <span class="comment">// 0 &lt;= y &lt;= 1</span></div>
<div class="line"><span class="lineno"> 64</span> rands.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(p);</div>
<div class="line"><span class="lineno"> 65</span> }</div>
<div class="line"><span class="lineno"> 66</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_function" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a>(rands) &lt;&lt; <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>; <span class="comment">// ~3.14</span></div>
<div class="line"><span class="lineno"> 67</span>}</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="anamespacemath_html_abf7f2a6d91f1ca6c89698792aea3f188"><div class="ttname"><a href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">math::approximate_pi</a></div><div class="ttdeci">double approximate_pi(const std::vector&lt; Point &gt; &amp;pts)</div><div class="ttdef"><b>Definition:</b> approximate_pi.cpp:35</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="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="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
<div class="ttc" id="astructmath_1_1_point_html"><div class="ttname"><a href="../../de/d4f/structmath_1_1_point.html">math::Point</a></div><div class="ttdef"><b>Definition:</b> approximate_pi.cpp:30</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>
</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="../../d0/d51/approximate__pi_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="258" height="139"><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><!-- 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="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../d0/d51/approximate__pi_8cpp.html">approximate_pi.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>
</html>

7
d0/d51/approximate__pi_8cpp.js Normal file
View File

@@ -0,0 +1,7 @@
var approximate__pi_8cpp =
[
[ "math::Point", "de/d4f/structmath_1_1_point.html", null ],
[ "approximate_pi", "d0/d51/approximate__pi_8cpp.html#abf7f2a6d91f1ca6c89698792aea3f188", null ],
[ "main", "d0/d51/approximate__pi_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
[ "test", "d0/d51/approximate__pi_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

7
d0/d51/approximate__pi_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,56,56,83"/>
<area shape="rect" id="node2" href="$d0/d51/approximate__pi_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,56,148,83"/>
<area shape="rect" id="node3" href="$dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" title=" " alt="" coords="200,5,347,32"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl#" title=" " alt="" coords="237,56,309,83"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back#" title=" " alt="" coords="196,107,351,133"/>
</map>

1
d0/d51/approximate__pi_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
54c758b0246a8ee84bc3a7802c8b312f

82
d0/d51/approximate__pi_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg Normal file
View File

@@ -0,0 +1,82 @@
<?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.50.0 (20211204.2007)
-->
<!-- Title: main Pages: 1 -->
<svg width="267pt" height="104pt"
viewBox="0.00 0.00 267.00 104.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 100)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-100 263,-100 263,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 38,-57.5 38,-38.5 0,-38.5"/>
<text text-anchor="middle" x="19" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d0/d51/approximate__pi_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="black" points="74,-38.5 74,-57.5 107,-57.5 107,-38.5 74,-38.5"/>
<text text-anchor="middle" x="90.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</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="M38.26,-48C46.07,-48 55.31,-48 63.79,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-51.5 73.95,-48 63.95,-44.5 63.95,-51.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="146,-76.5 146,-95.5 256,-95.5 256,-76.5 146,-76.5"/>
<text text-anchor="middle" x="201" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::approximate_pi</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="M107.23,-53.95C117.41,-57.76 130.95,-62.77 143,-67 148.74,-69.01 154.82,-71.1 160.79,-73.11"/>
<polygon fill="midnightblue" stroke="midnightblue" points="160.06,-76.56 170.65,-76.41 162.28,-69.92 160.06,-76.56"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl#" xlink:title=" ">
<polygon fill="white" stroke="black" points="174,-38.5 174,-57.5 228,-57.5 228,-38.5 174,-38.5"/>
<text text-anchor="middle" x="201" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M107.05,-48C121.68,-48 144.15,-48 163.34,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="163.59,-51.5 173.59,-48 163.59,-44.5 163.59,-51.5"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back#" xlink:title=" ">
<polygon fill="white" stroke="black" points="143,-0.5 143,-19.5 259,-19.5 259,-0.5 143,-0.5"/>
<text text-anchor="middle" x="201" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M107.23,-42.05C117.41,-38.24 130.95,-33.23 143,-29 148.74,-26.99 154.82,-24.9 160.79,-22.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="162.28,-26.08 170.65,-19.59 160.06,-19.44 162.28,-26.08"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.8 KiB

6
d0/d51/approximate__pi_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,56,49,83"/>
<area shape="rect" id="node2" href="$dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" title=" " alt="" coords="101,5,248,32"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl#" title=" " alt="" coords="139,56,211,83"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back#" title=" " alt="" coords="97,107,252,133"/>
</map>

1
d0/d51/approximate__pi_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
9c10672cf5681e13d19c4fda7c7cba16

67
d0/d51/approximate__pi_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.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.50.0 (20211204.2007)
-->
<!-- Title: test Pages: 1 -->
<svg width="193pt" height="104pt"
viewBox="0.00 0.00 193.00 104.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 100)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-100 189,-100 189,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#bfbfbf" stroke="black" points="0,-38.5 0,-57.5 33,-57.5 33,-38.5 0,-38.5"/>
<text text-anchor="middle" x="16.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="72,-76.5 72,-95.5 182,-95.5 182,-76.5 72,-76.5"/>
<text text-anchor="middle" x="127" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::approximate_pi</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="M33.23,-53.95C43.41,-57.76 56.95,-62.77 69,-67 74.74,-69.01 80.82,-71.1 86.79,-73.11"/>
<polygon fill="midnightblue" stroke="midnightblue" points="86.06,-76.56 96.65,-76.41 88.28,-69.92 86.06,-76.56"/>
</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/io/manip/endl#" xlink:title=" ">
<polygon fill="white" stroke="black" points="100,-38.5 100,-57.5 154,-57.5 154,-38.5 100,-38.5"/>
<text text-anchor="middle" x="127" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</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="M33.05,-48C47.68,-48 70.15,-48 89.34,-48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="89.59,-51.5 99.59,-48 89.59,-44.5 89.59,-51.5"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back#" xlink:title=" ">
<polygon fill="white" stroke="black" points="69,-0.5 69,-19.5 185,-19.5 185,-0.5 69,-0.5"/>
<text text-anchor="middle" x="127" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</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="M33.23,-42.05C43.41,-38.24 56.95,-33.23 69,-29 74.74,-26.99 80.82,-24.9 86.79,-22.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="88.28,-26.08 96.65,-19.59 86.06,-19.44 88.28,-26.08"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.1 KiB

2
d0/d6d/modular__exponentiation_8cpp.html
View File

@@ -111,7 +111,7 @@ Include dependency graph for modular_exponentiation.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

2
d1/dbb/n__choose__r_8cpp.html
View File

@@ -111,7 +111,7 @@ Include dependency graph for n_choose_r.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

2
d1/de9/integral__approximation_8cpp.html
View File

@@ -113,7 +113,7 @@ Include dependency graph for integral_approximation.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

6
d2/d27/approximate__pi_8cpp__incl.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="math/approximate_pi.cpp" name="math/approximate_pi.cpp">
<area shape="rect" id="node1" title="Implementation to calculate an estimate of the number π (Pi)." alt="" coords="47,5,215,32"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,80,77,107"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,80,160,107"/>
<area shape="rect" id="node4" title=" " alt="" coords="185,80,245,107"/>
</map>

1
d2/d27/approximate__pi_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
fb66de3f656eaa5d91ce6ae87847c2a0

67
d2/d27/approximate__pi_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.50.0 (20211204.2007)
-->
<!-- Title: math/approximate_pi.cpp Pages: 1 -->
<svg width="188pt" height="84pt"
viewBox="0.00 0.00 187.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/approximate_pi.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 183.5,-80 183.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Implementation to calculate an estimate of the number π (Pi).">
<polygon fill="#bfbfbf" stroke="black" points="31,-56.5 31,-75.5 157,-75.5 157,-56.5 31,-56.5"/>
<text text-anchor="middle" x="94" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">math/approximate_pi.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 54,-19.5 54,-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>
</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.24,-56.32C73.23,-48.26 58.11,-36.08 46.07,-26.37"/>
<polygon fill="midnightblue" stroke="midnightblue" points="47.94,-23.38 37.96,-19.83 43.55,-28.83 47.94,-23.38"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</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"/>
<text text-anchor="middle" x="94" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</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,-56.08C94,-49.01 94,-38.86 94,-29.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="97.5,-29.75 94,-19.75 90.5,-29.75 97.5,-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="134.5,-0.5 134.5,-19.5 179.5,-19.5 179.5,-0.5 134.5,-0.5"/>
<text text-anchor="middle" x="157" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</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="M104.12,-56.32C113.53,-48.26 127.74,-36.08 139.07,-26.37"/>
<polygon fill="midnightblue" stroke="midnightblue" points="141.38,-29 146.69,-19.83 136.82,-23.68 141.38,-29"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.8 KiB

2
d4/d38/power__of__two_8cpp.html
View File

@@ -110,7 +110,7 @@ Include dependency graph for power_of_two.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

2
d4/d9d/sum__of__binomial__coefficient_8cpp.html
View File

@@ -111,7 +111,7 @@ Include dependency graph for sum_of_binomial_coefficient.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

2
d5/d7a/largest__power_8cpp.html
View File

@@ -111,7 +111,7 @@ Include dependency graph for largest_power.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

2
d5/d83/lcm__sum_8cpp.html
View File

@@ -112,7 +112,7 @@ Include dependency graph for lcm_sum.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

2
d8/db1/binomial__calculate_8cpp.html
View File

@@ -113,7 +113,7 @@ Include dependency graph for binomial_calculate.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d7/d7a/namespacebinomial"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d7a/namespacebinomial.html">binomial</a></td></tr>
<tr class="memdesc:d7/d7a/namespacebinomial"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> implementation. <br /></td></tr>

2
d9/d44/magic__number_8cpp.html
View File

@@ -111,7 +111,7 @@ Include dependency graph for magic_number.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

2
da/d39/volume_8cpp.html
View File

@@ -113,7 +113,7 @@ Include dependency graph for volume.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

2
db/d27/n__bonacci_8cpp.html
View File

@@ -113,7 +113,7 @@ Include dependency graph for n_bonacci.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:de/d36/namespacen__bonacci"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d36/namespacen__bonacci.html">n_bonacci</a></td></tr>
<tr class="memdesc:de/d36/namespacen__bonacci"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> implementation. <br /></td></tr>

2
db/d40/integral__approximation2_8cpp.html
View File

@@ -118,7 +118,7 @@ Include dependency graph for integral_approximation2.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d0/da4/namespacemonte__carlo"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/da4/namespacemonte__carlo.html">monte_carlo</a></td></tr>
<tr class="memdesc:d0/da4/namespacemonte__carlo"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> implementation. <br /></td></tr>

2
dc/d82/area_8cpp.html
View File

@@ -114,7 +114,7 @@ Include dependency graph for area.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>

58
dd/d47/namespacemath.html
View File

@@ -91,16 +91,24 @@ $(document).ready(function(){initNavTree('dd/d47/namespacemath.html','../../');
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">math Namespace Reference</div></div>
</div><!--header-->
<div class="contents">
<p>for M_PI definition and pow()
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>
<a href="../../dd/d47/namespacemath.html#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/d4f/structmath_1_1_point.html">Point</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:abf7f2a6d91f1ca6c89698792aea3f188"><td class="memItemLeft" align="right" valign="top">double&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188">approximate_pi</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../de/d4f/structmath_1_1_point.html">Point</a> &gt; &amp;pts)</td></tr>
<tr class="separator:abf7f2a6d91f1ca6c89698792aea3f188"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a971ce57e368f2f631cf1f4ff3f864049"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:a971ce57e368f2f631cf1f4ff3f864049"><td class="memTemplItemLeft" align="right" valign="top">T&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">square_area</a> (T length)</td></tr>
<tr class="memdesc:a971ce57e368f2f631cf1f4ff3f864049"><td class="mdescLeft">&#160;</td><td class="mdescRight">area of a <a href="https://en.wikipedia.org/wiki/Square" target="_blank">square</a> (l * l) <a href="../../dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049">More...</a><br /></td></tr>
@@ -188,7 +196,7 @@ Functions</h2></td></tr>
<tr class="separator:abde24398be43538c62e4a496968e60ca"><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 >for M_PI definition and pow() </p>
<div class="textblock"><p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> </p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></p>
<p >for io operations</p>
@@ -197,6 +205,9 @@ Functions</h2></td></tr>
<p >Math algorithms.</p>
<p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p >for IO operations</p>
<p >for M_PI definition and pow()</p>
<p >for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p >Mathematical algorithms</p>
<p >for assert for uint16_t datatype for IO operations</p>
<p >Mathematical algorithms</p>
<p >for assert for int32_t type for atoi</p>
@@ -224,6 +235,49 @@ Algorithm</h3>
<p >for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint32_t</a></p>
<p >Mathematical algorithms </p>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="abf7f2a6d91f1ca6c89698792aea3f188" name="abf7f2a6d91f1ca6c89698792aea3f188"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abf7f2a6d91f1ca6c89698792aea3f188">&#9670;&nbsp;</a></span>approximate_pi()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">double math::approximate_pi </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../de/d4f/structmath_1_1_point.html">Point</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>pts</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p >This function use the points pts (drawn at random) to return an estimate of the number π using the given points </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">pts</td><td>Each item of pts contains a point. A point is represented by a structure containing exactly two numbers, respectively x and y such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. pts always contains at least one item </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>an estimate of the number π</dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 35</span> {<span class="comment"></span></div>
<div class="line"><span class="lineno"> 36</span><span class="comment"> /**</span></div>
<div class="line"><span class="lineno"> 37</span><span class="comment"> * This function use the points pts (drawn at random) to return an estimate of the number π using the given points</span></div>
<div class="line"><span class="lineno"> 38</span><span class="comment"> * @param pts Each item of pts contains a point. A point is represented by a structure containing exactly </span></div>
<div class="line"><span class="lineno"> 39</span><span class="comment"> * two numbers, respectively x and y such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. </span></div>
<div class="line"><span class="lineno"> 40</span><span class="comment"> * pts always contains at least one item</span></div>
<div class="line"><span class="lineno"> 41</span><span class="comment"> * @return an estimate of the number π</span></div>
<div class="line"><span class="lineno"> 42</span><span class="comment"> */</span></div>
<div class="line"><span class="lineno"> 43</span> {</div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordtype">int</span> count =0; <span class="comment">// Points in cercle</span></div>
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">for</span>(<a class="code hl_struct" href="../../de/d4f/structmath_1_1_point.html">Point</a> p:pts)</div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span>(p.x * p.x + p.y*p.y &lt;= 1)</div>
<div class="line"><span class="lineno"> 47</span> ++count;</div>
<div class="line"><span class="lineno"> 48</span> </div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">return</span> 4.0*count/pts.size();</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span> }</div>
<div class="ttc" id="astructmath_1_1_point_html"><div class="ttname"><a href="../../de/d4f/structmath_1_1_point.html">math::Point</a></div><div class="ttdef"><b>Definition:</b> approximate_pi.cpp:30</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae1ca505751f5a6d3977b86372cfe75ea" name="ae1ca505751f5a6d3977b86372cfe75ea"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae1ca505751f5a6d3977b86372cfe75ea">&#9670;&nbsp;</a></span>binomialCoeffSum()</h2>

2
dd/d47/namespacemath.js
View File

@@ -27,6 +27,8 @@ var namespacemath =
[ "cross", "df/d66/vector__cross__product_8cpp.html#a225732399c5c076976eae5b180a9f8c9", null ],
[ "mag", "df/d66/vector__cross__product_8cpp.html#a4b2a9757a87c18e1642d72410ecfaba8", null ]
] ],
[ "Point", "de/d4f/structmath_1_1_point.html", null ],
[ "approximate_pi", "dd/d47/namespacemath.html#abf7f2a6d91f1ca6c89698792aea3f188", null ],
[ "binomialCoeffSum", "dd/d47/namespacemath.html#ae1ca505751f5a6d3977b86372cfe75ea", null ],
[ "circle_area", "dd/d47/namespacemath.html#a40e36c67da78d2131408c57ee091ad75", null ],
[ "cone_volume", "dd/d47/namespacemath.html#a3fe35440c27758ecc2287e08217d63a7", null ],

124
de/d4f/structmath_1_1_point.html Normal file
View File

@@ -0,0 +1,124 @@
<!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=11"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math::Point Struct 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 id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;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.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('de/d4f/structmath_1_1_point.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-attribs">Public Attributes</a> &#124;
<a href="../../df/d7f/structmath_1_1_point-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">math::Point Struct Reference</div></div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a484b34b33e988c222f74d3b6e9643084"><td class="memItemLeft" align="right" valign="top"><a id="a484b34b33e988c222f74d3b6e9643084" name="a484b34b33e988c222f74d3b6e9643084"></a>
double&#160;</td><td class="memItemRight" valign="bottom"><b>x</b></td></tr>
<tr class="separator:a484b34b33e988c222f74d3b6e9643084"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0f4db4ac6d60e6f753c55861c5308759"><td class="memItemLeft" align="right" valign="top"><a id="a0f4db4ac6d60e6f753c55861c5308759" name="a0f4db4ac6d60e6f753c55861c5308759"></a>
double&#160;</td><td class="memItemRight" valign="bottom"><b>y</b></td></tr>
<tr class="separator:a0f4db4ac6d60e6f753c55861c5308759"><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 >structure of points containing two numbers, respectively x and y such that 0 ≤ x ≤ 1 and 0 ≤ y ≤ 1. </p>
</div><hr/>The documentation for this struct was generated from the following file:<ul>
<li>math/<a class="el" href="../../d0/d51/approximate__pi_8cpp.html">approximate_pi.cpp</a></li>
</ul>
</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="../../dd/d47/namespacemath.html">math</a></li><li class="navelem"><a class="el" href="../../de/d4f/structmath_1_1_point.html">Point</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>
</html>

2
de/dab/ncr__modulo__p_8cpp.html
View File

@@ -119,7 +119,7 @@ Classes</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/db9/namespacencr__modulo__p"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/db9/namespacencr__modulo__p.html">ncr_modulo_p</a></td></tr>
<tr class="memdesc:d4/db9/namespacencr__modulo__p"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> implementation. <br /></td></tr>

2
de/dc3/fibonacci__sum_8cpp.html
View File

@@ -113,7 +113,7 @@ Include dependency graph for fibonacci_sum.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d3/dc9/namespacefibonacci__sum"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/dc9/namespacefibonacci__sum.html">fibonacci_sum</a></td></tr>
<tr class="memdesc:d3/dc9/namespacefibonacci__sum"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the sum of the Fibonacci Sequence: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\). <br /></td></tr>

2
df/d66/vector__cross__product_8cpp.html
View File

@@ -113,7 +113,7 @@ Include dependency graph for vector_cross_product.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d4/d91/namespacevector__cross"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d91/namespacevector__cross.html">vector_cross</a></td></tr>
<tr class="memdesc:d4/d91/namespacevector__cross"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for Vector Cross Product algorithms. <br /></td></tr>

2
df/d72/modular__division_8cpp.html
View File

@@ -111,7 +111,7 @@ Include dependency graph for modular_division.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dd/d47/namespacemath"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for M_PI definition and pow() <br /></td></tr>
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d1/d64/namespacemodular__division"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/d64/namespacemodular__division.html">modular_division</a></td></tr>
<tr class="memdesc:d1/d64/namespacemodular__division"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> implementation. <br /></td></tr>

110
df/d7f/structmath_1_1_point-members.html Normal file
View File

@@ -0,0 +1,110 @@
<!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=11"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</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 id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;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.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
/* @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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(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:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('de/d4f/structmath_1_1_point.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">math::Point Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../de/d4f/structmath_1_1_point.html">math::Point</a>, including all inherited members.</p>
<table class="directory">
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>x</b> (defined in <a class="el" href="../../de/d4f/structmath_1_1_point.html">math::Point</a>)</td><td class="entry"><a class="el" href="../../de/d4f/structmath_1_1_point.html">math::Point</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>y</b> (defined in <a class="el" href="../../de/d4f/structmath_1_1_point.html">math::Point</a>)</td><td class="entry"><a class="el" href="../../de/d4f/structmath_1_1_point.html">math::Point</a></td><td class="entry"></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>
</html>

3
dir_296d53ceaeaa7e099814a6def439fe8a.html
View File

@@ -96,6 +96,9 @@ $(document).ready(function(){initNavTree('dir_296d53ceaeaa7e099814a6def439fe8a.h
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d51/approximate__pi_8cpp.html">approximate_pi.cpp</a></td></tr>
<tr class="memdesc:d0/d51/approximate__pi_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="dc/d82/area_8cpp.html">area.cpp</a></td></tr>
<tr class="memdesc:dc/d82/area_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_296d53ceaeaa7e099814a6def439fe8a.js
View File

@@ -1,5 +1,6 @@
var dir_296d53ceaeaa7e099814a6def439fe8a =
[
[ "approximate_pi.cpp", "d0/d51/approximate__pi_8cpp.html", "d0/d51/approximate__pi_8cpp" ],
[ "area.cpp", "dc/d82/area_8cpp.html", "dc/d82/area_8cpp" ],
[ "armstrong_number.cpp", "d4/d5d/math_2armstrong__number_8cpp.html", "d4/d5d/math_2armstrong__number_8cpp" ],
[ "binary_exponent.cpp", "de/dcf/binary__exponent_8cpp.html", "de/dcf/binary__exponent_8cpp" ],

105
files.html
View File

@@ -204,58 +204,59 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
<tr id="row_13_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html" target="_self">ordinary_least_squares_regressor.cpp</a></td><td class="desc">Linear regression example using <a href="https://en.wikipedia.org/wiki/Ordinary_least_squares" target="_blank">Ordinary least squares</a> </td></tr>
<tr id="row_13_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d95/vector__ops_8hpp_source.html"><span class="icondoc"></span></a><a class="el" href="d8/d95/vector__ops_8hpp.html" target="_self">vector_ops.hpp</a></td><td class="desc">Various functions for vectors associated with [NeuralNetwork (aka Multilayer Perceptron)] (<a href="https://en.wikipedia.org/wiki/Multilayer_perceptron">https://en.wikipedia.org/wiki/Multilayer_perceptron</a>) </td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9658;</span><span id="img_14_" class="iconfclosed" onclick="toggleFolder('14_')">&#160;</span><a class="el" href="dir_296d53ceaeaa7e099814a6def439fe8a.html" target="_self">math</a></td><td class="desc"></td></tr>
<tr id="row_14_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d82/area_8cpp.html" target="_self">area.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes </td></tr>
<tr id="row_14_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html" target="_self">armstrong_number.cpp</a></td><td class="desc">Program to check if a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong/Narcissistic number</a> in decimal system </td></tr>
<tr id="row_14_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr>
<tr id="row_14_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr>
<tr id="row_14_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr>
<tr id="row_14_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a factorial of some number or not </td></tr>
<tr id="row_14_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+6 jumping and check for i or i+2 to be a factor of the number; if it's a factor then we will return false otherwise true after the loop terminates at the terminating condition which is (i*i&lt;=num) </td></tr>
<tr id="row_14_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr>
<tr id="row_14_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d89/double__factorial_8cpp.html" target="_self">double_factorial.cpp</a></td><td class="desc">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\) </td></tr>
<tr id="row_14_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">C++ Program to find <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> function </td></tr>
<tr id="row_14_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) </td></tr>
<tr id="row_14_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">C++ program to find factorial of given number </td></tr>
<tr id="row_14_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
<tr id="row_14_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">Generate fibonacci sequence </td></tr>
<tr id="row_14_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
<tr id="row_14_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
<tr id="row_14_16_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
<tr id="row_14_17_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
<tr id="row_14_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
<tr id="row_14_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_20_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers by division method </td></tr>
<tr id="row_14_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_22_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
<tr id="row_14_23_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
<tr id="row_14_24_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
<tr id="row_14_25_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
<tr id="row_14_26_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
<tr id="row_14_27_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
<tr id="row_14_28_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) </td></tr>
<tr id="row_14_29_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_30_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
<tr id="row_14_31_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_32_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
<tr id="row_14_33_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
<tr id="row_14_34_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
<tr id="row_14_35_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
<tr id="row_14_36_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
<tr id="row_14_37_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
<tr id="row_14_38_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
<tr id="row_14_39_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
<tr id="row_14_40_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
<tr id="row_14_41_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
<tr id="row_14_42_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
<tr id="row_14_43_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
<tr id="row_14_44_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_14_45_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Get list of prime numbers using Sieve of Eratosthenes </td></tr>
<tr id="row_14_46_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding </td></tr>
<tr id="row_14_47_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
<tr id="row_14_48_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
<tr id="row_14_49_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
<tr id="row_14_50_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
<tr id="row_14_51_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
<tr id="row_14_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d51/approximate__pi_8cpp.html" target="_self">approximate_pi.cpp</a></td><td class="desc">Implementation to calculate an estimate of the <a href="https://en.wikipedia.org/wiki/File:Pi_30K.gif" target="_blank">number π (Pi)</a> </td></tr>
<tr id="row_14_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d82/area_8cpp.html" target="_self">area.cpp</a></td><td class="desc">Implementations for the <a href="https://en.wikipedia.org/wiki/Area" target="_blank">area</a> of various shapes </td></tr>
<tr id="row_14_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html" target="_self">armstrong_number.cpp</a></td><td class="desc">Program to check if a number is an <a href="https://en.wikipedia.org/wiki/Narcissistic_number" target="_blank">Armstrong/Narcissistic number</a> in decimal system </td></tr>
<tr id="row_14_3_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dcf/binary__exponent_8cpp.html" target="_self">binary_exponent.cpp</a></td><td class="desc">C++ Program to find Binary Exponent Iteratively and Recursively </td></tr>
<tr id="row_14_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/db1/binomial__calculate_8cpp.html" target="_self">binomial_calculate.cpp</a></td><td class="desc">Program to calculate <a href="https://en.wikipedia.org/wiki/Binomial_coefficient" target="_blank">Binomial coefficients</a> </td></tr>
<tr id="row_14_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/df6/check__amicable__pair_8cpp.html" target="_self">check_amicable_pair.cpp</a></td><td class="desc">A C++ Program to check whether a pair of number is <a href="https://en.wikipedia.org/wiki/Amicable_numbers" target="_blank">amicable pair</a> or not </td></tr>
<tr id="row_14_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/dd5/check__factorial_8cpp.html" target="_self">check_factorial.cpp</a></td><td class="desc">A simple program to check if the given number is a factorial of some number or not </td></tr>
<tr id="row_14_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d93/check__prime_8cpp.html" target="_self">check_prime.cpp</a></td><td class="desc">Reduced all possibilities of a number which cannot be prime. Eg: No even number, except 2 can be a prime number, hence we will increment our loop with i+6 jumping and check for i or i+2 to be a factor of the number; if it's a factor then we will return false otherwise true after the loop terminates at the terminating condition which is (i*i&lt;=num) </td></tr>
<tr id="row_14_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d67/complex__numbers_8cpp.html" target="_self">complex_numbers.cpp</a></td><td class="desc">An implementation of <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> Number as Objects </td></tr>
<tr id="row_14_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d89/double__factorial_8cpp.html" target="_self">double_factorial.cpp</a></td><td class="desc">Compute <a href="https://en.wikipedia.org/wiki/Double_factorial" target="_blank">double factorial</a>: \(n!!\) </td></tr>
<tr id="row_14_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d23/eulers__totient__function_8cpp.html" target="_self">eulers_totient_function.cpp</a></td><td class="desc">C++ Program to find <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function" target="_blank">Euler's Totient</a> function </td></tr>
<tr id="row_14_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d5d/extended__euclid__algorithm_8cpp.html" target="_self">extended_euclid_algorithm.cpp</a></td><td class="desc">GCD using [extended Euclid's algorithm] (<a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm</a>) </td></tr>
<tr id="row_14_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d00/factorial_8cpp.html" target="_self">factorial.cpp</a></td><td class="desc">C++ program to find factorial of given number </td></tr>
<tr id="row_14_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/d0b/fast__power_8cpp.html" target="_self">fast_power.cpp</a></td><td class="desc">Faster computation for \(a^b\) </td></tr>
<tr id="row_14_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d89/fibonacci_8cpp.html" target="_self">fibonacci.cpp</a></td><td class="desc">Generate fibonacci sequence </td></tr>
<tr id="row_14_15_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d32/fibonacci__fast_8cpp.html" target="_self">fibonacci_fast.cpp</a></td><td class="desc">Faster computation of Fibonacci series </td></tr>
<tr id="row_14_16_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/de4/fibonacci__large_8cpp.html" target="_self">fibonacci_large.cpp</a></td><td class="desc">Computes N^th Fibonacci number given as input argument. Uses custom build arbitrary integers library to perform additions and other operations </td></tr>
<tr id="row_14_17_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/dc9/fibonacci__matrix__exponentiation_8cpp.html" target="_self">fibonacci_matrix_exponentiation.cpp</a></td><td class="desc">This program computes the N^th Fibonacci number in modulo mod input argument </td></tr>
<tr id="row_14_18_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dc3/fibonacci__sum_8cpp.html" target="_self">fibonacci_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of <a href="https://en.wikipedia.org/wiki/Fibonacci_number" target="_blank">Fibonacci Sequence</a>: \(\mathrm{F}(n) + \mathrm{F}(n+1) + .. + \mathrm{F}(m)\) </td></tr>
<tr id="row_14_19_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d46/finding__number__of__digits__in__a__number_8cpp.html" target="_self">finding_number_of_digits_in_a_number.cpp</a></td><td class="desc">[Program to count digits in an integer](<a href="https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods">https://www.geeksforgeeks.org/program-count-digits-integer-3-different-methods</a>) </td></tr>
<tr id="row_14_20_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html" target="_self">gcd_iterative_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>iterative form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_21_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html" target="_self">gcd_of_n_numbers.cpp</a></td><td class="desc">This program aims at calculating the GCD of n numbers by division method </td></tr>
<tr id="row_14_22_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html" target="_self">gcd_recursive_euclidean.cpp</a></td><td class="desc">Compute the greatest common denominator of two integers using <em>recursive form</em> of <a href="https://en.wikipedia.org/wiki/Euclidean_algorithm" target="_blank">Euclidean algorithm</a> </td></tr>
<tr id="row_14_23_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/de9/integral__approximation_8cpp.html" target="_self">integral_approximation.cpp</a></td><td class="desc">Compute integral approximation of the function using <a href="https://en.wikipedia.org/wiki/Riemann_sum" target="_blank">Riemann sum</a> </td></tr>
<tr id="row_14_24_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d40/integral__approximation2_8cpp.html" target="_self">integral_approximation2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Monte_Carlo_integration" target="_blank">Monte Carlo Integration</a> </td></tr>
<tr id="row_14_25_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/db8/inv__sqrt_8cpp.html" target="_self">inv_sqrt.cpp</a></td><td class="desc">Implementation of <a href="https://medium.com/hard-mode/the-legendary-fast-inverse-square-root-e51fee3b49d9" target="_blank">the inverse square root Root</a> </td></tr>
<tr id="row_14_26_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d9d/large__factorial_8cpp.html" target="_self">large_factorial.cpp</a></td><td class="desc">Compute factorial of any arbitratily large number/ </td></tr>
<tr id="row_14_27_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d4/d86/large__number_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d4/d86/large__number_8h.html" target="_self">large_number.h</a></td><td class="desc">Library to perform arithmatic operations on arbitrarily large numbers </td></tr>
<tr id="row_14_28_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d7a/largest__power_8cpp.html" target="_self">largest_power.cpp</a></td><td class="desc">Algorithm to find largest x such that p^x divides n! (factorial) using Legendre's Formula </td></tr>
<tr id="row_14_29_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d83/lcm__sum_8cpp.html" target="_self">lcm_sum.cpp</a></td><td class="desc">An algorithm to calculate the sum of LCM: \(\mathrm{LCM}(1,n) + \mathrm{LCM}(2,n) + \ldots + \mathrm{LCM}(n,n)\) </td></tr>
<tr id="row_14_30_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d21/least__common__multiple_8cpp.html" target="_self">least_common_multiple.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_31_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d44/magic__number_8cpp.html" target="_self">magic_number.cpp</a></td><td class="desc">A simple program to check if the given number is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number </td></tr>
<tr id="row_14_32_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d42/miller__rabin_8cpp.html" target="_self">miller_rabin.cpp</a></td><td class="desc"></td></tr>
<tr id="row_14_33_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d72/modular__division_8cpp.html" target="_self">modular_division.cpp</a></td><td class="desc">An algorithm to divide two numbers under modulo p <a href="https://www.geeksforgeeks.org/modular-division" target="_blank">Modular Division</a> </td></tr>
<tr id="row_14_34_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d6d/modular__exponentiation_8cpp.html" target="_self">modular_exponentiation.cpp</a></td><td class="desc">C++ Program for Modular Exponentiation Iteratively </td></tr>
<tr id="row_14_35_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html" target="_self">modular_inverse_fermat_little_theorem.cpp</a></td><td class="desc">C++ Program to find the modular inverse using <a href="https://en.wikipedia.org/wiki/Fermat%27s_little_theorem" target="_blank">Fermat's Little Theorem</a> </td></tr>
<tr id="row_14_36_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d27/n__bonacci_8cpp.html" target="_self">n_bonacci.cpp</a></td><td class="desc">Implementation of the <a href="http://oeis.org/wiki/N-bonacci_numbers" target="_blank">N-bonacci</a> series </td></tr>
<tr id="row_14_37_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/dbb/n__choose__r_8cpp.html" target="_self">n_choose_r.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Combination" target="_blank">Combinations</a> n choose r function implementation </td></tr>
<tr id="row_14_38_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/dab/ncr__modulo__p_8cpp.html" target="_self">ncr_modulo_p.cpp</a></td><td class="desc">This program aims at calculating <a href="https://cp-algorithms.com/combinatorics/binomial-coefficients.html" target="_blank">nCr modulo p</a> </td></tr>
<tr id="row_14_39_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html" target="_self">number_of_positive_divisors.cpp</a></td><td class="desc">C++ Program to calculate the number of positive divisors </td></tr>
<tr id="row_14_40_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/def/power__for__huge__numbers_8cpp.html" target="_self">power_for_huge_numbers.cpp</a></td><td class="desc">Compute powers of large numbers </td></tr>
<tr id="row_14_41_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d38/power__of__two_8cpp.html" target="_self">power_of_two.cpp</a></td><td class="desc">Implementation to check whether a number is a power of 2 or not </td></tr>
<tr id="row_14_42_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d0d/prime__factorization_8cpp.html" target="_self">prime_factorization.cpp</a></td><td class="desc">Prime factorization of positive integers </td></tr>
<tr id="row_14_43_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d9b/prime__numbers_8cpp.html" target="_self">prime_numbers.cpp</a></td><td class="desc">Get list of prime numbers </td></tr>
<tr id="row_14_44_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html" target="_self">primes_up_to_billion.cpp</a></td><td class="desc">Compute prime numbers upto 1 billion </td></tr>
<tr id="row_14_45_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d08/realtime__stats_8cpp.html" target="_self">realtime_stats.cpp</a></td><td class="desc">Compute statistics for data entered in rreal-time </td></tr>
<tr id="row_14_46_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html" target="_self">sieve_of_eratosthenes.cpp</a></td><td class="desc">Get list of prime numbers using Sieve of Eratosthenes </td></tr>
<tr id="row_14_47_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d24/sqrt__double_8cpp.html" target="_self">sqrt_double.cpp</a></td><td class="desc">Calculate the square root of any positive real number in \(O(\log N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> of root-finding </td></tr>
<tr id="row_14_48_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="de/d47/string__fibonacci_8cpp.html" target="_self">string_fibonacci.cpp</a></td><td class="desc">This Programme returns the Nth fibonacci as a string </td></tr>
<tr id="row_14_49_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d9d/sum__of__binomial__coefficient_8cpp.html" target="_self">sum_of_binomial_coefficient.cpp</a></td><td class="desc">Algorithm to find sum of binomial coefficients of a given positive integer </td></tr>
<tr id="row_14_50_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d83/sum__of__digits_8cpp.html" target="_self">sum_of_digits.cpp</a></td><td class="desc">A C++ Program to find the Sum of Digits of input integer </td></tr>
<tr id="row_14_51_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d66/vector__cross__product_8cpp.html" target="_self">vector_cross_product.cpp</a></td><td class="desc">Calculates the <a href="https://en.wikipedia.org/wiki/Cross_product" target="_blank">Cross Product</a> and the magnitude of two mathematical 3D vectors </td></tr>
<tr id="row_14_52_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d39/volume_8cpp.html" target="_self">volume.cpp</a></td><td class="desc">Implmentations for the <a href="https://en.wikipedia.org/wiki/Volume" target="_blank">volume</a> of various 3D shapes </td></tr>
<tr id="row_15_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9658;</span><span id="img_15_" class="iconfclosed" onclick="toggleFolder('15_')">&#160;</span><a class="el" href="dir_9c6faab82c22511b50177aa2e38e2780.html" target="_self">numerical_methods</a></td><td class="desc"></td></tr>
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d9c/babylonian__method_8cpp.html" target="_self">babylonian_method.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method" target="_blank">A babylonian method (BM)</a> is an algorithm that computes the square root </td></tr>
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d6a/bisection__method_8cpp.html" target="_self">bisection_method.cpp</a></td><td class="desc">Solve the equation \(f(x)=0\) using <a href="https://en.wikipedia.org/wiki/Bisection_method" target="_blank">bisection method</a> </td></tr>

2
globals_func_i.html
View File

@@ -103,8 +103,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
<li>is_happy()&#160;:&#160;<a class="el" href="db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">happy_number.cpp</a></li>
<li>is_prime()&#160;:&#160;<a class="el" href="db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">check_prime.cpp</a></li>
<li>is_square()&#160;:&#160;<a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">ordinary_least_squares_regressor.cpp</a></li>
<li>IsPrime()&#160;:&#160;<a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a></li>
<li>IsPrime()&#160;:&#160;<a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
<li>it_ternary_search()&#160;:&#160;<a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a></li>
</ul>
</div><!-- contents -->

2
globals_func_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_func_t.html
View File

File diff suppressed because one or more lines are too long

2
globals_i.html
View File

@@ -104,8 +104,8 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>is_happy()&#160;:&#160;<a class="el" href="db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">happy_number.cpp</a></li>
<li>is_prime()&#160;:&#160;<a class="el" href="db/d93/check__prime_8cpp.html#aa18b3517017d99bb4024853bddba5532">check_prime.cpp</a></li>
<li>is_square()&#160;:&#160;<a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">ordinary_least_squares_regressor.cpp</a></li>
<li>IsPrime()&#160;:&#160;<a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a></li>
<li>IsPrime()&#160;:&#160;<a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
<li>isprime&#160;:&#160;<a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a></li>
<li>it_ternary_search()&#160;:&#160;<a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a></li>
</ul>

2
globals_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_p.html
View File

@@ -105,8 +105,8 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
<li>pop()&#160;:&#160;<a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">paranthesis_matching.cpp</a></li>
<li>power()&#160;:&#160;<a class="el" href="df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power_for_huge_numbers.cpp</a>, <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">matrix_exponentiation.cpp</a></li>
<li>predict_OLS_regressor()&#160;:&#160;<a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">ordinary_least_squares_regressor.cpp</a></li>
<li>prime&#160;:&#160;<a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">primes_up_to_billion.cpp</a></li>
<li>PRIME&#160;:&#160;<a class="el" href="d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">rabin_karp.cpp</a></li>
<li>prime&#160;:&#160;<a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">primes_up_to_billion.cpp</a></li>
<li>prime_factorization()&#160;:&#160;<a class="el" href="db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization.cpp</a></li>
<li>prime_numbers&#160;:&#160;<a class="el" href="db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_factorization.cpp</a></li>
<li>primes()&#160;:&#160;<a class="el" href="de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">prime_numbers.cpp</a></li>

2
globals_t.html
View File

File diff suppressed because one or more lines are too long

85
hierarchy.html
View File

@@ -107,8 +107,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_7_"><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_8_" 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/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">operations_on_datastructures::circular_linked_list::CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr>
<tr id="row_9_"><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_10_" 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_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="de/d4a/class_compare.html" target="_self">Compare&lt; S, T, E &gt;</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_10_" 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="de/d4a/class_compare.html" target="_self">Compare&lt; S, T, E &gt;</a></td><td class="desc">Comparator class for priority queue </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="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></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="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::comparison_operator</a></td><td class="desc">Custom comparator for open_list </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="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_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="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">geometry::jarvis::Convexhull</a></td><td class="desc"></td></tr>
@@ -151,8 +151,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_50_" 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/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
<tr id="row_51_"><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/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
<tr id="row_52_" 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/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_self">data_structures::trie_using_hashmap::Trie::Node</a></td><td class="desc">Struct representing a trie node </td></tr>
<tr id="row_53_"><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_54_" 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&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_53_"><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&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_54_" 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/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_55_"><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/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">operations_on_datastructures::circular_linked_list::Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
<tr id="row_56_" 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/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_57_"><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/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
@@ -165,44 +165,45 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_64_" 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="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_65_"><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/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></td></tr>
<tr id="row_66_" 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/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_67_"><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_68_" 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_69_"><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&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_70_" 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_71_"><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="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_72_" 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/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_73_"><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_74_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_74_" class="arrow" onclick="toggleFolder('74_')">&#9658;</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">range_queries::heavy_light_decomposition::SG&lt; X &gt;</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_74_0_" style="display:none;"><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="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_75_"><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/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_76_" 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_77_"><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/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_78_" 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/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
<tr id="row_79_"><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/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_80_" 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&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_81_"><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_82_" 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/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_83_"><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/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_84_" 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/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_85_"><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/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_86_" 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_87_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_87_" class="arrow" onclick="toggleFolder('87_')">&#9658;</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">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</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_87_0_" class="even" style="display:none;"><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="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_88_" 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/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_89_"><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/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_90_" 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/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_91_"><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/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_92_" 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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_93_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_93_" class="arrow" onclick="toggleFolder('93_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_93_0_" class="even" style="display:none;"><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="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_93_1_" class="even" style="display:none;"><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="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_93_2_" class="even" style="display:none;"><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="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_93_3_" class="even" style="display:none;"><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/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_93_4_" class="even" style="display:none;"><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="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_93_5_" class="even" style="display:none;"><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="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_94_" 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/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_95_"><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/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_96_" 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="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
<tr id="row_67_"><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="de/d4f/structmath_1_1_point.html" target="_self">math::Point</a></td><td class="desc"></td></tr>
<tr id="row_68_" 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_69_"><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_70_" 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/da9/classqueue.html" target="_self">queue&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_71_"><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_72_" 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="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_73_"><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/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_74_" 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_75_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_75_" class="arrow" onclick="toggleFolder('75_')">&#9658;</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">range_queries::heavy_light_decomposition::SG&lt; X &gt;</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_75_0_" class="even" style="display:none;"><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="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_76_" 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/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_77_"><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_78_" 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/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_79_"><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/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
<tr id="row_80_" 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/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_81_"><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&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_82_" 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_83_"><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/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_84_" 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/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_85_"><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/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_86_" 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/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_87_"><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_88_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_88_" class="arrow" onclick="toggleFolder('88_')">&#9658;</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">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</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_88_0_" style="display:none;"><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="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_89_"><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/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_90_" 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/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_91_"><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/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_92_" 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/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_93_"><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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_94_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_94_" class="arrow" onclick="toggleFolder('94_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_94_0_" style="display:none;"><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="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_94_1_" style="display:none;"><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="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_94_2_" style="display:none;"><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="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_94_3_" style="display:none;"><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/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_94_4_" style="display:none;"><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="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_94_5_" style="display:none;"><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="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_95_"><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/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_96_" 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/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_97_"><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="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

5
hierarchy.js
View File

@@ -10,8 +10,8 @@ var hierarchy =
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "operations_on_datastructures::circular_linked_list::CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Compare< S, T, E >", "de/d4a/class_compare.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator", "d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html", null ],
[ "Complex", "da/d5a/class_complex.html", null ],
[ "geometry::jarvis::Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", null ],
@@ -55,8 +55,8 @@ var hierarchy =
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
[ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
[ "operations_on_datastructures::circular_linked_list::Node", "da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "operations_on_datastructures::reverse_binary_tree::Node", "d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html", null ],
@@ -69,6 +69,7 @@ var hierarchy =
[ "ciphers::elliptic_curve_key_exchange::Point", "d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html", null ],
[ "geometry::grahamscan::Point", "d7/d48/structgeometry_1_1grahamscan_1_1_point.html", null ],
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "math::Point", "de/d4f/structmath_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],
[ "queue< Kind >", "db/da9/classqueue.html", null ],

2
inherit_graph_53.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d2/d05/class_min_heap.html" title=" " alt="" coords="5,5,80,32"/>
<area shape="rect" id="node1" href="$de/d4f/structmath_1_1_point.html" title=" " alt="" coords="5,5,95,32"/>
</map>

2
inherit_graph_53.md5
View File

@@ -1 +1 @@
20a3344e5b7c2798c614a5832bb050be
89c895ce95ccdb5ecf2e2e9ff03cb43f

12
inherit_graph_53.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="64pt" height="28pt"
viewBox="0.00 0.00 64.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="75pt" height="28pt"
viewBox="0.00 0.00 75.00 28.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 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 60,-24 60,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 71,-24 71,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d2/d05/class_min_heap.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 56,-19.5 56,-0.5 0,-0.5"/>
<text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap</text>
<g id="a_node1"><a xlink:href="de/d4f/structmath_1_1_point.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 67,-19.5 67,-0.5 0,-0.5"/>
<text text-anchor="middle" x="33.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">math::Point</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 995 B

After

Width:  |  Height:  |  Size: 1007 B

2
inherit_graph_54.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d5/d29/struct_min_heap_node.html" title=" " alt="" coords="5,5,111,32"/>
<area shape="rect" id="node1" href="$d2/d05/class_min_heap.html" title=" " alt="" coords="5,5,80,32"/>
</map>

2
inherit_graph_54.md5
View File

@@ -1 +1 @@
b7390394bbaa0abd74424ba9a880f9e2
20a3344e5b7c2798c614a5832bb050be

12
inherit_graph_54.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="87pt" height="28pt"
viewBox="0.00 0.00 87.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="64pt" height="28pt"
viewBox="0.00 0.00 64.00 28.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 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 83,-24 83,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 60,-24 60,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d5/d29/struct_min_heap_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 79,-19.5 79,-0.5 0,-0.5"/>
<text text-anchor="middle" x="39.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeapNode</text>
<g id="a_node1"><a xlink:href="d2/d05/class_min_heap.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 56,-19.5 56,-0.5 0,-0.5"/>
<text text-anchor="middle" x="28" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeap</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1007 B

After

Width:  |  Height:  |  Size: 995 B

2
inherit_graph_55.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d1/d77/structmst.html" title=" " alt="" coords="5,5,49,32"/>
<area shape="rect" id="node1" href="$d5/d29/struct_min_heap_node.html" title=" " alt="" coords="5,5,111,32"/>
</map>

2
inherit_graph_55.md5
View File

@@ -1 +1 @@
dac11be16a53d20641c8a15ac8df90c8
b7390394bbaa0abd74424ba9a880f9e2

12
inherit_graph_55.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="41pt" height="28pt"
viewBox="0.00 0.00 41.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="87pt" height="28pt"
viewBox="0.00 0.00 87.00 28.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 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 37,-24 37,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 83,-24 83,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d1/d77/structmst.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 33,-19.5 33,-0.5 0,-0.5"/>
<text text-anchor="middle" x="16.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">mst</text>
<g id="a_node1"><a xlink:href="d5/d29/struct_min_heap_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 79,-19.5 79,-0.5 0,-0.5"/>
<text text-anchor="middle" x="39.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">MinHeapNode</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 988 B

After

Width:  |  Height:  |  Size: 1007 B

2
inherit_graph_56.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$db/d8b/struct_node.html" title=" " alt="" coords="5,5,59,32"/>
<area shape="rect" id="node1" href="$d1/d77/structmst.html" title=" " alt="" coords="5,5,49,32"/>
</map>

2
inherit_graph_56.md5
View File

@@ -1 +1 @@
345302fd1e3a1df4f5d11eaae31127fd
dac11be16a53d20641c8a15ac8df90c8

12
inherit_graph_56.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="48pt" height="28pt"
viewBox="0.00 0.00 48.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="41pt" height="28pt"
viewBox="0.00 0.00 41.00 28.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 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 44,-24 44,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 37,-24 37,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="db/d8b/struct_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 40,-19.5 40,-0.5 0,-0.5"/>
<text text-anchor="middle" x="20" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Node</text>
<g id="a_node1"><a xlink:href="d1/d77/structmst.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 33,-19.5 33,-0.5 0,-0.5"/>
<text text-anchor="middle" x="16.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">mst</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 989 B

After

Width:  |  Height:  |  Size: 988 B

2
inherit_graph_57.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d5/da1/structnode.html" title=" " alt="" coords="5,5,105,32"/>
<area shape="rect" id="node1" href="$db/d8b/struct_node.html" title=" " alt="" coords="5,5,59,32"/>
</map>

2
inherit_graph_57.md5
View File

@@ -1 +1 @@
ed0ff6113ee370c2e2e0573042492713
345302fd1e3a1df4f5d11eaae31127fd

12
inherit_graph_57.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="83pt" height="28pt"
viewBox="0.00 0.00 83.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="48pt" height="28pt"
viewBox="0.00 0.00 48.00 28.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 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 79,-24 79,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 44,-24 44,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d5/da1/structnode.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 75,-19.5 75,-0.5 0,-0.5"/>
<text text-anchor="middle" x="37.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node&lt; Kind &gt;</text>
<g id="a_node1"><a xlink:href="db/d8b/struct_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 40,-19.5 40,-0.5 0,-0.5"/>
<text text-anchor="middle" x="20" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1004 B

After

Width:  |  Height:  |  Size: 989 B

2
inherit_graph_58.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d5/da1/structnode.html" title=" " alt="" coords="5,5,108,32"/>
<area shape="rect" id="node1" href="$d5/da1/structnode.html" title=" " alt="" coords="5,5,105,32"/>
</map>

2
inherit_graph_58.md5
View File

@@ -1 +1 @@
6fbc15d6c56b357e585d5a6e4c7ecac2
ed0ff6113ee370c2e2e0573042492713

10
inherit_graph_58.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="85pt" height="28pt"
viewBox="0.00 0.00 85.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="83pt" height="28pt"
viewBox="0.00 0.00 83.00 28.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 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 81,-24 81,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 79,-24 79,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d5/da1/structnode.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 77,-19.5 77,-0.5 0,-0.5"/>
<text text-anchor="middle" x="38.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node&lt; Type &gt;</text>
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 75,-19.5 75,-0.5 0,-0.5"/>
<text text-anchor="middle" x="37.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node&lt; Kind &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1004 B

After

Width:  |  Height:  |  Size: 1004 B

2
inherit_graph_59.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List." alt="" coords="5,5,199,61"/>
<area shape="rect" id="node1" href="$d5/da1/structnode.html" title=" " alt="" coords="5,5,108,32"/>
</map>

2
inherit_graph_59.md5
View File

@@ -1 +1 @@
74e4dac2781f0ed9148fccdee3689b6b
6fbc15d6c56b357e585d5a6e4c7ecac2

16
inherit_graph_59.svg
View File

@@ -4,19 +4,17 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="153pt" height="50pt"
viewBox="0.00 0.00 153.00 50.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 46)">
<svg width="85pt" height="28pt"
viewBox="0.00 0.00 85.00 28.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 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 149,-46 149,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 81,-24 81,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_top" xlink:title="A class that implements a Circular Linked List.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 145,-41.5 145,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
<text text-anchor="middle" x="72.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList</text>
<g id="a_node1"><a xlink:href="d5/da1/structnode.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 77,-19.5 77,-0.5 0,-0.5"/>
<text text-anchor="middle" x="38.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">node&lt; Type &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 1004 B

2
inherit_graph_60.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree." alt="" coords="5,5,199,47"/>
<area shape="rect" id="node1" href="$d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List." alt="" coords="5,5,199,61"/>
</map>

2
inherit_graph_60.md5
View File

@@ -1 +1 @@
83e2b0099dfac666237627072595f4fc
74e4dac2781f0ed9148fccdee3689b6b

17
inherit_graph_60.svg
View File

@@ -4,18 +4,19 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="153pt" height="39pt"
viewBox="0.00 0.00 153.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)">
<svg width="153pt" height="50pt"
viewBox="0.00 0.00 153.00 50.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 46)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 149,-35 149,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 149,-46 149,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_top" xlink:title="A Node struct that represents a single Node in a Binary Tree.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 145,-30.5 145,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="72.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Node</text>
<g id="a_node1"><a xlink:href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_top" xlink:title="A class that implements a Circular Linked List.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 145,-41.5 145,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Circular</text>
<text text-anchor="middle" x="72.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">LinkedList</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.4 KiB

2
inherit_graph_61.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST." alt="" coords="5,5,213,47"/>
<area shape="rect" id="node1" href="$da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree." alt="" coords="5,5,199,47"/>
</map>

2
inherit_graph_61.md5
View File

@@ -1 +1 @@
ef4c4cf0170a3477b170da46253277f6
83e2b0099dfac666237627072595f4fc

12
inherit_graph_61.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="164pt" height="39pt"
viewBox="0.00 0.00 164.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="153pt" height="39pt"
viewBox="0.00 0.00 153.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>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 160,-35 160,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 149,-35 149,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_top" xlink:title="A Node structure representing a single node in BST.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 156,-30.5 156,-0.5 0,-0.5"/>
<g id="a_node1"><a xlink:href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_top" xlink:title="A Node struct that represents a single Node in a Binary Tree.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 145,-30.5 145,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="78" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst::Node</text>
<text text-anchor="middle" x="72.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::circular_linked_list::Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_62.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" title="A Binary Tree class that implements a Binary Search Tree (BST) by default." alt="" coords="5,5,220,47"/>
<area shape="rect" id="node1" href="$d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST." alt="" coords="5,5,213,47"/>
</map>

2
inherit_graph_62.md5
View File

@@ -1 +1 @@
5468f221b446333ba4a80f471d82d236
ef4c4cf0170a3477b170da46253277f6

12
inherit_graph_62.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="169pt" height="39pt"
viewBox="0.00 0.00 169.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="164pt" height="39pt"
viewBox="0.00 0.00 164.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>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 165,-35 165,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 160,-35 160,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_top" xlink:title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 161,-30.5 161,-0.5 0,-0.5"/>
<g id="a_node1"><a xlink:href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_top" xlink:title="A Node structure representing a single node in BST.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 156,-30.5 156,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="80.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
<text text-anchor="middle" x="78" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst::Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_63.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree." alt="" coords="5,5,199,47"/>
<area shape="rect" id="node1" href="$de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" title="A Binary Tree class that implements a Binary Search Tree (BST) by default." alt="" coords="5,5,220,47"/>
</map>

2
inherit_graph_63.md5
View File

@@ -1 +1 @@
320772c77ccfcd9581c67b330c50784d
5468f221b446333ba4a80f471d82d236

12
inherit_graph_63.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="153pt" height="39pt"
viewBox="0.00 0.00 153.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="169pt" height="39pt"
viewBox="0.00 0.00 169.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>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 149,-35 149,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 165,-35 165,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_top" xlink:title="A Node struct that represents a single node in a Binary Tree.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 145,-30.5 145,-0.5 0,-0.5"/>
<g id="a_node1"><a xlink:href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_top" xlink:title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 161,-30.5 161,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="72.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::Node</text>
<text text-anchor="middle" x="80.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.3 KiB

2
inherit_graph_64.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" title="Class defining the structure of trie node and containing the methods to perform operations on them." alt="" coords="5,5,199,47"/>
<area shape="rect" id="node1" href="$d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree." alt="" coords="5,5,199,47"/>
</map>

2
inherit_graph_64.md5
View File

@@ -1 +1 @@
2b8d2217680c3c1998c34e51fcbe2669
320772c77ccfcd9581c67b330c50784d

4
inherit_graph_64.svg
View File

@@ -12,10 +12,10 @@
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_top" xlink:title="Class defining the structure of trie node and containing the methods to perform operations on them.">
<g id="a_node1"><a xlink:href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_top" xlink:title="A Node struct that represents a single node in a Binary Tree.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 145,-30.5 145,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="72.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
<text text-anchor="middle" x="72.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_65.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" title="defines the functions associated with the binary tree" alt="" coords="5,5,163,47"/>
<area shape="rect" id="node1" href="$d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" title="Class defining the structure of trie node and containing the methods to perform operations on them." alt="" coords="5,5,199,47"/>
</map>

2
inherit_graph_65.md5
View File

@@ -1 +1 @@
bc14811d9b50fabe9356f7908162deb7
2b8d2217680c3c1998c34e51fcbe2669

14
inherit_graph_65.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="126pt" height="39pt"
viewBox="0.00 0.00 126.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="153pt" height="39pt"
viewBox="0.00 0.00 153.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>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 122,-35 122,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 149,-35 149,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_top" xlink:title="defines the functions associated with the binary tree">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 118,-30.5 118,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="middle" x="59" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
<g id="a_node1"><a xlink:href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_top" xlink:title="Class defining the structure of trie node and containing the methods to perform operations on them.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 145,-30.5 145,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="72.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::trie_operations::Tnode</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.3 KiB

2
inherit_graph_66.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" title="defines the structure of a node of the tree" alt="" coords="5,5,147,47"/>
<area shape="rect" id="node1" href="$d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" title="defines the functions associated with the binary tree" alt="" coords="5,5,163,47"/>
</map>

2
inherit_graph_66.md5
View File

@@ -1 +1 @@
393c9d2178c8eee68e815b34cb049ca7
bc14811d9b50fabe9356f7908162deb7

12
inherit_graph_66.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="114pt" height="39pt"
viewBox="0.00 0.00 114.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="126pt" height="39pt"
viewBox="0.00 0.00 126.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>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 110,-35 110,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 122,-35 122,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_top" xlink:title="defines the structure of a node of the tree">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 106,-30.5 106,-0.5 0,-0.5"/>
<g id="a_node1"><a xlink:href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_top" xlink:title="defines the functions associated with the binary tree">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 118,-30.5 118,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="middle" x="53" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::Node</text>
<text text-anchor="middle" x="59" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BinaryTree</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_67.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" title="LRU cache class." alt="" coords="5,5,136,47"/>
<area shape="rect" id="node1" href="$d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" title="defines the structure of a node of the tree" alt="" coords="5,5,147,47"/>
</map>

2
inherit_graph_67.md5
View File

@@ -1 +1 @@
a931991e3559a3afb38bb5e6d8b25c2a
393c9d2178c8eee68e815b34cb049ca7

14
inherit_graph_67.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="106pt" height="39pt"
viewBox="0.00 0.00 106.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="114pt" height="39pt"
viewBox="0.00 0.00 114.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>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 102,-35 102,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 110,-35 110,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_top" xlink:title="LRU cache class.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 98,-30.5 98,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
<text text-anchor="middle" x="49" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache</text>
<g id="a_node1"><a xlink:href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_top" xlink:title="defines the structure of a node of the tree">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 106,-30.5 106,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">others::iterative_tree</text>
<text text-anchor="middle" x="53" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_68.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" title="Creates an array to be used as stack for storing values." alt="" coords="5,5,180,47"/>
<area shape="rect" id="node1" href="$d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" title="LRU cache class." alt="" coords="5,5,136,47"/>
</map>

2
inherit_graph_68.md5
View File

@@ -1 +1 @@
c6f13c81f1e70f3519d7fbd61697121e
a931991e3559a3afb38bb5e6d8b25c2a

14
inherit_graph_68.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="139pt" height="39pt"
viewBox="0.00 0.00 139.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="106pt" height="39pt"
viewBox="0.00 0.00 106.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>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 135,-35 135,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 102,-35 102,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_top" xlink:title="Creates an array to be used as stack for storing values.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 131,-30.5 131,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
<text text-anchor="middle" x="65.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Stack</text>
<g id="a_node1"><a xlink:href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_top" xlink:title="LRU cache class.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 98,-30.5 98,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">others::lru_cache::</text>
<text text-anchor="middle" x="49" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">LRUCache</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_69.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ..." alt="" coords="5,5,153,47"/>
<area shape="rect" id="node1" href="$d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" title="Creates an array to be used as stack for storing values." alt="" coords="5,5,180,47"/>
</map>

2
inherit_graph_69.md5
View File

@@ -1 +1 @@
fc4948c91d4e70ffd89e8c17d1e4fb7b
c6f13c81f1e70f3519d7fbd61697121e

14
inherit_graph_69.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.50.0 (20211204.2007)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="119pt" height="39pt"
viewBox="0.00 0.00 119.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="139pt" height="39pt"
viewBox="0.00 0.00 139.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>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 115,-35 115,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 135,-35 135,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" target="_top" xlink:title="BT used to make the entire structure of the binary tree and the functions associated with the binary ...">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 111,-30.5 111,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">others::recursive_tree</text>
<text text-anchor="middle" x="55.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_traversals::BT</text>
<g id="a_node1"><a xlink:href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_top" xlink:title="Creates an array to be used as stack for storing values.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 131,-30.5 131,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">others::postfix_expression</text>
<text text-anchor="middle" x="65.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Stack</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_70.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" title="The structure to hold Nodes of the tree." alt="" coords="5,5,153,47"/>
<area shape="rect" id="node1" href="$dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ..." alt="" coords="5,5,153,47"/>
</map>

2
inherit_graph_70.md5
View File

@@ -1 +1 @@
eb4f6f4479cf835955a82bb814023c85
fc4948c91d4e70ffd89e8c17d1e4fb7b

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