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

Documentation for ecb8a3388d

Browse Source
This commit is contained in:
realstealthninja
2024-10-24 16:26:35 +00:00
parent 4c55e5257f
commit fe2cc4c065
318 changed files with 3809 additions and 1401 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
annotated.html
View File

@@ -161,10 +161,11 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
<tr id="row_6_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="d8/d69/classgraph_1_1_h_k_graph.html" target="_self">HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
<tr id="row_6_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="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">LowestCommonAncestor</a></td><td class="desc"></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="icona"><span class="icon">C</span></span><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">RootedTree</a></td><td class="desc"></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="dynsection.toggleFolder('7_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d90/namespacegreedy__algorithms.html" target="_self">greedy_algorithms</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
<tr id="row_7_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="dynsection.toggleFolder('7_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d90/namespacegreedy__algorithms.html" target="_self">greedy_algorithms</a></td><td class="desc">For string class </td></tr>
<tr id="row_7_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_7_0_" class="arrow" onclick="dynsection.toggleFolder('7_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html" target="_self">dijkstra</a></td><td class="desc">Functions for the <a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
<tr id="row_7_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" target="_self">Graph</a></td><td class="desc">Wrapper class for storing a graph </td></tr>
<tr id="row_7_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="da/d49/classgreedy__algorithms_1_1_digit_separation.html" target="_self">DigitSeparation</a></td><td class="desc">A class that provides methods to separate the digits of a large positive number </td></tr>
<tr id="row_7_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="de/df6/classgreedy__algorithms_1_1_binary_addition.html" target="_self">BinaryAddition</a></td><td class="desc">A class to perform binary addition of two binary strings </td></tr>
<tr id="row_7_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="da/d49/classgreedy__algorithms_1_1_digit_separation.html" target="_self">DigitSeparation</a></td><td class="desc">A class that provides methods to separate the digits of a large positive number </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="dynsection.toggleFolder('8_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d6/d0c/namespacehashing.html" target="_self">hashing</a></td><td class="desc">Hashing algorithms </td></tr>
<tr id="row_8_0_" class="odd" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_8_0_" class="arrow" onclick="dynsection.toggleFolder('8_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>sha256</b></td><td class="desc"></td></tr>
<tr id="row_8_0_0_" class="odd" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html" target="_self">Hash</a></td><td class="desc">Contains hash array and functions to update it and convert it to a hexadecimal string </td></tr>

1
annotated_dup.js
View File

@@ -75,6 +75,7 @@ var annotated_dup =
[ "dijkstra", "d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html", [
[ "Graph", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html", "d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph" ]
] ],
[ "BinaryAddition", "de/df6/classgreedy__algorithms_1_1_binary_addition.html", "de/df6/classgreedy__algorithms_1_1_binary_addition" ],
[ "DigitSeparation", "da/d49/classgreedy__algorithms_1_1_digit_separation.html", "da/d49/classgreedy__algorithms_1_1_digit_separation" ]
] ],
[ "hashing", "d6/d0c/namespacehashing.html", [

2
classes.html
View File

@@ -114,7 +114,7 @@ $(function(){initNavTree('classes.html',''); initResizable(true); });
<dd><a class="el" href="d6/d30/classmachine__learning_1_1adaline.html">adaline</a> (<a class="el" href="d8/d77/namespacemachine__learning.html">machine_learning</a>)</dd><dd><a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html">AyStarSearch</a> (machine_learning::aystar_search)</dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_B" name="letter_B">B</a></dt>
<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>
<dd><a class="el" href="d9/dde/classbinary__search__tree.html">binary_search_tree</a></dd><dd><a class="el" href="de/df6/classgreedy__algorithms_1_1_binary_addition.html">BinaryAddition</a> (<a class="el" href="d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</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="dc/d1f/classcatalan__numbers.html">catalan_numbers</a></dd><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>

10
d2/d90/namespacegreedy__algorithms.html
View File

@@ -112,7 +112,7 @@ $(function(){initNavTree('d2/d90/namespacegreedy__algorithms.html','../../'); in
</div><!--header-->
<div class="contents">
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>
<p>for string class
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
@@ -126,6 +126,9 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">BinaryAddition</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A class to perform binary addition of two binary strings. <a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#details">More...</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">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">DigitSeparation</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A class that provides methods to separate the digits of a large positive number. <a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -141,10 +144,13 @@ Functions</h2></td></tr>
<tr class="separator:a349e4ab9a97532c3931a2bd2a19c0098"><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>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
<div class="textblock"><p>for string class </p>
<p>for uint32_t</p>
<p>for assert</p>
<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> to store separated digits.</p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p>for reverse function for tests for input and outputs</p>
<p>Greedy Algorithms</p>
<p>for assert for INT_MAX for IO operations</p>
<p>Greedy Algorithms</p>
<p>For reveresing the vector For assert() function to check for errors For abs() function For int64_t data type to handle large numbers For input/output operations</p>

1
d2/d90/namespacegreedy__algorithms.js
View File

@@ -4,6 +4,7 @@ var namespacegreedy__algorithms =
[ "stable_matching", "dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html", [
[ "gale_shapley", "dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html#a6d7e84df47dcf19e88f95f8f9040306c", null ]
] ],
[ "BinaryAddition", "de/df6/classgreedy__algorithms_1_1_binary_addition.html", "de/df6/classgreedy__algorithms_1_1_binary_addition" ],
[ "DigitSeparation", "da/d49/classgreedy__algorithms_1_1_digit_separation.html", "da/d49/classgreedy__algorithms_1_1_digit_separation" ],
[ "can_jump", "d2/d90/namespacegreedy__algorithms.html#a33e3819aa9ffec0e380383c52603b502", null ],
[ "findMinimumEdge", "d2/d90/namespacegreedy__algorithms.html#a349e4ab9a97532c3931a2bd2a19c0098", null ]

2
d3/d36/digit__separation_8cpp.html
View File

@@ -135,7 +135,7 @@ Classes</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><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="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <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>

2
d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html
View File

@@ -126,7 +126,7 @@ Include dependency graph for boruvkas_minimum_spanning_tree.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><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="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d64/namespaceboruvkas__minimum__spanning__tree.html">boruvkas_minimum_spanning_tree</a></td></tr>
<tr class="memdesc:d8/d64/namespaceboruvkas__minimum__spanning__tree"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the [Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) implementation. <br /></td></tr>

11
d5/d95/binary__addition_8cpp__incl.map Normal file
View File

@@ -0,0 +1,11 @@
<map id="greedy_algorithms/binary_addition.cpp" name="greedy_algorithms/binary_addition.cpp">
<area shape="rect" id="Node000001" title="Adds two binary numbers and outputs resulting string." alt="" coords="98,5,264,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,80,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="148,49,78,88,75,84,145,44"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="104,94,168,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="172,48,153,82,148,79,168,45"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="192,94,264,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="195,45,215,79,211,82,190,48"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="288,94,341,120"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="216,44,282,83,280,88,213,49"/>
</map>

1
d5/d95/binary__addition_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
d995b5f8d9514a1cead7fa4110c56253

120
d5/d95/binary__addition_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,120 @@
<?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 12.1.2 (20240928.0832)
-->
<!-- Title: greedy_algorithms/binary_addition.cpp Pages: 1 -->
<svg width="260pt" height="94pt"
viewBox="0.00 0.00 259.88 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">
<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>greedy_algorithms/binary_addition.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Adds two binary numbers and outputs resulting string.">
<polygon fill="#999999" stroke="#666666" points="194.25,-85.75 69.5,-85.75 69.5,-55.25 194.25,-55.25 194.25,-85.75"/>
<text text-anchor="start" x="77.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/binary</text>
<text text-anchor="middle" x="131.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_addition.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="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">algorithm</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="M105.9,-54.8C89.91,-45.74 69.49,-34.19 53.56,-25.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.57,-22.28 45.14,-20.4 52.12,-28.37 55.57,-22.28"/>
</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="122,-19.25 73.75,-19.25 73.75,0 122,0 122,-19.25"/>
<text text-anchor="middle" x="97.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</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="M123.47,-54.95C119.04,-47.28 113.55,-37.77 108.8,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="111.91,-27.92 103.87,-21.01 105.84,-31.42 111.91,-27.92"/>
</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="193.62,-19.25 140.12,-19.25 140.12,0 193.62,0 193.62,-19.25"/>
<text text-anchor="middle" x="166.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M140.53,-54.95C145.09,-47.28 150.74,-37.77 155.63,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.6,-31.39 160.71,-21 152.59,-27.81 158.6,-31.39"/>
</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="251.88,-19.25 211.88,-19.25 211.88,0 251.88,0 251.88,-19.25"/>
<text text-anchor="middle" x="231.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string</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="M156.85,-54.8C172.08,-45.83 191.48,-34.41 206.74,-25.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="208.39,-28.51 215.23,-20.42 204.84,-22.48 208.39,-28.51"/>
</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.7 KiB

94
d5/d95/binary__addition_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,94 @@
<?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 12.1.2 (20240928.0832)
-->
<!-- Title: greedy_algorithms/binary_addition.cpp Pages: 1 -->
<svg width="260pt" height="94pt"
viewBox="0.00 0.00 259.88 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>greedy_algorithms/binary_addition.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Adds two binary numbers and outputs resulting string.">
<polygon fill="#999999" stroke="#666666" points="194.25,-85.75 69.5,-85.75 69.5,-55.25 194.25,-55.25 194.25,-85.75"/>
<text text-anchor="start" x="77.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/binary</text>
<text text-anchor="middle" x="131.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_addition.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="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">algorithm</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="M105.9,-54.8C89.91,-45.74 69.49,-34.19 53.56,-25.16"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="55.57,-22.28 45.14,-20.4 52.12,-28.37 55.57,-22.28"/>
</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="122,-19.25 73.75,-19.25 73.75,0 122,0 122,-19.25"/>
<text text-anchor="middle" x="97.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</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="M123.47,-54.95C119.04,-47.28 113.55,-37.77 108.8,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="111.91,-27.92 103.87,-21.01 105.84,-31.42 111.91,-27.92"/>
</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="193.62,-19.25 140.12,-19.25 140.12,0 193.62,0 193.62,-19.25"/>
<text text-anchor="middle" x="166.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M140.53,-54.95C145.09,-47.28 150.74,-37.77 155.63,-29.54"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="158.6,-31.39 160.71,-21 152.59,-27.81 158.6,-31.39"/>
</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="251.88,-19.25 211.88,-19.25 211.88,0 251.88,0 251.88,-19.25"/>
<text text-anchor="middle" x="231.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">string</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="M156.85,-54.8C172.08,-45.83 191.48,-34.41 206.74,-25.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="208.39,-28.51 215.23,-20.42 204.84,-22.48 208.39,-28.51"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.0 KiB

124
d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html Normal file
View File

@@ -0,0 +1,124 @@
<!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.12.0"/>
<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>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/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.12.0 -->
<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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @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',true);
$(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 */
$(function(){initNavTree('de/df6/classgreedy__algorithms_1_1_binary_addition.html','../../'); initResizable(true); });
/* @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">greedy_algorithms::BinaryAddition Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(const std::string &amp;a, const std::string &amp;b)</td><td class="entry"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(const std::string &amp;str) const</td><td class="entry"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</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.12.0 </li>
</ul>
</div>
</body>
</html>

4
d7/d71/_longest___increasing___subsequence__using__binary__search_8cpp__incl.map → d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.map
View File

@@ -1,5 +1,5 @@
<map id="search/Longest_Increasing_Subsequence_using_binary_search.cpp" name="search/Longest_Increasing_Subsequence_using_binary_search.cpp">
<area shape="rect" id="Node000001" title="find the length of the Longest Increasing Subsequence (LIS) using Binary Search" alt="" coords="124,5,311,61"/>
<map id="search/longest_increasing_subsequence_using_binary_search.cpp" name="search/longest_increasing_subsequence_using_binary_search.cpp">
<area shape="rect" id="Node000001" title="find the length of the Longest Increasing Subsequence (LIS) using Binary Search" alt="" coords="125,5,310,61"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,109,70,135"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="162,64,77,104,75,100,160,59"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="94,109,165,135"/>

1
d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
d13e4b4654217688e7e19aebe8d72b0f

10
d7/d71/_longest___increasing___subsequence__using__binary__search_8cpp__incl.svg → d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.svg
View File

@@ -3,7 +3,7 @@
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: search/Longest_Increasing_Subsequence_using_binary_search.cpp Pages: 1 -->
<!-- Title: search/longest_increasing_subsequence_using_binary_search.cpp Pages: 1 -->
<svg width="326pt" height="105pt"
viewBox="0.00 0.00 325.75 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
@@ -18,14 +18,14 @@
<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 101)">
<title>search/Longest_Increasing_Subsequence_using_binary_search.cpp</title>
<title>search/longest_increasing_subsequence_using_binary_search.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="find the length of the Longest Increasing Subsequence (LIS) using Binary Search">
<polygon fill="#999999" stroke="#666666" points="229.38,-97 88.88,-97 88.88,-55.25 229.38,-55.25 229.38,-97"/>
<text text-anchor="start" x="96.88" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">search/Longest_Increasing</text>
<text text-anchor="start" x="96.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_Subsequence_using_binary</text>
<polygon fill="#999999" stroke="#666666" points="228.62,-97 89.62,-97 89.62,-55.25 228.62,-55.25 228.62,-97"/>
<text text-anchor="start" x="97.62" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">search/longest_increasing</text>
<text text-anchor="start" x="97.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
<text text-anchor="middle" x="159.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_search.cpp</text>
</a>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.6 KiB

After

Width:  |  Height:  |  Size: 5.6 KiB

10
d7/d71/_longest___increasing___subsequence__using__binary__search_8cpp__incl_org.svg → d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl_org.svg
View File

@@ -3,18 +3,18 @@
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: search/Longest_Increasing_Subsequence_using_binary_search.cpp Pages: 1 -->
<!-- Title: search/longest_increasing_subsequence_using_binary_search.cpp Pages: 1 -->
<svg width="326pt" height="105pt"
viewBox="0.00 0.00 325.75 105.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 101)">
<title>search/Longest_Increasing_Subsequence_using_binary_search.cpp</title>
<title>search/longest_increasing_subsequence_using_binary_search.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="find the length of the Longest Increasing Subsequence (LIS) using Binary Search">
<polygon fill="#999999" stroke="#666666" points="229.38,-97 88.88,-97 88.88,-55.25 229.38,-55.25 229.38,-97"/>
<text text-anchor="start" x="96.88" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">search/Longest_Increasing</text>
<text text-anchor="start" x="96.88" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_Subsequence_using_binary</text>
<polygon fill="#999999" stroke="#666666" points="228.62,-97 89.62,-97 89.62,-55.25 228.62,-55.25 228.62,-97"/>
<text text-anchor="start" x="97.62" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">search/longest_increasing</text>
<text text-anchor="start" x="97.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
<text text-anchor="middle" x="159.12" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_search.cpp</text>
</a>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.9 KiB

After

Width:  |  Height:  |  Size: 4.9 KiB

2
d6/dba/jump__game_8cpp.html
View File

@@ -125,7 +125,7 @@ Include dependency graph for jump_game.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><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="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <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>

1
d7/d71/_longest___increasing___subsequence__using__binary__search_8cpp__incl.md5
View File

@@ -1 +0,0 @@
54cee71d7748f8d0a1a1504165930480

2
d8/d7d/kruskals__minimum__spanning__tree_8cpp.html
View File

@@ -126,7 +126,7 @@ Include dependency graph for kruskals_minimum_spanning_tree.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><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="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <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>

253
d9/d1f/binary__addition_8cpp.html Normal file
View File

@@ -0,0 +1,253 @@
<!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.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: greedy_algorithms/binary_addition.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>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/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.12.0 -->
<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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @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',true);
$(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 */
$(function(){initNavTree('d9/d1f/binary__addition_8cpp.html','../../'); initResizable(true); });
/* @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="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">binary_addition.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Adds two binary numbers and outputs resulting string.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;string&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for binary_addition.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d95/binary__addition_8cpp__incl.svg" width="347" 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">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A class to perform binary addition of two binary strings. <a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <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:a483bb8ccf42aaf7375a83e91490eda1e" id="r_a483bb8ccf42aaf7375a83e91490eda1e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a> ()</td></tr>
<tr class="memdesc:a483bb8ccf42aaf7375a83e91490eda1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">run self test implementation. <br /></td></tr>
<tr class="separator:a483bb8ccf42aaf7375a83e91490eda1e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#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>Adds two binary numbers and outputs resulting string. </p>
<p>The algorithm for adding two binary strings works by processing them from right to left, similar to manual addition. It starts by determining the longer string's length to ensure both strings are fully traversed. For each pair of corresponding bits and any carry from the previous addition, it calculates the sum. If the sum exceeds 1, a carry is generated for the next bit. The results for each bit are collected in a result string, which is reversed at the end to present the final binary sum correctly. Additionally, the function validates the input to ensure that only valid binary strings (containing only '0' and '1') are processed. If invalid input is detected, it returns an empty string. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/mjk22071998" target="_blank">Muhammad Junaid Khalid</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<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</td> <td class="paramname"><span class="paramname"><em></em></span></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 successful exit </dd></dl>
<p>To execute tests</p>
<div class="fragment"><div class="line"><span class="lineno"> 116</span> {</div>
<div class="line"><span class="lineno"> 117</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">/// To execute tests</span></div>
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 119</span>}</div>
<div class="ttc" id="abinary__addition_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">run self test implementation.</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:86</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="../../d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="100%" height="487"><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="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"><span class="paramname"><em></em></span></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>run self test implementation. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 86</span> {</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_class" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a> binaryAddition;</div>
<div class="line"><span class="lineno"> 88</span> </div>
<div class="line"><span class="lineno"> 89</span> <span class="comment">// Valid binary string tests</span></div>
<div class="line"><span class="lineno"> 90</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1010&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;10111&quot;</span>);</div>
<div class="line"><span class="lineno"> 91</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1111&quot;</span>, <span class="stringliteral">&quot;1111&quot;</span>) == <span class="stringliteral">&quot;11110&quot;</span>);</div>
<div class="line"><span class="lineno"> 92</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;101&quot;</span>, <span class="stringliteral">&quot;11&quot;</span>) == <span class="stringliteral">&quot;1000&quot;</span>);</div>
<div class="line"><span class="lineno"> 93</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;0&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>) == <span class="stringliteral">&quot;0&quot;</span>);</div>
<div class="line"><span class="lineno"> 94</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1111&quot;</span>, <span class="stringliteral">&quot;1111&quot;</span>) == <span class="stringliteral">&quot;11110&quot;</span>);</div>
<div class="line"><span class="lineno"> 95</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;0&quot;</span>, <span class="stringliteral">&quot;10101&quot;</span>) == <span class="stringliteral">&quot;10101&quot;</span>);</div>
<div class="line"><span class="lineno"> 96</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;10101&quot;</span>, <span class="stringliteral">&quot;0&quot;</span>) == <span class="stringliteral">&quot;10101&quot;</span>);</div>
<div class="line"><span class="lineno"> 97</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;101010101010101010101010101010&quot;</span>,</div>
<div class="line"><span class="lineno"> 98</span> <span class="stringliteral">&quot;110110110110110110110110110110&quot;</span>) ==</div>
<div class="line"><span class="lineno"> 99</span> <span class="stringliteral">&quot;1100001100001100001100001100000&quot;</span>);</div>
<div class="line"><span class="lineno"> 100</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1&quot;</span>, <span class="stringliteral">&quot;11111111&quot;</span>) == <span class="stringliteral">&quot;100000000&quot;</span>);</div>
<div class="line"><span class="lineno"> 101</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;10101010&quot;</span>, <span class="stringliteral">&quot;01010101&quot;</span>) == <span class="stringliteral">&quot;11111111&quot;</span>);</div>
<div class="line"><span class="lineno"> 102</span> </div>
<div class="line"><span class="lineno"> 103</span> <span class="comment">// Invalid binary string tests (should return empty string)</span></div>
<div class="line"><span class="lineno"> 104</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;10102&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 105</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;ABC&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 106</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1010&quot;</span>, <span class="stringliteral">&quot;1102&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 107</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;111&quot;</span>, <span class="stringliteral">&quot;1x1&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 108</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1x1&quot;</span>, <span class="stringliteral">&quot;111&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 109</span> assert(binaryAddition.<a class="code hl_function" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a>(<span class="stringliteral">&quot;1234&quot;</span>, <span class="stringliteral">&quot;1101&quot;</span>) == <span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><span class="lineno"> 110</span>}</div>
<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">greedy_algorithms::BinaryAddition</a></div><div class="ttdoc">A class to perform binary addition of two binary strings.</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:31</div></div>
<div class="ttc" id="aclassgreedy__algorithms_1_1_binary_addition_html_a801fd1ec5cda76b0bb82cbf23ed4d527"><div class="ttname"><a href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">greedy_algorithms::BinaryAddition::addBinary</a></div><div class="ttdeci">std::string addBinary(const std::string &amp;a, const std::string &amp;b)</div><div class="ttdoc">Adds two binary strings and returns the result as a binary string.</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:40</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="../../d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="100%" height="487"><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_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d9/d1f/binary__addition_8cpp.html">binary_addition.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.12.0 </li>
</ul>
</div>
</body>
</html>

6
d9/d1f/binary__addition_8cpp.js Normal file
View File

@@ -0,0 +1,6 @@
var binary__addition_8cpp =
[
[ "greedy_algorithms::BinaryAddition", "de/df6/classgreedy__algorithms_1_1_binary_addition.html", "de/df6/classgreedy__algorithms_1_1_binary_addition" ],
[ "main", "d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "tests", "d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
];

19
d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map Normal file
View File

@@ -0,0 +1,19 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="run self test implementation." alt="" coords="5,145,56,171"/>
<area shape="rect" id="Node000002" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" title="Adds two binary strings and returns the result as a binary string." alt="" coords="104,138,275,178"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,156,88,156,88,161,56,161"/>
<area shape="rect" id="Node000003" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="323,40,511,95"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="241,135,330,99,332,104,243,140"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="381,120,453,146"/>
<area shape="poly" id="edge6_Node000002_Node000007" title=" " alt="" coords="275,146,365,136,366,141,275,151"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="372,169,462,195"/>
<area shape="poly" id="edge7_Node000002_Node000008" title=" " alt="" coords="275,165,356,173,356,178,275,170"/>
<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/size.html#" title=" " alt="" coords="362,219,473,244"/>
<area shape="poly" id="edge8_Node000002_Node000009" title=" " alt="" coords="244,177,324,205,347,212,346,217,322,210,242,182"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="579,5,658,31"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="511,42,563,29,565,34,512,47"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/begin.html#" title=" " alt="" coords="559,55,678,80"/>
<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="511,65,544,65,544,70,511,70"/>
<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/end.html#" title=" " alt="" coords="564,104,673,130"/>
<area shape="poly" id="edge5_Node000003_Node000006" title=" " alt="" coords="512,88,550,97,548,102,511,93"/>
</map>

1
d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
63665c0e068421d7d7905880f7257247

251
d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg Normal file
View File

@@ -0,0 +1,251 @@
<?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 12.1.2 (20240928.0832)
-->
<!-- Title: tests Pages: 1 -->
<!--zoomable 187 -->
<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 = 512;
var viewHeight = 187;
var sectionId = 'dynsection-2';
</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="run self test implementation.">
<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
<text text-anchor="middle" x="18.88" y="-60.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="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" target="_top" xlink:title="Adds two binary strings and returns the result as a binary string.">
<polygon fill="white" stroke="#666666" points="202.25,-79.88 73.75,-79.88 73.75,-49.38 202.25,-49.38 202.25,-79.88"/>
<text text-anchor="start" x="81.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="138" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</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="M38.18,-64.62C45.01,-64.62 53.25,-64.62 62.04,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.87,-68.13 71.87,-64.63 61.87,-61.13 61.87,-68.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
<polygon fill="white" stroke="#666666" points="379.5,-153.5 238.25,-153.5 238.25,-111.75 379.5,-111.75 379.5,-153.5"/>
<text text-anchor="start" x="246.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="246.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
<text text-anchor="middle" x="308.88" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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="M177.74,-80.23C197.5,-88.18 222.03,-98.06 244.45,-107.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="242.93,-110.25 253.51,-110.73 245.54,-103.75 242.93,-110.25"/>
</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/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="336,-93.25 281.75,-93.25 281.75,-74 336,-74 336,-93.25"/>
<text text-anchor="middle" x="308.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge6_Node000002_Node000007" class="edge">
<title>Node2&#45;&gt;Node7</title>
<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M202.36,-71.75C225.1,-74.31 250.02,-77.12 269.93,-79.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="269.48,-82.83 279.81,-80.47 270.26,-75.87 269.48,-82.83"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="342.75,-56.25 275,-56.25 275,-37 342.75,-37 342.75,-56.25"/>
<text text-anchor="middle" x="308.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M202.36,-57.87C222.57,-55.72 244.51,-53.38 263.11,-51.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="263.43,-54.88 273.01,-50.34 262.69,-47.92 263.43,-54.88"/>
</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/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="350.62,-19.25 267.12,-19.25 267.12,0 350.62,0 350.62,-19.25"/>
<text text-anchor="middle" x="308.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge8_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M178.28,-48.91C196.38,-41.94 218.25,-33.92 238.25,-27.62 243.98,-25.82 250.02,-24.06 256.04,-22.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="256.6,-25.86 265.35,-19.88 254.78,-19.1 256.6,-25.86"/>
</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/algorithm/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="489.25,-179.25 430.5,-179.25 430.5,-160 489.25,-160 489.25,-179.25"/>
<text text-anchor="middle" x="459.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M379.58,-149.93C393.12,-153.3 406.88,-156.71 419.05,-159.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="418.15,-163.12 428.7,-162.13 419.84,-156.33 418.15,-163.12"/>
</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/string/basic_string/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="504.25,-142.25 415.5,-142.25 415.5,-123 504.25,-123 504.25,-142.25"/>
<text text-anchor="middle" x="459.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M379.58,-132.62C387.72,-132.62 395.94,-132.62 403.84,-132.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="403.64,-136.13 413.64,-132.63 403.64,-129.13 403.64,-136.13"/>
</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/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="500.5,-105.25 419.25,-105.25 419.25,-86 500.5,-86 500.5,-105.25"/>
<text text-anchor="middle" x="459.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge5_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M379.58,-115.32C389.06,-112.96 398.64,-110.58 407.71,-108.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="408.55,-111.73 417.41,-105.92 406.86,-104.94 408.55,-111.73"/>
</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="binary__addition_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: 12 KiB

168
d9/d1f/binary__addition_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg Normal file
View File

@@ -0,0 +1,168 @@
<?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 12.1.2 (20240928.0832)
-->
<!-- Title: tests Pages: 1 -->
<svg width="512pt" height="187pt"
viewBox="0.00 0.00 512.25 187.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 183.25)">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="run self test implementation.">
<polygon fill="#999999" stroke="#666666" points="37.75,-74.25 0,-74.25 0,-55 37.75,-55 37.75,-74.25"/>
<text text-anchor="middle" x="18.88" y="-60.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="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" target="_top" xlink:title="Adds two binary strings and returns the result as a binary string.">
<polygon fill="white" stroke="#666666" points="202.25,-79.88 73.75,-79.88 73.75,-49.38 202.25,-49.38 202.25,-79.88"/>
<text text-anchor="start" x="81.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="138" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</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="M38.18,-64.62C45.01,-64.62 53.25,-64.62 62.04,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.87,-68.13 71.87,-64.63 61.87,-61.13 61.87,-68.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
<polygon fill="white" stroke="#666666" points="379.5,-153.5 238.25,-153.5 238.25,-111.75 379.5,-111.75 379.5,-153.5"/>
<text text-anchor="start" x="246.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="246.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
<text text-anchor="middle" x="308.88" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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="M177.74,-80.23C197.5,-88.18 222.03,-98.06 244.45,-107.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="242.93,-110.25 253.51,-110.73 245.54,-103.75 242.93,-110.25"/>
</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/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="336,-93.25 281.75,-93.25 281.75,-74 336,-74 336,-93.25"/>
<text text-anchor="middle" x="308.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge6_Node000002_Node000007" class="edge">
<title>Node2&#45;&gt;Node7</title>
<g id="a_edge6_Node000002_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M202.36,-71.75C225.1,-74.31 250.02,-77.12 269.93,-79.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="269.48,-82.83 279.81,-80.47 270.26,-75.87 269.48,-82.83"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="342.75,-56.25 275,-56.25 275,-37 342.75,-37 342.75,-56.25"/>
<text text-anchor="middle" x="308.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M202.36,-57.87C222.57,-55.72 244.51,-53.38 263.11,-51.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="263.43,-54.88 273.01,-50.34 262.69,-47.92 263.43,-54.88"/>
</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/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="350.62,-19.25 267.12,-19.25 267.12,0 350.62,0 350.62,-19.25"/>
<text text-anchor="middle" x="308.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node9 -->
<g id="edge8_Node000002_Node000009" class="edge">
<title>Node2&#45;&gt;Node9</title>
<g id="a_edge8_Node000002_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M178.28,-48.91C196.38,-41.94 218.25,-33.92 238.25,-27.62 243.98,-25.82 250.02,-24.06 256.04,-22.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="256.6,-25.86 265.35,-19.88 254.78,-19.1 256.6,-25.86"/>
</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/algorithm/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="489.25,-179.25 430.5,-179.25 430.5,-160 489.25,-160 489.25,-179.25"/>
<text text-anchor="middle" x="459.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M379.58,-149.93C393.12,-153.3 406.88,-156.71 419.05,-159.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="418.15,-163.12 428.7,-162.13 419.84,-156.33 418.15,-163.12"/>
</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/string/basic_string/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="504.25,-142.25 415.5,-142.25 415.5,-123 504.25,-123 504.25,-142.25"/>
<text text-anchor="middle" x="459.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4_Node000003_Node000005" class="edge">
<title>Node3&#45;&gt;Node5</title>
<g id="a_edge4_Node000003_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M379.58,-132.62C387.72,-132.62 395.94,-132.62 403.84,-132.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="403.64,-136.13 413.64,-132.63 403.64,-129.13 403.64,-136.13"/>
</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/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="500.5,-105.25 419.25,-105.25 419.25,-86 500.5,-86 500.5,-105.25"/>
<text text-anchor="middle" x="459.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge5_Node000003_Node000006" class="edge">
<title>Node3&#45;&gt;Node6</title>
<g id="a_edge5_Node000003_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M379.58,-115.32C389.06,-112.96 398.64,-110.58 407.71,-108.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="408.55,-111.73 417.41,-105.92 406.86,-104.94 408.55,-111.73"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 8.1 KiB

21
d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,21 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="main function" alt="" coords="5,145,55,171"/>
<area shape="rect" id="Node000002" href="$d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="run self test implementation." alt="" coords="103,145,153,171"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,156,88,156,88,161,55,161"/>
<area shape="rect" id="Node000003" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" title="Adds two binary strings and returns the result as a binary string." alt="" coords="201,138,372,178"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="154,156,185,156,185,161,154,161"/>
<area shape="rect" id="Node000004" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="420,40,609,95"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="339,135,428,99,430,104,341,140"/>
<area shape="rect" id="Node000008" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/max.html#" title=" " alt="" coords="478,120,551,146"/>
<area shape="poly" id="edge7_Node000003_Node000008" title=" " alt="" coords="372,146,462,136,463,141,373,151"/>
<area shape="rect" id="Node000009" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="469,169,560,195"/>
<area shape="poly" id="edge8_Node000003_Node000009" title=" " alt="" coords="373,165,454,173,453,178,372,170"/>
<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/size.html#" title=" " alt="" coords="459,219,570,244"/>
<area shape="poly" id="edge9_Node000003_Node000010" title=" " alt="" coords="341,177,421,205,445,212,443,217,420,210,339,182"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="677,5,755,31"/>
<area shape="poly" id="edge4_Node000004_Node000005" title=" " alt="" coords="608,42,661,29,662,34,609,47"/>
<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/begin.html#" title=" " alt="" coords="657,55,775,80"/>
<area shape="poly" id="edge5_Node000004_Node000006" title=" " alt="" coords="609,65,641,65,641,70,609,70"/>
<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/end.html#" title=" " alt="" coords="662,104,770,130"/>
<area shape="poly" id="edge6_Node000004_Node000007" title=" " alt="" coords="609,88,647,97,646,102,608,93"/>
</map>

1
d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
c2e5140f359b81ab1ce769a37f7c6ebb

269
d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,269 @@
<?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 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 187 -->
<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 = 585;
var viewHeight = 187;
var sectionId = 'dynsection-1';
</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,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
<text text-anchor="middle" x="18.5" y="-60.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="../../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="run self test implementation.">
<polygon fill="white" stroke="#666666" points="110.75,-74.25 73,-74.25 73,-55 110.75,-55 110.75,-74.25"/>
<text text-anchor="middle" x="91.88" y="-60.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,-64.62C44.55,-64.62 53.37,-64.62 61.69,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-68.13 71.43,-64.63 61.43,-61.13 61.43,-68.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" target="_top" xlink:title="Adds two binary strings and returns the result as a binary string.">
<polygon fill="white" stroke="#666666" points="275.25,-79.88 146.75,-79.88 146.75,-49.38 275.25,-49.38 275.25,-79.88"/>
<text text-anchor="start" x="154.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="211" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</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="M111.18,-64.62C118.01,-64.62 126.25,-64.62 135.04,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.87,-68.13 144.87,-64.63 134.87,-61.13 134.87,-68.13"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
<polygon fill="white" stroke="#666666" points="452.5,-153.5 311.25,-153.5 311.25,-111.75 452.5,-111.75 452.5,-153.5"/>
<text text-anchor="start" x="319.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="319.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
<text text-anchor="middle" x="381.88" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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="M250.74,-80.23C270.5,-88.18 295.03,-98.06 317.45,-107.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="315.93,-110.25 326.51,-110.73 318.54,-103.75 315.93,-110.25"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="409,-93.25 354.75,-93.25 354.75,-74 409,-74 409,-93.25"/>
<text text-anchor="middle" x="381.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node8 -->
<g id="edge7_Node000003_Node000008" class="edge">
<title>Node3&#45;&gt;Node8</title>
<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.36,-71.75C298.1,-74.31 323.02,-77.12 342.93,-79.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="342.48,-82.83 352.81,-80.47 343.26,-75.87 342.48,-82.83"/>
</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/algorithm/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.75,-56.25 348,-56.25 348,-37 415.75,-37 415.75,-56.25"/>
<text text-anchor="middle" x="381.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node9 -->
<g id="edge8_Node000003_Node000009" class="edge">
<title>Node3&#45;&gt;Node9</title>
<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.36,-57.87C295.57,-55.72 317.51,-53.38 336.11,-51.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.43,-54.88 346.01,-50.34 335.69,-47.92 336.43,-54.88"/>
</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/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="423.62,-19.25 340.12,-19.25 340.12,0 423.62,0 423.62,-19.25"/>
<text text-anchor="middle" x="381.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node10 -->
<g id="edge9_Node000003_Node000010" class="edge">
<title>Node3&#45;&gt;Node10</title>
<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M251.28,-48.91C269.38,-41.94 291.25,-33.92 311.25,-27.62 316.98,-25.82 323.02,-24.06 329.04,-22.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="329.6,-25.86 338.35,-19.88 327.78,-19.1 329.6,-25.86"/>
</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/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="562.25,-179.25 503.5,-179.25 503.5,-160 562.25,-160 562.25,-179.25"/>
<text text-anchor="middle" x="532.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M452.58,-149.93C466.12,-153.3 479.88,-156.71 492.05,-159.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="491.15,-163.12 501.7,-162.13 492.84,-156.33 491.15,-163.12"/>
</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/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="577.25,-142.25 488.5,-142.25 488.5,-123 577.25,-123 577.25,-142.25"/>
<text text-anchor="middle" x="532.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</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="M452.58,-132.62C460.72,-132.62 468.94,-132.62 476.84,-132.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="476.64,-136.13 486.64,-132.63 476.64,-129.13 476.64,-136.13"/>
</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/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="573.5,-105.25 492.25,-105.25 492.25,-86 573.5,-86 573.5,-105.25"/>
<text text-anchor="middle" x="532.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge6_Node000004_Node000007" class="edge">
<title>Node4&#45;&gt;Node7</title>
<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M452.58,-115.32C462.06,-112.96 471.64,-110.58 480.71,-108.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="481.55,-111.73 490.41,-105.92 479.86,-104.94 481.55,-111.73"/>
</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="binary__addition_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: 13 KiB

186
d9/d1f/binary__addition_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg Normal file
View File

@@ -0,0 +1,186 @@
<?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 12.1.2 (20240928.0832)
-->
<!-- Title: main Pages: 1 -->
<svg width="585pt" height="187pt"
viewBox="0.00 0.00 585.25 187.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 183.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,-74.25 0,-74.25 0,-55 37,-55 37,-74.25"/>
<text text-anchor="middle" x="18.5" y="-60.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="../../d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="run self test implementation.">
<polygon fill="white" stroke="#666666" points="110.75,-74.25 73,-74.25 73,-55 110.75,-55 110.75,-74.25"/>
<text text-anchor="middle" x="91.88" y="-60.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,-64.62C44.55,-64.62 53.37,-64.62 61.69,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-68.13 71.43,-64.63 61.43,-61.13 61.43,-68.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527" target="_top" xlink:title="Adds two binary strings and returns the result as a binary string.">
<polygon fill="white" stroke="#666666" points="275.25,-79.88 146.75,-79.88 146.75,-49.38 275.25,-49.38 275.25,-79.88"/>
<text text-anchor="start" x="154.75" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="211" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</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="M111.18,-64.62C118.01,-64.62 126.25,-64.62 135.04,-64.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="134.87,-68.13 144.87,-64.63 134.87,-61.13 134.87,-68.13"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
<polygon fill="white" stroke="#666666" points="452.5,-153.5 311.25,-153.5 311.25,-111.75 452.5,-111.75 452.5,-153.5"/>
<text text-anchor="start" x="319.25" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="319.25" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
<text text-anchor="middle" x="381.88" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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="M250.74,-80.23C270.5,-88.18 295.03,-98.06 317.45,-107.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="315.93,-110.25 326.51,-110.73 318.54,-103.75 315.93,-110.25"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/max.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="409,-93.25 354.75,-93.25 354.75,-74 409,-74 409,-93.25"/>
<text text-anchor="middle" x="381.88" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node8 -->
<g id="edge7_Node000003_Node000008" class="edge">
<title>Node3&#45;&gt;Node8</title>
<g id="a_edge7_Node000003_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.36,-71.75C298.1,-74.31 323.02,-77.12 342.93,-79.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="342.48,-82.83 352.81,-80.47 343.26,-75.87 342.48,-82.83"/>
</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/algorithm/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.75,-56.25 348,-56.25 348,-37 415.75,-37 415.75,-56.25"/>
<text text-anchor="middle" x="381.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node9 -->
<g id="edge8_Node000003_Node000009" class="edge">
<title>Node3&#45;&gt;Node9</title>
<g id="a_edge8_Node000003_Node000009"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M275.36,-57.87C295.57,-55.72 317.51,-53.38 336.11,-51.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.43,-54.88 346.01,-50.34 335.69,-47.92 336.43,-54.88"/>
</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/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="423.62,-19.25 340.12,-19.25 340.12,0 423.62,0 423.62,-19.25"/>
<text text-anchor="middle" x="381.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node10 -->
<g id="edge9_Node000003_Node000010" class="edge">
<title>Node3&#45;&gt;Node10</title>
<g id="a_edge9_Node000003_Node000010"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M251.28,-48.91C269.38,-41.94 291.25,-33.92 311.25,-27.62 316.98,-25.82 323.02,-24.06 329.04,-22.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="329.6,-25.86 338.35,-19.88 327.78,-19.1 329.6,-25.86"/>
</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/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="562.25,-179.25 503.5,-179.25 503.5,-160 562.25,-160 562.25,-179.25"/>
<text text-anchor="middle" x="532.88" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M452.58,-149.93C466.12,-153.3 479.88,-156.71 492.05,-159.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="491.15,-163.12 501.7,-162.13 492.84,-156.33 491.15,-163.12"/>
</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/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="577.25,-142.25 488.5,-142.25 488.5,-123 577.25,-123 577.25,-142.25"/>
<text text-anchor="middle" x="532.88" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</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="M452.58,-132.62C460.72,-132.62 468.94,-132.62 476.84,-132.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="476.64,-136.13 486.64,-132.63 476.64,-129.13 476.64,-136.13"/>
</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/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="573.5,-105.25 492.25,-105.25 492.25,-86 573.5,-86 573.5,-105.25"/>
<text text-anchor="middle" x="532.88" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node7 -->
<g id="edge6_Node000004_Node000007" class="edge">
<title>Node4&#45;&gt;Node7</title>
<g id="a_edge6_Node000004_Node000007"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M452.58,-115.32C462.06,-112.96 471.64,-110.58 480.71,-108.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="481.55,-111.73 490.41,-105.92 479.86,-104.94 481.55,-111.73"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 8.9 KiB

22
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html
View File

@@ -5,7 +5,7 @@
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: search/Longest_Increasing_Subsequence_using_binary_search.cpp File Reference</title>
<title>Algorithms_in_C++: search/longest_increasing_subsequence_using_binary_search.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
@@ -78,7 +78,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html','../../'); initResizable(true); });
$(function(){initNavTree('d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
@@ -106,7 +106,7 @@ $(function(){initNavTree('df/d99/_longest___increasing___subsequence__using__bin
<div class="header">
<div class="summary">
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">Longest_Increasing_Subsequence_using_binary_search.cpp File Reference</div></div>
<div class="headertitle"><div class="title">longest_increasing_subsequence_using_binary_search.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
@@ -118,9 +118,9 @@ $(function(){initNavTree('df/d99/_longest___increasing___subsequence__using__bin
<code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;cstdint&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for Longest_Increasing_Subsequence_using_binary_search.cpp:</div>
Include dependency graph for longest_increasing_subsequence_using_binary_search.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d71/_longest___increasing___subsequence__using__binary__search_8cpp__incl.svg" width="435" height="140"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d04/longest__increasing__subsequence__using__binary__search_8cpp__incl.svg" width="435" height="140"><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="func-members" name="func-members"></a>
@@ -208,7 +208,7 @@ template&lt;typename T &gt; </div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg" width="372" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg" width="372" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -234,11 +234,11 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 115</span> <a class="code hl_function" href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a>(); <span class="comment">// run self test implementation</span></div>
<div class="line"><span class="lineno"> 116</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 117</span>}</div>
<div class="ttc" id="a_longest___increasing___subsequence__using__binary__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test cases for Longest Increasing Subsequence function.</div><div class="ttdef"><b>Definition</b> Longest_Increasing_Subsequence_using_binary_search.cpp:85</div></div>
<div class="ttc" id="alongest__increasing__subsequence__using__binary__search_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">Test cases for Longest Increasing Subsequence function.</div><div class="ttdef"><b>Definition</b> longest_increasing_subsequence_using_binary_search.cpp:85</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="567" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="567" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -292,12 +292,12 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 106</span> </div>
<div class="line"><span class="lineno"> 107</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"> 108</span>}</div>
<div class="ttc" id="a_longest___increasing___subsequence__using__binary__search_8cpp_html_a313539d9a97fc6e121ce496873ba892e"><div class="ttname"><a href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a></div><div class="ttdeci">std::uint32_t longest_increasing_subsequence_using_binary_search(std::vector&lt; T &gt; &amp;nums)</div><div class="ttdoc">for std::uint32_t</div><div class="ttdef"><b>Definition</b> Longest_Increasing_Subsequence_using_binary_search.cpp:65</div></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__increasing__subsequence__using__binary__search_8cpp_html_a313539d9a97fc6e121ce496873ba892e"><div class="ttname"><a href="#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search</a></div><div class="ttdeci">std::uint32_t longest_increasing_subsequence_using_binary_search(std::vector&lt; T &gt; &amp;nums)</div><div class="ttdoc">for std::uint32_t</div><div class="ttdef"><b>Definition</b> longest_increasing_subsequence_using_binary_search.cpp:65</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="470" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="470" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -307,7 +307,7 @@ Here is the call graph for this function:</div>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html">Longest_Increasing_Subsequence_using_binary_search.cpp</a></li>
<li class="navelem"><a class="el" href="../../dir_19b2bf9199a15c634a08b1ede1dd896a.html">search</a></li><li class="navelem"><a class="el" href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html">longest_increasing_subsequence_using_binary_search.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>

6
d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.js Normal file
View File

@@ -0,0 +1,6 @@
var longest__increasing__subsequence__using__binary__search_8cpp =
[
[ "longest_increasing_subsequence_using_binary_search", "d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e", null ],
[ "main", "d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "tests", "d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
];

0
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.map → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.map
View File

0
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.md5 → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.md5
View File

0
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph.svg
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.4 KiB

After

Width:  |  Height:  |  Size: 4.4 KiB

0
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph_org.svg → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a313539d9a97fc6e121ce496873ba892e_cgraph_org.svg
View File

Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.6 KiB

After

Width:  |  Height:  |  Size: 3.6 KiB

2
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map
View File

@@ -1,6 +1,6 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="Test cases for Longest Increasing Subsequence function." alt="" coords="5,55,56,80"/>
<area shape="rect" id="Node000002" href="$df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" title="for std::uint32_t" alt="" coords="104,40,289,95"/>
<area shape="rect" id="Node000002" href="$d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" title="for std::uint32_t" alt="" coords="104,40,289,95"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="56,65,88,65,88,70,56,70"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="337,5,464,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="289,42,329,33,330,38,290,48"/>

1
d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
e8baaeea10ef15115946c4a0db45636a

2
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg
View File

@@ -31,7 +31,7 @@
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
<g id="a_Node000002"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
<polygon fill="white" stroke="#666666" points="212.75,-67.5 73.75,-67.5 73.75,-25.75 212.75,-25.75 212.75,-67.5"/>
<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.2 KiB

After

Width:  |  Height:  |  Size: 5.2 KiB

2
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg
View File

@@ -20,7 +20,7 @@
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
<g id="a_Node000002"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
<polygon fill="white" stroke="#666666" points="212.75,-67.5 73.75,-67.5 73.75,-25.75 212.75,-25.75 212.75,-67.5"/>
<text text-anchor="start" x="81.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
<text text-anchor="start" x="81.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.5 KiB

After

Width:  |  Height:  |  Size: 4.5 KiB

4
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map
View File

@@ -1,8 +1,8 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="Main function to run tests." alt="" coords="5,55,55,80"/>
<area shape="rect" id="Node000002" href="$df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Test cases for Longest Increasing Subsequence function." alt="" coords="103,55,153,80"/>
<area shape="rect" id="Node000002" href="$d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="Test cases for Longest Increasing Subsequence function." alt="" coords="103,55,153,80"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,65,88,65,88,70,55,70"/>
<area shape="rect" id="Node000003" href="$df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" title="for std::uint32_t" alt="" coords="201,40,386,95"/>
<area shape="rect" id="Node000003" href="$d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" title="for std::uint32_t" alt="" coords="201,40,386,95"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="154,65,185,65,185,70,154,70"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/empty.html#" title=" " alt="" coords="434,5,562,31"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="386,42,426,33,428,38,388,48"/>

1
d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
94853bf41b0075f98002cffdeb057c5e

4
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg
View File

@@ -31,7 +31,7 @@
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test cases for Longest Increasing Subsequence function.">
<g id="a_Node000002"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test cases for Longest Increasing Subsequence function.">
<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
@@ -49,7 +49,7 @@
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
<g id="a_Node000003"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
<polygon fill="white" stroke="#666666" points="285.75,-67.5 146.75,-67.5 146.75,-25.75 285.75,-25.75 285.75,-67.5"/>
<text text-anchor="start" x="154.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
<text text-anchor="start" x="154.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.1 KiB

After

Width:  |  Height:  |  Size: 6.1 KiB

4
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg → d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg
View File

@@ -20,7 +20,7 @@
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test cases for Longest Increasing Subsequence function.">
<g id="a_Node000002"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="Test cases for Longest Increasing Subsequence function.">
<polygon fill="white" stroke="#666666" points="110.75,-56.25 73,-56.25 73,-37 110.75,-37 110.75,-56.25"/>
<text text-anchor="middle" x="91.88" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
@@ -38,7 +38,7 @@
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
<g id="a_Node000003"><a xlink:href="../../d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e" target="_top" xlink:title="for std::uint32_t">
<polygon fill="white" stroke="#666666" points="285.75,-67.5 146.75,-67.5 146.75,-25.75 285.75,-25.75 285.75,-67.5"/>
<text text-anchor="start" x="154.75" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">longest_increasing</text>
<text text-anchor="start" x="154.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">_subsequence_using_binary</text>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 5.4 KiB

After

Width:  |  Height:  |  Size: 5.4 KiB

2
db/d80/gale__shapley_8cpp.html
View File

@@ -126,7 +126,7 @@ Include dependency graph for gale_shapley.cpp:</div>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><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="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d9a/namespacegreedy__algorithms_1_1stable__matching.html">greedy_algorithms::stable_matching</a></td></tr>
<tr class="memdesc:dd/d9a/namespacegreedy__algorithms_1_1stable__matching"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the Gale-Shapley Algorithm. <br /></td></tr>

271
de/df6/classgreedy__algorithms_1_1_binary_addition.html Normal file
View File

@@ -0,0 +1,271 @@
<!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.12.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: greedy_algorithms::BinaryAddition Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/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.12.0 -->
<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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @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',true);
$(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 */
$(function(){initNavTree('de/df6/classgreedy__algorithms_1_1_binary_addition.html','../../'); initResizable(true); });
/* @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="#pri-methods">Private Member Functions</a> &#124;
<a href="../../d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">greedy_algorithms::BinaryAddition Class Reference</div></div>
</div><!--header-->
<div class="contents">
<p>A class to perform binary addition of two binary strings.
<a href="#details">More...</a></p>
<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:a801fd1ec5cda76b0bb82cbf23ed4d527" id="r_a801fd1ec5cda76b0bb82cbf23ed4d527"><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="#a801fd1ec5cda76b0bb82cbf23ed4d527">addBinary</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;a, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;b)</td></tr>
<tr class="memdesc:a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds two binary strings and returns the result as a binary string. <br /></td></tr>
<tr class="separator:a801fd1ec5cda76b0bb82cbf23ed4d527"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a4cfb595ba80795a9efae0e3f6f5c34d2" id="r_a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &amp;str) const</td></tr>
<tr class="memdesc:a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Validates whether a string contains only binary characters (0 or 1). <br /></td></tr>
<tr class="separator:a4cfb595ba80795a9efae0e3f6f5c34d2"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A class to perform binary addition of two binary strings. </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a id="a801fd1ec5cda76b0bb82cbf23ed4d527" name="a801fd1ec5cda76b0bb82cbf23ed4d527"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a801fd1ec5cda76b0bb82cbf23ed4d527">&#9670;&#160;</a></span>addBinary()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> greedy_algorithms::BinaryAddition::addBinary </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;</td> <td class="paramname"><span class="paramname"><em>a</em></span>, </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;</td> <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Adds two binary strings and returns the result as a binary string. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>The first binary string. </td></tr>
<tr><td class="paramname">b</td><td>The second binary string. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The sum of the two binary strings as a binary string, or an empty string if either input string contains non-binary characters. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 40</span> {</div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">if</span> (!<a class="code hl_function" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(a) || !<a class="code hl_function" href="#a4cfb595ba80795a9efae0e3f6f5c34d2">isValidBinaryString</a>(b)) {</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span> <span class="stringliteral">&quot;&quot;</span>; <span class="comment">// Return empty string if input contains non-binary</span></div>
<div class="line"><span class="lineno"> 43</span> <span class="comment">// characters</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> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 47</span> <span class="keywordtype">int</span> carry = 0;</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordtype">int</span> maxLength = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(a.size(), 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"> 49</span> </div>
<div class="line"><span class="lineno"> 50</span> <span class="comment">// Traverse both strings from the end to the beginning</span></div>
<div class="line"><span class="lineno"> 51</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; maxLength; ++i) {</div>
<div class="line"><span class="lineno"> 52</span> <span class="comment">// Get the current bits from both strings, if available</span></div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordtype">int</span> bitA = (i &lt; a.size()) ? (a[a.size() - 1 - i] - <span class="charliteral">&#39;0&#39;</span>) : 0;</div>
<div class="line"><span class="lineno"> 54</span> <span class="keywordtype">int</span> bitB = (i &lt; b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>()) ? (b[b.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/size.html">size</a>() - 1 - i] - <span class="charliteral">&#39;0&#39;</span>) : 0;</div>
<div class="line"><span class="lineno"> 55</span> </div>
<div class="line"><span class="lineno"> 56</span> <span class="comment">// Calculate the sum of bits and carry</span></div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordtype">int</span> <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> = bitA + bitB + carry;</div>
<div class="line"><span class="lineno"> 58</span> carry = <a class="code hl_function" href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">sum</a> / 2; <span class="comment">// Determine the carry for the next bit</span></div>
<div class="line"><span class="lineno"> 59</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back((sum % 2) +</div>
<div class="line"><span class="lineno"> 60</span> <span class="charliteral">&#39;0&#39;</span>); <span class="comment">// Append the sum&#39;s current bit to result</span></div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span> (carry) {</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(<span class="charliteral">&#39;1&#39;</span>);</div>
<div class="line"><span class="lineno"> 64</span> }</div>
<div class="line"><span class="lineno"> 65</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a>(<a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.begin(), <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.end());</div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 67</span> }</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="aclassgreedy__algorithms_1_1_binary_addition_html_a4cfb595ba80795a9efae0e3f6f5c34d2"><div class="ttname"><a href="#a4cfb595ba80795a9efae0e3f6f5c34d2">greedy_algorithms::BinaryAddition::isValidBinaryString</a></div><div class="ttdeci">bool isValidBinaryString(const std::string &amp;str) const</div><div class="ttdoc">Validates whether a string contains only binary characters (0 or 1).</div><div class="ttdef"><b>Definition</b> binary_addition.cpp:75</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:76</div></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="anamespacemachine__learning_html_a6f1c98c016ad34ff3d9f39372161bd35"><div class="ttname"><a href="../../d8/d77/namespacemachine__learning.html#a6f1c98c016ad34ff3d9f39372161bd35">machine_learning::sum</a></div><div class="ttdeci">T sum(const std::vector&lt; std::valarray&lt; T &gt; &gt; &amp;A)</div><div class="ttdef"><b>Definition</b> vector_ops.hpp:232</div></div>
<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(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><!-- 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="../../de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg" width="586" height="250"><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="a4cfb595ba80795a9efae0e3f6f5c34d2" name="a4cfb595ba80795a9efae0e3f6f5c34d2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4cfb595ba80795a9efae0e3f6f5c34d2">&#9670;&#160;</a></span>isValidBinaryString()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool greedy_algorithms::BinaryAddition::isValidBinaryString </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;</td> <td class="paramname"><span class="paramname"><em>str</em></span></td><td>)</td>
<td> const</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Validates whether a string contains only binary characters (0 or 1). </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">str</td><td>The string to validate. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true if the string is binary, false otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 75</span> {</div>
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">return</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a>(str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">begin</a>(), str.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">end</a>(),</div>
<div class="line"><span class="lineno"> 77</span> [](<span class="keywordtype">char</span> c) { return c == <span class="stringliteral">&#39;0&#39;</span> || c == <span class="stringliteral">&#39;1&#39;</span>; });</div>
<div class="line"><span class="lineno"> 78</span> }</div>
<div class="ttc" id="aall_any_none_of_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/all_any_none_of.html">std::all_of</a></div><div class="ttdeci">T all_of(T... args)</div></div>
<div class="ttc" id="abegin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/begin.html">std::string::begin</a></div><div class="ttdeci">T begin(T... args)</div></div>
<div class="ttc" id="aend_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/end.html">std::string::end</a></div><div class="ttdeci">T end(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="../../de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg" width="366" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>greedy_algorithms/<a class="el" href="../../d9/d1f/binary__addition_8cpp.html">binary_addition.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="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html">BinaryAddition</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.12.0 </li>
</ul>
</div>
</body>
</html>

5
de/df6/classgreedy__algorithms_1_1_binary_addition.js Normal file
View File

@@ -0,0 +1,5 @@
var classgreedy__algorithms_1_1_binary_addition =
[
[ "addBinary", "de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527", null ],
[ "isValidBinaryString", "de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2", null ]
];

9
de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="greedy_algorithms::BinaryAddition::isValidBinaryString" name="greedy_algorithms::BinaryAddition::isValidBinaryString">
<area shape="rect" id="Node000001" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="5,40,194,95"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="262,5,340,31"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="193,42,246,29,247,34,194,47"/>
<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/begin.html#" title=" " alt="" coords="242,55,360,80"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="194,65,226,65,226,70,194,70"/>
<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/end.html#" title=" " alt="" coords="247,104,355,130"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="194,88,232,97,231,102,193,93"/>
</map>

1
de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
b34b8fba06083b003abe8695e93bcb7a

103
de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_cgraph.svg Normal file
View File

@@ -0,0 +1,103 @@
<?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 12.1.2 (20240928.0832)
-->
<!-- Title: greedy_algorithms::BinaryAddition::isValidBinaryString Pages: 1 -->
<svg width="274pt" height="101pt"
viewBox="0.00 0.00 274.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
<title>greedy_algorithms::BinaryAddition::isValidBinaryString</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Validates whether a string contains only binary characters (0 or 1).">
<polygon fill="#999999" stroke="#666666" points="141.25,-67.5 0,-67.5 0,-25.75 141.25,-25.75 141.25,-67.5"/>
<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
<text text-anchor="middle" x="70.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="251,-93.25 192.25,-93.25 192.25,-74 251,-74 251,-93.25"/>
<text text-anchor="middle" x="221.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M141.33,-63.93C154.87,-67.3 168.63,-70.71 180.8,-73.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="179.9,-77.12 190.45,-76.13 181.59,-70.33 179.9,-77.12"/>
</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/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="266,-56.25 177.25,-56.25 177.25,-37 266,-37 266,-56.25"/>
<text text-anchor="middle" x="221.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</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="M141.33,-46.62C149.47,-46.62 157.69,-46.62 165.59,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="165.39,-50.13 175.39,-46.63 165.39,-43.13 165.39,-50.13"/>
</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/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="262.25,-19.25 181,-19.25 181,0 262.25,0 262.25,-19.25"/>
<text text-anchor="middle" x="221.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</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="M141.33,-29.32C150.81,-26.96 160.39,-24.58 169.46,-22.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.3,-25.73 179.16,-19.92 168.61,-18.94 170.3,-25.73"/>
</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
de/df6/classgreedy__algorithms_1_1_binary_addition_a4cfb595ba80795a9efae0e3f6f5c34d2_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 12.1.2 (20240928.0832)
-->
<!-- Title: greedy_algorithms::BinaryAddition::isValidBinaryString Pages: 1 -->
<svg width="274pt" height="101pt"
viewBox="0.00 0.00 274.00 101.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 97.25)">
<title>greedy_algorithms::BinaryAddition::isValidBinaryString</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Validates whether a string contains only binary characters (0 or 1).">
<polygon fill="#999999" stroke="#666666" points="141.25,-67.5 0,-67.5 0,-25.75 141.25,-25.75 141.25,-67.5"/>
<text text-anchor="start" x="8" y="-54" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="8" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
<text text-anchor="middle" x="70.62" y="-31.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="251,-93.25 192.25,-93.25 192.25,-74 251,-74 251,-93.25"/>
<text text-anchor="middle" x="221.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M141.33,-63.93C154.87,-67.3 168.63,-70.71 180.8,-73.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="179.9,-77.12 190.45,-76.13 181.59,-70.33 179.9,-77.12"/>
</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/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="266,-56.25 177.25,-56.25 177.25,-37 266,-37 266,-56.25"/>
<text text-anchor="middle" x="221.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</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="M141.33,-46.62C149.47,-46.62 157.69,-46.62 165.59,-46.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="165.39,-50.13 175.39,-46.63 165.39,-43.13 165.39,-50.13"/>
</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/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="262.25,-19.25 181,-19.25 181,0 262.25,0 262.25,-19.25"/>
<text text-anchor="middle" x="221.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</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="M141.33,-29.32C150.81,-26.96 160.39,-24.58 169.46,-22.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="170.3,-25.73 179.16,-19.92 168.61,-18.94 170.3,-25.73"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.7 KiB

17
de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.map Normal file
View File

@@ -0,0 +1,17 @@
<map id="greedy_algorithms::BinaryAddition::addBinary" name="greedy_algorithms::BinaryAddition::addBinary">
<area shape="rect" id="Node000001" title="Adds two binary strings and returns the result as a binary string." alt="" coords="5,138,177,178"/>
<area shape="rect" id="Node000002" href="$de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" title="Validates whether a string contains only binary characters (0 or 1)." alt="" coords="225,40,413,95"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="143,135,232,99,234,104,145,140"/>
<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="283,120,355,146"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="177,146,267,136,267,141,177,151"/>
<area shape="rect" id="Node000007" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="274,169,364,195"/>
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="177,165,258,173,258,178,177,170"/>
<area shape="rect" id="Node000008" 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="263,219,374,244"/>
<area shape="poly" id="edge7_Node000001_Node000008" title=" " alt="" coords="146,177,225,205,249,212,248,217,224,210,144,182"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/all_any_none_of.html#" title=" " alt="" coords="481,5,559,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="412,42,465,29,466,34,414,47"/>
<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/begin.html#" title=" " alt="" coords="461,55,579,80"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="413,65,445,65,445,70,413,70"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/string/basic_string/end.html#" title=" " alt="" coords="466,104,574,130"/>
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="414,88,451,97,450,102,412,93"/>
</map>

1
de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
eb89941a3eefeca41e9f80419516c8b8

176
de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph.svg Normal file
View File

@@ -0,0 +1,176 @@
<?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 12.1.2 (20240928.0832)
-->
<!-- Title: greedy_algorithms::BinaryAddition::addBinary Pages: 1 -->
<svg width="439pt" height="187pt"
viewBox="0.00 0.00 438.50 187.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">
<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 183.25)">
<title>greedy_algorithms::BinaryAddition::addBinary</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Adds two binary strings and returns the result as a binary string.">
<polygon fill="#999999" stroke="#666666" points="128.5,-79.88 0,-79.88 0,-49.38 128.5,-49.38 128.5,-79.88"/>
<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="64.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
<polygon fill="white" stroke="#666666" points="305.75,-153.5 164.5,-153.5 164.5,-111.75 305.75,-111.75 305.75,-153.5"/>
<text text-anchor="start" x="172.5" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="172.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
<text text-anchor="middle" x="235.12" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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="M103.99,-80.23C123.75,-88.18 148.28,-98.06 170.7,-107.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.18,-110.25 179.76,-110.73 171.79,-103.75 169.18,-110.25"/>
</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="262.25,-93.25 208,-93.25 208,-74 262.25,-74 262.25,-93.25"/>
<text text-anchor="middle" x="235.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</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="M128.61,-71.75C151.35,-74.31 176.27,-77.12 196.18,-79.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.73,-82.83 206.06,-80.47 196.51,-75.87 195.73,-82.83"/>
</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/algorithm/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="269,-56.25 201.25,-56.25 201.25,-37 269,-37 269,-56.25"/>
<text text-anchor="middle" x="235.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M128.61,-57.87C148.82,-55.72 170.76,-53.38 189.36,-51.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="189.68,-54.88 199.26,-50.34 188.94,-47.92 189.68,-54.88"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="276.88,-19.25 193.38,-19.25 193.38,0 276.88,0 276.88,-19.25"/>
<text text-anchor="middle" x="235.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge7_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M104.53,-48.91C122.63,-41.94 144.5,-33.92 164.5,-27.62 170.23,-25.82 176.27,-24.06 182.29,-22.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.85,-25.86 191.6,-19.88 181.03,-19.1 182.85,-25.86"/>
</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/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.5,-179.25 356.75,-179.25 356.75,-160 415.5,-160 415.5,-179.25"/>
<text text-anchor="middle" x="386.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M305.83,-149.93C319.37,-153.3 333.13,-156.71 345.3,-159.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.4,-163.12 354.95,-162.13 346.09,-156.33 344.4,-163.12"/>
</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/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="430.5,-142.25 341.75,-142.25 341.75,-123 430.5,-123 430.5,-142.25"/>
<text text-anchor="middle" x="386.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</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="M305.83,-132.62C313.97,-132.62 322.19,-132.62 330.09,-132.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="329.89,-136.13 339.89,-132.63 329.89,-129.13 329.89,-136.13"/>
</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/string/basic_string/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="426.75,-105.25 345.5,-105.25 345.5,-86 426.75,-86 426.75,-105.25"/>
<text text-anchor="middle" x="386.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M305.83,-115.32C315.31,-112.96 324.89,-110.58 333.96,-108.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.8,-111.73 343.66,-105.92 333.11,-104.94 334.8,-111.73"/>
</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: 8.1 KiB

150
de/df6/classgreedy__algorithms_1_1_binary_addition_a801fd1ec5cda76b0bb82cbf23ed4d527_cgraph_org.svg Normal file
View File

@@ -0,0 +1,150 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: greedy_algorithms::BinaryAddition::addBinary Pages: 1 -->
<svg width="439pt" height="187pt"
viewBox="0.00 0.00 438.50 187.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 183.25)">
<title>greedy_algorithms::BinaryAddition::addBinary</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Adds two binary strings and returns the result as a binary string.">
<polygon fill="#999999" stroke="#666666" points="128.5,-79.88 0,-79.88 0,-49.38 128.5,-49.38 128.5,-79.88"/>
<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="64.25" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::addBinary</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2" target="_top" xlink:title="Validates whether a string contains only binary characters (0 or 1).">
<polygon fill="white" stroke="#666666" points="305.75,-153.5 164.5,-153.5 164.5,-111.75 305.75,-111.75 305.75,-153.5"/>
<text text-anchor="start" x="172.5" y="-140" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="172.5" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">BinaryAddition::isValidBinary</text>
<text text-anchor="middle" x="235.12" y="-117.5" font-family="Helvetica,sans-Serif" font-size="10.00">String</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="M103.99,-80.23C123.75,-88.18 148.28,-98.06 170.7,-107.09"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="169.18,-110.25 179.76,-110.73 171.79,-103.75 169.18,-110.25"/>
</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="262.25,-93.25 208,-93.25 208,-74 262.25,-74 262.25,-93.25"/>
<text text-anchor="middle" x="235.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::max</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="M128.61,-71.75C151.35,-74.31 176.27,-77.12 196.18,-79.36"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="195.73,-82.83 206.06,-80.47 196.51,-75.87 195.73,-82.83"/>
</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/algorithm/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="269,-56.25 201.25,-56.25 201.25,-37 269,-37 269,-56.25"/>
<text text-anchor="middle" x="235.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M128.61,-57.87C148.82,-55.72 170.76,-53.38 189.36,-51.4"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="189.68,-54.88 199.26,-50.34 188.94,-47.92 189.68,-54.88"/>
</a>
</g>
</g>
<!-- Node8 -->
<g id="Node000008" class="node">
<title>Node8</title>
<g id="a_Node000008"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/string/basic_string/size.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="276.88,-19.25 193.38,-19.25 193.38,0 276.88,0 276.88,-19.25"/>
<text text-anchor="middle" x="235.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node8 -->
<g id="edge7_Node000001_Node000008" class="edge">
<title>Node1&#45;&gt;Node8</title>
<g id="a_edge7_Node000001_Node000008"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M104.53,-48.91C122.63,-41.94 144.5,-33.92 164.5,-27.62 170.23,-25.82 176.27,-24.06 182.29,-22.39"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="182.85,-25.86 191.6,-19.88 181.03,-19.1 182.85,-25.86"/>
</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/all_any_none_of.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="415.5,-179.25 356.75,-179.25 356.75,-160 415.5,-160 415.5,-179.25"/>
<text text-anchor="middle" x="386.12" y="-165.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::all_of</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="M305.83,-149.93C319.37,-153.3 333.13,-156.71 345.3,-159.74"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.4,-163.12 354.95,-162.13 346.09,-156.33 344.4,-163.12"/>
</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/begin.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="430.5,-142.25 341.75,-142.25 341.75,-123 430.5,-123 430.5,-142.25"/>
<text text-anchor="middle" x="386.12" y="-128.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::begin</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="M305.83,-132.62C313.97,-132.62 322.19,-132.62 330.09,-132.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="329.89,-136.13 339.89,-132.63 329.89,-129.13 329.89,-136.13"/>
</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/string/basic_string/end.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="426.75,-105.25 345.5,-105.25 345.5,-86 426.75,-86 426.75,-105.25"/>
<text text-anchor="middle" x="386.12" y="-91.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::string::end</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge4_Node000002_Node000005" class="edge">
<title>Node2&#45;&gt;Node5</title>
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M305.83,-115.32C315.31,-112.96 324.89,-110.58 333.96,-108.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="334.8,-111.73 343.66,-105.92 333.11,-104.94 334.8,-111.73"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 7.3 KiB

6
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.js
View File

@@ -1,6 +0,0 @@
var _longest___increasing___subsequence__using__binary__search_8cpp =
[
[ "longest_increasing_subsequence_using_binary_search", "df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e", null ],
[ "main", "df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "tests", "df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
];

1
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5
View File

@@ -1 +0,0 @@
3bcdedeb948fc12380fc356a42ba485c

1
df/d99/_longest___increasing___subsequence__using__binary__search_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5
View File

@@ -1 +0,0 @@
6d5d347d0d16bcda801ff0265c0769a7

2
df/dcb/greedy__algorithms_2dijkstra_8cpp.html
View File

@@ -133,7 +133,7 @@ Classes</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a></td></tr>
<tr class="memdesc:d2/d90/namespacegreedy__algorithms"><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="memdesc:d2/d90/namespacegreedy__algorithms"><td class="mdescLeft">&#160;</td><td class="mdescRight">for string class <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html">greedy_algorithms::dijkstra</a></td></tr>
<tr class="memdesc:d2/d2f/namespacegreedy__algorithms_1_1dijkstra"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation. <br /></td></tr>

3
dir_0eaa691bd54ab0922ca7f50599de6d22.html
View File

@@ -110,6 +110,9 @@ $(function(){initNavTree('dir_0eaa691bd54ab0922ca7f50599de6d22.html',''); initRe
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="files" name="files"></a>
Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d9/d1f/binary__addition_8cpp.html">binary_addition.cpp</a></td></tr>
<tr class="memdesc:d9/d1f/binary__addition_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Adds two binary numbers and outputs resulting string. <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="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html">boruvkas_minimum_spanning_tree.cpp</a></td></tr>
<tr class="memdesc:d4/d6c/boruvkas__minimum__spanning__tree_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">[Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) to find the <a class="el" href="d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning Tree <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_0eaa691bd54ab0922ca7f50599de6d22.js
View File

@@ -1,5 +1,6 @@
var dir_0eaa691bd54ab0922ca7f50599de6d22 =
[
[ "binary_addition.cpp", "d9/d1f/binary__addition_8cpp.html", "d9/d1f/binary__addition_8cpp" ],
[ "boruvkas_minimum_spanning_tree.cpp", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html", "d4/d6c/boruvkas__minimum__spanning__tree_8cpp" ],
[ "digit_separation.cpp", "d3/d36/digit__separation_8cpp.html", "d3/d36/digit__separation_8cpp" ],
[ "dijkstra.cpp", "df/dcb/greedy__algorithms_2dijkstra_8cpp.html", "df/dcb/greedy__algorithms_2dijkstra_8cpp" ],

4
dir_19b2bf9199a15c634a08b1ede1dd896a.html
View File

@@ -131,8 +131,8 @@ 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="d9/d02/linear__search_8cpp.html">linear_search.cpp</a></td></tr>
<tr class="memdesc:d9/d02/linear__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Linear_search" target="_blank">Linear search 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="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html">Longest_Increasing_Subsequence_using_binary_search.cpp</a></td></tr>
<tr class="memdesc:df/d99/_longest___increasing___subsequence__using__binary__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">find the length of the Longest Increasing Subsequence (LIS) using <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">Binary Search</a> <br /></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="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html">longest_increasing_subsequence_using_binary_search.cpp</a></td></tr>
<tr class="memdesc:d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">find the length of the Longest Increasing Subsequence (LIS) using <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">Binary Search</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="d9/d69/median__search_8cpp.html">median_search.cpp</a></td></tr>
<tr class="memdesc:d9/d69/median__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians" target="_blank">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/" target="_blank">here</a> <br /></td></tr>

2
dir_19b2bf9199a15c634a08b1ede1dd896a.js
View File

@@ -7,7 +7,7 @@ var dir_19b2bf9199a15c634a08b1ede1dd896a =
[ "interpolation_search2.cpp", "df/d39/interpolation__search2_8cpp.html", "df/d39/interpolation__search2_8cpp" ],
[ "jump_search.cpp", "d2/d22/jump__search_8cpp.html", "d2/d22/jump__search_8cpp" ],
[ "linear_search.cpp", "d9/d02/linear__search_8cpp.html", "d9/d02/linear__search_8cpp" ],
[ "Longest_Increasing_Subsequence_using_binary_search.cpp", "df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html", "df/d99/_longest___increasing___subsequence__using__binary__search_8cpp" ],
[ "longest_increasing_subsequence_using_binary_search.cpp", "d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html", "d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp" ],
[ "median_search.cpp", "d9/d69/median__search_8cpp.html", "d9/d69/median__search_8cpp" ],
[ "median_search2.cpp", "d8/dfa/median__search2_8cpp.html", "d8/dfa/median__search2_8cpp" ],
[ "saddleback_search.cpp", "d3/d22/saddleback__search_8cpp.html", "d3/d22/saddleback__search_8cpp" ],

19
doxygen_crawl.html
View File

@@ -115,6 +115,7 @@
<a href="de/dde/lowest__common__ancestor_8cpp.html"/>
<a href="de/d88/travelling__salesman__problem_8cpp.html"/>
<a href="da/d77/spirograph_8cpp.html"/>
<a href="d9/d1f/binary__addition_8cpp.html"/>
<a href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html"/>
<a href="d3/d36/digit__separation_8cpp.html"/>
<a href="d7/d1e/graph_2dijkstra_8cpp.html"/>
@@ -271,7 +272,7 @@
<a href="df/d39/interpolation__search2_8cpp.html"/>
<a href="d2/d22/jump__search_8cpp.html"/>
<a href="d9/d02/linear__search_8cpp.html"/>
<a href="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html"/>
<a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html"/>
<a href="d9/d69/median__search_8cpp.html"/>
<a href="d8/dfa/median__search2_8cpp.html"/>
<a href="d3/d22/saddleback__search_8cpp.html"/>
@@ -521,6 +522,8 @@
<a href="d7/d08/namespacegraph__coloring.html"/>
<a href="de/d9b/namespacegray__code.html"/>
<a href="d2/d90/namespacegreedy__algorithms.html"/>
<a href="de/df6/classgreedy__algorithms_1_1_binary_addition.html"/>
<a href="d5/de6/classgreedy__algorithms_1_1_binary_addition-members.html"/>
<a href="da/d49/classgreedy__algorithms_1_1_digit_separation.html"/>
<a href="de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html"/>
<a href="d2/d2f/namespacegreedy__algorithms_1_1dijkstra.html"/>
@@ -2731,6 +2734,9 @@
<a href="d9/d14/array__left__rotation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d9/d14/array__left__rotation_8cpp.html#af7b81d7a1534216af6a36a80135beb86"/>
<a href="d9/d14/array__left__rotation_8cpp.html#afce39cf843989a39811a49ebe29dd6d8"/>
<a href="d9/d1f/binary__addition_8cpp.html"/>
<a href="d9/d1f/binary__addition_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
<a href="d9/d1f/binary__addition_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d9/d21/namespacewave__sort.html"/>
<a href="d9/d23/classgraph_1_1_lowest_common_ancestor.html"/>
<a href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356"/>
@@ -2799,6 +2805,10 @@
<a href="d9/d5d/extended__euclid__algorithm_8cpp.html#abe92d63a0ff9bda7e304df510d5dd217"/>
<a href="d9/d5d/extended__euclid__algorithm_8cpp.html#acba15ca55b3e7dcb91f3c65d72ba052d"/>
<a href="d9/d5d/extended__euclid__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html"/>
<a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e"/>
<a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
<a href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d9/d60/namespacerat__maze.html"/>
<a href="d9/d65/lfu__cache_8cpp.html"/>
<a href="d9/d65/lfu__cache_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
@@ -3924,6 +3934,9 @@
<a href="de/de4/fibonacci__large_8cpp.html#adf3e906875ab257f7fab3bc1370aa2db"/>
<a href="de/de4/namespacegraph_1_1depth__first__search.html#a5738da9f508f6a9e87f123c9fb6f2ea9"/>
<a href="de/de4/namespacegraph_1_1depth__first__search.html#aadebe9c855821d6515ca5b171222ef7b"/>
<a href="de/df6/classgreedy__algorithms_1_1_binary_addition.html"/>
<a href="de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2"/>
<a href="de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527"/>
<a href="df/d06/decimal__to__binary_8cpp.html"/>
<a href="df/d06/decimal__to__binary_8cpp.html#a10df57491019f0ac39b492740fb388f7"/>
<a href="df/d06/decimal__to__binary_8cpp.html#a9240f2e79074a2a248395258aebbfa11"/>
@@ -4030,10 +4043,6 @@
<a href="df/d94/subarray__sum_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
<a href="df/d94/subarray__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="df/d94/subarray__sum_8cpp.html#af5687bbd9faf927fbd363c71e0baba5e"/>
<a href="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html"/>
<a href="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e"/>
<a href="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
<a href="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html"/>
<a href="df/d9f/namespacemath_1_1n__bonacci.html#a6849b68f760be628d5975ab3eddec63d"/>
<a href="df/da2/namespacenumerical__methods_1_1midpoint__rule.html#a7072493d1f0f8a91b2a71d4cc456c09c"/>

15
files.html
View File

@@ -217,12 +217,13 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="dynsection.toggleFolder('10_')">&#9658;</span><span id="img_10_" class="iconfclosed" onclick="dynsection.toggleFolder('10_')">&#160;</span><a class="el" href="dir_e79632891301b850df87e9c0030293fa.html" target="_self">graphics</a></td><td class="desc"></td></tr>
<tr id="row_10_0_" 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/d77/spirograph_8cpp.html" target="_self">spirograph.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Spirograph" target="_blank">Spirograph</a> </td></tr>
<tr id="row_11_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="dynsection.toggleFolder('11_')">&#9658;</span><span id="img_11_" class="iconfclosed" onclick="dynsection.toggleFolder('11_')">&#160;</span><a class="el" href="dir_0eaa691bd54ab0922ca7f50599de6d22.html" target="_self">greedy_algorithms</a></td><td class="desc"></td></tr>
<tr id="row_11_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="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html" target="_self">boruvkas_minimum_spanning_tree.cpp</a></td><td class="desc">[Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) to find the <a class="el" href="d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning Tree </td></tr>
<tr id="row_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d36/digit__separation_8cpp.html" target="_self">digit_separation.cpp</a></td><td class="desc">Separates digits from numbers in forward and reverse order </td></tr>
<tr id="row_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html" target="_self">dijkstra.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
<tr id="row_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d80/gale__shapley_8cpp.html" target="_self">gale_shapley.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> </td></tr>
<tr id="row_11_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/dba/jump__game_8cpp.html" target="_self">jump_game.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation </td></tr>
<tr id="row_11_5_" 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="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html" target="_self">kruskals_minimum_spanning_tree.cpp</a></td><td class="desc"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation </td></tr>
<tr id="row_11_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="d9/d1f/binary__addition_8cpp.html" target="_self">binary_addition.cpp</a></td><td class="desc">Adds two binary numbers and outputs resulting string </td></tr>
<tr id="row_11_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html" target="_self">boruvkas_minimum_spanning_tree.cpp</a></td><td class="desc">[Borůvkas Algorithm](<a href="https://en.wikipedia.org/wiki/Borůvka's_algorithm">https://en.wikipedia.org/wiki/Borůvka's_algorithm</a>) to find the <a class="el" href="d4/d12/namespace_minimum.html" title="Implementation of Minimum Edit Distance algorithm.">Minimum</a> Spanning Tree </td></tr>
<tr id="row_11_2_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/d36/digit__separation_8cpp.html" target="_self">digit_separation.cpp</a></td><td class="desc">Separates digits from numbers in forward and reverse order </td></tr>
<tr id="row_11_3_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html" target="_self">dijkstra.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation </td></tr>
<tr id="row_11_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d80/gale__shapley_8cpp.html" target="_self">gale_shapley.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Gale%E2%80%93Shapley_algorithm" target="_blank">Gale Shapley Algorithm</a> </td></tr>
<tr id="row_11_5_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d6/dba/jump__game_8cpp.html" target="_self">jump_game.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/jump-game/" target="_blank">Jumping Game</a> algorithm implementation </td></tr>
<tr id="row_11_6_" 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="d8/d7d/kruskals__minimum__spanning__tree_8cpp.html" target="_self">kruskals_minimum_spanning_tree.cpp</a></td><td class="desc"><a href="https://www.simplilearn.com/tutorials/data-structure-tutorial/kruskal-algorithm" target="_blank">Kruskals Minimum Spanning Tree</a> implementation </td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="dynsection.toggleFolder('12_')">&#9658;</span><span id="img_12_" class="iconfclosed" onclick="dynsection.toggleFolder('12_')">&#160;</span><a class="el" href="dir_ece9b94c107bbaa1dd68197a8c9983b9.html" target="_self">hashing</a></td><td class="desc"></td></tr>
<tr id="row_12_0_" 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="d9/d92/chaining_8cpp.html" target="_self">chaining.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hash_chain" target="_blank">hash chains</a> </td></tr>
<tr id="row_12_1_" 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/double__hash__hash__table_8cpp.html" target="_self">double_hash_hash_table.cpp</a></td><td class="desc">Storage mechanism using <a href="https://en.wikipedia.org/wiki/Double_hashing" target="_blank">double-hashed keys</a> </td></tr>
@@ -386,7 +387,7 @@ N)\) time, with precision fixed using <a href="https://en.wikipedia.org/wiki/Bis
<tr id="row_21_4_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d39/interpolation__search2_8cpp.html" target="_self">interpolation_search2.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Interpolation_search" target="_blank">Interpolation search</a> algorithm </td></tr>
<tr id="row_21_5_" 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="d2/d22/jump__search_8cpp.html" target="_self">jump_search.cpp</a></td><td class="desc">C++ program to implement <a href="https://en.wikipedia.org/wiki/Jump_search" target="_blank">Jump Search</a> </td></tr>
<tr id="row_21_6_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d02/linear__search_8cpp.html" target="_self">linear_search.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Linear_search" target="_blank">Linear search algorithm</a> </td></tr>
<tr id="row_21_7_" 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="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html" target="_self">Longest_Increasing_Subsequence_using_binary_search.cpp</a></td><td class="desc">Find the length of the Longest Increasing Subsequence (LIS) using <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">Binary Search</a> </td></tr>
<tr id="row_21_7_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html" target="_self">longest_increasing_subsequence_using_binary_search.cpp</a></td><td class="desc">Find the length of the Longest Increasing Subsequence (LIS) using <a href="https://en.wikipedia.org/wiki/Longest_increasing_subsequence" target="_blank">Binary Search</a> </td></tr>
<tr id="row_21_8_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d69/median__search_8cpp.html" target="_self">median_search.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Median_of_medians" target="_blank">Median search</a> algorithm. @cases from <a href="https://brilliant.org/wiki/median-finding-algorithm/" target="_blank">here</a> </td></tr>
<tr id="row_21_9_" 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="d8/dfa/median__search2_8cpp.html" target="_self">median_search2.cpp</a></td><td class="desc">Given a linked list L[0,....,n] of n numbers, find the middle node </td></tr>
<tr id="row_21_10_" 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="d3/d22/saddleback__search_8cpp.html" target="_self">saddleback_search.cpp</a></td><td class="desc">Implementation of <a href="https://www.geeksforgeeks.org/saddleback-search-algorithm-in-a-2d-array" target="_blank">Saddleback Algorithm</a> for 2D arrays </td></tr>

1
functions_a.html
View File

@@ -116,6 +116,7 @@ $(function(){initNavTree('functions_a.html',''); initResizable(true); });
<li>add()&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">data_structures::Bitset</a>, <a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840">data_structures::BloomFilter&lt; T &gt;</a>, <a class="el" href="dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">hash_chain</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
<li>add_digit()&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">large_number</a></li>
<li>add_edge()&#160;:&#160;<a class="el" href="dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph&lt; T &gt;</a>, <a class="el" href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79">greedy_algorithms::dijkstra::Graph</a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>addBinary()&#160;:&#160;<a class="el" href="de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">greedy_algorithms::BinaryAddition</a></li>
<li>addEdge()&#160;:&#160;<a class="el" href="da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">Graph</a>, <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph</a>, <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">graph::is_graph_bipartite::Graph</a></li>
<li>addProcess()&#160;:&#160;<a class="el" href="dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">FCFS&lt; S, T, E &gt;</a></li>
<li>addVertices()&#160;:&#160;<a class="el" href="da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph</a></li>

1
functions_func_a.html
View File

@@ -114,6 +114,7 @@ $(function(){initNavTree('functions_func_a.html',''); initResizable(true); });
<li>add()&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a17dbe1b1d559302312e8091f82f7499c">data_structures::Bitset</a>, <a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html#a67bed8ef62fcb1f33b6c72df47dcf840">data_structures::BloomFilter&lt; T &gt;</a>, <a class="el" href="dd/d1c/classhash__chain.html#a6b4b4de1a8c96f98a63a77f650a9dcff">hash_chain</a>, <a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
<li>add_digit()&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#a60c436d1a1c5e3795d6177d3815ad615">large_number</a></li>
<li>add_edge()&#160;:&#160;<a class="el" href="dc/d61/classgraph_1_1_graph.html#a877b2cba40d8d46dde6fb4209effed19">graph::Graph&lt; T &gt;</a>, <a class="el" href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html#a224b6efacbad55d59e11b046f792fe79">greedy_algorithms::dijkstra::Graph</a>, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#a79ab4601c4a95c0902ac04e779e5f54d">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>addBinary()&#160;:&#160;<a class="el" href="de/df6/classgreedy__algorithms_1_1_binary_addition.html#a801fd1ec5cda76b0bb82cbf23ed4d527">greedy_algorithms::BinaryAddition</a></li>
<li>addEdge()&#160;:&#160;<a class="el" href="da/d9a/class_graph.html#af765dda8f21280e1cecea19e129f1bc5">Graph</a>, <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a3b49011c09cf90a116ab53bef61cd95a">graph::HKGraph</a>, <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a816cda7e563198f778fd32e03992763b">graph::is_graph_bipartite::Graph</a></li>
<li>addProcess()&#160;:&#160;<a class="el" href="dd/dca/class_f_c_f_s.html#a8fbfe4d85f7576b4a7aade07d29fbd69">FCFS&lt; S, T, E &gt;</a></li>
<li>addVertices()&#160;:&#160;<a class="el" href="da/d9a/class_graph.html#ac5a4d9a4f894a179198936042c778413">Graph</a></li>

1
functions_func_i.html
View File

@@ -135,6 +135,7 @@ $(function(){initNavTree('functions_func_i.html',''); initResizable(true); });
<li>IsFull()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">data_structures::tree_234::Node</a></li>
<li>IsLeaf()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8">data_structures::tree_234::Node</a></li>
<li>isSame()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">dsu</a></li>
<li>isValidBinaryString()&#160;:&#160;<a class="el" href="de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2">greedy_algorithms::BinaryAddition</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

1
functions_i.html
View File

@@ -137,6 +137,7 @@ $(function(){initNavTree('functions_i.html',''); initResizable(true); });
<li>IsFull()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a4a37381c0ef93d5ae2118b2e554974dd">data_structures::tree_234::Node</a></li>
<li>IsLeaf()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a607d8201b00b142bf1d6a34df2f936e8">data_structures::tree_234::Node</a></li>
<li>isSame()&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#a64d25c5986742f7c234ed449b2ff7303">dsu</a></li>
<li>isValidBinaryString()&#160;:&#160;<a class="el" href="de/df6/classgreedy__algorithms_1_1_binary_addition.html#a4cfb595ba80795a9efae0e3f6f5c34d2">greedy_algorithms::BinaryAddition</a></li>
<li>items&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#a8417d01c88b99ca56289843509fb71f9">data_structures::tree_234::Node</a></li>
</ul>
</div><!-- contents -->

2
globals_func_l.html
View File

@@ -113,7 +113,7 @@ $(function(){initNavTree('globals_func_l.html',''); initResizable(true); });
<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>longest_increasing_subsequence_using_binary_search()&#160;:&#160;<a class="el" href="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">Longest_Increasing_Subsequence_using_binary_search.cpp</a></li>
<li>longest_increasing_subsequence_using_binary_search()&#160;:&#160;<a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search.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

2
globals_func_t.html
View File

File diff suppressed because one or more lines are too long

2
globals_l.html
View File

@@ -116,7 +116,7 @@ $(function(){initNavTree('globals_l.html',''); initResizable(true); });
<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>longest_increasing_subsequence_using_binary_search()&#160;:&#160;<a class="el" href="df/d99/_longest___increasing___subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">Longest_Increasing_Subsequence_using_binary_search.cpp</a></li>
<li>longest_increasing_subsequence_using_binary_search()&#160;:&#160;<a class="el" href="d9/d5f/longest__increasing__subsequence__using__binary__search_8cpp.html#a313539d9a97fc6e121ce496873ba892e">longest_increasing_subsequence_using_binary_search.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_t.html
View File

File diff suppressed because one or more lines are too long

247
hierarchy.html
View File

@@ -114,129 +114,130 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_0_" 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="d6/d30/classmachine__learning_1_1adaline.html" target="_self">machine_learning::adaline</a></td><td class="desc"></td></tr>
<tr id="row_1_" 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/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/A*_search_algorithm" target="_blank">A* search algorithm</a>. for some initial state and final state </td></tr>
<tr id="row_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree&lt; T &gt;</a></td><td class="desc">The Binary Search Tree class </td></tr>
<tr id="row_3_" 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/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_self">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></td><td class="desc">A Binary Tree class that implements a Binary Search Tree (BST) by default </td></tr>
<tr id="row_4_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">others::iterative_tree_traversals::BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
<tr id="row_5_" 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/dae/classdata__structures_1_1_bitset.html" target="_self">data_structures::Bitset</a></td><td class="desc">Simple bitset implementation for bloom filter </td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html" target="_self">data_structures::BloomFilter&lt; T &gt;</a></td><td class="desc">Bloom filter template class </td></tr>
<tr id="row_7_" 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/db6/structbinary__search__tree_1_1bst__node.html" target="_self">binary_search_tree&lt; T &gt;::bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
<tr id="row_8_" 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/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" target="_self">others::recursive_tree_traversals::BT</a></td><td class="desc"><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ...">BT</a> used to make the entire structure of the binary tree and the functions associated with the binary tree </td></tr>
<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="dc/d1f/classcatalan__numbers.html" target="_self">catalan_numbers</a></td><td class="desc">Computes and caches Catalan numbers </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="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_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="d5/d15/classcll.html" target="_self">cll</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_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="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></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="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_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="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_17_" 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="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">geometry::jarvis::Convexhull</a></td><td class="desc"></td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_19_" 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/d21/classothers_1_1_cache_1_1_d___node.html" target="_self">others::Cache::D_Node&lt; T &gt;</a></td><td class="desc"><a class="el" href="db/d8b/struct_node.html">Node</a> for a doubly linked list with data, prev and next pointers </td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html" target="_self">others::Cache::D_Node&lt; K, V &gt;</a></td><td class="desc"></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="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">machine_learning::neural_network::layers::DenseLayer</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="da/d49/classgreedy__algorithms_1_1_digit_separation.html" target="_self">greedy_algorithms::DigitSeparation</a></td><td class="desc">A class that provides methods to separate the digits of a large positive number </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="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </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="d1/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </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="d7/d77/class_edge.html" target="_self">Edge</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="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">double_hashing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_29_" 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/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_31_" 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/dca/class_f_c_f_s.html" target="_self">FCFS&lt; S, T, E &gt;</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d0d/classrange__queries_1_1fenwick__tree.html" target="_self">range_queries::fenwick_tree</a></td><td class="desc">The class that initializes the Fenwick Tree </td></tr>
<tr id="row_33_" 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/de5/classbacktracking_1_1generate__parentheses.html" target="_self">backtracking::generate_parentheses</a></td><td class="desc">Generate_parentheses class </td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">probability::geometric_dist::geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
<tr id="row_35_" 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/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_36_" class="arrow" onclick="dynsection.toggleFolder('36_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">graph::Graph&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_36_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="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">graph::RootedTree</a></td><td class="desc"></td></tr>
<tr id="row_37_" 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/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_self">graph::is_graph_bipartite::Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" target="_self">greedy_algorithms::dijkstra::Graph</a></td><td class="desc">Wrapper class for storing a graph </td></tr>
<tr id="row_39_" 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="d6/d84/classhashing_1_1sha256_1_1_hash.html" target="_self">hashing::sha256::Hash</a></td><td class="desc">Contains hash array and functions to update it and convert it to a hexadecimal string </td></tr>
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_41_" 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="d6/d26/classciphers_1_1_hill_cipher.html" target="_self">ciphers::HillCipher</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill Cipher</a> algorithm </td></tr>
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html" target="_self">graph::HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
<tr id="row_43_" 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/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
<tr id="row_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_45_" 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/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" target="_self">machine_learning::k_nearest_neighbors::Knn</a></td><td class="desc">K-Nearest Neighbors (<a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" title="K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.">Knn</a>) class using Euclidean distance as distance metric </td></tr>
<tr id="row_46_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_47_" 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/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" target="_self">others::Cache::LFUCache&lt; K, V &gt;</a></td><td class="desc"><a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" title="LFUCache.">LFUCache</a> </td></tr>
<tr id="row_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html" target="_self">data_structures::linked_list::link</a></td><td class="desc"></td></tr>
<tr id="row_49_" 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/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_50_" 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/def/classdata__structures_1_1linked__list_1_1list.html" target="_self">data_structures::linked_list::list</a></td><td class="desc"></td></tr>
<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="d5/dab/structdata__structures_1_1list__array_1_1list.html" target="_self">data_structures::list_array::list&lt; N &gt;</a></td><td class="desc">Structure of List with supporting methods </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="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></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="d7/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </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/d21/class_longest___substring.html" target="_self">Longest_Substring</a></td><td class="desc">Class that solves the Longest Substring Without Repeating Characters problem </td></tr>
<tr id="row_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="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></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="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" target="_self">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="desc"><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a> </td></tr>
<tr id="row_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="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">others::lru_cache::LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_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="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" target="_self">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a></td><td class="desc"><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class.">Matrix</a> class </td></tr>
<tr id="row_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="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_61_" 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/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_62_" 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="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
<tr id="row_63_" 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="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
<tr id="row_64_" 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/d0e/classdata__structures_1_1linked__list_1_1_node.html" target="_self">data_structures::linked_list::Node</a></td><td class="desc"></td></tr>
<tr id="row_65_" 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/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
<tr id="row_67_" 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/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_self">data_structures::trie_using_hashmap::Trie::Node</a></td><td class="desc">Struct representing a trie node </td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node&lt; ValueType &gt;</a></td><td class="desc"></td></tr>
<tr id="row_69_" 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/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">operations_on_datastructures::circular_linked_list::Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_71_" 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/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
<tr id="row_72_" 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/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_73_" 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/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">others::recursive_tree_traversals::Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
<tr id="row_75_" 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/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_76_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_77_" 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/d8b/struct_node.html" target="_self">Node&lt; value_type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_" 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/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_self">strings::boyer_moore::pattern</a></td><td class="desc">A structure representing all the data we need to search the preprocessed pattern in text </td></tr>
<tr id="row_79_" 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/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_80_" 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="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_81_" 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="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></td></tr>
<tr id="row_82_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_83_" 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/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_85_" 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="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; ValueType &gt;</a></td><td class="desc"></td></tr>
<tr id="row_87_" 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="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_89_" 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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_90_" 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/d95/classdata__structures_1_1_segment_tree.html" target="_self">data_structures::SegmentTree&lt; T &gt;</a></td><td class="desc">Class representation of the segment tree </td></tr>
<tr id="row_91_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_91_" class="arrow" onclick="dynsection.toggleFolder('91_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_91_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_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="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</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="dd/d4f/class_solution.html" target="_self">Solution</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="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_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="d2/dc8/classdata__structures_1_1_stack.html" target="_self">data_structures::Stack&lt; T &gt;</a></td><td class="desc">Class representation of a stack </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="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
<tr id="row_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="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_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="d1/dc2/classstack.html" target="_self">stack&lt; ValueType &gt;</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_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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></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="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_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="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_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="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
<tr id="row_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="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_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="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_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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></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="d5/d95/structdata__structures_1_1treap_1_1_treap.html" target="_self">data_structures::treap::Treap</a></td><td class="desc">Struct representation of the treap </td></tr>
<tr id="row_107_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_107_" class="arrow" onclick="dynsection.toggleFolder('107_')">&#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_107_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_108_" 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_109_" 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_110_" 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_111_" 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_112_" 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_113_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_113_" class="arrow" onclick="dynsection.toggleFolder('113_')">&#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_113_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_113_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_113_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_113_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_113_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_113_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_114_" 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_115_" 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_116_" 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_3_" 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/df6/classgreedy__algorithms_1_1_binary_addition.html" target="_self">greedy_algorithms::BinaryAddition</a></td><td class="desc">A class to perform binary addition of two binary strings </td></tr>
<tr id="row_4_" 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/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" target="_self">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></td><td class="desc">A Binary Tree class that implements a Binary Search Tree (BST) by default </td></tr>
<tr id="row_5_" 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/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">others::iterative_tree_traversals::BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
<tr id="row_6_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dae/classdata__structures_1_1_bitset.html" target="_self">data_structures::Bitset</a></td><td class="desc">Simple bitset implementation for bloom filter </td></tr>
<tr id="row_7_" 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="dc/dd4/classdata__structures_1_1_bloom_filter.html" target="_self">data_structures::BloomFilter&lt; T &gt;</a></td><td class="desc">Bloom filter template class </td></tr>
<tr id="row_8_" 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/db6/structbinary__search__tree_1_1bst__node.html" target="_self">binary_search_tree&lt; T &gt;::bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
<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="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" target="_self">others::recursive_tree_traversals::BT</a></td><td class="desc"><a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ...">BT</a> used to make the entire structure of the binary tree and the functions associated with the binary tree </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="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></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="dc/d1f/classcatalan__numbers.html" target="_self">catalan_numbers</a></td><td class="desc">Computes and caches Catalan numbers </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="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_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="d5/d15/classcll.html" target="_self">cll</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="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_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="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></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="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_17_" 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_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_self">geometry::jarvis::Convexhull</a></td><td class="desc"></td></tr>
<tr id="row_19_" 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/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html" target="_self">others::Cache::D_Node&lt; T &gt;</a></td><td class="desc"><a class="el" href="db/d8b/struct_node.html">Node</a> for a doubly linked list with data, prev and next pointers </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="de/d21/classothers_1_1_cache_1_1_d___node.html" target="_self">others::Cache::D_Node&lt; K, V &gt;</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="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html" target="_self">machine_learning::neural_network::layers::DenseLayer</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="da/d49/classgreedy__algorithms_1_1_digit_separation.html" target="_self">greedy_algorithms::DigitSeparation</a></td><td class="desc">A class that provides methods to separate the digits of a large positive number </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="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</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="dd/d1f/classdsu.html" target="_self">dsu</a></td><td class="desc">Disjoint sets union data structure, class based representation </td></tr>
<tr id="row_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="d1/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </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="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html" target="_self">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></td><td class="desc">A class defining <a href="https://en.wikipedia.org/wiki/15_puzzle" target="_blank">EightPuzzle/15-Puzzle game</a> </td></tr>
<tr id="row_29_" 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/dde/structdouble__hashing_1_1_entry.html" target="_self">double_hashing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_31_" 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/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_probing::Entry</a></td><td class="desc"></td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/dca/class_f_c_f_s.html" target="_self">FCFS&lt; S, T, E &gt;</a></td><td class="desc">Class which implements the <a class="el" href="dd/dca/class_f_c_f_s.html" title="Class which implements the FCFS scheduling algorithm.">FCFS</a> scheduling algorithm </td></tr>
<tr id="row_33_" 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/d0d/classrange__queries_1_1fenwick__tree.html" target="_self">range_queries::fenwick_tree</a></td><td class="desc">The class that initializes the Fenwick Tree </td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/de5/classbacktracking_1_1generate__parentheses.html" target="_self">backtracking::generate_parentheses</a></td><td class="desc">Generate_parentheses class </td></tr>
<tr id="row_35_" 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/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html" target="_self">probability::geometric_dist::geometric_distribution</a></td><td class="desc">A class to model the geometric distribution </td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_37_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_37_" class="arrow" onclick="dynsection.toggleFolder('37_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d61/classgraph_1_1_graph.html" target="_self">graph::Graph&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_37_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="d0/d58/classgraph_1_1_rooted_tree.html" target="_self">graph::RootedTree</a></td><td class="desc"></td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_self">graph::is_graph_bipartite::Graph</a></td><td class="desc">Class for representing graph as an adjacency list </td></tr>
<tr id="row_39_" 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/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" target="_self">greedy_algorithms::dijkstra::Graph</a></td><td class="desc">Wrapper class for storing a graph </td></tr>
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html" target="_self">hashing::sha256::Hash</a></td><td class="desc">Contains hash array and functions to update it and convert it to a hexadecimal string </td></tr>
<tr id="row_41_" 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/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html" target="_self">ciphers::HillCipher</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Hill_cipher" target="_blank">Hill Cipher</a> algorithm </td></tr>
<tr id="row_43_" 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/d69/classgraph_1_1_h_k_graph.html" target="_self">graph::HKGraph</a></td><td class="desc">Represents Bipartite graph for Hopcroft Karp implementation </td></tr>
<tr id="row_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html" target="_self">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;::Info</a></td><td class="desc">Struct that handles all the information related to the current state </td></tr>
<tr id="row_45_" 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/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_46_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" target="_self">machine_learning::k_nearest_neighbors::Knn</a></td><td class="desc">K-Nearest Neighbors (<a class="el" href="da/d94/classmachine__learning_1_1k__nearest__neighbors_1_1_knn.html" title="K-Nearest Neighbors (Knn) class using Euclidean distance as distance metric.">Knn</a>) class using Euclidean distance as distance metric </td></tr>
<tr id="row_47_" 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/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" target="_self">others::Cache::LFUCache&lt; K, V &gt;</a></td><td class="desc"><a class="el" href="df/d8f/classothers_1_1_cache_1_1_l_f_u_cache.html" title="LFUCache.">LFUCache</a> </td></tr>
<tr id="row_49_" 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/d9d/classdata__structures_1_1linked__list_1_1link.html" target="_self">data_structures::linked_list::link</a></td><td class="desc"></td></tr>
<tr id="row_50_" 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/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<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="d1/def/classdata__structures_1_1linked__list_1_1list.html" target="_self">data_structures::linked_list::list</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="d5/dab/structdata__structures_1_1list__array_1_1list.html" target="_self">data_structures::list_array::list&lt; N &gt;</a></td><td class="desc">Structure of List with supporting methods </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="d8/d10/structlist.html" target="_self">list</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="d7/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </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="da/d21/class_longest___substring.html" target="_self">Longest_Substring</a></td><td class="desc">Class that solves the Longest Substring Without Repeating Characters problem </td></tr>
<tr id="row_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="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</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="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" target="_self">others::Cache::LRUCache&lt; K, V &gt;</a></td><td class="desc"><a class="el" href="d8/d2e/classothers_1_1_cache_1_1_l_r_u_cache.html" title="LRUCache.">LRUCache</a> </td></tr>
<tr id="row_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="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html" target="_self">others::lru_cache::LRUCache</a></td><td class="desc">LRU cache class </td></tr>
<tr id="row_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="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" target="_self">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a></td><td class="desc"><a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class.">Matrix</a> class </td></tr>
<tr id="row_60_" 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/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_61_" 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/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_62_" 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/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_63_" 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="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
<tr id="row_64_" 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/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
<tr id="row_65_" 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="d4/d0e/classdata__structures_1_1linked__list_1_1_node.html" target="_self">data_structures::linked_list::Node</a></td><td class="desc"></td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
<tr id="row_67_" 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/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
<tr id="row_68_" 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/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_self">data_structures::trie_using_hashmap::Trie::Node</a></td><td class="desc">Struct representing a trie node </td></tr>
<tr id="row_69_" 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/d8b/struct_node.html" target="_self">Node&lt; ValueType &gt;</a></td><td class="desc"></td></tr>
<tr id="row_70_" 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/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" target="_self">operations_on_datastructures::circular_linked_list::Node</a></td><td class="desc">A <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> struct that represents a single <a class="el" href="da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html" title="A Node struct that represents a single Node in a Binary Tree.">Node</a> in a Binary Tree </td></tr>
<tr id="row_71_" 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/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_72_" 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/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" target="_self">operations_on_datastructures::reverse_binary_tree::Node</a></td><td class="desc">A <a class="el" href="d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> struct that represents a single node in a Binary Tree </td></tr>
<tr id="row_73_" 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/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_74_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html" target="_self">others::recursive_tree_traversals::Node</a></td><td class="desc">The structure to hold Nodes of the tree </td></tr>
<tr id="row_75_" 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/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
<tr id="row_76_" 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/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_77_" 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/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_78_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node&lt; value_type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_79_" 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/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_self">strings::boyer_moore::pattern</a></td><td class="desc">A structure representing all the data we need to search the preprocessed pattern in text </td></tr>
<tr id="row_80_" 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/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_81_" 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="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_82_" 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/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></td></tr>
<tr id="row_83_" 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/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_84_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_85_" 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/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_87_" 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/da9/classqueue.html" target="_self">queue&lt; ValueType &gt;</a></td><td class="desc"></td></tr>
<tr id="row_88_" 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="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_89_" 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/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_90_" 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/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<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="dd/d95/classdata__structures_1_1_segment_tree.html" target="_self">data_structures::SegmentTree&lt; T &gt;</a></td><td class="desc">Class representation of the segment tree </td></tr>
<tr id="row_92_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_92_" class="arrow" onclick="dynsection.toggleFolder('92_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_92_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_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="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</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="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></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="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_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/dc8/classdata__structures_1_1_stack.html" target="_self">data_structures::Stack&lt; T &gt;</a></td><td class="desc">Class representation of a stack </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="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_self">data_structures::stack_using_queue::Stack</a></td><td class="desc"><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Class implementation for basic methods of <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure.">Stack</a> Data Structure </td></tr>
<tr id="row_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="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_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="d1/dc2/classstack.html" target="_self">stack&lt; ValueType &gt;</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_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="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></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="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_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="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_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="da/d86/struct_test_case.html" target="_self">TestCase</a></td><td class="desc">Single example inputs and expected output of the function <a class="el" href="da/d0d/longest__common__string_8cpp.html#aa38b6b17bc5d46ed88acdd8414e18fa5" title="computes the length of the longest common string created from input strings">longest_common_string_length</a> </td></tr>
<tr id="row_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="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_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="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_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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></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="d5/d95/structdata__structures_1_1treap_1_1_treap.html" target="_self">data_structures::treap::Treap</a></td><td class="desc">Struct representation of the treap </td></tr>
<tr id="row_108_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_108_" class="arrow" onclick="dynsection.toggleFolder('108_')">&#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_108_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_109_" 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_110_" 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_111_" 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_112_" 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_113_" 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_114_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_114_" class="arrow" onclick="dynsection.toggleFolder('114_')">&#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_114_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_114_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_114_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_114_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_114_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_114_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_115_" 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_116_" 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_117_" 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 -->

1
hierarchy.js
View File

@@ -3,6 +3,7 @@ var hierarchy =
[ "machine_learning::adaline", "d6/d30/classmachine__learning_1_1adaline.html", null ],
[ "machine_learning::aystar_search::AyStarSearch< Puzzle >", "da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html", null ],
[ "binary_search_tree< T >", "d9/dde/classbinary__search__tree.html", null ],
[ "greedy_algorithms::BinaryAddition", "de/df6/classgreedy__algorithms_1_1_binary_addition.html", null ],
[ "operations_on_datastructures::reverse_binary_tree::BinaryTree", "de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html", null ],
[ "others::iterative_tree_traversals::BinaryTree", "d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html", null ],
[ "data_structures::Bitset", "d9/dae/classdata__structures_1_1_bitset.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="$da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list." alt="" coords="5,5,158,46"/>
<area shape="rect" id="Node000000" href="$d8/d72/class_r_btree.html" title=" " alt="" coords="5,5,68,31"/>
</map>

2
inherit_graph_100.md5
View File

@@ -1 +1 @@
d1b903c12342c81b9815dc3248590328
4118d46187a1c497ec1244462bb4e7d1

13
inherit_graph_100.svg
View File

@@ -4,17 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="122pt" height="39pt"
viewBox="0.00 0.00 122.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<svg width="55pt" height="27pt"
viewBox="0.00 0.00 54.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="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_top" xlink:title="A Node structure representing a single link Node in a linked list.">
<polygon fill="white" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
<g id="a_Node000000"><a xlink:href="d8/d72/class_r_btree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="46.75,-19.25 0,-19.25 0,0 46.75,0 46.75,-19.25"/>
<text text-anchor="middle" x="23.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">RBtree</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 937 B

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

2
inherit_graph_101.md5
View File

@@ -1 +1 @@
ec8e0ec9ba2659ae4c1c03a14fee656f
d1b903c12342c81b9815dc3248590328

13
inherit_graph_101.svg
View File

@@ -4,16 +4,17 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="114pt" height="27pt"
viewBox="0.00 0.00 114.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)">
<svg width="122pt" height="39pt"
viewBox="0.00 0.00 122.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
<g id="a_Node000000"><a xlink:href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_top" xlink:title="A Node structure representing a single link Node in a linked list.">
<polygon fill="white" stroke="#666666" points="114.25,-30.5 0,-30.5 0,0 114.25,0 114.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">search::sublist_search</text>
<text text-anchor="middle" x="57.13" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 957 B

After

Width:  |  Height:  |  Size: 1.1 KiB

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/d4f/class_solution.html" title=" " alt="" coords="5,5,74,31"/>
<area shape="rect" id="Node000000" href="$d4/db4/struct_segment_intersection.html" title=" " alt="" coords="5,5,147,31"/>
</map>

2
inherit_graph_102.md5
View File

@@ -1 +1 @@
ff0be17deb0c0dfb25090b34c2c7d14f
ec8e0ec9ba2659ae4c1c03a14fee656f

10
inherit_graph_102.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="59pt" height="27pt"
viewBox="0.00 0.00 59.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="114pt" height="27pt"
viewBox="0.00 0.00 114.00 27.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/d4f/class_solution.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
<g id="a_Node000000"><a xlink:href="d4/db4/struct_segment_intersection.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="106,-19.25 0,-19.25 0,0 106,0 106,-19.25"/>
<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">SegmentIntersection</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 940 B

After

Width:  |  Height:  |  Size: 957 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="$d1/dc2/classstack.html" title="for std::invalid_argument" alt="" coords="5,5,143,31"/>
<area shape="rect" id="Node000000" href="$dd/d4f/class_solution.html" title=" " alt="" coords="5,5,74,31"/>
</map>

2
inherit_graph_103.md5
View File

@@ -1 +1 @@
717e385118aaa4f551bc0a7a0954681d
ff0be17deb0c0dfb25090b34c2c7d14f

10
inherit_graph_103.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="111pt" height="27pt"
viewBox="0.00 0.00 111.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="59pt" height="27pt"
viewBox="0.00 0.00 59.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="d1/dc2/classstack.html" target="_top" xlink:title="for std::invalid_argument">
<polygon fill="white" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack&lt; ValueType &gt;</text>
<g id="a_Node000000"><a xlink:href="dd/d4f/class_solution.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Solution</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 971 B

After

Width:  |  Height:  |  Size: 940 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="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,31"/>
<area shape="rect" id="Node000000" href="$d1/dc2/classstack.html" title="for std::invalid_argument" alt="" coords="5,5,143,31"/>
</map>

2
inherit_graph_104.md5
View File

@@ -1 +1 @@
f583284f2e396e0f7b5fd8bccf0bb840
717e385118aaa4f551bc0a7a0954681d

10
inherit_graph_104.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="95pt" height="27pt"
viewBox="0.00 0.00 94.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="111pt" height="27pt"
viewBox="0.00 0.00 111.00 27.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/dc4/classstack__linked_list.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="86.5,-19.25 0,-19.25 0,0 86.5,0 86.5,-19.25"/>
<text text-anchor="middle" x="43.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack_linkedList</text>
<g id="a_Node000000"><a xlink:href="d1/dc2/classstack.html" target="_top" xlink:title="for std::invalid_argument">
<polygon fill="white" stroke="#666666" points="103,-19.25 0,-19.25 0,0 103,0 103,-19.25"/>
<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack&lt; ValueType &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 954 B

After

Width:  |  Height:  |  Size: 971 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="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,31"/>
<area shape="rect" id="Node000000" href="$d2/dc4/classstack__linked_list.html" title=" " alt="" coords="5,5,121,31"/>
</map>

2
inherit_graph_105.md5
View File

@@ -1 +1 @@
adf4423c975497d5fe67f2bb0728f9b9
f583284f2e396e0f7b5fd8bccf0bb840

10
inherit_graph_105.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="167pt" height="27pt"
viewBox="0.00 0.00 166.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="95pt" height="27pt"
viewBox="0.00 0.00 94.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="d7/d7c/classstatistics_1_1stats__computer1.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1&lt; T &gt;</text>
<g id="a_Node000000"><a xlink:href="d2/dc4/classstack__linked_list.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="86.5,-19.25 0,-19.25 0,0 86.5,0 86.5,-19.25"/>
<text text-anchor="middle" x="43.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">stack_linkedList</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 993 B

After

Width:  |  Height:  |  Size: 954 B

2
inherit_graph_106.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,31"/>
<area shape="rect" id="Node000000" href="$d7/d7c/classstatistics_1_1stats__computer1.html" title=" " alt="" coords="5,5,217,31"/>
</map>

2
inherit_graph_106.md5
View File

@@ -1 +1 @@
efb55af1cccef519836d4c2436ccda42
adf4423c975497d5fe67f2bb0728f9b9

4
inherit_graph_106.svg
View File

@@ -11,9 +11,9 @@
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d8/dab/classstatistics_1_1stats__computer2.html" target="_top" xlink:title=" ">
<g id="a_Node000000"><a xlink:href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2&lt; T &gt;</text>
<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer1&lt; T &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 993 B

After

Width:  |  Height:  |  Size: 993 B

14
inherit_graph_107.map
View File

@@ -1,15 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integral_constant.html" title=" " alt="" coords="5,161,107,186"/>
<area shape="rect" id="Node000001" href="$d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" title=" " alt="" coords="191,5,312,46"/>
<area shape="poly" id="edge4_Node000000_Node000001" title=" " alt="" coords="71,146,106,101,128,77,153,57,189,39,191,44,156,61,132,81,110,104,76,149"/>
<area shape="rect" id="Node000002" href="$dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" title=" " alt="" coords="191,71,312,111"/>
<area shape="poly" id="edge5_Node000000_Node000002" title=" " alt="" coords="93,151,154,121,190,107,191,112,156,125,95,155"/>
<area shape="rect" id="Node000003" href="$d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" title=" " alt="" coords="160,136,343,161"/>
<area shape="poly" id="edge6_Node000000_Node000003" title=" " alt="" coords="122,163,159,158,159,163,122,168"/>
<area shape="rect" id="Node000004" href="$d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" title=" " alt="" coords="160,185,343,210"/>
<area shape="poly" id="edge7_Node000000_Node000004" title=" " alt="" coords="122,179,159,184,159,189,122,184"/>
<area shape="rect" id="Node000005" href="$d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" title=" " alt="" coords="155,234,348,260"/>
<area shape="poly" id="edge8_Node000000_Node000005" title=" " alt="" coords="95,192,156,221,189,231,188,236,154,225,93,197"/>
<area shape="rect" id="Node000006" href="$df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" title=" " alt="" coords="155,284,348,309"/>
<area shape="poly" id="edge9_Node000000_Node000006" title=" " alt="" coords="78,197,112,235,156,270,180,281,177,285,153,275,108,239,74,201"/>
<area shape="rect" id="Node000000" href="$d8/dab/classstatistics_1_1stats__computer2.html" title=" " alt="" coords="5,5,217,31"/>
</map>

2
inherit_graph_107.md5
View File

@@ -1 +1 @@
53ba32e546959cac79e584e353db1db7
efb55af1cccef519836d4c2436ccda42

122
inherit_graph_107.svg
View File

@@ -4,126 +4,16 @@
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="265pt" height="236pt"
viewBox="0.00 0.00 265.00 235.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 231.88)">
<svg width="167pt" height="27pt"
viewBox="0.00 0.00 166.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 target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integral_constant.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="76,-111.25 0,-111.25 0,-92 76,-92 76,-111.25"/>
<text text-anchor="middle" x="38" y="-97.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::true_type</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="230,-227.88 139,-227.88 139,-197.38 230,-197.38 230,-227.88"/>
<text text-anchor="start" x="147" y="-214.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
<text text-anchor="middle" x="184.5" y="-203.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge4_Node000000_Node000001" class="edge">
<title>Node0&#45;&gt;Node1</title>
<g id="a_edge4_Node000000_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M51.12,-121.24C64.02,-140.62 86.12,-169.85 112,-187.62 120.02,-193.13 129.38,-197.55 138.63,-201.04"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="54.11,-119.41 45.76,-112.9 48.22,-123.2 54.11,-119.41"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="230,-178.88 139,-178.88 139,-148.38 230,-148.38 230,-178.88"/>
<text text-anchor="start" x="147" y="-165.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_arithmetic</text>
<text text-anchor="middle" x="184.5" y="-154.12" font-family="Helvetica,sans-Serif" font-size="10.00">&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node2 -->
<g id="edge5_Node000000_Node000002" class="edge">
<title>Node0&#45;&gt;Node2</title>
<g id="a_edge5_Node000000_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M66.39,-117.18C79.88,-124.5 96.54,-133.05 112,-139.62 120.56,-143.26 129.87,-146.73 138.85,-149.84"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="68.1,-114.13 57.65,-112.36 64.72,-120.25 68.1,-114.13"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="253.25,-130.25 115.75,-130.25 115.75,-111 253.25,-111 253.25,-130.25"/>
<text text-anchor="middle" x="184.5" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node3 -->
<g id="edge6_Node000000_Node000003" class="edge">
<title>Node0&#45;&gt;Node3</title>
<g id="a_edge6_Node000000_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.56,-108.01C96.47,-109.18 105.92,-110.42 115.28,-111.65"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.08,-104.55 77.71,-106.72 87.17,-111.49 88.08,-104.55"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="253.25,-93.25 115.75,-93.25 115.75,-74 253.25,-74 253.25,-93.25"/>
<text text-anchor="middle" x="184.5" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_integral&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node4 -->
<g id="edge7_Node000000_Node000004" class="edge">
<title>Node0&#45;&gt;Node4</title>
<g id="a_edge7_Node000000_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M87.56,-95.58C96.47,-94.47 105.92,-93.29 115.28,-92.12"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="87.2,-92.09 77.71,-96.8 88.07,-99.04 87.2,-92.09"/>
</a>
</g>
</g>
<!-- Node5 -->
<g id="Node000005" class="node">
<title>Node5</title>
<g id="a_Node000005"><a xlink:href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="257,-56.25 112,-56.25 112,-37 257,-37 257,-56.25"/>
<text text-anchor="middle" x="184.5" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned&lt; uint128_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node5 -->
<g id="edge8_Node000000_Node000005" class="edge">
<title>Node0&#45;&gt;Node5</title>
<g id="a_edge8_Node000000_Node000005"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M66.23,-86C79.68,-78.76 96.35,-70.48 112,-64.62 120.03,-61.62 128.76,-58.96 137.26,-56.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="64.6,-82.9 57.53,-90.79 67.98,-89.03 64.6,-82.9"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="257,-19.25 112,-19.25 112,0 257,0 257,-19.25"/>
<text text-anchor="middle" x="184.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::is_unsigned&lt; uint256_t &gt;</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node6 -->
<g id="edge9_Node000000_Node000006" class="edge">
<title>Node0&#45;&gt;Node6</title>
<g id="a_edge9_Node000000_Node000006"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M52.87,-82.53C66.18,-65.6 87.77,-41.48 112,-27.62 117.56,-24.45 123.67,-21.83 129.91,-19.66"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="50.21,-80.24 46.96,-90.32 55.79,-84.47 50.21,-80.24"/>
<g id="a_Node000000"><a xlink:href="d8/dab/classstatistics_1_1stats__computer2.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="158.5,-19.25 0,-19.25 0,0 158.5,0 158.5,-19.25"/>
<text text-anchor="middle" x="79.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">statistics::stats_computer2&lt; T &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 6.3 KiB

After

Width:  |  Height:  |  Size: 993 B

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