mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 12:23:13 +08:00
Documentation for 43ce63682a
This commit is contained in:
realstealthninja
@@ -283,41 +283,42 @@ $(function(){initNavTree('annotated.html','',''); });
|
||||
<tr id="row_43_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_45_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d21/class_longest___substring.html" target="_self">Longest_Substring</a></td><td class="desc">Class that solves the Longest Substring Without Repeating Characters problem </td></tr>
|
||||
<tr id="row_46_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_47_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_49_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_50_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_51_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d1b/classpriority__queue.html" target="_self">priority_queue</a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_53_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_55_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_57_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d9f/class_s_j_f.html" target="_self">SJF</a></td><td class="desc">Class which implements the <a class="el" href="d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> scheduling algorithm </td></tr>
|
||||
<tr id="row_59_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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">For std::invalid_argument </td></tr>
|
||||
<tr id="row_61_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d0f/classstats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_63_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d02/classstats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
|
||||
<tr id="row_65_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_67_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_67_" class="arrow" onclick="dynsection.toggleFolder('67_')"><span class="arrowhead closed"></span></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_67_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_69_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_70_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_70_" class="arrow" onclick="dynsection.toggleFolder('70_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d6d/classunordered__set.html" target="_self">unordered_set</a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_70_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d02/classunordered__set_1_1const__iterator.html" target="_self">const_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_70_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d21/classunordered__set_1_1const__reverse__iterator.html" target="_self">const_reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_70_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5e/classunordered__set_1_1iterator.html" target="_self">iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_70_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/da8/classunordered__set_1_1reverse__iterator.html" target="_self">reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_71_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_71_" class="arrow" onclick="dynsection.toggleFolder('71_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/dfc/classvector.html" target="_self">vector</a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_71_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df5/classvector_1_1const__iterator.html" target="_self">const_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_71_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d51/classvector_1_1const__reverse__iterator.html" target="_self">const_reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_71_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d05/classvector_1_1iterator.html" target="_self">iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_71_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d96/classvector_1_1reverse__iterator.html" target="_self">reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_46_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d15/class_memorised_factorial.html" target="_self">MemorisedFactorial</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_47_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_49_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_50_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_51_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_53_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d1b/classpriority__queue.html" target="_self">priority_queue</a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_55_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_57_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_59_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d9f/class_s_j_f.html" target="_self">SJF</a></td><td class="desc">Class which implements the <a class="el" href="d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> scheduling algorithm </td></tr>
|
||||
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_61_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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">For std::invalid_argument </td></tr>
|
||||
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_63_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d0f/classstats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d02/classstats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_65_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
|
||||
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_67_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_68_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_68_" class="arrow" onclick="dynsection.toggleFolder('68_')"><span class="arrowhead closed"></span></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_68_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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_69_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_71_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_71_" class="arrow" onclick="dynsection.toggleFolder('71_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d6d/classunordered__set.html" target="_self">unordered_set</a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_71_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d02/classunordered__set_1_1const__iterator.html" target="_self">const_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_71_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d21/classunordered__set_1_1const__reverse__iterator.html" target="_self">const_reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_71_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5e/classunordered__set_1_1iterator.html" target="_self">iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_71_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/da8/classunordered__set_1_1reverse__iterator.html" target="_self">reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_72_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_72_" class="arrow" onclick="dynsection.toggleFolder('72_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/dfc/classvector.html" target="_self">vector</a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_72_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df5/classvector_1_1const__iterator.html" target="_self">const_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_72_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d51/classvector_1_1const__reverse__iterator.html" target="_self">const_reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_72_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d05/classvector_1_1iterator.html" target="_self">iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_72_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d96/classvector_1_1reverse__iterator.html" target="_self">reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -217,6 +217,7 @@ var annotated_dup =
|
||||
[ "list", "d8/d10/structlist.html", "d8/d10/structlist" ],
|
||||
[ "ListNode", "d7/da4/struct_list_node.html", "d7/da4/struct_list_node" ],
|
||||
[ "Longest_Substring", "da/d21/class_longest___substring.html", "da/d21/class_longest___substring" ],
|
||||
[ "MemorisedFactorial", "da/d15/class_memorised_factorial.html", "da/d15/class_memorised_factorial" ],
|
||||
[ "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 ],
|
||||
|
||||
@@ -153,7 +153,7 @@ $(function(){initNavTree('classes.html','',''); });
|
||||
<dd><a class="el" href="db/d82/classlarge__number.html">large_number</a></dd><dd><a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html">LFUCache</a> (<a class="el" href="db/dde/namespaceothers_1_1_cache.html">others::Cache</a>)</dd><dd><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> (data_structures::linked_list)</dd><dd><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a></dd><dd><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> (data_structures::linked_list)</dd><dd><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html">list</a> (data_structures::list_array)</dd><dd><a class="el" href="d8/d10/structlist.html">list</a></dd><dd><a class="el" href="d7/da4/struct_list_node.html">ListNode</a></dd><dd><a class="el" href="da/d21/class_longest___substring.html">Longest_Substring</a></dd><dd><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd><dd><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html">LRUCache</a> (<a class="el" href="db/dde/namespaceothers_1_1_cache.html">others::Cache</a>)</dd><dd><a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html">LRUCache</a> (others::lru_cache)</dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a id="letter_M" name="letter_M">M</a></dt>
|
||||
<dd><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> (divide_and_conquer::strassens_multiplication)</dd><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>
|
||||
<dd><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html">Matrix</a> (divide_and_conquer::strassens_multiplication)</dd><dd><a class="el" href="da/d15/class_memorised_factorial.html">MemorisedFactorial</a></dd><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 even">
|
||||
<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="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> (others::recursive_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd><dd><a class="el" href="d6/d7c/structtests_1_1_node.html">Node</a> (<a class="el" href="d9/df4/namespacetests.html">tests</a>)</dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd></dl>
|
||||
|
||||
@@ -119,44 +119,35 @@ $(function(){initNavTree('d2/d96/factorial__memoization_8cpp.html','../../','');
|
||||
|
||||
<p><a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> calculation using recursion and <a href="https://en.wikipedia.org/wiki/Memoization" target="_blank">memoization</a>
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
<code>#include <array></code><br />
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <cstdint></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for factorial_memoization.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../db/d30/factorial__memoization_8cpp__incl.svg" width="330" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../db/d30/factorial__memoization_8cpp__incl.svg" width="242" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div>
|
||||
<p><a href="../../d2/d96/factorial__memoization_8cpp_source.html">Go to the source code of this file.</a></p>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:math" id="r_math"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html">math</a></td></tr>
|
||||
<tr class="memdesc:dd/d47/namespacemath"><td class="mdescLeft"> </td><td class="mdescRight">for assert <br /></td></tr>
|
||||
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
|
||||
Classes</h2></td></tr>
|
||||
<tr class="memitem:MemorisedFactorial" id="r_MemorisedFactorial"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a></td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:a73b07abea036f1ce2e3ac5dc169bdb4b" id="r_a73b07abea036f1ce2e3ac5dc169bdb4b"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a> (uint64_t n)</td></tr>
|
||||
<tr class="memdesc:a73b07abea036f1ce2e3ac5dc169bdb4b"><td class="mdescLeft"> </td><td class="mdescRight">Computes the factorial of a non-negative integer using recursion and memoization. <br /></td></tr>
|
||||
<tr class="memitem:a4243a60d73b9e1296de20196d5b155ba" id="r_a4243a60d73b9e1296de20196d5b155ba"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a> ()</td></tr>
|
||||
<tr class="memdesc:a4243a60d73b9e1296de20196d5b155ba"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations for the fact_recursion function. <br /></td></tr>
|
||||
<tr class="memitem:a9751a0bc20119c085f67d577bd642a5c" id="r_a9751a0bc20119c085f67d577bd642a5c"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a9751a0bc20119c085f67d577bd642a5c">test_MemorisedFactorial_in_order</a> ()</td></tr>
|
||||
<tr class="memitem:a6be06a21e64f22e64d368e157dfee106" id="r_a6be06a21e64f22e64d368e157dfee106"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a6be06a21e64f22e64d368e157dfee106">test_MemorisedFactorial_no_order</a> ()</td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function to run test cases and interact with the user. <br /></td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 id="header-var-members" class="groupheader"><a id="var-members" name="var-members"></a>
|
||||
Variables</h2></td></tr>
|
||||
<tr class="memitem:a0f9b4d5fae79e1029daf9bd1b93ec217" id="r_a0f9b4d5fae79e1029daf9bd1b93ec217"><td class="memItemLeft" align="right" valign="top">std::array< uint64_t, 1000 > </td><td class="memItemRight" valign="bottom"><a class="el" href="#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> {0}</td></tr>
|
||||
<tr class="memdesc:a0f9b4d5fae79e1029daf9bd1b93ec217"><td class="mdescLeft"> </td><td class="mdescRight">Array to store computed factorials for memoization. <br /></td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function to run tests. <br /></td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Factorial" target="_blank">Factorial</a> calculation using recursion and <a href="https://en.wikipedia.org/wiki/Memoization" target="_blank">memoization</a> </p>
|
||||
<p>This program computes the factorial of a non-negative integer using recursion with memoization (top-down dynamic programming). It stores intermediate results to avoid redundant calculations for improved efficiency.</p>
|
||||
<p>Memoization is a form of caching where the result to an expensive function call is stored and returned. Example: Input: n = 5 Output: 120</p>
|
||||
<p>Explanation: 5! = 5 × 4 × 3 × 2 × 1 = 120</p>
|
||||
<p>The program uses a recursive function fact_recursion which caches computed results in a memo array to avoid recalculating factorials for the same numbers.</p>
|
||||
<p>Time Complexity: O(n) Space Complexity: O(n) </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/git5v" target="_blank">Vedant Mukhedkar</a> </dd></dl>
|
||||
<p>The program uses a recursive function which caches computed results in a memo array to avoid recalculating factorials for the same numbers.</p>
|
||||
<p>Time Complexity: O(n) Space Complexity: O(n) </p>
|
||||
|
||||
<p class="definition">Definition in file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
|
||||
@@ -175,27 +166,26 @@ Variables</h2></td></tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Main function to run test cases and interact with the user. </p>
|
||||
<p>Main function to run tests. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on program success </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00069">69</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 69</span> {</div>
|
||||
<div class="line"><span class="lineno"> 70</span> <span class="comment">// Run test cases</span></div>
|
||||
<div class="line"><span class="lineno"> 71</span> <a class="code hl_function" href="#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a>();</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 73</span>}</div>
|
||||
<div class="ttc" id="afactorial__memoization_8cpp_html_a4243a60d73b9e1296de20196d5b155ba"><div class="ttname"><a href="#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a></div><div class="ttdeci">void test_fact_recursion()</div><div class="ttdoc">Self-test implementations for the fact_recursion function.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00056">factorial_memoization.cpp:56</a></div></div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00061">61</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 61</span> {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> test_MemorisedFactorial_in_order();</div>
|
||||
<div class="line"><span class="lineno"> 63</span> test_MemorisedFactorial_no_order();</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 65</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a4243a60d73b9e1296de20196d5b155ba" name="a4243a60d73b9e1296de20196d5b155ba"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a4243a60d73b9e1296de20196d5b155ba">◆ </a></span>test_fact_recursion()</h2>
|
||||
<a id="a9751a0bc20119c085f67d577bd642a5c" name="a9751a0bc20119c085f67d577bd642a5c"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a9751a0bc20119c085f67d577bd642a5c">◆ </a></span>test_MemorisedFactorial_in_order()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void test_fact_recursion </td>
|
||||
<td class="memname">void test_MemorisedFactorial_in_order </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
||||
<td></td>
|
||||
@@ -203,39 +193,39 @@ Variables</h2></td></tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Self-test implementations for the fact_recursion function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00056">56</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 56</span> {</div>
|
||||
<div class="line"><span class="lineno"> 57</span> <span class="comment">// Test cases for factorial computation</span></div>
|
||||
<div class="line"><span class="lineno"> 58</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(0) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 59</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(1) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 60</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(5) == 120);</div>
|
||||
<div class="line"><span class="lineno"> 61</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(10) == 3628800);</div>
|
||||
<div class="line"><span class="lineno"> 62</span> std::cout << <span class="stringliteral">"All test cases passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 63</span>}</div>
|
||||
<div class="ttc" id="anamespacemath_html_a73b07abea036f1ce2e3ac5dc169bdb4b"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a></div><div class="ttdeci">uint64_t fact_recursion(uint64_t n)</div><div class="ttdoc">Computes the factorial of a non-negative integer using recursion and memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00044">factorial_memoization.cpp:44</a></div></div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 44</span> {</div>
|
||||
<div class="line"><span class="lineno"> 45</span> <span class="keyword">auto</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a> = <a class="code hl_class" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a>();</div>
|
||||
<div class="line"><span class="lineno"> 46</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(0) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 47</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(1) == 1);</div>
|
||||
<div class="line"><span class="lineno"> 48</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(5) == 120);</div>
|
||||
<div class="line"><span class="lineno"> 49</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(10) == 3628800);</div>
|
||||
<div class="line"><span class="lineno"> 50</span>}</div>
|
||||
<div class="ttc" id="aclass_memorised_factorial_html"><div class="ttname"><a href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a></div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00027">factorial_memoization.cpp:27</a></div></div>
|
||||
<div class="ttc" id="anamespacemath_html_a7e78996673df791014cfe540b183456a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a></div><div class="ttdeci">uint64_t factorial(uint8_t n)</div><div class="ttdoc">function to find factorial of given number</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d00/factorial_8cpp_source.html#l00029">factorial.cpp:29</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a name="doc-var-members" id="doc-var-members"></a><h2 id="header-doc-var-members" class="groupheader">Variable Documentation</h2>
|
||||
<a id="a0f9b4d5fae79e1029daf9bd1b93ec217" name="a0f9b4d5fae79e1029daf9bd1b93ec217"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a0f9b4d5fae79e1029daf9bd1b93ec217">◆ </a></span>memo</h2>
|
||||
<a id="a6be06a21e64f22e64d368e157dfee106" name="a6be06a21e64f22e64d368e157dfee106"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a6be06a21e64f22e64d368e157dfee106">◆ </a></span>test_MemorisedFactorial_no_order()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">std::array<uint64_t, 1000> memo {0}</td>
|
||||
<td class="memname">void test_MemorisedFactorial_no_order </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Array to store computed factorials for memoization. </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 31</span>{0};</div>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 52</span> {</div>
|
||||
<div class="line"><span class="lineno"> 53</span> <span class="keyword">auto</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a> = <a class="code hl_class" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a>();</div>
|
||||
<div class="line"><span class="lineno"> 54</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(10) == 3628800);</div>
|
||||
<div class="line"><span class="lineno"> 55</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
@@ -1,7 +1,5 @@
|
||||
var factorial__memoization_8cpp =
|
||||
[
|
||||
[ "math::fact_recursion", "dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b", null ],
|
||||
[ "main", "d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "test_fact_recursion", "d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba", null ],
|
||||
[ "memo", "d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217", null ]
|
||||
[ "MemorisedFactorial", "da/d15/class_memorised_factorial.html", "da/d15/class_memorised_factorial" ],
|
||||
[ "main", "d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ]
|
||||
];
|
||||
@@ -117,49 +117,51 @@ $(function(){initNavTree('d2/d96/factorial__memoization_8cpp_source.html','../..
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<a href="../../d2/d96/factorial__memoization_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
||||
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
|
||||
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <iostream></span> <span class="comment">// for std::cout</span></div>
|
||||
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <cassert></span> <span class="comment">// For test cases</span></div>
|
||||
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include <array></span> <span class="comment">// For std::array</span></div>
|
||||
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include <cstdint></span> <span class="comment">// For uint64_t</span></div>
|
||||
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span></div>
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"><a class="line" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217"> 31</a></span>std::array<uint64_t, 1000> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>{0};</div>
|
||||
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span></div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d47/namespacemath.html">math</a> {</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span></div>
|
||||
<div class="foldopen" id="foldopen00044" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b"> 44</a></span>uint64_t <a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">fact_recursion</a>(uint64_t n) {</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span> 1; <span class="comment">// Base case: 0! = 1</span></div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n] != 0) <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n]; <span class="comment">// Return already computed value</span></div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n] = n * <a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">fact_recursion</a>(n - 1); <span class="comment">// Store and return the computed value</span></div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n];</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span>}</div>
|
||||
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
|
||||
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <cassert></span> <span class="comment">// For test cases</span></div>
|
||||
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <cstdint></span> <span class="comment">// For uint64_t</span></div>
|
||||
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <vector></span> <span class="comment">// For std::vector</span></div>
|
||||
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
|
||||
<div class="foldopen" id="foldopen00027" data-start="{" data-end="};">
|
||||
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../da/d15/class_memorised_factorial.html"> 27</a></span><span class="keyword">class </span><a class="code hl_class" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a> {</div>
|
||||
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> std::vector<std::uint64_t> known_values = {1};</div>
|
||||
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> </div>
|
||||
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">public</span>:</div>
|
||||
<div class="foldopen" id="foldopen00036" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"><a class="line" href="../../da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29"> 36</a></span> std::uint64_t <a class="code hl_function" href="../../da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29">operator()</a>(std::uint64_t n) {</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <span class="keywordflow">if</span> (n >= this->known_values.size()) {</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> this->known_values.push_back(n * this-><span class="keyword">operator</span>()(n - 1));</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> }</div>
|
||||
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keywordflow">return</span> this->known_values.at(n);</div>
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span>} <span class="comment">// namespace math</span></div>
|
||||
<div class="foldopen" id="foldopen00056" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"><a class="line" href="../../d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba"> 56</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="../../d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a>() {</div>
|
||||
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// Test cases for factorial computation</span></div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(0) == 1);</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(1) == 1);</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(5) == 120);</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a>(10) == 3628800);</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> std::cout << <span class="stringliteral">"All test cases passed!\n"</span>;</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span>}</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span>};</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span></div>
|
||||
<div class="foldopen" id="foldopen00069" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"><a class="line" href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 69</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// Run test cases</span></div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <a class="code hl_function" href="../../d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a>();</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span>}</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> </div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="keywordtype">void</span> test_MemorisedFactorial_in_order() {</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keyword">auto</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a> = <a class="code hl_class" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a>();</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(0) == 1);</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(1) == 1);</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(5) == 120);</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(10) == 3628800);</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span>}</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="keywordtype">void</span> test_MemorisedFactorial_no_order() {</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">auto</span> <a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a> = <a class="code hl_class" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a>();</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> assert(<a class="code hl_function" href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">factorial</a>(10) == 3628800);</div>
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span>}</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span></div>
|
||||
<div class="foldopen" id="foldopen00061" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"><a class="line" href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 61</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> test_MemorisedFactorial_in_order();</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> test_MemorisedFactorial_no_order();</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span>}</div>
|
||||
</div>
|
||||
<div class="ttc" id="afactorial__memoization_8cpp_html_a0f9b4d5fae79e1029daf9bd1b93ec217"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a></div><div class="ttdeci">std::array< uint64_t, 1000 > memo</div><div class="ttdoc">Array to store computed factorials for memoization.</div><div class="ttdef"><b>Definition</b> <a href="#l00031">factorial_memoization.cpp:31</a></div></div>
|
||||
<div class="ttc" id="afactorial__memoization_8cpp_html_a4243a60d73b9e1296de20196d5b155ba"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">test_fact_recursion</a></div><div class="ttdeci">void test_fact_recursion()</div><div class="ttdoc">Self-test implementations for the fact_recursion function.</div><div class="ttdef"><b>Definition</b> <a href="#l00056">factorial_memoization.cpp:56</a></div></div>
|
||||
<div class="ttc" id="afactorial__memoization_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function to run test cases and interact with the user.</div><div class="ttdef"><b>Definition</b> <a href="#l00069">factorial_memoization.cpp:69</a></div></div>
|
||||
<div class="ttc" id="anamespacemath_html"><div class="ttname"><a href="../../dd/d47/namespacemath.html">math</a></div><div class="ttdoc">for assert</div></div>
|
||||
<div class="ttc" id="anamespacemath_html_a73b07abea036f1ce2e3ac5dc169bdb4b"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a></div><div class="ttdeci">uint64_t fact_recursion(uint64_t n)</div><div class="ttdoc">Computes the factorial of a non-negative integer using recursion and memoization.</div><div class="ttdef"><b>Definition</b> <a href="#l00044">factorial_memoization.cpp:44</a></div></div>
|
||||
<div class="ttc" id="aclass_memorised_factorial_html"><div class="ttname"><a href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a></div><div class="ttdef"><b>Definition</b> <a href="#l00027">factorial_memoization.cpp:27</a></div></div>
|
||||
<div class="ttc" id="aclass_memorised_factorial_html_a35506357960575f150b44ae32fcbad29"><div class="ttname"><a href="../../da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29">MemorisedFactorial::operator()</a></div><div class="ttdeci">std::uint64_t operator()(std::uint64_t n)</div><div class="ttdef"><b>Definition</b> <a href="#l00036">factorial_memoization.cpp:36</a></div></div>
|
||||
<div class="ttc" id="afactorial__memoization_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function to run tests.</div><div class="ttdef"><b>Definition</b> <a href="#l00061">factorial_memoization.cpp:61</a></div></div>
|
||||
<div class="ttc" id="anamespacemath_html_a7e78996673df791014cfe540b183456a"><div class="ttname"><a href="../../dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a">math::factorial</a></div><div class="ttdeci">uint64_t factorial(uint8_t n)</div><div class="ttdoc">function to find factorial of given number</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d00/factorial_8cpp_source.html#l00029">factorial.cpp:29</a></div></div>
|
||||
</div><!-- fragment --></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
</div><!-- container -->
|
||||
|
||||
@@ -141,7 +141,7 @@ Namespaces</h2></td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:add60b8858720bf217df22d992d0fefaa" id="r_add60b8858720bf217df22d992d0fefaa"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a> (std::vector< std::vector< bool > > *<a class="el" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)</td></tr>
|
||||
<tr class="memitem:add60b8858720bf217df22d992d0fefaa" id="r_add60b8858720bf217df22d992d0fefaa"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a> (std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)</td></tr>
|
||||
<tr class="memdesc:add60b8858720bf217df22d992d0fefaa"><td class="mdescLeft"> </td><td class="mdescRight">Recursive Dynamic Programming function. <br /></td></tr>
|
||||
<tr class="memitem:af53b2f647bee9c5b75ef8dd9ef685dc8" id="r_af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a> (const std::string &str, const std::string &result)</td></tr>
|
||||
<tr class="memdesc:af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="mdescLeft"> </td><td class="mdescRight">Iterative Dynamic Programming function. <br /></td></tr>
|
||||
@@ -200,33 +200,32 @@ Algorithm</h3>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 119</span> {</div>
|
||||
<div class="line"><span class="lineno"> 120</span> std::vector<std::vector<bool>> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>(</div>
|
||||
<div class="line"><span class="lineno"> 120</span> std::vector<std::vector<bool>> memo(</div>
|
||||
<div class="line"><span class="lineno"> 121</span> str.size() + 1, std::vector<bool>(result.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><span class="lineno"> 122</span> </div>
|
||||
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">for</span> (uint32_t i = 0; i <= str.size(); ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 124</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][0] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 124</span> memo[i][0] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 125</span> }</div>
|
||||
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">for</span> (uint32_t i = 1; i <= result.size(); ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 127</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[0][i] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 127</span> memo[0][i] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 128</span> }</div>
|
||||
<div class="line"><span class="lineno"> 129</span> <span class="keywordflow">for</span> (uint32_t i = 1; i <= str.size(); ++i) {</div>
|
||||
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">for</span> (uint32_t j = 1; j <= result.size(); ++j) {</div>
|
||||
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">if</span> (str[i - 1] == result[j - 1]) {</div>
|
||||
<div class="line"><span class="lineno"> 132</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j - 1];</div>
|
||||
<div class="line"><span class="lineno"> 132</span> memo[i][j] = memo[i - 1][j - 1];</div>
|
||||
<div class="line"><span class="lineno"> 133</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[i - 1] - 32 == result[j - 1]) {</div>
|
||||
<div class="line"><span class="lineno"> 134</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = (<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j - 1] || <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j]);</div>
|
||||
<div class="line"><span class="lineno"> 134</span> memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);</div>
|
||||
<div class="line"><span class="lineno"> 135</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (str[i - 1] >= <span class="charliteral">'A'</span> && str[i - 1] <= <span class="charliteral">'Z'</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 137</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 137</span> memo[i][j] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 138</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 139</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j];</div>
|
||||
<div class="line"><span class="lineno"> 139</span> memo[i][j] = memo[i - 1][j];</div>
|
||||
<div class="line"><span class="lineno"> 140</span> }</div>
|
||||
<div class="line"><span class="lineno"> 141</span> }</div>
|
||||
<div class="line"><span class="lineno"> 142</span> }</div>
|
||||
<div class="line"><span class="lineno"> 143</span> }</div>
|
||||
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>.back().back();</div>
|
||||
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> memo.back().back();</div>
|
||||
<div class="line"><span class="lineno"> 145</span>}</div>
|
||||
<div class="ttc" id="afactorial__memoization_8cpp_html_a0f9b4d5fae79e1029daf9bd1b93ec217"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a></div><div class="ttdeci">std::array< uint64_t, 1000 > memo</div><div class="ttdoc">Array to store computed factorials for memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00031">factorial_memoization.cpp:31</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -292,7 +291,7 @@ j)</span></li>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>->at(str_idx).at(result_idx);</div>
|
||||
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = memo->at(str_idx).at(result_idx);</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">if</span> (str_idx == str.size() && result_idx == result.size()) {</div>
|
||||
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 66</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str_idx == str.size() && result_idx != result.size()) {</div>
|
||||
@@ -300,12 +299,12 @@ j)</span></li>
|
||||
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 69</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited->at(str_idx).at(result_idx)) {</div>
|
||||
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">if</span> (str[str_idx] == result[result_idx]) {</div>
|
||||
<div class="line"><span class="lineno"> 82</span> ans = abbreviation_recursion(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
|
||||
<div class="line"><span class="lineno"> 82</span> ans = abbreviation_recursion(memo, visited, str, result,</div>
|
||||
<div class="line"><span class="lineno"> 83</span> str_idx + 1, result_idx + 1);</div>
|
||||
<div class="line"><span class="lineno"> 84</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[str_idx] - 32 == result[result_idx]) {</div>
|
||||
<div class="line"><span class="lineno"> 85</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
|
||||
<div class="line"><span class="lineno"> 85</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
|
||||
<div class="line"><span class="lineno"> 86</span> str_idx + 1, result_idx + 1) ||</div>
|
||||
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
|
||||
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
|
||||
<div class="line"><span class="lineno"> 88</span> str_idx + 1, result_idx);</div>
|
||||
<div class="line"><span class="lineno"> 89</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 90</span> <span class="comment">// if `str[i]` is uppercase, then cannot be converted, return</span></div>
|
||||
@@ -315,14 +314,14 @@ j)</span></li>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">if</span> (str[str_idx] >= <span class="charliteral">'A'</span> && str[str_idx] <= <span class="charliteral">'Z'</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 95</span> ans = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 96</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 97</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
|
||||
<div class="line"><span class="lineno"> 97</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
|
||||
<div class="line"><span class="lineno"> 98</span> str_idx + 1, result_idx);</div>
|
||||
<div class="line"><span class="lineno"> 99</span> }</div>
|
||||
<div class="line"><span class="lineno"> 100</span> }</div>
|
||||
<div class="line"><span class="lineno"> 101</span> }</div>
|
||||
<div class="line"><span class="lineno"> 102</span> (*memo)[str_idx][result_idx] = ans;</div>
|
||||
<div class="line"><span class="lineno"> 103</span> (*visited)[str_idx][result_idx] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>)[str_idx][result_idx];</div>
|
||||
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*memo)[str_idx][result_idx];</div>
|
||||
<div class="line"><span class="lineno"> 105</span>}</div>
|
||||
<div class="ttc" id="aabbreviation_8cpp_html_add60b8858720bf217df22d992d0fefaa"><div class="ttname"><a href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a></div><div class="ttdeci">bool abbreviation_recursion(std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)</div><div class="ttdoc">Recursive Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00059">abbreviation.cpp:59</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
@@ -384,36 +383,36 @@ j)</span></li>
|
||||
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 153</span> {</div>
|
||||
<div class="line"><span class="lineno"> 154</span> std::string s = <span class="stringliteral">"daBcd"</span>, t = <span class="stringliteral">"ABC"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 155</span> std::vector<std::vector<bool>> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>(s.size() + 1,</div>
|
||||
<div class="line"><span class="lineno"> 155</span> std::vector<std::vector<bool>> memo(s.size() + 1,</div>
|
||||
<div class="line"><span class="lineno"> 156</span> std::vector<bool>(t.size() + 1, <span class="keyword">false</span>)),</div>
|
||||
<div class="line"><span class="lineno"> 157</span> visited(s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><span class="lineno"> 158</span> </div>
|
||||
<div class="line"><span class="lineno"> 159</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
|
||||
<div class="line"><span class="lineno"> 160</span> &<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &visited, s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 160</span> &memo, &visited, s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 161</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 162</span> s = <span class="stringliteral">"XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 163</span> t = <span class="stringliteral">"XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 164</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><span class="lineno"> 164</span> memo = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><span class="lineno"> 165</span> s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><span class="lineno"> 166</span> </div>
|
||||
<div class="line"><span class="lineno"> 167</span> visited = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><span class="lineno"> 168</span> s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><span class="lineno"> 169</span> </div>
|
||||
<div class="line"><span class="lineno"> 170</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
|
||||
<div class="line"><span class="lineno"> 171</span> &<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &visited, s, t) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 171</span> &memo, &visited, s, t) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 172</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><span class="lineno"> 173</span> </div>
|
||||
<div class="line"><span class="lineno"> 174</span> s = <span class="stringliteral">"DRFNLZZVHLPZWIupjwdmqafmgkg"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 175</span> t = <span class="stringliteral">"DRFNLZZVHLPZWI"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 176</span> </div>
|
||||
<div class="line"><span class="lineno"> 177</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><span class="lineno"> 177</span> memo = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><span class="lineno"> 178</span> s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><span class="lineno"> 179</span> </div>
|
||||
<div class="line"><span class="lineno"> 180</span> visited = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><span class="lineno"> 181</span> s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><span class="lineno"> 182</span> </div>
|
||||
<div class="line"><span class="lineno"> 183</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
|
||||
<div class="line"><span class="lineno"> 184</span> &<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &visited, s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 184</span> &memo, &visited, s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 185</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><span class="lineno"> 186</span>}</div>
|
||||
<div class="ttc" id="aabbreviation_8cpp_html_af53b2f647bee9c5b75ef8dd9ef685dc8"><div class="ttname"><a href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a></div><div class="ttdeci">bool abbreviation(const std::string &str, const std::string &result)</div><div class="ttdoc">Iterative Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00119">abbreviation.cpp:119</a></div></div>
|
||||
|
||||
@@ -126,11 +126,11 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a> {</div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d0/df8/namespaceabbreviation.html">abbreviation</a> {</div>
|
||||
<div class="foldopen" id="foldopen00059" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa"> 59</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(std::vector<std::vector<bool>> *<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>,</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa"> 59</a></span><span class="keywordtype">bool</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(std::vector<std::vector<bool>> *memo,</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> std::vector<std::vector<bool>> *visited,</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">const</span> std::string &str, <span class="keyword">const</span> std::string &result,</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> uint32_t str_idx = 0, uint32_t result_idx = 0) {</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>->at(str_idx).at(result_idx);</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = memo->at(str_idx).at(result_idx);</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordflow">if</span> (str_idx == str.size() && result_idx == result.size()) {</div>
|
||||
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str_idx == str.size() && result_idx != result.size()) {</div>
|
||||
@@ -138,12 +138,12 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited->at(str_idx).at(result_idx)) {</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordflow">if</span> (str[str_idx] == result[result_idx]) {</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
|
||||
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
|
||||
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> str_idx + 1, result_idx + 1);</div>
|
||||
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[str_idx] - 32 == result[result_idx]) {</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
|
||||
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
|
||||
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> str_idx + 1, result_idx + 1) ||</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
|
||||
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
|
||||
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> str_idx + 1, result_idx);</div>
|
||||
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// if `str[i]` is uppercase, then cannot be converted, return</span></div>
|
||||
@@ -153,44 +153,44 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
|
||||
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> <span class="keywordflow">if</span> (str[str_idx] >= <span class="charliteral">'A'</span> && str[str_idx] <= <span class="charliteral">'Z'</span>) {</div>
|
||||
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> ans = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, visited, str, result,</div>
|
||||
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> ans = <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
|
||||
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> str_idx + 1, result_idx);</div>
|
||||
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> }</div>
|
||||
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
|
||||
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
|
||||
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> (*memo)[str_idx][result_idx] = ans;</div>
|
||||
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> (*visited)[str_idx][result_idx] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>)[str_idx][result_idx];</div>
|
||||
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*memo)[str_idx][result_idx];</div>
|
||||
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span></div>
|
||||
<div class="foldopen" id="foldopen00119" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8"> 119</a></span><span class="keywordtype">bool</span> <a class="code hl_namespace" href="../../d0/df8/namespaceabbreviation.html">abbreviation</a>(<span class="keyword">const</span> std::string &str, <span class="keyword">const</span> std::string &result) {</div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> std::vector<std::vector<bool>> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>(</div>
|
||||
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> std::vector<std::vector<bool>> memo(</div>
|
||||
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> str.size() + 1, std::vector<bool>(result.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> </div>
|
||||
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordflow">for</span> (uint32_t i = 0; i <= str.size(); ++i) {</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][0] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> memo[i][0] = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> }</div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">for</span> (uint32_t i = 1; i <= result.size(); ++i) {</div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[0][i] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> memo[0][i] = <span class="keyword">false</span>;</div>
|
||||
<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="keywordflow">for</span> (uint32_t i = 1; i <= str.size(); ++i) {</div>
|
||||
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <span class="keywordflow">for</span> (uint32_t j = 1; j <= result.size(); ++j) {</div>
|
||||
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">if</span> (str[i - 1] == result[j - 1]) {</div>
|
||||
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j - 1];</div>
|
||||
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> memo[i][j] = memo[i - 1][j - 1];</div>
|
||||
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[i - 1] - 32 == result[j - 1]) {</div>
|
||||
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = (<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j - 1] || <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j]);</div>
|
||||
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);</div>
|
||||
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">if</span> (str[i - 1] >= <span class="charliteral">'A'</span> && str[i - 1] <= <span class="charliteral">'Z'</span>) {</div>
|
||||
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> memo[i][j] = <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i][j] = <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[i - 1][j];</div>
|
||||
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> memo[i][j] = memo[i - 1][j];</div>
|
||||
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> }</div>
|
||||
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> }</div>
|
||||
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> }</div>
|
||||
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> }</div>
|
||||
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>.back().back();</div>
|
||||
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keywordflow">return</span> memo.back().back();</div>
|
||||
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span>} <span class="comment">// namespace abbreviation</span></div>
|
||||
@@ -199,36 +199,36 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
|
||||
<div class="foldopen" id="foldopen00153" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"><a class="line" href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 153</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
|
||||
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> std::string s = <span class="stringliteral">"daBcd"</span>, t = <span class="stringliteral">"ABC"</span>;</div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::vector<std::vector<bool>> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>(s.size() + 1,</div>
|
||||
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::vector<std::vector<bool>> memo(s.size() + 1,</div>
|
||||
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> std::vector<bool>(t.size() + 1, <span class="keyword">false</span>)),</div>
|
||||
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> visited(s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> </div>
|
||||
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
|
||||
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> &<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &visited, s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> &memo, &visited, s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> s = <span class="stringliteral">"XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET"</span>;</div>
|
||||
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> t = <span class="stringliteral">"XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU"</span>;</div>
|
||||
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> memo = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
|
||||
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> visited = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> </div>
|
||||
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
|
||||
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> &<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &visited, s, t) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> &memo, &visited, s, t) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">false</span>);</div>
|
||||
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> </div>
|
||||
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> s = <span class="stringliteral">"DRFNLZZVHLPZWIupjwdmqafmgkg"</span>;</div>
|
||||
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> t = <span class="stringliteral">"DRFNLZZVHLPZWI"</span>;</div>
|
||||
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> </div>
|
||||
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a> = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> memo = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> </div>
|
||||
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> visited = std::vector<std::vector<bool>>(</div>
|
||||
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> s.size() + 1, std::vector<bool>(t.size() + 1, <span class="keyword">false</span>));</div>
|
||||
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> </div>
|
||||
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
|
||||
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> &<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>, &visited, s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> &memo, &visited, s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> assert(<a class="code hl_function" href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span>}</div>
|
||||
</div>
|
||||
@@ -243,7 +243,6 @@ $(function(){initNavTree('d7/d73/abbreviation_8cpp_source.html','../../',''); })
|
||||
<div class="ttc" id="aabbreviation_8cpp_html_add60b8858720bf217df22d992d0fefaa"><div class="ttname"><a href="../../d7/d73/abbreviation_8cpp.html#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a></div><div class="ttdeci">bool abbreviation_recursion(std::vector< std::vector< bool > > *memo, std::vector< std::vector< bool > > *visited, const std::string &str, const std::string &result, uint32_t str_idx=0, uint32_t result_idx=0)</div><div class="ttdoc">Recursive Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="#l00059">abbreviation.cpp:59</a></div></div>
|
||||
<div class="ttc" id="aabbreviation_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d7/d73/abbreviation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00192">abbreviation.cpp:192</a></div></div>
|
||||
<div class="ttc" id="aabbreviation_8cpp_html_af53b2f647bee9c5b75ef8dd9ef685dc8"><div class="ttname"><a href="../../d7/d73/abbreviation_8cpp.html#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a></div><div class="ttdeci">bool abbreviation(const std::string &str, const std::string &result)</div><div class="ttdoc">Iterative Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="#l00119">abbreviation.cpp:119</a></div></div>
|
||||
<div class="ttc" id="afactorial__memoization_8cpp_html_a0f9b4d5fae79e1029daf9bd1b93ec217"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a></div><div class="ttdeci">std::array< uint64_t, 1000 > memo</div><div class="ttdoc">Array to store computed factorials for memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00031">factorial_memoization.cpp:31</a></div></div>
|
||||
<div class="ttc" id="anamespaceabbreviation_html"><div class="ttname"><a href="../../d0/df8/namespaceabbreviation.html">abbreviation</a></div><div class="ttdoc">Functions for Abbreviation implementation.</div></div>
|
||||
<div class="ttc" id="anamespacedynamic__programming_html"><div class="ttname"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></div><div class="ttdoc">Dynamic Programming algorithms.</div></div>
|
||||
</div><!-- fragment --></div><!-- contents -->
|
||||
|
||||
5
d9/d09/class_memorised_factorial__coll__graph.map
Normal file
5
d9/d09/class_memorised_factorial__coll__graph.map
Normal file
@@ -0,0 +1,5 @@
|
||||
<map id="MemorisedFactorial" name="MemorisedFactorial">
|
||||
<area shape="rect" id="Node000001" title=" " alt="" coords="27,102,163,128"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="5,5,185,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,46,98,101,92,101,92,46"/>
|
||||
</map>
|
||||
1
d9/d09/class_memorised_factorial__coll__graph.md5
Normal file
1
d9/d09/class_memorised_factorial__coll__graph.md5
Normal file
@@ -0,0 +1 @@
|
||||
04e4003c99cc628a342bca09e4f3f23d
|
||||
66
d9/d09/class_memorised_factorial__coll__graph.svg
Normal file
66
d9/d09/class_memorised_factorial__coll__graph.svg
Normal file
@@ -0,0 +1,66 @@
|
||||
<?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 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: MemorisedFactorial Pages: 1 -->
|
||||
<svg width="144pt" height="100pt"
|
||||
viewBox="0.00 0.00 144.00 100.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 95.75)">
|
||||
<title>MemorisedFactorial</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="118,-19.25 16.5,-19.25 16.5,0 118,0 118,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">MemorisedFactorial</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="134.5,-91.75 0,-91.75 0,-72.5 134.5,-72.5 134.5,-91.75"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="67.25" y="-78.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< std::uint64_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-61.05C67.25,-47.44 67.25,-30.1 67.25,-19.7"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-60.68 67.25,-70.68 70.75,-60.68 63.75,-60.68"/>
|
||||
</a>
|
||||
</g>
|
||||
<text xml:space="preserve" text-anchor="start" x="70.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">known_values</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.6 KiB |
40
d9/d09/class_memorised_factorial__coll__graph_org.svg
Normal file
40
d9/d09/class_memorised_factorial__coll__graph_org.svg
Normal file
@@ -0,0 +1,40 @@
|
||||
<?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 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: MemorisedFactorial Pages: 1 -->
|
||||
<svg width="144pt" height="100pt"
|
||||
viewBox="0.00 0.00 144.00 100.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 95.75)">
|
||||
<title>MemorisedFactorial</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="118,-19.25 16.5,-19.25 16.5,0 118,0 118,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="67.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">MemorisedFactorial</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="134.5,-91.75 0,-91.75 0,-72.5 134.5,-72.5 134.5,-91.75"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="67.25" y="-78.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< std::uint64_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.25,-61.05C67.25,-47.44 67.25,-30.1 67.25,-19.7"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="63.75,-60.68 67.25,-70.68 70.75,-60.68 63.75,-60.68"/>
|
||||
</a>
|
||||
</g>
|
||||
<text xml:space="preserve" text-anchor="start" x="70.25" y="-42" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">known_values</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.8 KiB |
219
da/d15/class_memorised_factorial.html
Normal file
219
da/d15/class_memorised_factorial.html
Normal file
@@ -0,0 +1,219 @@
|
||||
<!-- HTML header for doxygen 1.12.0-->
|
||||
<!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" lang="en-US">
|
||||
<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.14.0"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: MemorisedFactorial Class Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
<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>
|
||||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||||
<script type="text/javascript">
|
||||
DoxygenAwesomeDarkModeToggle.init()
|
||||
</script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<script type="text/javascript" src="../../cookie.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/javascript">
|
||||
window.MathJax = {
|
||||
options: {
|
||||
ignoreHtmlClass: 'tex2jax_ignore',
|
||||
processHtmlClass: 'tex2jax_process'
|
||||
},
|
||||
loader: {
|
||||
load: ['[tex]/ams']
|
||||
},
|
||||
tex: {
|
||||
macros: {},
|
||||
packages: ['base','configmacros','ams']
|
||||
}
|
||||
};
|
||||
</script>
|
||||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||||
<td id="projectalign">
|
||||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.14.0 -->
|
||||
<script type="text/javascript">
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
</script>
|
||||
<script type="text/javascript">
|
||||
$(function() { codefold.init(); });
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search',true);
|
||||
$(function() { init_search(); });
|
||||
});
|
||||
</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">
|
||||
$(function(){initNavTree('da/d15/class_memorised_factorial.html','../../','db/d3b/class_memorised_factorial-members'); });
|
||||
</script>
|
||||
<div id="container">
|
||||
<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">
|
||||
<div id="MSearchResults">
|
||||
<div class="SRPage">
|
||||
<div id="SRIndex">
|
||||
<div id="SRResults"></div>
|
||||
<div class="SRStatus" id="Loading">Loading...</div>
|
||||
<div class="SRStatus" id="Searching">Searching...</div>
|
||||
<div class="SRStatus" id="NoMatches">No Matches</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle"><div class="title">MemorisedFactorial Class Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for MemorisedFactorial:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d9/d09/class_memorised_factorial__coll__graph.svg" width="192" height="134"><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 id="header-pub-methods" class="groupheader"><a id="pub-methods" name="pub-methods"></a>
|
||||
Public Member Functions</h2></td></tr>
|
||||
<tr class="memitem:a35506357960575f150b44ae32fcbad29" id="r_a35506357960575f150b44ae32fcbad29"><td class="memItemLeft" align="right" valign="top">std::uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#a35506357960575f150b44ae32fcbad29">operator()</a> (std::uint64_t n)</td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 id="header-pri-attribs" class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
|
||||
Private Attributes</h2></td></tr>
|
||||
<tr class="memitem:aa00d8a2e0540cefd7230b7302ccac51e" id="r_aa00d8a2e0540cefd7230b7302ccac51e"><td class="memItemLeft" align="right" valign="top">std::vector< std::uint64_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="#aa00d8a2e0540cefd7230b7302ccac51e">known_values</a> = {1}</td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock">
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Member Function Documentation</h2>
|
||||
<a id="a35506357960575f150b44ae32fcbad29" name="a35506357960575f150b44ae32fcbad29"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a35506357960575f150b44ae32fcbad29">◆ </a></span>operator()()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">std::uint64_t MemorisedFactorial::operator() </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">std::uint64_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<dl class="section note"><dt>Note</dt><dd>This function was intentionally written as recursive and it does not handle overflows. </dd></dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>factorial of n </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00036">36</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 36</span> {</div>
|
||||
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">if</span> (n >= this->known_values.size()) {</div>
|
||||
<div class="line"><span class="lineno"> 38</span> this->known_values.push_back(n * this-><span class="keyword">operator</span>()(n - 1));</div>
|
||||
<div class="line"><span class="lineno"> 39</span> }</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> this->known_values.at(n);</div>
|
||||
<div class="line"><span class="lineno"> 41</span> }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a name="doc-variable-members" id="doc-variable-members"></a><h2 id="header-doc-variable-members" class="groupheader">Member Data Documentation</h2>
|
||||
<a id="aa00d8a2e0540cefd7230b7302ccac51e" name="aa00d8a2e0540cefd7230b7302ccac51e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa00d8a2e0540cefd7230b7302ccac51e">◆ </a></span>known_values</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">std::vector<std::uint64_t> MemorisedFactorial::known_values = {1}</td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 28</span>{1};</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<hr/>The documentation for this class was generated from the following file:<ul>
|
||||
<li>math/<a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<div id="page-nav" class="page-nav-panel">
|
||||
<div id="page-nav-resize-handle"></div>
|
||||
<div id="page-nav-tree">
|
||||
<div id="page-nav-contents">
|
||||
</div><!-- page-nav-contents -->
|
||||
</div><!-- page-nav-tree -->
|
||||
</div><!-- page-nav -->
|
||||
</div><!-- container -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</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.14.0 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
4
da/d15/class_memorised_factorial.js
Normal file
4
da/d15/class_memorised_factorial.js
Normal file
@@ -0,0 +1,4 @@
|
||||
var class_memorised_factorial =
|
||||
[
|
||||
[ "operator()", "da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29", null ]
|
||||
];
|
||||
@@ -1,11 +1,9 @@
|
||||
<map id="math/factorial_memoization.cpp" name="math/factorial_memoization.cpp">
|
||||
<area shape="rect" id="Node000001" title="Factorial calculation using recursion and memoization" alt="" coords="70,5,276,31"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="5,79,77,105"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="152,34,78,74,75,69,149,29"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="101,79,165,105"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="169,33,149,67,145,64,164,30"/>
|
||||
<area shape="rect" id="Node000004" title=" " alt="" coords="189,79,240,105"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="182,30,202,64,197,67,178,33"/>
|
||||
<area shape="rect" id="Node000005" title=" " alt="" coords="264,79,324,105"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="195,29,262,68,259,73,192,34"/>
|
||||
<area shape="rect" id="Node000001" title="Factorial calculation using recursion and memoization" alt="" coords="21,5,227,31"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="5,79,70,105"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="111,34,65,71,62,67,108,29"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="94,79,154,105"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="127,31,127,63,122,63,122,31"/>
|
||||
<area shape="rect" id="Node000004" title=" " alt="" coords="178,79,236,105"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="140,30,183,67,180,71,136,34"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
69fc891120320fb84e290bfcf9cb1ff5
|
||||
e201fef4865ec066f51c491e79e7a62e
|
||||
@@ -4,8 +4,8 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: math/factorial_memoization.cpp Pages: 1 -->
|
||||
<svg width="247pt" height="83pt"
|
||||
viewBox="0.00 0.00 247.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="181pt" height="83pt"
|
||||
viewBox="0.00 0.00 181.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
@@ -23,8 +23,8 @@
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Factorial calculation using recursion and memoization">
|
||||
<polygon fill="#999999" stroke="#666666" points="203.12,-74.5 48.38,-74.5 48.38,-55.25 203.12,-55.25 203.12,-74.5"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="125.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/factorial_memoization.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="166.5,-74.5 11.75,-74.5 11.75,-55.25 166.5,-55.25 166.5,-74.5"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="89.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/factorial_memoization.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -32,8 +32,8 @@
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -41,8 +41,8 @@
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M108.96,-54.84C93.74,-46.66 71.05,-34.46 53.37,-24.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.42,-22.07 44.96,-20.42 52.11,-28.24 55.42,-22.07"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M78.1,-54.84C68.7,-47.15 54.98,-35.9 43.72,-26.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="46.11,-24.11 36.16,-20.48 41.68,-29.53 46.11,-24.11"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -50,8 +50,8 @@
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 71.62,-19.25 71.62,0 119.88,0 119.88,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="95.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="111.75,-19.25 66.5,-19.25 66.5,0 111.75,0 111.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="89.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -59,8 +59,8 @@
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M120.8,-55.08C116.87,-48.11 111.24,-38.12 106.31,-29.37"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="109.51,-27.92 101.55,-20.93 103.41,-31.36 109.51,-27.92"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M89.12,-55.08C89.12,-48.57 89.12,-39.42 89.12,-31.12"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="92.63,-31.12 89.13,-21.12 85.63,-31.12 92.63,-31.12"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -68,8 +68,8 @@
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="175.62,-19.25 137.88,-19.25 137.88,0 175.62,0 175.62,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="156.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="172.62,-19.25 129.62,-19.25 129.62,0 172.62,0 172.62,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="151.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -77,26 +77,8 @@
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M130.87,-55.08C134.93,-48.11 140.74,-38.12 145.84,-29.37"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.75,-31.32 150.76,-20.92 142.7,-27.8 148.75,-31.32"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="239.38,-19.25 194.12,-19.25 194.12,0 239.38,0 239.38,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="216.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M141.19,-54.84C154.91,-46.81 175.25,-34.91 191.37,-25.48"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="193.07,-28.54 199.93,-20.47 189.53,-22.5 193.07,-28.54"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M99.64,-54.84C108.51,-47.22 121.44,-36.12 132.11,-26.95"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.31,-29.68 139.61,-20.51 129.75,-24.37 134.31,-29.68"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 4.7 KiB After Width: | Height: | Size: 3.9 KiB |
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: math/factorial_memoization.cpp Pages: 1 -->
|
||||
<svg width="247pt" height="83pt"
|
||||
viewBox="0.00 0.00 247.00 83.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="181pt" height="83pt"
|
||||
viewBox="0.00 0.00 181.00 83.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 78.5)">
|
||||
<title>math/factorial_memoization.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Factorial calculation using recursion and memoization">
|
||||
<polygon fill="#999999" stroke="#666666" points="203.12,-74.5 48.38,-74.5 48.38,-55.25 203.12,-55.25 203.12,-74.5"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="125.75" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/factorial_memoization.cpp</text>
|
||||
<polygon fill="#999999" stroke="#666666" points="166.5,-74.5 11.75,-74.5 11.75,-55.25 166.5,-55.25 166.5,-74.5"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="89.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">math/factorial_memoization.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -21,8 +21,8 @@
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -30,8 +30,8 @@
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M108.96,-54.84C93.74,-46.66 71.05,-34.46 53.37,-24.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.42,-22.07 44.96,-20.42 52.11,-28.24 55.42,-22.07"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M78.1,-54.84C68.7,-47.15 54.98,-35.9 43.72,-26.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="46.11,-24.11 36.16,-20.48 41.68,-29.53 46.11,-24.11"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -39,8 +39,8 @@
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 71.62,-19.25 71.62,0 119.88,0 119.88,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="95.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="111.75,-19.25 66.5,-19.25 66.5,0 111.75,0 111.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="89.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -48,8 +48,8 @@
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M120.8,-55.08C116.87,-48.11 111.24,-38.12 106.31,-29.37"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="109.51,-27.92 101.55,-20.93 103.41,-31.36 109.51,-27.92"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M89.12,-55.08C89.12,-48.57 89.12,-39.42 89.12,-31.12"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="92.63,-31.12 89.13,-21.12 85.63,-31.12 92.63,-31.12"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -57,8 +57,8 @@
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="175.62,-19.25 137.88,-19.25 137.88,0 175.62,0 175.62,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="156.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="172.62,-19.25 129.62,-19.25 129.62,0 172.62,0 172.62,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="151.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -66,26 +66,8 @@
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M130.87,-55.08C134.93,-48.11 140.74,-38.12 145.84,-29.37"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="148.75,-31.32 150.76,-20.92 142.7,-27.8 148.75,-31.32"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="239.38,-19.25 194.12,-19.25 194.12,0 239.38,0 239.38,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="216.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M141.19,-54.84C154.91,-46.81 175.25,-34.91 191.37,-25.48"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="193.07,-28.54 199.93,-20.47 189.53,-22.5 193.07,-28.54"/>
|
||||
<path fill="none" stroke="#63b8ff" d="M99.64,-54.84C108.51,-47.22 121.44,-36.12 132.11,-26.95"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.31,-29.68 139.61,-20.51 129.75,-24.37 134.31,-29.68"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 4.0 KiB After Width: | Height: | Size: 3.2 KiB |
134
db/d3b/class_memorised_factorial-members.html
Normal file
134
db/d3b/class_memorised_factorial-members.html
Normal file
@@ -0,0 +1,134 @@
|
||||
<!-- HTML header for doxygen 1.12.0-->
|
||||
<!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" lang="en-US">
|
||||
<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.14.0"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: Member List</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
<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>
|
||||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||||
<script type="text/javascript">
|
||||
DoxygenAwesomeDarkModeToggle.init()
|
||||
</script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<script type="text/javascript" src="../../cookie.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/javascript">
|
||||
window.MathJax = {
|
||||
options: {
|
||||
ignoreHtmlClass: 'tex2jax_ignore',
|
||||
processHtmlClass: 'tex2jax_process'
|
||||
},
|
||||
loader: {
|
||||
load: ['[tex]/ams']
|
||||
},
|
||||
tex: {
|
||||
macros: {},
|
||||
packages: ['base','configmacros','ams']
|
||||
}
|
||||
};
|
||||
</script>
|
||||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||||
<td id="projectalign">
|
||||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.14.0 -->
|
||||
<script type="text/javascript">
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
</script>
|
||||
<script type="text/javascript">
|
||||
$(function() { codefold.init(); });
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search',true);
|
||||
$(function() { init_search(); });
|
||||
});
|
||||
</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">
|
||||
$(function(){initNavTree('da/d15/class_memorised_factorial.html','../../',''); });
|
||||
</script>
|
||||
<div id="container">
|
||||
<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">
|
||||
<div id="MSearchResults">
|
||||
<div class="SRPage">
|
||||
<div id="SRIndex">
|
||||
<div id="SRResults"></div>
|
||||
<div class="SRStatus" id="Loading">Loading...</div>
|
||||
<div class="SRStatus" id="Searching">Searching...</div>
|
||||
<div class="SRStatus" id="NoMatches">No Matches</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle"><div class="title">MemorisedFactorial Member List</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>known_values</b> (defined in <a class="el" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a>)</td><td class="entry"><a class="el" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29">operator()</a>(std::uint64_t n)</td><td class="entry"><a class="el" href="../../da/d15/class_memorised_factorial.html">MemorisedFactorial</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
</table></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
</div><!-- container -->
|
||||
<!-- 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.14.0 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -174,8 +174,6 @@ Functions</h2></td></tr>
|
||||
<tr class="memdesc:ac37d3ba52eb296597d7a024ba8c4a5a5"><td class="mdescLeft"> </td><td class="mdescRight">Function to calculate Euler's Totient. <br /></td></tr>
|
||||
<tr class="memitem:a7e78996673df791014cfe540b183456a" id="r_a7e78996673df791014cfe540b183456a"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#a7e78996673df791014cfe540b183456a">factorial</a> (uint8_t n)</td></tr>
|
||||
<tr class="memdesc:a7e78996673df791014cfe540b183456a"><td class="mdescLeft"> </td><td class="mdescRight">function to find factorial of given number <br /></td></tr>
|
||||
<tr class="memitem:a73b07abea036f1ce2e3ac5dc169bdb4b" id="r_a73b07abea036f1ce2e3ac5dc169bdb4b"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#a73b07abea036f1ce2e3ac5dc169bdb4b">fact_recursion</a> (uint64_t n)</td></tr>
|
||||
<tr class="memdesc:a73b07abea036f1ce2e3ac5dc169bdb4b"><td class="mdescLeft"> </td><td class="mdescRight">Computes the factorial of a non-negative integer using recursion and memoization. <br /></td></tr>
|
||||
<tr class="memitem:aec65db4e5c7317323227f026fe50ef11" id="r_aec65db4e5c7317323227f026fe50ef11"><td class="memItemLeft" align="right" valign="top">double </td><td class="memItemRight" valign="bottom"><a class="el" href="#aec65db4e5c7317323227f026fe50ef11">integral_approx</a> (double lb, double ub, const std::function< double(double)> &func, double delta=.0001)</td></tr>
|
||||
<tr class="memdesc:aec65db4e5c7317323227f026fe50ef11"><td class="mdescLeft"> </td><td class="mdescRight">Computes integral approximation. <br /></td></tr>
|
||||
<tr class="memitem:a50936ee98f4d40f17823befc65a32aec" id="r_a50936ee98f4d40f17823befc65a32aec"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a50936ee98f4d40f17823befc65a32aec">test_eval</a> (double approx, double expected, double threshold)</td></tr>
|
||||
@@ -247,8 +245,8 @@ Functions</h2></td></tr>
|
||||
<p>std::cout</p>
|
||||
<p>for IO implementations</p>
|
||||
<p>Evaluate recurrence relation using <a href="https://www.hackerearth.com/practice/notes/matrix-exponentiation-1/" target="_blank">matrix exponentiation</a>.</p>
|
||||
<p>for mathematical functions</p>
|
||||
<p>Math algorithms.</p>
|
||||
<p>for mathematical functions</p>
|
||||
<p>Mathematical algorithms.</p>
|
||||
<p>for IO operations</p>
|
||||
<p>for M_PI definition and pow()</p>
|
||||
@@ -821,42 +819,6 @@ template<typename T> </div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a73b07abea036f1ce2e3ac5dc169bdb4b" name="a73b07abea036f1ce2e3ac5dc169bdb4b"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a73b07abea036f1ce2e3ac5dc169bdb4b">◆ </a></span>fact_recursion()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">uint64_t math::fact_recursion </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">uint64_t</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Computes the factorial of a non-negative integer using recursion and memoization. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">n</td><td>The integer whose factorial is to be computed </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>The factorial of n </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html#l00044">44</a> of file <a class="el" href="../../d2/d96/factorial__memoization_8cpp_source.html">factorial_memoization.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 44</span> {</div>
|
||||
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">if</span> (n == 0) <span class="keywordflow">return</span> 1; <span class="comment">// Base case: 0! = 1</span></div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n] != 0) <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n]; <span class="comment">// Return already computed value</span></div>
|
||||
<div class="line"><span class="lineno"> 47</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n] = n * <a class="code hl_function" href="#a73b07abea036f1ce2e3ac5dc169bdb4b">fact_recursion</a>(n - 1); <span class="comment">// Store and return the computed value</span></div>
|
||||
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a>[n];</div>
|
||||
<div class="line"><span class="lineno"> 49</span>}</div>
|
||||
<div class="ttc" id="afactorial__memoization_8cpp_html_a0f9b4d5fae79e1029daf9bd1b93ec217"><div class="ttname"><a href="../../d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">memo</a></div><div class="ttdeci">std::array< uint64_t, 1000 > memo</div><div class="ttdoc">Array to store computed factorials for memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00031">factorial_memoization.cpp:31</a></div></div>
|
||||
<div class="ttc" id="anamespacemath_html_a73b07abea036f1ce2e3ac5dc169bdb4b"><div class="ttname"><a href="#a73b07abea036f1ce2e3ac5dc169bdb4b">math::fact_recursion</a></div><div class="ttdeci">uint64_t fact_recursion(uint64_t n)</div><div class="ttdoc">Computes the factorial of a non-negative integer using recursion and memoization.</div><div class="ttdef"><b>Definition</b> <a href="../../d2/d96/factorial__memoization_8cpp_source.html#l00044">factorial_memoization.cpp:44</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a7e78996673df791014cfe540b183456a" name="a7e78996673df791014cfe540b183456a"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a7e78996673df791014cfe540b183456a">◆ </a></span>factorial()</h2>
|
||||
|
||||
|
||||
@@ -14,7 +14,6 @@ var namespacemath =
|
||||
[ "cylinder_surface_area", "dd/d47/namespacemath.html#ac5803413618fcfb922cb32c6db0fc864", null ],
|
||||
[ "cylinder_surface_perimeter", "dd/d47/namespacemath.html#a1d4df7a4e43a2eac1acc0ac610487c73", null ],
|
||||
[ "cylinder_volume", "dd/d47/namespacemath.html#abde24398be43538c62e4a496968e60ca", null ],
|
||||
[ "fact_recursion", "dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b", null ],
|
||||
[ "factorial", "dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a", null ],
|
||||
[ "hemi_sphere_surface_area", "dd/d47/namespacemath.html#a3277e65a8f380e7632791975bfba0efb", null ],
|
||||
[ "integral_approx", "dd/d47/namespacemath.html#aec65db4e5c7317323227f026fe50ef11", null ],
|
||||
|
||||
@@ -486,8 +486,6 @@
|
||||
<a href="d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502"/>
|
||||
<a href="d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098"/>
|
||||
<a href="d2/d96/factorial__memoization_8cpp.html"/>
|
||||
<a href="d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217"/>
|
||||
<a href="d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba"/>
|
||||
<a href="d2/d96/factorial__memoization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
|
||||
<a href="d2/d96/factorial__memoization_8cpp_source.html"/>
|
||||
<a href="d2/d96/sparse__table__range__queries_8cpp_source.html"/>
|
||||
@@ -2100,6 +2098,8 @@
|
||||
<a href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155"/>
|
||||
<a href="da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
|
||||
<a href="da/d0d/longest__common__string_8cpp_source.html"/>
|
||||
<a href="da/d15/class_memorised_factorial.html"/>
|
||||
<a href="da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29"/>
|
||||
<a href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html"/>
|
||||
<a href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a005dc56b0c58350a13f4796b9b30b6c5"/>
|
||||
<a href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a12a06eef5ccaf667f319506eee655d95"/>
|
||||
@@ -2345,6 +2345,7 @@
|
||||
<a href="db/d27/n__bonacci_8cpp_source.html"/>
|
||||
<a href="db/d32/structdata__structures_1_1sparse__table_1_1_sparse__table-members.html"/>
|
||||
<a href="db/d36/classothers_1_1_cache_1_1_l_f_u_cache-members.html"/>
|
||||
<a href="db/d3b/class_memorised_factorial-members.html"/>
|
||||
<a href="db/d3c/tower__of__hanoi_8cpp.html"/>
|
||||
<a href="db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed"/>
|
||||
<a href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417"/>
|
||||
@@ -2842,7 +2843,6 @@
|
||||
<a href="dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f"/>
|
||||
<a href="dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca"/>
|
||||
<a href="dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967"/>
|
||||
<a href="dd/d47/namespacemath.html#a73b07abea036f1ce2e3ac5dc169bdb4b"/>
|
||||
<a href="dd/d47/namespacemath.html#a7e78996673df791014cfe540b183456a"/>
|
||||
<a href="dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b"/>
|
||||
<a href="dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb"/>
|
||||
|
||||
@@ -128,7 +128,7 @@ $(function(){initNavTree('functions_func_o.html','',''); });
|
||||
<li>operator&() : <a class="el" href="db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8">uint256_t</a></li>
|
||||
<li>operator&&() : <a class="el" href="db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963">uint256_t</a></li>
|
||||
<li>operator&=() : <a class="el" href="db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d">uint256_t</a></li>
|
||||
<li>operator()() : <a class="el" href="de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">Compare< S, T, E ></a>, <a class="el" href="db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">uint256_t</a></li>
|
||||
<li>operator()() : <a class="el" href="de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">Compare< S, T, E ></a>, <a class="el" href="da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29">MemorisedFactorial</a>, <a class="el" href="db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">uint256_t</a></li>
|
||||
<li>operator*() : <a class="el" href="da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">uint256_t</a></li>
|
||||
<li>operator*=() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">uint256_t</a></li>
|
||||
<li>operator+() : <a class="el" href="da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">uint256_t</a></li>
|
||||
|
||||
@@ -128,7 +128,7 @@ $(function(){initNavTree('functions_o.html','',''); });
|
||||
<li>operator&() : <a class="el" href="db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8">uint256_t</a></li>
|
||||
<li>operator&&() : <a class="el" href="db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963">uint256_t</a></li>
|
||||
<li>operator&=() : <a class="el" href="db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d">uint256_t</a></li>
|
||||
<li>operator()() : <a class="el" href="de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">Compare< S, T, E ></a>, <a class="el" href="db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">uint256_t</a></li>
|
||||
<li>operator()() : <a class="el" href="de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c">Compare< S, T, E ></a>, <a class="el" href="da/d15/class_memorised_factorial.html#a35506357960575f150b44ae32fcbad29">MemorisedFactorial</a>, <a class="el" href="db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b">uint256_t</a></li>
|
||||
<li>operator*() : <a class="el" href="da/d5a/class_complex.html#aa9b4a7d6083ca7040ddd4fe93db5c19d">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616">uint256_t</a></li>
|
||||
<li>operator*=() : <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#a771e9b28cfddf1ad94668566e396e350">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028">uint256_t</a></li>
|
||||
<li>operator+() : <a class="el" href="da/d5a/class_complex.html#a820afcbb330df716577459d7a3aa3a1c">Complex</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a>, <a class="el" href="db/d82/classlarge__number.html#abbd52948bee1b16543f1dae19aa9dd46">large_number</a>, <a class="el" href="db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f">uint256_t</a></li>
|
||||
|
||||
@@ -139,7 +139,6 @@ $(function(){initNavTree('globals_func_t.html','',''); });
|
||||
<li>test_contains() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">binary_search_tree2.cpp</a></li>
|
||||
<li>test_double() : <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792">quick_sort_3.cpp</a></li>
|
||||
<li>test_f() : <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">shell_sort2.cpp</a></li>
|
||||
<li>test_fact_recursion() : <a class="el" href="d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">factorial_memoization.cpp</a></li>
|
||||
<li>test_find_max() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">binary_search_tree2.cpp</a></li>
|
||||
<li>test_find_min() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">binary_search_tree2.cpp</a></li>
|
||||
<li>test_function() : <a class="el" href="d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">realtime_stats.cpp</a></li>
|
||||
|
||||
@@ -125,7 +125,6 @@ $(function(){initNavTree('globals_m.html','',''); });
|
||||
<li>MAX_ITERATIONS : <a class="el" href="d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">bisection_method.cpp</a>, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">newton_raphson_method.cpp</a></li>
|
||||
<li>max_size : <a class="el" href="d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">queue_using_array.cpp</a></li>
|
||||
<li>max_subarray_sum() : <a class="el" href="de/dcd/kadanes3_8cpp.html#a338439a04148ae89f695595acfa5c147">kadanes3.cpp</a></li>
|
||||
<li>memo : <a class="el" href="d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">factorial_memoization.cpp</a></li>
|
||||
<li>merge() : <a class="el" href="d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge_sort.cpp</a></li>
|
||||
<li>mergeSort() : <a class="el" href="d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7">merge_sort.cpp</a></li>
|
||||
<li>method1() : <a class="el" href="df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11">decimal_to_binary.cpp</a></li>
|
||||
|
||||
@@ -139,7 +139,6 @@ $(function(){initNavTree('globals_t.html','',''); });
|
||||
<li>test_contains() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">binary_search_tree2.cpp</a></li>
|
||||
<li>test_double() : <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a2635b04ad943fa28b7bbf8d1e6479792">quick_sort_3.cpp</a></li>
|
||||
<li>test_f() : <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a22ea0d1f7943ebb4371d31e44b465b6d">shell_sort2.cpp</a></li>
|
||||
<li>test_fact_recursion() : <a class="el" href="d2/d96/factorial__memoization_8cpp.html#a4243a60d73b9e1296de20196d5b155ba">factorial_memoization.cpp</a></li>
|
||||
<li>test_find_max() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">binary_search_tree2.cpp</a></li>
|
||||
<li>test_find_min() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">binary_search_tree2.cpp</a></li>
|
||||
<li>test_function() : <a class="el" href="d0/d08/realtime__stats_8cpp.html#aa54c915581fcc495489175a4386d59fd">realtime_stats.cpp</a></li>
|
||||
|
||||
@@ -130,7 +130,6 @@ $(function(){initNavTree('globals_vars.html','',''); });
|
||||
<li>MAX_ITER : <a class="el" href="d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">adaline_learning.cpp</a></li>
|
||||
<li>MAX_ITERATIONS : <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">newton_raphson_method.cpp</a></li>
|
||||
<li>max_size : <a class="el" href="d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">queue_using_array.cpp</a></li>
|
||||
<li>memo : <a class="el" href="d2/d96/factorial__memoization_8cpp.html#a0f9b4d5fae79e1029daf9bd1b93ec217">factorial_memoization.cpp</a></li>
|
||||
<li>prime : <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">primes_up_to_billion.cpp</a></li>
|
||||
<li>prime_numbers : <a class="el" href="db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_factorization.cpp</a></li>
|
||||
<li>stack : <a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">paranthesis_matching.cpp</a></li>
|
||||
|
||||
149
hierarchy.html
149
hierarchy.html
@@ -191,80 +191,81 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
|
||||
<tr id="row_67_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" target="_self">others::Cache::LRUCache< K, V ></a></td><td class="desc"><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a> </td></tr>
|
||||
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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">others::lru_cache::LRUCache</a></td><td class="desc">LRU cache class </td></tr>
|
||||
<tr id="row_69_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" target="_self">divide_and_conquer::strassens_multiplication::Matrix< T, typename ></a></td><td class="desc"><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class.">Matrix</a> class </td></tr>
|
||||
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_71_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_73_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_75_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html" target="_self">data_structures::linked_list::Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_77_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_79_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node< ValueType ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">operations_on_datastructures::circular_linked_list::Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
|
||||
<tr id="row_81_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
|
||||
<tr id="row_83_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">others::recursive_tree_traversals::Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
|
||||
<tr id="row_85_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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">search::sublist_search::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_87_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d7c/structtests_1_1_node.html" target="_self">tests::Node</a></td><td class="desc">A <a class="el" href="d6/d7c/structtests_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="d6/d7c/structtests_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
|
||||
<tr id="row_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_89_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_self">strings::boyer_moore::pattern</a></td><td class="desc">A structure representing all the data we need to search the preprocessed pattern in text </td></tr>
|
||||
<tr id="row_90_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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">range_queries::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_91_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
|
||||
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_93_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d1b/classpriority__queue.html" target="_self">priority_queue< T ></a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_96_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_97_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_98_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue< ValueType ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_99_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/da8/classunordered__set_1_1reverse__iterator.html" target="_self">unordered_set< K >::reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d96/classvector_1_1reverse__iterator.html" target="_self">vector< T >::reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_103_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_104_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html" target="_self">data_structures::SegmentTree< T ></a></td><td class="desc">Class representation of the segment tree </td></tr>
|
||||
<tr id="row_105_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_105_" class="arrow" onclick="dynsection.toggleFolder('105_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG< X ></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_105_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD< X ></a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_106_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d9f/class_s_j_f.html" target="_self">SJF< S, T, E ></a></td><td class="desc">Class which implements the <a class="el" href="d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> scheduling algorithm </td></tr>
|
||||
<tr id="row_107_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_108_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_109_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_110_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html" target="_self">data_structures::Stack< T ></a></td><td class="desc">Class representation of a stack </td></tr>
|
||||
<tr id="row_111_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
|
||||
<tr id="row_112_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
|
||||
<tr id="row_113_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack< ValueType ></a></td><td class="desc">For std::invalid_argument </td></tr>
|
||||
<tr id="row_114_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_115_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_116_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d0f/classstats__computer1.html" target="_self">stats_computer1< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_117_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_118_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d02/classstats__computer2.html" target="_self">stats_computer2< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_119_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
|
||||
<tr id="row_120_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_121_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
|
||||
<tr id="row_122_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_123_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html" target="_self">data_structures::treap::Treap</a></td><td class="desc">Struct representation of the treap </td></tr>
|
||||
<tr id="row_124_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_124_" class="arrow" onclick="dynsection.toggleFolder('124_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree< X ></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_124_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD< X ></a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_125_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
|
||||
<tr id="row_126_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
|
||||
<tr id="row_127_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_128_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <span class="tt">a-z</span> </td></tr>
|
||||
<tr id="row_129_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_130_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_130_" class="arrow" onclick="dynsection.toggleFolder('130_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><b>std::true_type</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_130_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_130_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_130_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_130_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_130_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_130_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_131_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_132_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_133_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d6d/classunordered__set.html" target="_self">unordered_set< K ></a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_134_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/dfc/classvector.html" target="_self">vector< T ></a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_135_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
|
||||
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d15/class_memorised_factorial.html" target="_self">MemorisedFactorial</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_71_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_72_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_73_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_75_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html" target="_self">data_structures::linked_list::Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_77_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_79_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_80_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node< ValueType ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_81_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">operations_on_datastructures::circular_linked_list::Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
|
||||
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_83_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
|
||||
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_85_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">others::recursive_tree_traversals::Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
|
||||
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
<tr id="row_87_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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">search::sublist_search::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_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d7c/structtests_1_1_node.html" target="_self">tests::Node</a></td><td class="desc">A <a class="el" href="d6/d7c/structtests_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="d6/d7c/structtests_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
|
||||
<tr id="row_89_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_90_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_self">strings::boyer_moore::pattern</a></td><td class="desc">A structure representing all the data we need to search the preprocessed pattern in text </td></tr>
|
||||
<tr id="row_91_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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">range_queries::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_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
|
||||
<tr id="row_93_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_96_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d1b/classpriority__queue.html" target="_self">priority_queue< T ></a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_97_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_98_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_99_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue< ValueType ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/da8/classunordered__set_1_1reverse__iterator.html" target="_self">unordered_set< K >::reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_103_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d96/classvector_1_1reverse__iterator.html" target="_self">vector< T >::reverse_iterator</a></td><td class="desc">STL iterator class </td></tr>
|
||||
<tr id="row_104_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_105_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html" target="_self">data_structures::SegmentTree< T ></a></td><td class="desc">Class representation of the segment tree </td></tr>
|
||||
<tr id="row_106_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_106_" class="arrow" onclick="dynsection.toggleFolder('106_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG< X ></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_106_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD< X ></a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_107_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d9f/class_s_j_f.html" target="_self">SJF< S, T, E ></a></td><td class="desc">Class which implements the <a class="el" href="d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm.">SJF</a> scheduling algorithm </td></tr>
|
||||
<tr id="row_108_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_109_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_110_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_111_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html" target="_self">data_structures::Stack< T ></a></td><td class="desc">Class representation of a stack </td></tr>
|
||||
<tr id="row_112_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
|
||||
<tr id="row_113_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
|
||||
<tr id="row_114_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack< ValueType ></a></td><td class="desc">For std::invalid_argument </td></tr>
|
||||
<tr id="row_115_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_116_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_117_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d0f/classstats__computer1.html" target="_self">stats_computer1< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_118_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_119_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d02/classstats__computer2.html" target="_self">stats_computer2< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_120_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
|
||||
<tr id="row_121_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_122_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
|
||||
<tr id="row_123_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_124_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html" target="_self">data_structures::treap::Treap</a></td><td class="desc">Struct representation of the treap </td></tr>
|
||||
<tr id="row_125_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_125_" class="arrow" onclick="dynsection.toggleFolder('125_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree< X ></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_125_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD< X ></a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_126_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
|
||||
<tr id="row_127_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
|
||||
<tr id="row_128_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_129_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <span class="tt">a-z</span> </td></tr>
|
||||
<tr id="row_130_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_131_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_131_" class="arrow" onclick="dynsection.toggleFolder('131_')"><span class="arrowhead closed"></span></span><span class="icona"><span class="icon">C</span></span><b>std::true_type</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_131_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_131_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_131_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_131_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_131_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_131_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_132_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_133_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </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_134_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d6d/classunordered__set.html" target="_self">unordered_set< K ></a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_135_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/dfc/classvector.html" target="_self">vector< T ></a></td><td class="desc">STL class </td></tr>
|
||||
<tr id="row_136_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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 -->
|
||||
|
||||
@@ -72,6 +72,7 @@ var hierarchy =
|
||||
[ "others::Cache::LRUCache< K, V >", "d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html", null ],
|
||||
[ "others::lru_cache::LRUCache", "d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html", null ],
|
||||
[ "divide_and_conquer::strassens_multiplication::Matrix< T, typename >", "dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html", null ],
|
||||
[ "MemorisedFactorial", "da/d15/class_memorised_factorial.html", null ],
|
||||
[ "MinHeap", "d2/d05/class_min_heap.html", null ],
|
||||
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", null ],
|
||||
[ "mst", "d1/d77/structmst.html", null ],
|
||||
|
||||
@@ -1,7 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" 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,151,61"/>
|
||||
<area shape="rect" id="Node000001" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" title="The Heavy-Light Decomposition class." alt="" coords="199,45,344,101"/>
|
||||
<area shape="poly" id="edge2_Node000000_Node000001" title=" " alt="" coords="166,49,199,55,198,61,165,54"/>
|
||||
<area shape="rect" id="Node000002" 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,151,141"/>
|
||||
<area shape="poly" id="edge3_Node000002_Node000001" title=" " alt="" coords="165,92,198,86,199,91,166,98"/>
|
||||
<area shape="rect" id="Node000000" href="$de/d0d/classrange__queries_1_1fenwick__tree.html" title="The class that initializes the Fenwick Tree." alt="" coords="5,5,190,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
63959187ee3e2e3f45b53a6139717dfe
|
||||
6b91f80b28512355cc99440d1f709211
|
||||
@@ -4,58 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="262pt" height="110pt"
|
||||
viewBox="0.00 0.00 262.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 105.75)">
|
||||
<svg width="146pt" height="27pt"
|
||||
viewBox="0.00 0.00 146.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><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="#666666" points="109,-101.75 0,-101.75 0,-60 109,-60 109,-101.75"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-88.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-77" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="54.5" y="-65.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG< X ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_top" xlink:title="The Heavy-Light Decomposition class.">
|
||||
<polygon fill="white" stroke="#666666" points="254,-71.75 145,-71.75 145,-30 254,-30 254,-71.75"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="153" y="-58.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
|
||||
<text xml:space="preserve" text-anchor="start" x="153" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="199.5" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD< X ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node1 -->
|
||||
<g id="edge2_Node000000_Node000001" class="edge">
|
||||
<title>Node0->Node1</title>
|
||||
<g id="a_edge2_Node000000_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M120.16,-67.31C128.31,-65.6 136.58,-63.86 144.54,-62.19"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="119.7,-63.83 110.64,-69.31 121.14,-70.68 119.7,-63.83"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><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="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree< X ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge3_Node000002_Node000001" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<g id="a_edge3_Node000002_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M120.16,-34.44C128.31,-36.15 136.58,-37.89 144.54,-39.56"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="121.14,-31.07 110.64,-32.44 119.7,-37.92 121.14,-31.07"/>
|
||||
<g id="a_Node000000"><a xlink:href="de/d0d/classrange__queries_1_1fenwick__tree.html" target="_top" xlink:title="The class that initializes the Fenwick Tree.">
|
||||
<polygon fill="white" stroke="#666666" points="138.25,-19.25 0,-19.25 0,0 138.25,0 138.25,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="69.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::fenwick_tree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.6 KiB After Width: | Height: | Size: 1.0 KiB |
@@ -1,3 +1,7 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" 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,183,31"/>
|
||||
<area shape="rect" id="Node000000" 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,151,61"/>
|
||||
<area shape="rect" id="Node000001" href="$d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" title="The Heavy-Light Decomposition class." alt="" coords="199,45,344,101"/>
|
||||
<area shape="poly" id="edge2_Node000000_Node000001" title=" " alt="" coords="166,49,199,55,198,61,165,54"/>
|
||||
<area shape="rect" id="Node000002" 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,151,141"/>
|
||||
<area shape="poly" id="edge3_Node000002_Node000001" title=" " alt="" coords="165,92,198,86,199,91,166,98"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
ee57f6a4fc54bb7c3a6afb895a05fbfe
|
||||
63959187ee3e2e3f45b53a6139717dfe
|
||||
@@ -4,16 +4,58 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="141pt" height="27pt"
|
||||
viewBox="0.00 0.00 141.00 27.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 23.25)">
|
||||
<svg width="262pt" height="110pt"
|
||||
viewBox="0.00 0.00 262.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 105.75)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><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="#666666" points="133,-19.25 0,-19.25 0,0 133,0 133,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
|
||||
<g id="a_Node000000"><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="#666666" points="109,-101.75 0,-101.75 0,-60 109,-60 109,-101.75"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-88.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-77" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="54.5" y="-65.75" font-family="Helvetica,sans-Serif" font-size="10.00">::SG< X ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_top" xlink:title="The Heavy-Light Decomposition class.">
|
||||
<polygon fill="white" stroke="#666666" points="254,-71.75 145,-71.75 145,-30 254,-30 254,-71.75"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="153" y="-58.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
|
||||
<text xml:space="preserve" text-anchor="start" x="153" y="-47" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="199.5" y="-35.75" font-family="Helvetica,sans-Serif" font-size="10.00">::HLD< X ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node1 -->
|
||||
<g id="edge2_Node000000_Node000001" class="edge">
|
||||
<title>Node0->Node1</title>
|
||||
<g id="a_edge2_Node000000_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M120.16,-67.31C128.31,-65.6 136.58,-63.86 144.54,-62.19"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="119.7,-63.83 110.64,-69.31 121.14,-70.68 119.7,-63.83"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><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="#666666" points="109,-41.75 0,-41.75 0,0 109,0 109,-41.75"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">_light_decomposition</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="54.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Tree< X ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge3_Node000002_Node000001" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<g id="a_edge3_Node000002_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M120.16,-34.44C128.31,-36.15 136.58,-37.89 144.54,-39.56"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="121.14,-31.07 110.64,-32.44 119.7,-37.92 121.14,-31.07"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.1 KiB After Width: | Height: | Size: 3.6 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" title=" " alt="" coords="5,5,183,46"/>
|
||||
<area shape="rect" id="Node000000" 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,183,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
16fb1aa33fafc14e9745334295003576
|
||||
ee57f6a4fc54bb7c3a6afb895a05fbfe
|
||||
@@ -4,17 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="141pt" height="39pt"
|
||||
viewBox="0.00 0.00 141.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 34.5)">
|
||||
<svg width="141pt" height="27pt"
|
||||
viewBox="0.00 0.00 141.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
|
||||
<g id="a_Node000000"><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="#666666" points="133,-19.25 0,-19.25 0,0 133,0 133,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.1 KiB After Width: | Height: | Size: 1.1 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d8/d72/class_r_btree.html" title=" " alt="" coords="5,5,68,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" title=" " alt="" coords="5,5,183,46"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
4118d46187a1c497ec1244462bb4e7d1
|
||||
16fb1aa33fafc14e9745334295003576
|
||||
@@ -4,16 +4,17 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="55pt" height="27pt"
|
||||
viewBox="0.00 0.00 55.00 27.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 23.25)">
|
||||
<svg width="141pt" height="39pt"
|
||||
viewBox="0.00 0.00 141.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 34.5)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d8/d72/class_r_btree.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="46.75,-19.25 0,-19.25 0,0 46.75,0 46.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="23.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">RBtree</text>
|
||||
<g id="a_Node000000"><a xlink:href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="133,-30.5 0,-30.5 0,0 133,0 133,-30.5"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::perSegTree</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="66.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 958 B After Width: | Height: | Size: 1.1 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" 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,158,46"/>
|
||||
<area shape="rect" id="Node000000" href="$d8/d72/class_r_btree.html" title=" " alt="" coords="5,5,68,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
d1b903c12342c81b9815dc3248590328
|
||||
4118d46187a1c497ec1244462bb4e7d1
|
||||
@@ -4,17 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="122pt" height="39pt"
|
||||
viewBox="0.00 0.00 122.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 34.5)">
|
||||
<svg width="55pt" height="27pt"
|
||||
viewBox="0.00 0.00 55.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><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="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
|
||||
<g id="a_Node000000"><a xlink:href="d8/d72/class_r_btree.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="46.75,-19.25 0,-19.25 0,0 46.75,0 46.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="23.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">RBtree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.2 KiB After Width: | Height: | Size: 958 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,147,31"/>
|
||||
<area shape="rect" id="Node000000" 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,158,46"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
ec8e0ec9ba2659ae4c1c03a14fee656f
|
||||
d1b903c12342c81b9815dc3248590328
|
||||
@@ -4,16 +4,17 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="114pt" height="27pt"
|
||||
viewBox="0.00 0.00 114.00 27.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 23.25)">
|
||||
<svg width="122pt" height="39pt"
|
||||
viewBox="0.00 0.00 122.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 34.5)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
|
||||
<g id="a_Node000000"><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="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 978 B After Width: | Height: | Size: 1.2 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm." alt="" coords="5,5,115,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,147,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
ae80b7e5eab51d77087f805b22c5c3f0
|
||||
ec8e0ec9ba2659ae4c1c03a14fee656f
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="90pt" height="27pt"
|
||||
viewBox="0.00 0.00 90.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="114pt" height="27pt"
|
||||
viewBox="0.00 0.00 114.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d7/d9f/class_s_j_f.html" target="_top" xlink:title="Class which implements the SJF scheduling algorithm.">
|
||||
<polygon fill="white" stroke="#666666" points="82,-19.25 0,-19.25 0,0 82,0 82,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="41" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SJF< S, T, E ></text>
|
||||
<g id="a_Node000000"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1009 B After Width: | Height: | Size: 978 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$dd/d4f/class_solution.html" title=" " alt="" coords="5,5,74,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d7/d9f/class_s_j_f.html" title="Class which implements the SJF scheduling algorithm." alt="" coords="5,5,115,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
ff0be17deb0c0dfb25090b34c2c7d14f
|
||||
ae80b7e5eab51d77087f805b22c5c3f0
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="59pt" height="27pt"
|
||||
viewBox="0.00 0.00 59.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="90pt" height="27pt"
|
||||
viewBox="0.00 0.00 90.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
|
||||
<g id="a_Node000000"><a xlink:href="d7/d9f/class_s_j_f.html" target="_top" xlink:title="Class which implements the SJF scheduling algorithm.">
|
||||
<polygon fill="white" stroke="#666666" points="82,-19.25 0,-19.25 0,0 82,0 82,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="41" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SJF< S, T, E ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 961 B After Width: | Height: | Size: 1009 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d1/dc2/classstack.html" title="for std::invalid_argument" alt="" coords="5,5,143,31"/>
|
||||
<area shape="rect" id="Node000000" href="$dd/d4f/class_solution.html" title=" " alt="" coords="5,5,74,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
717e385118aaa4f551bc0a7a0954681d
|
||||
ff0be17deb0c0dfb25090b34c2c7d14f
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="111pt" height="27pt"
|
||||
viewBox="0.00 0.00 111.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="59pt" height="27pt"
|
||||
viewBox="0.00 0.00 59.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d1/dc2/classstack.html" target="_top" xlink:title="for std::invalid_argument">
|
||||
<polygon fill="white" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack< ValueType ></text>
|
||||
<g id="a_Node000000"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 992 B After Width: | Height: | Size: 961 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d1/dc2/classstack.html" title="for std::invalid_argument" alt="" coords="5,5,143,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
f583284f2e396e0f7b5fd8bccf0bb840
|
||||
717e385118aaa4f551bc0a7a0954681d
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="95pt" height="27pt"
|
||||
viewBox="0.00 0.00 95.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="111pt" height="27pt"
|
||||
viewBox="0.00 0.00 111.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d2/dc4/classstack__linked_list.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="86.5,-19.25 0,-19.25 0,0 86.5,0 86.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="43.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack_linkedList</text>
|
||||
<g id="a_Node000000"><a xlink:href="d1/dc2/classstack.html" target="_top" xlink:title="for std::invalid_argument">
|
||||
<polygon fill="white" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack< ValueType ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 975 B After Width: | Height: | Size: 992 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
adf4423c975497d5fe67f2bb0728f9b9
|
||||
f583284f2e396e0f7b5fd8bccf0bb840
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="167pt" height="27pt"
|
||||
viewBox="0.00 0.00 167.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="95pt" height="27pt"
|
||||
viewBox="0.00 0.00 95.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1< T ></text>
|
||||
<g id="a_Node000000"><a xlink:href="d2/dc4/classstack__linked_list.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="86.5,-19.25 0,-19.25 0,0 86.5,0 86.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="43.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack_linkedList</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1014 B After Width: | Height: | Size: 975 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
efb55af1cccef519836d4c2436ccda42
|
||||
adf4423c975497d5fe67f2bb0728f9b9
|
||||
@@ -11,9 +11,9 @@
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d8/dab/classstatistics_1_1stats__computer2.html" target="_top" xlink:title=" ">
|
||||
<g id="a_Node000000"><a xlink:href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2< T ></text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1< T ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1014 B After Width: | Height: | Size: 1014 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d2/d0f/classstats__computer1.html" title=" " alt="" coords="5,5,156,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
40a0f5e43a594b9f92e605b8a59193fa
|
||||
efb55af1cccef519836d4c2436ccda42
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="121pt" height="27pt"
|
||||
viewBox="0.00 0.00 121.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="167pt" height="27pt"
|
||||
viewBox="0.00 0.00 167.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d2/d0f/classstats__computer1.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="112.75,-19.25 0,-19.25 0,0 112.75,0 112.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stats_computer1< T ></text>
|
||||
<g id="a_Node000000"><a xlink:href="d8/dab/classstatistics_1_1stats__computer2.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2< T ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 991 B After Width: | Height: | Size: 1014 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$dc/d02/classstats__computer2.html" title=" " alt="" coords="5,5,156,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d2/d0f/classstats__computer1.html" title=" " alt="" coords="5,5,156,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
d4437759efff898ce34be0dab5e94c3f
|
||||
40a0f5e43a594b9f92e605b8a59193fa
|
||||
@@ -11,9 +11,9 @@
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="dc/d02/classstats__computer2.html" target="_top" xlink:title=" ">
|
||||
<g id="a_Node000000"><a xlink:href="d2/d0f/classstats__computer1.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="112.75,-19.25 0,-19.25 0,0 112.75,0 112.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stats_computer2< T ></text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stats_computer1< T ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 991 B After Width: | Height: | Size: 991 B |
@@ -1,15 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" title=" " alt="" coords="5,161,107,186"/>
|
||||
<area shape="rect" id="Node000001" href="$d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" title=" " alt="" coords="191,5,312,46"/>
|
||||
<area shape="poly" id="edge4_Node000000_Node000001" title=" " alt="" coords="71,146,106,101,128,77,153,57,189,39,191,44,156,61,132,81,110,104,76,149"/>
|
||||
<area shape="rect" id="Node000002" href="$dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" title=" " alt="" coords="191,71,312,111"/>
|
||||
<area shape="poly" id="edge5_Node000000_Node000002" title=" " alt="" coords="93,151,154,121,190,107,191,112,156,125,95,155"/>
|
||||
<area shape="rect" id="Node000003" href="$d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" title=" " alt="" coords="160,136,343,161"/>
|
||||
<area shape="poly" id="edge6_Node000000_Node000003" title=" " alt="" coords="122,163,159,158,159,163,122,168"/>
|
||||
<area shape="rect" id="Node000004" href="$d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" title=" " alt="" coords="160,185,343,210"/>
|
||||
<area shape="poly" id="edge7_Node000000_Node000004" title=" " alt="" coords="122,179,159,184,159,189,122,184"/>
|
||||
<area shape="rect" id="Node000005" href="$d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" title=" " alt="" coords="155,234,348,260"/>
|
||||
<area shape="poly" id="edge8_Node000000_Node000005" title=" " alt="" coords="95,192,156,221,189,231,188,236,154,225,93,197"/>
|
||||
<area shape="rect" id="Node000006" href="$df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" title=" " alt="" coords="155,284,348,309"/>
|
||||
<area shape="poly" id="edge9_Node000000_Node000006" title=" " alt="" coords="78,197,112,235,156,270,180,281,177,285,153,275,108,239,74,201"/>
|
||||
<area shape="rect" id="Node000000" href="$dc/d02/classstats__computer2.html" title=" " alt="" coords="5,5,156,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
40148db2c502b9385ae4dd5781440f30
|
||||
d4437759efff898ce34be0dab5e94c3f
|
||||
@@ -4,126 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="265pt" height="236pt"
|
||||
viewBox="0.00 0.00 265.00 236.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 231.88)">
|
||||
<svg width="121pt" height="27pt"
|
||||
viewBox="0.00 0.00 121.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="76,-111.25 0,-111.25 0,-92 76,-92 76,-111.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="230,-227.88 139,-227.88 139,-197.38 230,-197.38 230,-227.88"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="147" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">< uint128_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node1 -->
|
||||
<g id="edge4_Node000000_Node000001" class="edge">
|
||||
<title>Node0->Node1</title>
|
||||
<g id="a_edge4_Node000000_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M51.12,-121.24C64.02,-140.62 86.12,-169.85 112,-187.62 120.02,-193.13 129.38,-197.55 138.63,-201.04"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.11,-119.41 45.76,-112.9 48.22,-123.2 54.11,-119.41"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="230,-178.88 139,-178.88 139,-148.38 230,-148.38 230,-178.88"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="147" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-154.12" font-family="Helvetica,sans-Serif" font-size="10.00">< uint256_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node2 -->
|
||||
<g id="edge5_Node000000_Node000002" class="edge">
|
||||
<title>Node0->Node2</title>
|
||||
<g id="a_edge5_Node000000_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M66.39,-117.18C79.88,-124.5 96.54,-133.05 112,-139.62 120.56,-143.26 129.87,-146.73 138.85,-149.84"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.1,-114.13 57.65,-112.36 64.72,-120.25 68.1,-114.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="253.25,-130.25 115.75,-130.25 115.75,-111 253.25,-111 253.25,-130.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral< uint128_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node3 -->
|
||||
<g id="edge6_Node000000_Node000003" class="edge">
|
||||
<title>Node0->Node3</title>
|
||||
<g id="a_edge6_Node000000_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M87.56,-108.01C96.47,-109.18 105.92,-110.42 115.28,-111.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.08,-104.55 77.71,-106.72 87.17,-111.49 88.08,-104.55"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="253.25,-93.25 115.75,-93.25 115.75,-74 253.25,-74 253.25,-93.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral< uint256_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node4 -->
|
||||
<g id="edge7_Node000000_Node000004" class="edge">
|
||||
<title>Node0->Node4</title>
|
||||
<g id="a_edge7_Node000000_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M87.56,-95.58C96.47,-94.47 105.92,-93.29 115.28,-92.12"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.2,-92.09 77.71,-96.8 88.07,-99.04 87.2,-92.09"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="257,-56.25 112,-56.25 112,-37 257,-37 257,-56.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned< uint128_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node5 -->
|
||||
<g id="edge8_Node000000_Node000005" class="edge">
|
||||
<title>Node0->Node5</title>
|
||||
<g id="a_edge8_Node000000_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M66.23,-86C79.68,-78.76 96.35,-70.48 112,-64.62 120.03,-61.62 128.76,-58.96 137.26,-56.66"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.6,-82.9 57.53,-90.79 67.98,-89.03 64.6,-82.9"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="257,-19.25 112,-19.25 112,0 257,0 257,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned< uint256_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node6 -->
|
||||
<g id="edge9_Node000000_Node000006" class="edge">
|
||||
<title>Node0->Node6</title>
|
||||
<g id="a_edge9_Node000000_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M52.87,-82.53C66.18,-65.6 87.77,-41.48 112,-27.62 117.56,-24.45 123.67,-21.83 129.91,-19.66"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="50.21,-80.24 46.96,-90.32 55.79,-84.47 50.21,-80.24"/>
|
||||
<g id="a_Node000000"><a xlink:href="dc/d02/classstats__computer2.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="112.75,-19.25 0,-19.25 0,0 112.75,0 112.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="56.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stats_computer2< T ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 6.4 KiB After Width: | Height: | Size: 991 B |
@@ -1,3 +1,15 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="5,5,149,46"/>
|
||||
<area shape="rect" id="Node000000" title=" " alt="" coords="5,161,107,186"/>
|
||||
<area shape="rect" id="Node000001" href="$d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" title=" " alt="" coords="191,5,312,46"/>
|
||||
<area shape="poly" id="edge4_Node000000_Node000001" title=" " alt="" coords="71,146,106,101,128,77,153,57,189,39,191,44,156,61,132,81,110,104,76,149"/>
|
||||
<area shape="rect" id="Node000002" href="$dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" title=" " alt="" coords="191,71,312,111"/>
|
||||
<area shape="poly" id="edge5_Node000000_Node000002" title=" " alt="" coords="93,151,154,121,190,107,191,112,156,125,95,155"/>
|
||||
<area shape="rect" id="Node000003" href="$d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" title=" " alt="" coords="160,136,343,161"/>
|
||||
<area shape="poly" id="edge6_Node000000_Node000003" title=" " alt="" coords="122,163,159,158,159,163,122,168"/>
|
||||
<area shape="rect" id="Node000004" href="$d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" title=" " alt="" coords="160,185,343,210"/>
|
||||
<area shape="poly" id="edge7_Node000000_Node000004" title=" " alt="" coords="122,179,159,184,159,189,122,184"/>
|
||||
<area shape="rect" id="Node000005" href="$d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" title=" " alt="" coords="155,234,348,260"/>
|
||||
<area shape="poly" id="edge8_Node000000_Node000005" title=" " alt="" coords="95,192,156,221,189,231,188,236,154,225,93,197"/>
|
||||
<area shape="rect" id="Node000006" href="$df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" title=" " alt="" coords="155,284,348,309"/>
|
||||
<area shape="poly" id="edge9_Node000000_Node000006" title=" " alt="" coords="78,197,112,235,156,270,180,281,177,285,153,275,108,239,74,201"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
d6ee5f042479b5982faa79c9932e1b9c
|
||||
40148db2c502b9385ae4dd5781440f30
|
||||
@@ -4,17 +4,126 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="116pt" height="39pt"
|
||||
viewBox="0.00 0.00 116.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 34.5)">
|
||||
<svg width="265pt" height="236pt"
|
||||
viewBox="0.00 0.00 265.00 236.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 231.88)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_top" xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
|
||||
<polygon fill="white" stroke="#666666" points="107.5,-30.5 0,-30.5 0,0 107.5,0 107.5,-30.5"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
|
||||
<g id="a_Node000000"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="76,-111.25 0,-111.25 0,-92 76,-92 76,-111.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="230,-227.88 139,-227.88 139,-197.38 230,-197.38 230,-227.88"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="147" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">< uint128_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node1 -->
|
||||
<g id="edge4_Node000000_Node000001" class="edge">
|
||||
<title>Node0->Node1</title>
|
||||
<g id="a_edge4_Node000000_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M51.12,-121.24C64.02,-140.62 86.12,-169.85 112,-187.62 120.02,-193.13 129.38,-197.55 138.63,-201.04"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.11,-119.41 45.76,-112.9 48.22,-123.2 54.11,-119.41"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="230,-178.88 139,-178.88 139,-148.38 230,-148.38 230,-178.88"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="147" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-154.12" font-family="Helvetica,sans-Serif" font-size="10.00">< uint256_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node2 -->
|
||||
<g id="edge5_Node000000_Node000002" class="edge">
|
||||
<title>Node0->Node2</title>
|
||||
<g id="a_edge5_Node000000_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M66.39,-117.18C79.88,-124.5 96.54,-133.05 112,-139.62 120.56,-143.26 129.87,-146.73 138.85,-149.84"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.1,-114.13 57.65,-112.36 64.72,-120.25 68.1,-114.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="253.25,-130.25 115.75,-130.25 115.75,-111 253.25,-111 253.25,-130.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral< uint128_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node3 -->
|
||||
<g id="edge6_Node000000_Node000003" class="edge">
|
||||
<title>Node0->Node3</title>
|
||||
<g id="a_edge6_Node000000_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M87.56,-108.01C96.47,-109.18 105.92,-110.42 115.28,-111.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.08,-104.55 77.71,-106.72 87.17,-111.49 88.08,-104.55"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="253.25,-93.25 115.75,-93.25 115.75,-74 253.25,-74 253.25,-93.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral< uint256_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node4 -->
|
||||
<g id="edge7_Node000000_Node000004" class="edge">
|
||||
<title>Node0->Node4</title>
|
||||
<g id="a_edge7_Node000000_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M87.56,-95.58C96.47,-94.47 105.92,-93.29 115.28,-92.12"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.2,-92.09 77.71,-96.8 88.07,-99.04 87.2,-92.09"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="257,-56.25 112,-56.25 112,-37 257,-37 257,-56.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned< uint128_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node5 -->
|
||||
<g id="edge8_Node000000_Node000005" class="edge">
|
||||
<title>Node0->Node5</title>
|
||||
<g id="a_edge8_Node000000_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M66.23,-86C79.68,-78.76 96.35,-70.48 112,-64.62 120.03,-61.62 128.76,-58.96 137.26,-56.66"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.6,-82.9 57.53,-90.79 67.98,-89.03 64.6,-82.9"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="257,-19.25 112,-19.25 112,0 257,0 257,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned< uint256_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node0->Node6 -->
|
||||
<g id="edge9_Node000000_Node000006" class="edge">
|
||||
<title>Node0->Node6</title>
|
||||
<g id="a_edge9_Node000000_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M52.87,-82.53C66.18,-65.6 87.77,-41.48 112,-27.62 117.56,-24.45 123.67,-21.83 129.91,-19.66"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="50.21,-80.24 46.96,-90.32 55.79,-84.47 50.21,-80.24"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.2 KiB After Width: | Height: | Size: 6.4 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$da/d86/struct_test_case.html" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="5,5,83,31"/>
|
||||
<area shape="rect" id="Node000000" href="$dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="5,5,149,46"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
abd7e48c602c9ba41e00a619e3234e23
|
||||
d6ee5f042479b5982faa79c9932e1b9c
|
||||
@@ -4,16 +4,17 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="66pt" height="27pt"
|
||||
viewBox="0.00 0.00 66.00 27.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 23.25)">
|
||||
<svg width="116pt" height="39pt"
|
||||
viewBox="0.00 0.00 116.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 34.5)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="da/d86/struct_test_case.html" target="_top" xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
|
||||
<polygon fill="white" stroke="#666666" points="58,-19.25 0,-19.25 0,0 58,0 58,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="29" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
|
||||
<g id="a_Node000000"><a xlink:href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_top" xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
|
||||
<polygon fill="white" stroke="#666666" points="107.5,-30.5 0,-30.5 0,0 107.5,0 107.5,-30.5"/>
|
||||
<text xml:space="preserve" text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text xml:space="preserve" text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1.2 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d5/d58/class_test_cases.html" title="class encapsulating the necessary test cases" alt="" coords="5,5,90,31"/>
|
||||
<area shape="rect" id="Node000000" href="$da/d86/struct_test_case.html" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="5,5,83,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
a9d8d2a80cdf35dfac76eecdbb209456
|
||||
abd7e48c602c9ba41e00a619e3234e23
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="71pt" height="27pt"
|
||||
viewBox="0.00 0.00 71.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="66pt" height="27pt"
|
||||
viewBox="0.00 0.00 66.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d5/d58/class_test_cases.html" target="_top" xlink:title="class encapsulating the necessary test cases">
|
||||
<polygon fill="white" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases</text>
|
||||
<g id="a_Node000000"><a xlink:href="da/d86/struct_test_case.html" target="_top" xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
|
||||
<polygon fill="white" stroke="#666666" points="58,-19.25 0,-19.25 0,0 58,0 58,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="29" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1007 B After Width: | Height: | Size: 1.0 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$dc/d53/classtests_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List." alt="" coords="5,5,168,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d5/d58/class_test_cases.html" title="class encapsulating the necessary test cases" alt="" coords="5,5,90,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
1582871a9977d1f8d834882bd9106e10
|
||||
a9d8d2a80cdf35dfac76eecdbb209456
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="130pt" height="27pt"
|
||||
viewBox="0.00 0.00 130.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="71pt" height="27pt"
|
||||
viewBox="0.00 0.00 71.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="dc/d53/classtests_1_1_circular_linked_list.html" target="_top" xlink:title="A class that implements a Circular Linked List.">
|
||||
<polygon fill="white" stroke="#666666" points="121.75,-19.25 0,-19.25 0,0 121.75,0 121.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="60.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::CircularLinkedList</text>
|
||||
<g id="a_Node000000"><a xlink:href="d5/d58/class_test_cases.html" target="_top" xlink:title="class encapsulating the necessary test cases">
|
||||
<polygon fill="white" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1007 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d6/d7c/structtests_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree." alt="" coords="5,5,95,31"/>
|
||||
<area shape="rect" id="Node000000" href="$dc/d53/classtests_1_1_circular_linked_list.html" title="A class that implements a Circular Linked List." alt="" coords="5,5,168,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
f45d6d50ceb0ddd3bcef9faae75ffa44
|
||||
1582871a9977d1f8d834882bd9106e10
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="75pt" height="27pt"
|
||||
viewBox="0.00 0.00 75.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="130pt" height="27pt"
|
||||
viewBox="0.00 0.00 130.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d6/d7c/structtests_1_1_node.html" target="_top" xlink:title="A Node struct that represents a single Node in a Binary Tree.">
|
||||
<polygon fill="white" stroke="#666666" points="67,-19.25 0,-19.25 0,0 67,0 67,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="33.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::Node</text>
|
||||
<g id="a_Node000000"><a xlink:href="dc/d53/classtests_1_1_circular_linked_list.html" target="_top" xlink:title="A class that implements a Circular Linked List.">
|
||||
<polygon fill="white" stroke="#666666" points="121.75,-19.25 0,-19.25 0,0 121.75,0 121.75,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="60.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::CircularLinkedList</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1020 B After Width: | Height: | Size: 1.0 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d2/d2c/structtower.html" title=" " alt="" coords="5,5,59,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d6/d7c/structtests_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree." alt="" coords="5,5,95,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
76f1c23145670e75e2e13d0451b74420
|
||||
f45d6d50ceb0ddd3bcef9faae75ffa44
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="48pt" height="27pt"
|
||||
viewBox="0.00 0.00 48.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="75pt" height="27pt"
|
||||
viewBox="0.00 0.00 75.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d2/d2c/structtower.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="40,-19.25 0,-19.25 0,0 40,0 40,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="20" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tower</text>
|
||||
<g id="a_Node000000"><a xlink:href="d6/d7c/structtests_1_1_node.html" target="_top" xlink:title="A Node struct that represents a single Node in a Binary Tree.">
|
||||
<polygon fill="white" stroke="#666666" points="67,-19.25 0,-19.25 0,0 67,0 67,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="33.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests::Node</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 943 B After Width: | Height: | Size: 1020 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$dd/d2f/class_trie.html" title=" " alt="" coords="5,5,49,31"/>
|
||||
<area shape="rect" id="Node000000" href="$d2/d2c/structtower.html" title=" " alt="" coords="5,5,59,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
845eae9f7c70e50cf22fb926bd9e034b
|
||||
76f1c23145670e75e2e13d0451b74420
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="41pt" height="27pt"
|
||||
viewBox="0.00 0.00 41.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="48pt" height="27pt"
|
||||
viewBox="0.00 0.00 48.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="dd/d2f/class_trie.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie</text>
|
||||
<g id="a_Node000000"><a xlink:href="d2/d2c/structtower.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="40,-19.25 0,-19.25 0,0 40,0 40,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="20" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tower</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 950 B After Width: | Height: | Size: 943 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$de/d48/struct_trie_1_1_trie_node.html" title=" " alt="" coords="5,5,110,31"/>
|
||||
<area shape="rect" id="Node000000" href="$dd/d2f/class_trie.html" title=" " alt="" coords="5,5,49,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
a8666508fe9ca12fb7281895f580da44
|
||||
845eae9f7c70e50cf22fb926bd9e034b
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 13.1.2 (20250808.2320)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="86pt" height="27pt"
|
||||
viewBox="0.00 0.00 86.00 27.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="41pt" height="27pt"
|
||||
viewBox="0.00 0.00 41.00 27.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 23.25)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="de/d48/struct_trie_1_1_trie_node.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::TrieNode</text>
|
||||
<g id="a_Node000000"><a xlink:href="dd/d2f/class_trie.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
|
||||
<text xml:space="preserve" text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 978 B After Width: | Height: | Size: 950 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer" alt="" coords="5,5,80,31"/>
|
||||
<area shape="rect" id="Node000000" href="$de/d48/struct_trie_1_1_trie_node.html" title=" " alt="" coords="5,5,110,31"/>
|
||||
</map>
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user