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

Documentation for 32db99c1de

Browse Source
This commit is contained in:
github-actions
2023-07-04 05:46:48 +00:00
parent 2dacb46e30
commit 3d268fca4e
127 changed files with 5142 additions and 1607 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
annotated.html
View File

@@ -229,8 +229,8 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_20_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
<tr id="row_21_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_23_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_23_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_25_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_27_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
@@ -260,12 +260,13 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_51_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a> </td></tr>
<tr id="row_53_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_55_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_56_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_56_" class="arrow" onclick="toggleFolder('56_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_56_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_57_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_54_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> </td></tr>
<tr id="row_55_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_57_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_57_" class="arrow" onclick="toggleFolder('57_')">&#9658;</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_57_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_59_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

3
annotated_dup.js
View File

@@ -173,8 +173,8 @@ var annotated_dup =
[ "binary_search_tree", "d9/dde/classbinary__search__tree.html", "d9/dde/classbinary__search__tree" ],
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Compare", "de/d4a/class_compare.html", "de/d4a/class_compare" ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Complex", "da/d5a/class_complex.html", "da/d5a/class_complex" ],
[ "CycleCheck", "d3/dbb/class_cycle_check.html", "d3/dbb/class_cycle_check" ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
@@ -204,6 +204,7 @@ var annotated_dup =
[ "Solution", "dd/d4f/class_solution.html", null ],
[ "stack", "d1/dc2/classstack.html", "d1/dc2/classstack" ],
[ "stack_linkedList", "d2/dc4/classstack__linked_list.html", null ],
[ "TestCase", "da/d86/struct_test_case.html", null ],
[ "TestCases", "d5/d58/class_test_cases.html", "d5/d58/class_test_cases" ],
[ "tower", "d2/d2c/structtower.html", "d2/d2c/structtower" ],
[ "Trie", "dd/d2f/class_trie.html", "dd/d2f/class_trie" ],

4
classes.html
View File

@@ -110,7 +110,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d9/dde/classbinary__search__tree.html">binary_search_tree</a></dd><dd><a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> (operations_on_datastructures::reverse_binary_tree)</dd><dd><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html">BinaryTree</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d9/dae/classdata__structures_1_1_bitset.html">Bitset</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html">BloomFilter</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree::bst_node</a></dd><dd><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html">BT</a> (others::recursive_tree_traversals)</dd><dd><a class="el" href="d9/d90/struct_btree.html">Btree</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_C" name="letter_C">C</a></dt>
<dd><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dd><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html">CircularLinkedList</a> (operations_on_datastructures::circular_linked_list)</dd><dd><a class="el" href="d5/d15/classcll.html">cll</a></dd><dd><a class="el" href="de/d4a/class_compare.html">Compare</a></dd><dd><a class="el" href="d1/db3/structcompare.html">compare</a></dd><dd><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html">AyStarSearch::comparison_operator</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="da/d5a/class_complex.html">Complex</a></dd><dd><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)</dd><dd><a class="el" href="d3/dbb/class_cycle_check.html">CycleCheck</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_D" name="letter_D">D</a></dt>
<dd><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd><dd><a class="el" href="dd/d1f/classdsu.html">dsu</a></dd></dl>
@@ -155,7 +155,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a></dd><dd><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d4f/class_solution.html">Solution</a></dd><dd><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">Sparse_table</a> (data_structures::sparse_table)</dd><dd><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">Stack</a> (data_structures::stack_using_queue)</dd><dd><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> (others::postfix_expression)</dd><dd><a class="el" href="d1/dc2/classstack.html">stack</a></dd><dd><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a></dd><dd><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd><dd><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_T" name="letter_T">T</a></dt>
<dd><a class="el" href="d5/d58/class_test_cases.html">TestCases</a></dd><dd><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> (operations_on_datastructures::trie_operations)</dd><dd><a class="el" href="d2/d2c/structtower.html">tower</a></dd><dd><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> (data_structures::tree_234)</dd><dd><a class="el" href="d0/d3e/classdata__structures_1_1trie.html">trie</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">Trie</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="dd/d2f/class_trie.html">Trie</a></dd><dd><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a></dd></dl>
<dd><a class="el" href="da/d86/struct_test_case.html">TestCase</a></dd><dd><a class="el" href="d5/d58/class_test_cases.html">TestCases</a></dd><dd><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> (operations_on_datastructures::trie_operations)</dd><dd><a class="el" href="d2/d2c/structtower.html">tower</a></dd><dd><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> (data_structures::tree_234)</dd><dd><a class="el" href="d0/d3e/classdata__structures_1_1trie.html">trie</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">Trie</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="dd/d2f/class_trie.html">Trie</a></dd><dd><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_U" name="letter_U">U</a></dt>
<dd><a class="el" href="db/d9a/classuint128__t.html">uint128_t</a></dd><dd><a class="el" href="d1/d83/classuint256__t.html">uint256_t</a></dd></dl>

13
d2/d68/longest__common__string_8cpp__incl.map Normal file
View File

@@ -0,0 +1,13 @@
<map id="dynamic_programming/longest_common_string.cpp" name="dynamic_programming/longest_common_string.cpp">
<area shape="rect" id="Node000001" title="contains the definition of the function longest_common_string_length" alt="" coords="122,5,310,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,70,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="173,49,79,90,77,85,170,44"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="94,94,165,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="197,48,156,86,152,82,193,44"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="190,94,243,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="219,46,219,79,214,79,214,46"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="267,94,320,120"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="237,45,273,81,270,85,233,48"/>
<area shape="rect" id="Node000006" title=" " alt="" coords="344,94,401,120"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="256,44,337,85,334,89,254,49"/>
</map>

1
d2/d68/longest__common__string_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
a469cca2a63e0cfba47bcd6345cddae6

137
d2/d68/longest__common__string_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,137 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: dynamic_programming/longest_common_string.cpp Pages: 1 -->
<svg width="305pt" height="94pt"
viewBox="0.00 0.00 304.62 93.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.75)">
<title>dynamic_programming/longest_common_string.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="contains the definition of the function longest_common_string_length">
<polygon fill="#999999" stroke="#666666" points="228.75,-85.75 87.5,-85.75 87.5,-55.25 228.75,-55.25 228.75,-85.75"/>
<text text-anchor="start" x="95.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="158.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/longest_common_string.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M124.66,-54.8C103.17,-45.35 75.49,-33.19 54.61,-24.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.24,-20.47 45.68,-19.65 53.42,-26.88 56.24,-20.47"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.06,-54.95C132.73,-46.5 120.96,-35.83 111.29,-27.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="113.91,-24.82 104.15,-20.7 109.21,-30.01 113.91,-24.82"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="178.12,-19.25 138.12,-19.25 138.12,0 178.12,0 178.12,-19.25"/>
<text text-anchor="middle" x="158.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M158.12,-54.95C158.12,-47.62 158.12,-38.62 158.12,-30.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="161.63,-30.7 158.12,-20.7 154.63,-30.7 161.63,-30.7"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="235.75,-19.25 196.5,-19.25 196.5,0 235.75,0 235.75,-19.25"/>
<text text-anchor="middle" x="216.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">utility</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M172.46,-54.95C180.7,-46.59 191.08,-36.05 199.65,-27.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.66,-30.28 206.18,-20.7 196.67,-25.37 201.66,-30.28"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="296.62,-19.25 253.62,-19.25 253.62,0 296.62,0 296.62,-19.25"/>
<text text-anchor="middle" x="275.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M187.35,-54.8C205.76,-45.53 229.4,-33.63 247.5,-24.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.82,-27.28 256.18,-19.65 245.68,-21.02 248.82,-27.28"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.5 KiB

112
d2/d68/longest__common__string_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,112 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: dynamic_programming/longest_common_string.cpp Pages: 1 -->
<svg width="305pt" height="94pt"
viewBox="0.00 0.00 304.62 93.75" 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 89.75)">
<title>dynamic_programming/longest_common_string.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="contains the definition of the function longest_common_string_length">
<polygon fill="#999999" stroke="#666666" points="228.75,-85.75 87.5,-85.75 87.5,-55.25 228.75,-55.25 228.75,-85.75"/>
<text text-anchor="start" x="95.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">dynamic_programming</text>
<text text-anchor="middle" x="158.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">/longest_common_string.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="48.25,-19.25 0,-19.25 0,0 48.25,0 48.25,-19.25"/>
<text text-anchor="middle" x="24.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M124.66,-54.8C103.17,-45.35 75.49,-33.19 54.61,-24.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="56.24,-20.47 45.68,-19.65 53.42,-26.88 56.24,-20.47"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="119.88,-19.25 66.38,-19.25 66.38,0 119.88,0 119.88,-19.25"/>
<text text-anchor="middle" x="93.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M142.06,-54.95C132.73,-46.5 120.96,-35.83 111.29,-27.08"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="113.91,-24.82 104.15,-20.7 109.21,-30.01 113.91,-24.82"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="178.12,-19.25 138.12,-19.25 138.12,0 178.12,0 178.12,-19.25"/>
<text text-anchor="middle" x="158.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node1&#45;&gt;Node4</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M158.12,-54.95C158.12,-47.62 158.12,-38.62 158.12,-30.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="161.63,-30.7 158.12,-20.7 154.63,-30.7 161.63,-30.7"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="235.75,-19.25 196.5,-19.25 196.5,0 235.75,0 235.75,-19.25"/>
<text text-anchor="middle" x="216.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">utility</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M172.46,-54.95C180.7,-46.59 191.08,-36.05 199.65,-27.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="201.66,-30.28 206.18,-20.7 196.67,-25.37 201.66,-30.28"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="296.62,-19.25 253.62,-19.25 253.62,0 296.62,0 296.62,-19.25"/>
<text text-anchor="middle" x="275.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge5_Node000001_Node000006" class="edge">
<title>Node1&#45;&gt;Node6</title>
<g id="a_edge5_Node000001_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M187.35,-54.8C205.76,-45.53 229.4,-33.63 247.5,-24.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="248.82,-27.28 256.18,-19.65 245.68,-21.02 248.82,-27.28"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.7 KiB

13
d4/d08/sha256_8cpp.html
View File

