backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-16 14:14:27 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 7309ef1370

Browse Source
This commit is contained in:
github-actions
2021-10-07 00:01:49 +00:00
parent aae7d7ee87
commit f83e8874e7
183 changed files with 5346 additions and 2675 deletions
Download Patch File Download Diff File Expand all files Collapse all files

119
annotated.html
View File

@@ -161,64 +161,67 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_9_1_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="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_9_2_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_9_2_" class="arrow" onclick="toggleFolder('9_2_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
<tr id="row_9_2_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="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing</a> algorithm </td></tr>
<tr id="row_10_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
<tr id="row_11_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
<tr id="row_11_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_0_" class="arrow" onclick="toggleFolder('11_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
<tr id="row_11_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="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_11_0_1_" 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="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_11_0_2_" 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="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_11_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_1_" class="arrow" onclick="toggleFolder('11_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_11_1_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="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_12_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</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_12_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_12_0_" class="arrow" onclick="toggleFolder('12_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
<tr id="row_12_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="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_13_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
<tr id="row_13_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
<tr id="row_13_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
<tr id="row_14_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_2_"><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">is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_4_"><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">is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></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_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
<tr id="row_15_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_16_"><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_17_" 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_18_"><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_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_20_"><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_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_30_"><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_31_" 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_32_"><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_33_" 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_34_"><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_35_" 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_36_"><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_37_" 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_38_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_39_" 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_40_"><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_41_" 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_42_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_43_" 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_44_"><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_45_" 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_46_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_46_" class="arrow" onclick="toggleFolder('46_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_46_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_47_"><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_48_" 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_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/ded/namespaceprobability.html" target="_self">probability</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> - needed in testing </td></tr>
<tr id="row_10_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_10_0_" class="arrow" onclick="toggleFolder('10_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>windowed_median</b></td><td class="desc"></td></tr>
<tr id="row_10_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="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">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_11_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing" target="_blank">quadratic probing</a> algorithm </td></tr>
<tr id="row_11_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
<tr id="row_12_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_12_0_" class="arrow" onclick="toggleFolder('12_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
<tr id="row_12_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="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_12_0_1_" 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="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_12_0_2_" 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="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_12_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_12_1_" class="arrow" onclick="toggleFolder('12_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_12_1_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="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_13_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</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_13_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_13_0_" class="arrow" onclick="toggleFolder('13_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
<tr id="row_13_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="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_14_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
<tr id="row_14_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
<tr id="row_14_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
<tr id="row_15_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
<tr id="row_15_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_15_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_15_2_"><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">is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_15_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_15_4_"><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">is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_15_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_16_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_16_" class="arrow" onclick="toggleFolder('16_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
<tr id="row_16_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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="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_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="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</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="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_27_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_29_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</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="d8/dc8/struct_point.html" target="_self">Point</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="dd/d1b/structquery.html" target="_self">query</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/da9/classqueue.html" target="_self">queue</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="dc/db5/struct_queue.html" target="_self">Queue</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/d72/class_r_btree.html" target="_self">RBtree</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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</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="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_43_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_44_" 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_45_"><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_46_" 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_47_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_47_" class="arrow" onclick="toggleFolder('47_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_47_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_48_"><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_49_" 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>
</table>
</div><!-- directory -->
</div><!-- contents -->

9
annotated_dup.js
View File

@@ -91,6 +91,11 @@ var annotated_dup =
[ "Stack", "d5/d8a/classothers_1_1postfix__expression_1_1_stack.html", "d5/d8a/classothers_1_1postfix__expression_1_1_stack" ]
] ]
] ],
[ "probability", "d4/ded/namespaceprobability.html", [
[ "windowed_median", null, [
[ "WindowedMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median" ]
] ]
] ],
[ "quadratic_probing", "d4/dd2/namespacequadratic__probing.html", [
[ "Entry", "da/dd1/structquadratic__probing_1_1_entry.html", "da/dd1/structquadratic__probing_1_1_entry" ]
] ],
@@ -137,12 +142,12 @@ 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", "dc/db5/struct_queue.html", null ],
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
[ "Queue", "dc/db5/struct_queue.html", null ],
[ "RBtree", "d8/d72/class_r_btree.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
[ "Solution", "dd/d4f/class_solution.html", null ],

9
classes.html
View File

@@ -93,7 +93,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<div class="headertitle"><div class="title">Class Index</div></div>
</div><!--header-->
<div class="contents">
<div class="qindex"><a class="qindex" href="#letter_A">A</a>&#160;|&#160;<a class="qindex" href="#letter_B">B</a>&#160;|&#160;<a class="qindex" href="#letter_C">C</a>&#160;|&#160;<a class="qindex" href="#letter_D">D</a>&#160;|&#160;<a class="qindex" href="#letter_E">E</a>&#160;|&#160;<a class="qindex" href="#letter_F">F</a>&#160;|&#160;<a class="qindex" href="#letter_G">G</a>&#160;|&#160;<a class="qindex" href="#letter_H">H</a>&#160;|&#160;<a class="qindex" href="#letter_I">I</a>&#160;|&#160;<a class="qindex" href="#letter_L">L</a>&#160;|&#160;<a class="qindex" href="#letter_M">M</a>&#160;|&#160;<a class="qindex" href="#letter_N">N</a>&#160;|&#160;<a class="qindex" href="#letter_P">P</a>&#160;|&#160;<a class="qindex" href="#letter_Q">Q</a>&#160;|&#160;<a class="qindex" href="#letter_R">R</a>&#160;|&#160;<a class="qindex" href="#letter_S">S</a>&#160;|&#160;<a class="qindex" href="#letter_T">T</a>&#160;|&#160;<a class="qindex" href="#letter_U">U</a></div>
<div class="qindex"><a class="qindex" href="#letter_A">A</a>&#160;|&#160;<a class="qindex" href="#letter_B">B</a>&#160;|&#160;<a class="qindex" href="#letter_C">C</a>&#160;|&#160;<a class="qindex" href="#letter_D">D</a>&#160;|&#160;<a class="qindex" href="#letter_E">E</a>&#160;|&#160;<a class="qindex" href="#letter_F">F</a>&#160;|&#160;<a class="qindex" href="#letter_G">G</a>&#160;|&#160;<a class="qindex" href="#letter_H">H</a>&#160;|&#160;<a class="qindex" href="#letter_I">I</a>&#160;|&#160;<a class="qindex" href="#letter_L">L</a>&#160;|&#160;<a class="qindex" href="#letter_M">M</a>&#160;|&#160;<a class="qindex" href="#letter_N">N</a>&#160;|&#160;<a class="qindex" href="#letter_P">P</a>&#160;|&#160;<a class="qindex" href="#letter_Q">Q</a>&#160;|&#160;<a class="qindex" href="#letter_R">R</a>&#160;|&#160;<a class="qindex" href="#letter_S">S</a>&#160;|&#160;<a class="qindex" href="#letter_T">T</a>&#160;|&#160;<a class="qindex" href="#letter_U">U</a>&#160;|&#160;<a class="qindex" href="#letter_W">W</a></div>
<div class="classindex">
<dl class="classindex even">
<dt class="alphachar"><a id="letter_A" name="letter_A">A</a></dt>
@@ -130,13 +130,13 @@ $(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="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="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_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="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="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_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="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>
<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="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="db/da9/classqueue.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>
<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>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_R" name="letter_R">R</a></dt>
<dd><a class="el" href="d8/d72/class_r_btree.html">RBtree</a></dd><dd><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd></dl>
@@ -149,6 +149,9 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_U" name="letter_U">U</a></dt>
<dd><a class="el" href="db/d9a/classuint128__t.html">uint128_t</a></dd><dd><a class="el" href="d1/d83/classuint256__t.html">uint256_t</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_W" name="letter_W">W</a></dt>
<dd><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">WindowedMedian</a> (probability::windowed_median)</dd></dl>
</div>
</div><!-- contents -->
</div><!-- doc-content -->

9
d0/d5b/windowed__median_8cpp__incl.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="probability/windowed_median.cpp" name="probability/windowed_median.cpp">
<area shape="rect" id="node1" title="An implementation of a median calculation of a sliding window along a data stream." alt="" coords="168,5,313,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,95,155,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="179,95,233,121"/>
<area shape="rect" id="node5" title=" " alt="" coords="257,95,296,121"/>
<area shape="rect" id="node6" title=" " alt="" coords="321,95,361,121"/>
<area shape="rect" id="node7" title=" " alt="" coords="385,95,443,121"/>
</map>

1
d0/d5b/windowed__median_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
24dc62dab115bdfc92f51646f0f7582d

113
d0/d5b/windowed__median_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,113 @@
<?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.49.1 (20210923.0004)
-->
<!-- Title: probability/windowed_median.cpp Pages: 1 -->
<svg width="337pt" height="95pt"
viewBox="0.00 0.00 336.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>probability/windowed_median.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 332.5,-91 332.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="An implementation of a median calculation of a sliding window along a data stream.">
<polygon fill="#bfbfbf" stroke="black" points="122,-56.5 122,-86.5 231,-86.5 231,-56.5 122,-56.5"/>
<text text-anchor="start" x="130" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability/windowed</text>
<text text-anchor="middle" x="176.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M140.48,-56.4C114.86,-46.37 80.77,-33.03 56.19,-23.4"/>
<polygon fill="midnightblue" stroke="midnightblue" points="57.21,-20.04 46.62,-19.66 54.65,-26.56 57.21,-20.04"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67,-0.5 67,-19.5 112,-19.5 112,-0.5 67,-0.5"/>
<text text-anchor="middle" x="89.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cstdlib</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="M155.88,-56.4C142.2,-47.04 124.29,-34.79 110.52,-25.38"/>
<polygon fill="midnightblue" stroke="midnightblue" points="112.39,-22.41 102.16,-19.66 108.44,-28.19 112.39,-22.41"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="130.5,-0.5 130.5,-19.5 170.5,-19.5 170.5,-0.5 130.5,-0.5"/>
<text text-anchor="middle" x="150.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">ctime</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="M170.34,-56.4C166.76,-48.2 162.2,-37.78 158.36,-28.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="161.49,-27.42 154.28,-19.66 155.08,-30.22 161.49,-27.42"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="189,-0.5 189,-19.5 218,-19.5 218,-0.5 189,-0.5"/>
<text text-anchor="middle" x="203.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">list</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M182.9,-56.4C186.62,-48.2 191.35,-37.78 195.33,-28.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="198.63,-30.21 199.57,-19.66 192.25,-27.32 198.63,-30.21"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="236.5,-0.5 236.5,-19.5 266.5,-19.5 266.5,-0.5 236.5,-0.5"/>
<text text-anchor="middle" x="251.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">set</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M194.27,-56.4C205.85,-47.22 220.92,-35.26 232.7,-25.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="234.93,-28.61 240.59,-19.66 230.58,-23.13 234.93,-28.61"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="284.5,-0.5 284.5,-19.5 328.5,-19.5 328.5,-0.5 284.5,-0.5"/>
<text text-anchor="middle" x="306.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M207.31,-56.4C228.83,-46.55 257.34,-33.5 278.27,-23.92"/>
<polygon fill="midnightblue" stroke="midnightblue" points="279.95,-27 287.58,-19.66 277.03,-20.64 279.95,-27"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.9 KiB

118
d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html Normal file
View File

@@ -0,0 +1,118 @@
<!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.2"/>
<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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<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.2 -->
<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('df/d34/classprobability_1_1windowed__median_1_1_windowed_median.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">probability::windowed_median::WindowedMedian Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a></td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a></td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a></td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">_windowSize</a></td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">eraseFromSorted</a>(int value)</td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">getMedian</a>() const</td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">getMedianNaive</a>() const</td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">insert</a>(int value)</td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">insertToSorted</a>(int value)</td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d">WindowedMedian</a>(size_type windowSize)</td><td class="entry"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></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.2 </li>
</ul>
</div>
</body>
</html>

325
d1/ded/windowed__median_8cpp.html Normal file
View File

@@ -0,0 +1,325 @@
<!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.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: probability/windowed_median.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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<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.2 -->
<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('d1/ded/windowed__median_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="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">windowed_median.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>An implementation of a median calculation of a sliding window along a data stream.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cstdlib&gt;</code><br />
<code>#include &lt;ctime&gt;</code><br />
<code>#include &lt;list&gt;</code><br />
<code>#include &lt;set&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for windowed_median.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d0/d5b/windowed__median_8cpp__incl.svg" width="450" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><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">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A class to calculate the median of a leading sliding window at the back of a stream of integer values. <a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#details">More...</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="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:d4/ded/namespaceprobability"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/ded/namespaceprobability.html">probability</a></td></tr>
<tr class="memdesc:d4/ded/namespaceprobability"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> - needed in testing <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:dd/d21/namespacewindowed__median"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d21/namespacewindowed__median.html">windowed_median</a></td></tr>
<tr class="memdesc:dd/d21/namespacewindowed__median"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the Windowed Median algorithm implementation. <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="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:aa9dca002d7dfbcaaa68183677a5f0342"><td class="memItemLeft" align="right" valign="top"><a id="aa9dca002d7dfbcaaa68183677a5f0342" name="aa9dca002d7dfbcaaa68183677a5f0342"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>probability::windowed_median::Window</b> = <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a>&lt; int &gt;</td></tr>
<tr class="separator:aa9dca002d7dfbcaaa68183677a5f0342"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab5db7d07b43777564ad898d1f8622149"><td class="memItemLeft" align="right" valign="top"><a id="ab5db7d07b43777564ad898d1f8622149" name="ab5db7d07b43777564ad898d1f8622149"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>probability::windowed_median::size_type</b> = Window::size_type</td></tr>
<tr class="separator:ab5db7d07b43777564ad898d1f8622149"><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:a6dc652a36ea42ba262c4e4236e3e6601"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;vals, int windowSize)</td></tr>
<tr class="memdesc:a6dc652a36ea42ba262c4e4236e3e6601"><td class="mdescLeft">&#160;</td><td class="mdescRight">namespace probability <a href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">More...</a><br /></td></tr>
<tr class="separator:a6dc652a36ea42ba262c4e4236e3e6601"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac0f2228420376f4db7e1274f2b41667c"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c">main</a> (int argc, const char *argv[])</td></tr>
<tr class="memdesc:ac0f2228420376f4db7e1274f2b41667c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c">More...</a><br /></td></tr>
<tr class="separator:ac0f2228420376f4db7e1274f2b41667c"><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 >An implementation of a median calculation of a sliding window along a data stream. </p>
<p >Given a stream of integers, the algorithm calculates the median of a fixed size window at the back of the stream. The leading time complexity of this algorithm is O(log(N), and it is inspired by the known algorithm to [find median from (infinite) data stream](<a href="https://www.tutorialcup.com/interview/algorithm/find-median-from-data-stream.htm">https://www.tutorialcup.com/interview/algorithm/find-median-from-data-stream.htm</a>), with the proper modifications to account for the finite window size for which the median is requested</p>
<h3><a class="anchor" id="autotoc_md90"></a>
Algorithm</h3>
<p >The sliding window is managed by a list, which guarantees O(1) for both pushing and popping. Each new value is pushed to the window back, while a value from the front of the window is popped. In addition, the algorithm manages a multi-value binary search tree (BST), implemented by <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>. For each new value that is inserted into the window, it is also inserted to the BST. When a value is popped from the window, it is also erased from the BST. Both insertion and erasion to/from the BST are O(logN) in time, with N the size of the window. Finally, the algorithm keeps a pointer to the root of the BST, and updates its position whenever values are inserted or erased to/from BST. The root of the tree is the median! Hence, median retrieval is always O(1)</p>
<p >Time complexity: O(logN). Space complexity: O(N). N - size of window </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/YanivHollander" target="_blank">Yaniv Hollander</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ac0f2228420376f4db7e1274f2b41667c" name="ac0f2228420376f4db7e1274f2b41667c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac0f2228420376f4db7e1274f2b41667c">&#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">const 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>command line argument count (ignored) </td></tr>
<tr><td class="paramname">argv</td><td>command line array of arguments (ignored) </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p >A few fixed test cases</p>
<p >Array of sorted values; odd window size</p>
<p >Array of sorted values - decreasing; odd window size</p>
<p >Even window size</p>
<p >Array with repeating values</p>
<p >Array with same values except one</p>
<p >Array that includes repeating values including negatives</p>
<p >Array with large values - sum of few pairs exceeds MAX_INT. Window size is even - testing calculation of average median between two middle values</p>
<p >Random test cases</p>
<p >Array size in the range [5, 20]</p>
<p >Window size in the range [3, 10]</p>
<p >Random array values (positive/negative)</p>
<p >Testing randomized test</p>
<div class="fragment"><div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> {</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <span class="comment"></span></div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span><span class="comment"> /// A few fixed test cases</span></div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span><span class="comment"></span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a>({1, 2, 3, 4, 5, 6, 7, 8, 9}, 3); <span class="comment">/// Array of sorted values; odd window size</span></div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a>({9, 8, 7, 6, 5, 4, 3, 2, 1}, 3); <span class="comment">/// Array of sorted values - decreasing; odd window size</span></div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a>({9, 8, 7, 6, 5, 4, 5, 6}, 4); <span class="comment">/// Even window size</span></div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a>({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3); <span class="comment">/// Array with repeating values</span></div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a>({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3); <span class="comment">/// Array with same values except one</span></div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a>({4, 3, 3, -5, -5, 1, 3, 4, 5}, 5); <span class="comment">/// Array that includes repeating values including negatives</span></div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment"></span></div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span><span class="comment"> /// Array with large values - sum of few pairs exceeds MAX_INT. Window size is even - testing calculation of</span></div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span><span class="comment"> /// average median between two middle values</span></div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span><span class="comment"></span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a>({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> 1115438165, 1784484492, 74243042, 114807987}, 6);</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment"></span></div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span><span class="comment"> /// Random test cases</span></div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span><span class="comment"></span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a>(<span class="keyword">static_cast&lt;</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">&gt;</span>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a>(<span class="keyword">nullptr</span>)));</div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int&gt;</a> vals;</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 8; i &lt; 100; i++) {</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keyword">const</span> <span class="keyword">auto</span> n = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() / ((RAND_MAX + 5u) / 20); <span class="comment">/// Array size in the range [5, 20]</span></div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keyword">auto</span> windowSize = 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a>() / ((RAND_MAX + 3u) / 10); <span class="comment">/// Window size in the range [3, 10]</span></div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> vals.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/clear.html">clear</a>();</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> vals.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">reserve</a>(n);</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; i++) {</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> vals.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">rand</a>() - RAND_MAX); <span class="comment">/// Random array values (positive/negative)</span></div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> }</div>
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <a class="code hl_function" href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a>(vals, windowSize); <span class="comment">/// Testing randomized test</span></div>
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> }</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span>}</div>
<div class="ttc" id="aclear_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/clear.html">std::vector::clear</a></div><div class="ttdeci">T clear(T... args)</div></div>
<div class="ttc" id="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="areserve_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/reserve.html">std::vector::reserve</a></div><div class="ttdeci">T reserve(T... args)</div></div>
<div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
<div class="ttc" id="atime_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a></div><div class="ttdeci">T time(T... args)</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
<div class="ttc" id="awindowed__median_8cpp_html_a6dc652a36ea42ba262c4e4236e3e6601"><div class="ttname"><a href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601">test</a></div><div class="ttdeci">static void test(const std::vector&lt; int &gt; &amp;vals, int windowSize)</div><div class="ttdoc">namespace probability</div><div class="ttdef"><b>Definition:</b> windowed_median.cpp:181</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg" width="100%" height="600"><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>
<a id="a6dc652a36ea42ba262c4e4236e3e6601" name="a6dc652a36ea42ba262c4e4236e3e6601"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6dc652a36ea42ba262c4e4236e3e6601">&#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="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;&#160;</td>
<td class="paramname"><em>vals</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>windowSize</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>namespace probability </p>
<p >Self-test implementations </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">vals</td><td>Stream of values </td></tr>
<tr><td class="paramname">windowSize</td><td>Size of sliding window </td></tr>
</table>
</dd>
</dl>
<p >Comparing medians: efficient function vs. Naive one</p>
<div class="fragment"><div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> {</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <a class="code hl_class" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a> windowedMedian(windowSize);</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> val : vals) {</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> windowedMedian.insert(val);</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span><span class="comment"></span> </div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span><span class="comment"> /// Comparing medians: efficient function vs. Naive one</span></div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span><span class="comment"></span> assert(windowedMedian.getMedian() == windowedMedian.getMedianNaive());</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> }</div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span>}</div>
<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">probability::windowed_median::WindowedMedian</a></div><div class="ttdoc">A class to calculate the median of a leading sliding window at the back of a stream of integer values...</div><div class="ttdef"><b>Definition:</b> windowed_median.cpp:56</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="../../d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.svg" width="524" height="436"><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_82e494173a87936756866de2fa774307.html">probability</a></li><li class="navelem"><a class="el" href="../../d1/ded/windowed__median_8cpp.html">windowed_median.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.2 </li>
</ul>
</div>
</body>
</html>

6
d1/ded/windowed__median_8cpp.js Normal file
View File

@@ -0,0 +1,6 @@
var windowed__median_8cpp =
[
[ "probability::windowed_median::WindowedMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median" ],
[ "main", "d1/ded/windowed__median_8cpp.html#ac0f2228420376f4db7e1274f2b41667c", null ],
[ "test", "d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601", null ]
];

13
d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.map Normal file
View File

@@ -0,0 +1,13 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="namespace probability" alt="" coords="5,100,49,127"/>
<area shape="rect" id="node2" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d" title="Gets the median of the values in the sliding window." alt="" coords="97,5,284,61"/>
<area shape="rect" id="node3" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6" title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!" alt="" coords="97,85,284,141"/>
<area shape="rect" id="node5" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7" title="Insert a new value to the stream." alt="" coords="97,223,284,279"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/sort.html#" title=" " alt="" coords="379,41,472,68"/>
<area shape="rect" id="node6" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" title="Erases a value from a sorted multi&#45;value BST." alt="" coords="332,92,519,148"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/front.html#" title=" " alt="" coords="377,172,474,199"/>
<area shape="rect" id="node8" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" title="Inserts a value to a sorted multi&#45;value BST." alt="" coords="332,223,519,279"/>
<area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_front.html#" title=" " alt="" coords="362,303,489,329"/>
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_back.html#" title=" " alt="" coords="357,353,493,380"/>
<area shape="rect" id="node11" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="378,404,473,431"/>
</map>

1
d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
af3ecd3d6ea1f430112ad540bab9e020

182
d1/ded/windowed__median_8cpp_a6dc652a36ea42ba262c4e4236e3e6601_cgraph.svg Normal file
View File

@@ -0,0 +1,182 @@
<?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.49.1 (20210923.0004)
-->
<!-- Title: test Pages: 1 -->
<svg width="393pt" height="327pt"
viewBox="0.00 0.00 393.00 327.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 323)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-323 389,-323 389,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="namespace probability">
<polygon fill="#bfbfbf" stroke="black" points="0,-228.5 0,-247.5 33,-247.5 33,-228.5 0,-228.5"/>
<text text-anchor="middle" x="16.5" y="-235.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="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d" target="_top" xlink:title="Gets the median of the values in the sliding window.">
<polygon fill="white" stroke="black" points="69,-277.5 69,-318.5 209,-318.5 209,-277.5 69,-277.5"/>
<text text-anchor="start" x="77" y="-306.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="77" y="-295.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="139" y="-284.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedian</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.01,-247.68C43.1,-253.81 56.63,-261.74 69,-268 72.34,-269.69 75.8,-271.38 79.31,-273.05"/>
<polygon fill="midnightblue" stroke="midnightblue" points="78.13,-276.36 88.67,-277.39 81.07,-270.01 78.13,-276.36"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6" target="_top" xlink:title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!">
<polygon fill="white" stroke="black" points="69,-217.5 69,-258.5 209,-258.5 209,-217.5 69,-217.5"/>
<text text-anchor="start" x="77" y="-246.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="77" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="139" y="-224.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedianNaive</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.25,-238C40.26,-238 49.08,-238 58.62,-238"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.77,-241.5 68.77,-238 58.77,-234.5 58.77,-241.5"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7" target="_top" xlink:title="Insert a new value to the stream.">
<polygon fill="white" stroke="black" points="69,-114.5 69,-155.5 209,-155.5 209,-114.5 69,-114.5"/>
<text text-anchor="start" x="77" y="-143.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="77" y="-132.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="139" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M28.62,-228.49C46.04,-213.6 80.43,-184.21 106.02,-162.33"/>
<polygon fill="midnightblue" stroke="midnightblue" points="108.32,-164.97 113.65,-155.81 103.78,-159.65 108.32,-164.97"/>
</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/list/sort.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="280,-272.5 280,-291.5 350,-291.5 350,-272.5 280,-272.5"/>
<text text-anchor="middle" x="315" y="-279.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::sort</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M209.02,-255.45C229.51,-260.64 251.4,-266.17 269.86,-270.84"/>
<polygon fill="midnightblue" stroke="midnightblue" points="269.17,-274.27 279.73,-273.33 270.89,-267.49 269.17,-274.27"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" target="_top" xlink:title="Erases a value from a sorted multi&#45;value BST.">
<polygon fill="white" stroke="black" points="245,-212.5 245,-253.5 385,-253.5 385,-212.5 245,-212.5"/>
<text text-anchor="start" x="253" y="-241.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="253" y="-230.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="315" y="-219.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M169.08,-155.68C189.73,-169.91 218.4,-188.73 245,-203 248.24,-204.74 251.6,-206.46 255.02,-208.14"/>
<polygon fill="midnightblue" stroke="midnightblue" points="253.62,-211.35 264.16,-212.5 256.64,-205.03 253.62,-211.35"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="278.5,-174.5 278.5,-193.5 351.5,-193.5 351.5,-174.5 278.5,-174.5"/>
<text text-anchor="middle" x="315" y="-181.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M209.16,-154.86C221.11,-158.26 233.41,-161.75 245,-165 252.91,-167.22 261.34,-169.56 269.49,-171.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="268.66,-175.21 279.23,-174.5 270.52,-168.47 268.66,-175.21"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" target="_top" xlink:title="Inserts a value to a sorted multi&#45;value BST.">
<polygon fill="white" stroke="black" points="245,-114.5 245,-155.5 385,-155.5 385,-114.5 245,-114.5"/>
<text text-anchor="start" x="253" y="-143.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="253" y="-132.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="315" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node5&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M209.02,-135C217.48,-135 226.17,-135 234.76,-135"/>
<polygon fill="midnightblue" stroke="midnightblue" points="234.78,-138.5 244.78,-135 234.78,-131.5 234.78,-138.5"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="267.5,-76.5 267.5,-95.5 362.5,-95.5 362.5,-76.5 267.5,-76.5"/>
<text text-anchor="middle" x="315" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node5&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M209.16,-115.14C221.11,-111.74 233.41,-108.25 245,-105 252.91,-102.78 261.34,-100.44 269.49,-98.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="270.52,-101.53 279.23,-95.5 268.66,-94.79 270.52,-101.53"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="264,-38.5 264,-57.5 366,-57.5 366,-38.5 264,-38.5"/>
<text text-anchor="middle" x="315" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node10 -->
<g id="edge9" class="edge">
<title>Node5&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M166.75,-114.38C187.22,-99.44 216.66,-79.71 245,-67 250.3,-64.62 255.97,-62.48 261.69,-60.56"/>
<polygon fill="midnightblue" stroke="midnightblue" points="262.82,-63.88 271.32,-57.55 260.73,-57.2 262.82,-63.88"/>
</g>
<!-- Node11 -->
<g id="node11" class="node">
<title>Node11</title>
<g id="a_node11"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="279.5,-0.5 279.5,-19.5 350.5,-19.5 350.5,-0.5 279.5,-0.5"/>
<text text-anchor="middle" x="315" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node11 -->
<g id="edge10" class="edge">
<title>Node5&#45;&gt;Node11</title>
<path fill="none" stroke="midnightblue" d="M155.05,-114.25C173.56,-90.22 207.22,-51.11 245,-29 252.48,-24.63 261,-21.22 269.44,-18.59"/>
<polygon fill="midnightblue" stroke="midnightblue" points="270.57,-21.91 279.25,-15.84 268.68,-15.17 270.57,-21.91"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 10 KiB

20
d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.map Normal file
View File

@@ -0,0 +1,20 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,157,56,184"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/clear.html#" title=" " alt="" coords="122,5,242,32"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="104,56,260,83"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/rand.html#" title=" " alt="" coords="145,107,219,133"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/reserve.html#" title=" " alt="" coords="114,157,250,184"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/numeric/random/srand.html#" title=" " alt="" coords="142,208,222,235"/>
<area shape="rect" id="node7" href="$d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601" title="namespace probability" alt="" coords="160,259,204,285"/>
<area shape="rect" id="node18" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/chrono/c/time.html#" title=" " alt="" coords="146,309,218,336"/>
<area shape="rect" id="node8" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d" title="Gets the median of the values in the sliding window." alt="" coords="308,164,495,220"/>
<area shape="rect" id="node9" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6" title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!" alt="" coords="308,244,495,300"/>
<area shape="rect" id="node11" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7" title="Insert a new value to the stream." alt="" coords="308,381,495,437"/>
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/sort.html#" title=" " alt="" coords="589,200,683,227"/>
<area shape="rect" id="node12" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" title="Erases a value from a sorted multi&#45;value BST." alt="" coords="543,251,729,307"/>
<area shape="rect" id="node13" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/front.html#" title=" " alt="" coords="587,331,685,357"/>
<area shape="rect" id="node14" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" title="Inserts a value to a sorted multi&#45;value BST." alt="" coords="543,381,729,437"/>
<area shape="rect" id="node15" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_front.html#" title=" " alt="" coords="573,461,699,488"/>
<area shape="rect" id="node16" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_back.html#" title=" " alt="" coords="568,512,704,539"/>
<area shape="rect" id="node17" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="589,563,683,589"/>
</map>

1
d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
3a15537f7782af1ae7db25b318481ec4

375
d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph.svg Normal file
View File

@@ -0,0 +1,375 @@
<?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.49.1 (20210923.0004)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 446 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="text/javascript"><![CDATA[
var edges = document.getElementsByTagName('g');
if (edges && edges.length) {
for (var i=0;i<edges.length;i++) {
if (edges[i].id.substr(0,4)=='edge') {
edges[i].setAttribute('class','edge');
}
}
}
]]></script>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
</use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
</use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="dirArrow">
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040">
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
</use>
</g>
</defs>
<script type="text/javascript">
var viewWidth = 551;
var viewHeight = 446;
var sectionId = 'dynsection-1';
</script>
<script xlink:href="../../svgpan.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-442 547,-442 547,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,-304.5 0,-323.5 38,-323.5 38,-304.5 0,-304.5"/>
<text text-anchor="middle" x="19" y="-311.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 target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="87.5,-418.5 87.5,-437.5 177.5,-437.5 177.5,-418.5 87.5,-418.5"/>
<text text-anchor="middle" x="132.5" y="-425.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</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="M22.86,-323.62C29.03,-342.7 45.39,-385.55 74,-409 76.06,-410.69 78.28,-412.23 80.61,-413.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="79.48,-417 89.98,-418.42 82.66,-410.76 79.48,-417"/>
</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/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="74,-380.5 74,-399.5 191,-399.5 191,-380.5 74,-380.5"/>
<text text-anchor="middle" x="132.5" y="-387.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</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="M26.91,-323.88C36.23,-336.52 53.98,-358.28 74,-371 77.16,-373.01 80.55,-374.82 84.05,-376.46"/>
<polygon fill="midnightblue" stroke="midnightblue" points="82.9,-379.77 93.48,-380.4 85.6,-373.31 82.9,-379.77"/>
</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/numeric/random/rand.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="105,-342.5 105,-361.5 160,-361.5 160,-342.5 105,-342.5"/>
<text text-anchor="middle" x="132.5" y="-349.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</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="M38.46,-320.6C48.88,-324.29 62.15,-328.96 74,-333 80.75,-335.3 87.97,-337.72 94.92,-340.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="94.25,-343.49 104.84,-343.31 96.44,-336.85 94.25,-343.49"/>
</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/reserve.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="81.5,-304.5 81.5,-323.5 183.5,-323.5 183.5,-304.5 81.5,-304.5"/>
<text text-anchor="middle" x="132.5" y="-311.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M38.41,-314C47.59,-314 59.28,-314 71.24,-314"/>
<polygon fill="midnightblue" stroke="midnightblue" points="71.3,-317.5 81.3,-314 71.3,-310.5 71.3,-317.5"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="102.5,-266.5 102.5,-285.5 162.5,-285.5 162.5,-266.5 102.5,-266.5"/>
<text text-anchor="middle" x="132.5" y="-273.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M38.46,-307.4C48.88,-303.71 62.15,-299.04 74,-295 80.01,-292.95 86.38,-290.81 92.61,-288.74"/>
<polygon fill="midnightblue" stroke="midnightblue" points="93.82,-292.02 102.21,-285.56 91.62,-285.38 93.82,-292.02"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601" target="_top" xlink:title="namespace probability">
<polygon fill="white" stroke="black" points="116,-228.5 116,-247.5 149,-247.5 149,-228.5 116,-228.5"/>
<text text-anchor="middle" x="132.5" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M26.91,-304.12C36.23,-291.48 53.98,-269.72 74,-257 83.72,-250.83 95.64,-246.46 106.11,-243.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="107.14,-246.83 115.95,-240.95 105.4,-240.05 107.14,-246.83"/>
</g>
<!-- Node18 -->
<g id="node18" class="node">
<title>Node18</title>
<g id="a_node18"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="105.5,-190.5 105.5,-209.5 159.5,-209.5 159.5,-190.5 105.5,-190.5"/>
<text text-anchor="middle" x="132.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node18 -->
<g id="edge17" class="edge">
<title>Node1&#45;&gt;Node18</title>
<path fill="none" stroke="midnightblue" d="M22.86,-304.38C29.03,-285.3 45.39,-242.45 74,-219 80.29,-213.85 88.03,-210.07 95.76,-207.31"/>
<polygon fill="midnightblue" stroke="midnightblue" points="96.92,-210.62 105.45,-204.34 94.87,-203.93 96.92,-210.62"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d" target="_top" xlink:title="Gets the median of the values in the sliding window.">
<polygon fill="white" stroke="black" points="227,-277.5 227,-318.5 367,-318.5 367,-277.5 227,-277.5"/>
<text text-anchor="start" x="235" y="-306.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="235" y="-295.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="297" y="-284.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedian</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node7&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M149.2,-242.94C160.8,-246.65 176.95,-251.94 191,-257 205.5,-262.22 221.01,-268.11 235.55,-273.76"/>
<polygon fill="midnightblue" stroke="midnightblue" points="234.35,-277.05 244.94,-277.43 236.9,-270.53 234.35,-277.05"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6" target="_top" xlink:title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!">
<polygon fill="white" stroke="black" points="227,-217.5 227,-258.5 367,-258.5 367,-217.5 227,-217.5"/>
<text text-anchor="start" x="235" y="-246.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="235" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="297" y="-224.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedianNaive</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node7&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M149.08,-238C165,-238 190.97,-238 216.67,-238"/>
<polygon fill="midnightblue" stroke="midnightblue" points="216.87,-241.5 226.87,-238 216.87,-234.5 216.87,-241.5"/>
</g>
<!-- Node11 -->
<g id="node11" class="node">
<title>Node11</title>
<g id="a_node11"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7" target="_top" xlink:title="Insert a new value to the stream.">
<polygon fill="white" stroke="black" points="227,-114.5 227,-155.5 367,-155.5 367,-114.5 227,-114.5"/>
<text text-anchor="start" x="235" y="-143.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="235" y="-132.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="297" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node11 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node11</title>
<path fill="none" stroke="midnightblue" d="M149.25,-234.42C161.16,-231.33 177.69,-226.22 191,-219 219.08,-203.77 247.14,-180.82 267.18,-162.76"/>
<polygon fill="midnightblue" stroke="midnightblue" points="269.71,-165.19 274.72,-155.85 264.98,-160.03 269.71,-165.19"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/sort.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="438,-272.5 438,-291.5 508,-291.5 508,-272.5 438,-272.5"/>
<text text-anchor="middle" x="473" y="-279.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::sort</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node10 -->
<g id="edge9" class="edge">
<title>Node9&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M367.02,-255.45C387.51,-260.64 409.4,-266.17 427.86,-270.84"/>
<polygon fill="midnightblue" stroke="midnightblue" points="427.17,-274.27 437.73,-273.33 428.89,-267.49 427.17,-274.27"/>
</g>
<!-- Node12 -->
<g id="node12" class="node">
<title>Node12</title>
<g id="a_node12"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" target="_top" xlink:title="Erases a value from a sorted multi&#45;value BST.">
<polygon fill="white" stroke="black" points="403,-212.5 403,-253.5 543,-253.5 543,-212.5 403,-212.5"/>
<text text-anchor="start" x="411" y="-241.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="411" y="-230.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="473" y="-219.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node12 -->
<g id="edge11" class="edge">
<title>Node11&#45;&gt;Node12</title>
<path fill="none" stroke="midnightblue" d="M327.08,-155.68C347.73,-169.91 376.4,-188.73 403,-203 406.24,-204.74 409.6,-206.46 413.02,-208.14"/>
<polygon fill="midnightblue" stroke="midnightblue" points="411.62,-211.35 422.16,-212.5 414.64,-205.03 411.62,-211.35"/>
</g>
<!-- Node13 -->
<g id="node13" class="node">
<title>Node13</title>
<g id="a_node13"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="436.5,-174.5 436.5,-193.5 509.5,-193.5 509.5,-174.5 436.5,-174.5"/>
<text text-anchor="middle" x="473" y="-181.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node13 -->
<g id="edge12" class="edge">
<title>Node11&#45;&gt;Node13</title>
<path fill="none" stroke="midnightblue" d="M367.16,-154.86C379.11,-158.26 391.41,-161.75 403,-165 410.91,-167.22 419.34,-169.56 427.49,-171.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="426.66,-175.21 437.23,-174.5 428.52,-168.47 426.66,-175.21"/>
</g>
<!-- Node14 -->
<g id="node14" class="node">
<title>Node14</title>
<g id="a_node14"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" target="_top" xlink:title="Inserts a value to a sorted multi&#45;value BST.">
<polygon fill="white" stroke="black" points="403,-114.5 403,-155.5 543,-155.5 543,-114.5 403,-114.5"/>
<text text-anchor="start" x="411" y="-143.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="411" y="-132.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="473" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node14 -->
<g id="edge13" class="edge">
<title>Node11&#45;&gt;Node14</title>
<path fill="none" stroke="midnightblue" d="M367.02,-135C375.48,-135 384.17,-135 392.76,-135"/>
<polygon fill="midnightblue" stroke="midnightblue" points="392.78,-138.5 402.78,-135 392.78,-131.5 392.78,-138.5"/>
</g>
<!-- Node15 -->
<g id="node15" class="node">
<title>Node15</title>
<g id="a_node15"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="425.5,-76.5 425.5,-95.5 520.5,-95.5 520.5,-76.5 425.5,-76.5"/>
<text text-anchor="middle" x="473" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node15 -->
<g id="edge14" class="edge">
<title>Node11&#45;&gt;Node15</title>
<path fill="none" stroke="midnightblue" d="M367.16,-115.14C379.11,-111.74 391.41,-108.25 403,-105 410.91,-102.78 419.34,-100.44 427.49,-98.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="428.52,-101.53 437.23,-95.5 426.66,-94.79 428.52,-101.53"/>
</g>
<!-- Node16 -->
<g id="node16" class="node">
<title>Node16</title>
<g id="a_node16"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="422,-38.5 422,-57.5 524,-57.5 524,-38.5 422,-38.5"/>
<text text-anchor="middle" x="473" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node16 -->
<g id="edge15" class="edge">
<title>Node11&#45;&gt;Node16</title>
<path fill="none" stroke="midnightblue" d="M324.75,-114.38C345.22,-99.44 374.66,-79.71 403,-67 408.3,-64.62 413.97,-62.48 419.69,-60.56"/>
<polygon fill="midnightblue" stroke="midnightblue" points="420.82,-63.88 429.32,-57.55 418.73,-57.2 420.82,-63.88"/>
</g>
<!-- Node17 -->
<g id="node17" class="node">
<title>Node17</title>
<g id="a_node17"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="437.5,-0.5 437.5,-19.5 508.5,-19.5 508.5,-0.5 437.5,-0.5"/>
<text text-anchor="middle" x="473" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node17 -->
<g id="edge16" class="edge">
<title>Node11&#45;&gt;Node17</title>
<path fill="none" stroke="midnightblue" d="M313.05,-114.25C331.56,-90.22 365.22,-51.11 403,-29 410.48,-24.63 419,-21.22 427.44,-18.59"/>
<polygon fill="midnightblue" stroke="midnightblue" points="428.57,-21.91 437.25,-15.84 426.68,-15.17 428.57,-21.91"/>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 21 KiB

287
d1/ded/windowed__median_8cpp_ac0f2228420376f4db7e1274f2b41667c_cgraph_org.svg Normal file
View File

@@ -0,0 +1,287 @@
<?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.49.1 (20210923.0004)
-->
<!-- Title: main Pages: 1 -->
<svg width="551pt" height="446pt"
viewBox="0.00 0.00 551.00 446.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 442)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-442 547,-442 547,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,-304.5 0,-323.5 38,-323.5 38,-304.5 0,-304.5"/>
<text text-anchor="middle" x="19" y="-311.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 target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/clear.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="87.5,-418.5 87.5,-437.5 177.5,-437.5 177.5,-418.5 87.5,-418.5"/>
<text text-anchor="middle" x="132.5" y="-425.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::clear</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="M22.86,-323.62C29.03,-342.7 45.39,-385.55 74,-409 76.06,-410.69 78.28,-412.23 80.61,-413.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="79.48,-417 89.98,-418.42 82.66,-410.76 79.48,-417"/>
</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/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="74,-380.5 74,-399.5 191,-399.5 191,-380.5 74,-380.5"/>
<text text-anchor="middle" x="132.5" y="-387.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</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="M26.91,-323.88C36.23,-336.52 53.98,-358.28 74,-371 77.16,-373.01 80.55,-374.82 84.05,-376.46"/>
<polygon fill="midnightblue" stroke="midnightblue" points="82.9,-379.77 93.48,-380.4 85.6,-373.31 82.9,-379.77"/>
</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/numeric/random/rand.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="105,-342.5 105,-361.5 160,-361.5 160,-342.5 105,-342.5"/>
<text text-anchor="middle" x="132.5" y="-349.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::rand</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="M38.46,-320.6C48.88,-324.29 62.15,-328.96 74,-333 80.75,-335.3 87.97,-337.72 94.92,-340.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="94.25,-343.49 104.84,-343.31 96.44,-336.85 94.25,-343.49"/>
</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/reserve.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="81.5,-304.5 81.5,-323.5 183.5,-323.5 183.5,-304.5 81.5,-304.5"/>
<text text-anchor="middle" x="132.5" y="-311.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::reserve</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M38.41,-314C47.59,-314 59.28,-314 71.24,-314"/>
<polygon fill="midnightblue" stroke="midnightblue" points="71.3,-317.5 81.3,-314 71.3,-310.5 71.3,-317.5"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/numeric/random/srand.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="102.5,-266.5 102.5,-285.5 162.5,-285.5 162.5,-266.5 102.5,-266.5"/>
<text text-anchor="middle" x="132.5" y="-273.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::srand</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M38.46,-307.4C48.88,-303.71 62.15,-299.04 74,-295 80.01,-292.95 86.38,-290.81 92.61,-288.74"/>
<polygon fill="midnightblue" stroke="midnightblue" points="93.82,-292.02 102.21,-285.56 91.62,-285.38 93.82,-292.02"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../d1/ded/windowed__median_8cpp.html#a6dc652a36ea42ba262c4e4236e3e6601" target="_top" xlink:title="namespace probability">
<polygon fill="white" stroke="black" points="116,-228.5 116,-247.5 149,-247.5 149,-228.5 116,-228.5"/>
<text text-anchor="middle" x="132.5" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M26.91,-304.12C36.23,-291.48 53.98,-269.72 74,-257 83.72,-250.83 95.64,-246.46 106.11,-243.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="107.14,-246.83 115.95,-240.95 105.4,-240.05 107.14,-246.83"/>
</g>
<!-- Node18 -->
<g id="node18" class="node">
<title>Node18</title>
<g id="a_node18"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/chrono/c/time.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="105.5,-190.5 105.5,-209.5 159.5,-209.5 159.5,-190.5 105.5,-190.5"/>
<text text-anchor="middle" x="132.5" y="-197.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::time</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node18 -->
<g id="edge17" class="edge">
<title>Node1&#45;&gt;Node18</title>
<path fill="none" stroke="midnightblue" d="M22.86,-304.38C29.03,-285.3 45.39,-242.45 74,-219 80.29,-213.85 88.03,-210.07 95.76,-207.31"/>
<polygon fill="midnightblue" stroke="midnightblue" points="96.92,-210.62 105.45,-204.34 94.87,-203.93 96.92,-210.62"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d" target="_top" xlink:title="Gets the median of the values in the sliding window.">
<polygon fill="white" stroke="black" points="227,-277.5 227,-318.5 367,-318.5 367,-277.5 227,-277.5"/>
<text text-anchor="start" x="235" y="-306.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="235" y="-295.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="297" y="-284.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedian</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge7" class="edge">
<title>Node7&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M149.2,-242.94C160.8,-246.65 176.95,-251.94 191,-257 205.5,-262.22 221.01,-268.11 235.55,-273.76"/>
<polygon fill="midnightblue" stroke="midnightblue" points="234.35,-277.05 244.94,-277.43 236.9,-270.53 234.35,-277.05"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6" target="_top" xlink:title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!">
<polygon fill="white" stroke="black" points="227,-217.5 227,-258.5 367,-258.5 367,-217.5 227,-217.5"/>
<text text-anchor="start" x="235" y="-246.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="235" y="-235.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="297" y="-224.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedianNaive</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node9 -->
<g id="edge8" class="edge">
<title>Node7&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M149.08,-238C165,-238 190.97,-238 216.67,-238"/>
<polygon fill="midnightblue" stroke="midnightblue" points="216.87,-241.5 226.87,-238 216.87,-234.5 216.87,-241.5"/>
</g>
<!-- Node11 -->
<g id="node11" class="node">
<title>Node11</title>
<g id="a_node11"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7" target="_top" xlink:title="Insert a new value to the stream.">
<polygon fill="white" stroke="black" points="227,-114.5 227,-155.5 367,-155.5 367,-114.5 227,-114.5"/>
<text text-anchor="start" x="235" y="-143.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="235" y="-132.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="297" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node11 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node11</title>
<path fill="none" stroke="midnightblue" d="M149.25,-234.42C161.16,-231.33 177.69,-226.22 191,-219 219.08,-203.77 247.14,-180.82 267.18,-162.76"/>
<polygon fill="midnightblue" stroke="midnightblue" points="269.71,-165.19 274.72,-155.85 264.98,-160.03 269.71,-165.19"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/sort.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="438,-272.5 438,-291.5 508,-291.5 508,-272.5 438,-272.5"/>
<text text-anchor="middle" x="473" y="-279.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::sort</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node10 -->
<g id="edge9" class="edge">
<title>Node9&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M367.02,-255.45C387.51,-260.64 409.4,-266.17 427.86,-270.84"/>
<polygon fill="midnightblue" stroke="midnightblue" points="427.17,-274.27 437.73,-273.33 428.89,-267.49 427.17,-274.27"/>
</g>
<!-- Node12 -->
<g id="node12" class="node">
<title>Node12</title>
<g id="a_node12"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" target="_top" xlink:title="Erases a value from a sorted multi&#45;value BST.">
<polygon fill="white" stroke="black" points="403,-212.5 403,-253.5 543,-253.5 543,-212.5 403,-212.5"/>
<text text-anchor="start" x="411" y="-241.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="411" y="-230.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="473" y="-219.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node12 -->
<g id="edge11" class="edge">
<title>Node11&#45;&gt;Node12</title>
<path fill="none" stroke="midnightblue" d="M327.08,-155.68C347.73,-169.91 376.4,-188.73 403,-203 406.24,-204.74 409.6,-206.46 413.02,-208.14"/>
<polygon fill="midnightblue" stroke="midnightblue" points="411.62,-211.35 422.16,-212.5 414.64,-205.03 411.62,-211.35"/>
</g>
<!-- Node13 -->
<g id="node13" class="node">
<title>Node13</title>
<g id="a_node13"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/front.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="436.5,-174.5 436.5,-193.5 509.5,-193.5 509.5,-174.5 436.5,-174.5"/>
<text text-anchor="middle" x="473" y="-181.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node13 -->
<g id="edge12" class="edge">
<title>Node11&#45;&gt;Node13</title>
<path fill="none" stroke="midnightblue" d="M367.16,-154.86C379.11,-158.26 391.41,-161.75 403,-165 410.91,-167.22 419.34,-169.56 427.49,-171.81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="426.66,-175.21 437.23,-174.5 428.52,-168.47 426.66,-175.21"/>
</g>
<!-- Node14 -->
<g id="node14" class="node">
<title>Node14</title>
<g id="a_node14"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" target="_top" xlink:title="Inserts a value to a sorted multi&#45;value BST.">
<polygon fill="white" stroke="black" points="403,-114.5 403,-155.5 543,-155.5 543,-114.5 403,-114.5"/>
<text text-anchor="start" x="411" y="-143.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="411" y="-132.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="473" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node14 -->
<g id="edge13" class="edge">
<title>Node11&#45;&gt;Node14</title>
<path fill="none" stroke="midnightblue" d="M367.02,-135C375.48,-135 384.17,-135 392.76,-135"/>
<polygon fill="midnightblue" stroke="midnightblue" points="392.78,-138.5 402.78,-135 392.78,-131.5 392.78,-138.5"/>
</g>
<!-- Node15 -->
<g id="node15" class="node">
<title>Node15</title>
<g id="a_node15"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/pop_front.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="425.5,-76.5 425.5,-95.5 520.5,-95.5 520.5,-76.5 425.5,-76.5"/>
<text text-anchor="middle" x="473" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node15 -->
<g id="edge14" class="edge">
<title>Node11&#45;&gt;Node15</title>
<path fill="none" stroke="midnightblue" d="M367.16,-115.14C379.11,-111.74 391.41,-108.25 403,-105 410.91,-102.78 419.34,-100.44 427.49,-98.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="428.52,-101.53 437.23,-95.5 426.66,-94.79 428.52,-101.53"/>
</g>
<!-- Node16 -->
<g id="node16" class="node">
<title>Node16</title>
<g id="a_node16"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="422,-38.5 422,-57.5 524,-57.5 524,-38.5 422,-38.5"/>
<text text-anchor="middle" x="473" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node16 -->
<g id="edge15" class="edge">
<title>Node11&#45;&gt;Node16</title>
<path fill="none" stroke="midnightblue" d="M324.75,-114.38C345.22,-99.44 374.66,-79.71 403,-67 408.3,-64.62 413.97,-62.48 419.69,-60.56"/>
<polygon fill="midnightblue" stroke="midnightblue" points="420.82,-63.88 429.32,-57.55 418.73,-57.2 420.82,-63.88"/>
</g>
<!-- Node17 -->
<g id="node17" class="node">
<title>Node17</title>
<g id="a_node17"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="437.5,-0.5 437.5,-19.5 508.5,-19.5 508.5,-0.5 437.5,-0.5"/>
<text text-anchor="middle" x="473" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node17 -->
<g id="edge16" class="edge">
<title>Node11&#45;&gt;Node17</title>
<path fill="none" stroke="midnightblue" d="M313.05,-114.25C331.56,-90.22 365.22,-51.11 403,-29 410.48,-24.63 419,-21.22 427.44,-18.59"/>
<polygon fill="midnightblue" stroke="midnightblue" points="428.57,-21.91 437.25,-15.84 426.68,-15.17 428.57,-21.91"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 16 KiB

2
d2/d26/count__inversions_8cpp.html
View File

@@ -151,7 +151,7 @@ Functions</h2></td></tr>
<p >two elements a[i] and a[j] form an inversion if <code>a[i]</code> &gt; <code>a[j]</code> and i &lt; j</p>
<p >Time Complexity --&gt; <code>O(n.log n)</code></p>
<p >Space Complexity --&gt; <code>O(n)</code> ; additional array <code>temp[1..n]</code> </p>
<h3><a class="anchor" id="autotoc_md98"></a>
<h3><a class="anchor" id="autotoc_md99"></a>
Algorithm</h3>
<ol type="1">
<li>The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.</li>

4
d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="probability::windowed_median::WindowedMedian" name="probability::windowed_median::WindowedMedian">
<area shape="rect" id="node1" title="A class to calculate the median of a leading sliding window at the back of a stream of integer values..." alt="" coords="5,95,192,136"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list.html" title=" " alt="" coords="49,5,149,32"/>
</map>

1
d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
5bbd0ad9b78a72a32d89cfb7d5aa3f03

39
d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg Normal file
View File

@@ -0,0 +1,39 @@
<?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.49.1 (20210923.0004)
-->
<!-- Title: probability::windowed_median::WindowedMedian Pages: 1 -->
<svg width="148pt" height="106pt"
viewBox="0.00 0.00 148.00 106.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 102)">
<title>probability::windowed_median::WindowedMedian</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-102 144,-102 144,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A class to calculate the median of a leading sliding window at the back of a stream of integer values...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 140,-30.5 140,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="middle" x="70" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list.html" xlink:title=" ">
<polygon fill="white" stroke="black" points="32.5,-78.5 32.5,-97.5 107.5,-97.5 107.5,-78.5 32.5,-78.5"/>
<text text-anchor="middle" x="70" y="-85.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list&lt; int &gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node2&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M70,-68.24C70,-56.41 70,-41.38 70,-30.58"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="66.5,-68.36 70,-78.36 73.5,-68.36 66.5,-68.36"/>
<text text-anchor="middle" x="91" y="-52" font-family="Helvetica,sans-Serif" font-size="10.00"> _window</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.0 KiB

2
d3/df9/recursive__bubble__sort_8cpp.html
View File

@@ -135,7 +135,7 @@ Functions</h2></td></tr>
<dl class="section author"><dt>Author</dt><dd><a href="https://adityaprakash.tech" target="_blank">Aditya Prakash</a></dd></dl>
<p>The working principle of the Bubble sort algorithm.</p>
<p >Bubble sort is a simple sorting algorithm used to rearrange a set of ascending or descending order elements. Bubble sort gets its name from the fact that data "bubbles" to the top of the dataset.</p>
<h3><a class="anchor" id="autotoc_md99"></a>
<h3><a class="anchor" id="autotoc_md100"></a>
Algorithm</h3>
<p >What is Swap?</p>
<p >Swapping two numbers means that we interchange their values. Often, an additional variable is required for this operation. This is further illustrated in the following:</p>

2
d4/d9f/selection__sort__recursive_8cpp.html
View File

@@ -139,7 +139,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation of the <a href="https://en.wikipedia.org/wiki/Selection_sort" target="_blank">Selection sort</a> implementation using recursion. </p>
<p >The selection sort algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left) of the list, and a sublist of the remaining unsorted items that occupy the rest of the list. Initially, the sorted sublist is empty, and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on the sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.</p>
<h3><a class="anchor" id="autotoc_md100"></a>
<h3><a class="anchor" id="autotoc_md101"></a>
Implementation</h3>
<p >FindMinIndex This function finds the minimum element of the array(list) recursively by simply comparing the minimum element of array reduced size by 1 and compares it to the last element of the array to find the minimum of the whole array.</p>
<p >SelectionSortRecursive Just like selection sort, it divides the list into two parts (i.e.: sorted and unsorted) and finds the minimum of the unsorted array. By calling the <code>FindMinIndex</code> function, it swaps the minimum element with the first element of the list, and then solves recursively for the remaining unsorted list. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Tushar-K24" target="_blank">Tushar Khanduri</a> </dd></dl>

113
d4/ded/namespaceprobability.html Normal file
View File

@@ -0,0 +1,113 @@
<!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.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: probability Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<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.2 -->
<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('d4/ded/namespaceprobability.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">probability Namespace Reference</div></div>
</div><!--header-->
<div class="contents">
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> - needed in testing
<a href="../../d4/ded/namespaceprobability.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> - needed in testing </p>
<p >for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/random/rand.html">std::rand</a> - needed in testing for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/chrono/c/time.html">std::time</a> - needed in testing for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a> - used to manage sliding window for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a> - used to manage multi-value sorted sliding window values</p>
<p >Probability algorithms </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d4/ded/namespaceprobability.html">probability</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.2 </li>
</ul>
</div>
</body>
</html>

6
d4/ded/namespaceprobability.js Normal file
View File

@@ -0,0 +1,6 @@
var namespaceprobability =
[
[ "windowed_median", null, [
[ "WindowedMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median" ]
] ]
];

4
d5/d45/sublist__search_8cpp.html
View File

@@ -148,14 +148,14 @@ Functions</h2></td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search Algorithm</a> </p>
<h3><a class="anchor" id="autotoc_md95"></a>
<h3><a class="anchor" id="autotoc_md96"></a>
Algorithm</h3>
<ul>
<li>Sublist search is used to detect a presence of one list in another list.</li>
<li>Suppose we have a single-node list (let's say the first list), and we want to ensure that the list is present in another list (let's say the second list), then we can perform the sublist search to find it.</li>
<li>For instance, the first list contains these elements: 23 -&gt; 30 -&gt; 41, and the second list contains these elements: 10 -&gt; 15 -&gt; 23 -&gt; 30 -&gt; 41 -&gt; 49. At a glance, we see that the first list presents in the second list.</li>
</ul>
<h3><a class="anchor" id="autotoc_md96"></a>
<h3><a class="anchor" id="autotoc_md97"></a>
Working</h3>
<ul>
<li>The sublist search algorithm works by comparing the first element of the first list with the first element of the second list.</li>

1
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@@ -397,6 +397,7 @@ Probability</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/bayes_theorem.cpp" target="_blank">Bayes Theorem</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/binomial_dist.cpp" target="_blank">Binomial Dist</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/poisson_dist.cpp" target="_blank">Poisson Dist</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/windowed_median.cpp" target="_blank">Windowed Median</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md55"></a>
Range Queries</h1>

2
d5/ddb/bogo__sort_8cpp.html
View File

@@ -135,7 +135,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort" target="_blank">Bogosort algorithm</a> </p>
<p >In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.</p>
<h3><a class="anchor" id="autotoc_md97"></a>
<h3><a class="anchor" id="autotoc_md98"></a>
Algorithm</h3>
<p >Shuffle the array untill array is sorted.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905" target="_blank">Deep Raval</a> </dd></dl>

7
d6/db0/binomial__dist_8cpp.html
View File

@@ -209,13 +209,14 @@ Functions</h2></td></tr>
</div><div class="memdoc">
<p >calculates the probability of a result within a range (inclusive, inclusive) </p><dl class="section return"><dt>Returns</dt><dd>\(\displaystyle \left.P(n,p)\right|_{x_0}^{x_1} = \sum_{i=x_0}^{x_1} P(i) =\sum_{i=x_0}^{x_1} {n\choose i} p^i (1-p)^{n-i}\) </dd></dl>
<div class="fragment"><div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordtype">double</span> probability = 0;</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordtype">double</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> = 0;</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lower_bound; i &lt;= <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">upper_bound</a>; i++) {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> probability += <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(n, i) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(p, i) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(1 - p, n - i);</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> += <a class="code hl_function" href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a>(n, i) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(p, i) * <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a>(1 - p, n - i);</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">return</span> probability;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a>;</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>}</div>
<div class="ttc" id="abinomial__dist_8cpp_html_a78d36635232e54b5d71fcbf1eac9a49a"><div class="ttname"><a href="../../d6/db0/binomial__dist_8cpp.html#a78d36635232e54b5d71fcbf1eac9a49a">nCr</a></div><div class="ttdeci">double nCr(double n, double r)</div><div class="ttdef"><b>Definition:</b> binomial_dist.cpp:47</div></div>
<div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">for std::vector - needed in testing</div></div>
<div class="ttc" id="apow_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/math/pow.html">std::pow</a></div><div class="ttdeci">T pow(T... args)</div></div>
<div class="ttc" id="aupper_bound_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/upper_bound.html">std::upper_bound</a></div><div class="ttdeci">T upper_bound(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">

7
d9/d24/poisson__dist_8cpp.html
View File

@@ -268,12 +268,13 @@ Here is the call graph for this function:</div>
\[P = \sum_i p(\mu,i)\]
</p>
<div class="fragment"><div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> {</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordtype">double</span> probability = 0;</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordtype">double</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> = 0;</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = lower; i &lt;= upper; i++) {</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> probability += <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a>(expected, i);</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a> += <a class="code hl_function" href="../../d9/d24/poisson__dist_8cpp.html#a69a136b32707bdc7950fb9057b5fa1e1">poisson_x_successes</a>(expected, i);</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> }</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">return</span> probability;</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../d4/ded/namespaceprobability.html">probability</a>;</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span>}</div>
<div class="ttc" id="anamespaceprobability_html"><div class="ttname"><a href="../../d4/ded/namespaceprobability.html">probability</a></div><div class="ttdoc">for std::vector - needed in testing</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">

111
dd/d21/namespacewindowed__median.html Normal file
View File

@@ -0,0 +1,111 @@
<!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.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: windowed_median Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<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.2 -->
<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('dd/d21/namespacewindowed__median.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">windowed_median Namespace Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Functions for the Windowed Median algorithm implementation.
<a href="../../dd/d21/namespacewindowed__median.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p >Functions for the Windowed Median algorithm implementation. </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dd/d21/namespacewindowed__median.html">windowed_median</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.2 </li>
</ul>
</div>
</body>
</html>

521
df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html Normal file
View File

@@ -0,0 +1,521 @@
<!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.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: probability::windowed_median::WindowedMedian Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<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.2 -->
<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('df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-methods">Private Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../d1/d47/classprobability_1_1windowed__median_1_1_windowed_median-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">probability::windowed_median::WindowedMedian Class Reference</div></div>
</div><!--header-->
<div class="contents">
<p>A class to calculate the median of a leading sliding window at the back of a stream of integer values.
<a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for probability::windowed_median::WindowedMedian:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d92/classprobability_1_1windowed__median_1_1_windowed_median__coll__graph.svg" width="198" height="142"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:aac676369661d15a3eb782c0fee77d45d"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d">WindowedMedian</a> (size_type windowSize)</td></tr>
<tr class="memdesc:aac676369661d15a3eb782c0fee77d45d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs a <a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" title="A class to calculate the median of a leading sliding window at the back of a stream of integer values...">WindowedMedian</a> object. <a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d">More...</a><br /></td></tr>
<tr class="separator:aac676369661d15a3eb782c0fee77d45d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6b52b7851750f28d53508e63c52a69f7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">insert</a> (int value)</td></tr>
<tr class="memdesc:a6b52b7851750f28d53508e63c52a69f7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert a new value to the stream. <a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">More...</a><br /></td></tr>
<tr class="separator:a6b52b7851750f28d53508e63c52a69f7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a938cafbdf70dc01e86e9bb12d29ec65d"><td class="memItemLeft" align="right" valign="top">float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">getMedian</a> () const</td></tr>
<tr class="memdesc:a938cafbdf70dc01e86e9bb12d29ec65d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gets the median of the values in the sliding window. <a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">More...</a><br /></td></tr>
<tr class="separator:a938cafbdf70dc01e86e9bb12d29ec65d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a61804988fcb1a6caf640f8291979aaa6"><td class="memItemLeft" align="right" valign="top">float&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">getMedianNaive</a> () const</td></tr>
<tr class="memdesc:a61804988fcb1a6caf640f8291979aaa6"><td class="mdescLeft">&#160;</td><td class="mdescRight">A naive and inefficient method to obtain the median of the sliding window. Used for testing! <a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">More...</a><br /></td></tr>
<tr class="separator:a61804988fcb1a6caf640f8291979aaa6"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a3a7f57679e9cd6c9f042dfd0612b2b24"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">insertToSorted</a> (int value)</td></tr>
<tr class="memdesc:a3a7f57679e9cd6c9f042dfd0612b2b24"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts a value to a sorted multi-value BST. <a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">More...</a><br /></td></tr>
<tr class="separator:a3a7f57679e9cd6c9f042dfd0612b2b24"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af544e271ea19a6fd69a6b3ed6816453e"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">eraseFromSorted</a> (int value)</td></tr>
<tr class="memdesc:af544e271ea19a6fd69a6b3ed6816453e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Erases a value from a sorted multi-value BST. <a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">More...</a><br /></td></tr>
<tr class="separator:af544e271ea19a6fd69a6b3ed6816453e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:aafda847b152684578dab891e5268d750"><td class="memItemLeft" align="right" valign="top"><a id="aafda847b152684578dab891e5268d750" name="aafda847b152684578dab891e5268d750"></a>
const size_type&#160;</td><td class="memItemRight" valign="bottom"><b>_windowSize</b></td></tr>
<tr class="memdesc:aafda847b152684578dab891e5268d750"><td class="mdescLeft">&#160;</td><td class="mdescRight">sliding window size <br /></td></tr>
<tr class="separator:aafda847b152684578dab891e5268d750"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a825a7aaef844c9f743a27b268e8569b2"><td class="memItemLeft" align="right" valign="top"><a id="a825a7aaef844c9f743a27b268e8569b2" name="a825a7aaef844c9f743a27b268e8569b2"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">Window</a>&#160;</td><td class="memItemRight" valign="bottom"><b>_window</b></td></tr>
<tr class="memdesc:a825a7aaef844c9f743a27b268e8569b2"><td class="mdescLeft">&#160;</td><td class="mdescRight">a sliding window of values along the stream <br /></td></tr>
<tr class="separator:a825a7aaef844c9f743a27b268e8569b2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aacd76f078632faee1a8788d031e6c2de"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>&lt; int &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a></td></tr>
<tr class="separator:aacd76f078632faee1a8788d031e6c2de"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a55ae3543a76045dffcb5ec7904a32a20"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>&lt; int &gt;::const_iterator&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a></td></tr>
<tr class="separator:a55ae3543a76045dffcb5ec7904a32a20"><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 >A class to calculate the median of a leading sliding window at the back of a stream of integer values. </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="aac676369661d15a3eb782c0fee77d45d" name="aac676369661d15a3eb782c0fee77d45d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aac676369661d15a3eb782c0fee77d45d">&#9670;&nbsp;</a></span>WindowedMedian()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">probability::windowed_median::WindowedMedian::WindowedMedian </td>
<td>(</td>
<td class="paramtype">size_type&#160;</td>
<td class="paramname"><em>windowSize</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Constructs a <a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" title="A class to calculate the median of a leading sliding window at the back of a stream of integer values...">WindowedMedian</a> object. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">windowSize</td><td>Sliding window size </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span>: <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">_windowSize</a>(windowSize){};</div>
<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aafda847b152684578dab891e5268d750"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">probability::windowed_median::WindowedMedian::_windowSize</a></div><div class="ttdeci">const size_type _windowSize</div><div class="ttdoc">sliding window size</div><div class="ttdef"><b>Definition:</b> windowed_median.cpp:57</div></div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="af544e271ea19a6fd69a6b3ed6816453e" name="af544e271ea19a6fd69a6b3ed6816453e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af544e271ea19a6fd69a6b3ed6816453e">&#9670;&nbsp;</a></span>eraseFromSorted()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void probability::windowed_median::WindowedMedian::eraseFromSorted </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>value</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Erases a value from a sorted multi-value BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value to insert </td></tr>
</table>
</dd>
</dl>
<p >If the erased value is on the left branch or the median itself and the number of elements is even, the new median will be the right child of the current one</p>
<p >O(1) - traversing one step to the right child</p>
<p >However, if the erased value is on the right branch or the median itself, and the number of elements is odd, the new median will be the left child of the current one</p>
<p >Find the (first) position of the value we want to erase, and erase it</p>
<div class="fragment"><div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> {</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keyword">const</span> <span class="keyword">auto</span> sz = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size();</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="comment"></span> </div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="comment"> /// If the erased value is on the left branch or the median itself and</span></div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span><span class="comment"> /// the number of elements is even, the new median will be the right</span></div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span><span class="comment"> /// child of the current one</span></div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="comment"></span> <span class="keywordflow">if</span> (value &lt;= *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 == 0) {</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> ++<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>; <span class="comment">/// O(1) - traversing one step to the right child</span></div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="comment"></span> </div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span><span class="comment"> /// However, if the erased value is on the right branch or the median</span></div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span><span class="comment"> /// itself, and the number of elements is odd, the new median will be the</span></div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span><span class="comment"> /// left child of the current one</span></div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span><span class="comment"></span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt;= *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 != 0) {</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> --<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>; <span class="comment">// O(1) - traversing one step to the left child</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> }</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="comment"></span> </div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span><span class="comment"> /// Find the (first) position of the value we want to erase, and erase it</span></div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span><span class="comment"></span> <span class="keyword">const</span> <span class="keyword">auto</span> it = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.find(value); <span class="comment">// O(logN)</span></div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.erase(it); <span class="comment">// O(logN)</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> }</div>
<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a55ae3543a76045dffcb5ec7904a32a20"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">probability::windowed_median::WindowedMedian::_itMedian</a></div><div class="ttdeci">std::multiset&lt; int &gt;::const_iterator _itMedian</div><div class="ttdef"><b>Definition:</b> windowed_median.cpp:62</div></div>
<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_aacd76f078632faee1a8788d031e6c2de"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">probability::windowed_median::WindowedMedian::_sortedValues</a></div><div class="ttdeci">std::multiset&lt; int &gt; _sortedValues</div><div class="ttdef"><b>Definition:</b> windowed_median.cpp:59</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a938cafbdf70dc01e86e9bb12d29ec65d" name="a938cafbdf70dc01e86e9bb12d29ec65d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a938cafbdf70dc01e86e9bb12d29ec65d">&#9670;&nbsp;</a></span>getMedian()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">float probability::windowed_median::WindowedMedian::getMedian </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Gets the median of the values in the sliding window. </p>
<dl class="section return"><dt>Returns</dt><dd>Median of sliding window. For even window size return the average between the two values in the middle </dd></dl>
<p >O(1)</p>
<div class="fragment"><div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> {</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size() % 2 != 0) {</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keywordflow">return</span> *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>; <span class="comment">// O(1)</span></div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> }</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordflow">return</span> 0.5f * *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> + 0.5f * *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>(<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>); <span class="comment">/// O(1)</span></div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> }</div>
<div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a61804988fcb1a6caf640f8291979aaa6" name="a61804988fcb1a6caf640f8291979aaa6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a61804988fcb1a6caf640f8291979aaa6">&#9670;&nbsp;</a></span>getMedianNaive()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">float probability::windowed_median::WindowedMedian::getMedianNaive </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A naive and inefficient method to obtain the median of the sliding window. Used for testing! </p>
<dl class="section return"><dt>Returns</dt><dd>Median of sliding window. For even window size return the average between the two values in the middle </dd></dl>
<p >Sort window - O(NlogN)</p>
<p >Find value in the middle - O(N)</p>
<p >O(N)</p>
<div class="fragment"><div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> {</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keyword">auto</span> window = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>;</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> window.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/sort.html">sort</a>(); <span class="comment">/// Sort window - O(NlogN)</span></div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keyword">auto</span> median =</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>(window.begin(),</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> window.size() / 2); <span class="comment">/// Find value in the middle - O(N)</span></div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordflow">if</span> (window.size() % 2 != 0) {</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="keywordflow">return</span> median;</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> }</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordflow">return</span> 0.5f * median +</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> 0.5f * *<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/iterator/next.html">next</a>(window.begin(), window.size() / 2 - 1); <span class="comment">/// O(N)</span></div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> }</div>
<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a825a7aaef844c9f743a27b268e8569b2"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">probability::windowed_median::WindowedMedian::_window</a></div><div class="ttdeci">Window _window</div><div class="ttdoc">a sliding window of values along the stream</div><div class="ttdef"><b>Definition:</b> windowed_median.cpp:58</div></div>
<div class="ttc" id="asort_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/sort.html">std::list::sort</a></div><div class="ttdeci">T sort(T... args)</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="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.svg" width="339" height="67"><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="a6b52b7851750f28d53508e63c52a69f7" name="a6b52b7851750f28d53508e63c52a69f7"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6b52b7851750f28d53508e63c52a69f7">&#9670;&nbsp;</a></span>insert()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void probability::windowed_median::WindowedMedian::insert </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>value</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Insert a new value to the stream. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>New value to insert </td></tr>
</table>
</dd>
</dl>
<p >Push new value to the back of the sliding window - O(1)</p>
<p >If exceeding size of window, pop from its left side</p>
<p >Erase from the multi-value BST the window left side value</p>
<p >Pop the left side value from the window - O(1)</p>
<div class="fragment"><div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> {</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="comment"></span></div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span><span class="comment"> /// Push new value to the back of the sliding window - O(1)</span></div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span><span class="comment"></span> <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/push_back.html">push_back</a>(value);</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">insertToSorted</a>(value); <span class="comment">// Insert value to the multi-value BST - O(logN)</span></div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/size.html">size</a>() &gt; <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">_windowSize</a>) { <span class="comment">/// If exceeding size of window, pop</span><span class="comment"></span></div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment"> /// from its left side</span></div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment"></span> <a class="code hl_function" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">eraseFromSorted</a>(<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a>.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/front.html">front</a>()); <span class="comment">/// Erase from the multi-value BST</span><span class="comment"></span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment"> /// the window left side value</span></div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="comment"></span> <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">_window</a></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> .<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list/pop_front.html">pop_front</a>(); <span class="comment">/// Pop the left side value from the window - O(1)</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> }</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> }</div>
<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_a3a7f57679e9cd6c9f042dfd0612b2b24"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">probability::windowed_median::WindowedMedian::insertToSorted</a></div><div class="ttdeci">void insertToSorted(int value)</div><div class="ttdoc">Inserts a value to a sorted multi-value BST.</div><div class="ttdef"><b>Definition:</b> windowed_median.cpp:69</div></div>
<div class="ttc" id="aclassprobability_1_1windowed__median_1_1_windowed_median_html_af544e271ea19a6fd69a6b3ed6816453e"><div class="ttname"><a href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">probability::windowed_median::WindowedMedian::eraseFromSorted</a></div><div class="ttdeci">void eraseFromSorted(int value)</div><div class="ttdoc">Erases a value from a sorted multi-value BST.</div><div class="ttdef"><b>Definition:</b> windowed_median.cpp:95</div></div>
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/front.html">std::list::front</a></div><div class="ttdeci">T front(T... args)</div></div>
<div class="ttc" id="apop_front_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/pop_front.html">std::list::pop_front</a></div><div class="ttdeci">T pop_front(T... args)</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/push_back.html">std::list::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/size.html">std::list::size</a></div><div class="ttdeci">T size(T... args)</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="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.svg" width="432" height="350"><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="a3a7f57679e9cd6c9f042dfd0612b2b24" name="a3a7f57679e9cd6c9f042dfd0612b2b24"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a3a7f57679e9cd6c9f042dfd0612b2b24">&#9670;&nbsp;</a></span>insertToSorted()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void probability::windowed_median::WindowedMedian::insertToSorted </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>value</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts a value to a sorted multi-value BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>Value to insert </td></tr>
</table>
</dd>
</dl>
<p >Insert value to BST - O(logN)</p>
<p >For the first value, set median iterator to BST root</p>
<p >If new value goes to left tree branch, and number of elements is even, the new median in the balanced tree is the left child of the median before the insertion</p>
<p >However, if the new value goes to the right branch, the previous median's right child is the new median in the balanced tree</p>
<p >O(1) - traversing one step to the right child</p>
<div class="fragment"><div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> {</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.insert(value); <span class="comment">/// Insert value to BST - O(logN)</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">const</span> <span class="keyword">auto</span> sz = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.size();</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">if</span> (sz == 1) { <span class="comment">/// For the first value, set median iterator to BST root</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> = <a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">_sortedValues</a>.begin();</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> }</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment"></span> </div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment"> /// If new value goes to left tree branch, and number of elements is</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="comment"> /// even, the new median in the balanced tree is the left child of the</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment"> /// median before the insertion</span></div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment"></span> <span class="keywordflow">if</span> (value &lt; *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 == 0) {</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> --<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>; <span class="comment">// O(1) - traversing one step to the left child</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> }</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment"></span> </div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment"> /// However, if the new value goes to the right branch, the previous</span></div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment"> /// median&#39;s right child is the new median in the balanced tree</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment"></span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt;= *<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a> &amp;&amp; sz % 2 != 0) {</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> ++<a class="code hl_variable" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">_itMedian</a>; <span class="comment">/// O(1) - traversing one step to the right child</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> }</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="a55ae3543a76045dffcb5ec7904a32a20" name="a55ae3543a76045dffcb5ec7904a32a20"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a55ae3543a76045dffcb5ec7904a32a20">&#9670;&nbsp;</a></span>_itMedian</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>&lt;int&gt;::const_iterator probability::windowed_median::WindowedMedian::_itMedian</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p >an iterator that points to the root of the multi-value BST </p>
</div>
</div>
<a id="aacd76f078632faee1a8788d031e6c2de" name="aacd76f078632faee1a8788d031e6c2de"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aacd76f078632faee1a8788d031e6c2de">&#9670;&nbsp;</a></span>_sortedValues</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/multiset.html">std::multiset</a>&lt;int&gt; probability::windowed_median::WindowedMedian::_sortedValues</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p >a DS to represent a balanced multi-value binary search tree (BST) </p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>probability/<a class="el" href="../../d1/ded/windowed__median_8cpp.html">windowed_median.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="../../d4/ded/namespaceprobability.html">probability</a></li><li class="navelem"><b>windowed_median</b></li><li class="navelem"><a class="el" href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html">WindowedMedian</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.2 </li>
</ul>
</div>
</body>
</html>

13
df/d34/classprobability_1_1windowed__median_1_1_windowed_median.js vendored Normal file
View File

@@ -0,0 +1,13 @@
var classprobability_1_1windowed__median_1_1_windowed_median =
[
[ "WindowedMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d", null ],
[ "eraseFromSorted", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e", null ],
[ "getMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d", null ],
[ "getMedianNaive", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6", null ],
[ "insert", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7", null ],
[ "insertToSorted", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24", null ],
[ "_itMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20", null ],
[ "_sortedValues", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de", null ],
[ "_window", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2", null ],
[ "_windowSize", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750", null ]
];

4
df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="probability::windowed_median::WindowedMedian::getMedianNaive" name="probability::windowed_median::WindowedMedian::getMedianNaive">
<area shape="rect" id="node1" title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!" alt="" coords="5,5,192,61"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/sort.html#" title=" " alt="" coords="240,20,333,47"/>
</map>

1
df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
19f277ade2370421aaae477775231f5b

39
df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a61804988fcb1a6caf640f8291979aaa6_cgraph.svg Normal file
View File

@@ -0,0 +1,39 @@
<?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.49.1 (20210923.0004)
-->
<!-- Title: probability::windowed_median::WindowedMedian::getMedianNaive Pages: 1 -->
<svg width="254pt" height="50pt"
viewBox="0.00 0.00 254.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>probability::windowed_median::WindowedMedian::getMedianNaive</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 250,-46 250,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A naive and inefficient method to obtain the median of the sliding window. Used for testing!">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 140,-41.5 140,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="70" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getMedianNaive</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/sort.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="176,-11.5 176,-30.5 246,-30.5 246,-11.5 176,-11.5"/>
<text text-anchor="middle" x="211" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::sort</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M140.09,-21C148.81,-21 157.54,-21 165.73,-21"/>
<polygon fill="midnightblue" stroke="midnightblue" points="165.77,-24.5 175.77,-21 165.77,-17.5 165.77,-24.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.0 KiB

9
df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="probability::windowed_median::WindowedMedian::insert" name="probability::windowed_median::WindowedMedian::insert">
<area shape="rect" id="node1" title="Insert a new value to the stream." alt="" coords="5,169,192,225"/>
<area shape="rect" id="node2" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" title="Erases a value from a sorted multi&#45;value BST." alt="" coords="240,5,427,61"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/front.html#" title=" " alt="" coords="285,85,382,112"/>
<area shape="rect" id="node4" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" title="Inserts a value to a sorted multi&#45;value BST." alt="" coords="240,136,427,192"/>
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/pop_front.html#" title=" " alt="" coords="270,216,397,243"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/push_back.html#" title=" " alt="" coords="265,267,401,293"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/list/size.html#" title=" " alt="" coords="286,317,381,344"/>
</map>

1
df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
24134f419615a92131c5b25acb3a624d

118
df/d34/classprobability_1_1windowed__median_1_1_windowed_median_a6b52b7851750f28d53508e63c52a69f7_cgraph.svg Normal file
View File

@@ -0,0 +1,118 @@
<?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.49.1 (20210923.0004)
-->
<!-- Title: probability::windowed_median::WindowedMedian::insert Pages: 1 -->
<svg width="324pt" height="262pt"
viewBox="0.00 0.00 324.00 262.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 258)">
<title>probability::windowed_median::WindowedMedian::insert</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-258 320,-258 320,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Insert a new value to the stream.">
<polygon fill="#bfbfbf" stroke="black" points="0,-89.5 0,-130.5 140,-130.5 140,-89.5 0,-89.5"/>
<text text-anchor="start" x="8" y="-118.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="8" y="-107.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="70" y="-96.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e" target="_top" xlink:title="Erases a value from a sorted multi&#45;value BST.">
<polygon fill="white" stroke="black" points="176,-212.5 176,-253.5 316,-253.5 316,-212.5 176,-212.5"/>
<text text-anchor="start" x="184" y="-241.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="184" y="-230.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="246" y="-219.5" font-family="Helvetica,sans-Serif" font-size="10.00">::eraseFromSorted</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="M90.36,-130.59C110.34,-150.96 143.15,-182.06 176,-203 178.56,-204.63 181.23,-206.22 183.95,-207.75"/>
<polygon fill="midnightblue" stroke="midnightblue" points="182.36,-210.86 192.84,-212.44 185.63,-204.67 182.36,-210.86"/>
</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/container/list/front.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="209.5,-174.5 209.5,-193.5 282.5,-193.5 282.5,-174.5 209.5,-174.5"/>
<text text-anchor="middle" x="246" y="-181.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::front</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="M105.59,-130.52C125.66,-141.8 151.69,-155.41 176,-165 183.56,-167.98 191.76,-170.68 199.78,-173.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="198.85,-176.42 209.42,-175.76 200.75,-169.68 198.85,-176.42"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24" target="_top" xlink:title="Inserts a value to a sorted multi&#45;value BST.">
<polygon fill="white" stroke="black" points="176,-114.5 176,-155.5 316,-155.5 316,-114.5 176,-114.5"/>
<text text-anchor="start" x="184" y="-143.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="start" x="184" y="-132.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
<text text-anchor="middle" x="246" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">::insertToSorted</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="M140.02,-119.92C148.48,-121.13 157.17,-122.38 165.76,-123.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="165.38,-127.1 175.78,-125.05 166.38,-120.17 165.38,-127.1"/>
</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/list/pop_front.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="198.5,-76.5 198.5,-95.5 293.5,-95.5 293.5,-76.5 198.5,-76.5"/>
<text text-anchor="middle" x="246" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::pop_front</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M140.02,-100.48C155.9,-98.29 172.62,-95.98 187.93,-93.87"/>
<polygon fill="midnightblue" stroke="midnightblue" points="188.84,-97.28 198.27,-92.45 187.89,-90.34 188.84,-97.28"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="195,-38.5 195,-57.5 297,-57.5 297,-38.5 195,-38.5"/>
<text text-anchor="middle" x="246" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::push_back</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M117.85,-89.41C135.85,-81.87 156.7,-73.58 176,-67 182.87,-64.66 190.2,-62.39 197.42,-60.29"/>
<polygon fill="midnightblue" stroke="midnightblue" points="198.48,-63.63 207.15,-57.54 196.57,-56.9 198.48,-63.63"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/list/size.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="210.5,-0.5 210.5,-19.5 281.5,-19.5 281.5,-0.5 210.5,-0.5"/>
<text text-anchor="middle" x="246" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::list::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M92.61,-89.21C112.72,-70.93 144.28,-44.83 176,-29 183.67,-25.17 192.22,-22.03 200.62,-19.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="201.66,-22.82 210.34,-16.75 199.77,-16.08 201.66,-22.82"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 6.5 KiB

3
dir_82e494173a87936756866de2fa774307.html
View File

@@ -108,6 +108,9 @@ 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="d9/d24/poisson__dist_8cpp.html">poisson_dist.cpp</a></td></tr>
<tr class="memdesc:d9/d24/poisson__dist_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Poisson_distribution" target="_blank">Poisson statistics</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="d1/ded/windowed__median_8cpp.html">windowed_median.cpp</a></td></tr>
<tr class="memdesc:d1/ded/windowed__median_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation of a median calculation of a sliding window along a data stream. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->

3
dir_82e494173a87936756866de2fa774307.js
View File

@@ -3,5 +3,6 @@ var dir_82e494173a87936756866de2fa774307 =
[ "addition_rule.cpp", "d6/d4a/addition__rule_8cpp.html", "d6/d4a/addition__rule_8cpp" ],
[ "bayes_theorem.cpp", "d5/d67/bayes__theorem_8cpp.html", "d5/d67/bayes__theorem_8cpp" ],
[ "binomial_dist.cpp", "d6/db0/binomial__dist_8cpp.html", "d6/db0/binomial__dist_8cpp" ],
[ "poisson_dist.cpp", "d9/d24/poisson__dist_8cpp.html", "d9/d24/poisson__dist_8cpp" ]
[ "poisson_dist.cpp", "d9/d24/poisson__dist_8cpp.html", "d9/d24/poisson__dist_8cpp" ],
[ "windowed_median.cpp", "d1/ded/windowed__median_8cpp.html", "d1/ded/windowed__median_8cpp" ]
];

1
files.html
View File

@@ -291,6 +291,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
<tr id="row_17_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="d5/d67/bayes__theorem_8cpp.html" target="_self">bayes_theorem.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Bayes%27_theorem" target="_blank">Bayes' theorem</a> </td></tr>
<tr id="row_17_2_" 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="d6/db0/binomial__dist_8cpp.html" target="_self">binomial_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Binomial_distribution" target="_blank">Binomial distribution</a> example </td></tr>
<tr id="row_17_3_" 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="d9/d24/poisson__dist_8cpp.html" target="_self">poisson_dist.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Poisson_distribution" target="_blank">Poisson statistics</a> </td></tr>
<tr id="row_17_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="d1/ded/windowed__median_8cpp.html" target="_self">windowed_median.cpp</a></td><td class="desc">An implementation of a median calculation of a sliding window along a data stream </td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_18_" class="arrow" onclick="toggleFolder('18_')">&#9658;</span><span id="img_18_" class="iconfclosed" onclick="toggleFolder('18_')">&#160;</span><a class="el" href="dir_074119ce3a874b57120c49a0cc4bb5ad.html" target="_self">range_queries</a></td><td class="desc"></td></tr>
<tr id="row_18_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d2e/fenwick__tree_8cpp.html" target="_self">fenwick_tree.cpp</a></td><td class="desc">Fenwick tree </td></tr>
<tr id="row_18_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d2/de9/heavy__light__decomposition_8cpp.html" target="_self">heavy_light_decomposition.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Heavy_path_decomposition" target="_blank">Heavy Light Decomposition</a> implementation </td></tr>

4
functions.html
View File

@@ -96,9 +96,13 @@ $(document).ready(function(){initNavTree('functions.html',''); initResizable();
<li>__detailed_single_prediction()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a361a45f3c3d8347d79103bf182d0570b">machine_learning::neural_network::NeuralNetwork</a></li>
<li>__get_integer_from_string()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4">uint256_t</a></li>
<li>_digits&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number</a></li>
<li>_itMedian&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">probability::windowed_median::WindowedMedian</a></li>
<li>_lez()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163">uint256_t</a></li>
<li>_mod&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain</a></li>
<li>_sortedValues&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">probability::windowed_median::WindowedMedian</a></li>
<li>_trz()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250">uint256_t</a></li>
<li>_window&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">probability::windowed_median::WindowedMedian</a></li>
<li>_windowSize&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">probability::windowed_median::WindowedMedian</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

1
functions_e.html
View File

@@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('functions_e.html',''); initResizable()
<li>enQueue()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#a592c0580551ec0d3b4d43e8198d8a377">queue&lt; Kind &gt;</a></li>
<li>Entry()&#160;:&#160;<a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475">double_hashing::Entry</a>, <a class="el" href="db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">linear_probing::Entry</a>, <a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">quadratic_probing::Entry</a></li>
<li>erase()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e">data_structures::linked_list::list</a></li>
<li>eraseFromSorted()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">probability::windowed_median::WindowedMedian</a></li>
<li>eta&#160;:&#160;<a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda">machine_learning::adaline</a></li>
<li>evaluate()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e">machine_learning::neural_network::NeuralNetwork</a></li>
<li>evaluate_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">machine_learning::neural_network::NeuralNetwork</a></li>

1
functions_func.js
View File

@@ -22,5 +22,6 @@ var functions_func =
[ "t", "functions_func_t.html", null ],
[ "u", "functions_func_u.html", null ],
[ "v", "functions_func_v.html", null ],
[ "w", "functions_func_w.html", null ],
[ "~", "functions_func_~.html", null ]
];

1
functions_func_e.html
View File

@@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('functions_func_e.html',''); initResiza
<li>enQueue()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#a592c0580551ec0d3b4d43e8198d8a377">queue&lt; Kind &gt;</a></li>
<li>Entry()&#160;:&#160;<a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html#a287b92112b6b43b34808a93778873475">double_hashing::Entry</a>, <a class="el" href="db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77">linear_probing::Entry</a>, <a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e">quadratic_probing::Entry</a></li>
<li>erase()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e">data_structures::linked_list::list</a></li>
<li>eraseFromSorted()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#af544e271ea19a6fd69a6b3ed6816453e">probability::windowed_median::WindowedMedian</a></li>
<li>evaluate()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#aec648ea4f40bd71123b5f907a681dd8e">machine_learning::neural_network::NeuralNetwork</a></li>
<li>evaluate_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a36494e26ff36d6e15c1022bb9a1ee848">machine_learning::neural_network::NeuralNetwork</a></li>
<li>extractMin()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#a4014f1edaed0bd7db0c0d2ca53228980">MinHeap</a></li>

2
functions_func_g.html
View File

@@ -122,6 +122,8 @@ $(document).ready(function(){initNavTree('functions_func_g.html',''); initResiza
<li>GetItemRightChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95">data_structures::tree_234::Node</a></li>
<li>GetLeftmostChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e">data_structures::tree_234::Node</a></li>
<li>GetMaxItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57">data_structures::tree_234::Node</a></li>
<li>getMedian()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">probability::windowed_median::WindowedMedian</a></li>
<li>getMedianNaive()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">probability::windowed_median::WindowedMedian</a></li>
<li>getMin()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130">MinHeap</a></li>
<li>GetMinItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">data_structures::tree_234::Node</a></li>
<li>GetNextPossibleChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46">data_structures::tree_234::Node</a></li>

5
functions_func_i.html
View File

@@ -99,16 +99,17 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
<li>init()&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>inOrderIterative()&#160;:&#160;<a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree</a></li>
<li>insert()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree&lt; T &gt;</a>, <a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">data_structures::linked_list::list</a>, <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">data_structures::list_array::list</a></li>
<li>Insert()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">data_structures::tree_234::Tree234</a></li>
<li>Insert()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a></li>
<li>insert()&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a></li>
<li>Insert()&#160;:&#160;<a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">operations_on_datastructures::trie_operations::Tnode</a></li>
<li>insert()&#160;:&#160;<a class="el" href="dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie</a></li>
<li>insert()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">probability::windowed_median::WindowedMedian</a>, <a class="el" href="dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie</a></li>
<li>insertElement()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList</a></li>
<li>InsertItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb">data_structures::tree_234::Node</a></li>
<li>InsertItemByIndex()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956">data_structures::tree_234::Node</a></li>
<li>insertKey()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82">MinHeap</a></li>
<li>InsertPostMerge()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703">data_structures::tree_234::Tree234</a></li>
<li>InsertPreSplit()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d">data_structures::tree_234::Tree234</a></li>
<li>insertToSorted()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">probability::windowed_median::WindowedMedian</a></li>
<li>Is2Node()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">data_structures::tree_234::Node</a></li>
<li>Is34Node()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">data_structures::tree_234::Node</a></li>
<li>is_bipartite()&#160;:&#160;<a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca">graph::is_graph_bipartite::Graph</a></li>

107
functions_func_w.html Normal file
View File

@@ -0,0 +1,107 @@
<!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.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Class Members - Functions</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++<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.2 -->
<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('functions_func_w.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="contents">
&#160;
<h3><a id="index_w" name="index_w"></a>- w -</h3><ul>
<li>WindowedMedian()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d">probability::windowed_median::WindowedMedian</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="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.2 </li>
</ul>
</div>
</body>
</html>

2
functions_g.html
View File

@@ -122,6 +122,8 @@ $(document).ready(function(){initNavTree('functions_g.html',''); initResizable()
<li>GetItemRightChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a441cbee9896391f2b167d5aa7b4f8c95">data_structures::tree_234::Node</a></li>
<li>GetLeftmostChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#ac6f619a1605cb46196360889fff4529e">data_structures::tree_234::Node</a></li>
<li>GetMaxItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a2753b6053b8c86c5bd987a44fdfa0a57">data_structures::tree_234::Node</a></li>
<li>getMedian()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a938cafbdf70dc01e86e9bb12d29ec65d">probability::windowed_median::WindowedMedian</a></li>
<li>getMedianNaive()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a61804988fcb1a6caf640f8291979aaa6">probability::windowed_median::WindowedMedian</a></li>
<li>getMin()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#a336ac71f0d857269fe9a98058a3cd130">MinHeap</a></li>
<li>GetMinItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a5438d0a47850f520b2262b5a42f75b71">data_structures::tree_234::Node</a></li>
<li>GetNextPossibleChild()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a91322b3bb0b2b2175eb56e9e10d7db46">data_structures::tree_234::Node</a></li>

5
functions_i.html
View File

@@ -99,16 +99,17 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
<li>init()&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>inOrderIterative()&#160;:&#160;<a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree</a></li>
<li>insert()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree&lt; T &gt;</a>, <a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">data_structures::linked_list::list</a>, <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">data_structures::list_array::list</a></li>
<li>Insert()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">data_structures::tree_234::Tree234</a></li>
<li>Insert()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a></li>
<li>insert()&#160;:&#160;<a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a></li>
<li>Insert()&#160;:&#160;<a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">operations_on_datastructures::trie_operations::Tnode</a></li>
<li>insert()&#160;:&#160;<a class="el" href="dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie</a></li>
<li>insert()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">probability::windowed_median::WindowedMedian</a>, <a class="el" href="dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie</a></li>
<li>insertElement()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList</a></li>
<li>InsertItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8e809ae85ae00e937f67ddb76951b6bb">data_structures::tree_234::Node</a></li>
<li>InsertItemByIndex()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a306a30931f54c84098b38d6bc8f4a956">data_structures::tree_234::Node</a></li>
<li>insertKey()&#160;:&#160;<a class="el" href="d2/d05/class_min_heap.html#aef78f3384f5a0ae880ad0883d2d44b82">MinHeap</a></li>
<li>InsertPostMerge()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#aa7e5e00033f38006a224f30bdbf3f703">data_structures::tree_234::Tree234</a></li>
<li>InsertPreSplit()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a07811b3c564a3a443b106c9aa717629d">data_structures::tree_234::Tree234</a></li>
<li>insertToSorted()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a3a7f57679e9cd6c9f042dfd0612b2b24">probability::windowed_median::WindowedMedian</a></li>
<li>Is2Node()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#afd9f83e2d5d7f22f79c1348e98914631">data_structures::tree_234::Node</a></li>
<li>Is34Node()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a6c5f929afcbad5219646990edee22e18">data_structures::tree_234::Node</a></li>
<li>is_bipartite()&#160;:&#160;<a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9b0c6400693a5cfff971f768dd5ca5ca">graph::is_graph_bipartite::Graph</a></li>

4
functions_vars.html
View File

@@ -94,7 +94,11 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index__5F" name="index__5F"></a>- _ -</h3><ul>
<li>_digits&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#af2b3ec9c35842d3a46ac7326f268af57">large_number</a></li>
<li>_itMedian&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a55ae3543a76045dffcb5ec7904a32a20">probability::windowed_median::WindowedMedian</a></li>
<li>_mod&#160;:&#160;<a class="el" href="dd/d1c/classhash__chain.html#ae9ddce410015ed8dda6380130d82d6c2">hash_chain</a></li>
<li>_sortedValues&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aacd76f078632faee1a8788d031e6c2de">probability::windowed_median::WindowedMedian</a></li>
<li>_window&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a825a7aaef844c9f743a27b268e8569b2">probability::windowed_median::WindowedMedian</a></li>
<li>_windowSize&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aafda847b152684578dab891e5268d750">probability::windowed_median::WindowedMedian</a></li>
</ul>

1
functions_w.html
View File

@@ -94,6 +94,7 @@ $(document).ready(function(){initNavTree('functions_w.html',''); initResizable()
<h3><a id="index_w" name="index_w"></a>- w -</h3><ul>
<li>weights&#160;:&#160;<a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492">machine_learning::adaline</a></li>
<li>WindowedMedian()&#160;:&#160;<a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#aac676369661d15a3eb782c0fee77d45d">probability::windowed_median::WindowedMedian</a></li>
<li>word_end&#160;:&#160;<a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html#a3cdb077745d3dc97212d693132371219">data_structures::trie_using_hashmap::Trie::Node</a></li>
</ul>
</div><!-- contents -->

2
globals_func_i.html
View File

@@ -104,8 +104,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

@@ -105,9 +105,9 @@ $(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="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.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_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="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&#160;:&#160;<a class="el" href="d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">rabin_karp.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#a541b9728fd1db77516fee913763da90e">prime_numbers.cpp</a></li>

2
globals_t.html
View File

File diff suppressed because one or more lines are too long

9
hierarchy.html
View File

@@ -143,8 +143,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_42_"><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_43_" 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/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_44_"><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_45_" 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_46_"><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_45_" 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_46_"><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_47_" 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_48_"><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/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_49_" 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/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
@@ -154,8 +154,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_53_" 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_54_"><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_55_" 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_56_"><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_57_" 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_56_"><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_57_" 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_58_"><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_59_" 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_60_"><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>
@@ -188,6 +188,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_79_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_80_"><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_81_" 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_82_"><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 -->

7
hierarchy.js
View File

@@ -47,8 +47,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::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
@@ -58,8 +58,8 @@ var hierarchy =
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
[ "Point", "d8/dc8/struct_point.html", null ],
[ "query", "dd/d1b/structquery.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
[ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
[ "RBtree", "d8/d72/class_r_btree.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
@@ -94,5 +94,6 @@ var hierarchy =
[ "std::is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ]
] ],
[ "uint128_t", "db/d9a/classuint128__t.html", null ],
[ "uint256_t", "d1/d83/classuint256__t.html", null ]
[ "uint256_t", "d1/d83/classuint256__t.html", null ],
[ "probability::windowed_median::WindowedMedian", "df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html", null ]
];

8
index.html
View File

@@ -95,10 +95,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
<div class="contents">
<div class="textblock"><p ><a class="anchor" id="mainpage"></a></p>
<p ><a href="https://gitpod.io/#https://github.com/TheAlgorithms/C-Plus-Plus" target="_blank"><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code" class="inline"/></a> <a href="https://lgtm.com/projects/g/TheAlgorithms/C-Plus-Plus/context:cpp" target="_blank"><img src="https://img.shields.io/lgtm/grade/cpp/g/TheAlgorithms/C-Plus-Plus.svg?logo=lgtm&amp;logoWidth=18" alt="Language grade: C/C++" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/actions/workflows/codeql_analysis.yml" target="_blank"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/actions/workflows/codeql_analysis.yml/badge.svg" alt="CodeQL CI" style="pointer-events: none;" class="inline"/></a> <a href="https://gitter.im/TheAlgorithms" target="_blank"><img src="https://img.shields.io/badge/Chat-Gitter-ff69b4.svg?label=Chat&amp;logo=gitter&amp;style=flat-square" alt="Gitter chat" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md" target="_blank"><img src="https://img.shields.io/static/v1.svg?label=Contributions&amp;message=Welcome&amp;color=0059b3&amp;style=flat-square" alt="contributions welcome" style="pointer-events: none;" class="inline"/></a> <img src="https://img.shields.io/github/repo-size/TheAlgorithms/C-Plus-Plus?color=red&amp;style=flat-square" alt="GitHub repo size" class="inline"/> <a href="https://TheAlgorithms.github.io/C-Plus-Plus" target="_blank"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Doxygen%20CI/badge.svg" alt="Doxygen CI" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/actions?query=workflow%3A%22Awesome+CI+Workflow%22" target="_blank"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Awesome%20CI%20Workflow/badge.svg" alt="Awesome CI" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms" target="_blank"><img src="https://img.shields.io/liberapay/receives/TheAlgorithms.svg?logo=liberapay" alt="Income" style="pointer-events: none;" class="inline"/></a> <a href="https://discord.gg/c7MnfGFGa6" target="_blank"><img src="https://img.shields.io/discord/808045925556682782.svg?logo=discord&amp;colorB=7289DA" alt="Discord chat" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms/donate" target="_blank"><img src="https://liberapay.com/assets/widgets/donate.svg" alt="Donate" style="pointer-events: none;" class="inline"/></a></p>
<h1><a class="anchor" id="autotoc_md90"></a>
<h1><a class="anchor" id="autotoc_md91"></a>
Overview</h1>
<p >This repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/LICENSE" target="_blank">MIT License</a>. These algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.</p>
<h1><a class="anchor" id="autotoc_md91"></a>
<h1><a class="anchor" id="autotoc_md92"></a>
Features</h1>
<ul>
<li>The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - <a href="https://en.wikipedia.org/wiki/C%2B%2B" target="_blank">C++</a>.</li>
@@ -109,12 +109,12 @@ Features</h1>
<li>Self-checks within programs ensure correct implementations with confidence.</li>
<li>Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.</li>
</ul>
<h1><a class="anchor" id="autotoc_md92"></a>
<h1><a class="anchor" id="autotoc_md93"></a>
Documentation</h1>
<p ><a href="https://TheAlgorithms.github.io/C-Plus-Plus" target="_blank">Online Documentation</a> is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on <a href="https://TheAlgorithms.github.io/C-Plus-Plus/files.html" target="_blank">Files menu</a> to see the list of all the files documented with the code.</p>
<p ><a href="https://thealgorithms.github.io/C-Plus-Plus" target="_blank">Documentation of Algorithms in C++</a> by <a href="https://github.com/TheAlgorithms/C-Plus-Plus/graphs/contributors" target="_blank">The Algorithms Contributors</a> is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/?ref=chooser-v1" target="_blank">CC BY-SA 4.0</a><br />
<a href="https://creativecommons.org/licenses/by-sa/4.0"><img src="https://mirrors.creativecommons.org/presskit/icons/cc.svg" alt="Creative Commons License" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/by.svg" alt="Credit must be given to the creator" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/sa.svg" alt="Adaptations must be shared under the same terms" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/></a></p>
<h1><a class="anchor" id="autotoc_md93"></a>
<h1><a class="anchor" id="autotoc_md94"></a>
Contributions</h1>
<p >As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md" target="_blank">Contribution Guidelines</a>. </p>
</div></div><!-- PageDoc -->

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="$da/dd1/structquadratic__probing_1_1_entry.html" title=" " alt="" coords="5,5,141,47"/>
<area shape="rect" id="node1" href="$df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" title="A class to calculate the median of a leading sliding window at the back of a stream of integer values..." alt="" coords="5,5,192,47"/>
</map>

2
inherit_graph_59.md5
View File

@@ -1 +1 @@
6cac1c113b0aa0693cc268a362aeb46e
a2250425f0bc6684c642ddc1033966c1

14
inherit_graph_59.svg
View File

@@ -4,18 +4,18 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="110pt" height="39pt"
viewBox="0.00 0.00 110.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="148pt" height="39pt"
viewBox="0.00 0.00 148.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 106,-35 106,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 144,-35 144,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="da/dd1/structquadratic__probing_1_1_entry.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 102,-30.5 102,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
<text text-anchor="middle" x="51" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Entry</text>
<g id="a_node1"><a xlink:href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_top" xlink:title="A class to calculate the median of a leading sliding window at the back of a stream of integer values...">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 140,-30.5 140,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">probability::windowed</text>
<text text-anchor="middle" x="70" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_median::WindowedMedian</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 1.3 KiB

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="$dd/d1b/structquery.html" title=" " alt="" coords="5,5,61,32"/>
<area shape="rect" id="node1" href="$da/dd1/structquadratic__probing_1_1_entry.html" title=" " alt="" coords="5,5,141,47"/>
</map>

2
inherit_graph_60.md5
View File

@@ -1 +1 @@
bec59f87893a1ff0344686ba3ed67359
6cac1c113b0aa0693cc268a362aeb46e

15
inherit_graph_60.svg
View File

@@ -4,17 +4,18 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="50pt" height="28pt"
viewBox="0.00 0.00 50.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)">
<svg width="110pt" height="39pt"
viewBox="0.00 0.00 110.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,-24 46,-24 46,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 106,-35 106,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/d1b/structquery.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 42,-19.5 42,-0.5 0,-0.5"/>
<text text-anchor="middle" x="21" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">query</text>
<g id="a_node1"><a xlink:href="da/dd1/structquadratic__probing_1_1_entry.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 102,-30.5 102,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">quadratic_probing::</text>
<text text-anchor="middle" x="51" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Entry</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 990 B

After

Width:  |  Height:  |  Size: 1.1 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="$dc/db5/struct_queue.html" title=" " alt="" coords="5,5,68,32"/>
<area shape="rect" id="node1" href="$dd/d1b/structquery.html" title=" " alt="" coords="5,5,61,32"/>
</map>

2
inherit_graph_61.md5
View File

@@ -1 +1 @@
75b8c6171df3d450e7b6057dcc7a759b
bec59f87893a1ff0344686ba3ed67359

12
inherit_graph_61.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="55pt" height="28pt"
viewBox="0.00 0.00 55.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="50pt" height="28pt"
viewBox="0.00 0.00 50.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 51,-24 51,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 46,-24 46,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dc/db5/struct_queue.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 47,-19.5 47,-0.5 0,-0.5"/>
<text text-anchor="middle" x="23.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Queue</text>
<g id="a_node1"><a xlink:href="dd/d1b/structquery.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 42,-19.5 42,-0.5 0,-0.5"/>
<text text-anchor="middle" x="21" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">query</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 993 B

After

Width:  |  Height:  |  Size: 990 B

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="$db/da9/classqueue.html" title=" " alt="" coords="5,5,115,32"/>
<area shape="rect" id="node1" href="$dc/db5/struct_queue.html" title=" " alt="" coords="5,5,68,32"/>
</map>

2
inherit_graph_62.md5
View File

@@ -1 +1 @@
dda763a0bdfe4bfcb05a0b97b5c11e0a
75b8c6171df3d450e7b6057dcc7a759b

12
inherit_graph_62.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="90pt" height="28pt"
viewBox="0.00 0.00 90.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="55pt" height="28pt"
viewBox="0.00 0.00 55.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 86,-24 86,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 51,-24 51,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="db/da9/classqueue.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 82,-19.5 82,-0.5 0,-0.5"/>
<text text-anchor="middle" x="41" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">queue&lt; Kind &gt;</text>
<g id="a_node1"><a xlink:href="dc/db5/struct_queue.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 47,-19.5 47,-0.5 0,-0.5"/>
<text text-anchor="middle" x="23.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Queue</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1003 B

After

Width:  |  Height:  |  Size: 993 B

4
inherit_graph_63.map
View File

@@ -1,5 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" title="Segment Tree, to store heavy chains." alt="" coords="5,5,156,61"/>
<area shape="rect" id="node2" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" title="The Heavy&#45;Light Decomposition class." alt="" coords="204,45,355,101"/>
<area shape="rect" id="node3" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting." alt="" coords="5,85,156,141"/>
<area shape="rect" id="node1" href="$db/da9/classqueue.html" title=" " alt="" coords="5,5,115,32"/>
</map>

2
inherit_graph_63.md5
View File

@@ -1 +1 @@
64337505fb52cfd3779b0ee4bc374f30
dda763a0bdfe4bfcb05a0b97b5c11e0a

50
inherit_graph_63.svg
View File

@@ -4,55 +4,19 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="270pt" height="110pt"
viewBox="0.00 0.00 270.00 110.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 106)">
<svg width="90pt" height="28pt"
viewBox="0.00 0.00 90.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,-106 266,-106 266,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 86,-24 86,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_top" xlink:title="Segment Tree, to store heavy chains.">
<polygon fill="white" stroke="black" points="0,-60.5 0,-101.5 113,-101.5 113,-60.5 0,-60.5"/>
<text text-anchor="start" x="8" y="-89.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
<text text-anchor="start" x="8" y="-78.5" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
<text text-anchor="middle" x="56.5" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">::SG&lt; X &gt;</text>
<g id="a_node1"><a xlink:href="db/da9/classqueue.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 82,-19.5 82,-0.5 0,-0.5"/>
<text text-anchor="middle" x="41" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">queue&lt; Kind &gt;</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="node2" class="node">
<title>Node1</title>
<g id="a_node2"><a xlink:href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_top" xlink:title="The Heavy&#45;Light Decomposition class.">
<polygon fill="white" stroke="black" points="149,-30.5 149,-71.5 262,-71.5 262,-30.5 149,-30.5"/>
<text text-anchor="start" x="157" y="-59.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
<text text-anchor="start" x="157" y="-48.5" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
<text text-anchor="middle" x="205.5" y="-37.5" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD&lt; X &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node0&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M123.08,-67.62C131.68,-65.86 140.43,-64.08 148.85,-62.36"/>
<polygon fill="midnightblue" stroke="midnightblue" points="122.17,-64.23 113.07,-69.66 123.57,-71.09 122.17,-64.23"/>
</g>
<!-- Node76 -->
<g id="node3" class="node">
<title>Node76</title>
<g id="a_node3"><a xlink:href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_top" xlink:title="A Basic Tree, which supports binary lifting.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 113,-41.5 113,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
<text text-anchor="middle" x="56.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree&lt; X &gt;</text>
</a>
</g>
</g>
<!-- Node76&#45;&gt;Node1 -->
<g id="edge2" class="edge">
<title>Node76&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M123.08,-34.38C131.68,-36.14 140.43,-37.92 148.85,-39.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="123.57,-30.91 113.07,-32.34 122.17,-37.77 123.57,-30.91"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 1003 B

4
inherit_graph_64.map
View File

@@ -1,3 +1,5 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d8/d28/classrange__queries_1_1per_seg_tree.html" title="Range query here is range sum, but the code can be modified to make different queries like range max ..." alt="" coords="5,5,189,32"/>
<area shape="rect" id="node1" href="$d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" title="Segment Tree, to store heavy chains." alt="" coords="5,5,156,61"/>
<area shape="rect" id="node2" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" title="The Heavy&#45;Light Decomposition class." alt="" coords="204,45,355,101"/>
<area shape="rect" id="node3" href="$d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting." alt="" coords="5,85,156,141"/>
</map>

2
inherit_graph_64.md5
View File

@@ -1 +1 @@
b727b49d33eaac846613f24543c7515b
64337505fb52cfd3779b0ee4bc374f30

50
inherit_graph_64.svg
View File

@@ -4,19 +4,55 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="146pt" height="28pt"
viewBox="0.00 0.00 146.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)">
<svg width="270pt" height="110pt"
viewBox="0.00 0.00 270.00 110.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 106)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 142,-24 142,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-106 266,-106 266,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_top" xlink:title="Range query here is range sum, but the code can be modified to make different queries like range max ...">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 138,-19.5 138,-0.5 0,-0.5"/>
<text text-anchor="middle" x="69" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<g id="a_node1"><a xlink:href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_top" xlink:title="Segment Tree, to store heavy chains.">
<polygon fill="white" stroke="black" points="0,-60.5 0,-101.5 113,-101.5 113,-60.5 0,-60.5"/>
<text text-anchor="start" x="8" y="-89.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
<text text-anchor="start" x="8" y="-78.5" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
<text text-anchor="middle" x="56.5" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">::SG&lt; X &gt;</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="node2" class="node">
<title>Node1</title>
<g id="a_node2"><a xlink:href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_top" xlink:title="The Heavy&#45;Light Decomposition class.">
<polygon fill="white" stroke="black" points="149,-30.5 149,-71.5 262,-71.5 262,-30.5 149,-30.5"/>
<text text-anchor="start" x="157" y="-59.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
<text text-anchor="start" x="157" y="-48.5" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
<text text-anchor="middle" x="205.5" y="-37.5" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD&lt; X &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node0&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M123.08,-67.62C131.68,-65.86 140.43,-64.08 148.85,-62.36"/>
<polygon fill="midnightblue" stroke="midnightblue" points="122.17,-64.23 113.07,-69.66 123.57,-71.09 122.17,-64.23"/>
</g>
<!-- Node76 -->
<g id="node3" class="node">
<title>Node76</title>
<g id="a_node3"><a xlink:href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_top" xlink:title="A Basic Tree, which supports binary lifting.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 113,-41.5 113,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
<text text-anchor="middle" x="56.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree&lt; X &gt;</text>
</a>
</g>
</g>
<!-- Node76&#45;&gt;Node1 -->
<g id="edge2" class="edge">
<title>Node76&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M123.08,-34.38C131.68,-36.14 140.43,-37.92 148.85,-39.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="123.57,-30.91 113.07,-32.34 122.17,-37.77 123.57,-30.91"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 3.3 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="$d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" title=" " alt="" coords="5,5,189,47"/>
<area shape="rect" id="node1" href="$d8/d28/classrange__queries_1_1per_seg_tree.html" title="Range query here is range sum, but the code can be modified to make different queries like range max ..." alt="" coords="5,5,189,32"/>
</map>

2
inherit_graph_65.md5
View File

@@ -1 +1 @@
bdb91a66072aac6e54cadd23f1d913b8
b727b49d33eaac846613f24543c7515b

15
inherit_graph_65.svg
View File

@@ -4,18 +4,17 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="146pt" height="39pt"
viewBox="0.00 0.00 146.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="146pt" height="28pt"
viewBox="0.00 0.00 146.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,-35 142,-35 142,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 142,-24 142,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 138,-30.5 138,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="69" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
<g id="a_node1"><a xlink:href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_top" xlink:title="Range query here is range sum, but the code can be modified to make different queries like range max ...">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 138,-19.5 138,-0.5 0,-0.5"/>
<text text-anchor="middle" x="69" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 1.1 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="$d8/d72/class_r_btree.html" title=" " alt="" coords="5,5,69,32"/>
<area shape="rect" id="node1" href="$d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" title=" " alt="" coords="5,5,189,47"/>
</map>

2
inherit_graph_66.md5
View File

@@ -1 +1 @@
cef884937e61d3db890f68522f268f88
bdb91a66072aac6e54cadd23f1d913b8

15
inherit_graph_66.svg
View File

@@ -4,17 +4,18 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="56pt" height="28pt"
viewBox="0.00 0.00 56.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)">
<svg width="146pt" height="39pt"
viewBox="0.00 0.00 146.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,-24 52,-24 52,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 142,-35 142,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d8/d72/class_r_btree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 48,-19.5 48,-0.5 0,-0.5"/>
<text text-anchor="middle" x="24" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">RBtree</text>
<g id="a_node1"><a xlink:href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 138,-30.5 138,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
<text text-anchor="middle" x="69" 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: 993 B

After

Width:  |  Height:  |  Size: 1.1 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="$da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list." alt="" coords="5,5,160,47"/>
<area shape="rect" id="node1" href="$d8/d72/class_r_btree.html" title=" " alt="" coords="5,5,69,32"/>
</map>

2
inherit_graph_67.md5
View File

@@ -1 +1 @@
20bec266e6a4e80cf8cf4d236a64bdb3
cef884937e61d3db890f68522f268f88

15
inherit_graph_67.svg
View File

@@ -4,18 +4,17 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="124pt" height="39pt"
viewBox="0.00 0.00 124.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="56pt" height="28pt"
viewBox="0.00 0.00 56.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,-35 120,-35 120,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 52,-24 52,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_top" xlink:title="A Node structure representing a single link Node in a linked list.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 116,-30.5 116,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
<text text-anchor="middle" x="58" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
<g id="a_node1"><a xlink:href="d8/d72/class_r_btree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 48,-19.5 48,-0.5 0,-0.5"/>
<text text-anchor="middle" x="24" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">RBtree</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 993 B

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="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,149,32"/>
<area shape="rect" id="node1" href="$da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list." alt="" coords="5,5,160,47"/>
</map>

2
inherit_graph_68.md5
View File

@@ -1 +1 @@
15c0758977894124ce8483f7108e3e73
20bec266e6a4e80cf8cf4d236a64bdb3

15
inherit_graph_68.svg
View File

@@ -4,17 +4,18 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="116pt" height="28pt"
viewBox="0.00 0.00 116.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)">
<svg width="124pt" height="39pt"
viewBox="0.00 0.00 124.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,-24 112,-24 112,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 120,-35 120,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 108,-19.5 108,-0.5 0,-0.5"/>
<text text-anchor="middle" x="54" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
<g id="a_node1"><a xlink:href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_top" xlink:title="A Node structure representing a single link Node in a linked list.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 116,-30.5 116,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
<text text-anchor="middle" x="58" 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: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.2 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/d4f/class_solution.html" title=" " alt="" coords="5,5,76,32"/>
<area shape="rect" id="node1" href="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,149,32"/>
</map>

2
inherit_graph_69.md5
View File

@@ -1 +1 @@
d29718af26117f8d229cea6c31073750
15c0758977894124ce8483f7108e3e73

12
inherit_graph_69.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="61pt" height="28pt"
viewBox="0.00 0.00 61.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="116pt" height="28pt"
viewBox="0.00 0.00 116.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 57,-24 57,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 112,-24 112,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 53,-19.5 53,-0.5 0,-0.5"/>
<text text-anchor="middle" x="26.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
<g id="a_node1"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 108,-19.5 108,-0.5 0,-0.5"/>
<text text-anchor="middle" x="54" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 998 B

After

Width:  |  Height:  |  Size: 1.0 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="$d1/dc2/classstack.html" title=" " alt="" coords="5,5,111,32"/>
<area shape="rect" id="node1" href="$dd/d4f/class_solution.html" title=" " alt="" coords="5,5,76,32"/>
</map>

2
inherit_graph_70.md5
View File

@@ -1 +1 @@
172cf06ef071a5ae65c47d2b08429ea1
d29718af26117f8d229cea6c31073750

12
inherit_graph_70.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.49.1 (20210923.0004)
-->
<!-- 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="61pt" height="28pt"
viewBox="0.00 0.00 61.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 57,-24 57,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d1/dc2/classstack.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">stack&lt; Type &gt;</text>
<g id="a_node1"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 53,-19.5 53,-0.5 0,-0.5"/>
<text text-anchor="middle" x="26.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1005 B

After

Width:  |  Height:  |  Size: 998 B

2
inherit_graph_71.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,32"/>
<area shape="rect" id="node1" href="$d1/dc2/classstack.html" title=" " alt="" coords="5,5,111,32"/>
</map>

2
inherit_graph_71.md5
View File

@@ -1 +1 @@
a99fca445652dfb292d35f8fd85290cf
172cf06ef071a5ae65c47d2b08429ea1

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