mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 04:42:10 +08:00
Documentation for 97afa0e3e4
This commit is contained in:
github-actions
@@ -166,52 +166,55 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
|
||||
<tr id="row_11_0_2_" 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="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_11_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_11_1_" class="arrow" onclick="toggleFolder('11_1_')">►</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
|
||||
<tr id="row_11_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_12_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
|
||||
<tr id="row_12_0_" class="even"><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/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_12_1_"><td class="entry"><span style="width:32px;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">stats_computer2</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
|
||||
<tr id="row_13_0_"><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">is_integral< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_1_" class="even"><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">is_arithmetic< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_2_"><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_13_3_" class="even"><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_13_4_"><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">is_arithmetic< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_5_" class="even"><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_14_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">▼</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_14_0_" class="even"><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_15_"><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_16_" 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_17_"><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_18_" 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_19_"><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_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/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_"><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_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="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_"><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_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="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_25_"><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_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="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_"><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_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="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_29_"><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_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="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_31_"><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_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="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_"><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_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="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_35_"><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_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="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_37_"><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_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/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_39_"><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_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="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_41_"><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"></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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_43_"><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 containing the necessary test cases </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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_45_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_45_" class="arrow" onclick="toggleFolder('45_')">▼</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_45_0_" class="even"><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_46_"><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_47_" 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_12_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">Search algorithms </td></tr>
|
||||
<tr id="row_12_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_12_0_" class="arrow" onclick="toggleFolder('12_0_')">►</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_12_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
|
||||
<tr id="row_13_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
|
||||
<tr id="row_13_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_13_1_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">▼</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
|
||||
<tr id="row_14_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">is_integral< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_1_" class="even"><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">is_arithmetic< uint128_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_2_"><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_14_3_" class="even"><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_14_4_"><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">is_arithmetic< uint256_t ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_14_5_" class="even"><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_15_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
|
||||
<tr id="row_15_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
|
||||
<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
|
||||
<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
|
||||
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_34_"><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_35_" 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_36_"><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_37_" 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_38_"><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_39_" 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_40_"><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_41_" 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_42_"><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"></td></tr>
|
||||
<tr id="row_43_" 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_44_"><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_45_" 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_46_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_46_" class="arrow" onclick="toggleFolder('46_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_46_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_47_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
|
||||
<tr id="row_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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 -->
|
||||
|
||||
@@ -95,6 +95,11 @@ var annotated_dup =
|
||||
] ],
|
||||
[ "perSegTree", "d8/d28/classrange__queries_1_1per_seg_tree.html", "d8/d28/classrange__queries_1_1per_seg_tree" ]
|
||||
] ],
|
||||
[ "search", "d9/dca/namespacesearch.html", [
|
||||
[ "sublist_search", null, [
|
||||
[ "Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", "da/d61/structsearch_1_1sublist__search_1_1_node" ]
|
||||
] ]
|
||||
] ],
|
||||
[ "statistics", "d2/dcf/namespacestatistics.html", [
|
||||
[ "stats_computer1", "d7/d7c/classstatistics_1_1stats__computer1.html", "d7/d7c/classstatistics_1_1stats__computer1" ],
|
||||
[ "stats_computer2", "d8/dab/classstatistics_1_1stats__computer2.html", "d8/dab/classstatistics_1_1stats__computer2" ]
|
||||
@@ -129,8 +134,8 @@ var annotated_dup =
|
||||
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
|
||||
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
|
||||
[ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
|
||||
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
|
||||
[ "RBtree", "d8/d72/class_r_btree.html", "d8/d72/class_r_btree" ],
|
||||
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
|
||||
[ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ],
|
||||
|
||||
@@ -131,13 +131,13 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
|
||||
<dd><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a></dd><dd><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a></dd><dd><a class="el" href="d1/d77/structmst.html">mst</a></dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a name="letter_N">N</a></dt>
|
||||
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="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="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd></dl>
|
||||
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="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="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
|
||||
<dl class="classindex even">
|
||||
<dt class="alphachar"><a name="letter_P">P</a></dt>
|
||||
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a name="letter_Q">Q</a></dt>
|
||||
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)</dd></dl>
|
||||
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)</dd></dl>
|
||||
<dl class="classindex even">
|
||||
<dt class="alphachar"><a 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>
|
||||
|
||||
@@ -117,7 +117,7 @@ Include dependency graph for random_pivot_quick_sort.cpp:</div>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
|
||||
Classes</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td></tr>
|
||||
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">a class containing the necessary test cases <a href="../../d5/d58/class_test_cases.html#details">More...</a><br /></td></tr>
|
||||
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">class encapsulating the necessary test cases <a href="../../d5/d58/class_test_cases.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 name="namespaces"></a>
|
||||
@@ -164,19 +164,19 @@ Functions</h2></td></tr>
|
||||
<li>Where in quick sort is fast, but still can give you the time complexity of O(n^2) in worst case.</li>
|
||||
<li>To avoid hitting the time complexity of O(n^2), we use the logic of randomize the selection process of pivot element.</li>
|
||||
</ul>
|
||||
<h3><a class="anchor" id="autotoc_md86"></a>
|
||||
<h3><a class="anchor" id="autotoc_md88"></a>
|
||||
Logic</h3>
|
||||
<ul>
|
||||
<li>The logic is pretty simple, the only change is in the partitioning algorithm, which is selecting the pivot element.</li>
|
||||
<li>Instead of selecting the last or the first element from array for pivot we use a random index to select pivot element.</li>
|
||||
<li>This avoids hitting the O(n^2) time complexity in practical use cases.</li>
|
||||
</ul>
|
||||
<h3><a class="anchor" id="autotoc_md87"></a>
|
||||
<h3><a class="anchor" id="autotoc_md89"></a>
|
||||
Partition Logic</h3>
|
||||
<ul>
|
||||
<li>Partitions are done such as numbers lower than the "pivot" element is arranged on the left side of the "pivot", and number larger than the "pivot" element are arranged on the right part of the array.</li>
|
||||
</ul>
|
||||
<h3><a class="anchor" id="autotoc_md88"></a>
|
||||
<h3><a class="anchor" id="autotoc_md90"></a>
|
||||
Algorithm</h3>
|
||||
<ul>
|
||||
<li>Select the pivot element randomly using <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5" title="Takes the start and end indices of an array and returns a random int64_teger between the range of tho...">getRandomIndex()</a> function from this namespace.</li>
|
||||
@@ -371,7 +371,7 @@ Here is the call graph for this function:</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="100%" height="507"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="100%" height="508"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
@@ -607,12 +607,12 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <a class="code" href="../../d5/d58/class_test_cases.html">TestCases</a> tc = <a class="code" href="../../d5/d58/class_test_cases.html">TestCases</a>();</div>
|
||||
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  tc.<a class="code" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
|
||||
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span> }</div>
|
||||
<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">a class containing the necessary test cases</div><div class="ttdef"><b>Definition:</b> random_pivot_quick_sort.cpp:161</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition:</b> random_pivot_quick_sort.cpp:179</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:153</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:171</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="442"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
|
||||
@@ -1,12 +1,12 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,206,56,233"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="753,54,825,81"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="595,156,705,182"/>
|
||||
<area shape="rect" id="node4" href="$d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self-test implementations." alt="" coords="104,130,148,157"/>
|
||||
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="196,80,339,106"/>
|
||||
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print64_t given message on console." alt="" coords="595,54,705,81"/>
|
||||
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case with single input." alt="" coords="387,54,547,81"/>
|
||||
<area shape="rect" id="node9" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case with input array of length 500." alt="" coords="387,105,547,132"/>
|
||||
<area shape="rect" id="node10" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case with array of length 1000." alt="" coords="387,156,547,182"/>
|
||||
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="599,105,701,132"/>
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,55,56,81"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="863,43,935,69"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="104,55,213,81"/>
|
||||
<area shape="rect" id="node4" href="$d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self-test implementations." alt="" coords="137,131,181,157"/>
|
||||
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="261,137,404,164"/>
|
||||
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="682,144,793,171"/>
|
||||
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="452,144,612,171"/>
|
||||
<area shape="rect" id="node8" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="452,195,612,221"/>
|
||||
<area shape="rect" id="node9" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="452,245,612,272"/>
|
||||
<area shape="rect" id="node10" 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="660,245,815,272"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
0f4e81a07ef69a23df3613fe5f5a677f
|
||||
6573e351d172d8b938d1a6d0851eb3ae
|
||||
@@ -4,7 +4,7 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<!--zoomable 207 -->
|
||||
<!--zoomable 208 -->
|
||||
<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"><
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="623pt" height="207pt"
|
||||
viewBox="0.00 0.00 623.00 206.64" 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 202.64)">
|
||||
<svg width="705pt" height="208pt"
|
||||
viewBox="0.00 0.00 705.00 208.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 204)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-202.64 619,-202.64 619,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 701,-204 701,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Main function.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-28.5 0,-47.5 38,-47.5 38,-28.5 0,-28.5"/>
|
||||
<text text-anchor="middle" x="19" y="-35.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-143.5 0,-162.5 38,-162.5 38,-143.5 0,-143.5"/>
|
||||
<text text-anchor="middle" x="19" y="-150.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -22,196 +22,166 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="561,-142.5 561,-161.5 615,-161.5 615,-142.5 561,-142.5"/>
|
||||
<text text-anchor="middle" x="588" y="-149.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
<polygon fill="white" stroke="black" points="643,-152.5 643,-171.5 697,-171.5 697,-152.5 643,-152.5"/>
|
||||
<text text-anchor="middle" x="670" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.16,-31.38C69.72,-20.49 136.89,0 195.5,0 195.5,0 195.5,0 347,0 430.07,0 458.93,-6.65 525,-57 551.25,-77.01 569.7,-111.53 579.31,-132.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="576.17,-134.54 583.32,-142.35 582.61,-131.78 576.17,-134.54"/>
|
||||
<path fill="none" stroke="midnightblue" d="M38.25,-160.32C48.6,-164.24 61.87,-168.9 74,-172 148.4,-191.04 167.71,-200 244.5,-200 244.5,-200 244.5,-200 396,-200 481.51,-200 580.65,-181.49 632.74,-170.3"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="633.79,-173.66 642.81,-168.11 632.3,-166.82 633.79,-173.66"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="442.5,-66.5 442.5,-85.5 524.5,-85.5 524.5,-66.5 442.5,-66.5"/>
|
||||
<text text-anchor="middle" x="483.5" y="-73.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
|
||||
<polygon fill="white" stroke="black" points="74,-143.5 74,-162.5 156,-162.5 156,-143.5 74,-143.5"/>
|
||||
<text text-anchor="middle" x="115" y="-150.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.21,-37.65C93.72,-36.84 265.61,-36.31 406,-57 417.19,-58.65 429.14,-61.22 440.18,-63.93"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="439.46,-67.36 450.02,-66.45 441.2,-60.58 439.46,-67.36"/>
|
||||
<path fill="none" stroke="midnightblue" d="M38.12,-153C45.49,-153 54.4,-153 63.48,-153"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.74,-156.5 73.74,-153 63.74,-149.5 63.74,-156.5"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self-test implementations.">
|
||||
<polygon fill="white" stroke="black" points="74,-85.5 74,-104.5 107,-104.5 107,-85.5 74,-85.5"/>
|
||||
<text text-anchor="middle" x="90.5" y="-92.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
<polygon fill="white" stroke="black" points="98.5,-86.5 98.5,-105.5 131.5,-105.5 131.5,-86.5 98.5,-86.5"/>
|
||||
<text text-anchor="middle" x="115" y="-93.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M31.79,-47.67C42.24,-56.24 57.69,-68.91 69.98,-78.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="67.93,-81.84 77.88,-85.47 72.37,-76.43 67.93,-81.84"/>
|
||||
<path fill="none" stroke="midnightblue" d="M35.95,-143.33C50.62,-134.43 72.6,-121.1 89.5,-110.86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="91.55,-113.7 98.29,-105.53 87.92,-107.72 91.55,-113.7"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
|
||||
<polygon fill="white" stroke="black" points="143,-123.5 143,-142.5 250,-142.5 250,-123.5 143,-123.5"/>
|
||||
<text text-anchor="middle" x="196.5" y="-130.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
|
||||
<polygon fill="white" stroke="black" points="192,-81.5 192,-100.5 299,-100.5 299,-81.5 192,-81.5"/>
|
||||
<text text-anchor="middle" x="245.5" y="-88.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.3,-100.77C121.2,-105.85 141.96,-113.44 159.85,-119.97"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="158.83,-123.33 169.43,-123.47 161.23,-116.75 158.83,-123.33"/>
|
||||
<path fill="none" stroke="midnightblue" d="M131.5,-95.4C144.23,-94.9 163.16,-94.17 181.9,-93.44"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="182.09,-96.93 191.95,-93.04 181.82,-89.94 182.09,-96.93"/>
|
||||
</g>
|
||||
<!-- Node5->Node2 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node5->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M208.25,-142.52C224,-155.76 254.86,-179.11 286,-188 379.81,-214.78 495.59,-183.9 552.33,-164.82"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="553.58,-168.1 561.89,-161.53 551.3,-161.48 553.58,-168.1"/>
|
||||
<path fill="none" stroke="midnightblue" d="M270.53,-100.64C288.12,-107.32 312.7,-115.91 335,-121 441.6,-145.34 570.87,-156.01 632.67,-159.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="632.5,-163.48 642.7,-160.61 632.94,-156.49 632.5,-163.48"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print64_t given message on console.">
|
||||
<polygon fill="white" stroke="black" points="442,-142.5 442,-161.5 525,-161.5 525,-142.5 442,-142.5"/>
|
||||
<text text-anchor="middle" x="483.5" y="-149.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="507.5,-76.5 507.5,-95.5 590.5,-95.5 590.5,-76.5 507.5,-76.5"/>
|
||||
<text text-anchor="middle" x="549" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node6 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node5->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M214.12,-142.58C231.43,-151.95 259.63,-165.58 286,-171 338.24,-181.74 353.06,-177.48 406,-171 417.77,-169.56 430.33,-166.92 441.8,-164.06"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="442.77,-167.42 451.56,-161.51 441,-160.65 442.77,-167.42"/>
|
||||
<path fill="none" stroke="midnightblue" d="M297.82,-100.51C309.96,-102.38 322.9,-104.05 335,-105 388.17,-109.18 401.94,-110.36 455,-105 469.78,-103.51 485.68,-100.71 500.07,-97.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="501.22,-101.04 510.26,-95.51 499.74,-94.2 501.22,-101.04"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case with single input.">
|
||||
<polygon fill="white" stroke="black" points="286,-142.5 286,-161.5 406,-161.5 406,-142.5 286,-142.5"/>
|
||||
<text text-anchor="middle" x="346" y="-149.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
|
||||
<polygon fill="white" stroke="black" points="335,-76.5 335,-95.5 455,-95.5 455,-76.5 335,-76.5"/>
|
||||
<text text-anchor="middle" x="395" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node7 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node5->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M250.33,-139.81C258.59,-140.87 267.23,-141.98 275.79,-143.08"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="275.41,-146.56 285.77,-144.37 276.3,-139.62 275.41,-146.56"/>
|
||||
<path fill="none" stroke="midnightblue" d="M299.33,-89.21C307.5,-88.93 316.05,-88.64 324.51,-88.36"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="324.9,-91.84 334.77,-88.01 324.66,-84.85 324.9,-91.84"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="335,-38.5 335,-57.5 455,-57.5 455,-38.5 335,-38.5"/>
|
||||
<text text-anchor="middle" x="395" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node8 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node5->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M279.24,-81.46C300.53,-75.25 328.51,-67.09 351.51,-60.39"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="352.74,-63.68 361.36,-57.52 350.78,-56.96 352.74,-63.68"/>
|
||||
</g>
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case with input array of length 500.">
|
||||
<polygon fill="white" stroke="black" points="286,-104.5 286,-123.5 406,-123.5 406,-104.5 286,-104.5"/>
|
||||
<text text-anchor="middle" x="346" y="-111.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
<g id="a_node9"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="335,-0.5 335,-19.5 455,-19.5 455,-0.5 335,-0.5"/>
|
||||
<text text-anchor="middle" x="395" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node9 -->
|
||||
<g id="edge12" class="edge">
|
||||
<title>Node5->Node9</title>
|
||||
<path fill="none" stroke="midnightblue" d="M250.33,-126.19C258.59,-125.13 267.23,-124.02 275.79,-122.92"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="276.3,-126.38 285.77,-121.63 275.41,-119.44 276.3,-126.38"/>
|
||||
</g>
|
||||
<!-- Node10 -->
|
||||
<g id="node10" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_node10"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case with array of length 1000.">
|
||||
<polygon fill="white" stroke="black" points="286,-66.5 286,-85.5 406,-85.5 406,-66.5 286,-66.5"/>
|
||||
<text text-anchor="middle" x="346" y="-73.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node10 -->
|
||||
<g id="edge16" class="edge">
|
||||
<title>Node5->Node10</title>
|
||||
<path fill="none" stroke="midnightblue" d="M218.37,-123.38C236.17,-115.34 262.51,-103.8 286,-95 291.68,-92.87 297.72,-90.76 303.69,-88.76"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="305.17,-91.96 313.58,-85.51 302.99,-85.3 305.17,-91.96"/>
|
||||
<path fill="none" stroke="midnightblue" d="M257.81,-81.38C273.99,-68.03 305.1,-43.86 335,-29 339.35,-26.84 344,-24.85 348.7,-23.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="350.14,-26.24 358.37,-19.57 347.78,-19.65 350.14,-26.24"/>
|
||||
</g>
|
||||
<!-- Node6->Node2 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node6->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M525.01,-152C533.51,-152 542.42,-152 550.75,-152"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="550.92,-155.5 560.92,-152 550.92,-148.5 550.92,-155.5"/>
|
||||
</g>
|
||||
<!-- Node7->Node3 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node7->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M386.33,-142.39C393.16,-139.88 399.99,-136.78 406,-133 425.69,-120.6 423.14,-108.62 442,-95 444.23,-93.39 446.61,-91.87 449.06,-90.43"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="450.91,-93.41 458.11,-85.64 447.64,-87.23 450.91,-93.41"/>
|
||||
<path fill="none" stroke="midnightblue" d="M565.07,-95.63C585.37,-108.59 621.69,-131.79 645.57,-147.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="643.74,-150.02 654.05,-152.45 647.51,-144.12 643.74,-150.02"/>
|
||||
</g>
|
||||
<!-- Node7->Node6 -->
|
||||
<g id="edge10" class="edge">
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node7->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M406.04,-152C414.66,-152 423.47,-152 431.9,-152"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="431.96,-155.5 441.96,-152 431.96,-148.5 431.96,-155.5"/>
|
||||
<path fill="none" stroke="midnightblue" d="M455.2,-86C469.02,-86 483.62,-86 497.04,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="497.04,-89.5 507.04,-86 497.04,-82.5 497.04,-89.5"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="445.5,-104.5 445.5,-123.5 521.5,-123.5 521.5,-104.5 445.5,-104.5"/>
|
||||
<text text-anchor="middle" x="483.5" y="-111.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
|
||||
<!-- Node8->Node6 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node8->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M434.36,-57.59C454.32,-62.58 478.93,-68.73 500.13,-74.03"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="499.37,-77.45 509.92,-76.48 501.07,-70.66 499.37,-77.45"/>
|
||||
</g>
|
||||
<!-- Node9->Node6 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node9->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M430.53,-19.6C438.7,-22.28 447.28,-25.45 455,-29 480.61,-40.77 507.88,-58.12 526.22,-70.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="524.48,-73.64 534.7,-76.44 528.46,-67.88 524.48,-73.64"/>
|
||||
</g>
|
||||
<!-- Node10 -->
|
||||
<g id="node10" class="node">
|
||||
<title>Node10</title>
|
||||
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="491,-0.5 491,-19.5 607,-19.5 607,-0.5 491,-0.5"/>
|
||||
<text text-anchor="middle" x="549" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node7->Node8 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node7->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M381.19,-142.41C398.6,-137.53 419.97,-131.54 438.59,-126.32"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="439.64,-129.66 448.32,-123.59 437.74,-122.92 439.64,-129.66"/>
|
||||
</g>
|
||||
<!-- Node9->Node3 -->
|
||||
<g id="edge15" class="edge">
|
||||
<title>Node9->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M381.19,-104.41C398.6,-99.53 419.97,-93.54 438.59,-88.32"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="439.64,-91.66 448.32,-85.59 437.74,-84.92 439.64,-91.66"/>
|
||||
</g>
|
||||
<!-- Node9->Node6 -->
|
||||
<!-- Node9->Node10 -->
|
||||
<g id="edge14" class="edge">
|
||||
<title>Node9->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M381.19,-123.59C398.6,-128.47 419.97,-134.46 438.59,-139.68"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="437.74,-143.08 448.32,-142.41 439.64,-136.34 437.74,-143.08"/>
|
||||
</g>
|
||||
<!-- Node9->Node8 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node9->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M406.04,-114C415.68,-114 425.55,-114 434.87,-114"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="435.11,-117.5 445.11,-114 435.11,-110.5 435.11,-117.5"/>
|
||||
</g>
|
||||
<!-- Node10->Node3 -->
|
||||
<g id="edge19" class="edge">
|
||||
<title>Node10->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M406.04,-76C414.76,-76 423.68,-76 432.2,-76"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="432.36,-79.5 442.36,-76 432.36,-72.5 432.36,-79.5"/>
|
||||
</g>
|
||||
<!-- Node10->Node6 -->
|
||||
<g id="edge18" class="edge">
|
||||
<title>Node10->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M386.33,-85.61C393.16,-88.12 399.99,-91.22 406,-95 425.69,-107.4 423.14,-119.38 442,-133 444.23,-134.61 446.61,-136.13 449.06,-137.57"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="447.64,-140.77 458.11,-142.36 450.91,-134.59 447.64,-140.77"/>
|
||||
</g>
|
||||
<!-- Node10->Node8 -->
|
||||
<g id="edge17" class="edge">
|
||||
<title>Node10->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M381.19,-85.59C398.6,-90.47 419.97,-96.46 438.59,-101.68"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="437.74,-105.08 448.32,-104.41 439.64,-98.34 437.74,-105.08"/>
|
||||
<title>Node9->Node10</title>
|
||||
<path fill="none" stroke="midnightblue" d="M455.2,-10C463.5,-10 472.08,-10 480.51,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="480.7,-13.5 490.7,-10 480.7,-6.5 480.7,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 11 KiB After Width: | Height: | Size: 9.6 KiB |
@@ -1,11 +1,10 @@
|
||||
<map id="test" name="test">
|
||||
<area shape="rect" id="node1" title="Self-test implementations." alt="" coords="5,56,49,83"/>
|
||||
<area shape="rect" id="node2" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,56,240,83"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="655,5,727,32"/>
|
||||
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print64_t given message on console." alt="" coords="496,56,607,83"/>
|
||||
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case with single input." alt="" coords="288,56,448,83"/>
|
||||
<area shape="rect" id="node8" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case with input array of length 500." alt="" coords="288,107,448,133"/>
|
||||
<area shape="rect" id="node9" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case with array of length 1000." alt="" coords="288,157,448,184"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="501,107,602,133"/>
|
||||
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="497,157,606,184"/>
|
||||
<area shape="rect" id="node1" title="Self-test implementations." alt="" coords="5,57,49,83"/>
|
||||
<area shape="rect" id="node2" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,57,240,83"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="699,6,771,33"/>
|
||||
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="518,57,629,83"/>
|
||||
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="288,57,448,83"/>
|
||||
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="288,107,448,134"/>
|
||||
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="288,158,448,185"/>
|
||||
<area shape="rect" id="node8" 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="496,158,651,185"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
81542f66dde44ef4bfc757f816c58a70
|
||||
59cc849d5912d57ceb7252b3490d7478
|
||||
@@ -4,7 +4,7 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: test Pages: 1 -->
|
||||
<!--zoomable 142 -->
|
||||
<!--zoomable 143 -->
|
||||
<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"><
@@ -4,11 +4,11 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: test Pages: 1 -->
|
||||
<svg width="549pt" height="142pt"
|
||||
viewBox="0.00 0.00 549.00 142.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 138)">
|
||||
<svg width="582pt" height="143pt"
|
||||
viewBox="0.00 0.00 582.00 142.53" 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 138.53)">
|
||||
<title>test</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 545,-138 545,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 578,-138.53 578,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
@@ -37,36 +37,36 @@
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="487,-114.5 487,-133.5 541,-133.5 541,-114.5 487,-114.5"/>
|
||||
<text text-anchor="middle" x="514" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
<polygon fill="white" stroke="black" points="520,-114.5 520,-133.5 574,-133.5 574,-114.5 520,-114.5"/>
|
||||
<text text-anchor="middle" x="547" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M141.88,-95.58C159.37,-104.14 186.7,-116.05 212,-121 305.95,-139.39 419.58,-133 476.61,-127.87"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="477.28,-131.32 486.91,-126.9 476.63,-124.36 477.28,-131.32"/>
|
||||
<path fill="none" stroke="midnightblue" d="M141.88,-95.59C159.37,-104.14 186.7,-116.06 212,-121 318.53,-141.8 447.83,-133.79 509.65,-127.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="510.08,-131.45 519.69,-127 509.4,-124.48 510.08,-131.45"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print64_t given message on console.">
|
||||
<polygon fill="white" stroke="black" points="368,-76.5 368,-95.5 451,-95.5 451,-76.5 368,-76.5"/>
|
||||
<text text-anchor="middle" x="409.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="384.5,-76.5 384.5,-95.5 467.5,-95.5 467.5,-76.5 384.5,-76.5"/>
|
||||
<text text-anchor="middle" x="426" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 265.04,-110.63 279.06,-111.48 332,-105 343.77,-103.56 356.33,-100.92 367.8,-98.06"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="368.77,-101.42 377.56,-95.51 367,-94.65 368.77,-101.42"/>
|
||||
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 265.04,-110.63 278.94,-110.36 332,-105 346.78,-103.51 362.68,-100.71 377.07,-97.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="378.22,-101.04 387.26,-95.51 376.74,-94.2 378.22,-101.04"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case with single input.">
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
|
||||
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 332,-95.5 332,-76.5 212,-76.5"/>
|
||||
<text text-anchor="middle" x="272" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
</a>
|
||||
@@ -78,113 +78,74 @@
|
||||
<path fill="none" stroke="midnightblue" d="M176.33,-86C184.5,-86 193.05,-86 201.51,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="201.77,-89.5 211.77,-86 201.77,-82.5 201.77,-89.5"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case with input array of length 500.">
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="212,-38.5 212,-57.5 332,-57.5 332,-38.5 212,-38.5"/>
|
||||
<text text-anchor="middle" x="272" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node8 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node2->Node8</title>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M160.72,-76.41C180.01,-71.44 203.76,-65.32 224.27,-60.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="225.24,-63.4 234.05,-57.52 223.49,-56.63 225.24,-63.4"/>
|
||||
</g>
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case with array of length 1000.">
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="212,-0.5 212,-19.5 332,-19.5 332,-0.5 212,-0.5"/>
|
||||
<text text-anchor="middle" x="272" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node9 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node2->Node9</title>
|
||||
<!-- Node2->Node7 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node2->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M136.08,-76.39C152.7,-64.04 183.25,-42.6 212,-29 216.62,-26.81 221.56,-24.78 226.54,-22.93"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="227.82,-26.19 236.1,-19.58 225.5,-19.58 227.82,-26.19"/>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M436.37,-95.59C448.87,-100.22 464.07,-105.86 477.62,-110.89"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="476.55,-114.22 487.14,-114.41 478.98,-107.66 476.55,-114.22"/>
|
||||
<path fill="none" stroke="midnightblue" d="M457.03,-95.59C473.14,-100.74 493.12,-107.11 510.06,-112.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="509.04,-115.87 519.63,-115.58 511.17,-109.2 509.04,-115.87"/>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.04,-86C340.66,-86 349.47,-86 357.9,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="357.96,-89.5 367.96,-86 357.96,-82.5 357.96,-89.5"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="371.5,-38.5 371.5,-57.5 447.5,-57.5 447.5,-38.5 371.5,-38.5"/>
|
||||
<text text-anchor="middle" x="409.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node6 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node5->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M307.19,-76.41C324.6,-71.53 345.97,-65.54 364.59,-60.32"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="365.64,-63.66 374.32,-57.59 363.74,-56.92 365.64,-63.66"/>
|
||||
<title>Node5->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.2,-86C346.02,-86 360.62,-86 374.04,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="374.04,-89.5 384.04,-86 374.04,-82.5 374.04,-89.5"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="368.5,-0.5 368.5,-19.5 450.5,-19.5 450.5,-0.5 368.5,-0.5"/>
|
||||
<text text-anchor="middle" x="409.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
|
||||
<!-- Node6->Node4 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node6->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M311.36,-57.59C331.32,-62.58 355.93,-68.73 377.13,-74.03"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="376.37,-77.45 386.92,-76.48 378.07,-70.66 376.37,-77.45"/>
|
||||
</g>
|
||||
<!-- Node7->Node4 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node7->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M307.53,-19.6C315.7,-22.28 324.28,-25.45 332,-29 357.61,-40.77 384.88,-58.12 403.22,-70.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="401.48,-73.64 411.7,-76.44 405.46,-67.88 401.48,-73.64"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="368,-0.5 368,-19.5 484,-19.5 484,-0.5 368,-0.5"/>
|
||||
<text text-anchor="middle" x="426" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node7 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node5->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M312.33,-76.39C319.16,-73.88 325.99,-70.78 332,-67 351.69,-54.6 349.14,-42.62 368,-29 370.23,-27.39 372.61,-25.87 375.06,-24.43"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="376.91,-27.41 384.11,-19.64 373.64,-21.23 376.91,-27.41"/>
|
||||
</g>
|
||||
<!-- Node8->Node4 -->
|
||||
<!-- Node7->Node8 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node8->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M307.19,-57.59C324.6,-62.47 345.97,-68.46 364.59,-73.68"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="363.74,-77.08 374.32,-76.41 365.64,-70.34 363.74,-77.08"/>
|
||||
</g>
|
||||
<!-- Node8->Node6 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node8->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.04,-48C341.68,-48 351.55,-48 360.87,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="361.11,-51.5 371.11,-48 361.11,-44.5 361.11,-51.5"/>
|
||||
</g>
|
||||
<!-- Node8->Node7 -->
|
||||
<g id="edge12" class="edge">
|
||||
<title>Node8->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M307.19,-38.41C324.6,-33.53 345.97,-27.54 364.59,-22.32"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="365.64,-25.66 374.32,-19.59 363.74,-18.92 365.64,-25.66"/>
|
||||
</g>
|
||||
<!-- Node9->Node4 -->
|
||||
<g id="edge15" class="edge">
|
||||
<title>Node9->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M312.33,-19.61C319.16,-22.12 325.99,-25.22 332,-29 351.69,-41.4 349.14,-53.38 368,-67 370.23,-68.61 372.61,-70.13 375.06,-71.57"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="373.64,-74.77 384.11,-76.36 376.91,-68.59 373.64,-74.77"/>
|
||||
</g>
|
||||
<!-- Node9->Node6 -->
|
||||
<g id="edge14" class="edge">
|
||||
<title>Node9->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M307.19,-19.59C324.6,-24.47 345.97,-30.46 364.59,-35.68"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="363.74,-39.08 374.32,-38.41 365.64,-32.34 363.74,-39.08"/>
|
||||
</g>
|
||||
<!-- Node9->Node7 -->
|
||||
<g id="edge16" class="edge">
|
||||
<title>Node9->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.04,-10C340.76,-10 349.68,-10 358.2,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="358.36,-13.5 368.36,-10 358.36,-6.5 358.36,-13.5"/>
|
||||
<title>Node7->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.2,-10C340.5,-10 349.08,-10 357.51,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="357.7,-13.5 367.7,-10 357.7,-6.5 357.7,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 9.6 KiB After Width: | Height: | Size: 7.6 KiB |
@@ -152,7 +152,7 @@ Functions</h2></td></tr>
|
||||
<p>two elements a[i] and a[j] form an inversion if <code>a[i]</code> > <code>a[j]</code> and i < j</p>
|
||||
<p>Time Complexity --> <code>O(n.log n)</code></p>
|
||||
<p>Space Complexity --> <code>O(n)</code> ; additional array <code>temp[1..n]</code> </p>
|
||||
<h3><a class="anchor" id="autotoc_md85"></a>
|
||||
<h3><a class="anchor" id="autotoc_md87"></a>
|
||||
Algorithm</h3>
|
||||
<ol type="1">
|
||||
<li>The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.</li>
|
||||
|
||||
111
d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html
Normal file
111
d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html
Normal file
@@ -0,0 +1,111 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||||
<meta name="generator" content="Doxygen 1.9.1"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: Member List</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++
|
||||
 <span id="projectnumber">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.1 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('da/d61/structsearch_1_1sublist__search_1_1_node.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<iframe src="javascript:void(0)" frameborder="0"
|
||||
name="MSearchResults" id="MSearchResults">
|
||||
</iframe>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle">
|
||||
<div class="title">search::sublist_search::Node Member List</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">data</a></td><td class="entry"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></td><td class="entry"></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">next</a></td><td class="entry"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</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.1 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -136,7 +136,7 @@ Functions</h2></td></tr>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://adityaprakash.tech">Aditya Prakash</a></dd></dl>
|
||||
<p>The working principle of the Bubble sort algorithm.</p>
|
||||
<p>Bubble sort is a simple sorting algorithm used to rearrange a set of ascending or descending order elements. Bubble sort gets its name from the fact that data "bubbles" to the top of the dataset.</p>
|
||||
<h3><a class="anchor" id="autotoc_md89"></a>
|
||||
<h3><a class="anchor" id="autotoc_md91"></a>
|
||||
Algorithm</h3>
|
||||
<p>What is Swap?</p>
|
||||
<p>Swapping two numbers means that we interchange their values. Often, an additional variable is required for this operation. This is further illustrated in the following:</p>
|
||||
|
||||
502
d5/d45/sublist__search_8cpp.html
Normal file
502
d5/d45/sublist__search_8cpp.html
Normal file
@@ -0,0 +1,502 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||||
<meta name="generator" content="Doxygen 1.9.1"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: search/sublist_search.cpp File Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++
|
||||
 <span id="projectnumber">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.1 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d5/d45/sublist__search_8cpp.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<iframe src="javascript:void(0)" frameborder="0"
|
||||
name="MSearchResults" id="MSearchResults">
|
||||
</iframe>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#nested-classes">Classes</a> |
|
||||
<a href="#namespaces">Namespaces</a> |
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">sublist_search.cpp File Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search Algorithm</a>
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <cassert></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
<code>#include <vector></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for sublist_search.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d92/sublist__search_8cpp__incl.svg" width="256" height="112"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a 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="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></td></tr>
|
||||
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">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. <a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#details">More...</a><br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td></tr>
|
||||
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">class encapsulating the necessary test cases <a href="../../d5/d58/class_test_cases.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 name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:d9/dca/namespacesearch"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dca/namespacesearch.html">search</a></td></tr>
|
||||
<tr class="memdesc:d9/dca/namespacesearch"><td class="mdescLeft"> </td><td class="mdescRight">Search algorithms. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d9/def/namespacesublist__search"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/def/namespacesublist__search.html">sublist_search</a></td></tr>
|
||||
<tr class="memdesc:d9/def/namespacesublist__search"><td class="mdescLeft"> </td><td class="mdescRight">Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search</a> implementation. <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 name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:ad1028bc215281d62e344af99da57fab2"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *start)</td></tr>
|
||||
<tr class="memdesc:ad1028bc215281d62e344af99da57fab2"><td class="mdescLeft"> </td><td class="mdescRight">A simple function to print the linked list. <a href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">More...</a><br /></td></tr>
|
||||
<tr class="separator:ad1028bc215281d62e344af99da57fab2"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ab4054b9ab80a5e609b6fcdf70f2e03b9"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t > &<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
|
||||
<tr class="memdesc:ab4054b9ab80a5e609b6fcdf70f2e03b9"><td class="mdescLeft"> </td><td class="mdescRight">Give a vector of data, it adds each element of vector in the linked list and return the address of head pointer. <a href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">More...</a><br /></td></tr>
|
||||
<tr class="separator:ab4054b9ab80a5e609b6fcdf70f2e03b9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a4faee403e2758aaab682ed6622ae218c"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *sublist, <a class="el" href="../../db/d8b/struct_node.html">Node</a> *mainList)</td></tr>
|
||||
<tr class="memdesc:a4faee403e2758aaab682ed6622ae218c"><td class="mdescLeft"> </td><td class="mdescRight">Main searching function. <a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">More...</a><br /></td></tr>
|
||||
<tr class="separator:a4faee403e2758aaab682ed6622ae218c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
||||
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Self-test implementations. <a href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
|
||||
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
|
||||
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">More...</a><br /></td></tr>
|
||||
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search Algorithm</a> </p>
|
||||
<h3><a class="anchor" id="autotoc_md84"></a>
|
||||
Algorithm</h3>
|
||||
<ul>
|
||||
<li>Sublist search is used to detect a presence of one list in another list.</li>
|
||||
<li>Suppose we have a single-node list (let's say the first list), and we want to ensure that the list is present in another list (let's say the second list), then we can perform the sublist search to find it.</li>
|
||||
<li>For instance, the first list contains these elements: 23 -> 30 -> 41, and the second list contains these elements: 10 -> 15 -> 23 -> 30 -> 41 -> 49. At a glance, we see that the first list presents in the second list.</li>
|
||||
</ul>
|
||||
<h3><a class="anchor" id="autotoc_md85"></a>
|
||||
Working</h3>
|
||||
<ul>
|
||||
<li>The sublist search algorithm works by comparing the first element of the first list with the first element of the second list.</li>
|
||||
<li>If the two values don't match, it goes to the next element of the second list. It does this until the two values match.</li>
|
||||
</ul>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/foo290">Nitin Sharma</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="a0ddf1224851353fc92bfbff6f499fa97"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">◆ </a></span>main()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">int main </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>argc</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">char * </td>
|
||||
<td class="paramname"><em>argv</em>[] </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">argc</td><td>commandline argument count (ignored) </td></tr>
|
||||
<tr><td class="paramname">argv</td><td>commandline array of arguments (ignored) </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<p>< Main list in which sublist is to be searched</p>
|
||||
<p>< Sublist to be searched</p>
|
||||
<p>< Main list in which sublist is to be searched</p>
|
||||
<p>< boolean to check if the sublist exists or not</p>
|
||||
<div class="fragment"><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  {</div>
|
||||
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
||||
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  </div>
|
||||
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> mainlistData = {</div>
|
||||
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  2, 5, 6, 7, 8}; <span class="comment">///< Main list in which sublist is to be searched</span></div>
|
||||
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> sublistData = {6, 8}; <span class="comment">///< Sublist to be searched</span></div>
|
||||
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  </div>
|
||||
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <a class="code" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
|
||||
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a>(mainlistData);</div>
|
||||
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <a class="code" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
|
||||
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a>(</div>
|
||||
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  sublistData); <span class="comment">///< Main list in which sublist is to be</span><span class="comment"></span></div>
|
||||
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment"> ///< searched</span></div>
|
||||
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordtype">bool</span> <a class="code" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
|
||||
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  sublistLL,</div>
|
||||
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  mainlistLL); <span class="comment">///< boolean to check if the sublist exists or not</span></div>
|
||||
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  </div>
|
||||
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Sublist: "</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a>(sublistLL);</div>
|
||||
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  </div>
|
||||
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Main list: "</span> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a>(mainlistLL);</div>
|
||||
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  </div>
|
||||
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (exists) {</div>
|
||||
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"[TRUE] - sublist found in main list\n"</span>;</div>
|
||||
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"[FALSE] - sublist NOT found in main list\n"</span>;</div>
|
||||
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  }</div>
|
||||
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> }</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:47</div></div>
|
||||
<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:100</div></div>
|
||||
<div class="ttc" id="asublist__search_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:328</div></div>
|
||||
<div class="ttc" id="asublist__search_8cpp_html_ab4054b9ab80a5e609b6fcdf70f2e03b9"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector< uint64_t > &data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:73</div></div>
|
||||
<div class="ttc" id="asublist__search_8cpp_html_ad1028bc215281d62e344af99da57fab2"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2">search::sublist_search::printLinkedList</a></div><div class="ttdeci">void printLinkedList(Node *start)</div><div class="ttdoc">A simple function to print the linked list.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:57</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< uint64_t ></a></div></div>
|
||||
<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &str, const std::unordered_set< std::string > &strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition:</b> word_break.cpp:60</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="100%" height="508"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ab4054b9ab80a5e609b6fcdf70f2e03b9"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ab4054b9ab80a5e609b6fcdf70f2e03b9">◆ </a></span>makeLinkedList()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a>* search::sublist_search::makeLinkedList </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< uint64_t > & </td>
|
||||
<td class="paramname"><em>data</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Give a vector of data, it adds each element of vector in the linked list and return the address of head pointer. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">data</td><td>A vector of "int" containing the data that is supposed to be stored in nodes of linked list. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>Node* A head pointer to the linked list. </dd></dl>
|
||||
<p>This is used in test cases for rapidly creating linked list with 100+ elements, instead of hard-coding 100 elements in test cases.</p>
|
||||
<div class="fragment"><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="comment"> /// This is used in test cases for rapidly creating linked list with 100+</span></div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"> /// elements, instead of hard-coding 100 elements in test cases.</span></div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"></span> <a class="code" href="../../db/d8b/struct_node.html">Node</a> *head = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <a class="code" href="../../db/d8b/struct_node.html">Node</a> *tail = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <a class="code" href="../../db/d8b/struct_node.html">Node</a> *<a class="code" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code" href="../../db/d8b/struct_node.html">Node</a>;</div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="code" href="../../d5/da1/structnode.html">node</a>->data = i;</div>
|
||||
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="../../d5/da1/structnode.html">node</a>->next = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordflow">if</span> (head == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  head = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>;</div>
|
||||
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  tail = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>;</div>
|
||||
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  tail->next = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>;</div>
|
||||
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  tail = tail->next;</div>
|
||||
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div>
|
||||
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div>
|
||||
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">return</span> head;</div>
|
||||
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> }</div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:24</div></div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></div>
|
||||
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:14</div></div>
|
||||
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div>
|
||||
</div><!-- 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="../../d5/d45/sublist__search_8cpp_ab4054b9ab80a5e609b6fcdf70f2e03b9_cgraph.svg" width="164" 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="ad1028bc215281d62e344af99da57fab2"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ad1028bc215281d62e344af99da57fab2">◆ </a></span>printLinkedList()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void search::sublist_search::printLinkedList </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> * </td>
|
||||
<td class="paramname"><em>start</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A simple function to print the linked list. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">start</td><td>The head of the linked list </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  {</div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">while</span> (start != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"->"</span> << start->data;</div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  start = start->next;</div>
|
||||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</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="../../d5/d45/sublist__search_8cpp_ad1028bc215281d62e344af99da57fab2_cgraph.svg" width="284" 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="a4faee403e2758aaab682ed6622ae218c"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a4faee403e2758aaab682ed6622ae218c">◆ </a></span>sublistSearch()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">bool search::sublist_search::sublistSearch </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> * </td>
|
||||
<td class="paramname"><em>sublist</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> * </td>
|
||||
<td class="paramname"><em>mainList</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Main searching function. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">sublist</td><td>A linked list which is supposed to be searched in mainList. </td></tr>
|
||||
<tr><td class="paramname">mainList</td><td>A linked list in which sublist will be searched. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true if the sublist is found </dd>
|
||||
<dd>
|
||||
false if the sublist is NOT found </dd></dl>
|
||||
<p>Initialize target pointer to the head node of sublist.</p>
|
||||
<p>Initialize main pointer to the current node of main list.</p>
|
||||
<p>If the data of target node and main node is equal then move to the next node of both lists.</p>
|
||||
<p>Is target pointer becomes null that means the target list is been traversed without returning false. Which means the sublist has been found and return ture.</p>
|
||||
<p>set the target pointer again to stating point of target list.</p>
|
||||
<p>set the main pointer to the next element of the main list and repeat the algo.</p>
|
||||
<p>If the main list is exhausted, means sublist does not found, return false</p>
|
||||
<div class="fragment"><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  {</div>
|
||||
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keywordflow">if</span> (sublist == <span class="keyword">nullptr</span> || mainList == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  }</div>
|
||||
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment"> /// Initialize target pointer to the head node of sublist.</span></div>
|
||||
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment"></span> <a class="code" href="../../db/d8b/struct_node.html">Node</a> *target_ptr = sublist;</div>
|
||||
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  </div>
|
||||
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">while</span> (mainList != <span class="keyword">nullptr</span>) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span> <span class="comment"> /// Initialize main pointer to the current node of main list.</span></div>
|
||||
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span> <span class="comment"></span> <a class="code" href="../../db/d8b/struct_node.html">Node</a> *main_ptr = mainList;</div>
|
||||
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  </div>
|
||||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">while</span> (target_ptr != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">if</span> (main_ptr == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  </div>
|
||||
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (main_ptr->data == target_ptr->data) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="comment"> /// If the data of target node and main node is equal then move</span></div>
|
||||
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <span class="comment"> /// to the next node of both lists.</span></div>
|
||||
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="comment"></span> target_ptr = target_ptr->next;</div>
|
||||
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  main_ptr = main_ptr->next;</div>
|
||||
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  </div>
|
||||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keywordflow">break</span>;</div>
|
||||
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div>
|
||||
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div>
|
||||
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div>
|
||||
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (target_ptr == <span class="keyword">nullptr</span>) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment"> /// Is target pointer becomes null that means the target list is</span></div>
|
||||
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment"> /// been traversed without returning false. Which means the sublist</span></div>
|
||||
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment"> /// has been found and return ture.</span></div>
|
||||
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment"></span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div>
|
||||
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment"> /// set the target pointer again to stating point of target list.</span></div>
|
||||
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment"></span> target_ptr = sublist;</div>
|
||||
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="comment"> /// set the main pointer to the next element of the main list and repeat</span></div>
|
||||
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span> <span class="comment"> /// the algo.</span></div>
|
||||
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span> <span class="comment"></span> mainList = mainList->next;</div>
|
||||
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div>
|
||||
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment"> /// If the main list is exhausted, means sublist does not found, return</span></div>
|
||||
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment"> /// false</span></div>
|
||||
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="comment"></span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><a name="l00145"></a><span class="lineno"> 145</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="../../d5/d45/sublist__search_8cpp_a4faee403e2758aaab682ed6622ae218c_cgraph.svg" width="164" 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="aa8dca7b867074164d5f45b0f3851269d"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">◆ </a></span>test()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static void test </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Self-test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  {</div>
|
||||
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <a class="code" href="../../d5/d58/class_test_cases.html">TestCases</a> tc;</div>
|
||||
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  tc.<a class="code" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
|
||||
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> }</div>
|
||||
<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:153</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:171</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="443"><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>
|
||||
</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_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_search.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.1 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
10
d5/d45/sublist__search_8cpp.js
Normal file
10
d5/d45/sublist__search_8cpp.js
Normal file
@@ -0,0 +1,10 @@
|
||||
var sublist__search_8cpp =
|
||||
[
|
||||
[ "Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", "da/d61/structsearch_1_1sublist__search_1_1_node" ],
|
||||
[ "TestCases", "d5/d58/class_test_cases.html", "d5/d58/class_test_cases" ],
|
||||
[ "main", "d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
|
||||
[ "makeLinkedList", "d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9", null ],
|
||||
[ "printLinkedList", "d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2", null ],
|
||||
[ "sublistSearch", "d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c", null ],
|
||||
[ "test", "d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
|
||||
];
|
||||
@@ -0,0 +1,11 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,68,56,95"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="797,43,869,69"/>
|
||||
<area shape="rect" id="node3" href="$d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self-test implementations." alt="" coords="104,93,148,120"/>
|
||||
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="196,119,339,145"/>
|
||||
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="617,144,727,171"/>
|
||||
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="387,144,547,171"/>
|
||||
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="387,195,547,221"/>
|
||||
<area shape="rect" id="node8" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="387,245,547,272"/>
|
||||
<area shape="rect" id="node9" 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="595,245,749,272"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
8f401a7fcc69e2bbac2b4f7d461211c9
|
||||
@@ -0,0 +1,260 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<!--zoomable 208 -->
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
|
||||
<style type="text/css"><![CDATA[
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="text/javascript"><![CDATA[
|
||||
var edges = document.getElementsByTagName('g');
|
||||
if (edges && edges.length) {
|
||||
for (var i=0;i<edges.length;i++) {
|
||||
if (edges[i].id.substr(0,4)=='edge') {
|
||||
edges[i].setAttribute('class','edge');
|
||||
}
|
||||
}
|
||||
}
|
||||
]]></script>
|
||||
<defs>
|
||||
<circle id="rim" cx="0" cy="0" r="7"/>
|
||||
<circle id="rim2" cx="0" cy="0" r="3.5"/>
|
||||
<g id="zoomPlus">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="zoomMin">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="dirArrow">
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="resetDef">
|
||||
<use xlink:href="#rim2" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
|
||||
</use>
|
||||
</g>
|
||||
</defs>
|
||||
|
||||
<script type="text/javascript">
|
||||
var viewWidth = 656;
|
||||
var viewHeight = 208;
|
||||
var sectionId = 'dynsection-1';
|
||||
</script>
|
||||
<script xlink:href="../../svgpan.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="viewport">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 652,-204 652,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Main function.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-133.5 0,-152.5 38,-152.5 38,-133.5 0,-133.5"/>
|
||||
<text text-anchor="middle" x="19" y="-140.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="594,-152.5 594,-171.5 648,-171.5 648,-152.5 594,-152.5"/>
|
||||
<text text-anchor="middle" x="621" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M37.33,-152.67C68.15,-168.93 134.95,-200 195.5,-200 195.5,-200 195.5,-200 347,-200 432.51,-200 531.65,-181.49 583.74,-170.3"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="584.79,-173.66 593.81,-168.11 583.3,-166.82 584.79,-173.66"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self-test implementations.">
|
||||
<polygon fill="white" stroke="black" points="74,-114.5 74,-133.5 107,-133.5 107,-114.5 74,-114.5"/>
|
||||
<text text-anchor="middle" x="90.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.26,-138.01C46.15,-135.85 55.52,-133.29 64.07,-130.95"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="65.23,-134.26 73.95,-128.25 63.38,-127.51 65.23,-134.26"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
|
||||
<polygon fill="white" stroke="black" points="143,-95.5 143,-114.5 250,-114.5 250,-95.5 143,-95.5"/>
|
||||
<text text-anchor="middle" x="196.5" y="-102.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.3,-121.11C114.55,-119.79 123.67,-118.12 133.27,-116.37"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="134.19,-119.76 143.4,-114.52 132.93,-112.87 134.19,-119.76"/>
|
||||
</g>
|
||||
<!-- Node4->Node2 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M243.78,-114.53C257.35,-117.15 272.24,-119.86 286,-122 394.01,-138.82 522.62,-152.43 583.97,-158.53"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="583.63,-162.01 593.93,-159.51 584.32,-155.05 583.63,-162.01"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="458.5,-76.5 458.5,-95.5 541.5,-95.5 541.5,-76.5 458.5,-76.5"/>
|
||||
<text text-anchor="middle" x="500" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node5 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node4->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M250.35,-107.93C292.58,-109.56 353.24,-110.33 406,-105 420.78,-103.51 436.68,-100.71 451.07,-97.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="452.22,-101.04 461.26,-95.51 450.74,-94.2 452.22,-101.04"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
|
||||
<polygon fill="white" stroke="black" points="286,-76.5 286,-95.5 406,-95.5 406,-76.5 286,-76.5"/>
|
||||
<text text-anchor="middle" x="346" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node6 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node4->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M250.33,-98.19C258.59,-97.13 267.23,-96.02 275.79,-94.92"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="276.3,-98.38 285.77,-93.63 275.41,-91.44 276.3,-98.38"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="286,-38.5 286,-57.5 406,-57.5 406,-38.5 286,-38.5"/>
|
||||
<text text-anchor="middle" x="346" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node7 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node4->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M218.37,-95.38C236.17,-87.34 262.51,-75.8 286,-67 291.68,-64.87 297.72,-62.76 303.69,-60.76"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="305.17,-63.96 313.58,-57.51 302.99,-57.3 305.17,-63.96"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="286,-0.5 286,-19.5 406,-19.5 406,-0.5 286,-0.5"/>
|
||||
<text text-anchor="middle" x="346" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node8 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node4->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M206.12,-95.45C220.97,-79.53 252.96,-47.51 286,-29 289.75,-26.9 293.77,-24.99 297.87,-23.27"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="299.45,-26.41 307.54,-19.58 296.95,-19.87 299.45,-26.41"/>
|
||||
</g>
|
||||
<!-- Node5->Node2 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node5->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M516.07,-95.63C536.37,-108.59 572.69,-131.79 596.57,-147.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="594.74,-150.02 605.05,-152.45 598.51,-144.12 594.74,-150.02"/>
|
||||
</g>
|
||||
<!-- Node6->Node5 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node6->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M406.2,-86C420.02,-86 434.62,-86 448.04,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="448.04,-89.5 458.04,-86 448.04,-82.5 448.04,-89.5"/>
|
||||
</g>
|
||||
<!-- Node7->Node5 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node7->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M385.36,-57.59C405.32,-62.58 429.93,-68.73 451.13,-74.03"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="450.37,-77.45 460.92,-76.48 452.07,-70.66 450.37,-77.45"/>
|
||||
</g>
|
||||
<!-- Node8->Node5 -->
|
||||
<g id="edge12" class="edge">
|
||||
<title>Node8->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M381.53,-19.6C389.7,-22.28 398.28,-25.45 406,-29 431.61,-40.77 458.88,-58.12 477.22,-70.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="475.48,-73.64 485.7,-76.44 479.46,-67.88 475.48,-73.64"/>
|
||||
</g>
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="442,-0.5 442,-19.5 558,-19.5 558,-0.5 442,-0.5"/>
|
||||
<text text-anchor="middle" x="500" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node8->Node9 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node8->Node9</title>
|
||||
<path fill="none" stroke="midnightblue" d="M406.2,-10C414.5,-10 423.08,-10 431.51,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="431.7,-13.5 441.7,-10 431.7,-6.5 431.7,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
<g id="navigator" transform="translate(0 0)" fill="#404254">
|
||||
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
|
||||
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
|
||||
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
|
||||
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
|
||||
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
</g>
|
||||
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
|
||||
<g id="arrow_out" transform="scale(0.3 0.3)">
|
||||
<a xlink:href="sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg" target="_base">
|
||||
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
|
||||
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
|
||||
<path id="arrow"
|
||||
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
|
||||
style="fill:#404040;"/>
|
||||
</a>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 14 KiB |
@@ -0,0 +1,172 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="656pt" height="208pt"
|
||||
viewBox="0.00 0.00 656.00 208.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 204)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 652,-204 652,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Main function.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-133.5 0,-152.5 38,-152.5 38,-133.5 0,-133.5"/>
|
||||
<text text-anchor="middle" x="19" y="-140.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="594,-152.5 594,-171.5 648,-171.5 648,-152.5 594,-152.5"/>
|
||||
<text text-anchor="middle" x="621" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M37.33,-152.67C68.15,-168.93 134.95,-200 195.5,-200 195.5,-200 195.5,-200 347,-200 432.51,-200 531.65,-181.49 583.74,-170.3"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="584.79,-173.66 593.81,-168.11 583.3,-166.82 584.79,-173.66"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self-test implementations.">
|
||||
<polygon fill="white" stroke="black" points="74,-114.5 74,-133.5 107,-133.5 107,-114.5 74,-114.5"/>
|
||||
<text text-anchor="middle" x="90.5" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.26,-138.01C46.15,-135.85 55.52,-133.29 64.07,-130.95"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="65.23,-134.26 73.95,-128.25 63.38,-127.51 65.23,-134.26"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
|
||||
<polygon fill="white" stroke="black" points="143,-95.5 143,-114.5 250,-114.5 250,-95.5 143,-95.5"/>
|
||||
<text text-anchor="middle" x="196.5" y="-102.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.3,-121.11C114.55,-119.79 123.67,-118.12 133.27,-116.37"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="134.19,-119.76 143.4,-114.52 132.93,-112.87 134.19,-119.76"/>
|
||||
</g>
|
||||
<!-- Node4->Node2 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M243.78,-114.53C257.35,-117.15 272.24,-119.86 286,-122 394.01,-138.82 522.62,-152.43 583.97,-158.53"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="583.63,-162.01 593.93,-159.51 584.32,-155.05 583.63,-162.01"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="458.5,-76.5 458.5,-95.5 541.5,-95.5 541.5,-76.5 458.5,-76.5"/>
|
||||
<text text-anchor="middle" x="500" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node5 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node4->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M250.35,-107.93C292.58,-109.56 353.24,-110.33 406,-105 420.78,-103.51 436.68,-100.71 451.07,-97.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="452.22,-101.04 461.26,-95.51 450.74,-94.2 452.22,-101.04"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
|
||||
<polygon fill="white" stroke="black" points="286,-76.5 286,-95.5 406,-95.5 406,-76.5 286,-76.5"/>
|
||||
<text text-anchor="middle" x="346" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node6 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node4->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M250.33,-98.19C258.59,-97.13 267.23,-96.02 275.79,-94.92"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="276.3,-98.38 285.77,-93.63 275.41,-91.44 276.3,-98.38"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="286,-38.5 286,-57.5 406,-57.5 406,-38.5 286,-38.5"/>
|
||||
<text text-anchor="middle" x="346" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node7 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node4->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M218.37,-95.38C236.17,-87.34 262.51,-75.8 286,-67 291.68,-64.87 297.72,-62.76 303.69,-60.76"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="305.17,-63.96 313.58,-57.51 302.99,-57.3 305.17,-63.96"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="286,-0.5 286,-19.5 406,-19.5 406,-0.5 286,-0.5"/>
|
||||
<text text-anchor="middle" x="346" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node8 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node4->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M206.12,-95.45C220.97,-79.53 252.96,-47.51 286,-29 289.75,-26.9 293.77,-24.99 297.87,-23.27"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="299.45,-26.41 307.54,-19.58 296.95,-19.87 299.45,-26.41"/>
|
||||
</g>
|
||||
<!-- Node5->Node2 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node5->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M516.07,-95.63C536.37,-108.59 572.69,-131.79 596.57,-147.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="594.74,-150.02 605.05,-152.45 598.51,-144.12 594.74,-150.02"/>
|
||||
</g>
|
||||
<!-- Node6->Node5 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node6->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M406.2,-86C420.02,-86 434.62,-86 448.04,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="448.04,-89.5 458.04,-86 448.04,-82.5 448.04,-89.5"/>
|
||||
</g>
|
||||
<!-- Node7->Node5 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node7->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M385.36,-57.59C405.32,-62.58 429.93,-68.73 451.13,-74.03"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="450.37,-77.45 460.92,-76.48 452.07,-70.66 450.37,-77.45"/>
|
||||
</g>
|
||||
<!-- Node8->Node5 -->
|
||||
<g id="edge12" class="edge">
|
||||
<title>Node8->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M381.53,-19.6C389.7,-22.28 398.28,-25.45 406,-29 431.61,-40.77 458.88,-58.12 477.22,-70.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="475.48,-73.64 485.7,-76.44 479.46,-67.88 475.48,-73.64"/>
|
||||
</g>
|
||||
<!-- Node9 -->
|
||||
<g id="node9" class="node">
|
||||
<title>Node9</title>
|
||||
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="442,-0.5 442,-19.5 558,-19.5 558,-0.5 442,-0.5"/>
|
||||
<text text-anchor="middle" x="500" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node8->Node9 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node8->Node9</title>
|
||||
<path fill="none" stroke="midnightblue" d="M406.2,-10C414.5,-10 423.08,-10 431.51,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="431.7,-13.5 441.7,-10 431.7,-6.5 431.7,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 8.8 KiB |
@@ -0,0 +1,3 @@
|
||||
<map id="search::sublist_search::sublistSearch" name="search::sublist_search::sublistSearch">
|
||||
<area shape="rect" id="node1" title="Main searching function." alt="" coords="5,29,159,71"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
7577453afaeec0dd5d0df2b15014b511
|
||||
@@ -0,0 +1,29 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: search::sublist_search::sublistSearch Pages: 1 -->
|
||||
<svg width="123pt" height="57pt"
|
||||
viewBox="0.00 0.00 123.00 57.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 53)">
|
||||
<title>search::sublist_search::sublistSearch</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 119,-53 119,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Main searching function.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 115,-30.5 115,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
|
||||
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::sublistSearch</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M37.63,-30.66C32.84,-40.06 39.46,-49 57.5,-49 68.49,-49 75.24,-45.68 77.76,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="81.24,-40.52 77.37,-30.66 74.25,-40.78 81.24,-40.52"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.4 KiB |
@@ -0,0 +1,10 @@
|
||||
<map id="test" name="test">
|
||||
<area shape="rect" id="node1" title="Self-test implementations." alt="" coords="5,57,49,83"/>
|
||||
<area shape="rect" id="node2" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,57,240,83"/>
|
||||
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="699,6,771,33"/>
|
||||
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="518,57,629,83"/>
|
||||
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="288,57,448,83"/>
|
||||
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="288,107,448,134"/>
|
||||
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="288,158,448,185"/>
|
||||
<area shape="rect" id="node8" 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="496,158,651,185"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
59cc849d5912d57ceb7252b3490d7478
|
||||
@@ -0,0 +1,239 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: test Pages: 1 -->
|
||||
<!--zoomable 143 -->
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
|
||||
<style type="text/css"><![CDATA[
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="text/javascript"><![CDATA[
|
||||
var edges = document.getElementsByTagName('g');
|
||||
if (edges && edges.length) {
|
||||
for (var i=0;i<edges.length;i++) {
|
||||
if (edges[i].id.substr(0,4)=='edge') {
|
||||
edges[i].setAttribute('class','edge');
|
||||
}
|
||||
}
|
||||
}
|
||||
]]></script>
|
||||
<defs>
|
||||
<circle id="rim" cx="0" cy="0" r="7"/>
|
||||
<circle id="rim2" cx="0" cy="0" r="3.5"/>
|
||||
<g id="zoomPlus">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="zoomMin">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="dirArrow">
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="resetDef">
|
||||
<use xlink:href="#rim2" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
|
||||
</use>
|
||||
</g>
|
||||
</defs>
|
||||
|
||||
<script type="text/javascript">
|
||||
var viewWidth = 582;
|
||||
var viewHeight = 143;
|
||||
var sectionId = 'dynsection-5';
|
||||
</script>
|
||||
<script xlink:href="../../svgpan.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="viewport">
|
||||
<title>test</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 578,-138.53 578,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Self-test implementations.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 33,-95.5 33,-76.5 0,-76.5"/>
|
||||
<text text-anchor="middle" x="16.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
|
||||
<polygon fill="white" stroke="black" points="69,-76.5 69,-95.5 176,-95.5 176,-76.5 69,-76.5"/>
|
||||
<text text-anchor="middle" x="122.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M33.3,-86C40.46,-86 49.46,-86 58.94,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="58.94,-89.5 68.94,-86 58.94,-82.5 58.94,-89.5"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="520,-114.5 520,-133.5 574,-133.5 574,-114.5 520,-114.5"/>
|
||||
<text text-anchor="middle" x="547" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M141.88,-95.59C159.37,-104.14 186.7,-116.06 212,-121 318.53,-141.8 447.83,-133.79 509.65,-127.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="510.08,-131.45 519.69,-127 509.4,-124.48 510.08,-131.45"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="384.5,-76.5 384.5,-95.5 467.5,-95.5 467.5,-76.5 384.5,-76.5"/>
|
||||
<text text-anchor="middle" x="426" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 265.04,-110.63 278.94,-110.36 332,-105 346.78,-103.51 362.68,-100.71 377.07,-97.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="378.22,-101.04 387.26,-95.51 376.74,-94.2 378.22,-101.04"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
|
||||
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 332,-95.5 332,-76.5 212,-76.5"/>
|
||||
<text text-anchor="middle" x="272" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M176.33,-86C184.5,-86 193.05,-86 201.51,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="201.77,-89.5 211.77,-86 201.77,-82.5 201.77,-89.5"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="212,-38.5 212,-57.5 332,-57.5 332,-38.5 212,-38.5"/>
|
||||
<text text-anchor="middle" x="272" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M160.72,-76.41C180.01,-71.44 203.76,-65.32 224.27,-60.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="225.24,-63.4 234.05,-57.52 223.49,-56.63 225.24,-63.4"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="212,-0.5 212,-19.5 332,-19.5 332,-0.5 212,-0.5"/>
|
||||
<text text-anchor="middle" x="272" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node7 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node2->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M136.08,-76.39C152.7,-64.04 183.25,-42.6 212,-29 216.62,-26.81 221.56,-24.78 226.54,-22.93"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="227.82,-26.19 236.1,-19.58 225.5,-19.58 227.82,-26.19"/>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M457.03,-95.59C473.14,-100.74 493.12,-107.11 510.06,-112.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="509.04,-115.87 519.63,-115.58 511.17,-109.2 509.04,-115.87"/>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.2,-86C346.02,-86 360.62,-86 374.04,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="374.04,-89.5 384.04,-86 374.04,-82.5 374.04,-89.5"/>
|
||||
</g>
|
||||
<!-- Node6->Node4 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node6->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M311.36,-57.59C331.32,-62.58 355.93,-68.73 377.13,-74.03"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="376.37,-77.45 386.92,-76.48 378.07,-70.66 376.37,-77.45"/>
|
||||
</g>
|
||||
<!-- Node7->Node4 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node7->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M307.53,-19.6C315.7,-22.28 324.28,-25.45 332,-29 357.61,-40.77 384.88,-58.12 403.22,-70.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="401.48,-73.64 411.7,-76.44 405.46,-67.88 401.48,-73.64"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="368,-0.5 368,-19.5 484,-19.5 484,-0.5 368,-0.5"/>
|
||||
<text text-anchor="middle" x="426" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node7->Node8 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node7->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.2,-10C340.5,-10 349.08,-10 357.51,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="357.7,-13.5 367.7,-10 357.7,-6.5 357.7,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
<g id="navigator" transform="translate(0 0)" fill="#404254">
|
||||
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
|
||||
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
|
||||
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
|
||||
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
|
||||
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
</g>
|
||||
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
|
||||
<g id="arrow_out" transform="scale(0.3 0.3)">
|
||||
<a xlink:href="sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg" target="_base">
|
||||
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
|
||||
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
|
||||
<path id="arrow"
|
||||
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
|
||||
style="fill:#404040;"/>
|
||||
</a>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 13 KiB |
@@ -0,0 +1,151 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: test Pages: 1 -->
|
||||
<svg width="582pt" height="143pt"
|
||||
viewBox="0.00 0.00 582.00 142.53" 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 138.53)">
|
||||
<title>test</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 578,-138.53 578,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Self-test implementations.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 33,-95.5 33,-76.5 0,-76.5"/>
|
||||
<text text-anchor="middle" x="16.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
|
||||
<polygon fill="white" stroke="black" points="69,-76.5 69,-95.5 176,-95.5 176,-76.5 69,-76.5"/>
|
||||
<text text-anchor="middle" x="122.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M33.3,-86C40.46,-86 49.46,-86 58.94,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="58.94,-89.5 68.94,-86 58.94,-82.5 58.94,-89.5"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="520,-114.5 520,-133.5 574,-133.5 574,-114.5 520,-114.5"/>
|
||||
<text text-anchor="middle" x="547" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M141.88,-95.59C159.37,-104.14 186.7,-116.06 212,-121 318.53,-141.8 447.83,-133.79 509.65,-127.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="510.08,-131.45 519.69,-127 509.4,-124.48 510.08,-131.45"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="384.5,-76.5 384.5,-95.5 467.5,-95.5 467.5,-76.5 384.5,-76.5"/>
|
||||
<text text-anchor="middle" x="426" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 265.04,-110.63 278.94,-110.36 332,-105 346.78,-103.51 362.68,-100.71 377.07,-97.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="378.22,-101.04 387.26,-95.51 376.74,-94.2 378.22,-101.04"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
|
||||
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 332,-95.5 332,-76.5 212,-76.5"/>
|
||||
<text text-anchor="middle" x="272" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M176.33,-86C184.5,-86 193.05,-86 201.51,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="201.77,-89.5 211.77,-86 201.77,-82.5 201.77,-89.5"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="212,-38.5 212,-57.5 332,-57.5 332,-38.5 212,-38.5"/>
|
||||
<text text-anchor="middle" x="272" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M160.72,-76.41C180.01,-71.44 203.76,-65.32 224.27,-60.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="225.24,-63.4 234.05,-57.52 223.49,-56.63 225.24,-63.4"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="212,-0.5 212,-19.5 332,-19.5 332,-0.5 212,-0.5"/>
|
||||
<text text-anchor="middle" x="272" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node7 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node2->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M136.08,-76.39C152.7,-64.04 183.25,-42.6 212,-29 216.62,-26.81 221.56,-24.78 226.54,-22.93"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="227.82,-26.19 236.1,-19.58 225.5,-19.58 227.82,-26.19"/>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M457.03,-95.59C473.14,-100.74 493.12,-107.11 510.06,-112.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="509.04,-115.87 519.63,-115.58 511.17,-109.2 509.04,-115.87"/>
|
||||
</g>
|
||||
<!-- Node5->Node4 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node5->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.2,-86C346.02,-86 360.62,-86 374.04,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="374.04,-89.5 384.04,-86 374.04,-82.5 374.04,-89.5"/>
|
||||
</g>
|
||||
<!-- Node6->Node4 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node6->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M311.36,-57.59C331.32,-62.58 355.93,-68.73 377.13,-74.03"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="376.37,-77.45 386.92,-76.48 378.07,-70.66 376.37,-77.45"/>
|
||||
</g>
|
||||
<!-- Node7->Node4 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node7->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M307.53,-19.6C315.7,-22.28 324.28,-25.45 332,-29 357.61,-40.77 384.88,-58.12 403.22,-70.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="401.48,-73.64 411.7,-76.44 405.46,-67.88 401.48,-73.64"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="368,-0.5 368,-19.5 484,-19.5 484,-0.5 368,-0.5"/>
|
||||
<text text-anchor="middle" x="426" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node7->Node8 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node7->Node8</title>
|
||||
<path fill="none" stroke="midnightblue" d="M332.2,-10C340.5,-10 349.08,-10 357.51,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="357.7,-13.5 367.7,-10 357.7,-6.5 357.7,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 7.6 KiB |
@@ -0,0 +1,3 @@
|
||||
<map id="search::sublist_search::makeLinkedList" name="search::sublist_search::makeLinkedList">
|
||||
<area shape="rect" id="node1" title="Give a vector of data, it adds each element of vector in the linked list and return the address of he..." alt="" coords="5,29,159,71"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
8e9042ad8338865868a933aec2ee7aa8
|
||||
@@ -0,0 +1,29 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: search::sublist_search::makeLinkedList Pages: 1 -->
|
||||
<svg width="123pt" height="57pt"
|
||||
viewBox="0.00 0.00 123.00 57.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 53)">
|
||||
<title>search::sublist_search::makeLinkedList</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 119,-53 119,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Give a vector of data, it adds each element of vector in the linked list and return the address of he...">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 115,-30.5 115,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
|
||||
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::makeLinkedList</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M37.63,-30.66C32.84,-40.06 39.46,-49 57.5,-49 68.49,-49 75.24,-45.68 77.76,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="81.24,-40.52 77.37,-30.66 74.25,-40.78 81.24,-40.52"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.5 KiB |
@@ -0,0 +1,4 @@
|
||||
<map id="search::sublist_search::printLinkedList" name="search::sublist_search::printLinkedList">
|
||||
<area shape="rect" id="node1" title="A simple function to print the linked list." alt="" coords="5,29,159,71"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="207,37,279,63"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
bec862af2f877079f239e276fbcda98a
|
||||
@@ -0,0 +1,44 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: search::sublist_search::printLinkedList Pages: 1 -->
|
||||
<svg width="213pt" height="57pt"
|
||||
viewBox="0.00 0.00 213.00 57.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 53)">
|
||||
<title>search::sublist_search::printLinkedList</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-53 209,-53 209,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="A simple function to print the linked list.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 115,-30.5 115,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
|
||||
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::printLinkedList</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M36.59,-30.66C31.54,-40.06 38.52,-49 57.5,-49 69.07,-49 76.18,-45.68 78.82,-40.96"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="82.31,-40.51 78.41,-30.66 75.31,-40.79 82.31,-40.51"/>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="151,-6 151,-25 205,-25 205,-6 151,-6"/>
|
||||
<text text-anchor="middle" x="178" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M115.32,-15.5C123.99,-15.5 132.74,-15.5 140.8,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="140.96,-19 150.96,-15.5 140.96,-12 140.96,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.1 KiB |
@@ -99,7 +99,7 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>a class containing the necessary test cases
|
||||
<p>class encapsulating the necessary test cases
|
||||
<a href="../../d5/d58/class_test_cases.html#details">More...</a></p>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
|
||||
@@ -108,6 +108,18 @@ Public Member Functions</h2></td></tr>
|
||||
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft"> </td><td class="mdescRight">Executes test cases. <a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">More...</a><br /></td></tr>
|
||||
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
|
||||
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft"> </td><td class="mdescRight">A test case contains edge case, Only contains one element. <a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">More...</a><br /></td></tr>
|
||||
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
|
||||
<tr class="memdesc:abae0148985f159b582a385cf399254e3"><td class="mdescLeft"> </td><td class="mdescRight">A test case which contains main list of 100 elements and sublist of 20. <a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">More...</a><br /></td></tr>
|
||||
<tr class="separator:abae0148985f159b582a385cf399254e3"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
|
||||
<tr class="memdesc:ad9f95c09931625b41e3be1f88d1e28c5"><td class="mdescLeft"> </td><td class="mdescRight">A test case which contains main list of 50 elements and sublist of 20. <a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">More...</a><br /></td></tr>
|
||||
<tr class="separator:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
|
||||
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft"> </td><td class="mdescRight">Executes test cases. <a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">More...</a><br /></td></tr>
|
||||
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
|
||||
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft"> </td><td class="mdescRight">A test case with single input. <a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">More...</a><br /></td></tr>
|
||||
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
|
||||
@@ -121,14 +133,68 @@ Public Member Functions</h2></td></tr>
|
||||
Private Member Functions</h2></td></tr>
|
||||
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
|
||||
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
|
||||
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft"> </td><td class="mdescRight">A function to print given message on console. <a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">More...</a><br /></td></tr>
|
||||
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template<typename T > </td></tr>
|
||||
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
|
||||
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft"> </td><td class="mdescRight">A function to print64_t given message on console. <a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">More...</a><br /></td></tr>
|
||||
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><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 class containing the necessary test cases </p>
|
||||
<div class="textblock"><p>class encapsulating the necessary test cases </p>
|
||||
<p>a class containing the necessary test cases </p>
|
||||
</div><h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">◆ </a></span>log()</h2>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">◆ </a></span>log() <span class="overload">[1/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<div class="memtemplate">
|
||||
template<typename T > </div>
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void TestCases::log </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">T </td>
|
||||
<td class="paramname"><em>msg</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A function to print given message on console. </p>
|
||||
<dl class="tparams"><dt>Template Parameters</dt><dd>
|
||||
<table class="tparams">
|
||||
<tr><td class="paramname">T</td><td>Type of the given message. </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  {</div>
|
||||
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// It's just to avoid writing cout and endl</span></div>
|
||||
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"[TESTS] : ---> "</span> << msg << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
</div><!-- 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="../../d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg" width="242" height="38"><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="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">◆ </a></span>log() <span class="overload">[2/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
@@ -165,8 +231,6 @@ template<typename T > </div>
|
||||
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// It's just to avoid writing cout and endl</span></div>
|
||||
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"[TESTS] : ---> "</span> << msg << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -177,7 +241,55 @@ Here is the call graph for this function:</div>
|
||||
</div>
|
||||
</div>
|
||||
<a id="aeabea90c02f9159e4a784bbf736e1e23"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">◆ </a></span>runTests()</h2>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">◆ </a></span>runTests() <span class="overload">[1/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void TestCases::runTests </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Executes test cases. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  {</div>
|
||||
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Running Tests..."</span>);</div>
|
||||
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  </div>
|
||||
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
|
||||
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
|
||||
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <a class="code" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
|
||||
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
||||
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Test Cases over!"</span>);</div>
|
||||
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div>
|
||||
<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:161</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:229</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, Only contains one element.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:186</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:280</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="aeabea90c02f9159e4a784bbf736e1e23"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">◆ </a></span>runTests() <span class="overload">[2/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
@@ -211,21 +323,99 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Test Cases over!"</span>);</div>
|
||||
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
||||
<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print64_t given message on console.</div><div class="ttdef"><b>Definition:</b> random_pivot_quick_sort.cpp:169</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case with input array of length 500.</div><div class="ttdef"><b>Definition:</b> random_pivot_quick_sort.cpp:223</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case with single input.</div><div class="ttdef"><b>Definition:</b> random_pivot_quick_sort.cpp:194</div></div>
|
||||
<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case with array of length 1000.</div><div class="ttdef"><b>Definition:</b> random_pivot_quick_sort.cpp:252</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="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="640" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ac2636e8b5b9e053374c45bfcf0603008"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">◆ </a></span>testCase_1()</h2>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">◆ </a></span>testCase_1() <span class="overload">[1/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void TestCases::testCase_1 </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A test case contains edge case, Only contains one element. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<p>< Expected output of this test</p>
|
||||
<p>< Data to make linked list which will be the sublist</p>
|
||||
<p>< Data to make linked list which will be the main list</p>
|
||||
<p>< Sublist to be searched</p>
|
||||
<p>< Main list in which sublist is to be searched</p>
|
||||
<p>< boolean, if sublist exist or not</p>
|
||||
<div class="fragment"><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  {</div>
|
||||
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>; <span class="comment">///< Expected output of this test</span></div>
|
||||
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  </div>
|
||||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
||||
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="stringliteral">"~"</span>);</div>
|
||||
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 1 for sublist search Algorithm : "</span>);</div>
|
||||
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
||||
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" EDGE CASE : Only contains one element"</span>);</div>
|
||||
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div>
|
||||
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> sublistData = {</div>
|
||||
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  6}; <span class="comment">///< Data to make linked list which will be the sublist</span></div>
|
||||
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> mainlistData = {</div>
|
||||
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  2, 5, 6, 7,</div>
|
||||
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  8}; <span class="comment">///< Data to make linked list which will be the main list</span></div>
|
||||
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  </div>
|
||||
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <a class="code" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
|
||||
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a>(</div>
|
||||
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  sublistData); <span class="comment">///< Sublist to be searched</span></div>
|
||||
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
|
||||
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a>(</div>
|
||||
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  mainlistData); <span class="comment">///< Main list in which sublist is to be</span><span class="comment"></span></div>
|
||||
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="comment"> ///< searched</span></div>
|
||||
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordtype">bool</span> <a class="code" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
|
||||
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  sublistLL, mainlistLL); <span class="comment">///< boolean, if sublist exist or not</span></div>
|
||||
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  </div>
|
||||
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
||||
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  assert(exists == expectedOutput);</div>
|
||||
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
||||
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
|
||||
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 1 PASS!"</span>);</div>
|
||||
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
||||
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="stringliteral">"~"</span>);</div>
|
||||
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  </div>
|
||||
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keyword">delete</span> (sublistLL);</div>
|
||||
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keyword">delete</span> (mainlistLL);</div>
|
||||
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div>
|
||||
<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:47</div></div>
|
||||
<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:100</div></div>
|
||||
<div class="ttc" id="asublist__search_8cpp_html_ab4054b9ab80a5e609b6fcdf70f2e03b9"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector< uint64_t > &data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:73</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< uint64_t ></a></div></div>
|
||||
<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &str, const std::unordered_set< std::string > &strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition:</b> word_break.cpp:60</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="../../d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg" width="450" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ac2636e8b5b9e053374c45bfcf0603008"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">◆ </a></span>testCase_1() <span class="overload">[2/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
@@ -288,7 +478,94 @@ Here is the call graph for this function:</div>
|
||||
</div>
|
||||
</div>
|
||||
<a id="abae0148985f159b582a385cf399254e3"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">◆ </a></span>testCase_2()</h2>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">◆ </a></span>testCase_2() <span class="overload">[1/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void TestCases::testCase_2 </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A test case which contains main list of 100 elements and sublist of 20. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<p>Expected output of this test</p>
|
||||
<p>< Data to make linked list which will be the sublist</p>
|
||||
<p>< Main list in which sublist is to be searched</p>
|
||||
<p>Inserts 100 elements in main list</p>
|
||||
<p>Inserts 20 elements in sublist</p>
|
||||
<p>< Sublist to be searched</p>
|
||||
<p>< Main list in which sublist is to be searched</p>
|
||||
<p>< boolean, if sublist exist or not</p>
|
||||
<div class="fragment"><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  {</div>
|
||||
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">true</span>; <span class="comment">/// Expected output of this test</span></div>
|
||||
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  </div>
|
||||
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
||||
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="stringliteral">"~"</span>);</div>
|
||||
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 2 for sublist search Algorithm : "</span>);</div>
|
||||
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
||||
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" contains main list of 100 elements and sublist of 20"</span>);</div>
|
||||
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  </div>
|
||||
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> sublistData(</div>
|
||||
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  20); <span class="comment">///< Data to make linked list which will be the sublist</span></div>
|
||||
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> mainlistData(</div>
|
||||
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  100); <span class="comment">///< Main list in which sublist is to be searched</span></div>
|
||||
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  </div>
|
||||
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 100; i++) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span> <span class="comment"> /// Inserts 100 elements in main list</span></div>
|
||||
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span> <span class="comment"></span> mainlistData[i] = i + 1;</div>
|
||||
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div>
|
||||
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  </div>
|
||||
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordtype">int</span> temp = 0;</div>
|
||||
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i < 65; i++) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> <span class="comment"> /// Inserts 20 elements in sublist</span></div>
|
||||
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="comment"></span> sublistData[temp] = i + 1;</div>
|
||||
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  temp++;</div>
|
||||
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }</div>
|
||||
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  </div>
|
||||
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <a class="code" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
|
||||
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a>(</div>
|
||||
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  sublistData); <span class="comment">///< Sublist to be searched</span></div>
|
||||
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <a class="code" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
|
||||
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a>(</div>
|
||||
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  mainlistData); <span class="comment">///< Main list in which sublist is to be</span><span class="comment"></span></div>
|
||||
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment"> ///< searched</span></div>
|
||||
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordtype">bool</span> <a class="code" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
|
||||
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  sublistLL, mainlistLL); <span class="comment">///< boolean, if sublist exist or not</span></div>
|
||||
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  </div>
|
||||
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
||||
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  assert(exists == expectedOutput);</div>
|
||||
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
||||
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  </div>
|
||||
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 2 PASS!"</span>);</div>
|
||||
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
||||
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="stringliteral">"~"</span>);</div>
|
||||
<div class="line"><a name="l00273"></a><span class="lineno"> 273</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="../../d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg" width="450" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="abae0148985f159b582a385cf399254e3"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">◆ </a></span>testCase_2() <span class="overload">[2/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
@@ -346,7 +623,91 @@ Here is the call graph for this function:</div>
|
||||
</div>
|
||||
</div>
|
||||
<a id="ad9f95c09931625b41e3be1f88d1e28c5"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">◆ </a></span>testCase_3()</h2>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">◆ </a></span>testCase_3() <span class="overload">[1/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void TestCases::testCase_3 </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>A test case which contains main list of 50 elements and sublist of 20. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<p>< Expected output of this test</p>
|
||||
<p>< Sublist to be searched</p>
|
||||
<p>< Main list in which sublist is to be searched</p>
|
||||
<p>Inserts 100 elements in main list</p>
|
||||
<p>Inserts 20 elements in sublist</p>
|
||||
<p>< Sublist to be searched</p>
|
||||
<p>< Main list in which sublist is to be searched</p>
|
||||
<p>< boolean, if sublist exist or not</p>
|
||||
<div class="fragment"><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  {</div>
|
||||
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> expectedOutput = <span class="keyword">false</span>; <span class="comment">///< Expected output of this test</span></div>
|
||||
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  </div>
|
||||
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
||||
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="stringliteral">"~"</span>);</div>
|
||||
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"This is test case 3 for sublist search Algorithm : "</span>);</div>
|
||||
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Description:"</span>);</div>
|
||||
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">" contains main list of 50 elements and sublist of 20"</span>);</div>
|
||||
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div>
|
||||
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> sublistData(20); <span class="comment">///< Sublist to be searched</span></div>
|
||||
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<uint64_t></a> mainlistData(</div>
|
||||
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  50); <span class="comment">///< Main list in which sublist is to be searched</span></div>
|
||||
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  </div>
|
||||
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 50; i++) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment"> /// Inserts 100 elements in main list</span></div>
|
||||
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment"></span> mainlistData.push_back(i + 1);</div>
|
||||
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div>
|
||||
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  </div>
|
||||
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 45; i < 65; i++) {<span class="comment"></span></div>
|
||||
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span> <span class="comment"> /// Inserts 20 elements in sublist</span></div>
|
||||
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span> <span class="comment"></span> sublistData.push_back(i + 1);</div>
|
||||
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div>
|
||||
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  </div>
|
||||
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <a class="code" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *sublistLL =</div>
|
||||
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a>(</div>
|
||||
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  sublistData); <span class="comment">///< Sublist to be searched</span></div>
|
||||
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <a class="code" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a> *mainlistLL =</div>
|
||||
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <a class="code" href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a>(</div>
|
||||
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  mainlistData); <span class="comment">///< Main list in which sublist is to be</span><span class="comment"></span></div>
|
||||
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="comment"> ///< searched</span></div>
|
||||
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span> <span class="comment"></span> </div>
|
||||
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keywordtype">bool</span> <a class="code" href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">exists</a> = <a class="code" href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a>(</div>
|
||||
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  sublistLL, mainlistLL); <span class="comment">///< boolean, if sublist exist or not</span></div>
|
||||
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  </div>
|
||||
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Checking assert expression..."</span>);</div>
|
||||
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  assert(exists == expectedOutput);</div>
|
||||
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"Assertion check passed!"</span>);</div>
|
||||
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  </div>
|
||||
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"[PASS] : TEST CASE 3 PASS!"</span>);</div>
|
||||
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">"~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~"</span></div>
|
||||
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="stringliteral">"~"</span>);</div>
|
||||
<div class="line"><a name="l00321"></a><span class="lineno"> 321</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="../../d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg" width="450" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<a id="ad9f95c09931625b41e3be1f88d1e28c5"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">◆ </a></span>testCase_3() <span class="overload">[2/2]</span></h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
@@ -403,7 +764,8 @@ Here is the call graph for this function:</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<hr/>The documentation for this class was generated from the following file:<ul>
|
||||
<hr/>The documentation for this class was generated from the following files:<ul>
|
||||
<li>search/<a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></li>
|
||||
<li>sorting/<a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp.html">random_pivot_quick_sort.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -1,8 +1,13 @@
|
||||
var class_test_cases =
|
||||
[
|
||||
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
|
||||
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
|
||||
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
|
||||
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
|
||||
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
|
||||
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
|
||||
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
|
||||
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
|
||||
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ],
|
||||
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ]
|
||||
];
|
||||
@@ -1 +1 @@
|
||||
5c4ad52b2db897ac65ca6e1267ff64fb
|
||||
3736dd8d8d27dfd96ed5b68fa33f4410
|
||||
@@ -1,7 +1,7 @@
|
||||
<map id="TestCases::testCase_2" name="TestCases::testCase_2">
|
||||
<area shape="rect" id="node1" title="A test case with input array of length 500." alt="" coords="5,56,165,83"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="218,5,319,32"/>
|
||||
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print64_t given message on console." alt="" coords="213,56,324,83"/>
|
||||
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="213,56,324,83"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="214,107,323,133"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="372,56,444,83"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
95573fb2cad90efd7214113bcce1b942
|
||||
8f315590b0b353dd396ce545fcd5cdf6
|
||||
@@ -36,7 +36,7 @@
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print64_t given message on console.">
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="156,-38.5 156,-57.5 239,-57.5 239,-38.5 156,-38.5"/>
|
||||
<text text-anchor="middle" x="197.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.9 KiB After Width: | Height: | Size: 3.9 KiB |
@@ -1,7 +1,7 @@
|
||||
<map id="TestCases::testCase_1" name="TestCases::testCase_1">
|
||||
<area shape="rect" id="node1" title="A test case with single input." alt="" coords="5,56,165,83"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="218,5,319,32"/>
|
||||
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print64_t given message on console." alt="" coords="213,56,324,83"/>
|
||||
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="213,56,324,83"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="214,107,323,133"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="372,56,444,83"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
1441d2f9a53db6169e92145d0b235fb0
|
||||
1c08d6b3e3782565f00093e119013062
|
||||
@@ -36,7 +36,7 @@
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print64_t given message on console.">
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="156,-38.5 156,-57.5 239,-57.5 239,-38.5 156,-38.5"/>
|
||||
<text text-anchor="middle" x="197.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.9 KiB After Width: | Height: | Size: 3.9 KiB |
@@ -1,7 +1,7 @@
|
||||
<map id="TestCases::testCase_3" name="TestCases::testCase_3">
|
||||
<area shape="rect" id="node1" title="A test case with array of length 1000." alt="" coords="5,56,165,83"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="218,5,319,32"/>
|
||||
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print64_t given message on console." alt="" coords="213,56,324,83"/>
|
||||
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="213,56,324,83"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="214,107,323,133"/>
|
||||
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="372,56,444,83"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
644d62dc2dcb683f27212c658d8e1cdc
|
||||
84a86e24872617ba76e94e51175788bf
|
||||
@@ -36,7 +36,7 @@
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print64_t given message on console.">
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="156,-38.5 156,-57.5 239,-57.5 239,-38.5 156,-38.5"/>
|
||||
<text text-anchor="middle" x="197.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.9 KiB After Width: | Height: | Size: 3.9 KiB |
@@ -1,10 +1,9 @@
|
||||
<map id="TestCases::runTests" name="TestCases::runTests">
|
||||
<area shape="rect" id="node1" title="Executes test cases." alt="" coords="5,56,148,83"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="563,5,635,32"/>
|
||||
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print64_t given message on console." alt="" coords="404,56,515,83"/>
|
||||
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case with single input." alt="" coords="196,56,356,83"/>
|
||||
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case with input array of length 500." alt="" coords="196,107,356,133"/>
|
||||
<area shape="rect" id="node8" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case with array of length 1000." alt="" coords="196,157,356,184"/>
|
||||
<area shape="rect" id="node5" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/is_sorted.html#" title=" " alt="" coords="409,107,510,133"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="405,157,514,184"/>
|
||||
<area shape="rect" id="node1" title="Executes test cases." alt="" coords="5,57,148,83"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="607,6,679,33"/>
|
||||
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="426,57,537,83"/>
|
||||
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="196,57,356,83"/>
|
||||
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="196,107,356,134"/>
|
||||
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="196,158,356,185"/>
|
||||
<area shape="rect" id="node7" 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="404,158,559,185"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
e41f280d167b7428005b700d79326dbf
|
||||
bd8192faa178b06571faac8394dab3ce
|
||||
@@ -4,11 +4,57 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: TestCases::runTests Pages: 1 -->
|
||||
<svg width="480pt" height="142pt"
|
||||
viewBox="0.00 0.00 480.00 142.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 138)">
|
||||
<!--zoomable 143 -->
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
|
||||
<style type="text/css"><![CDATA[
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="text/javascript"><![CDATA[
|
||||
var edges = document.getElementsByTagName('g');
|
||||
if (edges && edges.length) {
|
||||
for (var i=0;i<edges.length;i++) {
|
||||
if (edges[i].id.substr(0,4)=='edge') {
|
||||
edges[i].setAttribute('class','edge');
|
||||
}
|
||||
}
|
||||
}
|
||||
]]></script>
|
||||
<defs>
|
||||
<circle id="rim" cx="0" cy="0" r="7"/>
|
||||
<circle id="rim2" cx="0" cy="0" r="3.5"/>
|
||||
<g id="zoomPlus">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="zoomMin">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
|
||||
</use>
|
||||
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="dirArrow">
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="resetDef">
|
||||
<use xlink:href="#rim2" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
|
||||
</use>
|
||||
</g>
|
||||
</defs>
|
||||
|
||||
<script type="text/javascript">
|
||||
var viewWidth = 513;
|
||||
var viewHeight = 143;
|
||||
var sectionId = 'dynsection-2';
|
||||
</script>
|
||||
<script xlink:href="../../svgpan.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="viewport">
|
||||
<title>TestCases::runTests</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 476,-138 476,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 509,-138.53 509,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
@@ -22,36 +68,36 @@
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="418,-114.5 418,-133.5 472,-133.5 472,-114.5 418,-114.5"/>
|
||||
<text text-anchor="middle" x="445" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
<polygon fill="white" stroke="black" points="451,-114.5 451,-133.5 505,-133.5 505,-114.5 451,-114.5"/>
|
||||
<text text-anchor="middle" x="478" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M72.88,-95.58C90.37,-104.14 117.7,-116.05 143,-121 236.95,-139.39 350.58,-133 407.61,-127.87"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="408.28,-131.32 417.91,-126.9 407.63,-124.36 408.28,-131.32"/>
|
||||
<path fill="none" stroke="midnightblue" d="M72.88,-95.59C90.37,-104.14 117.7,-116.06 143,-121 249.53,-141.8 378.83,-133.79 440.65,-127.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="441.08,-131.45 450.69,-127 440.4,-124.48 441.08,-131.45"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print64_t given message on console.">
|
||||
<polygon fill="white" stroke="black" points="299,-76.5 299,-95.5 382,-95.5 382,-76.5 299,-76.5"/>
|
||||
<text text-anchor="middle" x="340.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="315.5,-76.5 315.5,-95.5 398.5,-95.5 398.5,-76.5 315.5,-76.5"/>
|
||||
<text text-anchor="middle" x="357" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 196.04,-110.63 210.06,-111.48 263,-105 274.77,-103.56 287.33,-100.92 298.8,-98.06"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="299.77,-101.42 308.56,-95.51 298,-94.65 299.77,-101.42"/>
|
||||
<path fill="none" stroke="midnightblue" d="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 196.04,-110.63 209.94,-110.36 263,-105 277.78,-103.51 293.68,-100.71 308.07,-97.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="309.22,-101.04 318.26,-95.51 307.74,-94.2 309.22,-101.04"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case with single input.">
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
|
||||
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 263,-95.5 263,-76.5 143,-76.5"/>
|
||||
<text text-anchor="middle" x="203" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
</a>
|
||||
@@ -63,113 +109,116 @@
|
||||
<path fill="none" stroke="midnightblue" d="M107.33,-86C115.5,-86 124.05,-86 132.51,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="132.77,-89.5 142.77,-86 132.77,-82.5 132.77,-89.5"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case with input array of length 500.">
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="143,-38.5 143,-57.5 263,-57.5 263,-38.5 143,-38.5"/>
|
||||
<text text-anchor="middle" x="203" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node7 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node1->Node7</title>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M91.72,-76.41C111.01,-71.44 134.76,-65.32 155.27,-60.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="156.24,-63.4 165.05,-57.52 154.49,-56.63 156.24,-63.4"/>
|
||||
</g>
|
||||
<!-- Node8 -->
|
||||
<g id="node8" class="node">
|
||||
<title>Node8</title>
|
||||
<g id="a_node8"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case with array of length 1000.">
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="143,-0.5 143,-19.5 263,-19.5 263,-0.5 143,-0.5"/>
|
||||
<text text-anchor="middle" x="203" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node8 -->
|
||||
<g id="edge12" class="edge">
|
||||
<title>Node1->Node8</title>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M67.08,-76.39C83.7,-64.04 114.25,-42.6 143,-29 147.62,-26.81 152.56,-24.78 157.54,-22.93"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="158.82,-26.19 167.1,-19.58 156.5,-19.58 158.82,-26.19"/>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M367.37,-95.59C379.87,-100.22 395.07,-105.86 408.62,-110.89"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="407.55,-114.22 418.14,-114.41 409.98,-107.66 407.55,-114.22"/>
|
||||
<path fill="none" stroke="midnightblue" d="M388.03,-95.59C404.14,-100.74 424.12,-107.11 441.06,-112.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="440.04,-115.87 450.63,-115.58 442.17,-109.2 440.04,-115.87"/>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M263.04,-86C271.66,-86 280.47,-86 288.9,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="288.96,-89.5 298.96,-86 288.96,-82.5 288.96,-89.5"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/is_sorted.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="302.5,-38.5 302.5,-57.5 378.5,-57.5 378.5,-38.5 302.5,-38.5"/>
|
||||
<text text-anchor="middle" x="340.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_sorted</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node5 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node4->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M238.19,-76.41C255.6,-71.53 276.97,-65.54 295.59,-60.32"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="296.64,-63.66 305.32,-57.59 294.74,-56.92 296.64,-63.66"/>
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M263.2,-86C277.02,-86 291.62,-86 305.04,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="305.04,-89.5 315.04,-86 305.04,-82.5 305.04,-89.5"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="299.5,-0.5 299.5,-19.5 381.5,-19.5 381.5,-0.5 299.5,-0.5"/>
|
||||
<text text-anchor="middle" x="340.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
|
||||
<!-- Node5->Node3 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node5->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M242.36,-57.59C262.32,-62.58 286.93,-68.73 308.13,-74.03"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="307.37,-77.45 317.92,-76.48 309.07,-70.66 307.37,-77.45"/>
|
||||
</g>
|
||||
<!-- Node6->Node3 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node6->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M238.53,-19.6C246.7,-22.28 255.28,-25.45 263,-29 288.61,-40.77 315.88,-58.12 334.22,-70.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="332.48,-73.64 342.7,-76.44 336.46,-67.88 332.48,-73.64"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="299,-0.5 299,-19.5 415,-19.5 415,-0.5 299,-0.5"/>
|
||||
<text text-anchor="middle" x="357" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4->Node6 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node4->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M243.33,-76.39C250.16,-73.88 256.99,-70.78 263,-67 282.69,-54.6 280.14,-42.62 299,-29 301.23,-27.39 303.61,-25.87 306.06,-24.43"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="307.91,-27.41 315.11,-19.64 304.64,-21.23 307.91,-27.41"/>
|
||||
</g>
|
||||
<!-- Node7->Node3 -->
|
||||
<!-- Node6->Node7 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node7->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M238.19,-57.59C255.6,-62.47 276.97,-68.46 295.59,-73.68"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="294.74,-77.08 305.32,-76.41 296.64,-70.34 294.74,-77.08"/>
|
||||
</g>
|
||||
<!-- Node7->Node5 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node7->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M263.04,-48C272.68,-48 282.55,-48 291.87,-48"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="292.11,-51.5 302.11,-48 292.11,-44.5 292.11,-51.5"/>
|
||||
</g>
|
||||
<!-- Node7->Node6 -->
|
||||
<g id="edge11" class="edge">
|
||||
<title>Node7->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M238.19,-38.41C255.6,-33.53 276.97,-27.54 295.59,-22.32"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="296.64,-25.66 305.32,-19.59 294.74,-18.92 296.64,-25.66"/>
|
||||
</g>
|
||||
<!-- Node8->Node3 -->
|
||||
<g id="edge14" class="edge">
|
||||
<title>Node8->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M243.33,-19.61C250.16,-22.12 256.99,-25.22 263,-29 282.69,-41.4 280.14,-53.38 299,-67 301.23,-68.61 303.61,-70.13 306.06,-71.57"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="304.64,-74.77 315.11,-76.36 307.91,-68.59 304.64,-74.77"/>
|
||||
</g>
|
||||
<!-- Node8->Node5 -->
|
||||
<g id="edge13" class="edge">
|
||||
<title>Node8->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M238.19,-19.59C255.6,-24.47 276.97,-30.46 295.59,-35.68"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="294.74,-39.08 305.32,-38.41 296.64,-32.34 294.74,-39.08"/>
|
||||
</g>
|
||||
<!-- Node8->Node6 -->
|
||||
<g id="edge15" class="edge">
|
||||
<title>Node8->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M263.04,-10C271.76,-10 280.68,-10 289.2,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="289.36,-13.5 299.36,-10 289.36,-6.5 289.36,-13.5"/>
|
||||
<title>Node6->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M263.2,-10C271.5,-10 280.08,-10 288.51,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="288.7,-13.5 298.7,-10 288.7,-6.5 288.7,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
<g id="navigator" transform="translate(0 0)" fill="#404254">
|
||||
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
|
||||
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
|
||||
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
|
||||
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
|
||||
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
|
||||
<use xlink:href="#rim" fill="#404040">
|
||||
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
|
||||
</use>
|
||||
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
</g>
|
||||
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
|
||||
<g id="arrow_out" transform="scale(0.3 0.3)">
|
||||
<a xlink:href="class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg" target="_base">
|
||||
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
|
||||
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
|
||||
<path id="arrow"
|
||||
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
|
||||
style="fill:#404040;"/>
|
||||
</a>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 8.9 KiB After Width: | Height: | Size: 12 KiB |
@@ -0,0 +1,136 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: TestCases::runTests Pages: 1 -->
|
||||
<svg width="513pt" height="143pt"
|
||||
viewBox="0.00 0.00 513.00 142.53" 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 138.53)">
|
||||
<title>TestCases::runTests</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 509,-138.53 509,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Executes test cases.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 107,-95.5 107,-76.5 0,-76.5"/>
|
||||
<text text-anchor="middle" x="53.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="451,-114.5 451,-133.5 505,-133.5 505,-114.5 451,-114.5"/>
|
||||
<text text-anchor="middle" x="478" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M72.88,-95.59C90.37,-104.14 117.7,-116.06 143,-121 249.53,-141.8 378.83,-133.79 440.65,-127.98"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="441.08,-131.45 450.69,-127 440.4,-124.48 441.08,-131.45"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
|
||||
<polygon fill="white" stroke="black" points="315.5,-76.5 315.5,-95.5 398.5,-95.5 398.5,-76.5 315.5,-76.5"/>
|
||||
<text text-anchor="middle" x="357" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 196.04,-110.63 209.94,-110.36 263,-105 277.78,-103.51 293.68,-100.71 308.07,-97.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="309.22,-101.04 318.26,-95.51 307.74,-94.2 309.22,-101.04"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
|
||||
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 263,-95.5 263,-76.5 143,-76.5"/>
|
||||
<text text-anchor="middle" x="203" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.33,-86C115.5,-86 124.05,-86 132.51,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="132.77,-89.5 142.77,-86 132.77,-82.5 132.77,-89.5"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="143,-38.5 143,-57.5 263,-57.5 263,-38.5 143,-38.5"/>
|
||||
<text text-anchor="middle" x="203" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M91.72,-76.41C111.01,-71.44 134.76,-65.32 155.27,-60.04"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="156.24,-63.4 165.05,-57.52 154.49,-56.63 156.24,-63.4"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
|
||||
<polygon fill="white" stroke="black" points="143,-0.5 143,-19.5 263,-19.5 263,-0.5 143,-0.5"/>
|
||||
<text text-anchor="middle" x="203" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node6 -->
|
||||
<g id="edge8" class="edge">
|
||||
<title>Node1->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M67.08,-76.39C83.7,-64.04 114.25,-42.6 143,-29 147.62,-26.81 152.56,-24.78 157.54,-22.93"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="158.82,-26.19 167.1,-19.58 156.5,-19.58 158.82,-26.19"/>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M388.03,-95.59C404.14,-100.74 424.12,-107.11 441.06,-112.52"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="440.04,-115.87 450.63,-115.58 442.17,-109.2 440.04,-115.87"/>
|
||||
</g>
|
||||
<!-- Node4->Node3 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node4->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M263.2,-86C277.02,-86 291.62,-86 305.04,-86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="305.04,-89.5 315.04,-86 305.04,-82.5 305.04,-89.5"/>
|
||||
</g>
|
||||
<!-- Node5->Node3 -->
|
||||
<g id="edge7" class="edge">
|
||||
<title>Node5->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M242.36,-57.59C262.32,-62.58 286.93,-68.73 308.13,-74.03"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="307.37,-77.45 317.92,-76.48 309.07,-70.66 307.37,-77.45"/>
|
||||
</g>
|
||||
<!-- Node6->Node3 -->
|
||||
<g id="edge9" class="edge">
|
||||
<title>Node6->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M238.53,-19.6C246.7,-22.28 255.28,-25.45 263,-29 288.61,-40.77 315.88,-58.12 334.22,-70.59"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="332.48,-73.64 342.7,-76.44 336.46,-67.88 332.48,-73.64"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="299,-0.5 299,-19.5 415,-19.5 415,-0.5 299,-0.5"/>
|
||||
<text text-anchor="middle" x="357" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6->Node7 -->
|
||||
<g id="edge10" class="edge">
|
||||
<title>Node6->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M263.2,-10C271.5,-10 280.08,-10 288.51,-10"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="288.7,-13.5 298.7,-10 288.7,-6.5 288.7,-13.5"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 7.0 KiB |
@@ -401,6 +401,7 @@ Search</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/linear_search.cpp">Linear Search</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/median_search.cpp">Median Search</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/saddleback_search.cpp">Saddleback Search</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/sublist_search.cpp">Sublist Search</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/ternary_search.cpp">Ternary Search</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/text_search.cpp">Text Search</a></li>
|
||||
</ul>
|
||||
|
||||
@@ -136,7 +136,7 @@ Functions</h2></td></tr>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort">Bogosort algorithm</a> </p>
|
||||
<p>In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.</p>
|
||||
<h3><a class="anchor" id="autotoc_md84"></a>
|
||||
<h3><a class="anchor" id="autotoc_md86"></a>
|
||||
Algorithm</h3>
|
||||
<p>Shuffle the array untill array is sorted.</p>
|
||||
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905">Deep Raval</a> </dd></dl>
|
||||
|
||||
6
d7/d92/sublist__search_8cpp__incl.map
Normal file
6
d7/d92/sublist__search_8cpp__incl.map
Normal file
@@ -0,0 +1,6 @@
|
||||
<map id="search/sublist_search.cpp" name="search/sublist_search.cpp">
|
||||
<area shape="rect" id="node1" title="Implementation of the Sublist Search Algorithm" alt="" coords="44,5,219,32"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,80,71,107"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="95,80,167,107"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="191,80,250,107"/>
|
||||
</map>
|
||||
1
d7/d92/sublist__search_8cpp__incl.md5
Normal file
1
d7/d92/sublist__search_8cpp__incl.md5
Normal file
@@ -0,0 +1 @@
|
||||
ee06e2be7a52a6e28f2bfae9950da05a
|
||||
67
d7/d92/sublist__search_8cpp__incl.svg
Normal file
67
d7/d92/sublist__search_8cpp__incl.svg
Normal file
@@ -0,0 +1,67 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: search/sublist_search.cpp Pages: 1 -->
|
||||
<svg width="192pt" height="84pt"
|
||||
viewBox="0.00 0.00 191.50 84.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 80)">
|
||||
<title>search/sublist_search.cpp</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-80 187.5,-80 187.5,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Implementation of the Sublist Search Algorithm">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="29,-56.5 29,-75.5 160,-75.5 160,-56.5 29,-56.5"/>
|
||||
<text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">search/sublist_search.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M83.25,-56.32C72.7,-48.18 56.7,-35.84 44.06,-26.09"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="46.01,-23.17 35.95,-19.83 41.73,-28.71 46.01,-23.17"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="67.5,-0.5 67.5,-19.5 121.5,-19.5 121.5,-0.5 67.5,-0.5"/>
|
||||
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M94.5,-56.08C94.5,-49.01 94.5,-38.86 94.5,-29.99"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="98,-29.75 94.5,-19.75 91,-29.75 98,-29.75"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="139.5,-0.5 139.5,-19.5 183.5,-19.5 183.5,-0.5 139.5,-0.5"/>
|
||||
<text text-anchor="middle" x="161.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M105.26,-56.32C115.27,-48.26 130.39,-36.08 142.43,-26.37"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="144.95,-28.83 150.54,-19.83 140.56,-23.38 144.95,-28.83"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.9 KiB |
@@ -98,10 +98,15 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
|
||||
<p>This is the complete list of members for <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(T msg)</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(T msg)</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
</table></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
|
||||
@@ -101,7 +101,9 @@ $(document).ready(function(){initNavTree('d9/dca/namespacesearch.html','../../')
|
||||
<div class="textblock"><p>Search algorithms. </p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
|
||||
<p>for assert for io operations, and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/pair.html">std::pair</a></p>
|
||||
<p>Algorithms for searching </p>
|
||||
<p>Algorithms for searching</p>
|
||||
<p>for assert for IO operations</p>
|
||||
<p>Searching algorithms </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
|
||||
15
d9/dca/namespacesearch.js
Normal file
15
d9/dca/namespacesearch.js
Normal file
@@ -0,0 +1,15 @@
|
||||
var namespacesearch =
|
||||
[
|
||||
[ "median_search", null, [
|
||||
[ "median_of_medians", "d9/d69/median__search_8cpp.html#a868847218f694e78bf433a0ff7648bae", null ]
|
||||
] ],
|
||||
[ "saddleback", null, [
|
||||
[ "saddleback", "d3/d22/saddleback__search_8cpp.html#a0a2f1f1a4c93bb57e8c16b8d08f26916", null ]
|
||||
] ],
|
||||
[ "sublist_search", null, [
|
||||
[ "Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", "da/d61/structsearch_1_1sublist__search_1_1_node" ],
|
||||
[ "makeLinkedList", "d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9", null ],
|
||||
[ "printLinkedList", "d5/d45/sublist__search_8cpp.html#ad1028bc215281d62e344af99da57fab2", null ],
|
||||
[ "sublistSearch", "d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c", null ]
|
||||
] ]
|
||||
];
|
||||
112
d9/def/namespacesublist__search.html
Normal file
112
d9/def/namespacesublist__search.html
Normal file
@@ -0,0 +1,112 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||||
<meta name="generator" content="Doxygen 1.9.1"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: sublist_search Namespace Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<div id="projectname">Algorithms_in_C++
|
||||
 <span id="projectnumber">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.1 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d9/def/namespacesublist__search.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<iframe src="javascript:void(0)" frameborder="0"
|
||||
name="MSearchResults" id="MSearchResults">
|
||||
</iframe>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle">
|
||||
<div class="title">sublist_search Namespace Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search</a> implementation.
|
||||
<a href="../../d9/def/namespacesublist__search.html#details">More...</a></p>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Functions for the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search</a> implementation. </p>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../d9/def/namespacesublist__search.html">sublist_search</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.1 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
136
da/d61/structsearch_1_1sublist__search_1_1_node.html
Normal file
136
da/d61/structsearch_1_1sublist__search_1_1_node.html
Normal file
@@ -0,0 +1,136 @@
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml">
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
||||
<meta name="generator" content="Doxygen 1.9.1"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: search::sublist_search::Node 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 style="height: 56px;">
|
||||
<td id="projectalign" style="padding-left: 0.5em;">
|
||||
<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.1 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('da/d61/structsearch_1_1sublist__search_1_1_node.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<iframe src="javascript:void(0)" frameborder="0"
|
||||
name="MSearchResults" id="MSearchResults">
|
||||
</iframe>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#pub-attribs">Public Attributes</a> |
|
||||
<a href="../../d3/d1f/structsearch_1_1sublist__search_1_1_node-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">search::sublist_search::Node Struct Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>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.
|
||||
<a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#details">More...</a></p>
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for search::sublist_search::Node:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d00/structsearch_1_1sublist__search_1_1_node__coll__graph.svg" width="218" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
|
||||
Public Attributes</h2></td></tr>
|
||||
<tr class="memitem:a912ae0b339da401fc33ad21494c60e2b"><td class="memItemLeft" align="right" valign="top"><a id="a912ae0b339da401fc33ad21494c60e2b"></a>
|
||||
uint32_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">data</a> = 0</td></tr>
|
||||
<tr class="memdesc:a912ae0b339da401fc33ad21494c60e2b"><td class="mdescLeft"> </td><td class="mdescRight">the key/value of the node <br /></td></tr>
|
||||
<tr class="separator:a912ae0b339da401fc33ad21494c60e2b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:afe96e03dd6a404480ab43d1e88363a7a"><td class="memItemLeft" align="right" valign="top"><a id="afe96e03dd6a404480ab43d1e88363a7a"></a>
|
||||
<a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">next</a> {}</td></tr>
|
||||
<tr class="memdesc:afe96e03dd6a404480ab43d1e88363a7a"><td class="mdescLeft"> </td><td class="mdescRight">pointer to the next node <br /></td></tr>
|
||||
<tr class="separator:afe96e03dd6a404480ab43d1e88363a7a"><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 <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. </p>
|
||||
</div><hr/>The documentation for this struct was generated from the following file:<ul>
|
||||
<li>search/<a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_search.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="../../d9/dca/namespacesearch.html">search</a></li><li class="navelem"><b>sublist_search</b></li><li class="navelem"><a class="el" href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</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.1 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
5
da/d61/structsearch_1_1sublist__search_1_1_node.js
Normal file
5
da/d61/structsearch_1_1sublist__search_1_1_node.js
Normal file
@@ -0,0 +1,5 @@
|
||||
var structsearch_1_1sublist__search_1_1_node =
|
||||
[
|
||||
[ "data", "da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b", null ],
|
||||
[ "next", "da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a", null ]
|
||||
];
|
||||
@@ -0,0 +1,3 @@
|
||||
<map id="search::sublist_search::Node" name="search::sublist_search::Node">
|
||||
<area shape="rect" id="node1" title="A Node structure representing a single link Node in a linked list." alt="" coords="5,5,159,47"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
c7fad6ec9faa0eb5c773132140f1a7fe
|
||||
@@ -0,0 +1,30 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: search::sublist_search::Node Pages: 1 -->
|
||||
<svg width="163pt" height="39pt"
|
||||
viewBox="0.00 0.00 163.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
|
||||
<title>search::sublist_search::Node</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 159,-35 159,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="A Node structure representing a single link Node in a linked list.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 115,-30.5 115,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
|
||||
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M125.39,-19.6C130.12,-18.66 133,-17.29 133,-15.5 133,-12.63 125.62,-10.86 115.11,-10.18"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="124.62,-16.16 115.11,-20.82 125.45,-23.11 124.62,-16.16"/>
|
||||
<text text-anchor="middle" x="144" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00"> next</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.6 KiB |
@@ -127,6 +127,9 @@ Files</h2></td></tr>
|
||||
<tr class="memitem:d3/d22/saddleback__search_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="d3/d22/saddleback__search_8cpp.html">saddleback_search.cpp</a></td></tr>
|
||||
<tr class="memdesc:d3/d22/saddleback__search_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array">Saddleback Algorithm</a> for 2D arrays. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d5/d45/sublist__search_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></td></tr>
|
||||
<tr class="memdesc:d5/d45/sublist__search_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search Algorithm</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:dc/dfe/ternary__search_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="dc/dfe/ternary__search_8cpp.html">ternary_search.cpp</a></td></tr>
|
||||
<tr class="memdesc:dc/dfe/ternary__search_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Ternary_search">Ternary search</a> algorithm <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
|
||||
@@ -10,6 +10,7 @@ var dir_19b2bf9199a15c634a08b1ede1dd896a =
|
||||
[ "linear_search.cpp", "d9/d02/linear__search_8cpp.html", "d9/d02/linear__search_8cpp" ],
|
||||
[ "median_search.cpp", "d9/d69/median__search_8cpp.html", "d9/d69/median__search_8cpp" ],
|
||||
[ "saddleback_search.cpp", "d3/d22/saddleback__search_8cpp.html", "d3/d22/saddleback__search_8cpp" ],
|
||||
[ "sublist_search.cpp", "d5/d45/sublist__search_8cpp.html", "d5/d45/sublist__search_8cpp" ],
|
||||
[ "ternary_search.cpp", "dc/dfe/ternary__search_8cpp.html", "dc/dfe/ternary__search_8cpp" ],
|
||||
[ "text_search.cpp", "dc/db5/text__search_8cpp.html", "dc/db5/text__search_8cpp" ]
|
||||
];
|
||||
@@ -291,8 +291,9 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
|
||||
<tr id="row_18_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d02/linear__search_8cpp.html" target="_self">linear_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Linear_search">Linear search algorithm</a> </td></tr>
|
||||
<tr id="row_18_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d9/d69/median__search_8cpp.html" target="_self">median_search.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/">here</a> </td></tr>
|
||||
<tr id="row_18_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d3/d22/saddleback__search_8cpp.html" target="_self">saddleback_search.cpp</a></td><td class="desc">Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array">Saddleback Algorithm</a> for 2D arrays </td></tr>
|
||||
<tr id="row_18_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/dfe/ternary__search_8cpp.html" target="_self">ternary_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Ternary_search">Ternary search</a> algorithm </td></tr>
|
||||
<tr id="row_18_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/db5/text__search_8cpp.html" target="_self">text_search.cpp</a></td><td class="desc">Search for words in a long textual paragraph </td></tr>
|
||||
<tr id="row_18_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="d5/d45/sublist__search_8cpp.html" target="_self">sublist_search.cpp</a></td><td class="desc">Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search Algorithm</a> </td></tr>
|
||||
<tr id="row_18_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/dfe/ternary__search_8cpp.html" target="_self">ternary_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Ternary_search">Ternary search</a> algorithm </td></tr>
|
||||
<tr id="row_18_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="dc/db5/text__search_8cpp.html" target="_self">text_search.cpp</a></td><td class="desc">Search for words in a long textual paragraph </td></tr>
|
||||
<tr id="row_19_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_19_" class="arrow" onclick="toggleFolder('19_')">►</span><span id="img_19_" class="iconfclosed" onclick="toggleFolder('19_')"> </span><a class="el" href="dir_bb1b521853a9c46347182a9d10420771.html" target="_self">sorting</a></td><td class="desc"></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="icondoc"></span><a class="el" href="d5/ddb/bogo__sort_8cpp.html" target="_self">bogo_sort.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort">Bogosort algorithm</a> </td></tr>
|
||||
<tr id="row_19_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="d8/d13/bubble__sort_8cpp.html" target="_self">bubble_sort.cpp</a></td><td class="desc">Bubble sort algorithm </td></tr>
|
||||
|
||||
@@ -96,6 +96,7 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable()
|
||||
<li>data
|
||||
: <a class="el" href="d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37">node< Kind ></a>
|
||||
, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>
|
||||
, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a>
|
||||
</li>
|
||||
<li>decreaseKey()
|
||||
: <a class="el" href="d2/d05/class_min_heap.html#aa7f726cc6327955d22871592227432f5">MinHeap</a>
|
||||
|
||||
@@ -121,6 +121,7 @@ $(document).ready(function(){initNavTree('functions_n.html',''); initResizable()
|
||||
: <a class="el" href="dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain</a>
|
||||
, <a class="el" href="d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">list</a>
|
||||
, <a class="el" href="d5/da1/structnode.html#a135f25acadfbba644f848f1aa18d8350">node< Kind ></a>
|
||||
, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">search::sublist_search::Node</a>
|
||||
</li>
|
||||
<li>Node()
|
||||
: <a class="el" href="d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78">data_structures::Node</a>
|
||||
|
||||
@@ -141,6 +141,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
|
||||
<li>data
|
||||
: <a class="el" href="d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37">node< Kind ></a>
|
||||
, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>
|
||||
, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a>
|
||||
</li>
|
||||
<li>depth
|
||||
: <a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d">machine_learning::aystar_search::AyStarSearch< Puzzle >::Info</a>
|
||||
@@ -264,6 +265,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
|
||||
: <a class="el" href="dd/d1c/classhash__chain.html#a48236d44349c3ebce4774b706f4f8a0f">hash_chain</a>
|
||||
, <a class="el" href="d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">list</a>
|
||||
, <a class="el" href="d5/da1/structnode.html#a135f25acadfbba644f848f1aa18d8350">node< Kind ></a>
|
||||
, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#afe96e03dd6a404480ab43d1e88363a7a">search::sublist_search::Node</a>
|
||||
</li>
|
||||
<li>NUM_CHARS
|
||||
: <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191">data_structures::trie</a>
|
||||
|
||||
@@ -251,6 +251,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_search.cpp</a>
|
||||
, <a class="el" href="d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">median_search.cpp</a>
|
||||
, <a class="el" href="d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">saddleback_search.cpp</a>
|
||||
, <a class="el" href="d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">sublist_search.cpp</a>
|
||||
, <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ternary_search.cpp</a>
|
||||
, <a class="el" href="dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">text_search.cpp</a>
|
||||
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">bogo_sort.cpp</a>
|
||||
|
||||
@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
|
||||
<li>show_pascal()
|
||||
: <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">pascal_triangle.cpp</a>
|
||||
</li>
|
||||
<li>Sieve()
|
||||
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">primes_up_to_billion.cpp</a>
|
||||
</li>
|
||||
<li>sieve()
|
||||
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve_of_eratosthenes.cpp</a>
|
||||
</li>
|
||||
<li>Sieve()
|
||||
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">primes_up_to_billion.cpp</a>
|
||||
</li>
|
||||
<li>SieveOfEratosthenes()
|
||||
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">prime_factorization.cpp</a>
|
||||
</li>
|
||||
|
||||
@@ -144,6 +144,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
, <a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">persistent_seg_tree_lazy_prop.cpp</a>
|
||||
, <a class="el" href="d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">median_search.cpp</a>
|
||||
, <a class="el" href="d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">saddleback_search.cpp</a>
|
||||
, <a class="el" href="d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">sublist_search.cpp</a>
|
||||
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">bogo_sort.cpp</a>
|
||||
, <a class="el" href="d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">count_inversions.cpp</a>
|
||||
, <a class="el" href="de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">cycle_sort.cpp</a>
|
||||
|
||||
@@ -130,12 +130,12 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
|
||||
<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="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>it_ternary_search()
|
||||
: <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a>
|
||||
</li>
|
||||
|
||||
@@ -251,6 +251,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_search.cpp</a>
|
||||
, <a class="el" href="d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">median_search.cpp</a>
|
||||
, <a class="el" href="d3/d22/saddleback__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">saddleback_search.cpp</a>
|
||||
, <a class="el" href="d5/d45/sublist__search_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">sublist_search.cpp</a>
|
||||
, <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ternary_search.cpp</a>
|
||||
, <a class="el" href="dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">text_search.cpp</a>
|
||||
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">bogo_sort.cpp</a>
|
||||
|
||||
@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
|
||||
<li>show_pascal()
|
||||
: <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">pascal_triangle.cpp</a>
|
||||
</li>
|
||||
<li>Sieve()
|
||||
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">primes_up_to_billion.cpp</a>
|
||||
</li>
|
||||
<li>sieve()
|
||||
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve_of_eratosthenes.cpp</a>
|
||||
</li>
|
||||
<li>Sieve()
|
||||
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">primes_up_to_billion.cpp</a>
|
||||
</li>
|
||||
<li>SieveOfEratosthenes()
|
||||
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">prime_factorization.cpp</a>
|
||||
</li>
|
||||
|
||||
@@ -144,6 +144,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
, <a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">persistent_seg_tree_lazy_prop.cpp</a>
|
||||
, <a class="el" href="d9/d69/median__search_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">median_search.cpp</a>
|
||||
, <a class="el" href="d3/d22/saddleback__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">saddleback_search.cpp</a>
|
||||
, <a class="el" href="d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">sublist_search.cpp</a>
|
||||
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">bogo_sort.cpp</a>
|
||||
, <a class="el" href="d2/d26/count__inversions_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">count_inversions.cpp</a>
|
||||
, <a class="el" href="de/d07/cycle__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">cycle_sort.cpp</a>
|
||||
|
||||
@@ -146,46 +146,47 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
|
||||
<tr id="row_44_"><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="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
|
||||
<tr id="row_46_"><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_47_" 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< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_48_"><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_49_" 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_50_"><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_51_" 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_52_"><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_53_" 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_47_" 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_48_"><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< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_49_" 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_50_"><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_51_" 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_52_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_53_" class="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_54_"><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< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_55_" 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_56_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_57_" class="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_58_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_58_" class="arrow" onclick="toggleFolder('58_')">▼</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_58_0_" class="even"><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_59_"><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_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_61_"><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_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_63_"><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< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_65_"><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_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_67_"><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 containing the necessary test cases </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="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_69_"><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_70_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_70_" class="arrow" onclick="toggleFolder('70_')">▼</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_70_0_"><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_71_" 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_72_"><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">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
|
||||
<tr id="row_73_" 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_74_"><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_75_" 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_76_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_76_" class="arrow" onclick="toggleFolder('76_')">▼</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_76_0_" class="even"><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_76_1_"><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_76_2_" class="even"><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_76_3_"><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_76_4_" class="even"><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_76_5_"><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_77_" 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_78_"><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_55_" 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_56_"><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_57_" 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_58_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_59_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_59_" class="arrow" onclick="toggleFolder('59_')">▼</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_59_0_"><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_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_61_"><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_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_63_"><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_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_65_"><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_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_67_"><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_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="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_69_"><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_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_71_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_71_" class="arrow" onclick="toggleFolder('71_')">▼</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_71_0_" class="even"><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_72_"><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_73_" 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">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
|
||||
<tr id="row_74_"><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_75_" 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_76_"><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_77_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_77_" class="arrow" onclick="toggleFolder('77_')">▼</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_77_0_"><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_77_1_" class="even"><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_77_2_"><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_77_3_" class="even"><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_77_4_"><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_77_5_" class="even"><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_78_"><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_79_" 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 -->
|
||||
|
||||
@@ -49,14 +49,15 @@ var hierarchy =
|
||||
[ "Node", "db/d8b/struct_node.html", null ],
|
||||
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],
|
||||
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
|
||||
[ "search::sublist_search::Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", null ],
|
||||
[ "node< Type >", "d5/da1/structnode.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::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
|
||||
[ "Point", "d8/dc8/struct_point.html", null ],
|
||||
[ "query", "dd/d1b/structquery.html", null ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "queue< Kind >", "db/da9/classqueue.html", null ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
|
||||
[ "RBtree", "d8/d72/class_r_btree.html", null ],
|
||||
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
|
||||
|
||||
@@ -1 +1 @@
|
||||
a0a232dd763f693ad2c0b02e472a2de6
|
||||
296b8c109e6a18a9dd057579b2083015
|
||||
@@ -37,9 +37,9 @@
|
||||
<path fill="none" stroke="midnightblue" d="M119.99,-67.67C128.56,-65.88 137.28,-64.07 145.67,-62.32"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="119.11,-64.28 110.03,-69.74 120.53,-71.13 119.11,-64.28"/>
|
||||
</g>
|
||||
<!-- Node73 -->
|
||||
<!-- Node74 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node73</title>
|
||||
<title>Node74</title>
|
||||
<g id="a_node3"><a xlink:href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_top" xlink:title="A Basic Tree, which supports binary lifting.">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-41.5 110,-41.5 110,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">range_queries::heavy</text>
|
||||
@@ -48,9 +48,9 @@
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node73->Node1 -->
|
||||
<!-- Node74->Node1 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node73->Node1</title>
|
||||
<title>Node74->Node1</title>
|
||||
<path fill="none" stroke="midnightblue" d="M119.99,-34.33C128.56,-36.12 137.28,-37.93 145.67,-39.68"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="120.53,-30.87 110.03,-32.26 119.11,-37.72 120.53,-30.87"/>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 3.3 KiB After Width: | Height: | Size: 3.3 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,148,32"/>
|
||||
<area shape="rect" id="node1" href="$da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list." alt="" coords="5,5,159,47"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
15c0758977894124ce8483f7108e3e73
|
||||
20bec266e6a4e80cf8cf4d236a64bdb3
|
||||
@@ -4,17 +4,18 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="115pt" height="28pt"
|
||||
viewBox="0.00 0.00 115.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<svg width="123pt" height="39pt"
|
||||
viewBox="0.00 0.00 123.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 111,-24 111,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 119,-35 119,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 107,-19.5 107,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="53.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
|
||||
<g id="a_node1"><a xlink:href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_top" xlink:title="A Node structure representing a single link Node in a linked list.">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 115,-30.5 115,-0.5 0,-0.5"/>
|
||||
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
|
||||
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1.2 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$dd/d4f/class_solution.html" title=" " alt="" coords="5,5,75,32"/>
|
||||
<area shape="rect" id="node1" href="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,148,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
d29718af26117f8d229cea6c31073750
|
||||
15c0758977894124ce8483f7108e3e73
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="60pt" height="28pt"
|
||||
viewBox="0.00 0.00 60.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="115pt" height="28pt"
|
||||
viewBox="0.00 0.00 115.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 56,-24 56,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 111,-24 111,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 52,-19.5 52,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="26" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
|
||||
<g id="a_node1"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 107,-19.5 107,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="53.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 996 B After Width: | Height: | Size: 1.0 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d1/dc2/classstack.html" title=" " alt="" coords="5,5,112,32"/>
|
||||
<area shape="rect" id="node1" href="$dd/d4f/class_solution.html" title=" " alt="" coords="5,5,75,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
172cf06ef071a5ae65c47d2b08429ea1
|
||||
d29718af26117f8d229cea6c31073750
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="88pt" height="28pt"
|
||||
viewBox="0.00 0.00 88.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="60pt" height="28pt"
|
||||
viewBox="0.00 0.00 60.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 84,-24 84,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 56,-24 56,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d1/dc2/classstack.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 80,-19.5 80,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="40" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stack< Type ></text>
|
||||
<g id="a_node1"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 52,-19.5 52,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="26" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1003 B After Width: | Height: | Size: 996 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,32"/>
|
||||
<area shape="rect" id="node1" href="$d1/dc2/classstack.html" title=" " alt="" coords="5,5,112,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
a99fca445652dfb292d35f8fd85290cf
|
||||
172cf06ef071a5ae65c47d2b08429ea1
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="95pt" height="28pt"
|
||||
viewBox="0.00 0.00 95.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="88pt" height="28pt"
|
||||
viewBox="0.00 0.00 88.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 91,-24 91,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 84,-24 84,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d2/dc4/classstack__linked_list.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 87,-19.5 87,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="43.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stack_linkedList</text>
|
||||
<g id="a_node1"><a xlink:href="d1/dc2/classstack.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 80,-19.5 80,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="40" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stack< Type ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1015 B After Width: | Height: | Size: 1003 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,32"/>
|
||||
<area shape="rect" id="node1" href="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
56037270393cd432505f71b72a285a33
|
||||
a99fca445652dfb292d35f8fd85290cf
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="167pt" height="28pt"
|
||||
viewBox="0.00 0.00 167.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="95pt" height="28pt"
|
||||
viewBox="0.00 0.00 95.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<title>Graphical Class Hierarchy</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 163,-24 163,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 91,-24 91,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 159,-19.5 159,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="79.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1< T ></text>
|
||||
<g id="a_node1"><a xlink:href="d2/dc4/classstack__linked_list.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 87,-19.5 87,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="43.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stack_linkedList</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1015 B |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,32"/>
|
||||
<area shape="rect" id="node1" href="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
44f61a6c355366e4e56ece076004f6f3
|
||||
56037270393cd432505f71b72a285a33
|
||||
@@ -12,9 +12,9 @@
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d8/dab/classstatistics_1_1stats__computer2.html" target="_top" xlink:title=" ">
|
||||
<g id="a_node1"><a xlink:href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 159,-19.5 159,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="79.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2< T ></text>
|
||||
<text text-anchor="middle" x="79.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1< T ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1.0 KiB |
@@ -1,9 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="5,162,108,189"/>
|
||||
<area shape="rect" id="node2" href="$d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" title=" " alt="" coords="192,5,315,47"/>
|
||||
<area shape="rect" id="node3" href="$dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" title=" " alt="" coords="192,71,315,112"/>
|
||||
<area shape="rect" id="node4" href="$d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" title=" " alt="" coords="161,137,345,163"/>
|
||||
<area shape="rect" id="node5" href="$d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" title=" " alt="" coords="161,187,345,214"/>
|
||||
<area shape="rect" id="node6" href="$d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" title=" " alt="" coords="156,238,351,265"/>
|
||||
<area shape="rect" id="node7" href="$df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" title=" " alt="" coords="156,289,351,315"/>
|
||||
<area shape="rect" id="node1" href="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,32"/>
|
||||
</map>
|
||||
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user