@@ -725,24 +725,24 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 286</span> {</div>
<div class="line"><span class="lineno"> 287</span> <span class="keyword">struct </span>TestCase {</div>
<div class="line"><span class="lineno"> 287</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
<div class="line"><span class="lineno"> 288</span> <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> input;</div>
<div class="line"><span class="lineno"> 289</span> <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> expected_hash;</div>
<div class="line"><span class="lineno"> 290</span> TestCase(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> input, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> expected_hash)</div>
<div class="line"><span class="lineno"> 290</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> input, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> expected_hash)</div>
<div class="line"><span class="lineno"> 291</span> : input(<a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a>(input)),</div>
<div class="line"><span class="lineno"> 292</span> expected_hash(<a class="code hl_namespace" href="../../d8/dcc/namespacestd.html">std</a>::<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">move</a>(expected_hash)) {}</div>
<div class="line"><span class="lineno"> 293</span> };</div>
<div class="line"><span class="lineno"> 294</span> <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;TestCase&gt;</a> test_cases{</div>
<div class="line"><span class="lineno"> 295</span> TestCase(</div>
<div class="line"><span class="lineno"> 295</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
<div class="line"><span class="lineno"> 296</span> <span class="stringliteral">&quot;&quot;</span>,</div>
<div class="line"><span class="lineno"> 297</span> <span class="stringliteral">&quot;e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855&quot;</span>),</div>
<div class="line"><span class="lineno"> 298</span> TestCase(</div>
<div class="line"><span class="lineno"> 298</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
<div class="line"><span class="lineno"> 299</span> <span class="stringliteral">&quot;test&quot;</span>,</div>
<div class="line"><span class="lineno"> 300</span> <span class="stringliteral">&quot;9f86d081884c7d659a2feaa0c55ad015a3bf4f1b2b0b822cd15d6c15b0f00a08&quot;</span>),</div>
<div class="line"><span class="lineno"> 301</span> TestCase(</div>
<div class="line"><span class="lineno"> 301</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
<div class="line"><span class="lineno"> 302</span> <span class="stringliteral">&quot;Hello World&quot;</span>,</div>
<div class="line"><span class="lineno"> 303</span> <span class="stringliteral">&quot;a591a6d40bf420404a011733cfb7b190d62c65bf0bcda32b57b277d9ad9f146e&quot;</span>),</div>
<div class="line"><span class="lineno"> 304</span> TestCase(<span class="stringliteral">&quot;Hello World!&quot;</span>,</div>
<div class="line"><span class="lineno"> 304</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;Hello World!&quot;</span>,</div>
<div class="line"><span class="lineno"> 305</span> <span class="stringliteral">&quot;7f83b1657ff1fc53b92dc18148a1d65dfc2d4b1fa3d677284addd200126d9&quot;</span></div>
<div class="line"><span class="lineno"> 306</span> <span class="stringliteral">&quot;069&quot;</span>)};</div>
<div class="line"><span class="lineno"> 307</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;tc : test_cases) {</div>
@@ -752,6 +752,7 @@ Here is the call graph for this function:</div>
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:54</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment -->
</div>

551
da/d0d/longest__common__string_8cpp.html Normal file
View File

@@ -0,0 +1,551 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: dynamic_programming/longest_common_string.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('da/d0d/longest__common__string_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">longest_common_string.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>contains the definition of the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;string&gt;</code><br />
<code>#include &lt;utility&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for longest_common_string.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/d68/longest__common__string_8cpp__incl.svg" width="407" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d86/struct_test_case.html">TestCase</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">represents single example inputs and expected output of the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> <a href="../../da/d86/struct_test_case.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:aa38b6b17bc5d46ed88acdd8414e18fa5"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;string_a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;string_b)</td></tr>
<tr class="memdesc:aa38b6b17bc5d46ed88acdd8414e18fa5"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:aa38b6b17bc5d46ed88acdd8414e18fa5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a967854a526bc15403d783a033155fc5c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">get_test_cases</a> ()</td></tr>
<tr class="separator:a967854a526bc15403d783a033155fc5c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9b229daad982a186a4d8d90aa8f38561"><td class="memTemplParams" colspan="2">template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &gt; </td></tr>
<tr class="memitem:a9b229daad982a186a4d8d90aa8f38561"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a> (const <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &amp;test_cases)</td></tr>
<tr class="memdesc:a9b229daad982a186a4d8d90aa8f38561"><td class="mdescLeft">&#160;</td><td class="mdescRight">checks the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> agains example data <br /></td></tr>
<tr class="separator:a9b229daad982a186a4d8d90aa8f38561"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad1e613c1b85cc04ed931b6c745fec155"><td class="memTemplParams" colspan="2">template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &gt; </td></tr>
<tr class="memitem:ad1e613c1b85cc04ed931b6c745fec155"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a> (const <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &amp;test_cases)</td></tr>
<tr class="memdesc:ad1e613c1b85cc04ed931b6c745fec155"><td class="mdescLeft">&#160;</td><td class="mdescRight">checks if the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> returns the same result when its argument are flipped <br /></td></tr>
<tr class="separator:ad1e613c1b85cc04ed931b6c745fec155"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:acb03dbbcee6d607db471021168be8541"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">reverse_str</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;in_str)</td></tr>
<tr class="memdesc:acb03dbbcee6d607db471021168be8541"><td class="mdescLeft">&#160;</td><td class="mdescRight">reverses a given string <br /></td></tr>
<tr class="separator:acb03dbbcee6d607db471021168be8541"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a23ab67b0d9600697695fc8679462d8fe"><td class="memTemplParams" colspan="2">template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &gt; </td></tr>
<tr class="memitem:a23ab67b0d9600697695fc8679462d8fe"><td class="memTemplItemLeft" align="right" valign="top">static void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a> (const <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &amp;test_cases)</td></tr>
<tr class="memdesc:a23ab67b0d9600697695fc8679462d8fe"><td class="mdescLeft">&#160;</td><td class="mdescRight">checks if the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> returns the same result when its inputs are reversed <br /></td></tr>
<tr class="separator:a23ab67b0d9600697695fc8679462d8fe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">runs all tests for <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> funcion <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>contains the definition of the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> </p>
<p>the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> computes the length of the longest common string which can be created of two input strings by removing characters from them</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/nikhilarora068" target="_blank">Nikhil Arora</a> </dd>
<dd>
<a href="https://github.com/vil02" target="_blank">Piotr Idzik</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a967854a526bc15403d783a033155fc5c" name="a967854a526bc15403d783a033155fc5c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a967854a526bc15403d783a033155fc5c">&#9670;&#160;</a></span>get_test_cases()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a> &gt; get_test_cases </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<dl class="section return"><dt>Returns</dt><dd>example data used in the tests of <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 69</span> {</div>
<div class="line"><span class="lineno"> 70</span> <span class="keywordflow">return</span> {<a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;&quot;</span>, <span class="stringliteral">&quot;&quot;</span>, 0),</div>
<div class="line"><span class="lineno"> 71</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;ab&quot;</span>, <span class="stringliteral">&quot;ab&quot;</span>, 2),</div>
<div class="line"><span class="lineno"> 72</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;ab&quot;</span>, <span class="stringliteral">&quot;ba&quot;</span>, 1),</div>
<div class="line"><span class="lineno"> 73</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;&quot;</span>, <span class="stringliteral">&quot;xyz&quot;</span>, 0),</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;abcde&quot;</span>, <span class="stringliteral">&quot;ace&quot;</span>, 3),</div>
<div class="line"><span class="lineno"> 75</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;BADANA&quot;</span>, <span class="stringliteral">&quot;ANADA&quot;</span>, 3),</div>
<div class="line"><span class="lineno"> 76</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;BADANA&quot;</span>, <span class="stringliteral">&quot;CANADAS&quot;</span>, 3),</div>
<div class="line"><span class="lineno"> 77</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;a1a234a5aaaa6&quot;</span>, <span class="stringliteral">&quot;A1AAAA234AAA56AAAAA&quot;</span>, 6),</div>
<div class="line"><span class="lineno"> 78</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;123x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
<div class="line"><span class="lineno"> 79</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;12x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
<div class="line"><span class="lineno"> 80</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;1x2x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
<div class="line"><span class="lineno"> 81</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;x1x2x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3),</div>
<div class="line"><span class="lineno"> 82</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="stringliteral">&quot;x12x3x&quot;</span>, <span class="stringliteral">&quot;123&quot;</span>, 3)};</div>
<div class="line"><span class="lineno"> 83</span>}</div>
<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:54</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aa38b6b17bc5d46ed88acdd8414e18fa5" name="aa38b6b17bc5d46ed88acdd8414e18fa5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa38b6b17bc5d46ed88acdd8414e18fa5">&#9670;&#160;</a></span>longest_common_string_length()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> longest_common_string_length </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>string_a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>string_b</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<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 <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></p>
<p>computes the length of the longest common string created from input strings</p>
<p>has O(str_a.size()*str_b.size()) time and memory complexity </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">string_a</td><td>first input string </td></tr>
<tr><td class="paramname">string_b</td><td>second input string </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the length of the longest common string which can be strated from str_a and str_b </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 29</span> {</div>
<div class="line"><span class="lineno"> 30</span> <span class="keyword">const</span> <span class="keyword">auto</span> size_a = string_a.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
<div class="line"><span class="lineno"> 31</span> <span class="keyword">const</span> <span class="keyword">auto</span> size_b = string_b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>();</div>
<div class="line"><span class="lineno"> 32</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::vector&lt;std::size_t&gt;</a>&gt; sub_sols(</div>
<div class="line"><span class="lineno"> 33</span> size_a + 1, <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::size_t&gt;</a>(size_b + 1, 0));</div>
<div class="line"><span class="lineno"> 34</span> </div>
<div class="line"><span class="lineno"> 35</span> <span class="keyword">const</span> <span class="keyword">auto</span> limit = <span class="keyword">static_cast&lt;</span><a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a><span class="keyword">&gt;</span>(-1);</div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> pos_a = size_a - 1; pos_a != limit; --pos_a) {</div>
<div class="line"><span class="lineno"> 37</span> <span class="keywordflow">for</span> (<a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> pos_b = size_b - 1; pos_b != limit; --pos_b) {</div>
<div class="line"><span class="lineno"> 38</span> <span class="keywordflow">if</span> (string_a[pos_a] == string_b[pos_b]) {</div>
<div class="line"><span class="lineno"> 39</span> sub_sols[pos_a][pos_b] = 1 + sub_sols[pos_a + 1][pos_b + 1];</div>
<div class="line"><span class="lineno"> 40</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 41</span> sub_sols[pos_a][pos_b] = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(sub_sols[pos_a + 1][pos_b],</div>
<div class="line"><span class="lineno"> 42</span> sub_sols[pos_a][pos_b + 1]);</div>
<div class="line"><span class="lineno"> 43</span> }</div>
<div class="line"><span class="lineno"> 44</span> }</div>
<div class="line"><span class="lineno"> 45</span> }</div>
<div class="line"><span class="lineno"> 46</span> </div>
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">return</span> sub_sols[0][0];</div>
<div class="line"><span class="lineno"> 48</span>}</div>
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">std::string::size</a></div><div class="ttdeci">T size(T... args)</div></div>
<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.svg" width="330" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 156</span> {</div>
<div class="line"><span class="lineno"> 157</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>();</div>
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 159</span>}</div>
<div class="ttc" id="alongest__common__string_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">runs all tests for longest_common_string_length funcion</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:142</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="../../da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="505"><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="acb03dbbcee6d607db471021168be8541" name="acb03dbbcee6d607db471021168be8541"></a>
<h2 class="memtitle"><span class="permalink"><a href="#acb03dbbcee6d607db471021168be8541">&#9670;&#160;</a></span>reverse_str()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> reverse_str </td>
<td>(</td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;&#160;</td>
<td class="paramname"><em>in_str</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>reverses a given string </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">in_str</td><td>input string </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the string in which the characters appear in the reversed order as in in_str </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 119</span> {</div>
<div class="line"><span class="lineno"> 120</span> <span class="keywordflow">return</span> {in_str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html">rbegin</a>(), in_str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html">rend</a>()};</div>
<div class="line"><span class="lineno"> 121</span>}</div>
<div class="ttc" id="arbegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html">std::string::rbegin</a></div><div class="ttdeci">T rbegin(T... args)</div></div>
<div class="ttc" id="arend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html">std::string::rend</a></div><div class="ttdeci">T rend(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="../../da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.svg" width="268" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a9b229daad982a186a4d8d90aa8f38561" name="a9b229daad982a186a4d8d90aa8f38561"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9b229daad982a186a4d8d90aa8f38561">&#9670;&#160;</a></span>test_longest_common_string_length()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_longest_common_string_length </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &amp;&#160;</td>
<td class="paramname"><em>test_cases</em></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>checks the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> agains example data </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">test_cases</td><td>list of test cases </td></tr>
</table>
</dd>
</dl>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">type</td><td>representing a list of test cases </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 91</span> {</div>
<div class="line"><span class="lineno"> 92</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
<div class="line"><span class="lineno"> 93</span> assert(<a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(cur_tc.string_a, cur_tc.string_b) ==</div>
<div class="line"><span class="lineno"> 94</span> cur_tc.common_string_len);</div>
<div class="line"><span class="lineno"> 95</span> }</div>
<div class="line"><span class="lineno"> 96</span>}</div>
<div class="ttc" id="alongest__common__string_8cpp_html_aa38b6b17bc5d46ed88acdd8414e18fa5"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a></div><div class="ttdeci">std::size_t longest_common_string_length(const std::string &amp;string_a, const std::string &amp;string_b)</div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:28</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="../../da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.svg" width="527" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a23ab67b0d9600697695fc8679462d8fe" name="a23ab67b0d9600697695fc8679462d8fe"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a23ab67b0d9600697695fc8679462d8fe">&#9670;&#160;</a></span>test_longest_common_string_length_for_reversed_inputs()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_longest_common_string_length_for_reversed_inputs </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &amp;&#160;</td>
<td class="paramname"><em>test_cases</em></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>checks if the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> returns the same result when its inputs are reversed </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">test_cases</td><td>list of test cases </td></tr>
</table>
</dd>
</dl>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">type</td><td>representing a list of test cases </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 131</span> {</div>
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
<div class="line"><span class="lineno"> 133</span> assert(<a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(<a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">reverse_str</a>(cur_tc.string_a),</div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">reverse_str</a>(cur_tc.string_b)) ==</div>
<div class="line"><span class="lineno"> 135</span> cur_tc.common_string_len);</div>
<div class="line"><span class="lineno"> 136</span> }</div>
<div class="line"><span class="lineno"> 137</span>}</div>
<div class="ttc" id="alongest__common__string_8cpp_html_acb03dbbcee6d607db471021168be8541"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">reverse_str</a></div><div class="ttdeci">std::string reverse_str(const std::string &amp;in_str)</div><div class="ttdoc">reverses a given string</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:119</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="../../da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg" width="570" height="188"><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="ad1e613c1b85cc04ed931b6c745fec155" name="ad1e613c1b85cc04ed931b6c745fec155"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad1e613c1b85cc04ed931b6c745fec155">&#9670;&#160;</a></span>test_longest_common_string_length_is_symmetric()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test_longest_common_string_length_is_symmetric </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a> &amp;&#160;</td>
<td class="paramname"><em>test_cases</em></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>checks if the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> returns the same result when its argument are flipped </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">test_cases</td><td>list of test cases </td></tr>
</table>
</dd>
</dl>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">type</td><td>representing a list of test cases </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 106</span> {</div>
<div class="line"><span class="lineno"> 107</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>&amp; cur_tc : test_cases) {</div>
<div class="line"><span class="lineno"> 108</span> assert(<a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string_length</a>(cur_tc.string_b, cur_tc.string_a) ==</div>
<div class="line"><span class="lineno"> 109</span> cur_tc.common_string_len);</div>
<div class="line"><span class="lineno"> 110</span> }</div>
<div class="line"><span class="lineno"> 111</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="../../da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.svg" width="566" height="86"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">&#9670;&#160;</a></span>tests()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void tests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>runs all tests for <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> funcion </p>
<div class="fragment"><div class="line"><span class="lineno"> 142</span> {</div>
<div class="line"><span class="lineno"> 143</span> <span class="keyword">const</span> <span class="keyword">auto</span> test_cases = <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">get_test_cases</a>();</div>
<div class="line"><span class="lineno"> 144</span> assert(test_cases.size() &gt; 0);</div>
<div class="line"><span class="lineno"> 145</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a>(test_cases);</div>
<div class="line"><span class="lineno"> 146</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a>(test_cases);</div>
<div class="line"><span class="lineno"> 147</span> <a class="code hl_function" href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a>(test_cases);</div>
<div class="line"><span class="lineno"> 148</span> </div>
<div class="line"><span class="lineno"> 149</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 150</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="alongest__common__string_8cpp_html_a23ab67b0d9600697695fc8679462d8fe"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">test_longest_common_string_length_for_reversed_inputs</a></div><div class="ttdeci">static void test_longest_common_string_length_for_reversed_inputs(const TestCases &amp;test_cases)</div><div class="ttdoc">checks if the function longest_common_string_length returns the same result when its inputs are rever...</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:130</div></div>
<div class="ttc" id="alongest__common__string_8cpp_html_a967854a526bc15403d783a033155fc5c"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">get_test_cases</a></div><div class="ttdeci">std::vector&lt; TestCase &gt; get_test_cases()</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:69</div></div>
<div class="ttc" id="alongest__common__string_8cpp_html_a9b229daad982a186a4d8d90aa8f38561"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">test_longest_common_string_length</a></div><div class="ttdeci">static void test_longest_common_string_length(const TestCases &amp;test_cases)</div><div class="ttdoc">checks the function longest_common_string_length agains example data</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:91</div></div>
<div class="ttc" id="alongest__common__string_8cpp_html_ad1e613c1b85cc04ed931b6c745fec155"><div class="ttname"><a href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">test_longest_common_string_length_is_symmetric</a></div><div class="ttdeci">static void test_longest_common_string_length_is_symmetric(const TestCases &amp;test_cases)</div><div class="ttdoc">checks if the function longest_common_string_length returns the same result when its argument are fli...</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:105</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="../../da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="100%" height="505"><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_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../da/d0d/longest__common__string_8cpp.html">longest_common_string.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
</ul>
</div>
</body>
</html>

12
da/d0d/longest__common__string_8cpp.js Normal file
View File

@@ -0,0 +1,12 @@
var longest__common__string_8cpp =
[
[ "TestCase", "da/d86/struct_test_case.html", null ],
[ "get_test_cases", "da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c", null ],
[ "longest_common_string_length", "da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5", null ],
[ "main", "da/d0d/longest__common__string_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "reverse_str", "da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541", null ],
[ "test_longest_common_string_length", "da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561", null ],
[ "test_longest_common_string_length_for_reversed_inputs", "da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe", null ],
[ "test_longest_common_string_length_is_symmetric", "da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155", null ],
[ "tests", "da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
];

15
da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.map Normal file
View File

@@ -0,0 +1,15 @@
<map id="test_longest_common_string_length_for_reversed_inputs" name="test_longest_common_string_length_for_reversed_inputs">
<area shape="rect" id="Node000001" title="checks if the function longest_common_string_length returns the same result when its inputs are rever..." alt="" coords="5,68,187,123"/>
<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector" alt="" coords="235,46,394,87"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="187,81,219,76,220,81,187,86"/>
<area shape="rect" id="Node000005" href="$da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" title="reverses a given string" alt="" coords="271,111,358,136"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="187,104,257,114,257,119,187,110"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="467,5,539,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="394,43,452,28,453,33,395,48"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="448,55,559,80"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="395,64,432,64,432,70,395,69"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rbegin.html#" title=" " alt="" coords="442,108,564,134"/>
<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="358,120,427,119,427,125,358,126"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rend.html#" title=" " alt="" coords="447,157,559,183"/>
<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="359,132,435,151,433,156,357,137"/>
</map>

1
da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
286ea9d93a7520e75925ead743933bdb

157
da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph.svg Normal file
View File

@@ -0,0 +1,157 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test_longest_common_string_length_for_reversed_inputs Pages: 1 -->
<svg width="427pt" height="141pt"
viewBox="0.00 0.00 427.25 141.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 137.25)">
<title>test_longest_common_string_length_for_reversed_inputs</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
<polygon fill="#999999" stroke="#666666" points="136,-86.5 0,-86.5 0,-44.75 136,-44.75 136,-86.5"/>
<text text-anchor="start" x="8" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="start" x="8" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
<text text-anchor="middle" x="68" y="-50.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="291.5,-102.88 172,-102.88 172,-72.38 291.5,-72.38 291.5,-102.88"/>
<text text-anchor="start" x="180" y="-89.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="231.75" y="-78.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M136.19,-74.76C144.34,-75.87 152.68,-77.01 160.86,-78.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.13,-81.69 170.51,-79.57 161.07,-74.75 160.13,-81.69"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
<polygon fill="white" stroke="#666666" points="264.12,-54.25 199.38,-54.25 199.38,-35 264.12,-35 264.12,-54.25"/>
<text text-anchor="middle" x="231.75" y="-40.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M136.19,-56.9C153.96,-54.59 172.64,-52.17 188.66,-50.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="188.82,-53.47 198.28,-48.71 187.92,-46.53 188.82,-53.47"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="400.5,-133.25 346.25,-133.25 346.25,-114 400.5,-114 400.5,-133.25"/>
<text text-anchor="middle" x="373.38" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M291.96,-102.89C306.71,-106.7 322.11,-110.66 335.43,-114.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.52,-117.74 345.08,-116.85 336.27,-110.96 334.52,-117.74"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.12,-96.25 331.62,-96.25 331.62,-77 415.12,-77 415.12,-96.25"/>
<text text-anchor="middle" x="373.38" y="-82.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M291.96,-87.2C301.37,-87.13 311.04,-87.06 320.26,-87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="320.28,-90.49 330.25,-86.92 320.23,-83.49 320.28,-90.49"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="419.25,-56.25 327.5,-56.25 327.5,-37 419.25,-37 419.25,-56.25"/>
<text text-anchor="middle" x="373.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M264.43,-45.08C279.76,-45.3 298.62,-45.57 316.26,-45.82"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="316,-49.33 326.05,-45.98 316.1,-42.33 316,-49.33"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.5,-19.25 331.25,-19.25 331.25,0 415.5,0 415.5,-19.25"/>
<text text-anchor="middle" x="373.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge6_Node000005_Node000007" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M264.43,-36.68C281.26,-32.47 302.35,-27.18 321.41,-22.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="322.2,-25.56 331.05,-19.73 320.5,-18.77 322.2,-25.56"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 7.2 KiB

132
da/d0d/longest__common__string_8cpp_a23ab67b0d9600697695fc8679462d8fe_cgraph_org.svg Normal file
View File

@@ -0,0 +1,132 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test_longest_common_string_length_for_reversed_inputs Pages: 1 -->
<svg width="427pt" height="141pt"
viewBox="0.00 0.00 427.25 141.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 137.25)">
<title>test_longest_common_string_length_for_reversed_inputs</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
<polygon fill="#999999" stroke="#666666" points="136,-86.5 0,-86.5 0,-44.75 136,-44.75 136,-86.5"/>
<text text-anchor="start" x="8" y="-73" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="start" x="8" y="-61.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
<text text-anchor="middle" x="68" y="-50.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="291.5,-102.88 172,-102.88 172,-72.38 291.5,-72.38 291.5,-102.88"/>
<text text-anchor="start" x="180" y="-89.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="231.75" y="-78.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M136.19,-74.76C144.34,-75.87 152.68,-77.01 160.86,-78.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.13,-81.69 170.51,-79.57 161.07,-74.75 160.13,-81.69"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
<polygon fill="white" stroke="#666666" points="264.12,-54.25 199.38,-54.25 199.38,-35 264.12,-35 264.12,-54.25"/>
<text text-anchor="middle" x="231.75" y="-40.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge4_Node000001_Node000005" class="edge">
<title>Node1&#45;&gt;Node5</title>
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M136.19,-56.9C153.96,-54.59 172.64,-52.17 188.66,-50.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="188.82,-53.47 198.28,-48.71 187.92,-46.53 188.82,-53.47"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="400.5,-133.25 346.25,-133.25 346.25,-114 400.5,-114 400.5,-133.25"/>
<text text-anchor="middle" x="373.38" y="-119.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M291.96,-102.89C306.71,-106.7 322.11,-110.66 335.43,-114.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.52,-117.74 345.08,-116.85 336.27,-110.96 334.52,-117.74"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.12,-96.25 331.62,-96.25 331.62,-77 415.12,-77 415.12,-96.25"/>
<text text-anchor="middle" x="373.38" y="-82.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M291.96,-87.2C301.37,-87.13 311.04,-87.06 320.26,-87"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="320.28,-90.49 330.25,-86.92 320.23,-83.49 320.28,-90.49"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="419.25,-56.25 327.5,-56.25 327.5,-37 419.25,-37 419.25,-56.25"/>
<text text-anchor="middle" x="373.38" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M264.43,-45.08C279.76,-45.3 298.62,-45.57 316.26,-45.82"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="316,-49.33 326.05,-45.98 316.1,-42.33 316,-49.33"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.5,-19.25 331.25,-19.25 331.25,0 415.5,0 415.5,-19.25"/>
<text text-anchor="middle" x="373.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge6_Node000005_Node000007" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M264.43,-36.68C281.26,-32.47 302.35,-27.18 321.41,-22.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="322.2,-25.56 331.05,-19.73 320.5,-18.77 322.2,-25.56"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 6.4 KiB

25
da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map Normal file
View File

@@ -0,0 +1,25 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="runs all tests for longest_common_string_length funcion" alt="" coords="5,96,56,122"/>
<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" title=" " alt="" coords="142,5,253,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="41,94,67,67,102,41,127,30,129,35,105,46,70,71,45,98"/>
<area shape="rect" id="Node000003" href="$da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" title="checks the function longest_common_string_length agains example data" alt="" coords="123,55,272,96"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="56,101,108,91,109,96,57,107"/>
<area shape="rect" id="Node000007" href="$da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" title="checks if the function longest_common_string_length returns the same result when its inputs are rever..." alt="" coords="107,185,288,241"/>
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="46,120,72,145,105,171,113,175,110,180,102,175,69,149,42,124"/>
<area shape="rect" id="Node000011" href="$da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" title="checks if the function longest_common_string_length returns the same result when its argument are fli..." alt="" coords="104,121,291,161"/>
<area shape="poly" id="edge11_Node000001_Node000011" title=" " alt="" coords="57,111,90,117,89,123,56,116"/>
<area shape="rect" id="Node000004" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector" alt="" coords="339,121,498,161"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="269,94,334,113,332,118,268,99"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="571,84,644,110"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="498,120,556,106,558,111,500,125"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="552,133,663,159"/>
<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="499,140,537,142,537,147,499,146"/>
<area shape="poly" id="edge7_Node000007_Node000004" title=" " alt="" coords="284,182,339,164,341,169,286,187"/>
<area shape="rect" id="Node000008" href="$da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" title="reverses a given string" alt="" coords="376,200,462,226"/>
<area shape="poly" id="edge8_Node000007_Node000008" title=" " alt="" coords="288,210,360,210,360,216,288,216"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rbegin.html#" title=" " alt="" coords="546,193,669,219"/>
<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="462,209,531,206,531,212,462,214"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rend.html#" title=" " alt="" coords="551,243,664,268"/>
<area shape="poly" id="edge10_Node000008_Node000010" title=" " alt="" coords="463,220,538,237,536,242,462,225"/>
<area shape="poly" id="edge12_Node000011_Node000004" title=" " alt="" coords="291,138,324,138,324,144,291,144"/>
</map>

1
da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
46850fece54c89f8e6dc9e73df80b4f4

306
da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg Normal file
View File

@@ -0,0 +1,306 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: tests Pages: 1 -->
<!--zoomable 205 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<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="arrowUp" transform="translate(30 24)">
<use xlink:href="#rim"/>
<path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
<use xlink:href="#rim"/>
<path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
<use xlink:href="#rim"/>
<path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
<use xlink:href="#rim"/>
<path pointer-events="none" 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="application/ecmascript">
var viewWidth = 506;
var viewHeight = 205;
var sectionId = 'dynsection-7';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="runs all tests for longest_common_string_length funcion">
<polygon fill="#999999" stroke="#666666" points="37.75,-129.25 0,-129.25 0,-110 37.75,-110 37.75,-129.25"/>
<text text-anchor="middle" x="18.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="185.38,-197.25 102.62,-197.25 102.62,-178 185.38,-178 185.38,-197.25"/>
<text text-anchor="middle" x="144" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_test_cases</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28,-129.39C37.75,-140.48 55.14,-158.39 73.75,-168.62 79.48,-171.78 85.78,-174.44 92.16,-176.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="90.61,-180.17 101.2,-179.85 92.72,-173.5 90.61,-180.17"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" target="_top" xlink:title="checks the function longest_common_string_length agains example data">
<polygon fill="white" stroke="#666666" points="200,-159.88 88,-159.88 88,-129.38 200,-129.38 200,-159.88"/>
<text text-anchor="start" x="96" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="144" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.04,-123.31C48.65,-125.47 62.75,-128.33 77.16,-131.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.17,-134.83 86.66,-133.39 77.56,-127.97 76.17,-134.83"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
<polygon fill="white" stroke="#666666" points="212,-62.5 76,-62.5 76,-20.75 212,-20.75 212,-62.5"/>
<text text-anchor="start" x="84" y="-49" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="start" x="84" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
<text text-anchor="middle" x="144" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M29.04,-109.77C39.19,-99.27 56.43,-82.68 73.75,-71.62 75.72,-70.36 77.76,-69.13 79.84,-67.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.05,-70.72 88.18,-62.89 77.72,-64.56 81.05,-70.72"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
<polygon fill="white" stroke="#666666" points="214.25,-110.88 73.75,-110.88 73.75,-80.38 214.25,-80.38 214.25,-110.88"/>
<text text-anchor="start" x="81.75" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="144" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node11 -->
<g id="edge11_Node000001_Node000011" class="edge">
<title>Node1&#45;&gt;Node11</title>
<g id="a_edge11_Node000001_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.04,-116.08C45.09,-114.71 53.68,-113.04 62.88,-111.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="63.33,-114.52 72.48,-109.18 61.99,-107.65 63.33,-114.52"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="369.75,-110.88 250.25,-110.88 250.25,-80.38 369.75,-80.38 369.75,-110.88"/>
<text text-anchor="start" x="258.25" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="310" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M197.34,-128.99C212.8,-124.37 229.88,-119.26 245.94,-114.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.73,-117.58 255.31,-111.37 244.73,-110.88 246.73,-117.58"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="478.75,-138.25 424.5,-138.25 424.5,-119 478.75,-119 478.75,-138.25"/>
<text text-anchor="middle" x="451.62" y="-124.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M370.21,-109.62C384.96,-113.11 400.36,-116.74 413.68,-119.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="412.79,-123.52 423.33,-122.41 414.4,-116.7 412.79,-123.52"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="493.38,-101.25 409.88,-101.25 409.88,-82 493.38,-82 493.38,-101.25"/>
<text text-anchor="middle" x="451.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M370.21,-93.93C379.62,-93.66 389.29,-93.38 398.51,-93.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="398.61,-96.59 408.5,-92.8 398.41,-89.59 398.61,-96.59"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge7_Node000007_Node000004" class="edge">
<title>Node7&#45;&gt;Node4</title>
<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M209.82,-62.97C223.38,-67.43 237.6,-72.12 250.9,-76.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="249.75,-80.13 260.34,-79.93 251.94,-73.48 249.75,-80.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
<polygon fill="white" stroke="#666666" points="342.38,-51.25 277.62,-51.25 277.62,-32 342.38,-32 342.38,-51.25"/>
<text text-anchor="middle" x="310" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge8_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M212.18,-41.62C230.43,-41.62 249.7,-41.62 266.2,-41.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="266.14,-45.13 276.14,-41.62 266.14,-38.13 266.14,-45.13"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="497.5,-56.25 405.75,-56.25 405.75,-37 497.5,-37 497.5,-56.25"/>
<text text-anchor="middle" x="451.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge9_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M342.68,-42.76C358.01,-43.31 376.87,-43.98 394.51,-44.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394.18,-48.14 404.3,-45 394.43,-41.15 394.18,-48.14"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="493.75,-19.25 409.5,-19.25 409.5,0 493.75,0 493.75,-19.25"/>
<text text-anchor="middle" x="451.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node10 -->
<g id="edge10_Node000008_Node000010" class="edge">
<title>Node8&#45;&gt;Node10</title>
<g id="a_edge10_Node000008_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M342.68,-34.36C359.24,-30.57 379.92,-25.83 398.74,-21.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="399.29,-24.75 408.26,-19.11 397.73,-17.93 399.29,-24.75"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node4 -->
<g id="edge12_Node000011_Node000004" class="edge">
<title>Node11&#45;&gt;Node4</title>
<g id="a_edge12_Node000011_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M214.55,-95.62C222.65,-95.62 230.92,-95.62 239.03,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="238.96,-99.13 248.96,-95.62 238.96,-92.13 238.96,-99.13"/>
</a>
</g>
</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()"/>
<use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
<use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
<use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
<use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
</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="longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_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>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 15 KiB

224
da/d0d/longest__common__string_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg Normal file
View File

@@ -0,0 +1,224 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: tests Pages: 1 -->
<svg width="506pt" height="205pt"
viewBox="0.00 0.00 505.50 205.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 201.25)">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="runs all tests for longest_common_string_length funcion">
<polygon fill="#999999" stroke="#666666" points="37.75,-129.25 0,-129.25 0,-110 37.75,-110 37.75,-129.25"/>
<text text-anchor="middle" x="18.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="185.38,-197.25 102.62,-197.25 102.62,-178 185.38,-178 185.38,-197.25"/>
<text text-anchor="middle" x="144" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_test_cases</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M28,-129.39C37.75,-140.48 55.14,-158.39 73.75,-168.62 79.48,-171.78 85.78,-174.44 92.16,-176.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="90.61,-180.17 101.2,-179.85 92.72,-173.5 90.61,-180.17"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" target="_top" xlink:title="checks the function longest_common_string_length agains example data">
<polygon fill="white" stroke="#666666" points="200,-159.88 88,-159.88 88,-129.38 200,-129.38 200,-159.88"/>
<text text-anchor="start" x="96" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="144" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.04,-123.31C48.65,-125.47 62.75,-128.33 77.16,-131.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="76.17,-134.83 86.66,-133.39 77.56,-127.97 76.17,-134.83"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
<polygon fill="white" stroke="#666666" points="212,-62.5 76,-62.5 76,-20.75 212,-20.75 212,-62.5"/>
<text text-anchor="start" x="84" y="-49" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="start" x="84" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
<text text-anchor="middle" x="144" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node7 -->
<g id="edge6_Node000001_Node000007" class="edge">
<title>Node1&#45;&gt;Node7</title>
<g id="a_edge6_Node000001_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M29.04,-109.77C39.19,-99.27 56.43,-82.68 73.75,-71.62 75.72,-70.36 77.76,-69.13 79.84,-67.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="81.05,-70.72 88.18,-62.89 77.72,-64.56 81.05,-70.72"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
<polygon fill="white" stroke="#666666" points="214.25,-110.88 73.75,-110.88 73.75,-80.38 214.25,-80.38 214.25,-110.88"/>
<text text-anchor="start" x="81.75" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="144" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node11 -->
<g id="edge11_Node000001_Node000011" class="edge">
<title>Node1&#45;&gt;Node11</title>
<g id="a_edge11_Node000001_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M38.04,-116.08C45.09,-114.71 53.68,-113.04 62.88,-111.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="63.33,-114.52 72.48,-109.18 61.99,-107.65 63.33,-114.52"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="369.75,-110.88 250.25,-110.88 250.25,-80.38 369.75,-80.38 369.75,-110.88"/>
<text text-anchor="start" x="258.25" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="310" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3_Node000003_Node000004" class="edge">
<title>Node3&#45;&gt;Node4</title>
<g id="a_edge3_Node000003_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M197.34,-128.99C212.8,-124.37 229.88,-119.26 245.94,-114.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="246.73,-117.58 255.31,-111.37 244.73,-110.88 246.73,-117.58"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="478.75,-138.25 424.5,-138.25 424.5,-119 478.75,-119 478.75,-138.25"/>
<text text-anchor="middle" x="451.62" y="-124.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M370.21,-109.62C384.96,-113.11 400.36,-116.74 413.68,-119.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="412.79,-123.52 423.33,-122.41 414.4,-116.7 412.79,-123.52"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="493.38,-101.25 409.88,-101.25 409.88,-82 493.38,-82 493.38,-101.25"/>
<text text-anchor="middle" x="451.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node6 -->
<g id="edge5_Node000004_Node000006" class="edge">
<title>Node4&#45;&gt;Node6</title>
<g id="a_edge5_Node000004_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M370.21,-93.93C379.62,-93.66 389.29,-93.38 398.51,-93.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="398.61,-96.59 408.5,-92.8 398.41,-89.59 398.61,-96.59"/>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge7_Node000007_Node000004" class="edge">
<title>Node7&#45;&gt;Node4</title>
<g id="a_edge7_Node000007_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M209.82,-62.97C223.38,-67.43 237.6,-72.12 250.9,-76.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="249.75,-80.13 260.34,-79.93 251.94,-73.48 249.75,-80.13"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
<polygon fill="white" stroke="#666666" points="342.38,-51.25 277.62,-51.25 277.62,-32 342.38,-32 342.38,-51.25"/>
<text text-anchor="middle" x="310" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge8_Node000007_Node000008" class="edge">
<title>Node7&#45;&gt;Node8</title>
<g id="a_edge8_Node000007_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M212.18,-41.62C230.43,-41.62 249.7,-41.62 266.2,-41.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="266.14,-45.13 276.14,-41.62 266.14,-38.13 266.14,-45.13"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="497.5,-56.25 405.75,-56.25 405.75,-37 497.5,-37 497.5,-56.25"/>
<text text-anchor="middle" x="451.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge9_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M342.68,-42.76C358.01,-43.31 376.87,-43.98 394.51,-44.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="394.18,-48.14 404.3,-45 394.43,-41.15 394.18,-48.14"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="493.75,-19.25 409.5,-19.25 409.5,0 493.75,0 493.75,-19.25"/>
<text text-anchor="middle" x="451.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node10 -->
<g id="edge10_Node000008_Node000010" class="edge">
<title>Node8&#45;&gt;Node10</title>
<g id="a_edge10_Node000008_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M342.68,-34.36C359.24,-30.57 379.92,-25.83 398.74,-21.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="399.29,-24.75 408.26,-19.11 397.73,-17.93 399.29,-24.75"/>
</a>
</g>
</g>
<!-- Node11&#45;&gt;Node4 -->
<g id="edge12_Node000011_Node000004" class="edge">
<title>Node11&#45;&gt;Node4</title>
<g id="a_edge12_Node000011_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M214.55,-95.62C222.65,-95.62 230.92,-95.62 239.03,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="238.96,-99.13 248.96,-95.62 238.96,-92.13 238.96,-99.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 11 KiB

9
da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="test_longest_common_string_length" name="test_longest_common_string_length">
<area shape="rect" id="Node000001" title="checks the function longest_common_string_length agains example data" alt="" coords="5,23,155,64"/>
<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector" alt="" coords="203,23,362,64"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="155,41,188,41,188,46,155,46"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="430,5,502,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="362,30,414,22,415,28,363,35"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="410,55,521,80"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="363,51,396,56,395,61,362,57"/>
</map>

1
da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
f09f0a87cf628224b4a6560d9c733be5

102
da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph.svg Normal file
View File

@@ -0,0 +1,102 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test_longest_common_string_length Pages: 1 -->
<svg width="395pt" height="64pt"
viewBox="0.00 0.00 395.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>test_longest_common_string_length</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="checks the function longest_common_string_length agains example data">
<polygon fill="#999999" stroke="#666666" points="112,-42.88 0,-42.88 0,-12.37 112,-12.37 112,-42.88"/>
<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="56" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="267.5,-42.88 148,-42.88 148,-12.37 267.5,-12.37 267.5,-42.88"/>
<text text-anchor="start" x="156" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="207.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.34,-27.62C120.33,-27.62 128.64,-27.62 136.88,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.62,-31.13 146.62,-27.62 136.62,-24.13 136.62,-31.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="372.38,-56.25 318.12,-56.25 318.12,-37 372.38,-37 372.38,-56.25"/>
<text text-anchor="middle" x="345.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M267.79,-35.9C281.11,-37.77 294.89,-39.7 307.02,-41.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="306.25,-44.97 316.64,-42.89 307.22,-38.04 306.25,-44.97"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="387,-19.25 303.5,-19.25 303.5,0 387,0 387,-19.25"/>
<text text-anchor="middle" x="345.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M267.79,-19.78C276.03,-18.69 284.44,-17.57 292.53,-16.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="292.86,-19.85 302.31,-15.06 291.93,-12.91 292.86,-19.85"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.4 KiB

77
da/d0d/longest__common__string_8cpp_a9b229daad982a186a4d8d90aa8f38561_cgraph_org.svg Normal file
View File

@@ -0,0 +1,77 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test_longest_common_string_length Pages: 1 -->
<svg width="395pt" height="64pt"
viewBox="0.00 0.00 395.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>test_longest_common_string_length</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="checks the function longest_common_string_length agains example data">
<polygon fill="#999999" stroke="#666666" points="112,-42.88 0,-42.88 0,-12.37 112,-12.37 112,-42.88"/>
<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="56" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="267.5,-42.88 148,-42.88 148,-12.37 267.5,-12.37 267.5,-42.88"/>
<text text-anchor="start" x="156" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="207.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M112.34,-27.62C120.33,-27.62 128.64,-27.62 136.88,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.62,-31.13 146.62,-27.62 136.62,-24.13 136.62,-31.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="372.38,-56.25 318.12,-56.25 318.12,-37 372.38,-37 372.38,-56.25"/>
<text text-anchor="middle" x="345.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M267.79,-35.9C281.11,-37.77 294.89,-39.7 307.02,-41.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="306.25,-44.97 316.64,-42.89 307.22,-38.04 306.25,-44.97"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="387,-19.25 303.5,-19.25 303.5,0 387,0 387,-19.25"/>
<text text-anchor="middle" x="345.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M267.79,-19.78C276.03,-18.69 284.44,-17.57 292.53,-16.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="292.86,-19.85 302.31,-15.06 291.93,-12.91 292.86,-19.85"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.7 KiB

7
da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="longest_common_string_length" name="longest_common_string_length">
<area shape="rect" id="Node000001" title="for std::vector" alt="" coords="5,23,165,64"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="232,5,305,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="165,30,217,22,218,28,165,35"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="213,55,324,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="165,51,198,56,198,61,165,57"/>
</map>

1
da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
26d4238d9f904f6a87378ebb25bd747e

83
da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph.svg Normal file
View File

@@ -0,0 +1,83 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: longest_common_string_length Pages: 1 -->
<svg width="247pt" height="64pt"
viewBox="0.00 0.00 247.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>longest_common_string_length</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="for std::vector">
<polygon fill="#999999" stroke="#666666" points="119.5,-42.88 0,-42.88 0,-12.37 119.5,-12.37 119.5,-42.88"/>
<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="59.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="224.38,-56.25 170.12,-56.25 170.12,-37 224.38,-37 224.38,-56.25"/>
<text text-anchor="middle" x="197.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.79,-35.9C133.11,-37.77 146.89,-39.7 159.02,-41.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.25,-44.97 168.64,-42.89 159.22,-38.04 158.25,-44.97"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="239,-19.25 155.5,-19.25 155.5,0 239,0 239,-19.25"/>
<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.79,-19.78C128.03,-18.69 136.44,-17.57 144.53,-16.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.86,-19.85 154.31,-15.06 143.93,-12.91 144.86,-19.85"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.4 KiB

58
da/d0d/longest__common__string_8cpp_aa38b6b17bc5d46ed88acdd8414e18fa5_cgraph_org.svg Normal file
View File

@@ -0,0 +1,58 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: longest_common_string_length Pages: 1 -->
<svg width="247pt" height="64pt"
viewBox="0.00 0.00 247.00 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>longest_common_string_length</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="for std::vector">
<polygon fill="#999999" stroke="#666666" points="119.5,-42.88 0,-42.88 0,-12.37 119.5,-12.37 119.5,-42.88"/>
<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="59.75" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="224.38,-56.25 170.12,-56.25 170.12,-37 224.38,-37 224.38,-56.25"/>
<text text-anchor="middle" x="197.25" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.79,-35.9C133.11,-37.77 146.89,-39.7 159.02,-41.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.25,-44.97 168.64,-42.89 159.22,-38.04 158.25,-44.97"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="239,-19.25 155.5,-19.25 155.5,0 239,0 239,-19.25"/>
<text text-anchor="middle" x="197.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M119.79,-19.78C128.03,-18.69 136.44,-17.57 144.53,-16.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="144.86,-19.85 154.31,-15.06 143.93,-12.91 144.86,-19.85"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.6 KiB

7
da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="reverse_str" name="reverse_str">
<area shape="rect" id="Node000001" title="reverses a given string" alt="" coords="5,31,92,56"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rbegin.html#" title=" " alt="" coords="140,5,262,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="92,34,124,28,125,33,93,39"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rend.html#" title=" " alt="" coords="145,55,257,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="93,48,130,54,129,59,92,53"/>
</map>

1
da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
62bba1e3ba4c0f13c529cdd88132faa3

82
da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph.svg Normal file
View File

@@ -0,0 +1,82 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: reverse_str Pages: 1 -->
<svg width="201pt" height="64pt"
viewBox="0.00 0.00 200.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>reverse_str</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="reverses a given string">
<polygon fill="#999999" stroke="#666666" points="64.75,-37.25 0,-37.25 0,-18 64.75,-18 64.75,-37.25"/>
<text text-anchor="middle" x="32.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="192.5,-56.25 100.75,-56.25 100.75,-37 192.5,-37 192.5,-56.25"/>
<text text-anchor="middle" x="146.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M65.24,-33.02C72.9,-34.31 81.3,-35.74 89.7,-37.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.83,-40.73 99.27,-38.95 90,-33.83 88.83,-40.73"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="188.75,-19.25 104.5,-19.25 104.5,0 188.75,0 188.75,-19.25"/>
<text text-anchor="middle" x="146.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M65.24,-22.52C74,-21.11 83.74,-19.55 93.32,-18.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="93.7,-21.34 103.02,-16.3 92.59,-14.42 93.7,-21.34"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.3 KiB

57
da/d0d/longest__common__string_8cpp_acb03dbbcee6d607db471021168be8541_cgraph_org.svg Normal file
View File

@@ -0,0 +1,57 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: reverse_str Pages: 1 -->
<svg width="201pt" height="64pt"
viewBox="0.00 0.00 200.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>reverse_str</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="reverses a given string">
<polygon fill="#999999" stroke="#666666" points="64.75,-37.25 0,-37.25 0,-18 64.75,-18 64.75,-37.25"/>
<text text-anchor="middle" x="32.38" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="192.5,-56.25 100.75,-56.25 100.75,-37 192.5,-37 192.5,-56.25"/>
<text text-anchor="middle" x="146.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M65.24,-33.02C72.9,-34.31 81.3,-35.74 89.7,-37.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.83,-40.73 99.27,-38.95 90,-33.83 88.83,-40.73"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="188.75,-19.25 104.5,-19.25 104.5,0 188.75,0 188.75,-19.25"/>
<text text-anchor="middle" x="146.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M65.24,-22.52C74,-21.11 83.74,-19.55 93.32,-18.01"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="93.7,-21.34 103.02,-16.3 92.59,-14.42 93.7,-21.34"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.5 KiB

9
da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="test_longest_common_string_length_is_symmetric" name="test_longest_common_string_length_is_symmetric">
<area shape="rect" id="Node000001" title="checks if the function longest_common_string_length returns the same result when its argument are fli..." alt="" coords="5,23,193,64"/>
<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector" alt="" coords="241,23,400,64"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,41,226,41,226,46,193,46"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="468,5,540,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="400,30,452,22,453,28,401,35"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="448,55,559,80"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="401,51,434,56,433,61,400,57"/>
</map>

1
da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
21321f907213a73c8aa5e812b13042c3

102
da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph.svg Normal file
View File

@@ -0,0 +1,102 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test_longest_common_string_length_is_symmetric Pages: 1 -->
<svg width="424pt" height="64pt"
viewBox="0.00 0.00 423.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>test_longest_common_string_length_is_symmetric</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
<polygon fill="#999999" stroke="#666666" points="140.5,-42.88 0,-42.88 0,-12.37 140.5,-12.37 140.5,-42.88"/>
<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="70.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="296,-42.88 176.5,-42.88 176.5,-12.37 296,-12.37 296,-42.88"/>
<text text-anchor="start" x="184.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="236.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M140.8,-27.62C148.9,-27.62 157.17,-27.62 165.28,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="165.21,-31.13 175.21,-27.62 165.21,-24.13 165.21,-31.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="400.88,-56.25 346.62,-56.25 346.62,-37 400.88,-37 400.88,-56.25"/>
<text text-anchor="middle" x="373.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M296.29,-35.9C309.61,-37.77 323.39,-39.7 335.52,-41.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.75,-44.97 345.14,-42.89 335.72,-38.04 334.75,-44.97"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.5,-19.25 332,-19.25 332,0 415.5,0 415.5,-19.25"/>
<text text-anchor="middle" x="373.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M296.29,-19.78C304.53,-18.69 312.94,-17.57 321.03,-16.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.36,-19.85 330.81,-15.06 320.43,-12.91 321.36,-19.85"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.5 KiB

77
da/d0d/longest__common__string_8cpp_ad1e613c1b85cc04ed931b6c745fec155_cgraph_org.svg Normal file
View File

@@ -0,0 +1,77 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: test_longest_common_string_length_is_symmetric Pages: 1 -->
<svg width="424pt" height="64pt"
viewBox="0.00 0.00 423.50 64.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 60.25)">
<title>test_longest_common_string_length_is_symmetric</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
<polygon fill="#999999" stroke="#666666" points="140.5,-42.88 0,-42.88 0,-12.37 140.5,-12.37 140.5,-42.88"/>
<text text-anchor="start" x="8" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="70.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="296,-42.88 176.5,-42.88 176.5,-12.37 296,-12.37 296,-42.88"/>
<text text-anchor="start" x="184.5" y="-29.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="236.25" y="-18.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M140.8,-27.62C148.9,-27.62 157.17,-27.62 165.28,-27.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="165.21,-31.13 175.21,-27.62 165.21,-24.13 165.21,-31.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="400.88,-56.25 346.62,-56.25 346.62,-37 400.88,-37 400.88,-56.25"/>
<text text-anchor="middle" x="373.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M296.29,-35.9C309.61,-37.77 323.39,-39.7 335.52,-41.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.75,-44.97 345.14,-42.89 335.72,-38.04 334.75,-44.97"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.5,-19.25 332,-19.25 332,0 415.5,0 415.5,-19.25"/>
<text text-anchor="middle" x="373.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M296.29,-19.78C304.53,-18.69 312.94,-17.57 321.03,-16.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="321.36,-19.85 330.81,-15.06 320.43,-12.91 321.36,-19.85"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.8 KiB

27
da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,27 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,96,55,122"/>
<area shape="rect" id="Node000002" href="$da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="runs all tests for longest_common_string_length funcion" alt="" coords="103,96,153,122"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,106,88,106,88,112,55,112"/>
<area shape="rect" id="Node000003" href="$da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" title=" " alt="" coords="240,5,350,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="138,94,164,67,200,41,224,30,227,35,202,46,168,71,142,98"/>
<area shape="rect" id="Node000004" href="$da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" title="checks the function longest_common_string_length agains example data" alt="" coords="220,55,369,96"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="153,101,205,91,206,96,154,107"/>
<area shape="rect" id="Node000008" href="$da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" title="checks if the function longest_common_string_length returns the same result when its inputs are rever..." alt="" coords="204,185,385,241"/>
<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="143,120,169,145,203,171,211,175,208,180,199,175,166,149,140,124"/>
<area shape="rect" id="Node000012" href="$da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" title="checks if the function longest_common_string_length returns the same result when its argument are fli..." alt="" coords="201,121,388,161"/>
<area shape="poly" id="edge12_Node000002_Node000012" title=" " alt="" coords="154,111,187,117,186,123,153,116"/>
<area shape="rect" id="Node000005" href="$da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector" alt="" coords="436,121,596,161"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="367,94,431,113,430,118,365,99"/>
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="669,84,741,110"/>
<area shape="poly" id="edge5_Node000005_Node000006" title=" " alt="" coords="596,120,654,106,655,111,597,125"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/size.html#" title=" " alt="" coords="649,133,761,159"/>
<area shape="poly" id="edge6_Node000005_Node000007" title=" " alt="" coords="596,140,634,142,634,147,596,146"/>
<area shape="poly" id="edge8_Node000008_Node000005" title=" " alt="" coords="382,182,436,164,438,169,383,187"/>
<area shape="rect" id="Node000009" href="$da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" title="reverses a given string" alt="" coords="473,200,559,226"/>
<area shape="poly" id="edge9_Node000008_Node000009" title=" " alt="" coords="386,210,458,210,458,216,386,216"/>
<area shape="rect" id="Node000010" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rbegin.html#" title=" " alt="" coords="644,193,766,219"/>
<area shape="poly" id="edge10_Node000009_Node000010" title=" " alt="" coords="559,209,629,206,629,212,560,214"/>
<area shape="rect" id="Node000011" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/rend.html#" title=" " alt="" coords="649,243,761,268"/>
<area shape="poly" id="edge11_Node000009_Node000011" title=" " alt="" coords="560,220,635,237,634,242,559,225"/>
<area shape="poly" id="edge13_Node000012_Node000005" title=" " alt="" coords="389,138,421,138,421,144,389,144"/>
</map>

1
da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
284810262f13421741eda0349c687db5

324
da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,324 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 205 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<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="arrowUp" transform="translate(30 24)">
<use xlink:href="#rim"/>
<path pointer-events="none" 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" transform="rotate(90) translate(36 -43)">
<use xlink:href="#rim"/>
<path pointer-events="none" 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" transform="rotate(180) translate(-30 -48)">
<use xlink:href="#rim"/>
<path pointer-events="none" 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" transform="rotate(270) translate(-36 17)">
<use xlink:href="#rim"/>
<path pointer-events="none" 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="application/ecmascript">
var viewWidth = 579;
var viewHeight = 205;
var sectionId = 'dynsection-2';
</script>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-129.25 0,-129.25 0,-110 37,-110 37,-129.25"/>
<text text-anchor="middle" x="18.5" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="runs all tests for longest_common_string_length funcion">
<polygon fill="white" stroke="#666666" points="110.75,-129.25 73,-129.25 73,-110 110.75,-110 110.75,-129.25"/>
<text text-anchor="middle" x="91.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-119.62C44.64,-119.62 53.57,-119.62 61.98,-119.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-123.13 71.94,-119.62 61.94,-116.13 61.94,-123.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="258.38,-197.25 175.62,-197.25 175.62,-178 258.38,-178 258.38,-197.25"/>
<text text-anchor="middle" x="217" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_test_cases</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101,-129.39C110.75,-140.48 128.14,-158.39 146.75,-168.62 152.48,-171.78 158.78,-174.44 165.16,-176.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.61,-180.17 174.2,-179.85 165.72,-173.5 163.61,-180.17"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" target="_top" xlink:title="checks the function longest_common_string_length agains example data">
<polygon fill="white" stroke="#666666" points="273,-159.88 161,-159.88 161,-129.38 273,-129.38 273,-159.88"/>
<text text-anchor="start" x="169" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="217" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.04,-123.31C121.65,-125.47 135.75,-128.33 150.16,-131.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="149.17,-134.83 159.66,-133.39 150.56,-127.97 149.17,-134.83"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
<polygon fill="white" stroke="#666666" points="285,-62.5 149,-62.5 149,-20.75 285,-20.75 285,-62.5"/>
<text text-anchor="start" x="157" y="-49" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="start" x="157" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
<text text-anchor="middle" x="217" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7_Node000002_Node000008" class="edge">
<title>Node2&#45;&gt;Node8</title>
<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M102.04,-109.77C112.19,-99.27 129.43,-82.68 146.75,-71.62 148.72,-70.36 150.76,-69.13 152.84,-67.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.05,-70.72 161.18,-62.89 150.72,-64.56 154.05,-70.72"/>
</a>
</g>
</g>
<!-- Node12 -->
<g id="Node000012" class="node">
<title>Node12</title>
<g id="a_Node000012"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
<polygon fill="white" stroke="#666666" points="287.25,-110.88 146.75,-110.88 146.75,-80.38 287.25,-80.38 287.25,-110.88"/>
<text text-anchor="start" x="154.75" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="217" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node12 -->
<g id="edge12_Node000002_Node000012" class="edge">
<title>Node2&#45;&gt;Node12</title>
<g id="a_edge12_Node000002_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.04,-116.08C118.09,-114.71 126.68,-113.04 135.88,-111.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.33,-114.52 145.48,-109.18 134.99,-107.65 136.33,-114.52"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="442.75,-110.88 323.25,-110.88 323.25,-80.38 442.75,-80.38 442.75,-110.88"/>
<text text-anchor="start" x="331.25" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="383" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.34,-128.99C285.8,-124.37 302.88,-119.26 318.94,-114.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="319.73,-117.58 328.31,-111.37 317.73,-110.88 319.73,-117.58"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="551.75,-138.25 497.5,-138.25 497.5,-119 551.75,-119 551.75,-138.25"/>
<text text-anchor="middle" x="524.62" y="-124.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M443.21,-109.62C457.96,-113.11 473.36,-116.74 486.68,-119.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="485.79,-123.52 496.33,-122.41 487.4,-116.7 485.79,-123.52"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="566.38,-101.25 482.88,-101.25 482.88,-82 566.38,-82 566.38,-101.25"/>
<text text-anchor="middle" x="524.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge6_Node000005_Node000007" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M443.21,-93.93C452.62,-93.66 462.29,-93.38 471.51,-93.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="471.61,-96.59 481.5,-92.8 471.41,-89.59 471.61,-96.59"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge8_Node000008_Node000005" class="edge">
<title>Node8&#45;&gt;Node5</title>
<g id="a_edge8_Node000008_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M282.82,-62.97C296.38,-67.43 310.6,-72.12 323.9,-76.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="322.75,-80.13 333.34,-79.93 324.94,-73.48 322.75,-80.13"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
<polygon fill="white" stroke="#666666" points="415.38,-51.25 350.62,-51.25 350.62,-32 415.38,-32 415.38,-51.25"/>
<text text-anchor="middle" x="383" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge9_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M285.18,-41.62C303.43,-41.62 322.7,-41.62 339.2,-41.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="339.14,-45.13 349.14,-41.62 339.14,-38.13 339.14,-45.13"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="570.5,-56.25 478.75,-56.25 478.75,-37 570.5,-37 570.5,-56.25"/>
<text text-anchor="middle" x="524.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node10 -->
<g id="edge10_Node000009_Node000010" class="edge">
<title>Node9&#45;&gt;Node10</title>
<g id="a_edge10_Node000009_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M415.68,-42.76C431.01,-43.31 449.87,-43.98 467.51,-44.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="467.18,-48.14 477.3,-45 467.43,-41.15 467.18,-48.14"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="566.75,-19.25 482.5,-19.25 482.5,0 566.75,0 566.75,-19.25"/>
<text text-anchor="middle" x="524.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node11 -->
<g id="edge11_Node000009_Node000011" class="edge">
<title>Node9&#45;&gt;Node11</title>
<g id="a_edge11_Node000009_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M415.68,-34.36C432.24,-30.57 452.92,-25.83 471.74,-21.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="472.29,-24.75 481.26,-19.11 470.73,-17.93 472.29,-24.75"/>
</a>
</g>
</g>
<!-- Node12&#45;&gt;Node5 -->
<g id="edge13_Node000012_Node000005" class="edge">
<title>Node12&#45;&gt;Node5</title>
<g id="a_edge13_Node000012_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M287.55,-95.62C295.65,-95.62 303.92,-95.62 312.03,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="311.96,-99.13 321.96,-95.62 311.96,-92.13 311.96,-99.13"/>
</a>
</g>
</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()"/>
<use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
<use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
<use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
<use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
</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="longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_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>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 16 KiB

242
da/d0d/longest__common__string_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg Normal file
View File

@@ -0,0 +1,242 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: main Pages: 1 -->
<svg width="579pt" height="205pt"
viewBox="0.00 0.00 578.50 205.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 201.25)">
<title>main</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Main function.">
<polygon fill="#999999" stroke="#666666" points="37,-129.25 0,-129.25 0,-110 37,-110 37,-129.25"/>
<text text-anchor="middle" x="18.5" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="runs all tests for longest_common_string_length funcion">
<polygon fill="white" stroke="#666666" points="110.75,-129.25 73,-129.25 73,-110 110.75,-110 110.75,-129.25"/>
<text text-anchor="middle" x="91.88" y="-115.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.14,-119.62C44.64,-119.62 53.57,-119.62 61.98,-119.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.94,-123.13 71.94,-119.62 61.94,-116.13 61.94,-123.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="258.38,-197.25 175.62,-197.25 175.62,-178 258.38,-178 258.38,-197.25"/>
<text text-anchor="middle" x="217" y="-183.75" font-family="Helvetica,sans-Serif" font-size="10.00">get_test_cases</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M101,-129.39C110.75,-140.48 128.14,-158.39 146.75,-168.62 152.48,-171.78 158.78,-174.44 165.16,-176.67"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="163.61,-180.17 174.2,-179.85 165.72,-173.5 163.61,-180.17"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561" target="_top" xlink:title="checks the function longest_common_string_length agains example data">
<polygon fill="white" stroke="#666666" points="273,-159.88 161,-159.88 161,-129.38 273,-129.38 273,-159.88"/>
<text text-anchor="start" x="169" y="-146.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="217" y="-135.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.04,-123.31C121.65,-125.47 135.75,-128.33 150.16,-131.26"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="149.17,-134.83 159.66,-133.39 150.56,-127.97 149.17,-134.83"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its inputs are rever...">
<polygon fill="white" stroke="#666666" points="285,-62.5 149,-62.5 149,-20.75 285,-20.75 285,-62.5"/>
<text text-anchor="start" x="157" y="-49" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="start" x="157" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_for_reversed</text>
<text text-anchor="middle" x="217" y="-26.5" font-family="Helvetica,sans-Serif" font-size="10.00">_inputs</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node8 -->
<g id="edge7_Node000002_Node000008" class="edge">
<title>Node2&#45;&gt;Node8</title>
<g id="a_edge7_Node000002_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M102.04,-109.77C112.19,-99.27 129.43,-82.68 146.75,-71.62 148.72,-70.36 150.76,-69.13 152.84,-67.93"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="154.05,-70.72 161.18,-62.89 150.72,-64.56 154.05,-70.72"/>
</a>
</g>
</g>
<!-- Node12 -->
<g id="Node000012" class="node">
<title>Node12</title>
<g id="a_Node000012"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155" target="_top" xlink:title="checks if the function longest_common_string_length returns the same result when its argument are fli...">
<polygon fill="white" stroke="#666666" points="287.25,-110.88 146.75,-110.88 146.75,-80.38 287.25,-80.38 287.25,-110.88"/>
<text text-anchor="start" x="154.75" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">test_longest_common</text>
<text text-anchor="middle" x="217" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_string_length_is_symmetric</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node12 -->
<g id="edge12_Node000002_Node000012" class="edge">
<title>Node2&#45;&gt;Node12</title>
<g id="a_edge12_Node000002_Node000012"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M111.04,-116.08C118.09,-114.71 126.68,-113.04 135.88,-111.24"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="136.33,-114.52 145.48,-109.18 134.99,-107.65 136.33,-114.52"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" target="_top" xlink:title="for std::vector">
<polygon fill="white" stroke="#666666" points="442.75,-110.88 323.25,-110.88 323.25,-80.38 442.75,-80.38 442.75,-110.88"/>
<text text-anchor="start" x="331.25" y="-97.38" font-family="Helvetica,sans-Serif" font-size="10.00">longest_common_string</text>
<text text-anchor="middle" x="383" y="-86.12" font-family="Helvetica,sans-Serif" font-size="10.00">_length</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge4_Node000004_Node000005" class="edge">
<title>Node4&#45;&gt;Node5</title>
<g id="a_edge4_Node000004_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M270.34,-128.99C285.8,-124.37 302.88,-119.26 318.94,-114.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="319.73,-117.58 328.31,-111.37 317.73,-110.88 319.73,-117.58"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="551.75,-138.25 497.5,-138.25 497.5,-119 551.75,-119 551.75,-138.25"/>
<text text-anchor="middle" x="524.62" y="-124.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge5_Node000005_Node000006" class="edge">
<title>Node5&#45;&gt;Node6</title>
<g id="a_edge5_Node000005_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M443.21,-109.62C457.96,-113.11 473.36,-116.74 486.68,-119.89"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="485.79,-123.52 496.33,-122.41 487.4,-116.7 485.79,-123.52"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="566.38,-101.25 482.88,-101.25 482.88,-82 566.38,-82 566.38,-101.25"/>
<text text-anchor="middle" x="524.62" y="-87.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node7 -->
<g id="edge6_Node000005_Node000007" class="edge">
<title>Node5&#45;&gt;Node7</title>
<g id="a_edge6_Node000005_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M443.21,-93.93C452.62,-93.66 462.29,-93.38 471.51,-93.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="471.61,-96.59 481.5,-92.8 471.41,-89.59 471.61,-96.59"/>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge8_Node000008_Node000005" class="edge">
<title>Node8&#45;&gt;Node5</title>
<g id="a_edge8_Node000008_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M282.82,-62.97C296.38,-67.43 310.6,-72.12 323.9,-76.5"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="322.75,-80.13 333.34,-79.93 324.94,-73.48 322.75,-80.13"/>
</a>
</g>
</g>
<!-- Node9 -->
<g id="Node000009" class="node">
<title>Node9</title>
<g id="a_Node000009"><a xlink:href="../../da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541" target="_top" xlink:title="reverses a given string">
<polygon fill="white" stroke="#666666" points="415.38,-51.25 350.62,-51.25 350.62,-32 415.38,-32 415.38,-51.25"/>
<text text-anchor="middle" x="383" y="-37.75" font-family="Helvetica,sans-Serif" font-size="10.00">reverse_str</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge9_Node000008_Node000009" class="edge">
<title>Node8&#45;&gt;Node9</title>
<g id="a_edge9_Node000008_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M285.18,-41.62C303.43,-41.62 322.7,-41.62 339.2,-41.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="339.14,-45.13 349.14,-41.62 339.14,-38.13 339.14,-45.13"/>
</a>
</g>
</g>
<!-- Node10 -->
<g id="Node000010" class="node">
<title>Node10</title>
<g id="a_Node000010"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rbegin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="570.5,-56.25 478.75,-56.25 478.75,-37 570.5,-37 570.5,-56.25"/>
<text text-anchor="middle" x="524.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rbegin</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node10 -->
<g id="edge10_Node000009_Node000010" class="edge">
<title>Node9&#45;&gt;Node10</title>
<g id="a_edge10_Node000009_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M415.68,-42.76C431.01,-43.31 449.87,-43.98 467.51,-44.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="467.18,-48.14 477.3,-45 467.43,-41.15 467.18,-48.14"/>
</a>
</g>
</g>
<!-- Node11 -->
<g id="Node000011" class="node">
<title>Node11</title>
<g id="a_Node000011"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/rend.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="566.75,-19.25 482.5,-19.25 482.5,0 566.75,0 566.75,-19.25"/>
<text text-anchor="middle" x="524.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::rend</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node11 -->
<g id="edge11_Node000009_Node000011" class="edge">
<title>Node9&#45;&gt;Node11</title>
<g id="a_edge11_Node000009_Node000011"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M415.68,-34.36C432.24,-30.57 452.92,-25.83 471.74,-21.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="472.29,-24.75 481.26,-19.11 470.73,-17.93 472.29,-24.75"/>
</a>
</g>
</g>
<!-- Node12&#45;&gt;Node5 -->
<g id="edge13_Node000012_Node000005" class="edge">
<title>Node12&#45;&gt;Node5</title>
<g id="a_edge13_Node000012_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M287.55,-95.62C295.65,-95.62 303.92,-95.62 312.03,-95.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="311.96,-99.13 321.96,-95.62 311.96,-92.13 311.96,-99.13"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 12 KiB

195
da/d86/struct_test_case.html Normal file
View File

@@ -0,0 +1,195 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: TestCase Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('da/d86/struct_test_case.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="../../dd/dbb/struct_test_case-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">TestCase Struct Reference</div></div>
</div><!--header-->
<div class="contents">
<p>represents single example inputs and expected output of the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a>
<a href="../../da/d86/struct_test_case.html#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for TestCase:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d57/struct_test_case__coll__graph.svg" width="282" height="231"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ad044f5ab2a58785ace621cac7544eeb0"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d86/struct_test_case.html#ad044f5ab2a58785ace621cac7544eeb0">TestCase</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> string_a, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> string_b, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> in_common_string_len)</td></tr>
<tr class="separator:ad044f5ab2a58785ace621cac7544eeb0"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:ad8acf635a7ad1c56949657128110d666"><td class="memItemLeft" align="right" valign="top"><a id="ad8acf635a7ad1c56949657128110d666" name="ad8acf635a7ad1c56949657128110d666"></a>
const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><b>string_a</b></td></tr>
<tr class="separator:ad8acf635a7ad1c56949657128110d666"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ada0ced4634fc8828fc623ba7067bb7a6"><td class="memItemLeft" align="right" valign="top"><a id="ada0ced4634fc8828fc623ba7067bb7a6" name="ada0ced4634fc8828fc623ba7067bb7a6"></a>
const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td><td class="memItemRight" valign="bottom"><b>string_b</b></td></tr>
<tr class="separator:ada0ced4634fc8828fc623ba7067bb7a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaf21352a77ef2b7379d98d6803588913"><td class="memItemLeft" align="right" valign="top"><a id="aaf21352a77ef2b7379d98d6803588913" name="aaf21352a77ef2b7379d98d6803588913"></a>
const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>common_string_len</b></td></tr>
<tr class="separator:aaf21352a77ef2b7379d98d6803588913"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>represents single example inputs and expected output of the function <a class="el" href="../../da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="ad044f5ab2a58785ace621cac7544eeb0" name="ad044f5ab2a58785ace621cac7544eeb0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad044f5ab2a58785ace621cac7544eeb0">&#9670;&#160;</a></span>TestCase()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">TestCase::TestCase </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td>
<td class="paramname"><em>string_a</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a>&#160;</td>
<td class="paramname"><em>string_b</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td>
<td class="paramname"><em>in_common_string_len</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<div class="fragment"><div class="line"><span class="lineno"> 61</span> : string_a(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(string_a)),</div>
<div class="line"><span class="lineno"> 62</span> string_b(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(string_b)),</div>
<div class="line"><span class="lineno"> 63</span> common_string_len(in_common_string_len) {}</div>
<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this struct was generated from the following file:<ul>
<li>dynamic_programming/<a class="el" href="../../da/d0d/longest__common__string_8cpp.html">longest_common_string.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="../../da/d86/struct_test_case.html">TestCase</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
</ul>
</div>
</body>
</html>

25
db/d27/n__bonacci_8cpp.html
View File

@@ -267,29 +267,29 @@ Here is the call graph for this function:</div>
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 69</span> {</div>
<div class="line"><span class="lineno"> 70</span> <span class="keyword">struct </span>TestCase {</div>
<div class="line"><span class="lineno"> 70</span> <span class="keyword">struct </span><a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a> {</div>
<div class="line"><span class="lineno"> 71</span> <span class="keyword">const</span> uint64_t n;</div>
<div class="line"><span class="lineno"> 72</span> <span class="keyword">const</span> uint64_t m;</div>
<div class="line"><span class="lineno"> 73</span> <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;uint64_t&gt;</a> expected;</div>
<div class="line"><span class="lineno"> 74</span> TestCase(<span class="keyword">const</span> uint64_t in_n, <span class="keyword">const</span> uint64_t in_m,</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(<span class="keyword">const</span> uint64_t in_n, <span class="keyword">const</span> uint64_t in_m,</div>
<div class="line"><span class="lineno"> 75</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/initializer_list.html">std::initializer_list&lt;uint64_t&gt;</a> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</div>
<div class="line"><span class="lineno"> 76</span> : n(in_n), m(in_m), expected(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
<div class="line"><span class="lineno"> 77</span> assert(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.size() == m);</div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="line"><span class="lineno"> 79</span> };</div>
<div class="line"><span class="lineno"> 80</span> <span class="keyword">const</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;TestCase&gt;</a> test_cases = {</div>
<div class="line"><span class="lineno"> 81</span> TestCase(0, 0, {}),</div>
<div class="line"><span class="lineno"> 82</span> TestCase(0, 1, {0}),</div>
<div class="line"><span class="lineno"> 83</span> TestCase(0, 2, {0, 0}),</div>
<div class="line"><span class="lineno"> 84</span> TestCase(1, 0, {}),</div>
<div class="line"><span class="lineno"> 85</span> TestCase(1, 1, {1}),</div>
<div class="line"><span class="lineno"> 86</span> TestCase(1, 2, {1, 1}),</div>
<div class="line"><span class="lineno"> 87</span> TestCase(1, 3, {1, 1, 1}),</div>
<div class="line"><span class="lineno"> 88</span> TestCase(5, 15, {0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 31, 61, 120, 236, 464}),</div>
<div class="line"><span class="lineno"> 89</span> TestCase(</div>
<div class="line"><span class="lineno"> 81</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 0, {}),</div>
<div class="line"><span class="lineno"> 82</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 1, {0}),</div>
<div class="line"><span class="lineno"> 83</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(0, 2, {0, 0}),</div>
<div class="line"><span class="lineno"> 84</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1, 0, {}),</div>
<div class="line"><span class="lineno"> 85</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1, 1, {1}),</div>
<div class="line"><span class="lineno"> 86</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1, 2, {1, 1}),</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(1, 3, {1, 1, 1}),</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(5, 15, {0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 31, 61, 120, 236, 464}),</div>
<div class="line"><span class="lineno"> 89</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(</div>
<div class="line"><span class="lineno"> 90</span> 6, 17,</div>
<div class="line"><span class="lineno"> 91</span> {0, 0, 0, 0, 0, 1, 1, 2, 4, 8, 16, 32, 63, 125, 248, 492, 976}),</div>
<div class="line"><span class="lineno"> 92</span> TestCase(56, 15, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0})};</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_struct" href="../../da/d86/struct_test_case.html">TestCase</a>(56, 15, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0})};</div>
<div class="line"><span class="lineno"> 93</span> </div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> &amp;tc : test_cases) {</div>
<div class="line"><span class="lineno"> 95</span> assert(math::n_bonacci::N_bonacci(tc.n, tc.m) == tc.expected);</div>
@@ -300,6 +300,7 @@ Here is the call graph for this function:</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="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="ainitializer_list_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/initializer_list.html">std::initializer_list</a></div></div>
<div class="ttc" id="astruct_test_case_html"><div class="ttname"><a href="../../da/d86/struct_test_case.html">TestCase</a></div><div class="ttdoc">represents single example inputs and expected output of the function longest_common_string_length</div><div class="ttdef"><b>Definition</b> longest_common_string.cpp:54</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">

119
dd/dbb/struct_test_case-members.html Normal file
View File

@@ -0,0 +1,119 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('da/d86/struct_test_case.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">TestCase Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a>, including all inherited members.</p>
<table class="directory">
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>common_string_len</b> (defined in <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a>)</td><td class="entry"><a class="el" href="../../da/d86/struct_test_case.html">TestCase</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>string_a</b> (defined in <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a>)</td><td class="entry"><a class="el" href="../../da/d86/struct_test_case.html">TestCase</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>string_b</b> (defined in <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a>)</td><td class="entry"><a class="el" href="../../da/d86/struct_test_case.html">TestCase</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="odd"><td class="entry"><b>TestCase</b>(std::string string_a, std::string string_b, const std::size_t in_common_string_len) (defined in <a class="el" href="../../da/d86/struct_test_case.html">TestCase</a>)</td><td class="entry"><a class="el" href="../../da/d86/struct_test_case.html">TestCase</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
</ul>
</div>
</body>
</html>

9
de/d57/struct_test_case__coll__graph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="TestCase" name="TestCase">
<area shape="rect" id="Node000001" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="81,199,159,225"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="28,95,108,121"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="79,134,96,174,112,197,108,200,92,176,74,136"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string.html" title=" " alt="" coords="5,5,131,46"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="71,61,71,95,65,95,65,61"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/size_t.html" title=" " alt="" coords="132,95,215,121"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="166,136,146,176,131,200,127,197,142,174,161,134"/>
</map>

1
de/d57/struct_test_case__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
3f08e09ab46000e9e6f88a992b34f485

104
de/d57/struct_test_case__coll__graph.svg Normal file
View File

@@ -0,0 +1,104 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: TestCase Pages: 1 -->
<svg width="211pt" height="173pt"
viewBox="0.00 0.00 210.75 172.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 168.5)">
<title>TestCase</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
<polygon fill="#999999" stroke="#666666" points="115,-19.25 57,-19.25 57,0 115,0 115,-19.25"/>
<text text-anchor="middle" x="86" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="76.75,-97 17.25,-97 17.25,-77.75 76.75,-77.75 76.75,-97"/>
<text text-anchor="middle" x="47" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53.32,-67.2C56.71,-57.91 61.26,-46.73 66.5,-37.25 69.94,-31.03 74.62,-24.59 78.53,-19.6"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.77,-65.78 49.8,-76.37 56.38,-68.07 49.77,-65.78"/>
</a>
</g>
<text text-anchor="middle" x="84.75" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> string_a</text>
<text text-anchor="middle" x="84.75" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">string_b</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="94,-164.5 0,-164.5 0,-134 94,-134 94,-164.5"/>
<text text-anchor="start" x="8" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
<text text-anchor="middle" x="47" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M47,-122.83C47,-113.75 47,-104.11 47,-97.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="43.5,-122.76 47,-132.76 50.5,-122.76 43.5,-122.76"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="156.88,-97 95.12,-97 95.12,-77.75 156.88,-77.75 156.88,-97"/>
<text text-anchor="middle" x="126" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node1 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node4&#45;&gt;Node1</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M118.39,-67.34C114.46,-58.08 109.36,-46.89 104,-37.25 100.64,-31.2 96.31,-24.77 92.74,-19.74"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="115.51,-68.54 122.55,-76.46 121.98,-65.88 115.51,-68.54"/>
</a>
</g>
<text text-anchor="middle" x="158.88" y="-44.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> common_string_len</text>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.7 KiB

79
de/d57/struct_test_case__coll__graph_org.svg Normal file
View File

@@ -0,0 +1,79 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: TestCase Pages: 1 -->
<svg width="211pt" height="173pt"
viewBox="0.00 0.00 210.75 172.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 168.5)">
<title>TestCase</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
<polygon fill="#999999" stroke="#666666" points="115,-19.25 57,-19.25 57,0 115,0 115,-19.25"/>
<text text-anchor="middle" x="86" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="76.75,-97 17.25,-97 17.25,-77.75 76.75,-77.75 76.75,-97"/>
<text text-anchor="middle" x="47" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::string</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M53.32,-67.2C56.71,-57.91 61.26,-46.73 66.5,-37.25 69.94,-31.03 74.62,-24.59 78.53,-19.6"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="49.77,-65.78 49.8,-76.37 56.38,-68.07 49.77,-65.78"/>
</a>
</g>
<text text-anchor="middle" x="84.75" y="-50.25" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> string_a</text>
<text text-anchor="middle" x="84.75" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey">string_b</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="94,-164.5 0,-164.5 0,-134 94,-134 94,-164.5"/>
<text text-anchor="start" x="8" y="-151" font-family="Helvetica,sans-Serif" font-size="10.00">std::basic_string&lt;</text>
<text text-anchor="middle" x="47" y="-139.75" font-family="Helvetica,sans-Serif" font-size="10.00"> Char &gt;</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M47,-122.83C47,-113.75 47,-104.11 47,-97.35"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="43.5,-122.76 47,-132.76 50.5,-122.76 43.5,-122.76"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/size_t.html" xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="156.88,-97 95.12,-97 95.12,-77.75 156.88,-77.75 156.88,-97"/>
<text text-anchor="middle" x="126" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::size_t</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node1 -->
<g id="edge3_Node000001_Node000004" class="edge">
<title>Node4&#45;&gt;Node1</title>
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M118.39,-67.34C114.46,-58.08 109.36,-46.89 104,-37.25 100.64,-31.2 96.31,-24.77 92.74,-19.74"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="115.51,-68.54 122.55,-76.46 121.98,-65.88 115.51,-68.54"/>
</a>
</g>
<text text-anchor="middle" x="158.88" y="-44.62" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> common_string_len</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.9 KiB

3
dir_8a20dd5bfd5341a725342bf72b6b686f.html
View File

@@ -121,6 +121,9 @@ Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="db/dca/kadane2_8cpp.html">kadane2.cpp</a></td></tr>
<tr class="memdesc:db/dca/kadane2_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="da/d0d/longest__common__string_8cpp.html">longest_common_string.cpp</a></td></tr>
<tr class="memdesc:da/d0d/longest__common__string_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">contains the definition of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html">longest_increasing_subsequence.cpp</a></td></tr>
<tr class="memdesc:d7/d57/longest__increasing__subsequence_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_8a20dd5bfd5341a725342bf72b6b686f.js
View File

@@ -6,6 +6,7 @@ var dir_8a20dd5bfd5341a725342bf72b6b686f =
[ "cut_rod.cpp", "d6/d10/cut__rod_8cpp.html", "d6/d10/cut__rod_8cpp" ],
[ "house_robber.cpp", "d6/d26/house__robber_8cpp.html", "d6/d26/house__robber_8cpp" ],
[ "kadane2.cpp", "db/dca/kadane2_8cpp.html", "db/dca/kadane2_8cpp" ],
[ "longest_common_string.cpp", "da/d0d/longest__common__string_8cpp.html", "da/d0d/longest__common__string_8cpp" ],
[ "longest_increasing_subsequence.cpp", "d7/d57/longest__increasing__subsequence_8cpp.html", "d7/d57/longest__increasing__subsequence_8cpp" ],
[ "longest_palindromic_subsequence.cpp", "d0/d77/longest__palindromic__subsequence_8cpp.html", "d0/d77/longest__palindromic__subsequence_8cpp" ],
[ "maximum_circular_subarray.cpp", "db/dfb/maximum__circular__subarray_8cpp.html", "db/dfb/maximum__circular__subarray_8cpp" ],

17
files.html
View File

@@ -175,14 +175,15 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<tr id="row_6_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d10/cut__rod_8cpp.html" target="_self">cut_rod.cpp</a></td><td class="desc">Implementation of cutting a rod problem </td></tr>
<tr id="row_6_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d26/house__robber_8cpp.html" target="_self">house_robber.cpp</a></td><td class="desc">Implementation of <a href="https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/houserobber" target="_blank">House Robber Problem</a> algorithm </td></tr>
<tr id="row_6_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dca/kadane2_8cpp.html" target="_self">kadane2.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm" target="_blank">Kadane Algorithm</a> </td></tr>
<tr id="row_6_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html" target="_self">longest_increasing_subsequence.cpp</a></td><td class="desc">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array </td></tr>
<tr id="row_6_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html" target="_self">longest_palindromic_subsequence.cpp</a></td><td class="desc">Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string </td></tr>
<tr id="row_6_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dfb/maximum__circular__subarray_8cpp.html" target="_self">maximum_circular_subarray.cpp</a></td><td class="desc">C++ program for maximum contiguous circular sum problem using <a href="https://en.wikipedia.org/wiki/Maximum_subarray_problem" target="_blank">Kadane's Algorithm</a> </td></tr>
<tr id="row_6_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d52/minimum__edit__distance_8cpp.html" target="_self">minimum_edit_distance.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing </td></tr>
<tr id="row_6_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d90/palindrome__partitioning_8cpp.html" target="_self">palindrome_partitioning.cpp</a></td><td class="desc">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make </td></tr>
<tr id="row_6_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html" target="_self">shortest_common_supersequence.cpp</a></td><td class="desc">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) </td></tr>
<tr id="row_6_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d80/dynamic__programming_2subset__sum_8cpp.html" target="_self">subset_sum.cpp</a></td><td class="desc">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not </td></tr>
<tr id="row_6_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> </td></tr>
<tr id="row_6_6_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d0d/longest__common__string_8cpp.html" target="_self">longest_common_string.cpp</a></td><td class="desc">Definition of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> </td></tr>
<tr id="row_6_7_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d57/longest__increasing__subsequence_8cpp.html" target="_self">longest_increasing_subsequence.cpp</a></td><td class="desc">Calculate the length of the <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">longest increasing subsequence</a> in an array </td></tr>
<tr id="row_6_8_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d77/longest__palindromic__subsequence_8cpp.html" target="_self">longest_palindromic_subsequence.cpp</a></td><td class="desc">Program to find the <a href="https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/" target="_blank">Longest Palindormic Subsequence</a> of a string </td></tr>
<tr id="row_6_9_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/dfb/maximum__circular__subarray_8cpp.html" target="_self">maximum_circular_subarray.cpp</a></td><td class="desc">C++ program for maximum contiguous circular sum problem using <a href="https://en.wikipedia.org/wiki/Maximum_subarray_problem" target="_blank">Kadane's Algorithm</a> </td></tr>
<tr id="row_6_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="da/d52/minimum__edit__distance_8cpp.html" target="_self">minimum_edit_distance.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Edit_distance" target="_blank">Minimum Edit Distance</a> using Dynamic Programing </td></tr>
<tr id="row_6_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d5/d90/palindrome__partitioning_8cpp.html" target="_self">palindrome_partitioning.cpp</a></td><td class="desc">Implements <a href="https://leetcode.com/problems/palindrome-partitioning-ii/" target="_blank">Palindrome Partitioning</a> algorithm, giving you the minimum number of partitions you need to make </td></tr>
<tr id="row_6_12_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html" target="_self">shortest_common_supersequence.cpp</a></td><td class="desc">SCS is a string Z which is the shortest supersequence of strings X and Y (may not be continuous in Z, but order is maintained) </td></tr>
<tr id="row_6_13_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/d80/dynamic__programming_2subset__sum_8cpp.html" target="_self">subset_sum.cpp</a></td><td class="desc">Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not </td></tr>
<tr id="row_6_14_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d84/word__break_8cpp.html" target="_self">word_break.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/word-break/" target="_blank">Word Break Problem</a> </td></tr>
<tr id="row_7_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9658;</span><span id="img_7_" class="iconfclosed" onclick="toggleFolder('7_')">&#160;</span><a class="el" href="dir_4b6f782e158b0b98da980a0e11a23a15.html" target="_self">games</a></td><td class="desc"></td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dd/d92/memory__game_8cpp.html" target="_self">memory_game.cpp</a></td><td class="desc">A simple <a href="https://en.wikipedia.org/wiki/Matching_game" target="_blank">Memory Game</a> with <b>3 different sizes</b> and multiple letters </td></tr>
<tr id="row_8_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9658;</span><span id="img_8_" class="iconfclosed" onclick="toggleFolder('8_')">&#160;</span><a class="el" href="dir_e3380d2178455503f266746fb14246a5.html" target="_self">geometry</a></td><td class="desc"></td></tr>

2
functions_func_u.html
View File

@@ -102,8 +102,8 @@ $(document).ready(function(){initNavTree('functions_func_u.html',''); initResiza
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
<li>uint128_t()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a></li>
<li>uint256_t()&#160;:&#160;<a class="el" href="d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a></li>
<li>unionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
<li>UnionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
<li>unionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
<li>update()&#160;:&#160;<a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">data_structures::SegmentTree&lt; T &gt;</a>, <a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>, <a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3">hashing::sha256::Hash</a>, <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a>, <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree</a></li>
<li>upper()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t</a></li>
</ul>

2
functions_u.html
View File

@@ -102,8 +102,8 @@ $(document).ready(function(){initNavTree('functions_u.html',''); initResizable()
<h3><a id="index_u" name="index_u"></a>- u -</h3><ul>
<li>uint128_t()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040">uint128_t</a></li>
<li>uint256_t()&#160;:&#160;<a class="el" href="d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc">uint256_t</a></li>
<li>unionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
<li>UnionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a6ac30c07abca2aaa3b291504c25c3559">dsu</a></li>
<li>unionSet()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a81897528bdb53fd5e796d75d7dbc430f">dsu</a></li>
<li>up&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a46d10f669791e3da9a4809bd8ff8d3ad">graph::LowestCommonAncestor</a></li>
<li>update()&#160;:&#160;<a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">data_structures::SegmentTree&lt; T &gt;</a>, <a class="el" href="dd/d91/class_fenwick_tree.html#a2e9ea4fcbe0786487f4535c1cfc7aa00">FenwickTree</a>, <a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3">hashing::sha256::Hash</a>, <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a9f1cb54ed09fde931bf3220d75ee4c57">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a>, <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#a3c75bf5770790f8eba8cc92227b5400c">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree</a></li>
<li>upper()&#160;:&#160;<a class="el" href="db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705">uint128_t</a>, <a class="el" href="d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5">uint256_t</a></li>

1
globals_func_g.html
View File

@@ -109,6 +109,7 @@ $(document).ready(function(){initNavTree('globals_func_g.html',''); initResizabl
<li>get_min_2d()&#160;:&#160;<a class="el" href="d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">kohonen_som_topology.cpp</a></li>
<li>get_minima()&#160;:&#160;<a class="el" href="db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">brent_method_extrema.cpp</a>, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">golden_search_extrema.cpp</a></li>
<li>get_rand()&#160;:&#160;<a class="el" href="d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">complex_numbers.cpp</a></li>
<li>get_test_cases()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">longest_common_string.cpp</a></li>
<li>get_transpose()&#160;:&#160;<a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb">ordinary_least_squares_regressor.cpp</a></li>
<li>getBalance()&#160;:&#160;<a class="el" href="d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">avltree.cpp</a></li>
<li>getnode()&#160;:&#160;<a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">linkedlist_implentation_usingarray.cpp</a></li>

1
globals_func_l.html
View File

@@ -105,6 +105,7 @@ $(document).ready(function(){initNavTree('globals_func_l.html',''); initResizabl
<li>LenghtLine()&#160;:&#160;<a class="el" href="d0/d01/smallest__circle_8cpp.html#a3cbebd6f4d2cdf227663c67fe41ba12a">smallest_circle.cpp</a></li>
<li>levelOrder()&#160;:&#160;<a class="el" href="d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">avltree.cpp</a></li>
<li>LinearSearch()&#160;:&#160;<a class="el" href="d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">linear_search.cpp</a></li>
<li>longest_common_string_length()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string.cpp</a></li>
<li>lower()&#160;:&#160;<a class="el" href="dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">text_search.cpp</a></li>
<li>lu_decomposition()&#160;:&#160;<a class="el" href="d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition.h</a></li>
</ul>

2
globals_func_m.html
View File

File diff suppressed because one or more lines are too long

1
globals_func_r.html
View File

@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('globals_func_r.html',''); initResizabl
<li>random_tests()&#160;:&#160;<a class="el" href="de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f">fibonacci_search.cpp</a></li>
<li>rec_ternary_search()&#160;:&#160;<a class="el" href="dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">ternary_search.cpp</a></li>
<li>reverse_binary()&#160;:&#160;<a class="el" href="d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb">miller_rabin.cpp</a></li>
<li>reverse_str()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">longest_common_string.cpp</a></li>
<li>rightRotate()&#160;:&#160;<a class="el" href="d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">avltree.cpp</a></li>
</ul>
</div><!-- contents -->

5
globals_func_t.html
View File

@@ -134,8 +134,11 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
<li>test_insert()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">binary_search_tree2.cpp</a></li>
<li>test_int()&#160;:&#160;<a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>, <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a></li>
<li>test_lamniscate()&#160;:&#160;<a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a">kohonen_som_trace.cpp</a></li>
<li>test_longest_common_string_length()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">longest_common_string.cpp</a></li>
<li>test_longest_common_string_length_for_reversed_inputs()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">longest_common_string.cpp</a></li>
<li>test_longest_common_string_length_is_symmetric()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">longest_common_string.cpp</a></li>
<li>test_remove()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a></li>
<li>TH()&#160;:&#160;<a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
<li>tolowerRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
<li>toupperRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>

1
globals_g.html
View File

@@ -109,6 +109,7 @@ $(document).ready(function(){initNavTree('globals_g.html',''); initResizable();
<li>get_min_2d()&#160;:&#160;<a class="el" href="d9/d66/group__machine__learning.html#ga60f9186ccb682724a8792a2bf81e9b9e">kohonen_som_topology.cpp</a></li>
<li>get_minima()&#160;:&#160;<a class="el" href="db/d01/brent__method__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">brent_method_extrema.cpp</a>, <a class="el" href="d6/d7a/golden__search__extrema_8cpp.html#a1aa76a6d5fd4d333f9072beff1dc486b">golden_search_extrema.cpp</a></li>
<li>get_rand()&#160;:&#160;<a class="el" href="d5/d67/complex__numbers_8cpp.html#a5d4d5b8250b50703de888514c8e7a7a0">complex_numbers.cpp</a></li>
<li>get_test_cases()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a967854a526bc15403d783a033155fc5c">longest_common_string.cpp</a></li>
<li>get_transpose()&#160;:&#160;<a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a21c80569aaffb7bf1657e54fa4b97deb">ordinary_least_squares_regressor.cpp</a></li>
<li>getBalance()&#160;:&#160;<a class="el" href="d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">avltree.cpp</a></li>
<li>getnode()&#160;:&#160;<a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">linkedlist_implentation_usingarray.cpp</a></li>

2
globals_i.html
View File

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

1
globals_l.html
View File

@@ -108,6 +108,7 @@ $(document).ready(function(){initNavTree('globals_l.html',''); initResizable();
<li>LinearSearch()&#160;:&#160;<a class="el" href="d9/d02/linear__search_8cpp.html#a84ac3988a534eb60ca351ed6caf56d84">linear_search.cpp</a></li>
<li>link&#160;:&#160;<a class="el" href="d1/df3/hash__search_8cpp.html#ad6fcd983304f85afa199d97a9b0ca9f6">hash_search.cpp</a></li>
<li>ll&#160;:&#160;<a class="el" href="d7/d35/matrix__exponentiation_8cpp.html#ae1d1ec9482079231e898236e2b23c9ba">matrix_exponentiation.cpp</a></li>
<li>longest_common_string_length()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5">longest_common_string.cpp</a></li>
<li>lower()&#160;:&#160;<a class="el" href="dc/db5/text__search_8cpp.html#a3f8975d227cd0e58f298b380c5dac0d9">text_search.cpp</a></li>
<li>lu_decomposition()&#160;:&#160;<a class="el" href="d1/dbe/lu__decomposition_8h.html#a75b8a228c6419ecda6077255d6d60509">lu_decomposition.h</a></li>
</ul>

2
globals_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_p.html
View File

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

1
globals_r.html
View File

@@ -103,6 +103,7 @@ $(document).ready(function(){initNavTree('globals_r.html',''); initResizable();
<li>random_tests()&#160;:&#160;<a class="el" href="de/d0d/fibonacci__search_8cpp.html#a2aa09bef74ee063c1331de0883af4f4f">fibonacci_search.cpp</a></li>
<li>rec_ternary_search()&#160;:&#160;<a class="el" href="dc/dfe/ternary__search_8cpp.html#a93d0099db95022f1eb90ddfd68f73ead">ternary_search.cpp</a></li>
<li>reverse_binary()&#160;:&#160;<a class="el" href="d6/d42/miller__rabin_8cpp.html#a091662a787d5ad4866713021f580fddb">miller_rabin.cpp</a></li>
<li>reverse_str()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#acb03dbbcee6d607db471021168be8541">longest_common_string.cpp</a></li>
<li>rightRotate()&#160;:&#160;<a class="el" href="d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">avltree.cpp</a></li>
</ul>
</div><!-- contents -->

5
globals_t.html
View File

@@ -134,9 +134,12 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
<li>test_insert()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">binary_search_tree2.cpp</a></li>
<li>test_int()&#160;:&#160;<a class="el" href="d3/d4c/quick__sort__3_8cpp.html#a07e5c62de28aeddea986890ce7ac1bda">quick_sort_3.cpp</a>, <a class="el" href="d4/d7a/shell__sort2_8cpp.html#a895b313cb2671e8f712040460325573e">shell_sort2.cpp</a></li>
<li>test_lamniscate()&#160;:&#160;<a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a53082f2e5bacec40266499da4547309a">kohonen_som_trace.cpp</a></li>
<li>test_longest_common_string_length()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a9b229daad982a186a4d8d90aa8f38561">longest_common_string.cpp</a></li>
<li>test_longest_common_string_length_for_reversed_inputs()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">longest_common_string.cpp</a></li>
<li>test_longest_common_string_length_is_symmetric()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">longest_common_string.cpp</a></li>
<li>test_remove()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
<li>test_set&#160;:&#160;<a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#af0a3e6827f41c151e47451f5ff98b1f1">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a></li>
<li>TH()&#160;:&#160;<a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
<li>tolowerRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
<li>toupperRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>

45
hierarchy.html
View File

@@ -116,8 +116,8 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_9_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html" target="_self">operations_on_datastructures::circular_linked_list::CircularLinkedList</a></td><td class="desc">A class that implements a Circular Linked List </td></tr>
<tr id="row_11_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_13_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare&lt; S, T, E &gt;</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d4a/class_compare.html" target="_self">Compare&lt; S, T, E &gt;</a></td><td class="desc">Comparator class for priority queue </td></tr>
<tr id="row_13_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::comparison_operator</a></td><td class="desc">Custom comparator for open_list </td></tr>
<tr id="row_15_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">geometry::jarvis::Convexhull</a></td><td class="desc"></td></tr>
@@ -200,26 +200,27 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_91_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_93_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_96_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_97_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_97_" class="arrow" onclick="toggleFolder('97_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_97_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_98_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_99_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_103_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_103_" class="arrow" onclick="toggleFolder('103_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_103_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_103_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_103_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_103_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_103_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_103_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_104_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_105_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_106_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
<tr id="row_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="for std::vector">longest_common_string_length</a> </td></tr>
<tr id="row_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_96_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_97_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_98_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_98_" class="arrow" onclick="toggleFolder('98_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_98_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_99_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_103_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_104_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_104_" class="arrow" onclick="toggleFolder('104_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_104_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_104_1_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_104_2_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_104_3_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_104_4_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_104_5_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_105_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_106_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_107_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d34/classprobability_1_1windowed__median_1_1_windowed_median.html" target="_self">probability::windowed_median::WindowedMedian</a></td><td class="desc">A class to calculate the median of a leading sliding window at the back of a stream of integer values </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

3
hierarchy.js
View File

@@ -12,8 +12,8 @@ var hierarchy =
[ "Btree", "d9/d90/struct_btree.html", null ],
[ "operations_on_datastructures::circular_linked_list::CircularLinkedList", "d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html", null ],
[ "cll", "d5/d15/classcll.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "Compare< S, T, E >", "de/d4a/class_compare.html", null ],
[ "compare", "d1/db3/structcompare.html", null ],
[ "machine_learning::aystar_search::AyStarSearch< Puzzle >::comparison_operator", "d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html", null ],
[ "Complex", "da/d5a/class_complex.html", null ],
[ "geometry::jarvis::Convexhull", "d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html", null ],
@@ -98,6 +98,7 @@ var hierarchy =
[ "stack_linkedList", "d2/dc4/classstack__linked_list.html", null ],
[ "statistics::stats_computer1< T >", "d7/d7c/classstatistics_1_1stats__computer1.html", null ],
[ "statistics::stats_computer2< T >", "d8/dab/classstatistics_1_1stats__computer2.html", null ],
[ "TestCase", "da/d86/struct_test_case.html", null ],
[ "TestCases", "d5/d58/class_test_cases.html", null ],
[ "operations_on_datastructures::trie_operations::Tnode", "d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html", null ],
[ "tower", "d2/d2c/structtower.html", null ],

2
inherit_graph_100.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d5/d58/class_test_cases.html" title="class encapsulating the necessary test cases" alt="" coords="5,5,90,31"/>
<area shape="rect" id="Node000000" href="$da/d86/struct_test_case.html" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="5,5,83,31"/>
</map>

2
inherit_graph_100.md5
View File

@@ -1 +1 @@
a9d8d2a80cdf35dfac76eecdbb209456
abd7e48c602c9ba41e00a619e3234e23

10
inherit_graph_100.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="71pt" height="27pt"
viewBox="0.00 0.00 71.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="66pt" height="27pt"
viewBox="0.00 0.00 66.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d5/d58/class_test_cases.html" target="_top" xlink:title="class encapsulating the necessary test cases">
<polygon fill="white" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases</text>
<g id="a_Node000000"><a xlink:href="da/d86/struct_test_case.html" target="_top" xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
<polygon fill="white" stroke="#666666" points="58,-19.25 0,-19.25 0,0 58,0 58,-19.25"/>
<text text-anchor="middle" x="29" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 985 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_101.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d2/d2c/structtower.html" title=" " alt="" coords="5,5,59,31"/>
<area shape="rect" id="Node000000" href="$d5/d58/class_test_cases.html" title="class encapsulating the necessary test cases" alt="" coords="5,5,90,31"/>
</map>

2
inherit_graph_101.md5
View File

@@ -1 +1 @@
76f1c23145670e75e2e13d0451b74420
a9d8d2a80cdf35dfac76eecdbb209456

10
inherit_graph_101.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="48pt" height="27pt"
viewBox="0.00 0.00 48.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="71pt" height="27pt"
viewBox="0.00 0.00 71.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d2/d2c/structtower.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="40,-19.25 0,-19.25 0,0 40,0 40,-19.25"/>
<text text-anchor="middle" x="20" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tower</text>
<g id="a_Node000000"><a xlink:href="d5/d58/class_test_cases.html" target="_top" xlink:title="class encapsulating the necessary test cases">
<polygon fill="white" stroke="#666666" points="63.25,-19.25 0,-19.25 0,0 63.25,0 63.25,-19.25"/>
<text text-anchor="middle" x="31.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 921 B

After

Width:  |  Height:  |  Size: 985 B

2
inherit_graph_102.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$dd/d2f/class_trie.html" title=" " alt="" coords="5,5,49,31"/>
<area shape="rect" id="Node000000" href="$d2/d2c/structtower.html" title=" " alt="" coords="5,5,59,31"/>
</map>

2
inherit_graph_102.md5
View File

@@ -1 +1 @@
845eae9f7c70e50cf22fb926bd9e034b
76f1c23145670e75e2e13d0451b74420

10
inherit_graph_102.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="41pt" height="27pt"
viewBox="0.00 0.00 40.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="48pt" height="27pt"
viewBox="0.00 0.00 48.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="dd/d2f/class_trie.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie</text>
<g id="a_Node000000"><a xlink:href="d2/d2c/structtower.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="40,-19.25 0,-19.25 0,0 40,0 40,-19.25"/>
<text text-anchor="middle" x="20" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">tower</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 928 B

After

Width:  |  Height:  |  Size: 921 B

2
inherit_graph_103.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$de/d48/struct_trie_1_1_trie_node.html" title=" " alt="" coords="5,5,110,31"/>
<area shape="rect" id="Node000000" href="$dd/d2f/class_trie.html" title=" " alt="" coords="5,5,49,31"/>
</map>

2
inherit_graph_103.md5
View File

@@ -1 +1 @@
a8666508fe9ca12fb7281895f580da44
845eae9f7c70e50cf22fb926bd9e034b

10
inherit_graph_103.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="86pt" height="27pt"
viewBox="0.00 0.00 86.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="41pt" height="27pt"
viewBox="0.00 0.00 40.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="de/d48/struct_trie_1_1_trie_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
<text text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::TrieNode</text>
<g id="a_Node000000"><a xlink:href="dd/d2f/class_trie.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="32.5,-19.25 0,-19.25 0,0 32.5,0 32.5,-19.25"/>
<text text-anchor="middle" x="16.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 956 B

After

Width:  |  Height:  |  Size: 928 B

2
inherit_graph_104.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$db/d9a/classuint128__t.html" title="class for 128&#45;bit unsigned integer" alt="" coords="5,5,80,31"/>
<area shape="rect" id="Node000000" href="$de/d48/struct_trie_1_1_trie_node.html" title=" " alt="" coords="5,5,110,31"/>
</map>

2
inherit_graph_104.md5
View File

@@ -1 +1 @@
eed75a69314afbb385b920f554ca3c5d
a8666508fe9ca12fb7281895f580da44

10
inherit_graph_104.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="64pt" height="27pt"
viewBox="0.00 0.00 63.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="86pt" height="27pt"
viewBox="0.00 0.00 86.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="db/d9a/classuint128__t.html" target="_top" xlink:title="class for 128&#45;bit unsigned integer">
<polygon fill="white" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t</text>
<g id="a_Node000000"><a xlink:href="de/d48/struct_trie_1_1_trie_node.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="78.25,-19.25 0,-19.25 0,0 78.25,0 78.25,-19.25"/>
<text text-anchor="middle" x="39.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Trie::TrieNode</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 978 B

After

Width:  |  Height:  |  Size: 956 B

2
inherit_graph_105.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d1/d83/classuint256__t.html" title="class for 256&#45;bit unsigned integer" alt="" coords="5,5,80,31"/>
<area shape="rect" id="Node000000" href="$db/d9a/classuint128__t.html" title="class for 128&#45;bit unsigned integer" alt="" coords="5,5,80,31"/>
</map>

2
inherit_graph_105.md5
View File

@@ -1 +1 @@
805bd0d28e53f8af03d7b4e5906cc299
eed75a69314afbb385b920f554ca3c5d

4
inherit_graph_105.svg
View File

@@ -11,9 +11,9 @@
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d1/d83/classuint256__t.html" target="_top" xlink:title="class for 256&#45;bit unsigned integer">
<g id="a_Node000000"><a xlink:href="db/d9a/classuint128__t.html" target="_top" xlink:title="class for 128&#45;bit unsigned integer">
<polygon fill="white" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t</text>
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint128_t</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 978 B

After

Width:  |  Height:  |  Size: 978 B

3
inherit_graph_106.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d1/d83/classuint256__t.html" title="class for 256&#45;bit unsigned integer" alt="" coords="5,5,80,31"/>
</map>

1
inherit_graph_106.md5 Normal file
View File

@@ -0,0 +1 @@
805bd0d28e53f8af03d7b4e5906cc299

21
inherit_graph_106.svg Normal file
View File

@@ -0,0 +1,21 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 8.0.5 (20230430.1635)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="64pt" height="27pt"
viewBox="0.00 0.00 63.75 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d1/d83/classuint256__t.html" target="_top" xlink:title="class for 256&#45;bit unsigned integer">
<polygon fill="white" stroke="#666666" points="55.75,-19.25 0,-19.25 0,0 55.75,0 55.75,-19.25"/>
<text text-anchor="middle" x="27.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">uint256_t</text>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 978 B

11
inherits.html
View File

@@ -203,12 +203,13 @@ $(document).ready(function(){initNavTree('hierarchy.html',''); initResizable();
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_97.svg" width="223" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_98.svg" width="354" height="315"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_99.svg" width="155" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_100.svg" width="95" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_101.svg" width="64" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_102.svg" width="55" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_103.svg" width="115" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_104.svg" width="86" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_100.svg" width="88" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_101.svg" width="95" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_102.svg" width="64" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_103.svg" width="55" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_104.svg" width="115" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_105.svg" width="86" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
<tr><td><iframe scrolling="no" frameborder="0" src="inherit_graph_106.svg" width="86" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></td></tr>
</table>
</div><!-- contents -->
</div><!-- doc-content -->

10
navtreedata.js
View File

@@ -146,11 +146,11 @@ var NAVTREEINDEX =
"d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d",
"d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#abde75f6ee432b0378d264da8c7c64db2",
"d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
"da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99",
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e",
"dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb",
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50",
"globals_func_h.html"
"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8",
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c",
"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967",
"de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4",
"globals_f.html"
];
var SYNCONMSG = 'click to disable panel synchronisation';

66
navtreeindex0.js
View File

@@ -5,13 +5,13 @@ var NAVTREEINDEX0 =
"cpp/algorithm/accumulate.html":[9,0,110,15],
"cpp/algorithm/adjacent_difference.html":[9,0,110,19],
"cpp/algorithm/adjacent_find.html":[9,0,110,20],
"cpp/algorithm/all_any_none_of.html":[9,0,110,25],
"cpp/algorithm/all_any_none_of.html":[9,0,110,23],
"cpp/algorithm/all_any_none_of.html":[9,0,110,300],
"cpp/algorithm/all_any_none_of.html":[9,0,110,25],
"cpp/algorithm/binary_search.html":[9,0,110,65],
"cpp/algorithm/bsearch.html":[9,0,110,68],
"cpp/algorithm/copy.html":[9,0,110,81],
"cpp/algorithm/copy.html":[9,0,110,79],
"cpp/algorithm/copy.html":[9,0,110,81],
"cpp/algorithm/copy_backward.html":[9,0,110,80],
"cpp/algorithm/copy_n.html":[9,0,110,82],
"cpp/algorithm/count.html":[9,0,110,86],
@@ -21,8 +21,8 @@ var NAVTREEINDEX0 =
"cpp/algorithm/fill.html":[9,0,110,133],
"cpp/algorithm/fill_n.html":[9,0,110,134],
"cpp/algorithm/find.html":[9,0,110,139],
"cpp/algorithm/find.html":[9,0,110,135],
"cpp/algorithm/find.html":[9,0,110,138],
"cpp/algorithm/find.html":[9,0,110,135],
"cpp/algorithm/find_end.html":[9,0,110,136],
"cpp/algorithm/find_first_of.html":[9,0,110,137],
"cpp/algorithm/for_each.html":[9,0,110,148],
@@ -63,16 +63,16 @@ var NAVTREEINDEX0 =
"cpp/algorithm/prev_permutation.html":[9,0,110,322],
"cpp/algorithm/push_heap.html":[9,0,110,324],
"cpp/algorithm/qsort.html":[9,0,110,331],
"cpp/algorithm/random_shuffle.html":[9,0,110,388],
"cpp/algorithm/random_shuffle.html":[9,0,110,335],
"cpp/algorithm/random_shuffle.html":[9,0,110,388],
"cpp/algorithm/remove.html":[9,0,110,345],
"cpp/algorithm/remove.html":[9,0,110,342],
"cpp/algorithm/remove_copy.html":[9,0,110,344],
"cpp/algorithm/remove_copy.html":[9,0,110,343],
"cpp/algorithm/remove_copy.html":[9,0,110,344],
"cpp/algorithm/replace.html":[9,0,110,348],
"cpp/algorithm/replace.html":[9,0,110,351],
"cpp/algorithm/replace_copy.html":[9,0,110,350],
"cpp/algorithm/replace_copy.html":[9,0,110,349],
"cpp/algorithm/replace_copy.html":[9,0,110,350],
"cpp/algorithm/reverse.html":[9,0,110,356],
"cpp/algorithm/reverse_copy.html":[9,0,110,357],
"cpp/algorithm/rotate.html":[9,0,110,361],
@@ -93,29 +93,29 @@ var NAVTREEINDEX0 =
"cpp/algorithm/unique.html":[9,0,110,475],
"cpp/algorithm/unique_copy.html":[9,0,110,476],
"cpp/algorithm/upper_bound.html":[9,0,110,478],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,40],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,41],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,40],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,42],
"cpp/atomic/atomic_compare_exchange.html":[9,0,110,39],
"cpp/atomic/atomic_exchange.html":[9,0,110,43],
"cpp/atomic/atomic_exchange.html":[9,0,110,44],
"cpp/atomic/atomic_exchange.html":[9,0,110,43],
"cpp/atomic/atomic_fetch_add.html":[9,0,110,46],
"cpp/atomic/atomic_fetch_add.html":[9,0,110,45],
"cpp/atomic/atomic_fetch_or.html":[9,0,110,50],
"cpp/atomic/atomic_fetch_or.html":[9,0,110,49],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,52],
"cpp/atomic/atomic_fetch_or.html":[9,0,110,50],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,48],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,51],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,52],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,47],
"cpp/atomic/atomic_fetch_xor.html":[9,0,110,53],
"cpp/atomic/atomic_fetch_sub.html":[9,0,110,51],
"cpp/atomic/atomic_fetch_xor.html":[9,0,110,54],
"cpp/atomic/atomic_fetch_xor.html":[9,0,110,53],
"cpp/atomic/atomic_init.html":[9,0,110,55],
"cpp/atomic/atomic_is_lock_free.html":[9,0,110,56],
"cpp/atomic/atomic_load.html":[9,0,110,58],
"cpp/atomic/atomic_load.html":[9,0,110,57],
"cpp/atomic/atomic_load.html":[9,0,110,58],
"cpp/atomic/atomic_signal_fence.html":[9,0,110,59],
"cpp/atomic/atomic_store.html":[9,0,110,60],
"cpp/atomic/atomic_store.html":[9,0,110,61],
"cpp/atomic/atomic_store.html":[9,0,110,60],
"cpp/atomic/atomic_thread_fence.html":[9,0,110,62],
"cpp/atomic/kill_dependency.html":[9,0,110,235],
"cpp/chrono/c/asctime.html":[9,0,110,26],
@@ -157,12 +157,12 @@ var NAVTREEINDEX0 =
"cpp/io/c/fgetwc.html":[9,0,110,131],
"cpp/io/c/fgetws.html":[9,0,110,132],
"cpp/io/c/fopen.html":[9,0,110,147],
"cpp/io/c/fprintf.html":[9,0,110,323],
"cpp/io/c/fprintf.html":[9,0,110,394],
"cpp/io/c/fprintf.html":[9,0,110,397],
"cpp/io/c/fprintf.html":[9,0,110,152],
"cpp/io/c/fputc.html":[9,0,110,153],
"cpp/io/c/fprintf.html":[9,0,110,323],
"cpp/io/c/fprintf.html":[9,0,110,397],
"cpp/io/c/fprintf.html":[9,0,110,394],
"cpp/io/c/fputc.html":[9,0,110,327],
"cpp/io/c/fputc.html":[9,0,110,153],
"cpp/io/c/fputs.html":[9,0,110,154],
"cpp/io/c/fputwc.html":[9,0,110,155],
"cpp/io/c/fputws.html":[9,0,110,156],
@@ -174,9 +174,9 @@ var NAVTREEINDEX0 =
"cpp/io/c/fseek.html":[9,0,110,163],
"cpp/io/c/fsetpos.html":[9,0,110,164],
"cpp/io/c/ftell.html":[9,0,110,165],
"cpp/io/c/fwprintf.html":[9,0,110,441],
"cpp/io/c/fwprintf.html":[9,0,110,531],
"cpp/io/c/fwprintf.html":[9,0,110,167],
"cpp/io/c/fwprintf.html":[9,0,110,531],
"cpp/io/c/fwprintf.html":[9,0,110,441],
"cpp/io/c/fwrite.html":[9,0,110,168],
"cpp/io/c/fwscanf.html":[9,0,110,442],
"cpp/io/c/fwscanf.html":[9,0,110,533],
@@ -196,32 +196,32 @@ var NAVTREEINDEX0 =
"cpp/io/c/tmpnam.html":[9,0,110,453],
"cpp/io/c/ungetc.html":[9,0,110,469],
"cpp/io/c/ungetwc.html":[9,0,110,470],
"cpp/io/c/vfprintf.html":[9,0,110,488],
"cpp/io/c/vfprintf.html":[9,0,110,487],
"cpp/io/c/vfprintf.html":[9,0,110,481],
"cpp/io/c/vfprintf.html":[9,0,110,485],
"cpp/io/c/vfscanf.html":[9,0,110,486],
"cpp/io/c/vfprintf.html":[9,0,110,488],
"cpp/io/c/vfprintf.html":[9,0,110,481],
"cpp/io/c/vfprintf.html":[9,0,110,487],
"cpp/io/c/vfscanf.html":[9,0,110,489],
"cpp/io/c/vfscanf.html":[9,0,110,486],
"cpp/io/c/vfscanf.html":[9,0,110,482],
"cpp/io/c/vfwprintf.html":[9,0,110,492],
"cpp/io/c/vfwprintf.html":[9,0,110,490],
"cpp/io/c/vfwprintf.html":[9,0,110,492],
"cpp/io/c/vfwprintf.html":[9,0,110,483],
"cpp/io/c/vfwscanf.html":[9,0,110,493],
"cpp/io/c/vfwscanf.html":[9,0,110,491],
"cpp/io/c/vfwscanf.html":[9,0,110,484],
"cpp/io/c/vfwscanf.html":[9,0,110,493],
"cpp/io/manip/boolalpha.html":[9,0,110,67],
"cpp/io/manip/boolalpha.html":[9,0,110,299],
"cpp/io/manip/boolalpha.html":[9,0,110,67],
"cpp/io/manip/endl.html":[9,0,110,101],
"cpp/io/manip/ends.html":[9,0,110,102],
"cpp/io/manip/fixed.html":[9,0,110,140],
"cpp/io/manip/fixed.html":[9,0,110,190],
"cpp/io/manip/fixed.html":[9,0,110,367],
"cpp/io/manip/fixed.html":[9,0,110,95],
"cpp/io/manip/fixed.html":[9,0,110,367],
"cpp/io/manip/fixed.html":[9,0,110,140],
"cpp/io/manip/flush.html":[9,0,110,142],
"cpp/io/manip/get_money.html":[9,0,110,174],
"cpp/io/manip/get_time.html":[9,0,110,179],
"cpp/io/manip/hex.html":[9,0,110,311],
"cpp/io/manip/hex.html":[9,0,110,189],
"cpp/io/manip/hex.html":[9,0,110,311],
"cpp/io/manip/hex.html":[9,0,110,91],
"cpp/io/manip/left.html":[9,0,110,197],
"cpp/io/manip/left.html":[9,0,110,239],
@@ -234,14 +234,14 @@ var NAVTREEINDEX0 =
"cpp/io/manip/setiosflags.html":[9,0,110,380],
"cpp/io/manip/setprecision.html":[9,0,110,382],
"cpp/io/manip/setw.html":[9,0,110,384],
"cpp/io/manip/showbase.html":[9,0,110,385],
"cpp/io/manip/showbase.html":[9,0,110,301],
"cpp/io/manip/showbase.html":[9,0,110,385],
"cpp/io/manip/showpoint.html":[9,0,110,302],
"cpp/io/manip/showpoint.html":[9,0,110,386],
"cpp/io/manip/showpos.html":[9,0,110,387],
"cpp/io/manip/showpos.html":[9,0,110,303],
"cpp/io/manip/skipws.html":[9,0,110,393],
"cpp/io/manip/showpos.html":[9,0,110,387],
"cpp/io/manip/skipws.html":[9,0,110,304],
"cpp/io/manip/skipws.html":[9,0,110,393],
"cpp/io/manip/unitbuf.html":[9,0,110,308],
"cpp/io/manip/unitbuf.html":[9,0,110,477],
"cpp/io/manip/uppercase.html":[9,0,110,309],

32
navtreeindex1.js
View File

@@ -28,26 +28,26 @@ var NAVTREEINDEX1 =
"cpp/memory/return_temporary_buffer.html":[9,0,110,355],
"cpp/memory/shared_ptr/allocate_shared.html":[9,0,110,24],
"cpp/memory/shared_ptr/make_shared.html":[9,0,110,260],
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,110,78],
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,110,99],
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,110,403],
"cpp/memory/shared_ptr/pointer_cast.html":[9,0,110,78],
"cpp/memory/uninitialized_copy.html":[9,0,110,471],
"cpp/memory/uninitialized_copy_n.html":[9,0,110,472],
"cpp/memory/uninitialized_fill.html":[9,0,110,473],
"cpp/memory/uninitialized_fill_n.html":[9,0,110,474],
"cpp/numeric/fenv/feclearexcept.html":[9,0,110,114],
"cpp/numeric/fenv/feenv.html":[9,0,110,115],
"cpp/numeric/fenv/feenv.html":[9,0,110,122],
"cpp/numeric/fenv/feexceptflag.html":[9,0,110,123],
"cpp/numeric/fenv/feenv.html":[9,0,110,115],
"cpp/numeric/fenv/feexceptflag.html":[9,0,110,116],
"cpp/numeric/fenv/feexceptflag.html":[9,0,110,123],
"cpp/numeric/fenv/feholdexcept.html":[9,0,110,118],
"cpp/numeric/fenv/feraiseexcept.html":[9,0,110,120],
"cpp/numeric/fenv/feround.html":[9,0,110,124],
"cpp/numeric/fenv/feround.html":[9,0,110,117],
"cpp/numeric/fenv/fetestexcept.html":[9,0,110,125],
"cpp/numeric/fenv/feupdateenv.html":[9,0,110,126],
"cpp/numeric/math/abs.html":[9,0,110,242],
"cpp/numeric/math/abs.html":[9,0,110,236],
"cpp/numeric/math/abs.html":[9,0,110,242],
"cpp/numeric/math/abs.html":[9,0,110,14],
"cpp/numeric/math/acos.html":[9,0,110,16],
"cpp/numeric/math/acosh.html":[9,0,110,17],
@@ -61,8 +61,8 @@ var NAVTREEINDEX1 =
"cpp/numeric/math/copysign.html":[9,0,110,83],
"cpp/numeric/math/cos.html":[9,0,110,84],
"cpp/numeric/math/cosh.html":[9,0,110,85],
"cpp/numeric/math/div.html":[9,0,110,98],
"cpp/numeric/math/div.html":[9,0,110,238],
"cpp/numeric/math/div.html":[9,0,110,98],
"cpp/numeric/math/erf.html":[9,0,110,105],
"cpp/numeric/math/erfc.html":[9,0,110,106],
"cpp/numeric/math/exp.html":[9,0,110,108],
@@ -91,21 +91,21 @@ var NAVTREEINDEX1 =
"cpp/numeric/math/log1p.html":[9,0,110,250],
"cpp/numeric/math/logb.html":[9,0,110,251],
"cpp/numeric/math/modf.html":[9,0,110,287],
"cpp/numeric/math/nan.html":[9,0,110,291],
"cpp/numeric/math/nan.html":[9,0,110,293],
"cpp/numeric/math/nan.html":[9,0,110,292],
"cpp/numeric/math/nan.html":[9,0,110,293],
"cpp/numeric/math/nan.html":[9,0,110,291],
"cpp/numeric/math/nearbyint.html":[9,0,110,294],
"cpp/numeric/math/nextafter.html":[9,0,110,298],
"cpp/numeric/math/nextafter.html":[9,0,110,297],
"cpp/numeric/math/pow.html":[9,0,110,320],
"cpp/numeric/math/remainder.html":[9,0,110,341],
"cpp/numeric/math/remquo.html":[9,0,110,346],
"cpp/numeric/math/rint.html":[9,0,110,254],
"cpp/numeric/math/rint.html":[9,0,110,360],
"cpp/numeric/math/rint.html":[9,0,110,254],
"cpp/numeric/math/rint.html":[9,0,110,243],
"cpp/numeric/math/round.html":[9,0,110,255],
"cpp/numeric/math/round.html":[9,0,110,363],
"cpp/numeric/math/round.html":[9,0,110,244],
"cpp/numeric/math/round.html":[9,0,110,255],
"cpp/numeric/math/scalbn.html":[9,0,110,364],
"cpp/numeric/math/scalbn.html":[9,0,110,365],
"cpp/numeric/math/signbit.html":[9,0,110,390],
@@ -123,11 +123,11 @@ var NAVTREEINDEX1 =
"cpp/regex/regex_replace.html":[9,0,110,339],
"cpp/regex/regex_search.html":[9,0,110,340],
"cpp/string/basic_string/getline.html":[9,0,110,184],
"cpp/string/basic_string/stof.html":[9,0,110,405],
"cpp/string/basic_string/stof.html":[9,0,110,408],
"cpp/string/basic_string/stof.html":[9,0,110,404],
"cpp/string/basic_string/stol.html":[9,0,110,406],
"cpp/string/basic_string/stof.html":[9,0,110,408],
"cpp/string/basic_string/stof.html":[9,0,110,405],
"cpp/string/basic_string/stol.html":[9,0,110,409],
"cpp/string/basic_string/stol.html":[9,0,110,406],
"cpp/string/basic_string/stol.html":[9,0,110,407],
"cpp/string/basic_string/stoul.html":[9,0,110,410],
"cpp/string/basic_string/stoul.html":[9,0,110,411],
@@ -135,8 +135,8 @@ var NAVTREEINDEX1 =
"cpp/string/basic_string/to_wstring.html":[9,0,110,455],
"cpp/string/byte/atof.html":[9,0,110,35],
"cpp/string/byte/atoi.html":[9,0,110,38],
"cpp/string/byte/atoi.html":[9,0,110,36],
"cpp/string/byte/atoi.html":[9,0,110,37],
"cpp/string/byte/atoi.html":[9,0,110,36],
"cpp/string/byte/isalnum.html":[9,0,110,205],
"cpp/string/byte/isalpha.html":[9,0,110,206],
"cpp/string/byte/isblank.html":[9,0,110,207],
@@ -169,9 +169,9 @@ var NAVTREEINDEX1 =
"cpp/string/byte/strrchr.html":[9,0,110,425],
"cpp/string/byte/strspn.html":[9,0,110,426],
"cpp/string/byte/strstr.html":[9,0,110,427],
"cpp/string/byte/strtof.html":[9,0,110,429],
"cpp/string/byte/strtof.html":[9,0,110,433],
"cpp/string/byte/strtof.html":[9,0,110,428],
"cpp/string/byte/strtof.html":[9,0,110,429],
"cpp/string/byte/strtoimax.html":[9,0,110,437],
"cpp/string/byte/strtoimax.html":[9,0,110,430],
"cpp/string/byte/strtok.html":[9,0,110,431],
@@ -228,14 +228,14 @@ var NAVTREEINDEX1 =
"cpp/string/wide/wcsrchr.html":[9,0,110,507],
"cpp/string/wide/wcsspn.html":[9,0,110,508],
"cpp/string/wide/wcsstr.html":[9,0,110,509],
"cpp/string/wide/wcstof.html":[9,0,110,515],
"cpp/string/wide/wcstof.html":[9,0,110,510],
"cpp/string/wide/wcstof.html":[9,0,110,511],
"cpp/string/wide/wcstof.html":[9,0,110,515],
"cpp/string/wide/wcstoimax.html":[9,0,110,520],
"cpp/string/wide/wcstoimax.html":[9,0,110,512],
"cpp/string/wide/wcstok.html":[9,0,110,513],
"cpp/string/wide/wcstol.html":[9,0,110,514],
"cpp/string/wide/wcstol.html":[9,0,110,516],
"cpp/string/wide/wcstol.html":[9,0,110,514],
"cpp/string/wide/wcstoul.html":[9,0,110,518],
"cpp/string/wide/wcstoul.html":[9,0,110,519],
"cpp/string/wide/wcsxfrm.html":[9,0,110,521],

194
navtreeindex10.js
View File

@@ -1,5 +1,15 @@
var NAVTREEINDEX10 =
{
"da/dd1/structquadratic__probing_1_1_entry.html#a75f72858f08a2fc8b94402de98db12d8":[10,0,14,0,1],
"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[9,0,89,0,0],
"da/dd1/structquadratic__probing_1_1_entry.html#a9df1118010a233d13ab3dd699bcb513e":[10,0,14,0,0],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html":[11,0,5,0],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#a7a890d2f26855ada3b9f1d43aec70a86":[11,0,5,0,1],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,5,0,4],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#aad9e3edfe156b59fc06a5585403fe0d6":[11,0,5,0,3],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ad76f5cac3ef8dc034f6abb99b64c2b20":[11,0,5,0,0],
"da/dd3/karatsuba__algorithm__for__fast__multiplication_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,5,0,2],
"da/dd3/namespacespirograph.html":[9,0,107],
"da/dd3/namespacespirograph.html#a8e83a64e8443fff1e5ffdc1c299c1e99":[9,0,107,1],
"da/dd3/namespacespirograph.html#aeca22dbe4563358960e907a40cd3e1ac":[9,0,107,0],
"da/dd4/namespacemedian__search.html":[9,0,65],
@@ -39,12 +49,12 @@ var NAVTREEINDEX10 =
"db/d16/0__1__knapsack_8cpp.html#a15edf30f336885e5b851f6b7199c6cd1":[11,0,6,0,1],
"db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,0,2],
"db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,0,0],
"db/d19/structlinear__probing_1_1_entry.html":[9,0,55,0],
"db/d19/structlinear__probing_1_1_entry.html":[10,0,8,0],
"db/d19/structlinear__probing_1_1_entry.html":[9,0,55,0],
"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[10,0,8,0,0],
"db/d19/structlinear__probing_1_1_entry.html#a2139f643a3caf074da1db8a9fa16fa77":[9,0,55,0,0],
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,55,0,1],
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[10,0,8,0,1],
"db/d19/structlinear__probing_1_1_entry.html#a4d84e90b73022083761f85f8586c4c2a":[9,0,55,0,1],
"db/d27/n__bonacci_8cpp.html":[11,0,14,38],
"db/d27/n__bonacci_8cpp.html#a6849b68f760be628d5975ab3eddec63d":[11,0,14,38,1],
"db/d27/n__bonacci_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,38,2],
@@ -117,86 +127,86 @@ var NAVTREEINDEX10 =
"db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e":[11,0,14,7,2],
"db/d93/check__prime_8cpp.html#abd8f794b2229b42876169ff841b6e444":[11,0,14,7,0],
"db/d93/check__prime_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,7,1],
"db/d9a/classuint128__t.html":[10,0,57],
"db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40":[10,0,57,18],
"db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3":[10,0,57,37],
"db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798":[10,0,57,42],
"db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a":[10,0,57,22],
"db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9":[10,0,57,65],
"db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac":[10,0,57,1],
"db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606":[10,0,57,32],
"db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190":[10,0,57,50],
"db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a":[10,0,57,53],
"db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed":[10,0,57,40],
"db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705":[10,0,57,77],
"db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640":[10,0,57,24],
"db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2":[10,0,57,19],
"db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440":[10,0,57,61],
"db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414":[10,0,57,41],
"db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd":[10,0,57,71],
"db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db":[10,0,57,47],
"db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092":[10,0,57,29],
"db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee":[10,0,57,45],
"db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03":[10,0,57,75],
"db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481":[10,0,57,62],
"db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a":[10,0,57,57],
"db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304":[10,0,57,70],
"db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363":[10,0,57,5],
"db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f":[10,0,57,76],
"db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860":[10,0,57,28],
"db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67":[10,0,57,68],
"db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c":[10,0,57,52],
"db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30":[10,0,57,27],
"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d":[10,0,57,31],
"db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004":[10,0,57,35],
"db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc":[10,0,57,48],
"db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953":[10,0,57,78],
"db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b":[10,0,57,3],
"db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee":[10,0,57,72],
"db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec":[10,0,57,38],
"db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e":[10,0,57,11],
"db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848":[10,0,57,64],
"db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639":[10,0,57,12],
"db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696":[10,0,57,14],
"db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896":[10,0,57,58],
"db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e":[10,0,57,59],
"db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e":[10,0,57,8],
"db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c":[10,0,57,4],
"db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503":[10,0,57,74],
"db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c":[10,0,57,39],
"db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e":[10,0,57,60],
"db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df":[10,0,57,6],
"db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c":[10,0,57,9],
"db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b":[10,0,57,67],
"db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d":[10,0,57,2],
"db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295":[10,0,57,30],
"db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb":[10,0,57,36],
"db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4":[10,0,57,20],
"db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a":[10,0,57,51],
"db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd":[10,0,57,10],
"db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b":[10,0,57,46],
"db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37":[10,0,57,66],
"db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1":[10,0,57,23],
"db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e":[10,0,57,15],
"db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5":[10,0,57,56],
"db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d":[10,0,57,73],
"db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74":[10,0,57,54],
"db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8":[10,0,57,43],
"db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066":[10,0,57,17],
"db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050":[10,0,57,25],
"db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e":[10,0,57,33],
"db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544":[10,0,57,55],
"db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4":[10,0,57,49],
"db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244":[10,0,57,21],
"db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d":[10,0,57,13],
"db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040":[10,0,57,0],
"db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad":[10,0,57,16],
"db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a":[10,0,57,69],
"db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292":[10,0,57,63],
"db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94":[10,0,57,44],
"db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2":[10,0,57,7],
"db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733":[10,0,57,26],
"db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6":[10,0,57,34],
"db/d9a/classuint128__t.html":[10,0,58],
"db/d9a/classuint128__t.html#a0500a90bcde5a8254750c361eed9bc40":[10,0,58,18],
"db/d9a/classuint128__t.html#a07945fe010079a35e18812636d5c70c3":[10,0,58,37],
"db/d9a/classuint128__t.html#a0a4623fae71566dfcf2e742c8c156798":[10,0,58,42],
"db/d9a/classuint128__t.html#a0ad881643c707f6ae3c5de3822a8cb8a":[10,0,58,22],
"db/d9a/classuint128__t.html#a0ae5fc0c2bcc9138b32d7582466aa7f9":[10,0,58,65],
"db/d9a/classuint128__t.html#a0b6612186d8f678452e011d08ee1f5ac":[10,0,58,1],
"db/d9a/classuint128__t.html#a0fd125cc2b7702370a4aefa740d57606":[10,0,58,32],
"db/d9a/classuint128__t.html#a16e7e1211ba6c27e9a229d97fb0d9190":[10,0,58,50],
"db/d9a/classuint128__t.html#a16eb351c1d0ed3b89c771c63808e035a":[10,0,58,53],
"db/d9a/classuint128__t.html#a1d390c6ea5450680dcaff341235f0fed":[10,0,58,40],
"db/d9a/classuint128__t.html#a1ee2f1ffbd9984faad34883eb45e9705":[10,0,58,77],
"db/d9a/classuint128__t.html#a225146042c6456a3c5595645870ca640":[10,0,58,24],
"db/d9a/classuint128__t.html#a279209a184db20a7ffc8e687fdb05be2":[10,0,58,19],
"db/d9a/classuint128__t.html#a291d2787d668e8d06a7cfab0f5144440":[10,0,58,61],
"db/d9a/classuint128__t.html#a2ecb71686e1c9ed0267124580c91c414":[10,0,58,41],
"db/d9a/classuint128__t.html#a2fda65032d9fdbaf9142a6322654dbdd":[10,0,58,71],
"db/d9a/classuint128__t.html#a300ed88fe2054788cc6e0b6a8fdf66db":[10,0,58,47],
"db/d9a/classuint128__t.html#a3016b71f92a0c7e090a7c5b6a3935092":[10,0,58,29],
"db/d9a/classuint128__t.html#a3072a7e43da3600c345c81bc80c957ee":[10,0,58,45],
"db/d9a/classuint128__t.html#a312509b1c5b3ae5eaaf342f2ba131d03":[10,0,58,75],
"db/d9a/classuint128__t.html#a334bc710f411f108a0243b24ac73b481":[10,0,58,62],
"db/d9a/classuint128__t.html#a3c4a7e775a0820196fc08303bbeed44a":[10,0,58,57],
"db/d9a/classuint128__t.html#a3facc74d6d078604fe2c80d0abfd3304":[10,0,58,70],
"db/d9a/classuint128__t.html#a4147188abcdcdb12c61bfbe4e4c0a363":[10,0,58,5],
"db/d9a/classuint128__t.html#a43eafd4824666b413befe5edbc90ae7f":[10,0,58,76],
"db/d9a/classuint128__t.html#a44e472cf685cac6edc5172eac2e66860":[10,0,58,28],
"db/d9a/classuint128__t.html#a44fd2a4a4cc1d13f93ac222db5a46c67":[10,0,58,68],
"db/d9a/classuint128__t.html#a4562c218813c8705bccb25d8786ca77c":[10,0,58,52],
"db/d9a/classuint128__t.html#a488e65a14d4c32a096011aa4725cdb30":[10,0,58,27],
"db/d9a/classuint128__t.html#a5133f854a93efe47fd1f0f6a9589856d":[10,0,58,31],
"db/d9a/classuint128__t.html#a55a3f122c4d982c60c2eb9fc09b9e004":[10,0,58,35],
"db/d9a/classuint128__t.html#a56f579c802a6cc16f31e43af274453dc":[10,0,58,48],
"db/d9a/classuint128__t.html#a5f2ace9fdcd459f74f8e43ef30a2a953":[10,0,58,78],
"db/d9a/classuint128__t.html#a60bf2739c93bb1cd41654fd60c76ae6b":[10,0,58,3],
"db/d9a/classuint128__t.html#a6110aa452a6d114fcd2f42d2bc106fee":[10,0,58,72],
"db/d9a/classuint128__t.html#a6824700c9c732a4200e7493fe7ed0eec":[10,0,58,38],
"db/d9a/classuint128__t.html#a6d45302022ef7f5195458f41b8aedb6e":[10,0,58,11],
"db/d9a/classuint128__t.html#a6f24982de03e0e3d04ac7f8ae30f5848":[10,0,58,64],
"db/d9a/classuint128__t.html#a75767cb2b6fd47ecb1f721755fdc7639":[10,0,58,12],
"db/d9a/classuint128__t.html#a7737bb30a5480c7286546b911d82e696":[10,0,58,14],
"db/d9a/classuint128__t.html#a7a95e3accdac1cb38c9767f9550c0896":[10,0,58,58],
"db/d9a/classuint128__t.html#a7b1de5584505c189664d0edd306e979e":[10,0,58,59],
"db/d9a/classuint128__t.html#a7d2285a8a6e20b77f82f1f0351afe76e":[10,0,58,8],
"db/d9a/classuint128__t.html#a7d56143b2e291e8087188192533d2e3c":[10,0,58,4],
"db/d9a/classuint128__t.html#a817b66c32268cf46244058a50db99503":[10,0,58,74],
"db/d9a/classuint128__t.html#a81a568510e6d0b0950133dd9fc37fc0c":[10,0,58,39],
"db/d9a/classuint128__t.html#a82c63f8c18b8d2d255b8b0d373ac7d6e":[10,0,58,60],
"db/d9a/classuint128__t.html#a857a3c69c1e775a1bd3935c2bfbb02df":[10,0,58,6],
"db/d9a/classuint128__t.html#a8bf81f7f5f5c98f197822ec88e106c6c":[10,0,58,9],
"db/d9a/classuint128__t.html#a9487ed06019d846add5dc8874e41eb8b":[10,0,58,67],
"db/d9a/classuint128__t.html#a95ac8be8f414fcbce09301b912f5079d":[10,0,58,2],
"db/d9a/classuint128__t.html#a96fc7c2df4325bb1a0c22b566bcc6295":[10,0,58,30],
"db/d9a/classuint128__t.html#a9704e6a4d32750461bff663e40e537cb":[10,0,58,36],
"db/d9a/classuint128__t.html#a9fa81ef0d54ecb9050d0be4249358ca4":[10,0,58,20],
"db/d9a/classuint128__t.html#aa5b93187b1d199071f204b9987d5d16a":[10,0,58,51],
"db/d9a/classuint128__t.html#aa69e1064c0b0b1df1c61acd2ea04fabd":[10,0,58,10],
"db/d9a/classuint128__t.html#aaacb9fda7adcfee224f1b09124c0438b":[10,0,58,46],
"db/d9a/classuint128__t.html#aab88fd72d0370b12e4a257e378b82d37":[10,0,58,66],
"db/d9a/classuint128__t.html#ab07413c67d205e406abf3a9f554d59e1":[10,0,58,23],
"db/d9a/classuint128__t.html#ab3359b104bbb5a31c11c2027387c4b4e":[10,0,58,15],
"db/d9a/classuint128__t.html#ab6aa4d14ed52c7c640468c45350da0c5":[10,0,58,56],
"db/d9a/classuint128__t.html#ab88330f3c4f3bcde75dc5ef9eb8eb39d":[10,0,58,73],
"db/d9a/classuint128__t.html#abae08ef3c1d6dc512edd68ca68327f74":[10,0,58,54],
"db/d9a/classuint128__t.html#abea727c69c2acd74ffe21464199d27c8":[10,0,58,43],
"db/d9a/classuint128__t.html#abfc6a8765039cacc829a5cd386b5a066":[10,0,58,17],
"db/d9a/classuint128__t.html#ac7d55ed3bac01075b9cd11cc59508050":[10,0,58,25],
"db/d9a/classuint128__t.html#ac8d293d20cdf65c48d8d1e0ba7034c8e":[10,0,58,33],
"db/d9a/classuint128__t.html#ac924cc09bbb919532dc42f1f93f6f544":[10,0,58,55],
"db/d9a/classuint128__t.html#ac9a4365fb9ea5e2d2c751258f09168a4":[10,0,58,49],
"db/d9a/classuint128__t.html#ad1717d3a38391258befa413b7e2b9244":[10,0,58,21],
"db/d9a/classuint128__t.html#ad24d6fe1fe63f415fee806b377dfa47d":[10,0,58,13],
"db/d9a/classuint128__t.html#adce2432b148fe18179a5ea272f4eb040":[10,0,58,0],
"db/d9a/classuint128__t.html#add9938b97fc66560cec2d32e8c83eaad":[10,0,58,16],
"db/d9a/classuint128__t.html#ae3f0ef8a3f68d9cbd9d99e772f1a947a":[10,0,58,69],
"db/d9a/classuint128__t.html#ae7af1bad048942eeabc092d8e0194292":[10,0,58,63],
"db/d9a/classuint128__t.html#aed49b24b99293ae6b14ac9850f5deb94":[10,0,58,44],
"db/d9a/classuint128__t.html#af139bb6e630f1a61919f180978611cd2":[10,0,58,7],
"db/d9a/classuint128__t.html#af4ce01d81a0369218f7d46567d136733":[10,0,58,26],
"db/d9a/classuint128__t.html#af71990a1fba93a5528ddb1e6662bffd6":[10,0,58,34],
"db/da4/namespacestd_1_1regex__constants.html":[9,0,110,2],
"db/da9/classqueue.html":[10,0,48],
"db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368":[10,0,48,2],
@@ -231,23 +241,13 @@ var NAVTREEINDEX10 =
"db/df3/happy__number_8cpp.html":[11,0,17,5],
"db/df3/happy__number_8cpp.html#a00ccdb1166a7c83ac3c33ac67a2532b7":[11,0,17,5,0],
"db/df3/happy__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,5,1],
"db/dfb/maximum__circular__subarray_8cpp.html":[11,0,6,8],
"db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,8,0],
"db/dfb/maximum__circular__subarray_8cpp.html#a5239174fa0d987f2c67edc1f2af82beb":[11,0,6,8,1],
"db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,8,2],
"db/dfb/maximum__circular__subarray_8cpp.html":[11,0,6,9],
"db/dfb/maximum__circular__subarray_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,6,9,0],
"db/dfb/maximum__circular__subarray_8cpp.html#a5239174fa0d987f2c67edc1f2af82beb":[11,0,6,9,1],
"db/dfb/maximum__circular__subarray_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,9,2],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html":[10,0,3,0,0],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a01f3a05cf5abdc5d63999ef1bf9f9256":[10,0,3,0,0,0],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a1fcb7db9bdeabd874712ec4f00483d17":[10,0,3,0,0,14],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a42c986fb57b74fe1b7c5953cb1922c3d":[10,0,3,0,0,10],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9":[10,0,3,0,0,1],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c":[10,0,3,0,0,11],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50":[10,0,3,0,0,3],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c":[10,0,3,0,0,4],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e":[10,0,3,0,0,9],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a":[10,0,3,0,0,15],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f":[10,0,3,0,0,2],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37":[10,0,3,0,0,12],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211":[10,0,3,0,0,7],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391":[10,0,3,0,0,8],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1":[10,0,3,0,0,13]
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a4aa49765cce39ce48b9241e993e0cfb9":[10,0,3,0,0,1]
};

42
navtreeindex11.js
View File

@@ -1,5 +1,15 @@
var NAVTREEINDEX11 =
{
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a562faa16a4b4ed5d4804823c56f99c9c":[10,0,3,0,0,11],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a5d8eb669b37a27224376b08515b4ee50":[10,0,3,0,0,3],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a60599668b56001cef4bb59d4cb5c6c6c":[10,0,3,0,0,4],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a678681c9f6266a8219bd6bee6972d70e":[10,0,3,0,0,9],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#a87c2ed8f19bda2ad21ee4cbed32c394a":[10,0,3,0,0,15],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ab6534125643a02c114bd4cddba9bc17f":[10,0,3,0,0,2],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ac4c64e5723fa12a043fd0a7f5ed5bb37":[10,0,3,0,0,12],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ad36ec1f1a97298e49de605384e5f8211":[10,0,3,0,0,7],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae190115f8d4d31e47d7290e0b6871391":[10,0,3,0,0,8],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1":[10,0,3,0,0,13],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#aedbe01e48a96fefa0b393ec577b0f19e":[10,0,3,0,0,5],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af09566a6a59d30875434c140e18e0a12":[10,0,3,0,0,6],
"dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#af12ceffdc07cc87eca8a4a8ac87d60fe":[10,0,3,0,0,16],
@@ -36,16 +46,16 @@ var NAVTREEINDEX11 =
"dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,0,7,0],
"dc/d61/classgraph_1_1_graph.html":[9,0,34,0],
"dc/d61/classgraph_1_1_graph.html":[10,0,6,1],
"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[9,0,34,0,2],
"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[10,0,6,1,2],
"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[10,0,6,1,5],
"dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981":[9,0,34,0,2],
"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[9,0,34,0,5],
"dc/d61/classgraph_1_1_graph.html#a59940c462861f2fcf4951d1b6c084e6a":[10,0,6,1,5],
"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[10,0,6,1,1],
"dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19":[9,0,34,0,1],
"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[9,0,34,0,0],
"dc/d61/classgraph_1_1_graph.html#a8839fa14bff19d2deab4a618447c13e5":[10,0,6,1,0],
"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[9,0,34,0,3],
"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[10,0,6,1,3],
"dc/d61/classgraph_1_1_graph.html#a8930d1470d132b19e430d1c71f94c904":[9,0,34,0,3],
"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[10,0,6,1,4],
"dc/d61/classgraph_1_1_graph.html#acebf0505d625b043bb9c8c27c7a8def0":[9,0,34,0,4],
"dc/d64/md__coding_guidelines.html":[2],
@@ -102,8 +112,8 @@ var NAVTREEINDEX11 =
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a576db259488dbfb67624a9652a5ab08b":[9,0,20,1,2],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[10,0,2,8,3],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a65ca6742d3be88d4aca4f080068a7a80":[9,0,20,1,3],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,8,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[9,0,20,1,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840":[10,0,2,8,1],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[10,0,2,8,0],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a":[9,0,20,1,0],
"dc/dd4/classdata__structures_1_1_bloom_filter.html#a90268d7901e2c1ab5f8bf8b24a30e119":[9,0,20,1,4],
@@ -191,12 +201,12 @@ var NAVTREEINDEX11 =
"dd/d29/false__position_8cpp.html#a85a6ec58b5064d63d4f0df3854496713":[11,0,15,5,0],
"dd/d29/false__position_8cpp.html#a85cb7bfb90abc898e042d624372c5345":[11,0,15,5,2],
"dd/d29/false__position_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,15,5,1],
"dd/d2f/class_trie.html":[10,0,56],
"dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d":[10,0,56,4],
"dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206":[10,0,56,5],
"dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908":[10,0,56,1],
"dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb":[10,0,56,2],
"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[10,0,56,3],
"dd/d2f/class_trie.html":[10,0,57],
"dd/d2f/class_trie.html#a26941759ecf94d67a27d4a610bc0f63d":[10,0,57,4],
"dd/d2f/class_trie.html#a411e77126930a0942dd7b65e96b15206":[10,0,57,5],
"dd/d2f/class_trie.html#a6af57e9f25d0d0a2d59eea5a4a802908":[10,0,57,1],
"dd/d2f/class_trie.html#a6d10eb1669453395d1900ebd401954fb":[10,0,57,2],
"dd/d2f/class_trie.html#afd8b79959009b554e98ea7128b2886f2":[10,0,57,3],
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html":[10,0,2,5,0],
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a164574a9209b5df66368530d090b32c4":[10,0,2,5,0,2],
"dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a22fd25c6c811c64b6b27b0850d8c532f":[10,0,2,5,0,1],
@@ -239,15 +249,5 @@ var NAVTREEINDEX11 =
"dd/d47/namespacemath.html#a428769a16e9525e56588d7c7709d25a6":[9,0,63,31],
"dd/d47/namespacemath.html#a50936ee98f4d40f17823befc65a32aec":[9,0,63,39],
"dd/d47/namespacemath.html#a5de184925e68658f15415dd53954df4f":[9,0,63,22],
"dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[9,0,63,15],
"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,63,20],
"dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[9,0,63,9],
"dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[9,0,63,26],
"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,63,19],
"dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec":[9,0,63,3],
"dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f":[9,0,63,33],
"dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14":[9,0,63,37],
"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[9,0,63,28],
"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[9,0,63,36],
"dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[9,0,63,21]
"dd/d47/namespacemath.html#a6c72f756a7bf1b9043c357e3fe7814ca":[9,0,63,15]
};

42
navtreeindex12.js
View File

@@ -1,5 +1,15 @@
var NAVTREEINDEX12 =
{
"dd/d47/namespacemath.html#a6e2dff75c5de70455b90c799d6ad6967":[9,0,63,20],
"dd/d47/namespacemath.html#a8998ca7b1886d1d7d00aef3b457a9b1b":[9,0,63,9],
"dd/d47/namespacemath.html#a8a48be4d7f14e34c5c92925bc1cbf3bb":[9,0,63,26],
"dd/d47/namespacemath.html#a8d8e81a7cd59644b311ef9adb268f5f0":[9,0,63,19],
"dd/d47/namespacemath.html#a8e6eede206201db0d1dbb618fa969bec":[9,0,63,3],
"dd/d47/namespacemath.html#a91366864111e1fac29722ca45e02ea8f":[9,0,63,33],
"dd/d47/namespacemath.html#a9236348755183644f1225e162d01ab14":[9,0,63,37],
"dd/d47/namespacemath.html#a94db02b3c9e55a69ac1696f30e2f761c":[9,0,63,28],
"dd/d47/namespacemath.html#a971ce57e368f2f631cf1f4ff3f864049":[9,0,63,36],
"dd/d47/namespacemath.html#aa8592c3279c41a2c6d4d64eeb488f63f":[9,0,63,21],
"dd/d47/namespacemath.html#aacb1411ef2029e81f249c21e17c96fdb":[9,0,63,29],
"dd/d47/namespacemath.html#ab31d141f7c5b551746b1eee0eb4dedca":[9,0,63,30],
"dd/d47/namespacemath.html#ab37f3a7302a84179aae682c79d8390bf":[9,0,63,1],
@@ -52,24 +62,24 @@ var NAVTREEINDEX12 =
"dd/d92/memory__game_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,7,0,4],
"dd/d95/classdata__structures_1_1_segment_tree.html":[10,0,2,10],
"dd/d95/classdata__structures_1_1_segment_tree.html":[9,0,20,3],
"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[10,0,2,10,6],
"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[9,0,20,3,6],
"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[9,0,20,3,7],
"dd/d95/classdata__structures_1_1_segment_tree.html#a10ffa5fc03c66170f0bc2592b843baa3":[10,0,2,10,6],
"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[10,0,2,10,7],
"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[10,0,2,10,3],
"dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3":[9,0,20,3,7],
"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[9,0,20,3,3],
"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[9,0,20,3,4],
"dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b":[10,0,2,10,3],
"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[10,0,2,10,4],
"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[10,0,2,10,1],
"dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1":[9,0,20,3,4],
"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[9,0,20,3,1],
"dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141":[10,0,2,10,1],
"dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[10,0,2,10,8],
"dd/d95/classdata__structures_1_1_segment_tree.html#a735d072a603f3abb7c03818440575258":[9,0,20,3,8],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[10,0,2,10,0],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841":[9,0,20,3,0],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[9,0,20,3,2],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[10,0,2,10,2],
"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[10,0,2,10,5],
"dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52":[9,0,20,3,2],
"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[9,0,20,3,5],
"dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17":[10,0,2,10,5],
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html":[10,0,9,0,1],
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a1802cf6197a255055cb734d626abc101":[10,0,9,0,1,14],
"dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a194c2973b51a5467fc17064a4ea4e6f9":[10,0,9,0,1,4],
@@ -150,9 +160,9 @@ var NAVTREEINDEX12 =
"de/d47/string__fibonacci_8cpp.html#a28052eee05d43c2ebc5147c52bd50c35":[11,0,14,52,0],
"de/d47/string__fibonacci_8cpp.html#ad8055ee368a5d5b24de01bdde6bf8fca":[11,0,14,52,1],
"de/d47/string__fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,52,2],
"de/d48/struct_trie_1_1_trie_node.html":[10,0,56,0],
"de/d4a/class_compare.html":[10,0,24],
"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[10,0,24,0],
"de/d48/struct_trie_1_1_trie_node.html":[10,0,57,0],
"de/d4a/class_compare.html":[10,0,23],
"de/d4a/class_compare.html#afbdf9a44adb49728dc704155d7d1570c":[10,0,23,0],
"de/d4f/structmath_1_1_point.html":[9,0,63,0],
"de/d4f/structmath_1_1_point.html":[10,0,10,1],
"de/d6a/knuth__morris__pratt_8cpp.html":[11,0,23,3],
@@ -239,15 +249,5 @@ var NAVTREEINDEX12 =
"de/dcd/kadanes3_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,17,7,2],
"de/dcd/kadanes3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,7,0],
"de/dcf/binary__exponent_8cpp.html":[11,0,14,3],
"de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f":[11,0,14,3,1],
"de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,3,2],
"de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73":[11,0,14,3,0],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html":[10,0,11,2,0],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c":[10,0,11,2,0,6],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c":[10,0,11,2,0,3],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d":[10,0,11,2,0,2],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[10,0,11,2,0,5],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[10,0,11,2,0,8],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[10,0,11,2,0,1],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[10,0,11,2,0,0]
"de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f":[11,0,14,3,1]
};

30
navtreeindex13.js
View File

@@ -1,5 +1,15 @@
var NAVTREEINDEX13 =
{
"de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,3,2],
"de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73":[11,0,14,3,0],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html":[10,0,11,2,0],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c":[10,0,11,2,0,6],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c":[10,0,11,2,0,3],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d":[10,0,11,2,0,2],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503":[10,0,11,2,0,5],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb":[10,0,11,2,0,8],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b":[10,0,11,2,0,1],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56":[10,0,11,2,0,0],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50":[10,0,11,2,0,4],
"de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1":[10,0,11,2,0,7],
"de/dd1/segment__tree_8cpp.html":[11,0,4,17],
@@ -133,10 +143,10 @@ var NAVTREEINDEX13 =
"df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,2,4],
"df/ddd/connected__components_8cpp.html#a9125ceb66bfbec3093bba64c2c1e99e2":[11,0,9,2,0],
"df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,2,3],
"df/de5/classbacktracking_1_1generate__parentheses.html":[10,0,0,0],
"df/de5/classbacktracking_1_1generate__parentheses.html":[9,0,5,0],
"df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508":[10,0,0,0,2],
"df/de5/classbacktracking_1_1generate__parentheses.html":[10,0,0,0],
"df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508":[9,0,5,0,2],
"df/de5/classbacktracking_1_1generate__parentheses.html#ab35b9b6d2886abed3d6fb05c2be1c508":[10,0,0,0,2],
"df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec":[10,0,0,0,1],
"df/de5/classbacktracking_1_1generate__parentheses.html#ac1489edd65374f22fe04851051f0a2ec":[9,0,5,0,1],
"df/de5/classbacktracking_1_1generate__parentheses.html#af39c03d80ce0ba9fbf659b420980d160":[10,0,0,0,0],
@@ -185,8 +195,8 @@ var NAVTREEINDEX13 =
"functions_d.html":[10,3,0,4],
"functions_e.html":[10,3,0,5],
"functions_f.html":[10,3,0,6],
"functions_func.html":[10,3,1],
"functions_func.html":[10,3,1,0],
"functions_func.html":[10,3,1],
"functions_func_a.html":[10,3,1,1],
"functions_func_b.html":[10,3,1,2],
"functions_func_c.html":[10,3,1,3],
@@ -232,22 +242,12 @@ var NAVTREEINDEX13 =
"functions_x.html":[10,3,0,23],
"functions_y.html":[10,3,0,24],
"functions_~.html":[10,3,0,25],
"globals.html":[11,1,0],
"globals.html":[11,1,0,0],
"globals.html":[11,1,0],
"globals_a.html":[11,1,0,1],
"globals_b.html":[11,1,0,2],
"globals_c.html":[11,1,0,3],
"globals_d.html":[11,1,0,4],
"globals_defs.html":[11,1,4],
"globals_e.html":[11,1,0,5],
"globals_f.html":[11,1,0,6],
"globals_func.html":[11,1,1],
"globals_func.html":[11,1,1,0],
"globals_func_a.html":[11,1,1,1],
"globals_func_b.html":[11,1,1,2],
"globals_func_c.html":[11,1,1,3],
"globals_func_d.html":[11,1,1,4],
"globals_func_e.html":[11,1,1,5],
"globals_func_f.html":[11,1,1,6],
"globals_func_g.html":[11,1,1,7]
"globals_e.html":[11,1,0,5]
};

10
navtreeindex14.js
View File

@@ -1,5 +1,15 @@
var NAVTREEINDEX14 =
{
"globals_f.html":[11,1,0,6],
"globals_func.html":[11,1,1],
"globals_func.html":[11,1,1,0],
"globals_func_a.html":[11,1,1,1],
"globals_func_b.html":[11,1,1,2],
"globals_func_c.html":[11,1,1,3],
"globals_func_d.html":[11,1,1,4],
"globals_func_e.html":[11,1,1,5],
"globals_func_f.html":[11,1,1,6],
"globals_func_g.html":[11,1,1,7],
"globals_func_h.html":[11,1,1,8],
"globals_func_i.html":[11,1,1,9],
"globals_func_j.html":[11,1,1,10],

154
navtreeindex2.js
View File

@@ -28,10 +28,10 @@ var NAVTREEINDEX2 =
"cpp/utility/program/raise.html":[9,0,110,333],
"cpp/utility/program/signal.html":[9,0,110,389],
"cpp/utility/program/system.html":[9,0,110,443],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,0],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,2],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,1],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,3],
"cpp/utility/rel_ops/operator_cmp.html":[9,0,110,3,0],
"cpp/utility/tuple/forward_as_tuple.html":[9,0,110,150],
"cpp/utility/tuple/make_tuple.html":[9,0,110,261],
"cpp/utility/tuple/tie.html":[9,0,110,450],
@@ -51,26 +51,26 @@ var NAVTREEINDEX2 =
"d0/d20/namespaceground__to__ground__projectile__motion.html":[9,0,37],
"d0/d2b/namespacequick__sort.html":[9,0,91],
"d0/d2e/namespaceneural__network.html":[9,0,78],
"d0/d3e/classdata__structures_1_1trie.html":[9,0,20,5],
"d0/d3e/classdata__structures_1_1trie.html":[10,0,2,12],
"d0/d3e/classdata__structures_1_1trie.html":[9,0,20,5],
"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[9,0,20,5,3],
"d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546":[10,0,2,12,3],
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[10,0,2,12,6],
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[9,0,20,5,6],
"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[10,0,2,12,5],
"d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b":[10,0,2,12,6],
"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[9,0,20,5,5],
"d0/d3e/classdata__structures_1_1trie.html#a499f87fd833203ef9492b4870aa6d42d":[10,0,2,12,5],
"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[10,0,2,12,8],
"d0/d3e/classdata__structures_1_1trie.html#a4bfac4be6ed1a34c7159eddb42469191":[9,0,20,5,8],
"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[9,0,20,5,7],
"d0/d3e/classdata__structures_1_1trie.html#a4cb0f775b5a4bc14a6d39b5c93883eb6":[10,0,2,12,7],
"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[10,0,2,12,0],
"d0/d3e/classdata__structures_1_1trie.html#a87d8bf99aea936f9381141753f1e90a8":[9,0,20,5,0],
"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[10,0,2,12,4],
"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[9,0,20,5,4],
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[10,0,2,12,1],
"d0/d3e/classdata__structures_1_1trie.html#a961eb5d576d2420f2036009154397c63":[10,0,2,12,4],
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[9,0,20,5,1],
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[9,0,20,5,2],
"d0/d3e/classdata__structures_1_1trie.html#aab373beb3f618b90922528c68797d988":[10,0,2,12,1],
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[10,0,2,12,2],
"d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab":[9,0,20,5,2],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html":[11,0,14,20],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#a8a3b522a675ab4cdec2d275f6f7798a1":[11,0,14,20,0],
"d0/d46/finding__number__of__digits__in__a__number_8cpp.html#ab4c15b7f1aedd4419a65cd49562cc300":[11,0,14,20,2],
@@ -81,18 +81,18 @@ var NAVTREEINDEX2 =
"d0/d51/approximate__pi_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,14,1,3],
"d0/d51/approximate__pi_8cpp.html#abf7f2a6d91f1ca6c89698792aea3f188":[11,0,14,1,1],
"d0/d52/namespacewiggle__sort.html":[9,0,129],
"d0/d58/classgraph_1_1_rooted_tree.html":[9,0,34,3],
"d0/d58/classgraph_1_1_rooted_tree.html":[10,0,6,4],
"d0/d58/classgraph_1_1_rooted_tree.html":[9,0,34,3],
"d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[9,0,34,3,2],
"d0/d58/classgraph_1_1_rooted_tree.html#a2ee3ad1161ac2532da30c3e22c265ad3":[10,0,6,4,2],
"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[10,0,6,4,3],
"d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43":[9,0,34,3,3],
"d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d":[10,0,6,4,0],
"d0/d58/classgraph_1_1_rooted_tree.html#aacdeecac857623e9fbfe92590f3c504d":[9,0,34,3,0],
"d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[9,0,34,3,4],
"d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[10,0,6,4,4],
"d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e":[10,0,6,4,1],
"d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe":[9,0,34,3,4],
"d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e":[9,0,34,3,1],
"d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e":[10,0,6,4,1],
"d0/d5a/skip__list_8cpp.html":[11,0,4,18],
"d0/d5a/skip__list_8cpp.html#a903639d8e6f955dd8d5c263781455d61":[11,0,4,18,4],
"d0/d5a/skip__list_8cpp.html#ac0d7e0be24da9f41bcb19745873c436a":[11,0,4,18,3],
@@ -126,10 +126,10 @@ var NAVTREEINDEX2 =
"d0/d6f/namespaceothers.html":[9,0,81],
"d0/d6f/namespaceothers.html#a48677fae5d683070432b1a905722d9ec":[9,0,81,1],
"d0/d6f/namespaceothers.html#aa17dc6d061dff34f6b9a610bc5e26703":[9,0,81,0],
"d0/d77/longest__palindromic__subsequence_8cpp.html":[11,0,6,7],
"d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,7,2],
"d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,7,1],
"d0/d77/longest__palindromic__subsequence_8cpp.html#afe9f45b6e30ee187509da2d1d0093412":[11,0,6,7,0],
"d0/d77/longest__palindromic__subsequence_8cpp.html":[11,0,6,8],
"d0/d77/longest__palindromic__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,8,2],
"d0/d77/longest__palindromic__subsequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,8,1],
"d0/d77/longest__palindromic__subsequence_8cpp.html#afe9f45b6e30ee187509da2d1d0093412":[11,0,6,8,0],
"d0/da2/number__of__positive__divisors_8cpp.html":[11,0,14,41],
"d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,14,41,2],
"d0/da2/number__of__positive__divisors_8cpp.html#ad89ccced8504b5116046cfa03066ffeb":[11,0,14,41,1],
@@ -187,67 +187,67 @@ var NAVTREEINDEX2 =
"d1/d76/buzz__number_8cpp.html":[11,0,17,0],
"d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,17,0,0],
"d1/d77/structmst.html":[10,0,42],
"d1/d83/classuint256__t.html":[10,0,58],
"d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3":[10,0,58,4],
"d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c":[10,0,58,15],
"d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163":[10,0,58,8],
"d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa":[10,0,58,3],
"d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5":[10,0,58,53],
"d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88":[10,0,58,55],
"d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39":[10,0,58,1],
"d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2":[10,0,58,54],
"d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f":[10,0,58,33],
"d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa":[10,0,58,12],
"d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13":[10,0,58,43],
"d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052":[10,0,58,5],
"d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb":[10,0,58,21],
"d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2":[10,0,58,73],
"d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409":[10,0,58,24],
"d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d":[10,0,58,27],
"d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3":[10,0,58,70],
"d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067":[10,0,58,6],
"d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06":[10,0,58,39],
"d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7":[10,0,58,77],
"d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e":[10,0,58,2],
"d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21":[10,0,58,32],
"d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51":[10,0,58,66],
"d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5":[10,0,58,52],
"d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7":[10,0,58,76],
"d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc":[10,0,58,58],
"d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df":[10,0,58,47],
"d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1":[10,0,58,37],
"d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45":[10,0,58,45],
"d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638":[10,0,58,59],
"d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8":[10,0,58,22],
"d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2":[10,0,58,78],
"d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7":[10,0,58,69],
"d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d":[10,0,58,20],
"d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b":[10,0,58,28],
"d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c":[10,0,58,36],
"d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc":[10,0,58,18],
"d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1":[10,0,58,10],
"d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2":[10,0,58,56],
"d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4":[10,0,58,40],
"d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb":[10,0,58,16],
"d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261":[10,0,58,61],
"d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a":[10,0,58,80],
"d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484":[10,0,58,60],
"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[10,0,58,23],
"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[10,0,58,9],
"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[10,0,58,13],
"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[10,0,58,42],
"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963":[10,0,58,25],
"d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc":[10,0,58,75],
"d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1":[10,0,58,11],
"d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967":[10,0,58,30],
"d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616":[10,0,58,29],
"d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547":[10,0,58,17],
"d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d":[10,0,58,41],
"d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259":[10,0,58,48],
"d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4":[10,0,58,49],
"d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056":[10,0,58,50],
"d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e":[10,0,58,38],
"d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7":[10,0,58,71],
"d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6":[10,0,58,46],
"d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d":[10,0,58,63]
"d1/d83/classuint256__t.html":[10,0,59],
"d1/d83/classuint256__t.html#a02616a4a46727b4c158b2b90de8c75c3":[10,0,59,4],
"d1/d83/classuint256__t.html#a028c585069fa53b74c153667ff66352c":[10,0,59,15],
"d1/d83/classuint256__t.html#a033d66c965e8d1fbc5bafb59ad60e163":[10,0,59,8],
"d1/d83/classuint256__t.html#a092a766421ba5833452e86a2357d7cfa":[10,0,59,3],
"d1/d83/classuint256__t.html#a0d96ce2d022dc30c2f303ab0698f52f5":[10,0,59,53],
"d1/d83/classuint256__t.html#a19c88f8f2736750822b82ef9a7096d88":[10,0,59,55],
"d1/d83/classuint256__t.html#a1fa3d95584d071add9b46597d3747b39":[10,0,59,1],
"d1/d83/classuint256__t.html#a2029e9777f999bffef6004429b4f19f2":[10,0,59,54],
"d1/d83/classuint256__t.html#a20dc3a017b1a740c4bafd3f146a90b0f":[10,0,59,33],
"d1/d83/classuint256__t.html#a28aa5786bbfce1b00398a8d38691bdaa":[10,0,59,12],
"d1/d83/classuint256__t.html#a28d26847f9b19a4f86c187791cb0db13":[10,0,59,43],
"d1/d83/classuint256__t.html#a2b5f745c05d10fa85ba5c409ad92d052":[10,0,59,5],
"d1/d83/classuint256__t.html#a2cd43a4a92dc825a010a17578b3bdedb":[10,0,59,21],
"d1/d83/classuint256__t.html#a2d7c8a1a5ecaf3e0dcb4bf6b6cff2da2":[10,0,59,73],
"d1/d83/classuint256__t.html#a303287d7bc8686dcb47fcb04720ad409":[10,0,59,24],
"d1/d83/classuint256__t.html#a357cdfee6a79e0484cd1e07511eb9f2d":[10,0,59,27],
"d1/d83/classuint256__t.html#a3dc4d3ab175f5f2a3172eb8d99a60fc3":[10,0,59,70],
"d1/d83/classuint256__t.html#a3ff17ab14b2371eb3239107d10947067":[10,0,59,6],
"d1/d83/classuint256__t.html#a406c951a07d8173685dbe384c6ab6a06":[10,0,59,39],
"d1/d83/classuint256__t.html#a41f4bb928c4ee067732503395b65f9d7":[10,0,59,77],
"d1/d83/classuint256__t.html#a42bf7490b31d8c750a67fd9bb6f2df2e":[10,0,59,2],
"d1/d83/classuint256__t.html#a4645040fe68ff01d83400f173fd2bb21":[10,0,59,32],
"d1/d83/classuint256__t.html#a47a19142e86b7369e18da1fc0a713c51":[10,0,59,66],
"d1/d83/classuint256__t.html#a4831263abc4430c363fdabce6e6e96d5":[10,0,59,52],
"d1/d83/classuint256__t.html#a4886747ffff15cdeb6bc93712629f9e7":[10,0,59,76],
"d1/d83/classuint256__t.html#a4c6db67d21c4927a45a4e1e7c2357bfc":[10,0,59,58],
"d1/d83/classuint256__t.html#a4fdeb4d4bf8cca4ee99b8487e59831df":[10,0,59,47],
"d1/d83/classuint256__t.html#a5363ec0f36de1a8a9c985907db4e95d1":[10,0,59,37],
"d1/d83/classuint256__t.html#a5e84ed2a2f99cee81ede4a0107702a45":[10,0,59,45],
"d1/d83/classuint256__t.html#a6c5e025f901f6af4b748f98013350638":[10,0,59,59],
"d1/d83/classuint256__t.html#a6eadaa829087e07eebafca3981566bb8":[10,0,59,22],
"d1/d83/classuint256__t.html#a6eec1f632aebfc44fee8a74c395e10c2":[10,0,59,78],
"d1/d83/classuint256__t.html#a74d1e1dd8cd2b31e00813ed939943be7":[10,0,59,69],
"d1/d83/classuint256__t.html#a76914bc727eab927a3941ef71275327d":[10,0,59,20],
"d1/d83/classuint256__t.html#a7ac99dea14428200f0101452293e2b3b":[10,0,59,28],
"d1/d83/classuint256__t.html#a7bbe36e2ebd52df5efab118897b3050c":[10,0,59,36],
"d1/d83/classuint256__t.html#a7bd9693b88c4df08b1f8d1fd81c597cc":[10,0,59,18],
"d1/d83/classuint256__t.html#a8161d52d369e525f4e61129376adfcf1":[10,0,59,10],
"d1/d83/classuint256__t.html#a86aab081bb7db2771e4a4f30c3eed8e2":[10,0,59,56],
"d1/d83/classuint256__t.html#a88978d00fa6a624c50c2737dc2c294b4":[10,0,59,40],
"d1/d83/classuint256__t.html#a89cf7fa466458ee08edd9a809d072bcb":[10,0,59,16],
"d1/d83/classuint256__t.html#a90ce75bec5b525de55bbf92c564a2261":[10,0,59,61],
"d1/d83/classuint256__t.html#a91badfd31be84b12cbb6d85ebc04d13a":[10,0,59,80],
"d1/d83/classuint256__t.html#a9879f7ec85fc148e1931fcb492ddc484":[10,0,59,60],
"d1/d83/classuint256__t.html#a9bc6cc460108306a59281ce4ca216839":[10,0,59,23],
"d1/d83/classuint256__t.html#a9ddd133cee83f3a2ab6ed60a7ccbc250":[10,0,59,9],
"d1/d83/classuint256__t.html#a9e1b39a46ea16bc6587e25e294c6c363":[10,0,59,13],
"d1/d83/classuint256__t.html#a9f6f3e39783c893473315bada864a183":[10,0,59,42],
"d1/d83/classuint256__t.html#aa0e532832640e9fe273b35c481b18963":[10,0,59,25],
"d1/d83/classuint256__t.html#aa28ae272e9176557133a10dffa3b94dc":[10,0,59,75],
"d1/d83/classuint256__t.html#aa4cf08fa6a33f17594b5a842866f39a1":[10,0,59,11],
"d1/d83/classuint256__t.html#aa9e585b186e71d7cbe9c1d7387c38967":[10,0,59,30],
"d1/d83/classuint256__t.html#aaca9288fd28fc07e1386f1586bd51616":[10,0,59,29],
"d1/d83/classuint256__t.html#aae68a7bd17c14a926fb77758b5c8e547":[10,0,59,17],
"d1/d83/classuint256__t.html#ab909ef62a0c85121e7d743c016fb723d":[10,0,59,41],
"d1/d83/classuint256__t.html#abc793979ec70bb8e5cf177d83649a259":[10,0,59,48],
"d1/d83/classuint256__t.html#ac1b36e64de42f3622e7d6ec5efa273d4":[10,0,59,49],
"d1/d83/classuint256__t.html#ac6bdcf64653af8173987bf7217e99056":[10,0,59,50],
"d1/d83/classuint256__t.html#ac75a46fe3625caf10e07db1eb75a1d6e":[10,0,59,38],
"d1/d83/classuint256__t.html#ac92ac0b2368990fbbaf3cca3ee8247d7":[10,0,59,71],
"d1/d83/classuint256__t.html#acac9901ab133caa57d058a377d873bf6":[10,0,59,46],
"d1/d83/classuint256__t.html#acadd235e0029ec43d5990d24affaf42d":[10,0,59,63]
};

48
navtreeindex3.js
View File

@@ -1,24 +1,24 @@
var NAVTREEINDEX3 =
{
"d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e":[10,0,58,68],
"d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7":[10,0,58,44],
"d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf":[10,0,58,72],
"d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2":[10,0,58,19],
"d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b":[10,0,58,14],
"d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13":[10,0,58,62],
"d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78":[10,0,58,67],
"d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c":[10,0,58,57],
"d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad":[10,0,58,65],
"d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5":[10,0,58,79],
"d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc":[10,0,58,0],
"d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b":[10,0,58,74],
"d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9":[10,0,58,35],
"d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75":[10,0,58,34],
"d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028":[10,0,58,31],
"d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5":[10,0,58,26],
"d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96":[10,0,58,51],
"d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4":[10,0,58,7],
"d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad":[10,0,58,64],
"d1/d83/classuint256__t.html#acb61fe17d064c61adc02defa651f9a5e":[10,0,59,68],
"d1/d83/classuint256__t.html#acd3970c633eb2c597874e2712392f0c7":[10,0,59,44],
"d1/d83/classuint256__t.html#acefecc3b1a4044f2be5ab46eea0099bf":[10,0,59,72],
"d1/d83/classuint256__t.html#ad4928175eaaaa2b559bc945affe63ad2":[10,0,59,19],
"d1/d83/classuint256__t.html#ad5bd38b2d3becca998457af1124d6e8b":[10,0,59,14],
"d1/d83/classuint256__t.html#ad74d33215517459c2b33ace7a9c6bc13":[10,0,59,62],
"d1/d83/classuint256__t.html#ad9ce2370b1497efbcc426793048e1f78":[10,0,59,67],
"d1/d83/classuint256__t.html#addff5645f6005e7b50a6ad0731e4f19c":[10,0,59,57],
"d1/d83/classuint256__t.html#adf09395f9113a69a05fed7e25b46c8ad":[10,0,59,65],
"d1/d83/classuint256__t.html#aecb2883133c8c8b9fcfb77ab69b03ab5":[10,0,59,79],
"d1/d83/classuint256__t.html#aed0f8c3d5be23644c4bcb2fd2551e1dc":[10,0,59,0],
"d1/d83/classuint256__t.html#af0a6e09fcf1cbf234ed32df6d7265a0b":[10,0,59,74],
"d1/d83/classuint256__t.html#af0ad4080bb5ddc16b54a7e87911005c9":[10,0,59,35],
"d1/d83/classuint256__t.html#af18e2e3d7ed635c4056062bc906fef75":[10,0,59,34],
"d1/d83/classuint256__t.html#af2193ff0d0e93143fb71f4847df16028":[10,0,59,31],
"d1/d83/classuint256__t.html#afa79020c27caea31236d04ecaa0e5ef5":[10,0,59,26],
"d1/d83/classuint256__t.html#afe9f4828d73dd51a080585dd0b99af96":[10,0,59,51],
"d1/d83/classuint256__t.html#afee82fa5052e9d8c946b9205b943cec4":[10,0,59,7],
"d1/d83/classuint256__t.html#aff4d49cf84de64301b169ad974f00bad":[10,0,59,64],
"d1/d9a/hopcroft__karp_8cpp.html":[11,0,9,8],
"d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9":[11,0,9,8,2],
"d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,9,8,1],
@@ -40,7 +40,7 @@ var NAVTREEINDEX3 =
"d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,18,7],
"d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5":[11,0,22,18,2],
"d1/daa/random__pivot__quick__sort_8cpp.html#ac3281dc34a9cfd7beb332419b8a0aa10":[11,0,22,18,6],
"d1/db3/structcompare.html":[10,0,23],
"d1/db3/structcompare.html":[10,0,24],
"d1/db6/namespaceknight__tour.html":[9,0,53],
"d1/dbb/n__choose__r_8cpp.html":[11,0,14,39],
"d1/dbb/n__choose__r_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97":[11,0,14,39,0],
@@ -148,9 +148,9 @@ var NAVTREEINDEX3 =
"d2/d26/count__inversions_8cpp.html#aad643c14734394e784a75169cb58132f":[11,0,22,4,2],
"d2/d26/count__inversions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,4,1],
"d2/d26/count__inversions_8cpp.html#ae97a486e14101c4822ea8dc47f0d1661":[11,0,22,4,3],
"d2/d2c/structtower.html":[10,0,55],
"d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9":[10,0,55,1],
"d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d":[10,0,55,0],
"d2/d2c/structtower.html":[10,0,56],
"d2/d2c/structtower.html#a3ebb75c13c57d51a8a1ba1ea54a515e9":[10,0,56,1],
"d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d":[10,0,56,0],
"d2/d3b/namespaceqr__algorithm.html":[9,0,88],
"d2/d3b/namespaceqr__algorithm.html#a257425cb2365359da51c6fe6741834d8":[9,0,88,2],
"d2/d3b/namespaceqr__algorithm.html#a28e2fa3e803abaea6c568dc45d69d8cc":[9,0,88,0],
@@ -210,8 +210,8 @@ var NAVTREEINDEX3 =
"d2/de9/heavy__light__decomposition_8cpp.html#a458410412185a5f09199deaff7157a8d":[11,0,20,1,5],
"d2/de9/heavy__light__decomposition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,1,3],
"d2/de9/heavy__light__decomposition_8cpp.html#af31ec5409537703d9c8a47350386b32a":[11,0,20,1,6],
"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[9,0,110,5],
"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[10,0,18,0],
"d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html":[9,0,110,5],
"d3/d05/sudoku__solver_8cpp.html":[11,0,0,10],
"d3/d05/sudoku__solver_8cpp.html#a07dc6acffd0500de9bdbf16b3ade94b0":[11,0,0,10,0],
"d3/d05/sudoku__solver_8cpp.html#ab040a12d7684cd85fb3684f4211ea5ac":[11,0,0,10,2],

20
navtreeindex4.js
View File

@@ -26,12 +26,12 @@ var NAVTREEINDEX4 =
"d3/d80/z__function_8cpp.html#ac044c4794349a8cff6256b99950d5773":[11,0,23,6,3],
"d3/d80/z__function_8cpp.html#ac186ca3ac3a69b5e52543bb13fe46db8":[11,0,23,6,0],
"d3/d80/z__function_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,23,6,1],
"d3/d84/word__break_8cpp.html":[11,0,6,13],
"d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81":[11,0,6,13,1],
"d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a":[11,0,6,13,0],
"d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,13,3],
"d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,13,2],
"d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c":[11,0,6,13,4],
"d3/d84/word__break_8cpp.html":[11,0,6,14],
"d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81":[11,0,6,14,1],
"d3/d84/word__break_8cpp.html#a272b0f5cdb4e41fd6dee4538b808c06a":[11,0,6,14,0],
"d3/d84/word__break_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,14,3],
"d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,14,2],
"d3/d84/word__break_8cpp.html#afe4dcd6fd5282e535685361cba645d7c":[11,0,6,14,4],
"d3/d91/namespacestrassens__multiplication.html":[9,0,112],
"d3/d92/pancake__sort_8cpp.html":[11,0,22,13],
"d3/d92/pancake__sort_8cpp.html#a99e27ad84ad43df9977776b1a8d5416e":[11,0,22,13,2],
@@ -244,10 +244,10 @@ var NAVTREEINDEX4 =
"d4/d8f/travelling__salesman__using__bit__manipulation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,8,0],
"d4/d90/classdata__structures_1_1_skip_list.html":[10,0,2,11],
"d4/d90/classdata__structures_1_1_skip_list.html":[9,0,20,4],
"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[10,0,2,11,7],
"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[9,0,20,4,7],
"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[10,0,2,11,3],
"d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650":[10,0,2,11,7],
"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[9,0,20,4,3],
"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[9,0,20,4,0],
"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[10,0,2,11,0]
"d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9":[10,0,2,11,3],
"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[10,0,2,11,0],
"d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4":[9,0,20,4,0]
};

48
navtreeindex5.js
View File

@@ -1,11 +1,11 @@
var NAVTREEINDEX5 =
{
"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[10,0,2,11,2],
"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[9,0,20,4,2],
"d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c":[10,0,2,11,2],
"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[9,0,20,4,1],
"d4/d90/classdata__structures_1_1_skip_list.html#a86925c53e139cc6c3f7df1e9003bb0b0":[10,0,2,11,1],
"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[10,0,2,11,4],
"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[9,0,20,4,4],
"d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4":[10,0,2,11,4],
"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[10,0,2,11,6],
"d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16":[9,0,20,4,6],
"d4/d90/classdata__structures_1_1_skip_list.html#af2f3d4e15b1f47afac849c2e08a730f4":[9,0,20,4,5],
@@ -91,8 +91,8 @@ var NAVTREEINDEX5 =
"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#a4b76571a2a04fa99c30a96eca9997f0e":[11,0,1,5,1],
"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,5,2],
"d5/d1e/next__higher__number__with__same__number__of__set__bits_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,5,0],
"d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html":[9,0,110,9],
"d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html":[10,0,18,4],
"d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html":[9,0,110,9],
"d5/d29/struct_min_heap_node.html":[10,0,41],
"d5/d2c/namespacelayers.html":[9,0,54],
"d5/d33/gram__schmidt_8cpp.html":[11,0,15,9],
@@ -124,22 +124,22 @@ var NAVTREEINDEX5 =
"d5/d4c/group__sorting.html#gaa8dca7b867074164d5f45b0f3851269d":[8,3,9],
"d5/d4c/group__sorting.html#gab6b14fea48d9841e29b9fc26be6e05d7":[8,3,7],
"d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4":[8,3,5],
"d5/d58/class_test_cases.html":[10,0,54],
"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,54,0],
"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,54,2],
"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,54,1],
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,9],
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,10],
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,54,11],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,8],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,7],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,54,6],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,14],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,12],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,54,13],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,3],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,4],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,54,5],
"d5/d58/class_test_cases.html":[10,0,55],
"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,55,1],
"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,55,2],
"d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e":[10,0,55,0],
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,55,10],
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,55,9],
"d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3":[10,0,55,11],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,55,8],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,55,6],
"d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008":[10,0,55,7],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,55,12],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,55,13],
"d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5":[10,0,55,14],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,55,3],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,55,5],
"d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23":[10,0,55,4],
"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html":[11,0,20,2],
"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,20,2,3],
"d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,2,2],
@@ -148,8 +148,8 @@ var NAVTREEINDEX5 =
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html":[10,0,15,1,0],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[10,0,15,1,0,0],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088":[9,0,94,0,0,0],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[10,0,15,1,0,1],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[9,0,94,0,0,1],
"d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf":[10,0,15,1,0,1],
"d5/d67/bayes__theorem_8cpp.html":[11,0,19,1],
"d5/d67/bayes__theorem_8cpp.html#a655bfe51252468d232dc639a340656ba":[11,0,19,1,0],
"d5/d67/bayes__theorem_8cpp.html#abb4f22dc05887c2259fdfc55c687598f":[11,0,19,1,1],
@@ -199,10 +199,10 @@ var NAVTREEINDEX5 =
"d5/d8a/trie__using__hashmap_8cpp.html":[11,0,4,24],
"d5/d8a/trie__using__hashmap_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,4,24,3],
"d5/d8a/trie__using__hashmap_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,4,24,2],
"d5/d90/palindrome__partitioning_8cpp.html":[11,0,6,10],
"d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a":[11,0,6,10,1],
"d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,10,2],
"d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,10,0],
"d5/d90/palindrome__partitioning_8cpp.html":[11,0,6,11],
"d5/d90/palindrome__partitioning_8cpp.html#a52ee22882858d2b1cf04293f02ed839a":[11,0,6,11,1],
"d5/d90/palindrome__partitioning_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,11,2],
"d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,11,0],
"d5/d91/namespacesorting.html#a034d8b276518a902962e87d3158b64fd":[9,0,105,0],
"d5/d91/namespacesorting.html#a0e9e1b21a1684585e9e50f9afe4d53a3":[9,0,105,10],
"d5/d91/namespacesorting.html#a140d913e42fb94176a0b2c8b29a80420":[9,0,105,8],

