mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-20 20:07:45 +08:00
Documentation for d7a9869dce
This commit is contained in:
github-actions
@@ -222,47 +222,50 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
|
||||
<tr id="row_18_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">is_integral< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_18_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">is_unsigned< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_18_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">is_unsigned< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_19_" class="arrow" onclick="toggleFolder('19_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
|
||||
<tr id="row_19_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="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
|
||||
<tr id="row_20_" 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/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_" 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/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_22_" 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/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_" 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/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
|
||||
<tr id="row_24_" 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/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
|
||||
<tr id="row_25_" 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/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_26_" 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/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" 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/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </td></tr>
|
||||
<tr id="row_28_" 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/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_29_" 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/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_30_" 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/dca/class_f_c_f_s.html" target="_self">FCFS</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
|
||||
<tr id="row_31_" 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/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_32_" 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/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" 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/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
|
||||
<tr id="row_34_" 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/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_35_" 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/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_36_" 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/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_37_" 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_38_" 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_39_" 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_40_" 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_41_" 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_42_" 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_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="db/d8b/struct_node.html" target="_self">Node</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="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></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="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></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="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_19_" class="arrow" onclick="toggleFolder('19_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">Algorithms with strings </td></tr>
|
||||
<tr id="row_19_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_19_0_" class="arrow" onclick="toggleFolder('19_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>boyer_moore</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;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">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_20_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_20_" class="arrow" onclick="toggleFolder('20_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
|
||||
<tr id="row_20_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="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
|
||||
<tr id="row_21_" 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/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_22_" 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/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_" 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/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_24_" 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/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
|
||||
<tr id="row_25_" 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/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
|
||||
<tr id="row_26_" 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/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" 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/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_28_" 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/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </td></tr>
|
||||
<tr id="row_29_" 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/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_30_" 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/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_31_" 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/dca/class_f_c_f_s.html" target="_self">FCFS</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
|
||||
<tr id="row_32_" 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/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" 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/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_34_" 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/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
|
||||
<tr id="row_35_" 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/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_36_" 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/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_37_" 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/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_38_" 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/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_39_" 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/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </td></tr>
|
||||
<tr id="row_40_" 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_41_" 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_42_" 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_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="d5/da1/structnode.html" target="_self">node</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="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></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="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></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="dd/d1b/structquery.html" target="_self">query</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="dc/db5/struct_queue.html" target="_self">Queue</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="d8/d72/class_r_btree.html" target="_self">RBtree</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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</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="dd/d4f/class_solution.html" target="_self">Solution</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="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</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="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_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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_55_" class="arrow" onclick="toggleFolder('55_')">►</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_55_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_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/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </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="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_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="db/da9/classqueue.html" target="_self">queue</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="d8/d72/class_r_btree.html" target="_self">RBtree</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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</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="dd/d4f/class_solution.html" target="_self">Solution</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/dc2/classstack.html" target="_self">stack</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</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="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_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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_56_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_56_" class="arrow" onclick="toggleFolder('56_')">►</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_56_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_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="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_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="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -165,6 +165,11 @@ var annotated_dup =
|
||||
[ "is_unsigned< uint128_t >", "d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html", null ],
|
||||
[ "is_unsigned< uint256_t >", "df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html", null ]
|
||||
] ],
|
||||
[ "strings", "df/dcb/namespacestrings.html", [
|
||||
[ "boyer_moore", null, [
|
||||
[ "pattern", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern" ]
|
||||
] ]
|
||||
] ],
|
||||
[ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ],
|
||||
[ "Btree", "d9/d90/struct_btree.html", null ],
|
||||
[ "cll", "d5/d15/classcll.html", null ],
|
||||
@@ -192,8 +197,8 @@ var annotated_dup =
|
||||
[ "Node", "db/d8b/struct_node.html", null ],
|
||||
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
|
||||
[ "query", "dd/d1b/structquery.html", null ],
|
||||
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
|
||||
[ "RBtree", "d8/d72/class_r_btree.html", null ],
|
||||
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
|
||||
[ "Solution", "dd/d4f/class_solution.html", null ],
|
||||
|
||||
@@ -143,10 +143,10 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
|
||||
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html">Node</a> (data_structures::linked_list)</dd><dd><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html">Node</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> (others::recursive_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a id="letter_P" name="letter_P">P</a></dt>
|
||||
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> (geometry::grahamscan)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="de/d4f/structmath_1_1_point.html">Point</a> (<a class="el" href="dd/d47/namespacemath.html">math</a>)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
|
||||
<dd><a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> (strings::boyer_moore)</dd><dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d7/d48/structgeometry_1_1grahamscan_1_1_point.html">Point</a> (geometry::grahamscan)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="de/d4f/structmath_1_1_point.html">Point</a> (<a class="el" href="dd/d47/namespacemath.html">math</a>)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
|
||||
<dl class="classindex even">
|
||||
<dt class="alphachar"><a id="letter_Q" name="letter_Q">Q</a></dt>
|
||||
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)</dd></dl>
|
||||
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)</dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a id="letter_R" name="letter_R">R</a></dt>
|
||||
<dd><a class="el" href="d8/d72/class_r_btree.html">RBtree</a></dd><dd><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd></dl>
|
||||
|
||||
15
d1/db6/boyer__moore_8cpp__incl.map
Normal file
15
d1/db6/boyer__moore_8cpp__incl.map
Normal file
@@ -0,0 +1,15 @@
|
||||
<map id="strings/boyer_moore.cpp" name="strings/boyer_moore.cpp">
|
||||
<area shape="rect" id="Node000001" title="The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit char..." alt="" coords="169,5,333,31"/>
|
||||
<area shape="rect" id="Node000002" title=" " alt="" coords="5,79,70,105"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="215,34,85,78,83,73,214,29"/>
|
||||
<area shape="rect" id="Node000003" title=" " alt="" coords="93,79,153,105"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="230,34,159,74,156,69,228,29"/>
|
||||
<area shape="rect" id="Node000004" title=" " alt="" coords="177,79,237,105"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="246,33,224,68,220,65,241,30"/>
|
||||
<area shape="rect" id="Node000005" title=" " alt="" coords="261,79,332,105"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="261,30,283,65,278,68,256,33"/>
|
||||
<area shape="rect" id="Node000006" title=" " alt="" coords="356,79,410,105"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="274,29,349,69,347,74,272,34"/>
|
||||
<area shape="rect" id="Node000007" title=" " alt="" coords="434,79,492,105"/>
|
||||
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="288,29,421,74,419,79,286,34"/>
|
||||
</map>
|
||||
1
d1/db6/boyer__moore_8cpp__incl.md5
Normal file
1
d1/db6/boyer__moore_8cpp__incl.md5
Normal file
@@ -0,0 +1 @@
|
||||
56e0959d91df519c0f74c7b52d594910
|
||||
154
d1/db6/boyer__moore_8cpp__incl.svg
Normal file
154
d1/db6/boyer__moore_8cpp__incl.svg
Normal file
@@ -0,0 +1,154 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings/boyer_moore.cpp Pages: 1 -->
|
||||
<svg width="373pt" height="83pt"
|
||||
viewBox="0.00 0.00 372.62 82.50" 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" onload="init(evt)">
|
||||
<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 78.5)">
|
||||
<title>strings/boyer_moore.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit char...">
|
||||
<polygon fill="#999999" stroke="#666666" points="245.75,-74.5 122.5,-74.5 122.5,-55.25 245.75,-55.25 245.75,-74.5"/>
|
||||
<text text-anchor="middle" x="184.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">strings/boyer_moore.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
|
||||
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M156.98,-54.84C129.91,-45.83 88.21,-31.95 58.76,-22.15"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.1,-18.58 49.51,-18.74 57.89,-25.22 60.1,-18.58"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="110.38,-19.25 65.88,-19.25 65.88,0 110.38,0 110.38,-19.25"/>
|
||||
<text text-anchor="middle" x="88.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">climits</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<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="M167.84,-54.84C153.08,-46.66 131.09,-34.46 113.94,-24.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="115.93,-21.49 105.49,-19.7 112.54,-27.61 115.93,-21.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="173.75,-19.25 128.5,-19.25 128.5,0 173.75,0 173.75,-19.25"/>
|
||||
<text text-anchor="middle" x="151.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstring</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<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="M178.68,-55.08C174.26,-47.96 167.89,-37.68 162.39,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="164.94,-27.27 156.69,-20.61 158.99,-30.95 164.94,-27.27"/>
|
||||
</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="244.88,-19.25 191.38,-19.25 191.38,0 244.88,0 244.88,-19.25"/>
|
||||
<text text-anchor="middle" x="218.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M189.74,-55.08C194.29,-47.96 200.85,-37.68 206.52,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.96,-30.92 212.39,-20.61 204.06,-27.15 209.96,-30.92"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="303.12,-19.25 263.12,-19.25 263.12,0 303.12,0 303.12,-19.25"/>
|
||||
<text text-anchor="middle" x="283.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5_Node000001_Node000006" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M200.92,-54.84C216.28,-46.58 239.24,-34.23 257,-24.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="258.1,-27.52 265.25,-19.7 254.78,-21.36 258.1,-27.52"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="364.62,-19.25 321.62,-19.25 321.62,0 364.62,0 364.62,-19.25"/>
|
||||
<text text-anchor="middle" x="343.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge6_Node000001_Node000007" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M211.1,-54.84C238.72,-45.59 281.64,-31.22 311,-21.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="311.78,-24.48 320.15,-17.98 309.56,-17.84 311.78,-24.48"/>
|
||||
</a>
|
||||
</g>
|
||||
</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: 6.1 KiB |
129
d1/db6/boyer__moore_8cpp__incl_org.svg
Normal file
129
d1/db6/boyer__moore_8cpp__incl_org.svg
Normal file
@@ -0,0 +1,129 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings/boyer_moore.cpp Pages: 1 -->
|
||||
<svg width="373pt" height="83pt"
|
||||
viewBox="0.00 0.00 372.62 82.50" 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>strings/boyer_moore.cpp</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="The Boyer–Moore algorithm searches for occurrences of pattern P in text T by performing explicit char...">
|
||||
<polygon fill="#999999" stroke="#666666" points="245.75,-74.5 122.5,-74.5 122.5,-55.25 245.75,-55.25 245.75,-74.5"/>
|
||||
<text text-anchor="middle" x="184.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">strings/boyer_moore.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
|
||||
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M156.98,-54.84C129.91,-45.83 88.21,-31.95 58.76,-22.15"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="60.1,-18.58 49.51,-18.74 57.89,-25.22 60.1,-18.58"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="110.38,-19.25 65.88,-19.25 65.88,0 110.38,0 110.38,-19.25"/>
|
||||
<text text-anchor="middle" x="88.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">climits</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<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="M167.84,-54.84C153.08,-46.66 131.09,-34.46 113.94,-24.94"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="115.93,-21.49 105.49,-19.7 112.54,-27.61 115.93,-21.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="173.75,-19.25 128.5,-19.25 128.5,0 173.75,0 173.75,-19.25"/>
|
||||
<text text-anchor="middle" x="151.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstring</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<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="M178.68,-55.08C174.26,-47.96 167.89,-37.68 162.39,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="164.94,-27.27 156.69,-20.61 158.99,-30.95 164.94,-27.27"/>
|
||||
</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="244.88,-19.25 191.38,-19.25 191.38,0 244.88,0 244.88,-19.25"/>
|
||||
<text text-anchor="middle" x="218.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M189.74,-55.08C194.29,-47.96 200.85,-37.68 206.52,-28.8"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.96,-30.92 212.39,-20.61 204.06,-27.15 209.96,-30.92"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="303.12,-19.25 263.12,-19.25 263.12,0 303.12,0 303.12,-19.25"/>
|
||||
<text text-anchor="middle" x="283.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge5_Node000001_Node000006" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M200.92,-54.84C216.28,-46.58 239.24,-34.23 257,-24.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="258.1,-27.52 265.25,-19.7 254.78,-21.36 258.1,-27.52"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="Node000007" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_Node000007"><a xlink:title=" ">
|
||||
<polygon fill="#e0e0e0" stroke="#999999" points="364.62,-19.25 321.62,-19.25 321.62,0 364.62,0 364.62,-19.25"/>
|
||||
<text text-anchor="middle" x="343.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge6_Node000001_Node000007" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M211.1,-54.84C238.72,-45.59 281.64,-31.22 311,-21.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="311.78,-24.48 320.15,-17.98 309.56,-17.84 311.78,-24.48"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 5.3 KiB |
702
d3/db2/boyer__moore_8cpp.html
Normal file
702
d3/db2/boyer__moore_8cpp.html
Normal file
@@ -0,0 +1,702 @@
|
||||
<!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.9.7"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: strings/boyer_moore.cpp File Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.7 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('d3/db2/boyer__moore_8cpp.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<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="summary">
|
||||
<a href="#nested-classes">Classes</a> |
|
||||
<a href="#namespaces">Namespaces</a> |
|
||||
<a href="#define-members">Macros</a> |
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle"><div class="title">boyer_moore.cpp File Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible.
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <climits></code><br />
|
||||
<code>#include <cstring></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <string></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for boyer_moore.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/db6/boyer__moore_8cpp__incl.svg" width="498" 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><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
|
||||
Classes</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></td></tr>
|
||||
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">A structure representing all the data we need to search the preprocessed pattern in text. <a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#details">More...</a><br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:df/dcb/namespacestrings"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/dcb/namespacestrings.html">strings</a></td></tr>
|
||||
<tr class="memdesc:df/dcb/namespacestrings"><td class="mdescLeft"> </td><td class="mdescRight">Algorithms with strings. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="define-members" name="define-members"></a>
|
||||
Macros</h2></td></tr>
|
||||
<tr class="memitem:a77c872c08612d7b8861ba13bc9881cbd"><td class="memItemLeft" align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a>   CHAR_MAX</td></tr>
|
||||
<tr class="memdesc:a77c872c08612d7b8861ba13bc9881cbd"><td class="mdescLeft"> </td><td class="mdescRight">number of symbols in the alphabet we use <br /></td></tr>
|
||||
<tr class="separator:a77c872c08612d7b8861ba13bc9881cbd"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:aa709cf7fca02b7d3e1888423d5f739a1"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1">strings::boyer_moore::init_good_suffix</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &str, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > &arg)</td></tr>
|
||||
<tr class="memdesc:aa709cf7fca02b7d3e1888423d5f739a1"><td class="mdescLeft"> </td><td class="mdescRight">A function that preprocess the good suffix thable. <br /></td></tr>
|
||||
<tr class="separator:aa709cf7fca02b7d3e1888423d5f739a1"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a2f6688c9bb3e692297a3aa09cebc1c00"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00">strings::boyer_moore::init_bad_char</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &str, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > &arg)</td></tr>
|
||||
<tr class="memdesc:a2f6688c9bb3e692297a3aa09cebc1c00"><td class="mdescLeft"> </td><td class="mdescRight">A function that preprocess the bad char table. <br /></td></tr>
|
||||
<tr class="separator:a2f6688c9bb3e692297a3aa09cebc1c00"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0b165af1dc341289fd705be4c67728f8"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &str, <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &arg)</td></tr>
|
||||
<tr class="memdesc:a0b165af1dc341289fd705be4c67728f8"><td class="mdescLeft"> </td><td class="mdescRight">A function that initializes pattern. <br /></td></tr>
|
||||
<tr class="separator:a0b165af1dc341289fd705be4c67728f8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a15703b553faed0d28202c10808cf9738"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &str, const <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> &arg)</td></tr>
|
||||
<tr class="memdesc:a15703b553faed0d28202c10808cf9738"><td class="mdescLeft"> </td><td class="mdescRight">A function that implements Boyer-Moore's algorithm. <br /></td></tr>
|
||||
<tr class="separator:a15703b553faed0d28202c10808cf9738"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a056122c8fe8fb0f5fca6428d3f7b5c3a"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a">strings::boyer_moore::is_prefix</a> (const char *str, const char *pat, size_t len)</td></tr>
|
||||
<tr class="memdesc:a056122c8fe8fb0f5fca6428d3f7b5c3a"><td class="mdescLeft"> </td><td class="mdescRight">Check if pat is prefix of str. <br /></td></tr>
|
||||
<tr class="separator:a056122c8fe8fb0f5fca6428d3f7b5c3a"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:acb8f69e7901ee7459d98bd4b9dda79d9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a> (const char *text)</td></tr>
|
||||
<tr class="memdesc:acb8f69e7901ee7459d98bd4b9dda79d9"><td class="mdescLeft"> </td><td class="mdescRight">A test case in which we search for every appearance of the word 'and'. <br /></td></tr>
|
||||
<tr class="separator:acb8f69e7901ee7459d98bd4b9dda79d9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac8fac0dd4b19973da103a434143a16d2"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">pat_test</a> (const char *text)</td></tr>
|
||||
<tr class="memdesc:ac8fac0dd4b19973da103a434143a16d2"><td class="mdescLeft"> </td><td class="mdescRight">A test case in which we search for every appearance of the word 'pat'. <br /></td></tr>
|
||||
<tr class="separator:ac8fac0dd4b19973da103a434143a16d2"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
|
||||
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations. <br /></td></tr>
|
||||
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible. </p>
|
||||
<p>The key insight in this algorithm is that if the end of the pattern is compared to the text, then jumps along the text can be made rather than checking every character of the text. The reason that this works is that in lining up the pattern against the text, the last character of the pattern is compared to the character in the text.</p>
|
||||
<p>If the characters do not match, there is no need to continue searching backwards along the text. This leaves us with two cases.</p>
|
||||
<p>Case 1: If the character in the text does not match any of the characters in the pattern, then the next character in the text to check is located m characters farther along the text, where m is the length of the pattern.</p>
|
||||
<p>Case 2: If the character in the text is in the pattern, then a partial shift of the pattern along the text is done to line up along the matching character and the process is repeated.</p>
|
||||
<p>There are two shift rules:</p>
|
||||
<p>[The bad character rule] (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_bad_character_rule">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_bad_character_rule</a>)</p>
|
||||
<p>[The good suffix rule] (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_good_suffix_rule">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm#The_good_suffix_rule</a>)</p>
|
||||
<p>The shift rules are implemented as constant-time table lookups, using tables generated during the preprocessing of P. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/stoychoX" target="_blank">Stoycho Kyosev</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Macro Definition Documentation</h2>
|
||||
<a id="a77c872c08612d7b8861ba13bc9881cbd" name="a77c872c08612d7b8861ba13bc9881cbd"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a77c872c08612d7b8861ba13bc9881cbd">◆ </a></span>APLHABET_SIZE</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">#define APLHABET_SIZE   CHAR_MAX</td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>number of symbols in the alphabet we use </p>
|
||||
<p>for assert for CHAR_MAX macro for strlen for IO operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="acb8f69e7901ee7459d98bd4b9dda79d9" name="acb8f69e7901ee7459d98bd4b9dda79d9"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#acb8f69e7901ee7459d98bd4b9dda79d9">◆ </a></span>and_test()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void and_test </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const char * </td>
|
||||
<td class="paramname"><em>text</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A test case in which we search for every appearance of the word 'and'. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">text</td><td>The text in which we search for appearance of the word 'and' </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 218</span> {</div>
|
||||
<div class="line"><span class="lineno"> 219</span> <a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a> ands;</div>
|
||||
<div class="line"><span class="lineno"> 220</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a>(<span class="stringliteral">"and"</span>, ands);</div>
|
||||
<div class="line"><span class="lineno"> 221</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> indexes = <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a>(text, ands);</div>
|
||||
<div class="line"><span class="lineno"> 222</span> </div>
|
||||
<div class="line"><span class="lineno"> 223</span> assert(indexes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 2);</div>
|
||||
<div class="line"><span class="lineno"> 224</span> assert(strings::boyer_moore::is_prefix(text + indexes[0], <span class="stringliteral">"and"</span>, 3));</div>
|
||||
<div class="line"><span class="lineno"> 225</span> assert(strings::boyer_moore::is_prefix(text + indexes[1], <span class="stringliteral">"and"</span>, 3));</div>
|
||||
<div class="line"><span class="lineno"> 226</span>}</div>
|
||||
<div class="ttc" id="aboyer__moore_8cpp_html_a0b165af1dc341289fd705be4c67728f8"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a></div><div class="ttdeci">void init_pattern(const std::string &str, pattern &arg)</div><div class="ttdoc">A function that initializes pattern.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:151</div></div>
|
||||
<div class="ttc" id="aboyer__moore_8cpp_html_a15703b553faed0d28202c10808cf9738"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a></div><div class="ttdeci">std::vector< size_t > search(const std::string &str, const pattern &arg)</div><div class="ttdoc">A function that implements Boyer-Moore's algorithm.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:163</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="astructstrings_1_1boyer__moore_1_1pattern_html"><div class="ttname"><a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></div><div class="ttdoc">A structure representing all the data we need to search the preprocessed pattern in text.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:68</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_acb8f69e7901ee7459d98bd4b9dda79d9_cgraph.svg" width="246" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a2f6688c9bb3e692297a3aa09cebc1c00" name="a2f6688c9bb3e692297a3aa09cebc1c00"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a2f6688c9bb3e692297a3aa09cebc1c00">◆ </a></span>init_bad_char()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void strings::boyer_moore::init_bad_char </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> & </td>
|
||||
<td class="paramname"><em>str</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > & </td>
|
||||
<td class="paramname"><em>arg</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A function that preprocess the bad char table. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">str</td><td>The string being preprocessed </td></tr>
|
||||
<tr><td class="paramname">arg</td><td>The bad char table </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 136</span> {</div>
|
||||
<div class="line"><span class="lineno"> 137</span> arg.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(<a class="code hl_define" href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a>, str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>());</div>
|
||||
<div class="line"><span class="lineno"> 138</span> </div>
|
||||
<div class="line"><span class="lineno"> 139</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>(); i++) {</div>
|
||||
<div class="line"><span class="lineno"> 140</span> arg[str[i]] = str.length() - i - 1;</div>
|
||||
<div class="line"><span class="lineno"> 141</span> }</div>
|
||||
<div class="line"><span class="lineno"> 142</span>}</div>
|
||||
<div class="ttc" id="aboyer__moore_8cpp_html_a77c872c08612d7b8861ba13bc9881cbd"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">APLHABET_SIZE</a></div><div class="ttdeci">#define APLHABET_SIZE</div><div class="ttdoc">number of symbols in the alphabet we use</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:50</div></div>
|
||||
<div class="ttc" id="aresize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/resize.html">std::vector::resize</a></div><div class="ttdeci">T resize(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_a2f6688c9bb3e692297a3aa09cebc1c00_cgraph.svg" width="328" height="92"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="aa709cf7fca02b7d3e1888423d5f739a1" name="aa709cf7fca02b7d3e1888423d5f739a1"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa709cf7fca02b7d3e1888423d5f739a1">◆ </a></span>init_good_suffix()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void strings::boyer_moore::init_good_suffix </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> & </td>
|
||||
<td class="paramname"><em>str</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > & </td>
|
||||
<td class="paramname"><em>arg</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A function that preprocess the good suffix thable. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">str</td><td>The string being preprocessed </td></tr>
|
||||
<tr><td class="paramname">arg</td><td>The good suffix table </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 87</span> {</div>
|
||||
<div class="line"><span class="lineno"> 88</span> arg.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/resize.html">resize</a>(str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, 0);</div>
|
||||
<div class="line"><span class="lineno"> 89</span> </div>
|
||||
<div class="line"><span class="lineno"> 90</span> <span class="comment">// border_pos[i] - the index of the longest proper suffix of str[i..] which</span></div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="comment">// is also a proper prefix.</span></div>
|
||||
<div class="line"><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> border_pos(str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() + 1, 0);</div>
|
||||
<div class="line"><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="keywordtype">size_t</span> current_char = str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>();</div>
|
||||
<div class="line"><span class="lineno"> 95</span> </div>
|
||||
<div class="line"><span class="lineno"> 96</span> <span class="keywordtype">size_t</span> border_index = str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() + 1;</div>
|
||||
<div class="line"><span class="lineno"> 97</span> </div>
|
||||
<div class="line"><span class="lineno"> 98</span> border_pos[current_char] = border_index;</div>
|
||||
<div class="line"><span class="lineno"> 99</span> </div>
|
||||
<div class="line"><span class="lineno"> 100</span> <span class="keywordflow">while</span> (current_char > 0) {</div>
|
||||
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">while</span> (border_index <= str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>() &&</div>
|
||||
<div class="line"><span class="lineno"> 102</span> str[current_char - 1] != str[border_index - 1]) {</div>
|
||||
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">if</span> (arg[border_index] == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 104</span> arg[border_index] = border_index - current_char;</div>
|
||||
<div class="line"><span class="lineno"> 105</span> }</div>
|
||||
<div class="line"><span class="lineno"> 106</span> </div>
|
||||
<div class="line"><span class="lineno"> 107</span> border_index = border_pos[border_index];</div>
|
||||
<div class="line"><span class="lineno"> 108</span> }</div>
|
||||
<div class="line"><span class="lineno"> 109</span> </div>
|
||||
<div class="line"><span class="lineno"> 110</span> current_char--;</div>
|
||||
<div class="line"><span class="lineno"> 111</span> border_index--;</div>
|
||||
<div class="line"><span class="lineno"> 112</span> border_pos[current_char] = border_index;</div>
|
||||
<div class="line"><span class="lineno"> 113</span> }</div>
|
||||
<div class="line"><span class="lineno"> 114</span> </div>
|
||||
<div class="line"><span class="lineno"> 115</span> <span class="keywordtype">size_t</span> largest_border_index = border_pos[0];</div>
|
||||
<div class="line"><span class="lineno"> 116</span> </div>
|
||||
<div class="line"><span class="lineno"> 117</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>(); i++) {</div>
|
||||
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">if</span> (arg[i] == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 119</span> arg[i] = largest_border_index;</div>
|
||||
<div class="line"><span class="lineno"> 120</span> }</div>
|
||||
<div class="line"><span class="lineno"> 121</span> </div>
|
||||
<div class="line"><span class="lineno"> 122</span> <span class="comment">// If we go pass the largest border we find the next one as we iterate</span></div>
|
||||
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (i == largest_border_index) {</div>
|
||||
<div class="line"><span class="lineno"> 124</span> largest_border_index = border_pos[largest_border_index];</div>
|
||||
<div class="line"><span class="lineno"> 125</span> }</div>
|
||||
<div class="line"><span class="lineno"> 126</span> }</div>
|
||||
<div class="line"><span class="lineno"> 127</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_aa709cf7fca02b7d3e1888423d5f739a1_cgraph.svg" width="328" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a0b165af1dc341289fd705be4c67728f8" name="a0b165af1dc341289fd705be4c67728f8"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a0b165af1dc341289fd705be4c67728f8">◆ </a></span>init_pattern()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void strings::boyer_moore::init_pattern </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> & </td>
|
||||
<td class="paramname"><em>str</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> & </td>
|
||||
<td class="paramname"><em>arg</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A function that initializes pattern. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">str</td><td>Text used for initialization </td></tr>
|
||||
<tr><td class="paramname">arg</td><td>Initialized structure </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 151</span> {</div>
|
||||
<div class="line"><span class="lineno"> 152</span> arg.pat = str;</div>
|
||||
<div class="line"><span class="lineno"> 153</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00">init_bad_char</a>(str, arg.bad_char);</div>
|
||||
<div class="line"><span class="lineno"> 154</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1">init_good_suffix</a>(str, arg.good_suffix);</div>
|
||||
<div class="line"><span class="lineno"> 155</span>}</div>
|
||||
<div class="ttc" id="aboyer__moore_8cpp_html_a2f6688c9bb3e692297a3aa09cebc1c00"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00">strings::boyer_moore::init_bad_char</a></div><div class="ttdeci">void init_bad_char(const std::string &str, std::vector< size_t > &arg)</div><div class="ttdoc">A function that preprocess the bad char table.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:136</div></div>
|
||||
<div class="ttc" id="aboyer__moore_8cpp_html_aa709cf7fca02b7d3e1888423d5f739a1"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1">strings::boyer_moore::init_good_suffix</a></div><div class="ttdeci">void init_good_suffix(const std::string &str, std::vector< size_t > &arg)</div><div class="ttdoc">A function that preprocess the good suffix thable.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:87</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_a0b165af1dc341289fd705be4c67728f8_cgraph.svg" width="520" height="166"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a056122c8fe8fb0f5fca6428d3f7b5c3a" name="a056122c8fe8fb0f5fca6428d3f7b5c3a"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a056122c8fe8fb0f5fca6428d3f7b5c3a">◆ </a></span>is_prefix()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool strings::boyer_moore::is_prefix </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const char * </td>
|
||||
<td class="paramname"><em>str</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const char * </td>
|
||||
<td class="paramname"><em>pat</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">size_t </td>
|
||||
<td class="paramname"><em>len</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Check if pat is prefix of str. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">str</td><td>pointer to some part of the input text. </td></tr>
|
||||
<tr><td class="paramname">pat</td><td>the searched pattern. </td></tr>
|
||||
<tr><td class="paramname">len</td><td>length of the searched pattern </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd><code>true</code> if pat IS prefix of str. </dd>
|
||||
<dd>
|
||||
<code>false</code> if pat is NOT a prefix of str. </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 198</span> {</div>
|
||||
<div class="line"><span class="lineno"> 199</span> <span class="keywordflow">if</span> (<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">strlen</a>(str) < len) {</div>
|
||||
<div class="line"><span class="lineno"> 200</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 201</span> }</div>
|
||||
<div class="line"><span class="lineno"> 202</span> </div>
|
||||
<div class="line"><span class="lineno"> 203</span> <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < len; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 204</span> <span class="keywordflow">if</span> (str[i] != pat[i]) {</div>
|
||||
<div class="line"><span class="lineno"> 205</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 206</span> }</div>
|
||||
<div class="line"><span class="lineno"> 207</span> }</div>
|
||||
<div class="line"><span class="lineno"> 208</span> </div>
|
||||
<div class="line"><span class="lineno"> 209</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 210</span>}</div>
|
||||
<div class="ttc" id="astrlen_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/byte/strlen.html">std::strlen</a></div><div class="ttdeci">T strlen(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_a056122c8fe8fb0f5fca6428d3f7b5c3a_cgraph.svg" width="155" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int main </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">void </td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 267</span> {</div>
|
||||
<div class="line"><span class="lineno"> 268</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><span class="lineno"> 269</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 270</span>}</div>
|
||||
<div class="ttc" id="aboyer__moore_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:248</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="442" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ac8fac0dd4b19973da103a434143a16d2" name="ac8fac0dd4b19973da103a434143a16d2"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ac8fac0dd4b19973da103a434143a16d2">◆ </a></span>pat_test()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void pat_test </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const char * </td>
|
||||
<td class="paramname"><em>text</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A test case in which we search for every appearance of the word 'pat'. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">text</td><td>The text in which we search for appearance of the word 'pat' </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 233</span> {</div>
|
||||
<div class="line"><span class="lineno"> 234</span> <a class="code hl_struct" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a> pat;</div>
|
||||
<div class="line"><span class="lineno"> 235</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8">strings::boyer_moore::init_pattern</a>(<span class="stringliteral">"pat"</span>, pat);</div>
|
||||
<div class="line"><span class="lineno"> 236</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> indexes = <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738">strings::boyer_moore::search</a>(text, pat);</div>
|
||||
<div class="line"><span class="lineno"> 237</span> </div>
|
||||
<div class="line"><span class="lineno"> 238</span> assert(indexes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>() == 6);</div>
|
||||
<div class="line"><span class="lineno"> 239</span> </div>
|
||||
<div class="line"><span class="lineno"> 240</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& currentIndex : indexes) {</div>
|
||||
<div class="line"><span class="lineno"> 241</span> assert(strings::boyer_moore::is_prefix(text + currentIndex, <span class="stringliteral">"pat"</span>, 3));</div>
|
||||
<div class="line"><span class="lineno"> 242</span> }</div>
|
||||
<div class="line"><span class="lineno"> 243</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_ac8fac0dd4b19973da103a434143a16d2_cgraph.svg" width="243" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a15703b553faed0d28202c10808cf9738" name="a15703b553faed0d28202c10808cf9738"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a15703b553faed0d28202c10808cf9738">◆ </a></span>search()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > strings::boyer_moore::search </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> & </td>
|
||||
<td class="paramname"><em>str</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a> & </td>
|
||||
<td class="paramname"><em>arg</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A function that implements Boyer-Moore's algorithm. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">str</td><td>Text we are seatching in. </td></tr>
|
||||
<tr><td class="paramname">arg</td><td>pattern structure containing the preprocessed pattern </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>Vector of indexes of the occurrences of pattern in text </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 163</span> {</div>
|
||||
<div class="line"><span class="lineno"> 164</span> <span class="keywordtype">size_t</span> index_position = arg.pat.size() - 1;</div>
|
||||
<div class="line"><span class="lineno"> 165</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<size_t></a> index_storage;</div>
|
||||
<div class="line"><span class="lineno"> 166</span> </div>
|
||||
<div class="line"><span class="lineno"> 167</span> <span class="keywordflow">while</span> (index_position < str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">length</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 168</span> <span class="keywordtype">size_t</span> index_string = index_position;</div>
|
||||
<div class="line"><span class="lineno"> 169</span> <span class="keywordtype">int</span> index_pattern = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(arg.pat.size()) - 1;</div>
|
||||
<div class="line"><span class="lineno"> 170</span> </div>
|
||||
<div class="line"><span class="lineno"> 171</span> <span class="keywordflow">while</span> (index_pattern >= 0 &&</div>
|
||||
<div class="line"><span class="lineno"> 172</span> str[index_string] == arg.pat[index_pattern]) {</div>
|
||||
<div class="line"><span class="lineno"> 173</span> --index_pattern;</div>
|
||||
<div class="line"><span class="lineno"> 174</span> --index_string;</div>
|
||||
<div class="line"><span class="lineno"> 175</span> }</div>
|
||||
<div class="line"><span class="lineno"> 176</span> </div>
|
||||
<div class="line"><span class="lineno"> 177</span> <span class="keywordflow">if</span> (index_pattern < 0) {</div>
|
||||
<div class="line"><span class="lineno"> 178</span> index_storage.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(index_position - arg.pat.length() + 1);</div>
|
||||
<div class="line"><span class="lineno"> 179</span> index_position += arg.good_suffix[0];</div>
|
||||
<div class="line"><span class="lineno"> 180</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 181</span> index_position += <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(arg.bad_char[str[index_string]],</div>
|
||||
<div class="line"><span class="lineno"> 182</span> arg.good_suffix[index_pattern + 1]);</div>
|
||||
<div class="line"><span class="lineno"> 183</span> }</div>
|
||||
<div class="line"><span class="lineno"> 184</span> }</div>
|
||||
<div class="line"><span class="lineno"> 185</span> </div>
|
||||
<div class="line"><span class="lineno"> 186</span> <span class="keywordflow">return</span> index_storage;</div>
|
||||
<div class="line"><span class="lineno"> 187</span>}</div>
|
||||
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
|
||||
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_a15703b553faed0d28202c10808cf9738_cgraph.svg" width="356" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">◆ </a></span>tests()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static void tests </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 248</span> {</div>
|
||||
<div class="line"><span class="lineno"> 249</span> <span class="keyword">const</span> <span class="keywordtype">char</span>* text =</div>
|
||||
<div class="line"><span class="lineno"> 250</span> <span class="stringliteral">"When pat Mr. and Mrs. pat Dursley woke up on the dull, gray \</span></div>
|
||||
<div class="line"><span class="lineno"> 251</span><span class="stringliteral"> Tuesday our story starts, \</span></div>
|
||||
<div class="line"><span class="lineno"> 252</span><span class="stringliteral"> there was nothing about pat the cloudy sky outside to pat suggest that\</span></div>
|
||||
<div class="line"><span class="lineno"> 253</span><span class="stringliteral"> strange and \</span></div>
|
||||
<div class="line"><span class="lineno"> 254</span><span class="stringliteral"> mysterious things would pat soon be happening all pat over the \</span></div>
|
||||
<div class="line"><span class="lineno"> 255</span><span class="stringliteral"> country."</span>;</div>
|
||||
<div class="line"><span class="lineno"> 256</span> </div>
|
||||
<div class="line"><span class="lineno"> 257</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a>(text);</div>
|
||||
<div class="line"><span class="lineno"> 258</span> <a class="code hl_function" href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">pat_test</a>(text);</div>
|
||||
<div class="line"><span class="lineno"> 259</span> </div>
|
||||
<div class="line"><span class="lineno"> 260</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All tests have successfully passed!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 261</span>}</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aboyer__moore_8cpp_html_ac8fac0dd4b19973da103a434143a16d2"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">pat_test</a></div><div class="ttdeci">void pat_test(const char *text)</div><div class="ttdoc">A test case in which we search for every appearance of the word 'pat'.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:233</div></div>
|
||||
<div class="ttc" id="aboyer__moore_8cpp_html_acb8f69e7901ee7459d98bd4b9dda79d9"><div class="ttname"><a href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">and_test</a></div><div class="ttdeci">void and_test(const char *text)</div><div class="ttdoc">A test case in which we search for every appearance of the word 'and'.</div><div class="ttdef"><b>Definition</b> boyer_moore.cpp:218</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/db2/boyer__moore_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="344" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_73a3cc5065b223eb41b02873c0e19f0e.html">strings</a></li><li class="navelem"><a class="el" href="../../d3/db2/boyer__moore_8cpp.html">boyer_moore.cpp</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
14
d3/db2/boyer__moore_8cpp.js
vendored
Normal file
14
d3/db2/boyer__moore_8cpp.js
vendored
Normal file
@@ -0,0 +1,14 @@
|
||||
var boyer__moore_8cpp =
|
||||
[
|
||||
[ "strings::boyer_moore::pattern", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern" ],
|
||||
[ "APLHABET_SIZE", "d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd", null ],
|
||||
[ "and_test", "d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9", null ],
|
||||
[ "init_bad_char", "d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00", null ],
|
||||
[ "init_good_suffix", "d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1", null ],
|
||||
[ "init_pattern", "d3/db2/boyer__moore_8cpp.html#a0b165af1dc341289fd705be4c67728f8", null ],
|
||||
[ "is_prefix", "d3/db2/boyer__moore_8cpp.html#a056122c8fe8fb0f5fca6428d3f7b5c3a", null ],
|
||||
[ "main", "d3/db2/boyer__moore_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "pat_test", "d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2", null ],
|
||||
[ "search", "d3/db2/boyer__moore_8cpp.html#a15703b553faed0d28202c10808cf9738", null ],
|
||||
[ "tests", "d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
|
||||
];
|
||||
@@ -0,0 +1,4 @@
|
||||
<map id="strings::boyer_moore::is_prefix" name="strings::boyer_moore::is_prefix">
|
||||
<area shape="rect" id="Node000001" title="Check if pat is prefix of str." alt="" coords="5,29,149,70"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="49,29,48,20,52,11,62,5,77,3,93,5,103,12,100,16,91,10,77,8,64,10,56,14,53,20,54,28"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
2150952876937ec74c8f1cdcf011c50c
|
||||
@@ -0,0 +1,56 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::is_prefix Pages: 1 -->
|
||||
<svg width="116pt" height="57pt"
|
||||
viewBox="0.00 0.00 115.50 56.50" 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" onload="init(evt)">
|
||||
<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 52.5)">
|
||||
<title>strings::boyer_moore::is_prefix</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Check if pat is prefix of str.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-30.5 0,-30.5 0,0 107.5,0 107.5,-30.5"/>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M34.7,-30.99C30.81,-40.06 37.16,-48.5 53.75,-48.5 63.08,-48.5 69.17,-45.83 72.02,-41.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-42.21 72.8,-31.99 68.6,-41.71 75.58,-42.21"/>
|
||||
</a>
|
||||
</g>
|
||||
</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.2 KiB |
@@ -0,0 +1,31 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::is_prefix Pages: 1 -->
|
||||
<svg width="116pt" height="57pt"
|
||||
viewBox="0.00 0.00 115.50 56.50" 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 52.5)">
|
||||
<title>strings::boyer_moore::is_prefix</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Check if pat is prefix of str.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-30.5 0,-30.5 0,0 107.5,0 107.5,-30.5"/>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::is_prefix</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M34.7,-30.99C30.81,-40.06 37.16,-48.5 53.75,-48.5 63.08,-48.5 69.17,-45.83 72.02,-41.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.58,-42.21 72.8,-31.99 68.6,-41.71 75.58,-42.21"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.4 KiB |
@@ -0,0 +1,17 @@
|
||||
<map id="strings::boyer_moore::init_pattern" name="strings::boyer_moore::init_pattern">
|
||||
<area shape="rect" id="Node000001" title="A function that initializes pattern." alt="" coords="5,75,149,115"/>
|
||||
<area shape="poly" id="edge10_Node000001_Node000001" title=" " alt="" coords="40,75,39,65,45,56,58,50,77,48,98,51,111,57,108,62,97,56,77,53,59,55,48,60,44,66,46,73"/>
|
||||
<area shape="rect" id="Node000002" href="$d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00" title="A function that preprocess the bad char table." alt="" coords="197,119,340,159"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="150,109,183,117,182,122,149,114"/>
|
||||
<area shape="rect" id="Node000005" href="$d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1" title="A function that preprocess the good suffix thable." alt="" coords="197,29,340,70"/>
|
||||
<area shape="poly" id="edge5_Node000001_Node000005" title=" " alt="" coords="148,75,182,67,183,73,150,81"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="233,119,232,109,237,100,250,94,268,92,289,95,301,101,298,106,287,100,268,97,251,99,241,104,237,110,239,118"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="390,37,512,63"/>
|
||||
<area shape="poly" id="edge3_Node000002_Node000003" title=" " alt="" coords="311,116,409,67,411,72,313,120"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="388,106,514,132"/>
|
||||
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="340,129,373,125,373,130,341,134"/>
|
||||
<area shape="poly" id="edge7_Node000005_Node000003" title=" " alt="" coords="340,56,375,56,375,61,340,61"/>
|
||||
<area shape="poly" id="edge9_Node000005_Node000003" title=" " alt="" coords="340,38,375,38,375,43,340,44"/>
|
||||
<area shape="poly" id="edge8_Node000005_Node000004" title=" " alt="" coords="325,68,402,98,400,103,323,73"/>
|
||||
<area shape="poly" id="edge6_Node000005_Node000005" title=" " alt="" coords="233,29,232,19,237,10,250,5,268,3,289,5,301,12,298,16,287,10,268,8,251,10,241,14,237,20,239,28"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
304c1d6bc9e25fd666861b19017f9ea7
|
||||
@@ -0,0 +1,175 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::init_pattern Pages: 1 -->
|
||||
<svg width="390pt" height="124pt"
|
||||
viewBox="0.00 0.00 389.75 123.50" 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" onload="init(evt)">
|
||||
<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 119.5)">
|
||||
<title>strings::boyer_moore::init_pattern</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A function that initializes pattern.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-63.5 0,-63.5 0,-33 107.5,-33 107.5,-63.5"/>
|
||||
<text text-anchor="start" x="8" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-38.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge10_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge10_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M28.32,-63.99C23.13,-73.06 31.61,-81.5 53.75,-81.5 66.2,-81.5 74.34,-78.83 78.14,-74.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.72,-75.27 79.18,-64.99 74.75,-74.61 81.72,-75.27"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
|
||||
<polygon fill="white" stroke="#666666" points="251,-30.5 143.5,-30.5 143.5,0 251,0 251,-30.5"/>
|
||||
<text text-anchor="start" x="151.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M107.84,-35.87C116,-33.96 124.5,-31.98 132.86,-30.03"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.39,-33.27 142.33,-27.59 131.8,-26.45 133.39,-33.27"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
|
||||
<polygon fill="white" stroke="#666666" points="251,-97.5 143.5,-97.5 143.5,-67 251,-67 251,-97.5"/>
|
||||
<text text-anchor="start" x="151.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="197.25" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge5_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.84,-61.01C116,-62.97 124.5,-65.01 132.86,-67.02"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="131.79,-70.6 142.33,-69.53 133.43,-63.79 131.79,-70.6"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M172.95,-30.99C167.99,-40.06 176.09,-48.5 197.25,-48.5 209.15,-48.5 216.92,-45.83 220.56,-41.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="224.13,-42.26 221.55,-31.99 217.16,-41.63 224.13,-42.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="380.25,-91.88 288.5,-91.88 288.5,-72.62 380.25,-72.62 380.25,-91.88"/>
|
||||
<text text-anchor="middle" x="334.38" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge3_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M229.93,-30.96C252.15,-41.98 281.67,-56.61 303.49,-67.43"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="301.7,-70.95 312.21,-72.25 304.81,-64.67 301.7,-70.95"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="381.75,-39.88 287,-39.88 287,-20.62 381.75,-20.62 381.75,-39.88"/>
|
||||
<text text-anchor="middle" x="334.38" y="-26.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge4_Node000002_Node000004" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M251.27,-21.14C259.3,-22.03 267.62,-22.95 275.74,-23.85"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="275.33,-27.44 285.65,-25.06 276.1,-20.48 275.33,-27.44"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node3 -->
|
||||
<g id="edge7_Node000005_Node000003" class="edge">
|
||||
<title>Node5->Node3</title>
|
||||
<g id="a_edge7_Node000005_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M251.27,-75.64C259.9,-75.47 268.86,-75.45 277.55,-75.59"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="277.3,-79.11 287.38,-75.85 277.46,-72.11 277.3,-79.11"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node3 -->
|
||||
<g id="edge9_Node000005_Node000003" class="edge">
|
||||
<title>Node5->Node3</title>
|
||||
<g id="a_edge9_Node000005_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M251.27,-88.86C259.9,-89.03 268.86,-89.05 277.55,-88.91"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="277.46,-92.39 287.38,-88.65 277.3,-85.39 277.46,-92.39"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge8_Node000005_Node000004" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<g id="a_edge8_Node000005_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M239.16,-66.51C257.6,-59.41 279.2,-51.1 297.06,-44.23"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="298.01,-47.22 306.09,-40.37 295.5,-40.69 298.01,-47.22"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node5 -->
|
||||
<g id="edge6_Node000005_Node000005" class="edge">
|
||||
<title>Node5->Node5</title>
|
||||
<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M172.95,-97.99C167.99,-107.06 176.09,-115.5 197.25,-115.5 209.15,-115.5 216.92,-112.83 220.56,-108.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="224.13,-109.26 221.55,-98.99 217.16,-108.63 224.13,-109.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</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: 7.9 KiB |
@@ -0,0 +1,150 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::init_pattern Pages: 1 -->
|
||||
<svg width="390pt" height="124pt"
|
||||
viewBox="0.00 0.00 389.75 123.50" 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 119.5)">
|
||||
<title>strings::boyer_moore::init_pattern</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A function that initializes pattern.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-63.5 0,-63.5 0,-33 107.5,-33 107.5,-63.5"/>
|
||||
<text text-anchor="start" x="8" y="-50" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-38.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_pattern</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge10_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge10_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M28.32,-63.99C23.13,-73.06 31.61,-81.5 53.75,-81.5 66.2,-81.5 74.34,-78.83 78.14,-74.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.72,-75.27 79.18,-64.99 74.75,-74.61 81.72,-75.27"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#a2f6688c9bb3e692297a3aa09cebc1c00" target="_top" xlink:title="A function that preprocess the bad char table.">
|
||||
<polygon fill="white" stroke="#666666" points="251,-30.5 143.5,-30.5 143.5,0 251,0 251,-30.5"/>
|
||||
<text text-anchor="start" x="151.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M107.84,-35.87C116,-33.96 124.5,-31.98 132.86,-30.03"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.39,-33.27 142.33,-27.59 131.8,-26.45 133.39,-33.27"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#aa709cf7fca02b7d3e1888423d5f739a1" target="_top" xlink:title="A function that preprocess the good suffix thable.">
|
||||
<polygon fill="white" stroke="#666666" points="251,-97.5 143.5,-97.5 143.5,-67 251,-67 251,-97.5"/>
|
||||
<text text-anchor="start" x="151.5" y="-84" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="197.25" y="-72.75" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge5_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge5_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.84,-61.01C116,-62.97 124.5,-65.01 132.86,-67.02"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="131.79,-70.6 142.33,-69.53 133.43,-63.79 131.79,-70.6"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M172.95,-30.99C167.99,-40.06 176.09,-48.5 197.25,-48.5 209.15,-48.5 216.92,-45.83 220.56,-41.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="224.13,-42.26 221.55,-31.99 217.16,-41.63 224.13,-42.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="380.25,-91.88 288.5,-91.88 288.5,-72.62 380.25,-72.62 380.25,-91.88"/>
|
||||
<text text-anchor="middle" x="334.38" y="-78.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge3_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge3_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M229.93,-30.96C252.15,-41.98 281.67,-56.61 303.49,-67.43"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="301.7,-70.95 312.21,-72.25 304.81,-64.67 301.7,-70.95"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="381.75,-39.88 287,-39.88 287,-20.62 381.75,-20.62 381.75,-39.88"/>
|
||||
<text text-anchor="middle" x="334.38" y="-26.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge4_Node000002_Node000004" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M251.27,-21.14C259.3,-22.03 267.62,-22.95 275.74,-23.85"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="275.33,-27.44 285.65,-25.06 276.1,-20.48 275.33,-27.44"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node3 -->
|
||||
<g id="edge7_Node000005_Node000003" class="edge">
|
||||
<title>Node5->Node3</title>
|
||||
<g id="a_edge7_Node000005_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M251.27,-75.64C259.9,-75.47 268.86,-75.45 277.55,-75.59"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="277.3,-79.11 287.38,-75.85 277.46,-72.11 277.3,-79.11"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node3 -->
|
||||
<g id="edge9_Node000005_Node000003" class="edge">
|
||||
<title>Node5->Node3</title>
|
||||
<g id="a_edge9_Node000005_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M251.27,-88.86C259.9,-89.03 268.86,-89.05 277.55,-88.91"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="277.46,-92.39 287.38,-88.65 277.3,-85.39 277.46,-92.39"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge8_Node000005_Node000004" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<g id="a_edge8_Node000005_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M239.16,-66.51C257.6,-59.41 279.2,-51.1 297.06,-44.23"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="298.01,-47.22 306.09,-40.37 295.5,-40.69 298.01,-47.22"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node5 -->
|
||||
<g id="edge6_Node000005_Node000005" class="edge">
|
||||
<title>Node5->Node5</title>
|
||||
<g id="a_edge6_Node000005_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M172.95,-97.99C167.99,-107.06 176.09,-115.5 197.25,-115.5 209.15,-115.5 216.92,-112.83 220.56,-108.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="224.13,-109.26 221.55,-98.99 217.16,-108.63 224.13,-109.26"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 7.1 KiB |
@@ -0,0 +1,10 @@
|
||||
<map id="strings::boyer_moore::search" name="strings::boyer_moore::search">
|
||||
<area shape="rect" id="Node000001" title="A function that implements Boyer-Moore's algorithm." alt="" coords="5,23,149,64"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="213,5,335,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="149,40,213,32,214,37,149,46"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000002" title=" " alt="" coords="149,23,198,16,198,22,149,28"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="238,55,310,80"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="149,50,223,59,223,64,149,55"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="197,104,351,130"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="127,62,198,90,215,96,213,101,196,95,125,67"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
5b5eb95061452a40148727ff87187858
|
||||
@@ -0,0 +1,110 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::search Pages: 1 -->
|
||||
<svg width="267pt" height="101pt"
|
||||
viewBox="0.00 0.00 267.25 101.25" 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" onload="init(evt)">
|
||||
<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 97.25)">
|
||||
<title>strings::boyer_moore::search</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A function that implements Boyer-Moore's algorithm.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-79.88 0,-79.88 0,-49.38 107.5,-49.38 107.5,-79.88"/>
|
||||
<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="247.25,-93.25 155.5,-93.25 155.5,-74 247.25,-74 247.25,-93.25"/>
|
||||
<text text-anchor="middle" x="201.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M107.74,-65.02C123.7,-66.72 141.05,-69.08 156.36,-71.63"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.66,-75.23 166.11,-73.51 156.87,-68.34 155.66,-75.23"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge4_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge4_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.74,-78.06C119.69,-79.9 132.42,-81.58 144.49,-82.92"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.04,-86.49 154.35,-84.04 144.76,-79.53 144.04,-86.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="228.5,-56.25 174.25,-56.25 174.25,-37 228.5,-37 228.5,-56.25"/>
|
||||
<text text-anchor="middle" x="201.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<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="M107.74,-58.08C126.15,-55.8 146.39,-53.3 163.25,-51.21"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.28,-54.61 172.78,-49.91 162.43,-47.67 163.28,-54.61"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="259.25,-19.25 143.5,-19.25 143.5,0 259.25,0 259.25,-19.25"/>
|
||||
<text text-anchor="middle" x="201.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<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="M90.31,-48.96C106.42,-42.08 125.78,-34.11 143.5,-27.62 147.71,-26.08 152.13,-24.55 156.56,-23.06"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="157.41,-26.14 165.83,-19.7 155.23,-19.49 157.41,-26.14"/>
|
||||
</a>
|
||||
</g>
|
||||
</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: 4.7 KiB |
@@ -0,0 +1,85 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::search Pages: 1 -->
|
||||
<svg width="267pt" height="101pt"
|
||||
viewBox="0.00 0.00 267.25 101.25" 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 97.25)">
|
||||
<title>strings::boyer_moore::search</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A function that implements Boyer-Moore's algorithm.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-79.88 0,-79.88 0,-49.38 107.5,-49.38 107.5,-79.88"/>
|
||||
<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::search</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="247.25,-93.25 155.5,-93.25 155.5,-74 247.25,-74 247.25,-93.25"/>
|
||||
<text text-anchor="middle" x="201.38" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M107.74,-65.02C123.7,-66.72 141.05,-69.08 156.36,-71.63"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="155.66,-75.23 166.11,-73.51 156.87,-68.34 155.66,-75.23"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge4_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge4_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.74,-78.06C119.69,-79.9 132.42,-81.58 144.49,-82.92"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.04,-86.49 154.35,-84.04 144.76,-79.53 144.04,-86.49"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="228.5,-56.25 174.25,-56.25 174.25,-37 228.5,-37 228.5,-56.25"/>
|
||||
<text text-anchor="middle" x="201.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<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="M107.74,-58.08C126.15,-55.8 146.39,-53.3 163.25,-51.21"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.28,-54.61 172.78,-49.91 162.43,-47.67 163.28,-54.61"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="259.25,-19.25 143.5,-19.25 143.5,0 259.25,0 259.25,-19.25"/>
|
||||
<text text-anchor="middle" x="201.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<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="M90.31,-48.96C106.42,-42.08 125.78,-34.11 143.5,-27.62 147.71,-26.08 152.13,-24.55 156.56,-23.06"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="157.41,-26.14 165.83,-19.7 155.23,-19.49 157.41,-26.14"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.0 KiB |
@@ -0,0 +1,8 @@
|
||||
<map id="strings::boyer_moore::init_bad_char" name="strings::boyer_moore::init_bad_char">
|
||||
<area shape="rect" id="Node000001" title="A function that preprocess the bad char table." alt="" coords="5,29,149,70"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="42,29,40,19,46,10,58,5,77,3,98,5,109,12,107,16,96,10,77,8,60,10,49,14,46,20,47,28"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="199,12,321,37"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="149,37,184,32,184,37,149,42"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="197,61,323,87"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="149,56,182,61,182,66,149,62"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
2974149438887cb82d1c50b12d09ffa5
|
||||
@@ -0,0 +1,92 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::init_bad_char Pages: 1 -->
|
||||
<svg width="246pt" height="69pt"
|
||||
viewBox="0.00 0.00 246.25 68.88" 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" onload="init(evt)">
|
||||
<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 64.88)">
|
||||
<title>strings::boyer_moore::init_bad_char</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A function that preprocess the bad char table.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-42.88 0,-42.88 0,-12.37 107.5,-12.37 107.5,-42.88"/>
|
||||
<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M29.45,-43.36C24.49,-52.43 32.59,-60.88 53.75,-60.88 65.65,-60.88 73.42,-58.2 77.06,-54.25"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="80.63,-54.64 78.05,-44.36 73.66,-54 80.63,-54.64"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="236.75,-56.25 145,-56.25 145,-37 236.75,-37 236.75,-56.25"/>
|
||||
<text text-anchor="middle" x="190.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge2_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-35.08C116.4,-36.29 125.36,-37.55 134.05,-38.78"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.49,-42.37 143.88,-40.3 134.46,-35.44 133.49,-42.37"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="238.25,-19.25 143.5,-19.25 143.5,0 238.25,0 238.25,-19.25"/>
|
||||
<text text-anchor="middle" x="190.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-20.56C115.89,-19.48 124.31,-18.36 132.52,-17.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="132.7,-20.64 142.15,-15.85 131.78,-13.7 132.7,-20.64"/>
|
||||
</a>
|
||||
</g>
|
||||
</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: 3.9 KiB |
@@ -0,0 +1,67 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::init_bad_char Pages: 1 -->
|
||||
<svg width="246pt" height="69pt"
|
||||
viewBox="0.00 0.00 246.25 68.88" 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 64.88)">
|
||||
<title>strings::boyer_moore::init_bad_char</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A function that preprocess the bad char table.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-42.88 0,-42.88 0,-12.37 107.5,-12.37 107.5,-42.88"/>
|
||||
<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_bad_char</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M29.45,-43.36C24.49,-52.43 32.59,-60.88 53.75,-60.88 65.65,-60.88 73.42,-58.2 77.06,-54.25"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="80.63,-54.64 78.05,-44.36 73.66,-54 80.63,-54.64"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="236.75,-56.25 145,-56.25 145,-37 236.75,-37 236.75,-56.25"/>
|
||||
<text text-anchor="middle" x="190.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge2_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-35.08C116.4,-36.29 125.36,-37.55 134.05,-38.78"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.49,-42.37 143.88,-40.3 134.46,-35.44 133.49,-42.37"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="238.25,-19.25 143.5,-19.25 143.5,0 238.25,0 238.25,-19.25"/>
|
||||
<text text-anchor="middle" x="190.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-20.56C115.89,-19.48 124.31,-18.36 132.52,-17.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="132.7,-20.64 142.15,-15.85 131.78,-13.7 132.7,-20.64"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.1 KiB |
@@ -0,0 +1,10 @@
|
||||
<map id="tests" name="tests">
|
||||
<area shape="rect" id="Node000001" title="Self-test implementations." alt="" coords="5,31,56,56"/>
|
||||
<area shape="rect" id="Node000002" href="$d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" title="A test case in which we search for every appearance of the word 'and'." alt="" coords="104,5,175,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,35,88,27,90,32,57,40"/>
|
||||
<area shape="rect" id="Node000004" href="$d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" title="A test case in which we search for every appearance of the word 'pat'." alt="" coords="105,55,174,80"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="57,46,91,54,90,59,55,52"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="223,31,338,56"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="176,22,209,28,208,33,175,27"/>
|
||||
<area shape="poly" id="edge4_Node000004_Node000003" title=" " alt="" coords="173,59,208,53,209,58,174,64"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
1d1e002573401f45a6341389936a84c1
|
||||
@@ -0,0 +1,109 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: tests Pages: 1 -->
|
||||
<svg width="258pt" height="64pt"
|
||||
viewBox="0.00 0.00 257.75 64.25" 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" onload="init(evt)">
|
||||
<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 60.25)">
|
||||
<title>tests</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Self-test implementations.">
|
||||
<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
|
||||
<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" target="_top" xlink:title="A test case in which we search for every appearance of the word 'and'.">
|
||||
<polygon fill="white" stroke="#666666" points="127.25,-56.25 73.75,-56.25 73.75,-37 127.25,-37 127.25,-56.25"/>
|
||||
<text text-anchor="middle" x="100.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M37.94,-31.94C45.3,-33.69 54.08,-35.79 62.68,-37.84"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.81,-41.47 72.35,-40.38 63.43,-34.66 61.81,-41.47"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" target="_top" xlink:title="A test case in which we search for every appearance of the word 'pat'.">
|
||||
<polygon fill="white" stroke="#666666" points="126.12,-19.25 74.88,-19.25 74.88,0 126.12,0 126.12,-19.25"/>
|
||||
<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<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="M37.94,-23.54C45.64,-21.8 54.9,-19.71 63.88,-17.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.58,-20.88 73.56,-15.26 63.04,-14.05 64.58,-20.88"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="249.75,-37.25 163.25,-37.25 163.25,-18 249.75,-18 249.75,-37.25"/>
|
||||
<text text-anchor="middle" x="206.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M127.74,-41.83C135.27,-40.45 143.77,-38.9 152.31,-37.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.87,-40.62 162.08,-35.38 151.61,-33.73 152.87,-40.62"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge4_Node000004_Node000003" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M126.41,-13.94C134.27,-15.3 143.28,-16.86 152.33,-18.42"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.47,-22 161.92,-20.25 152.66,-15.1 151.47,-22"/>
|
||||
</a>
|
||||
</g>
|
||||
</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: 4.6 KiB |
@@ -0,0 +1,84 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: tests Pages: 1 -->
|
||||
<svg width="258pt" height="64pt"
|
||||
viewBox="0.00 0.00 257.75 64.25" 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 60.25)">
|
||||
<title>tests</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Self-test implementations.">
|
||||
<polygon fill="#999999" stroke="#666666" points="37.75,-37.25 0,-37.25 0,-18 37.75,-18 37.75,-37.25"/>
|
||||
<text text-anchor="middle" x="18.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" target="_top" xlink:title="A test case in which we search for every appearance of the word 'and'.">
|
||||
<polygon fill="white" stroke="#666666" points="127.25,-56.25 73.75,-56.25 73.75,-37 127.25,-37 127.25,-56.25"/>
|
||||
<text text-anchor="middle" x="100.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M37.94,-31.94C45.3,-33.69 54.08,-35.79 62.68,-37.84"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.81,-41.47 72.35,-40.38 63.43,-34.66 61.81,-41.47"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" target="_top" xlink:title="A test case in which we search for every appearance of the word 'pat'.">
|
||||
<polygon fill="white" stroke="#666666" points="126.12,-19.25 74.88,-19.25 74.88,0 126.12,0 126.12,-19.25"/>
|
||||
<text text-anchor="middle" x="100.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<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="M37.94,-23.54C45.64,-21.8 54.9,-19.71 63.88,-17.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.58,-20.88 73.56,-15.26 63.04,-14.05 64.58,-20.88"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="249.75,-37.25 163.25,-37.25 163.25,-18 249.75,-18 249.75,-37.25"/>
|
||||
<text text-anchor="middle" x="206.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M127.74,-41.83C135.27,-40.45 143.77,-38.9 152.31,-37.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="152.87,-40.62 162.08,-35.38 151.61,-33.73 152.87,-40.62"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge4_Node000004_Node000003" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<g id="a_edge4_Node000004_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M126.41,-13.94C134.27,-15.3 143.28,-16.86 152.33,-18.42"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="151.47,-22 161.92,-20.25 152.66,-15.1 151.47,-22"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.8 KiB |
@@ -0,0 +1,9 @@
|
||||
<map id="strings::boyer_moore::init_good_suffix" name="strings::boyer_moore::init_good_suffix">
|
||||
<area shape="rect" id="Node000001" title="A function that preprocess the good suffix thable." alt="" coords="5,29,149,70"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="42,29,40,19,46,10,58,5,77,3,98,5,109,12,107,16,96,10,77,8,60,10,49,14,46,20,47,28"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="199,37,321,63"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000002" title=" " alt="" coords="149,56,184,56,184,61,149,61"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000002" title=" " alt="" coords="149,38,184,38,184,43,149,44"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/resize.html#" title=" " alt="" coords="197,86,323,112"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="150,66,196,79,195,84,148,72"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
3dffba6d7561d4af1425319ca8997972
|
||||
@@ -0,0 +1,101 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::init_good_suffix Pages: 1 -->
|
||||
<svg width="246pt" height="88pt"
|
||||
viewBox="0.00 0.00 246.25 87.88" 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" onload="init(evt)">
|
||||
<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 83.88)">
|
||||
<title>strings::boyer_moore::init_good_suffix</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A function that preprocess the good suffix thable.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-61.88 0,-61.88 0,-31.38 107.5,-31.38 107.5,-61.88"/>
|
||||
<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M29.45,-62.36C24.49,-71.43 32.59,-79.88 53.75,-79.88 65.65,-79.88 73.42,-77.2 77.06,-73.25"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="80.63,-73.64 78.05,-63.36 73.66,-73 80.63,-73.64"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="236.75,-56.25 145,-56.25 145,-37 236.75,-37 236.75,-56.25"/>
|
||||
<text text-anchor="middle" x="190.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge2_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-40.02C116.4,-39.85 125.36,-39.83 134.05,-39.97"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.8,-43.48 143.88,-40.22 133.96,-36.49 133.8,-43.48"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge4_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge4_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-53.23C116.4,-53.4 125.36,-53.42 134.05,-53.28"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.96,-56.76 143.88,-53.03 133.8,-49.77 133.96,-56.76"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="238.25,-19.25 143.5,-19.25 143.5,0 238.25,0 238.25,-19.25"/>
|
||||
<text text-anchor="middle" x="190.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-32.11C119.31,-28.95 131.45,-25.62 142.74,-22.53"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="143.55,-25.67 152.27,-19.65 141.7,-18.91 143.55,-25.67"/>
|
||||
</a>
|
||||
</g>
|
||||
</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: 4.3 KiB |
@@ -0,0 +1,76 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::init_good_suffix Pages: 1 -->
|
||||
<svg width="246pt" height="88pt"
|
||||
viewBox="0.00 0.00 246.25 87.88" 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 83.88)">
|
||||
<title>strings::boyer_moore::init_good_suffix</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A function that preprocess the good suffix thable.">
|
||||
<polygon fill="#999999" stroke="#666666" points="107.5,-61.88 0,-61.88 0,-31.38 107.5,-31.38 107.5,-61.88"/>
|
||||
<text text-anchor="start" x="8" y="-48.38" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="53.75" y="-37.12" font-family="Helvetica,sans-Serif" font-size="10.00">::init_good_suffix</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M29.45,-62.36C24.49,-71.43 32.59,-79.88 53.75,-79.88 65.65,-79.88 73.42,-77.2 77.06,-73.25"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="80.63,-73.64 78.05,-63.36 73.66,-73 80.63,-73.64"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="236.75,-56.25 145,-56.25 145,-37 236.75,-37 236.75,-56.25"/>
|
||||
<text text-anchor="middle" x="190.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::length</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge2_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge2_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-40.02C116.4,-39.85 125.36,-39.83 134.05,-39.97"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.8,-43.48 143.88,-40.22 133.96,-36.49 133.8,-43.48"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge4_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge4_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-53.23C116.4,-53.4 125.36,-53.42 134.05,-53.28"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="133.96,-56.76 143.88,-53.03 133.8,-49.77 133.96,-56.76"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/resize.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="238.25,-19.25 143.5,-19.25 143.5,0 238.25,0 238.25,-19.25"/>
|
||||
<text text-anchor="middle" x="190.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::resize</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M107.77,-32.11C119.31,-28.95 131.45,-25.62 142.74,-22.53"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="143.55,-25.67 152.27,-19.65 141.7,-18.91 143.55,-25.67"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 3.5 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="pat_test" name="pat_test">
|
||||
<area shape="rect" id="Node000001" title="A test case in which we search for every appearance of the word 'pat'." alt="" coords="5,5,74,31"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="122,5,237,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="74,16,107,16,107,21,74,21"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
dda68a9a39c5b58786d161f8af005f2e
|
||||
@@ -0,0 +1,64 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: pat_test Pages: 1 -->
|
||||
<svg width="182pt" height="27pt"
|
||||
viewBox="0.00 0.00 181.75 27.25" 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" onload="init(evt)">
|
||||
<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 23.25)">
|
||||
<title>pat_test</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A test case in which we search for every appearance of the word 'pat'.">
|
||||
<polygon fill="#999999" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
|
||||
<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="173.75,-19.25 87.25,-19.25 87.25,0 173.75,0 173.75,-19.25"/>
|
||||
<text text-anchor="middle" x="130.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M51.53,-9.62C58.97,-9.62 67.43,-9.62 75.97,-9.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.76,-13.13 85.76,-9.62 75.76,-6.13 75.76,-13.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</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.5 KiB |
@@ -0,0 +1,39 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: pat_test Pages: 1 -->
|
||||
<svg width="182pt" height="27pt"
|
||||
viewBox="0.00 0.00 181.75 27.25" 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>pat_test</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A test case in which we search for every appearance of the word 'pat'.">
|
||||
<polygon fill="#999999" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
|
||||
<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="173.75,-19.25 87.25,-19.25 87.25,0 173.75,0 173.75,-19.25"/>
|
||||
<text text-anchor="middle" x="130.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M51.53,-9.62C58.97,-9.62 67.43,-9.62 75.97,-9.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.76,-13.13 85.76,-9.62 75.76,-6.13 75.76,-13.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.7 KiB |
@@ -0,0 +1,5 @@
|
||||
<map id="and_test" name="and_test">
|
||||
<area shape="rect" id="Node000001" title="A test case in which we search for every appearance of the word 'and'." alt="" coords="5,5,77,31"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="125,5,240,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="77,16,110,16,110,21,77,21"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
9af08864580148e1f5c31673cb9d7e16
|
||||
@@ -0,0 +1,64 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: and_test Pages: 1 -->
|
||||
<svg width="184pt" height="27pt"
|
||||
viewBox="0.00 0.00 184.00 27.25" 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" onload="init(evt)">
|
||||
<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 23.25)">
|
||||
<title>and_test</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A test case in which we search for every appearance of the word 'and'.">
|
||||
<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
|
||||
<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="176,-19.25 89.5,-19.25 89.5,0 176,0 176,-19.25"/>
|
||||
<text text-anchor="middle" x="132.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M53.99,-9.62C61.52,-9.62 70.02,-9.62 78.56,-9.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.33,-13.13 88.33,-9.62 78.33,-6.13 78.33,-13.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</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.5 KiB |
@@ -0,0 +1,39 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: and_test Pages: 1 -->
|
||||
<svg width="184pt" height="27pt"
|
||||
viewBox="0.00 0.00 184.00 27.25" 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>and_test</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A test case in which we search for every appearance of the word 'and'.">
|
||||
<polygon fill="#999999" stroke="#666666" points="53.5,-19.25 0,-19.25 0,0 53.5,0 53.5,-19.25"/>
|
||||
<text text-anchor="middle" x="26.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="176,-19.25 89.5,-19.25 89.5,0 176,0 176,-19.25"/>
|
||||
<text text-anchor="middle" x="132.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M53.99,-9.62C61.52,-9.62 70.02,-9.62 78.56,-9.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="78.33,-13.13 88.33,-9.62 78.33,-6.13 78.33,-13.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.7 KiB |
@@ -0,0 +1,12 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,31,55,56"/>
|
||||
<area shape="rect" id="Node000002" href="$d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Self-test implementations." alt="" coords="103,31,153,56"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,41,88,41,88,46,55,46"/>
|
||||
<area shape="rect" id="Node000003" href="$d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" title="A test case in which we search for every appearance of the word 'and'." alt="" coords="201,5,272,31"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="153,35,186,27,187,32,154,40"/>
|
||||
<area shape="rect" id="Node000005" href="$d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" title="A test case in which we search for every appearance of the word 'pat'." alt="" coords="203,55,271,80"/>
|
||||
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="154,46,188,54,187,59,153,52"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/size.html#" title=" " alt="" coords="320,31,436,56"/>
|
||||
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="273,22,306,28,305,33,273,27"/>
|
||||
<area shape="poly" id="edge5_Node000005_Node000004" title=" " alt="" coords="271,59,305,53,306,58,272,64"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
bc05f58de143f7b367ebe87747376ab5
|
||||
@@ -0,0 +1,127 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="331pt" height="64pt"
|
||||
viewBox="0.00 0.00 330.75 64.25" 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" onload="init(evt)">
|
||||
<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 60.25)">
|
||||
<title>main</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Main function.">
|
||||
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
|
||||
<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self-test implementations.">
|
||||
<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
|
||||
<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M37.14,-27.62C44.64,-27.62 53.57,-27.62 61.98,-27.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-31.13 71.94,-27.62 61.94,-24.13 61.94,-31.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" target="_top" xlink:title="A test case in which we search for every appearance of the word 'and'.">
|
||||
<polygon fill="white" stroke="#666666" points="200.25,-56.25 146.75,-56.25 146.75,-37 200.25,-37 200.25,-56.25"/>
|
||||
<text text-anchor="middle" x="173.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M110.94,-31.94C118.3,-33.69 127.08,-35.79 135.68,-37.84"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.81,-41.47 145.35,-40.38 136.43,-34.66 134.81,-41.47"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" target="_top" xlink:title="A test case in which we search for every appearance of the word 'pat'.">
|
||||
<polygon fill="white" stroke="#666666" points="199.12,-19.25 147.88,-19.25 147.88,0 199.12,0 199.12,-19.25"/>
|
||||
<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4_Node000002_Node000005" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M110.94,-23.54C118.64,-21.8 127.9,-19.71 136.88,-17.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.58,-20.88 146.56,-15.26 136.04,-14.05 137.58,-20.88"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="322.75,-37.25 236.25,-37.25 236.25,-18 322.75,-18 322.75,-37.25"/>
|
||||
<text text-anchor="middle" x="279.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3_Node000003_Node000004" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M200.74,-41.83C208.27,-40.45 216.77,-38.9 225.31,-37.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="225.87,-40.62 235.08,-35.38 224.61,-33.73 225.87,-40.62"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge5_Node000005_Node000004" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M199.41,-13.94C207.27,-15.3 216.28,-16.86 225.33,-18.42"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="224.47,-22 234.92,-20.25 225.66,-15.1 224.47,-22"/>
|
||||
</a>
|
||||
</g>
|
||||
</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: 5.4 KiB |
@@ -0,0 +1,102 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="331pt" height="64pt"
|
||||
viewBox="0.00 0.00 330.75 64.25" 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 60.25)">
|
||||
<title>main</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Main function.">
|
||||
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
|
||||
<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Self-test implementations.">
|
||||
<polygon fill="white" stroke="#666666" points="110.75,-37.25 73,-37.25 73,-18 110.75,-18 110.75,-37.25"/>
|
||||
<text text-anchor="middle" x="91.88" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<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="M37.14,-27.62C44.64,-27.62 53.57,-27.62 61.98,-27.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-31.13 71.94,-27.62 61.94,-24.13 61.94,-31.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9" target="_top" xlink:title="A test case in which we search for every appearance of the word 'and'.">
|
||||
<polygon fill="white" stroke="#666666" points="200.25,-56.25 146.75,-56.25 146.75,-37 200.25,-37 200.25,-56.25"/>
|
||||
<text text-anchor="middle" x="173.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">and_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M110.94,-31.94C118.3,-33.69 127.08,-35.79 135.68,-37.84"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.81,-41.47 145.35,-40.38 136.43,-34.66 134.81,-41.47"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a xlink:href="../../d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2" target="_top" xlink:title="A test case in which we search for every appearance of the word 'pat'.">
|
||||
<polygon fill="white" stroke="#666666" points="199.12,-19.25 147.88,-19.25 147.88,0 199.12,0 199.12,-19.25"/>
|
||||
<text text-anchor="middle" x="173.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">pat_test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4_Node000002_Node000005" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M110.94,-23.54C118.64,-21.8 127.9,-19.71 136.88,-17.68"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="137.58,-20.88 146.56,-15.26 136.04,-14.05 137.58,-20.88"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="322.75,-37.25 236.25,-37.25 236.25,-18 322.75,-18 322.75,-37.25"/>
|
||||
<text text-anchor="middle" x="279.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3_Node000003_Node000004" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M200.74,-41.83C208.27,-40.45 216.77,-38.9 225.31,-37.34"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="225.87,-40.62 235.08,-35.38 224.61,-33.73 225.87,-40.62"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge5_Node000005_Node000004" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<g id="a_edge5_Node000005_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M199.41,-13.94C207.27,-15.3 216.28,-16.86 225.33,-18.42"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="224.47,-22 234.92,-20.25 225.66,-15.1 224.47,-22"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 4.7 KiB |
118
d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html
Normal file
118
d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html
Normal file
@@ -0,0 +1,118 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" 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.9.7"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: Member List</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.7 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<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">strings::boyer_moore::pattern Member List</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">bad_char</a></td><td class="entry"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></td><td class="entry"></td></tr>
|
||||
<tr class="odd"><td class="entry"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a></td><td class="entry"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>pat</b> (defined in <a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a>)</td><td class="entry"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">strings::boyer_moore::pattern</a></td><td class="entry"></td></tr>
|
||||
</table></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -0,0 +1,11 @@
|
||||
<map id="strings::boyer_moore::pattern" name="strings::boyer_moore::pattern">
|
||||
<area shape="rect" id="Node000001" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="63,213,206,253"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="28,109,108,135"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="85,146,125,211,120,214,81,149"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="5,5,131,46"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="71,61,71,109,65,109,65,61"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="132,109,274,135"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="190,149,149,214,145,211,185,146"/>
|
||||
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="162,13,244,39"/>
|
||||
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="205,53,205,108,200,108,200,53"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
a8a3d83907b4a330504f55723ba112d4
|
||||
124
da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg
Normal file
124
da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg
Normal file
@@ -0,0 +1,124 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::pattern Pages: 1 -->
|
||||
<svg width="209pt" height="194pt"
|
||||
viewBox="0.00 0.00 209.38 194.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" onload="init(evt)">
|
||||
<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 190)">
|
||||
<title>strings::boyer_moore::pattern</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
|
||||
<polygon fill="#999999" stroke="#666666" points="150.75,-30.5 43.25,-30.5 43.25,0 150.75,0 150.75,-30.5"/>
|
||||
<text text-anchor="start" x="51.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="97" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="76.75,-108.25 17.25,-108.25 17.25,-89 76.75,-89 76.75,-108.25"/>
|
||||
<text text-anchor="middle" x="47" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</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="M58.13,-79.51C67.15,-64.84 79.69,-44.42 88.06,-30.79"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="54.8,-77.25 52.54,-87.61 60.76,-80.92 54.8,-77.25"/>
|
||||
</a>
|
||||
</g>
|
||||
<text text-anchor="middle" x="85.25" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pat</text>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="94,-186 0,-186 0,-155.5 94,-155.5 94,-186"/>
|
||||
<text text-anchor="start" x="8" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string<</text>
|
||||
<text text-anchor="middle" x="47" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00"> Char ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M47,-144.37C47,-131.77 47,-117.37 47,-108.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="43.5,-144.22 47,-154.22 50.5,-144.22 43.5,-144.22"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="201.38,-108.25 94.62,-108.25 94.62,-89 201.38,-89 201.38,-108.25"/>
|
||||
<text text-anchor="middle" x="148" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< size_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node1 -->
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node4->Node1</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M136.65,-79.51C127.45,-64.84 114.66,-44.42 106.12,-30.79"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="134.07,-80.99 142.35,-87.61 140,-77.27 134.07,-80.99"/>
|
||||
</a>
|
||||
</g>
|
||||
<text text-anchor="middle" x="156.12" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> bad_char</text>
|
||||
<text text-anchor="middle" x="156.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">good_suffix</text>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="178.88,-180.38 117.12,-180.38 117.12,-161.12 178.88,-161.12 178.88,-180.38"/>
|
||||
<text text-anchor="middle" x="148" y="-166.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge4_Node000004_Node000005" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M148,-150.2C148,-136.6 148,-119.1 148,-108.66"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="144.5,-149.87 148,-159.87 151.5,-149.87 144.5,-149.87"/>
|
||||
</a>
|
||||
</g>
|
||||
<text text-anchor="middle" x="169.38" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</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: 5.8 KiB |
@@ -0,0 +1,99 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: strings::boyer_moore::pattern Pages: 1 -->
|
||||
<svg width="209pt" height="194pt"
|
||||
viewBox="0.00 0.00 209.38 194.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 190)">
|
||||
<title>strings::boyer_moore::pattern</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
|
||||
<polygon fill="#999999" stroke="#666666" points="150.75,-30.5 43.25,-30.5 43.25,0 150.75,0 150.75,-30.5"/>
|
||||
<text text-anchor="start" x="51.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text text-anchor="middle" x="97" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="76.75,-108.25 17.25,-108.25 17.25,-89 76.75,-89 76.75,-108.25"/>
|
||||
<text text-anchor="middle" x="47" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</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="M58.13,-79.51C67.15,-64.84 79.69,-44.42 88.06,-30.79"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="54.8,-77.25 52.54,-87.61 60.76,-80.92 54.8,-77.25"/>
|
||||
</a>
|
||||
</g>
|
||||
<text text-anchor="middle" x="85.25" y="-55.88" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> pat</text>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="94,-186 0,-186 0,-155.5 94,-155.5 94,-186"/>
|
||||
<text text-anchor="start" x="8" y="-172.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string<</text>
|
||||
<text text-anchor="middle" x="47" y="-161.25" font-family="Helvetica,sans-Serif" font-size="10.00"> Char ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M47,-144.37C47,-131.77 47,-117.37 47,-108.38"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="43.5,-144.22 47,-154.22 50.5,-144.22 43.5,-144.22"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="201.38,-108.25 94.62,-108.25 94.62,-89 201.38,-89 201.38,-108.25"/>
|
||||
<text text-anchor="middle" x="148" y="-94.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector< size_t ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node1 -->
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node4->Node1</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M136.65,-79.51C127.45,-64.84 114.66,-44.42 106.12,-30.79"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="134.07,-80.99 142.35,-87.61 140,-77.27 134.07,-80.99"/>
|
||||
</a>
|
||||
</g>
|
||||
<text text-anchor="middle" x="156.12" y="-61.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> bad_char</text>
|
||||
<text text-anchor="middle" x="156.12" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">good_suffix</text>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="178.88,-180.38 117.12,-180.38 117.12,-161.12 178.88,-161.12 178.88,-180.38"/>
|
||||
<text text-anchor="middle" x="148" y="-166.88" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge4_Node000004_Node000005" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M148,-150.2C148,-136.6 148,-119.1 148,-108.66"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="144.5,-149.87 148,-159.87 151.5,-149.87 144.5,-149.87"/>
|
||||
</a>
|
||||
</g>
|
||||
<text text-anchor="middle" x="169.38" y="-128" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> elements</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 5.0 KiB |
171
dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html
Normal file
171
dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html
Normal file
@@ -0,0 +1,171 @@
|
||||
<!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.9.7"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: strings::boyer_moore::pattern Struct Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.7 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<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="summary">
|
||||
<a href="#pub-attribs">Public Attributes</a> |
|
||||
<a href="../../d7/dab/structstrings_1_1boyer__moore_1_1pattern-members.html">List of all members</a> </div>
|
||||
<div class="headertitle"><div class="title">strings::boyer_moore::pattern Struct Reference</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>A structure representing all the data we need to search the preprocessed pattern in text.
|
||||
<a href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#details">More...</a></p>
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for strings::boyer_moore::pattern:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d74/structstrings_1_1boyer__moore_1_1pattern__coll__graph.svg" width="279" height="259"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
|
||||
Public Attributes</h2></td></tr>
|
||||
<tr class="memitem:a8b393264f2be3ddbc2341ce8b1547237"><td class="memItemLeft" align="right" valign="top"><a id="a8b393264f2be3ddbc2341ce8b1547237" name="a8b393264f2be3ddbc2341ce8b1547237"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> </td><td class="memItemRight" valign="bottom"><b>pat</b></td></tr>
|
||||
<tr class="separator:a8b393264f2be3ddbc2341ce8b1547237"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae5ca7abf15e939eddc80542131de3645"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">bad_char</a></td></tr>
|
||||
<tr class="separator:ae5ca7abf15e939eddc80542131de3645"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3d62f615a0171a5d77e7018f704f3a7e"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< size_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">good_suffix</a></td></tr>
|
||||
<tr class="separator:a3d62f615a0171a5d77e7018f704f3a7e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>A structure representing all the data we need to search the preprocessed pattern in text. </p>
|
||||
</div><h2 class="groupheader">Member Data Documentation</h2>
|
||||
<a id="ae5ca7abf15e939eddc80542131de3645" name="ae5ca7abf15e939eddc80542131de3645"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae5ca7abf15e939eddc80542131de3645">◆ </a></span>bad_char</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><size_t> strings::boyer_moore::pattern::bad_char</td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>bad char table used in <a href="https://www.geeksforgeeks.org/boyer-moore-algorithm-for-pattern-searching/" target="_blank">Bad Character Heuristic</a> </p>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="a3d62f615a0171a5d77e7018f704f3a7e" name="a3d62f615a0171a5d77e7018f704f3a7e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a3d62f615a0171a5d77e7018f704f3a7e">◆ </a></span>good_suffix</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a><size_t> strings::boyer_moore::pattern::good_suffix</td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>good suffix table used for <a href="https://www.geeksforgeeks.org/boyer-moore-algorithm-good-suffix-heuristic/?ref=rp" target="_blank">Good Suffix heuristic</a> </p>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<hr/>The documentation for this struct was generated from the following file:<ul>
|
||||
<li>strings/<a class="el" href="../../d3/db2/boyer__moore_8cpp.html">boyer_moore.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../df/dcb/namespacestrings.html">strings</a></li><li class="navelem"><b>boyer_moore</b></li><li class="navelem"><a class="el" href="../../dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html">pattern</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
5
dd/d5a/structstrings_1_1boyer__moore_1_1pattern.js
Normal file
5
dd/d5a/structstrings_1_1boyer__moore_1_1pattern.js
Normal file
@@ -0,0 +1,5 @@
|
||||
var structstrings_1_1boyer__moore_1_1pattern =
|
||||
[
|
||||
[ "bad_char", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645", null ],
|
||||
[ "good_suffix", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e", null ]
|
||||
];
|
||||
@@ -103,6 +103,9 @@ $(document).ready(function(){initNavTree('dir_73a3cc5065b223eb41b02873c0e19f0e.h
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
|
||||
Files</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/db2/boyer__moore_8cpp.html">boyer_moore.cpp</a></td></tr>
|
||||
<tr class="memdesc:d3/db2/boyer__moore_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span> </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html">brute_force_string_searching.cpp</a></td></tr>
|
||||
<tr class="memdesc:d3/d7d/brute__force__string__searching_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">String pattern search - brute force. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
|
||||
@@ -1,5 +1,6 @@
|
||||
var dir_73a3cc5065b223eb41b02873c0e19f0e =
|
||||
[
|
||||
[ "boyer_moore.cpp", "d3/db2/boyer__moore_8cpp.html", "d3/db2/boyer__moore_8cpp" ],
|
||||
[ "brute_force_string_searching.cpp", "d3/d7d/brute__force__string__searching_8cpp.html", "d3/d7d/brute__force__string__searching_8cpp" ],
|
||||
[ "horspool.cpp", "d3/dfe/horspool_8cpp.html", "d3/dfe/horspool_8cpp" ],
|
||||
[ "knuth_morris_pratt.cpp", "de/d6a/knuth__morris__pratt_8cpp.html", "de/d6a/knuth__morris__pratt_8cpp" ],
|
||||
|
||||
13
files.html
13
files.html
@@ -399,12 +399,13 @@ N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bis
|
||||
<tr id="row_22_24_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="db/d3f/wave__sort_8cpp.html" target="_self">wave_sort.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sort-array-wave-form-2/" target="_blank">Wave sort</a> algorithm </td></tr>
|
||||
<tr id="row_22_25_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d1/dcc/wiggle__sort_8cpp.html" target="_self">wiggle_sort.cpp</a></td><td class="desc">[Wiggle Sort Algorithm] (<a href="https://leetcode.com/problems/wiggle-sort-ii/">https://leetcode.com/problems/wiggle-sort-ii/</a>) Implementation </td></tr>
|
||||
<tr id="row_23_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_23_" class="arrow" onclick="toggleFolder('23_')">►</span><span id="img_23_" class="iconfclosed" onclick="toggleFolder('23_')"> </span><a class="el" href="dir_73a3cc5065b223eb41b02873c0e19f0e.html" target="_self">strings</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html" target="_self">brute_force_string_searching.cpp</a></td><td class="desc">String pattern search - brute force </td></tr>
|
||||
<tr id="row_23_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/dfe/horspool_8cpp.html" target="_self">horspool.cpp</a></td><td class="desc">Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) </td></tr>
|
||||
<tr id="row_23_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html" target="_self">knuth_morris_pratt.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm" target="_blank">Knuth-Morris-Pratt Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
|
||||
<tr id="row_23_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d39/manacher__algorithm_8cpp.html" target="_self">manacher_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> </td></tr>
|
||||
<tr id="row_23_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/dce/rabin__karp_8cpp.html" target="_self">rabin_karp.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Rabin–Karp_algorithm" target="_blank">Rabin-Karp Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
|
||||
<tr id="row_23_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d80/z__function_8cpp.html" target="_self">z_function.cpp</a></td><td class="desc">The <a href="https://cp-algorithms.com/string/z-function.html" target="_blank">Z function</a> for finding occurences of a pattern within a piece of text with time and space complexity O(n + m) </td></tr>
|
||||
<tr id="row_23_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/db2/boyer__moore_8cpp.html" target="_self">boyer_moore.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm" target="_blank">Boyer–Moore</a> algorithm searches for occurrences of pattern P in text T by performing explicit character comparisons at different alignments. Instead of a brute-force search of all alignments (of which there are n - m + 1), Boyer–Moore uses information gained by preprocessing P to skip as many alignments as possible </td></tr>
|
||||
<tr id="row_23_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html" target="_self">brute_force_string_searching.cpp</a></td><td class="desc">String pattern search - brute force </td></tr>
|
||||
<tr id="row_23_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/dfe/horspool_8cpp.html" target="_self">horspool.cpp</a></td><td class="desc">Horspool's algorithm that finds if a string contains a substring (<a href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm</a>) </td></tr>
|
||||
<tr id="row_23_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html" target="_self">knuth_morris_pratt.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Knuth–Morris–Pratt_algorithm" target="_blank">Knuth-Morris-Pratt Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
|
||||
<tr id="row_23_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d39/manacher__algorithm_8cpp.html" target="_self">manacher_algorithm.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Longest_palindromic_substring" target="_blank">Manacher's Algorithm</a> </td></tr>
|
||||
<tr id="row_23_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d6/dce/rabin__karp_8cpp.html" target="_self">rabin_karp.cpp</a></td><td class="desc">The <a href="https://en.wikipedia.org/wiki/Rabin–Karp_algorithm" target="_blank">Rabin-Karp Algorithm</a> for finding a pattern within a piece of text with complexity O(n + m) </td></tr>
|
||||
<tr id="row_23_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d80/z__function_8cpp.html" target="_self">z_function.cpp</a></td><td class="desc">The <a href="https://cp-algorithms.com/string/z-function.html" target="_blank">Z function</a> for finding occurences of a pattern within a piece of text with time and space complexity O(n + m) </td></tr>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -100,6 +100,7 @@ $(document).ready(function(){initNavTree('functions_b.html',''); initResizable()
|
||||
<div class="textblock">Here is a list of all documented class members with links to the class documentation for each member:</div>
|
||||
|
||||
<h3><a id="index_b" name="index_b"></a>- b -</h3><ul>
|
||||
<li>bad_char : <a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">strings::boyer_moore::pattern</a></li>
|
||||
<li>batch_predict() : <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a88bf9023ab3d4cdb61cf707c7cdfc86b">machine_learning::neural_network::NeuralNetwork</a></li>
|
||||
<li>bfs() : <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph</a></li>
|
||||
<li>binary_search_tree() : <a class="el" href="d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6">binary_search_tree< T ></a></li>
|
||||
|
||||
@@ -106,8 +106,8 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
|
||||
<li>init() : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD< X ></a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree< X ></a></li>
|
||||
<li>inOrderIterative() : <a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree</a></li>
|
||||
<li>insert() : <a class="el" href="d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree< T ></a>, <a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">data_structures::linked_list::list</a>, <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">data_structures::list_array::list< N ></a></li>
|
||||
<li>Insert() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a></li>
|
||||
<li>insert() : <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
|
||||
<li>Insert() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">data_structures::tree_234::Tree234</a></li>
|
||||
<li>insert() : <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
|
||||
<li>Insert() : <a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">operations_on_datastructures::trie_operations::Tnode</a></li>
|
||||
<li>insert() : <a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">probability::windowed_median::WindowedMedian</a>, <a class="el" href="dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie</a></li>
|
||||
<li>insertElement() : <a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList</a></li>
|
||||
|
||||
@@ -102,8 +102,8 @@ $(document).ready(function(){initNavTree('functions_func_u.html',''); initResiza
|
||||
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
|
||||
<li>uint128_t() : <a class="el" href="db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a></li>
|
||||
<li>uint256_t() : <a class="el" href="d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a></li>
|
||||
<li>UnionSet() : <a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
|
||||
<li>unionSet() : <a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
|
||||
<li>UnionSet() : <a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
|
||||
<li>update() : <a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">data_structures::SegmentTree< T ></a>, <a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>, <a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3">hashing::sha256::Hash</a>, <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD< X ></a>, <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG< X ></a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree</a></li>
|
||||
<li>upper() : <a class="el" href="db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t</a></li>
|
||||
</ul>
|
||||
|
||||
@@ -145,6 +145,7 @@ $(document).ready(function(){initNavTree('functions_g.html',''); initResizable()
|
||||
<li>GetTreeMaxItem() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#ac85ba5abfd6d34dcd908b2afe6464657">data_structures::tree_234::Tree234</a></li>
|
||||
<li>GetTreeMinItem() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a65a1235659356166a3e9b451c64fcc36">data_structures::tree_234::Tree234</a></li>
|
||||
<li>getVertices() : <a class="el" href="da/d9a/class_graph.html#a8dcb5ce0b4a6f65827f5055d9d53a3f1">Graph</a></li>
|
||||
<li>good_suffix : <a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">strings::boyer_moore::pattern</a></li>
|
||||
<li>Graph() : <a class="el" href="da/d9a/class_graph.html#adcbd1b60cab30b97c54d700eee8e456d">Graph</a>, <a class="el" href="dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5">graph::Graph< T ></a>, <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a6aef65b40347c4606662cad4dd2e14d3">graph::is_graph_bipartite::Graph</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -107,8 +107,8 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
|
||||
<li>init() : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD< X ></a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree< X ></a></li>
|
||||
<li>inOrderIterative() : <a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a0c33f2c1a3a3deb486a1c33ee5239499">others::iterative_tree_traversals::BinaryTree</a></li>
|
||||
<li>insert() : <a class="el" href="d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree< T ></a>, <a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a4649fc2c5d09dc58608cd9299db9946f">data_structures::linked_list::list</a>, <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#aa960d714d449612f25256850d72325f1">data_structures::list_array::list< N ></a></li>
|
||||
<li>Insert() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a></li>
|
||||
<li>insert() : <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#a15150d6d933c58190c9c1dd7d22c51ae">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
|
||||
<li>Insert() : <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">data_structures::tree_234::Tree234</a></li>
|
||||
<li>insert() : <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>, <a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#abcae0a4456e7f583ce716e3ef466dfd2">data_structures::trie_using_hashmap::Trie</a>, <a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ac38565472a07d07f63ec0d2fd8a69d4d">operations_on_datastructures::circular_linked_list::CircularLinkedList</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
|
||||
<li>Insert() : <a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html#a7ecb75b985b1ffc575a880274f855b1c">operations_on_datastructures::trie_operations::Tnode</a></li>
|
||||
<li>insert() : <a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html#a6b52b7851750f28d53508e63c52a69f7">probability::windowed_median::WindowedMedian</a>, <a class="el" href="dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2">Trie</a></li>
|
||||
<li>insertElement() : <a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList</a></li>
|
||||
|
||||
@@ -102,8 +102,8 @@ $(document).ready(function(){initNavTree('functions_u.html',''); initResizable()
|
||||
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
|
||||
<li>uint128_t() : <a class="el" href="db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a></li>
|
||||
<li>uint256_t() : <a class="el" href="d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a></li>
|
||||
<li>UnionSet() : <a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
|
||||
<li>unionSet() : <a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
|
||||
<li>UnionSet() : <a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
|
||||
<li>up : <a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">graph::LowestCommonAncestor</a></li>
|
||||
<li>update() : <a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">data_structures::SegmentTree< T ></a>, <a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>, <a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3">hashing::sha256::Hash</a>, <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD< X ></a>, <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG< X ></a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree</a></li>
|
||||
<li>upper() : <a class="el" href="db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t</a></li>
|
||||
|
||||
@@ -120,6 +120,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
|
||||
|
||||
|
||||
<h3><a id="index_b" name="index_b"></a>- b -</h3><ul>
|
||||
<li>bad_char : <a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#ae5ca7abf15e939eddc80542131de3645">strings::boyer_moore::pattern</a></li>
|
||||
<li>blockSize : <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">data_structures::Bitset</a></li>
|
||||
</ul>
|
||||
|
||||
@@ -154,6 +155,11 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_g" name="index_g"></a>- g -</h3><ul>
|
||||
<li>good_suffix : <a class="el" href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html#a3d62f615a0171a5d77e7018f704f3a7e">strings::boyer_moore::pattern</a></li>
|
||||
</ul>
|
||||
|
||||
|
||||
<h3><a id="index_h" name="index_h"></a>- h -</h3><ul>
|
||||
<li>h_heavychlid : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a84424f180f12b514eaab57a6aa20b104">range_queries::heavy_light_decomposition::HLD< X ></a></li>
|
||||
<li>h_label : <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#aa86a91ae0cd7898990a8170a2f2c9cda">range_queries::heavy_light_decomposition::HLD< X ></a></li>
|
||||
|
||||
@@ -105,7 +105,9 @@ $(document).ready(function(){initNavTree('globals_a.html',''); initResizable();
|
||||
<li>add() : <a class="el" href="da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">uint128_t.hpp</a>, <a class="el" href="de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">string_fibonacci.cpp</a></li>
|
||||
<li>addition_rule_dependent() : <a class="el" href="d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule.cpp</a></li>
|
||||
<li>addition_rule_independent() : <a class="el" href="d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">addition_rule.cpp</a></li>
|
||||
<li>and_test() : <a class="el" href="d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">boyer_moore.cpp</a></li>
|
||||
<li>ans() : <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">matrix_exponentiation.cpp</a></li>
|
||||
<li>APLHABET_SIZE : <a class="el" href="d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">boyer_moore.cpp</a></li>
|
||||
<li>are_amicable() : <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">check_amicable_pair.cpp</a></li>
|
||||
<li>assertArray() : <a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">quadratic_equations_complex_numbers.cpp</a></li>
|
||||
<li>AvailArray : <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">linkedlist_implentation_usingarray.cpp</a></li>
|
||||
|
||||
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('globals_defs.html',''); initResizable(
|
||||
<li>_USE_MATH_DEFINES : <a class="el" href="da/d77/spirograph_8cpp.html#a525335710b53cb064ca56b936120431e">spirograph.cpp</a>, <a class="el" href="db/d01/brent__method__extrema_8cpp.html#a525335710b53cb064ca56b936120431e">brent_method_extrema.cpp</a></li>
|
||||
<li>absolutePrecision : <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae01eda5098801bb6b5b778828fb4fddc">ternary_search.cpp</a></li>
|
||||
<li>ACCURACY : <a class="el" href="da/df2/durand__kerner__roots_8cpp.html#af270a96662132d0385cb6b4637c5a689">durand_kerner_roots.cpp</a></li>
|
||||
<li>APLHABET_SIZE : <a class="el" href="d3/db2/boyer__moore_8cpp.html#a77c872c08612d7b8861ba13bc9881cbd">boyer_moore.cpp</a></li>
|
||||
<li>CIPHERS_UINT128_T_HPP_ : <a class="el" href="da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57">uint128_t.hpp</a></li>
|
||||
<li>CIPHERS_UINT256_T_HPP_ : <a class="el" href="da/da3/uint256__t_8hpp.html#a1d8c5ec5b5e419c5c8a740251485102c">uint256_t.hpp</a></li>
|
||||
<li>endl : <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">matrix_exponentiation.cpp</a></li>
|
||||
|
||||
@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('globals_func_a.html',''); initResizabl
|
||||
<li>add() : <a class="el" href="da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3">uint128_t.hpp</a>, <a class="el" href="de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35">string_fibonacci.cpp</a></li>
|
||||
<li>addition_rule_dependent() : <a class="el" href="d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0">addition_rule.cpp</a></li>
|
||||
<li>addition_rule_independent() : <a class="el" href="d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d">addition_rule.cpp</a></li>
|
||||
<li>and_test() : <a class="el" href="d3/db2/boyer__moore_8cpp.html#acb8f69e7901ee7459d98bd4b9dda79d9">boyer_moore.cpp</a></li>
|
||||
<li>ans() : <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">matrix_exponentiation.cpp</a></li>
|
||||
<li>are_amicable() : <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#afeb67e204ec7de02ad152c11df4d1e01">check_amicable_pair.cpp</a></li>
|
||||
<li>assertArray() : <a class="el" href="da/d18/quadratic__equations__complex__numbers_8cpp.html#af7a6d4e3dc85a6288c8f1f7094830c5a">quadratic_equations_complex_numbers.cpp</a></li>
|
||||
|
||||
@@ -109,8 +109,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
|
||||
<li>is_armstrong() : <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#a9cebd92bc70890c3cfa261d68a5016e7">armstrong_number.cpp</a></li>
|
||||
<li>is_happy() : <a class="el" href="db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">happy_number.cpp</a></li>
|
||||
<li>is_square() : <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">ordinary_least_squares_regressor.cpp</a></li>
|
||||
<li>IsPrime() : <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
|
||||
<li>isPrime() : <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a></li>
|
||||
<li>IsPrime() : <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
|
||||
<li>it_ternary_search() : <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
|
||||
File diff suppressed because one or more lines are too long
@@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('globals_func_p.html',''); initResizabl
|
||||
|
||||
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
|
||||
<li>pascal_triangle() : <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd">pascal_triangle.cpp</a></li>
|
||||
<li>pat_test() : <a class="el" href="d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">boyer_moore.cpp</a></li>
|
||||
<li>PointInCircle() : <a class="el" href="d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">smallest_circle.cpp</a></li>
|
||||
<li>poisson_expected() : <a class="el" href="d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71">poisson_dist.cpp</a></li>
|
||||
<li>poisson_range_successes() : <a class="el" href="d9/d24/poisson__dist_8cpp.html#ad9c9e74079278ca10e3b97a8d5391c9a">poisson_dist.cpp</a></li>
|
||||
|
||||
@@ -135,7 +135,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
<li>test_int() : <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>, <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a></li>
|
||||
<li>test_lamniscate() : <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a">kohonen_som_trace.cpp</a></li>
|
||||
<li>test_remove() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
|
||||
<li>tests() : <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a></li>
|
||||
<li>tests() : <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a></li>
|
||||
<li>TH() : <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
|
||||
<li>tolowerRoman() : <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
|
||||
<li>toupperRoman() : <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>
|
||||
|
||||
@@ -110,9 +110,9 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
|
||||
<li>is_armstrong() : <a class="el" href="d4/d5d/math_2armstrong__number_8cpp.html#a9cebd92bc70890c3cfa261d68a5016e7">armstrong_number.cpp</a></li>
|
||||
<li>is_happy() : <a class="el" href="db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7">happy_number.cpp</a></li>
|
||||
<li>is_square() : <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a8fa731952b0ee3bc7ec51c51ed21911e">ordinary_least_squares_regressor.cpp</a></li>
|
||||
<li>IsPrime() : <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
|
||||
<li>isprime : <a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a></li>
|
||||
<li>isPrime() : <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a></li>
|
||||
<li>isprime : <a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a></li>
|
||||
<li>IsPrime() : <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a></li>
|
||||
<li>it_ternary_search() : <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
|
||||
File diff suppressed because one or more lines are too long
@@ -101,6 +101,7 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
|
||||
|
||||
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
|
||||
<li>pascal_triangle() : <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#a4fc0e5a112f715c3a73989450b2cc5fd">pascal_triangle.cpp</a></li>
|
||||
<li>pat_test() : <a class="el" href="d3/db2/boyer__moore_8cpp.html#ac8fac0dd4b19973da103a434143a16d2">boyer_moore.cpp</a></li>
|
||||
<li>pb : <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#a276c5a0e984cf60015b27252fe04fe6b">matrix_exponentiation.cpp</a></li>
|
||||
<li>PointInCircle() : <a class="el" href="d0/d01/smallest__circle_8cpp.html#aee6d48762c1dfb9f14627927f0c16fad">smallest_circle.cpp</a></li>
|
||||
<li>poisson_expected() : <a class="el" href="d9/d24/poisson__dist_8cpp.html#ad0aa718023ce802dd5899f0e03a7ac71">poisson_dist.cpp</a></li>
|
||||
@@ -111,8 +112,8 @@ $(document).ready(function(){initNavTree('globals_p.html',''); initResizable();
|
||||
<li>pop() : <a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">paranthesis_matching.cpp</a></li>
|
||||
<li>power() : <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f">power_for_huge_numbers.cpp</a>, <a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec">matrix_exponentiation.cpp</a></li>
|
||||
<li>predict_OLS_regressor() : <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493">ordinary_least_squares_regressor.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 : <a class="el" href="d6/dce/rabin__karp_8cpp.html#ac4add2a227a10511e0128d63952030e8">rabin_karp.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_factorization() : <a class="el" href="db/d0d/prime__factorization_8cpp.html#a0ece0145fb29a5cf48378c23dde2da46">prime_factorization.cpp</a></li>
|
||||
<li>prime_numbers : <a class="el" href="db/d0d/prime__factorization_8cpp.html#af097796783684712b8326e5b82bfd4fe">prime_factorization.cpp</a></li>
|
||||
<li>primes() : <a class="el" href="de/d9b/prime__numbers_8cpp.html#a9575f3a51eeb8a57d657b3db6a4b441a">prime_numbers.cpp</a></li>
|
||||
|
||||
@@ -136,7 +136,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
<li>test_lamniscate() : <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a">kohonen_som_trace.cpp</a></li>
|
||||
<li>test_remove() : <a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
|
||||
<li>test_set : <a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a></li>
|
||||
<li>tests() : <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a></li>
|
||||
<li>tests() : <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a></li>
|
||||
<li>TH() : <a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
|
||||
<li>tolowerRoman() : <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
|
||||
<li>toupperRoman() : <a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>
|
||||
|
||||
@@ -175,50 +175,51 @@ 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="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_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="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_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/d8b/struct_node.html" target="_self">Node< value_type ></a></td><td class="desc"></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="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_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="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_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="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</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="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</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="de/d4f/structmath_1_1_point.html" target="_self">math::Point</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="d8/dc8/struct_point.html" target="_self">Point</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="dd/d1b/structquery.html" target="_self">query</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="db/da9/classqueue.html" target="_self">queue< ValueType ></a></td><td class="desc"></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="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_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="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_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="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_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="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</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="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</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="de/d4f/structmath_1_1_point.html" target="_self">math::Point</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="d8/dc8/struct_point.html" target="_self">Point</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/d1b/structquery.html" target="_self">query</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="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></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="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_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="d8/d72/class_r_btree.html" target="_self">RBtree</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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></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="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_83_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_83_" class="arrow" onclick="toggleFolder('83_')">►</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_83_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_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="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></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="dd/d4f/class_solution.html" target="_self">Solution</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/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_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="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_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/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_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="d1/dc2/classstack.html" target="_self">stack< ValueType ></a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></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="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1< T ></a></td><td class="desc"></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="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2< T ></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="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_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="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_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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_96_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_96_" class="arrow" onclick="toggleFolder('96_')">►</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_96_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_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="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_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="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
|
||||
<tr id="row_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="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_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="dd/d2f/class_trie.html" target="_self">Trie</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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_102_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_102_" class="arrow" onclick="toggleFolder('102_')">►</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a> [external]</td><td class="desc"></td></tr>
|
||||
<tr id="row_102_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_102_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_102_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_102_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_102_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_102_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_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="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_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="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_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="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_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/da9/classqueue.html" target="_self">queue< 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="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_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="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></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="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_84_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_84_" class="arrow" onclick="toggleFolder('84_')">►</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_84_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_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="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</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="dd/d4f/class_solution.html" target="_self">Solution</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/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_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="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_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/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_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="d1/dc2/classstack.html" target="_self">stack< ValueType ></a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></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/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1< T ></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="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2< T ></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="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_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="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_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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_97_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_97_" class="arrow" onclick="toggleFolder('97_')">►</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_97_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_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="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_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="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
|
||||
<tr id="row_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="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_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="dd/d2f/class_trie.html" target="_self">Trie</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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_103_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_103_" class="arrow" onclick="toggleFolder('103_')">►</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a> [external]</td><td class="desc"></td></tr>
|
||||
<tr id="row_103_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_103_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_103_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_103_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_103_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_103_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_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="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_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="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_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="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 =
|
||||
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
|
||||
[ "search::sublist_search::Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", null ],
|
||||
[ "Node< value_type >", "db/d8b/struct_node.html", null ],
|
||||
[ "strings::boyer_moore::pattern", "dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html", null ],
|
||||
[ "range_queries::perSegTree", "d8/d28/classrange__queries_1_1per_seg_tree.html", null ],
|
||||
[ "ciphers::elliptic_curve_key_exchange::Point", "d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html", null ],
|
||||
[ "geometry::grahamscan::Point", "d7/d48/structgeometry_1_1grahamscan_1_1_point.html", null ],
|
||||
@@ -79,8 +80,8 @@ var hierarchy =
|
||||
[ "math::Point", "de/d4f/structmath_1_1_point.html", null ],
|
||||
[ "Point", "d8/dc8/struct_point.html", null ],
|
||||
[ "query", "dd/d1b/structquery.html", null ],
|
||||
[ "queue< ValueType >", "db/da9/classqueue.html", null ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "queue< ValueType >", "db/da9/classqueue.html", null ],
|
||||
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
|
||||
[ "RBtree", "d8/d72/class_r_btree.html", null ],
|
||||
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
|
||||
|
||||
@@ -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="$d5/d58/class_test_cases.html" title="class encapsulating the necessary test cases" alt="" coords="5,5,90,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
76f1c23145670e75e2e13d0451b74420
|
||||
a9d8d2a80cdf35dfac76eecdbb209456
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="48pt" height="27pt"
|
||||
viewBox="0.00 0.00 48.00 27.25" 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.25 27.25" 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 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="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 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: 921 B After Width: | Height: | Size: 985 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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="41pt" height="27pt"
|
||||
viewBox="0.00 0.00 40.50 27.25" 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.25" 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 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 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: 928 B After Width: | Height: | Size: 921 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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="86pt" height="27pt"
|
||||
viewBox="0.00 0.00 86.25 27.25" 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 40.50 27.25" 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 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 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: 956 B After Width: | Height: | Size: 928 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>
|
||||
|
||||
@@ -1 +1 @@
|
||||
eed75a69314afbb385b920f554ca3c5d
|
||||
a8666508fe9ca12fb7281895f580da44
|
||||
@@ -4,16 +4,16 @@
|
||||
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="64pt" height="27pt"
|
||||
viewBox="0.00 0.00 63.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="86pt" height="27pt"
|
||||
viewBox="0.00 0.00 86.25 27.25" 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="db/d9a/classuint128__t.html" target="_top" xlink:title="class for 128-bit unsigned integer">
|
||||
<polygon fill="white" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
|
||||
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t</text>
|
||||
<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 text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::TrieNode</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 978 B After Width: | Height: | Size: 956 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer" alt="" coords="5,5,80,31"/>
|
||||
<area shape="rect" id="Node000000" href="$db/d9a/classuint128__t.html" title="class for 128-bit unsigned integer" alt="" coords="5,5,80,31"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
805bd0d28e53f8af03d7b4e5906cc299
|
||||
eed75a69314afbb385b920f554ca3c5d
|
||||
@@ -11,9 +11,9 @@
|
||||
<!-- Node0 -->
|
||||
<g id="Node000000" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_Node000000"><a xlink:href="d1/d83/classuint256__t.html" target="_top" xlink:title="class for 256-bit unsigned integer">
|
||||
<g id="a_Node000000"><a xlink:href="db/d9a/classuint128__t.html" target="_top" xlink:title="class for 128-bit unsigned integer">
|
||||
<polygon fill="white" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
|
||||
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t</text>
|
||||
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 978 B After Width: | Height: | Size: 978 B |
3
inherit_graph_105.map
Normal file
3
inherit_graph_105.map
Normal file
@@ -0,0 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="Node000000" href="$d1/d83/classuint256__t.html" title="class for 256-bit unsigned integer" alt="" coords="5,5,80,31"/>
|
||||
</map>
|
||||
1
inherit_graph_105.md5
Normal file
1
inherit_graph_105.md5
Normal file
@@ -0,0 +1 @@
|
||||
805bd0d28e53f8af03d7b4e5906cc299
|
||||
21
inherit_graph_105.svg
Normal file
21
inherit_graph_105.svg
Normal file
@@ -0,0 +1,21 @@
|
||||
<?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 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="64pt" height="27pt"
|
||||
viewBox="0.00 0.00 63.75 27.25" 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/d83/classuint256__t.html" target="_top" xlink:title="class for 256-bit unsigned integer">
|
||||
<polygon fill="white" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
|
||||
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
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="$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="$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 @@
|
||||
a9d8d2a80cdf35dfac76eecdbb209456
|
||||
d6ee5f042479b5982faa79c9932e1b9c
|
||||
@@ -4,16 +4,17 @@
|
||||
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="71pt" height="27pt"
|
||||
viewBox="0.00 0.00 71.25 27.25" 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 115.50 38.50" 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="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 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="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 text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
|
||||
<text 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: 985 B After Width: | Height: | Size: 1.1 KiB |
@@ -202,12 +202,13 @@ $(document).ready(function(){initNavTree('hierarchy.html',''); initResizable();
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_96.svg" width="223" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_97.svg" width="223" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_98.svg" width="354" height="315"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_99.svg" width="95" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_100.svg" width="64" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_101.svg" width="55" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_102.svg" width="115" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_103.svg" width="86" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_99.svg" width="155" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_100.svg" width="95" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_101.svg" width="64" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_102.svg" width="55" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_103.svg" width="115" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_104.svg" width="86" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_105.svg" width="86" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
|
||||
</table>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
|
||||
@@ -142,6 +142,7 @@ var menudata={children:[
|
||||
{text:"d",url:"functions_vars.html#index_d"},
|
||||
{text:"e",url:"functions_vars.html#index_e"},
|
||||
{text:"f",url:"functions_vars.html#index_f"},
|
||||
{text:"g",url:"functions_vars.html#index_g"},
|
||||
{text:"h",url:"functions_vars.html#index_h"},
|
||||
{text:"i",url:"functions_vars.html#index_i"},
|
||||
{text:"k",url:"functions_vars.html#index_k"},
|
||||
|
||||
@@ -252,7 +252,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
|
||||
<tr id="row_111_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/d1d/namespacestrand.html" target="_self">strand</a></td><td class="desc">Functions for <a href="https://en.wikipedia.org/wiki/Strand_sort" target="_blank">Strand Sort</a> algorithm </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">N</span></span><a class="el" href="d3/d91/namespacestrassens__multiplication.html" target="_self">strassens_multiplication</a></td><td class="desc">Namespace for performing strassen's multiplication </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">N</span></span><a class="el" href="d9/d03/namespacestring__search.html" target="_self">string_search</a></td><td class="desc">String search algorithms </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">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">Algorithms with strings </td></tr>
|
||||
<tr id="row_114_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_114_" class="arrow" onclick="toggleFolder('114_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="df/dcb/namespacestrings.html" target="_self">strings</a></td><td class="desc">Algorithms with strings </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">N</span></span><a class="el" href="df/d74/namespacesubarray__sum.html" target="_self">subarray_sum</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Subset_sum_problem" target="_blank">Subset sum</a> implementation </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">N</span></span><a class="el" href="d9/def/namespacesublist__search.html" target="_self">sublist_search</a></td><td class="desc">Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list" target="_blank">Sublist Search</a> implementation </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">N</span></span><a class="el" href="dc/d3a/namespacesubset__sum.html" target="_self">subset_sum</a></td><td class="desc">Functions for [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm </td></tr>
|
||||
|
||||
@@ -141,16 +141,16 @@ var NAVTREEINDEX =
|
||||
"cpp/thread/lock.html",
|
||||
"d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e",
|
||||
"d3/d40/graph__coloring_8cpp.html#a8c47fa37fb6eeeb781b2ec1b05af6b07",
|
||||
"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16",
|
||||
"d5/def/stairs__pattern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
|
||||
"d7/d0a/namespacetrie__using__hashmap.html",
|
||||
"d8/d89/namespacelinear__probing.html#a942fc8407b8001890ea26830cdcd9d77",
|
||||
"d9/dab/bloom__filter_8cpp.html#a9ed236419034917c5270c1dccd220b5c",
|
||||
"da/df2/durand__kerner__roots_8cpp.html#a90219e35062007d1f1b68e9af071ab5c",
|
||||
"dc/d2f/namespacecount__of__trailing__ciphers__in__factorial__n.html",
|
||||
"dd/d47/namespacemath.html#ad0acf82b7bc920182bf8322d1e103953",
|
||||
"de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db",
|
||||
"globals_i.html"
|
||||
"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650",
|
||||
"d5/db5/set__kth__bit_8cpp.html#ad4d0ffd9331242c42a28834ee19f5fd9",
|
||||
"d7/d00/list__array_8cpp.html",
|
||||
"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2",
|
||||
"d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
|
||||
"da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99",
|
||||
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e",
|
||||
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca",
|
||||
"de/dd1/segment__tree_8cpp.html",
|
||||
"globals_func_j.html"
|
||||
];
|
||||
|
||||
var SYNCONMSG = 'click to disable panel synchronisation';
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user