40
navtreeindex6.js
View File

@@ -37,32 +37,32 @@ var NAVTREEINDEX6 =
"d6/d1a/dnf__sort_8cpp.html#a621767fe711db64fe57a2ac4987b11f0":[11,0,22,6,0],
"d6/d1a/dnf__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,22,6,2],
"d6/d1a/dnf__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,6,1],
"d6/d26/classciphers_1_1_hill_cipher.html":[9,0,12,1],
"d6/d26/classciphers_1_1_hill_cipher.html":[10,0,1,1],
"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[9,0,12,1,8],
"d6/d26/classciphers_1_1_hill_cipher.html":[9,0,12,1],
"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[10,0,1,1,8],
"d6/d26/classciphers_1_1_hill_cipher.html#a12f727cca9e21f9539cd74b6603adf0c":[9,0,12,1,8],
"d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[9,0,12,1,9],
"d6/d26/classciphers_1_1_hill_cipher.html#a2eb58750b978a93ac5e6eb29e3e570b7":[10,0,1,1,9],
"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[10,0,1,1,6],
"d6/d26/classciphers_1_1_hill_cipher.html#a405b0a28d66a61239d3565d5256f9cb5":[9,0,12,1,6],
"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[10,0,1,1,1],
"d6/d26/classciphers_1_1_hill_cipher.html#a427acfac1dbff3f48a2b071d449d965b":[9,0,12,1,1],
"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[10,0,1,1,12],
"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[9,0,12,1,12],
"d6/d26/classciphers_1_1_hill_cipher.html#a629be41c1ab78850963e4ce14e1d11d9":[10,0,1,1,12],
"d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[10,0,1,1,5],
"d6/d26/classciphers_1_1_hill_cipher.html#a642f70fb54cb50b00fb6df7c3f2b120e":[9,0,12,1,5],
"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[10,0,1,1,11],
"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[9,0,12,1,11],
"d6/d26/classciphers_1_1_hill_cipher.html#a716d0313141499d16f57c0c107f04395":[10,0,1,1,11],
"d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[10,0,1,1,3],
"d6/d26/classciphers_1_1_hill_cipher.html#a7760f3665651a0a37937c79c62f219c0":[9,0,12,1,3],
"d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[9,0,12,1,2],
"d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917":[10,0,1,1,2],
"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[10,0,1,1,4],
"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[9,0,12,1,4],
"d6/d26/classciphers_1_1_hill_cipher.html#ab02c7563889bf1e363deb8e21967b706":[10,0,1,1,4],
"d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[9,0,12,1,10],
"d6/d26/classciphers_1_1_hill_cipher.html#ad36cbcc7a458b3f3a2af0c4aa1126590":[10,0,1,1,10],
"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[10,0,1,1,0],
"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[9,0,12,1,0],
"d6/d26/classciphers_1_1_hill_cipher.html#ad667fa0860977f6d6d443fa1dbcd80aa":[10,0,1,1,0],
"d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[9,0,12,1,7],
"d6/d26/classciphers_1_1_hill_cipher.html#ae77cad522fa44b8c985779a7188d2f41":[10,0,1,1,7],
"d6/d26/house__robber_8cpp.html":[11,0,6,4],
@@ -80,26 +80,26 @@ var NAVTREEINDEX6 =
"d6/d2d/modular__inverse__simple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,37,1],
"d6/d2e/fenwick__tree_8cpp.html":[11,0,20,0],
"d6/d2e/fenwick__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,20,0,1],
"d6/d30/classmachine__learning_1_1adaline.html":[10,0,9,3],
"d6/d30/classmachine__learning_1_1adaline.html":[9,0,60,0],
"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[9,0,60,0,1],
"d6/d30/classmachine__learning_1_1adaline.html":[10,0,9,3],
"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[10,0,9,3,1],
"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[10,0,9,3,0],
"d6/d30/classmachine__learning_1_1adaline.html#a082f758fb55fe19f22b3df66f89b2325":[9,0,60,0,1],
"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[9,0,60,0,0],
"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[10,0,9,3,8],
"d6/d30/classmachine__learning_1_1adaline.html#a0acbe32aaab897e7939e5b0454035b8c":[10,0,9,3,0],
"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[9,0,60,0,8],
"d6/d30/classmachine__learning_1_1adaline.html#a28160d17e492597a2f112e0d38551cda":[10,0,9,3,8],
"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[10,0,9,3,9],
"d6/d30/classmachine__learning_1_1adaline.html#a4cd8fe438032fedaa66f93bfd66f5492":[9,0,60,0,9],
"d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[9,0,60,0,3],
"d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5":[10,0,9,3,3],
"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[10,0,9,3,4],
"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[9,0,60,0,4],
"d6/d30/classmachine__learning_1_1adaline.html#a8d61f9ed872eef26bca39388cbda6a91":[10,0,9,3,4],
"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[10,0,9,3,7],
"d6/d30/classmachine__learning_1_1adaline.html#aa23d60262f917f35836ef4b1c1d9f7d3":[9,0,60,0,7],
"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[10,0,9,3,5],
"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[9,0,60,0,5],
"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[9,0,60,0,2],
"d6/d30/classmachine__learning_1_1adaline.html#ab11242d9ad5b03a75911e29b04f78fd3":[10,0,9,3,5],
"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[10,0,9,3,2],
"d6/d30/classmachine__learning_1_1adaline.html#ac8a9c2aaaa63b0f27ea176857e1e7d56":[9,0,60,0,2],
"d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[10,0,9,3,6],
"d6/d30/classmachine__learning_1_1adaline.html#ae347040516e995c8fb8ca2e5c0496daa":[9,0,60,0,6],
"d6/d38/find__non__repeating__number_8cpp.html":[11,0,1,3],
@@ -120,10 +120,10 @@ var NAVTREEINDEX6 =
"d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,14,33,0],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html":[10,0,1,0,0],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html":[9,0,12,0,0],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446":[10,0,1,0,0,0],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446":[9,0,12,0,0,0],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c":[10,0,1,0,0,1],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#a5084e9ca27837662c31d4dc003815446":[10,0,1,0,0,0],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c":[9,0,12,0,0,1],
"d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html#af2142b27241b28f835e8ce78d7d6463c":[10,0,1,0,0,1],
"d6/d4a/addition__rule_8cpp.html":[11,0,19,0],
"d6/d4a/addition__rule_8cpp.html#a4adfd055c758546456d440ee9133555d":[11,0,19,0,1],
"d6/d4a/addition__rule_8cpp.html#a565ffcbbdbe496ced37250bc8dc36bc0":[11,0,19,0,0],
@@ -169,11 +169,11 @@ var NAVTREEINDEX6 =
"d6/d80/double__hash__hash__table_8cpp.html#ac2adfce49ac57f6dbd1778d2c1ce0d2b":[11,0,12,1,8],
"d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,12,1,6],
"d6/d80/double__hash__hash__table_8cpp.html#af4981819aae8bc7e7beeaef02615e30d":[11,0,12,1,9],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html":[11,0,6,12],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607":[11,0,6,12,2],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,12,3],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50":[11,0,6,12,1],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,12,0],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html":[11,0,6,13],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#a280fcfb2f6fe49a31c4da572e7032607":[11,0,6,13,2],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,13,3],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#ac94e6c0dee11278ac0a5491f1b9a4a50":[11,0,6,13,1],
"d6/d80/dynamic__programming_2subset__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,13,0],
"d6/d84/classhashing_1_1sha256_1_1_hash.html":[10,0,7,0,0],
"d6/d84/classhashing_1_1sha256_1_1_hash.html#a0896c27ac39c780e0ee62417fdd0b9d3":[10,0,7,0,0,1],
"d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08":[10,0,7,0,0,0],

36
navtreeindex7.js
View File

@@ -42,14 +42,14 @@ var NAVTREEINDEX7 =
"d7/d56/count__bits__flip_8cpp.html#a2548486b6c3b80101e768562e687ef7b":[11,0,1,0,0],
"d7/d56/count__bits__flip_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,1,0,2],
"d7/d56/count__bits__flip_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,1,0,1],
"d7/d57/longest__increasing__subsequence_8cpp.html":[11,0,6,6],
"d7/d57/longest__increasing__subsequence_8cpp.html#a0a2215194e58786c34db1ccaf8031079":[11,0,6,6,0],
"d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,6,2],
"d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,6,6,1],
"d7/d65/shortest__common__supersequence_8cpp.html":[11,0,6,11],
"d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,11,2],
"d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6":[11,0,6,11,1],
"d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,11,0],
"d7/d57/longest__increasing__subsequence_8cpp.html":[11,0,6,7],
"d7/d57/longest__increasing__subsequence_8cpp.html#a0a2215194e58786c34db1ccaf8031079":[11,0,6,7,0],
"d7/d57/longest__increasing__subsequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,7,2],
"d7/d57/longest__increasing__subsequence_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089":[11,0,6,7,1],
"d7/d65/shortest__common__supersequence_8cpp.html":[11,0,6,12],
"d7/d65/shortest__common__supersequence_8cpp.html#aa8dca7b867074164d5f45b0f3851269d":[11,0,6,12,2],
"d7/d65/shortest__common__supersequence_8cpp.html#ad2ee8d7e67da9f6eb85146b08dad95e6":[11,0,6,12,1],
"d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,6,12,0],
"d7/d6a/bisection__method_8cpp.html":[11,0,15,1],
"d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14":[11,0,15,1,0],
"d7/d6a/bisection__method_8cpp.html#a1ab31b90bc584c635ec159468ceed9b2":[11,0,15,1,3],
@@ -78,10 +78,10 @@ var NAVTREEINDEX7 =
"d7/d7c/classstatistics_1_1stats__computer1.html#a27f0a03e2fd2254f1c81fe668226bd92":[9,0,109,0,3],
"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[9,0,109,0,4],
"d7/d7c/classstatistics_1_1stats__computer1.html#a350bf6c429691d3578c4dfc6679a0797":[10,0,17,0,4],
"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[9,0,109,0,0],
"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[10,0,17,0,0],
"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[10,0,17,0,1],
"d7/d7c/classstatistics_1_1stats__computer1.html#a390697dcee210b91823ceff04b25081b":[9,0,109,0,0],
"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[9,0,109,0,1],
"d7/d7c/classstatistics_1_1stats__computer1.html#aa13bf7c38de112f71921a5525d71a2f2":[10,0,17,0,1],
"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[10,0,17,0,2],
"d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1":[9,0,109,0,2],
"d7/d81/namespacebit__manipulation.html":[9,0,9],
@@ -128,20 +128,20 @@ var NAVTREEINDEX7 =
"d8/d13/bubble__sort_8cpp.html":[11,0,22,2],
"d8/d14/namespacen__queens__optimized.html":[9,0,76],
"d8/d1d/namespacestrand.html":[9,0,111],
"d8/d28/classrange__queries_1_1per_seg_tree.html":[10,0,15,1],
"d8/d28/classrange__queries_1_1per_seg_tree.html":[9,0,94,0],
"d8/d28/classrange__queries_1_1per_seg_tree.html":[10,0,15,1],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[10,0,15,1,4],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817":[9,0,94,0,4],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[9,0,94,0,7],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[10,0,15,1,7],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865":[9,0,94,0,7],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[10,0,15,1,10],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5":[9,0,94,0,10],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[9,0,94,0,8],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[10,0,15,1,8],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6":[9,0,94,0,8],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[9,0,94,0,2],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4":[10,0,15,1,2],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[9,0,94,0,11],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[10,0,15,1,11],
"d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3":[9,0,94,0,11],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[9,0,94,0,1],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3":[10,0,15,1,1],
"d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79":[9,0,94,0,3],
@@ -164,14 +164,14 @@ var NAVTREEINDEX7 =
"d8/d61/radix__sort2_8cpp.html#ae0cfd94fa3765b53d4ec7893ffaee5f8":[11,0,22,17,1],
"d8/d61/radix__sort2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,22,17,0],
"d8/d64/namespaceboruvkas__minimum__spanning__tree.html":[9,0,10],
"d8/d69/classgraph_1_1_h_k_graph.html":[9,0,34,1],
"d8/d69/classgraph_1_1_h_k_graph.html":[10,0,6,2],
"d8/d69/classgraph_1_1_h_k_graph.html":[9,0,34,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[9,0,34,1,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a0da5aa674d3b3e54a38251ee60d7cd64":[10,0,6,2,1],
"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[9,0,34,1,6],
"d8/d69/classgraph_1_1_h_k_graph.html#a35893def7a1c5cd60907b4893117796f":[10,0,6,2,6],
"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[10,0,6,2,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[9,0,34,1,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a":[10,0,6,2,2],
"d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[9,0,34,1,8],
"d8/d69/classgraph_1_1_h_k_graph.html#a3d9101e3b4598159005fd028b9b0ff74":[10,0,6,2,8],
"d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a":[9,0,34,1,7],
@@ -180,16 +180,16 @@ var NAVTREEINDEX7 =
"d8/d69/classgraph_1_1_h_k_graph.html#a6f5a9fdbb83ef731d739ba6707e21c3c":[10,0,6,2,9],
"d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[9,0,34,1,3],
"d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93":[10,0,6,2,3],
"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[10,0,6,2,10],
"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[9,0,34,1,10],
"d8/d69/classgraph_1_1_h_k_graph.html#a86ebff8a70cbfedd05281993d5d1987b":[10,0,6,2,10],
"d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[9,0,34,1,11],
"d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77":[10,0,6,2,11],
"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[9,0,34,1,5],
"d8/d69/classgraph_1_1_h_k_graph.html#a9dbda80d02bdc26c3e8ff7330c9be75d":[10,0,6,2,5],
"d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[10,0,6,2,4],
"d8/d69/classgraph_1_1_h_k_graph.html#ae794950cb3407b6b47d3dc986cf714c0":[9,0,34,1,4],
"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[10,0,6,2,0],
"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[9,0,34,1,0],
"d8/d69/classgraph_1_1_h_k_graph.html#af02b0c83911070ac6d95fc9905e58aa9":[10,0,6,2,0],
"d8/d6c/line__segment__intersection_8cpp.html":[11,0,8,2],
"d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4":[11,0,8,2,2],
"d8/d72/class_r_btree.html":[10,0,49],

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