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

Documentation for dd36279e73

Browse Source
This commit is contained in:
realstealthninja
2024-10-07 13:41:10 +00:00
parent 969f0dcb73
commit cc0e02e5f8
265 changed files with 2821 additions and 1126 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
annotated.html
View File

@@ -164,6 +164,7 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
<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_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_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>

3
annotated_dup.js
View File

@@ -74,7 +74,8 @@ var annotated_dup =
[ "greedy_algorithms", "d2/d90/namespacegreedy__algorithms.html", [
[ "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" ]
] ]
] ],
[ "DigitSeparation", "da/d49/classgreedy__algorithms_1_1_digit_separation.html", "da/d49/classgreedy__algorithms_1_1_digit_separation" ]
] ],
[ "hashing", "d6/d0c/namespacehashing.html", [
[ "sha256", null, [

2
classes.html
View File

@@ -120,7 +120,7 @@ $(function(){initNavTree('classes.html',''); initResizable(true); });
<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>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_D" name="letter_D">D</a></dt>
<dd><a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a> (<a class="el" href="db/dde/namespaceothers_1_1_cache.html">others::Cache</a>)</dd><dd><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd><dd><a class="el" href="dd/d1f/classdsu.html">dsu</a></dd></dl>
<dd><a class="el" href="de/d21/classothers_1_1_cache_1_1_d___node.html">D_Node</a> (<a class="el" href="db/dde/namespaceothers_1_1_cache.html">others::Cache</a>)</dd><dd><a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html">DenseLayer</a> (machine_learning::neural_network::layers)</dd><dd><a class="el" href="da/d49/classgreedy__algorithms_1_1_digit_separation.html">DigitSeparation</a> (<a class="el" href="d2/d90/namespacegreedy__algorithms.html">greedy_algorithms</a>)</dd><dd><a class="el" href="d9/dee/classdouble__linked__list.html">double_linked_list</a></dd><dd><a class="el" href="dd/d1f/classdsu.html">dsu</a></dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_E" name="letter_E">E</a></dt>
<dd><a class="el" href="d1/df6/class_easter_year_month_day.html">EasterYearMonthDay</a></dd><dd><a class="el" href="d7/d77/class_edge.html">Edge</a></dd><dd><a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html">EightPuzzle</a> (machine_learning::aystar_search)</dd><dd><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html">Entry</a> (<a class="el" href="d0/d65/namespacedouble__hashing.html">double_hashing</a>)</dd><dd><a class="el" href="db/d19/structlinear__probing_1_1_entry.html">Entry</a> (<a class="el" href="d8/d89/namespacelinear__probing.html">linear_probing</a>)</dd><dd><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html">Entry</a> (<a class="el" href="d4/dd2/namespacequadratic__probing.html">quadratic_probing</a>)</dd></dl>

10
d2/d90/namespacegreedy__algorithms.html
View File

@@ -106,6 +106,7 @@ $(function(){initNavTree('d2/d90/namespacegreedy__algorithms.html','../../'); in
<div class="header">
<div class="summary">
<a href="#namespaces">Namespaces</a> &#124;
<a href="#nested-classes">Classes</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">greedy_algorithms Namespace Reference</div></div>
</div><!--header-->
@@ -123,6 +124,12 @@ Namespaces</h2></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>
<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="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="../../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>
</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:a33e3819aa9ffec0e380383c52603b502" id="r_a33e3819aa9ffec0e380383c52603b502"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a33e3819aa9ffec0e380383c52603b502">can_jump</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int &gt; &amp;nums)</td></tr>
@@ -137,8 +144,11 @@ Functions</h2></td></tr>
<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </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 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>
<p>Greedy Algorithms</p>
<p>for std::u32int_t for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/find.html">std::find</a></p>
<p>Greedy Algorithms</p>
<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></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 ]
] ],
[ "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 ]
];

284
d3/d36/digit__separation_8cpp.html Normal file
View File

@@ -0,0 +1,284 @@
<!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/digit_separation.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('d3/d36/digit__separation_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">digit_separation.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Separates digits from numbers in forward and reverse order.
<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;cmath&gt;</code><br />
<code>#include &lt;cstdint&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for digit_separation.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/d47/digit__separation_8cpp__incl.svg" width="515" 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="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::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>
</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 <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem: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">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>Separates digits from numbers in forward and reverse order. </p>
<dl class="section see"><dt>See also</dt><dd><a href="https://www.log2base2.com/c-examples/loop/split-a-number-into-digits-in-c.html">https://www.log2base2.com/c-examples/loop/split-a-number-into-digits-in-c.html</a></dd></dl>
<p>The DigitSeparation class provides two methods to separate the digits of large integers: digitSeparationReverseOrder and digitSeparationForwardOrder. The digitSeparationReverseOrder method extracts digits by repeatedly applying the modulus operation (% 10) to isolate the last digit, then divides the number by 10 to remove it. This process continues until the entire number is broken down into its digits, which are stored in reverse order. If the number is zero, the method directly returns a vector containing {0} to handle this edge case. Negative numbers are handled by taking the absolute value, ensuring consistent behavior regardless of the sign. </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>
<div class="fragment"><div class="line"><span class="lineno"> 138</span> {</div>
<div class="line"><span class="lineno"> 139</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"> 140</span> </div>
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 142</span>}</div>
<div class="ttc" id="adigit__separation_8cpp_html_a483bb8ccf42aaf7375a83e91490eda1e"><div class="ttname"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">tests</a></div><div class="ttdeci">static void tests()</div><div class="ttdoc">self test implementation</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:83</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="663" height="132"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a483bb8ccf42aaf7375a83e91490eda1e" name="a483bb8ccf42aaf7375a83e91490eda1e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a483bb8ccf42aaf7375a83e91490eda1e">&#9670;&#160;</a></span>tests()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void tests </td>
<td>(</td>
<td class="paramname"><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>self test implementation </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 83</span> {</div>
<div class="line"><span class="lineno"> 84</span> <a class="code hl_class" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a> ds;</div>
<div class="line"><span class="lineno"> 85</span> </div>
<div class="line"><span class="lineno"> 86</span> <span class="comment">// Test case: Positive number</span></div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> number = 1234567890;</div>
<div class="line"><span class="lineno"> 88</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::int64_t&gt;</a> expectedReverse = {0, 9, 8, 7, 6, 5, 4, 3, 2, 1};</div>
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::int64_t&gt;</a> expectedForward = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0};</div>
<div class="line"><span class="lineno"> 90</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::int64_t&gt;</a> reverseOrder =</div>
<div class="line"><span class="lineno"> 91</span> ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
<div class="line"><span class="lineno"> 92</span> assert(reverseOrder == expectedReverse);</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::int64_t&gt;</a> forwardOrder =</div>
<div class="line"><span class="lineno"> 94</span> ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
<div class="line"><span class="lineno"> 95</span> assert(forwardOrder == expectedForward);</div>
<div class="line"><span class="lineno"> 96</span> </div>
<div class="line"><span class="lineno"> 97</span> <span class="comment">// Test case: Single digit number</span></div>
<div class="line"><span class="lineno"> 98</span> number = 5;</div>
<div class="line"><span class="lineno"> 99</span> expectedReverse = {5};</div>
<div class="line"><span class="lineno"> 100</span> expectedForward = {5};</div>
<div class="line"><span class="lineno"> 101</span> reverseOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
<div class="line"><span class="lineno"> 102</span> assert(reverseOrder == expectedReverse);</div>
<div class="line"><span class="lineno"> 103</span> forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
<div class="line"><span class="lineno"> 104</span> assert(forwardOrder == expectedForward);</div>
<div class="line"><span class="lineno"> 105</span> </div>
<div class="line"><span class="lineno"> 106</span> <span class="comment">// Test case: Zero</span></div>
<div class="line"><span class="lineno"> 107</span> number = 0;</div>
<div class="line"><span class="lineno"> 108</span> expectedReverse = {0};</div>
<div class="line"><span class="lineno"> 109</span> expectedForward = {0};</div>
<div class="line"><span class="lineno"> 110</span> reverseOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
<div class="line"><span class="lineno"> 111</span> assert(reverseOrder == expectedReverse);</div>
<div class="line"><span class="lineno"> 112</span> forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
<div class="line"><span class="lineno"> 113</span> assert(forwardOrder == expectedForward);</div>
<div class="line"><span class="lineno"> 114</span> </div>
<div class="line"><span class="lineno"> 115</span> <span class="comment">// Test case: Large number</span></div>
<div class="line"><span class="lineno"> 116</span> number = 987654321012345;</div>
<div class="line"><span class="lineno"> 117</span> expectedReverse = {5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};</div>
<div class="line"><span class="lineno"> 118</span> expectedForward = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5};</div>
<div class="line"><span class="lineno"> 119</span> reverseOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
<div class="line"><span class="lineno"> 120</span> assert(reverseOrder == expectedReverse);</div>
<div class="line"><span class="lineno"> 121</span> forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
<div class="line"><span class="lineno"> 122</span> assert(forwardOrder == expectedForward);</div>
<div class="line"><span class="lineno"> 123</span> </div>
<div class="line"><span class="lineno"> 124</span> <span class="comment">// Test case: Negative number</span></div>
<div class="line"><span class="lineno"> 125</span> number = -987654321012345;</div>
<div class="line"><span class="lineno"> 126</span> expectedReverse = {5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9};</div>
<div class="line"><span class="lineno"> 127</span> expectedForward = {9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5};</div>
<div class="line"><span class="lineno"> 128</span> reverseOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(number);</div>
<div class="line"><span class="lineno"> 129</span> assert(reverseOrder == expectedReverse);</div>
<div class="line"><span class="lineno"> 130</span> forwardOrder = ds.<a class="code hl_function" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(number);</div>
<div class="line"><span class="lineno"> 131</span> assert(forwardOrder == expectedForward);</div>
<div class="line"><span class="lineno"> 132</span>}</div>
<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a></div><div class="ttdoc">A class that provides methods to separate the digits of a large positive number.</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:35</div></div>
<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a1809ae6828223999374bde5b197a59c8"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">greedy_algorithms::DigitSeparation::digitSeparationForwardOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationForwardOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationForwardOrder method.</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:68</div></div>
<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a34769a780845e9d4279152899bd3bf79"><div class="ttname"><a href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation::digitSeparationReverseOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationReverseOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationReverseOrder method.</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:48</div></div>
<div class="ttc" id="ainteger_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg" width="566" height="132"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_0eaa691bd54ab0922ca7f50599de6d22.html">greedy_algorithms</a></li><li class="navelem"><a class="el" href="../../d3/d36/digit__separation_8cpp.html">digit_separation.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
d3/d36/digit__separation_8cpp.js vendored Normal file
View File

@@ -0,0 +1,6 @@
var digit__separation_8cpp =
[
[ "greedy_algorithms::DigitSeparation", "da/d49/classgreedy__algorithms_1_1_digit_separation.html", "da/d49/classgreedy__algorithms_1_1_digit_separation" ],
[ "main", "d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "tests", "d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e", null ]
];

10
d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map Normal file
View File

@@ -0,0 +1,10 @@
<map id="tests" name="tests">
<area shape="rect" id="Node000001" title="self test implementation" alt="" coords="5,54,56,79"/>
<area shape="rect" id="Node000002" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" title="Implementation of digitSeparationForwardOrder method." alt="" coords="104,71,308,126"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="57,68,89,74,88,80,56,74"/>
<area shape="rect" id="Node000003" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" title="Implementation of digitSeparationReverseOrder method." alt="" coords="356,5,560,61"/>
<area shape="poly" id="edge4_Node000001_Node000003" title=" " alt="" coords="55,61,103,56,340,38,340,43,104,61,56,66"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="308,69,340,61,341,66,309,75"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="413,86,503,111"/>
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="308,96,397,96,397,101,308,101"/>
</map>

1
d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
1649b7dab17754b877f56efbec73556b

114
d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg Normal file
View File

@@ -0,0 +1,114 @@
<?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.1 (20240910.0053)
-->
<!-- Title: tests Pages: 1 -->
<svg width="424pt" height="99pt"
viewBox="0.00 0.00 424.25 98.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 94.75)">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="self test implementation">
<polygon fill="#999999" stroke="#666666" points="37.75,-54.5 0,-54.5 0,-35.25 37.75,-35.25 37.75,-54.5"/>
<text text-anchor="middle" x="18.88" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" target="_top" xlink:title="Implementation of digitSeparationForwardOrder method.">
<polygon fill="white" stroke="#666666" points="227,-41.75 73.75,-41.75 73.75,0 227,0 227,-41.75"/>
<text text-anchor="start" x="81.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="150.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</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.15,-41.49C44.99,-40.22 53.3,-38.68 62.25,-37.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.76,-40.49 71.95,-35.22 61.48,-33.6 62.76,-40.49"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
<polygon fill="white" stroke="#666666" points="416.25,-90.75 263,-90.75 263,-49 416.25,-49 416.25,-90.75"/>
<text text-anchor="start" x="271" y="-77.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="271" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="339.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge4_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.82,-47.05C48.29,-48.28 61.75,-49.78 73.75,-50.88 132.87,-56.29 199.52,-61.06 251.18,-64.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="250.92,-67.96 261.12,-65.12 251.37,-60.97 250.92,-67.96"/>
</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="M227.27,-40.73C235.28,-42.83 243.48,-44.98 251.61,-47.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="250.6,-50.46 261.16,-49.6 252.37,-43.69 250.6,-50.46"/>
</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/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="373.5,-30.5 305.75,-30.5 305.75,-11.25 373.5,-11.25 373.5,-30.5"/>
<text text-anchor="middle" x="339.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M227.27,-20.88C249.98,-20.88 274.14,-20.88 294.12,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.86,-24.38 303.86,-20.88 293.86,-17.38 293.86,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.1 KiB

88
d3/d36/digit__separation_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg Normal file
View File

@@ -0,0 +1,88 @@
<?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.1 (20240910.0053)
-->
<!-- Title: tests Pages: 1 -->
<svg width="424pt" height="99pt"
viewBox="0.00 0.00 424.25 98.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 94.75)">
<title>tests</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="self test implementation">
<polygon fill="#999999" stroke="#666666" points="37.75,-54.5 0,-54.5 0,-35.25 37.75,-35.25 37.75,-54.5"/>
<text text-anchor="middle" x="18.88" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">tests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" target="_top" xlink:title="Implementation of digitSeparationForwardOrder method.">
<polygon fill="white" stroke="#666666" points="227,-41.75 73.75,-41.75 73.75,0 227,0 227,-41.75"/>
<text text-anchor="start" x="81.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="81.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="150.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</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.15,-41.49C44.99,-40.22 53.3,-38.68 62.25,-37.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.76,-40.49 71.95,-35.22 61.48,-33.6 62.76,-40.49"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
<polygon fill="white" stroke="#666666" points="416.25,-90.75 263,-90.75 263,-49 416.25,-49 416.25,-90.75"/>
<text text-anchor="start" x="271" y="-77.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="271" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="339.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge4_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge4_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M37.82,-47.05C48.29,-48.28 61.75,-49.78 73.75,-50.88 132.87,-56.29 199.52,-61.06 251.18,-64.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="250.92,-67.96 261.12,-65.12 251.37,-60.97 250.92,-67.96"/>
</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="M227.27,-40.73C235.28,-42.83 243.48,-44.98 251.61,-47.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="250.6,-50.46 261.16,-49.6 252.37,-43.69 250.6,-50.46"/>
</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/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="373.5,-30.5 305.75,-30.5 305.75,-11.25 373.5,-11.25 373.5,-30.5"/>
<text text-anchor="middle" x="339.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M227.27,-20.88C249.98,-20.88 274.14,-20.88 294.12,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="293.86,-24.38 303.86,-20.88 293.86,-17.38 293.86,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.4 KiB

12
d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,12 @@
<map id="main" name="main">
<area shape="rect" id="Node000001" title="main function" alt="" coords="5,54,55,79"/>
<area shape="rect" id="Node000002" href="$d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" title="self test implementation" alt="" coords="103,54,153,79"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,64,88,64,88,69,55,69"/>
<area shape="rect" id="Node000003" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" title="Implementation of digitSeparationForwardOrder method." alt="" coords="201,71,405,126"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="154,68,186,74,185,80,153,74"/>
<area shape="rect" id="Node000004" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" title="Implementation of digitSeparationReverseOrder method." alt="" coords="453,5,658,61"/>
<area shape="poly" id="edge5_Node000002_Node000004" title=" " alt="" coords="153,61,201,56,437,38,438,43,201,61,153,66"/>
<area shape="poly" id="edge3_Node000003_Node000004" title=" " alt="" coords="405,69,437,61,439,66,406,75"/>
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="510,86,601,111"/>
<area shape="poly" id="edge4_Node000003_Node000005" title=" " alt="" coords="406,96,495,96,495,101,406,101"/>
</map>

1
d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
a557164585e504eb1d90a8d78bad24e8

132
d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,132 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: main Pages: 1 -->
<svg width="497pt" height="99pt"
viewBox="0.00 0.00 497.25 98.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 94.75)">
<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,-54.5 0,-54.5 0,-35.25 37,-35.25 37,-54.5"/>
<text text-anchor="middle" x="18.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
<polygon fill="white" stroke="#666666" points="110.75,-54.5 73,-54.5 73,-35.25 110.75,-35.25 110.75,-54.5"/>
<text text-anchor="middle" x="91.88" y="-41" 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,-44.88C44.55,-44.88 53.37,-44.88 61.69,-44.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-48.38 71.43,-44.88 61.43,-41.38 61.43,-48.38"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" target="_top" xlink:title="Implementation of digitSeparationForwardOrder method.">
<polygon fill="white" stroke="#666666" points="300,-41.75 146.75,-41.75 146.75,0 300,0 300,-41.75"/>
<text text-anchor="start" x="154.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="223.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</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.15,-41.49C117.99,-40.22 126.3,-38.68 135.25,-37.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.76,-40.49 144.95,-35.22 134.48,-33.6 135.76,-40.49"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
<polygon fill="white" stroke="#666666" points="489.25,-90.75 336,-90.75 336,-49 489.25,-49 489.25,-90.75"/>
<text text-anchor="start" x="344" y="-77.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="344" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="412.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge5_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.82,-47.05C121.29,-48.28 134.75,-49.78 146.75,-50.88 205.87,-56.29 272.52,-61.06 324.18,-64.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="323.92,-67.96 334.12,-65.12 324.37,-60.97 323.92,-67.96"/>
</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="M300.27,-40.73C308.28,-42.83 316.48,-44.98 324.61,-47.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="323.6,-50.46 334.16,-49.6 325.37,-43.69 323.6,-50.46"/>
</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/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="446.5,-30.5 378.75,-30.5 378.75,-11.25 446.5,-11.25 446.5,-30.5"/>
<text text-anchor="middle" x="412.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M300.27,-20.88C322.98,-20.88 347.14,-20.88 367.12,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="366.86,-24.38 376.86,-20.88 366.86,-17.38 366.86,-24.38"/>
</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: 6.0 KiB

106
d3/d36/digit__separation_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg Normal file
View File

@@ -0,0 +1,106 @@
<?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.1 (20240910.0053)
-->
<!-- Title: main Pages: 1 -->
<svg width="497pt" height="99pt"
viewBox="0.00 0.00 497.25 98.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 94.75)">
<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,-54.5 0,-54.5 0,-35.25 37,-35.25 37,-54.5"/>
<text text-anchor="middle" x="18.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e" target="_top" xlink:title="self test implementation">
<polygon fill="white" stroke="#666666" points="110.75,-54.5 73,-54.5 73,-35.25 110.75,-35.25 110.75,-54.5"/>
<text text-anchor="middle" x="91.88" y="-41" 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,-44.88C44.55,-44.88 53.37,-44.88 61.69,-44.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.43,-48.38 71.43,-44.88 61.43,-41.38 61.43,-48.38"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8" target="_top" xlink:title="Implementation of digitSeparationForwardOrder method.">
<polygon fill="white" stroke="#666666" points="300,-41.75 146.75,-41.75 146.75,0 300,0 300,-41.75"/>
<text text-anchor="start" x="154.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="154.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="223.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</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.15,-41.49C117.99,-40.22 126.3,-38.68 135.25,-37.02"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="135.76,-40.49 144.95,-35.22 134.48,-33.6 135.76,-40.49"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
<polygon fill="white" stroke="#666666" points="489.25,-90.75 336,-90.75 336,-49 489.25,-49 489.25,-90.75"/>
<text text-anchor="start" x="344" y="-77.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="344" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="412.62" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge5_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge5_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M110.82,-47.05C121.29,-48.28 134.75,-49.78 146.75,-50.88 205.87,-56.29 272.52,-61.06 324.18,-64.47"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="323.92,-67.96 334.12,-65.12 324.37,-60.97 323.92,-67.96"/>
</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="M300.27,-40.73C308.28,-42.83 316.48,-44.98 324.61,-47.1"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="323.6,-50.46 334.16,-49.6 325.37,-43.69 323.6,-50.46"/>
</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/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="446.5,-30.5 378.75,-30.5 378.75,-11.25 446.5,-11.25 446.5,-30.5"/>
<text text-anchor="middle" x="412.62" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M300.27,-20.88C322.98,-20.88 347.14,-20.88 367.12,-20.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="366.86,-24.38 376.86,-20.88 366.86,-17.38 366.86,-24.38"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.2 KiB

15
d9/d47/digit__separation_8cpp__incl.map Normal file
View File

@@ -0,0 +1,15 @@
<map id="greedy_algorithms/digit_separation.cpp" name="greedy_algorithms/digit_separation.cpp">
<area shape="rect" id="Node000001" title="Separates digits from numbers in forward and reverse order." alt="" coords="185,5,340,46"/>
<area shape="rect" id="Node000002" title=" " alt="" coords="5,94,80,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="208,49,92,91,90,86,207,44"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="104,94,168,120"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="233,49,170,88,167,83,230,44"/>
<area shape="rect" id="Node000004" title=" " alt="" coords="192,94,250,120"/>
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="255,48,237,81,232,79,250,45"/>
<area shape="rect" id="Node000005" title=" " alt="" coords="274,94,334,120"/>
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="275,45,293,79,288,81,270,48"/>
<area shape="rect" id="Node000006" title=" " alt="" coords="358,94,429,120"/>
<area shape="poly" id="edge5_Node000001_Node000006" title=" " alt="" coords="297,44,362,83,359,88,294,49"/>
<area shape="rect" id="Node000007" title=" " alt="" coords="452,94,510,120"/>
<area shape="poly" id="edge6_Node000001_Node000007" title=" " alt="" coords="318,44,439,87,437,92,316,49"/>
</map>

1
d9/d47/digit__separation_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
d9a664742d1c710397683c17a216434e

156
d9/d47/digit__separation_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,156 @@
<?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.1 (20240910.0053)
-->
<!-- Title: greedy_algorithms/digit_separation.cpp Pages: 1 -->
<svg width="386pt" height="94pt"
viewBox="0.00 0.00 386.38 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/digit_separation.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Separates digits from numbers in forward and reverse order.">
<polygon fill="#999999" stroke="#666666" points="251.12,-85.75 134.62,-85.75 134.62,-55.25 251.12,-55.25 251.12,-85.75"/>
<text text-anchor="start" x="142.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/digit</text>
<text text-anchor="middle" x="192.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_separation.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="M151.66,-54.8C124.72,-45.18 89.87,-32.75 64.01,-23.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="65.2,-20.23 54.6,-20.16 62.85,-26.82 65.2,-20.23"/>
</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="M169.39,-54.95C155.07,-46.07 136.79,-34.74 122.29,-25.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="124.15,-22.79 113.81,-20.5 120.46,-28.74 124.15,-22.79"/>
</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="183.38,-19.25 140.38,-19.25 140.38,0 183.38,0 183.38,-19.25"/>
<text text-anchor="middle" x="161.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</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="M185.21,-54.95C181.22,-47.36 176.28,-37.99 171.98,-29.82"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="175.12,-28.26 167.36,-21.04 168.92,-31.52 175.12,-28.26"/>
</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="246.5,-19.25 201.25,-19.25 201.25,0 246.5,0 246.5,-19.25"/>
<text text-anchor="middle" x="223.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</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="M200.54,-54.95C204.53,-47.36 209.47,-37.99 213.77,-29.82"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="216.83,-31.52 218.39,-21.04 210.63,-28.26 216.83,-31.52"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="317.62,-19.25 264.12,-19.25 264.12,0 317.62,0 317.62,-19.25"/>
<text text-anchor="middle" x="290.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M217.35,-54.8C232.28,-45.83 251.29,-34.41 266.24,-25.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.78,-28.58 274.55,-20.43 264.17,-22.58 267.78,-28.58"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="378.38,-19.25 335.38,-19.25 335.38,0 378.38,0 378.38,-19.25"/>
<text text-anchor="middle" x="356.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</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="M233.84,-54.8C261.77,-44.77 298.26,-31.67 324.24,-22.34"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.36,-25.66 333.59,-18.98 322.99,-19.07 325.36,-25.66"/>
</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: 6.2 KiB

130
d9/d47/digit__separation_8cpp__incl_org.svg Normal file
View File

@@ -0,0 +1,130 @@
<?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.1 (20240910.0053)
-->
<!-- Title: greedy_algorithms/digit_separation.cpp Pages: 1 -->
<svg width="386pt" height="94pt"
viewBox="0.00 0.00 386.38 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/digit_separation.cpp</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Separates digits from numbers in forward and reverse order.">
<polygon fill="#999999" stroke="#666666" points="251.12,-85.75 134.62,-85.75 134.62,-55.25 251.12,-55.25 251.12,-85.75"/>
<text text-anchor="start" x="142.62" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms/digit</text>
<text text-anchor="middle" x="192.88" y="-61" font-family="Helvetica,sans-Serif" font-size="10.00">_separation.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="M151.66,-54.8C124.72,-45.18 89.87,-32.75 64.01,-23.52"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="65.2,-20.23 54.6,-20.16 62.85,-26.82 65.2,-20.23"/>
</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="M169.39,-54.95C155.07,-46.07 136.79,-34.74 122.29,-25.76"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="124.15,-22.79 113.81,-20.5 120.46,-28.74 124.15,-22.79"/>
</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="183.38,-19.25 140.38,-19.25 140.38,0 183.38,0 183.38,-19.25"/>
<text text-anchor="middle" x="161.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cmath</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="M185.21,-54.95C181.22,-47.36 176.28,-37.99 171.98,-29.82"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="175.12,-28.26 167.36,-21.04 168.92,-31.52 175.12,-28.26"/>
</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="246.5,-19.25 201.25,-19.25 201.25,0 246.5,0 246.5,-19.25"/>
<text text-anchor="middle" x="223.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">cstdint</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="M200.54,-54.95C204.53,-47.36 209.47,-37.99 213.77,-29.82"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="216.83,-31.52 218.39,-21.04 210.63,-28.26 216.83,-31.52"/>
</a>
</g>
</g>
<!-- Node6 -->
<g id="Node000006" class="node">
<title>Node6</title>
<g id="a_Node000006"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="317.62,-19.25 264.12,-19.25 264.12,0 317.62,0 317.62,-19.25"/>
<text text-anchor="middle" x="290.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</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="M217.35,-54.8C232.28,-45.83 251.29,-34.41 266.24,-25.42"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="267.78,-28.58 274.55,-20.43 264.17,-22.58 267.78,-28.58"/>
</a>
</g>
</g>
<!-- Node7 -->
<g id="Node000007" class="node">
<title>Node7</title>
<g id="a_Node000007"><a xlink:title=" ">
<polygon fill="#e0e0e0" stroke="#999999" points="378.38,-19.25 335.38,-19.25 335.38,0 378.38,0 378.38,-19.25"/>
<text text-anchor="middle" x="356.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">vector</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="M233.84,-54.8C261.77,-44.77 298.26,-31.67 324.24,-22.34"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="325.36,-25.66 333.59,-18.98 322.99,-19.07 325.36,-25.66"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.4 KiB

269
da/d49/classgreedy__algorithms_1_1_digit_separation.html Normal file
View File

@@ -0,0 +1,269 @@
<!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::DigitSeparation 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('da/d49/classgreedy__algorithms_1_1_digit_separation.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="../../de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">greedy_algorithms::DigitSeparation Class Reference</div></div>
</div><!--header-->
<div class="contents">
<p>A class that provides methods to separate the digits of a large positive number.
<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:afd54c969a6c9bab16b4a064fbc8ed40e" id="r_afd54c969a6c9bab16b4a064fbc8ed40e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afd54c969a6c9bab16b4a064fbc8ed40e">DigitSeparation</a> ()</td></tr>
<tr class="memdesc:afd54c969a6c9bab16b4a064fbc8ed40e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default constructor for the <a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html" title="A class that provides methods to separate the digits of a large positive number.">DigitSeparation</a> class. <br /></td></tr>
<tr class="separator:afd54c969a6c9bab16b4a064fbc8ed40e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a34769a780845e9d4279152899bd3bf79" id="r_a34769a780845e9d4279152899bd3bf79"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> largeNumber) const</td></tr>
<tr class="memdesc:a34769a780845e9d4279152899bd3bf79"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of digitSeparationReverseOrder method. <br /></td></tr>
<tr class="separator:a34769a780845e9d4279152899bd3bf79"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1809ae6828223999374bde5b197a59c8" id="r_a1809ae6828223999374bde5b197a59c8"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> largeNumber) const</td></tr>
<tr class="memdesc:a1809ae6828223999374bde5b197a59c8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of digitSeparationForwardOrder method. <br /></td></tr>
<tr class="separator:a1809ae6828223999374bde5b197a59c8"><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 that provides methods to separate the digits of a large positive number. </p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="afd54c969a6c9bab16b4a064fbc8ed40e" name="afd54c969a6c9bab16b4a064fbc8ed40e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afd54c969a6c9bab16b4a064fbc8ed40e">&#9670;&#160;</a></span>DigitSeparation()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">greedy_algorithms::DigitSeparation::DigitSeparation </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">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Default constructor for the <a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html" title="A class that provides methods to separate the digits of a large positive number.">DigitSeparation</a> class. </p>
<div class="fragment"><div class="line"><span class="lineno"> 40</span>{}</div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a1809ae6828223999374bde5b197a59c8" name="a1809ae6828223999374bde5b197a59c8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1809ae6828223999374bde5b197a59c8">&#9670;&#160;</a></span>digitSeparationForwardOrder()</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/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> &gt; greedy_algorithms::DigitSeparation::digitSeparationForwardOrder </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td> <td class="paramname"><span class="paramname"><em>largeNumber</em></span></td><td>)</td>
<td> const</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>Implementation of digitSeparationForwardOrder method. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">largeNumber</td><td>The large number to separate digits from. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A vector of digits in forward order. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 69</span> {</div>
<div class="line"><span class="lineno"> 70</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> =</div>
<div class="line"><span class="lineno"> 71</span> <a class="code hl_function" href="#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(largeNumber);</div>
<div class="line"><span class="lineno"> 72</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"> 73</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"> 74</span> }</div>
<div class="ttc" id="aclassgreedy__algorithms_1_1_digit_separation_html_a34769a780845e9d4279152899bd3bf79"><div class="ttname"><a href="#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation::digitSeparationReverseOrder</a></div><div class="ttdeci">std::vector&lt; std::int64_t &gt; digitSeparationReverseOrder(std::int64_t largeNumber) const</div><div class="ttdoc">Implementation of digitSeparationReverseOrder method.</div><div class="ttdef"><b>Definition</b> digit_separation.cpp:48</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="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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.svg" width="468" height="118"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<a id="a34769a780845e9d4279152899bd3bf79" name="a34769a780845e9d4279152899bd3bf79"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a34769a780845e9d4279152899bd3bf79">&#9670;&#160;</a></span>digitSeparationReverseOrder()</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/container/vector.html">std::vector</a>&lt; <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a> &gt; greedy_algorithms::DigitSeparation::digitSeparationReverseOrder </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::int64_t</a></td> <td class="paramname"><span class="paramname"><em>largeNumber</em></span></td><td>)</td>
<td> const</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>Implementation of digitSeparationReverseOrder method. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">largeNumber</td><td>The large number to separate digits from. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A vector of digits in reverse order. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 49</span> {</div>
<div class="line"><span class="lineno"> 50</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;std::int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 51</span> <span class="keywordflow">if</span> (largeNumber != 0) {</div>
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">while</span> (largeNumber != 0) {</div>
<div class="line"><span class="lineno"> 53</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(std::abs(largeNumber % 10));</div>
<div class="line"><span class="lineno"> 54</span> largeNumber /= 10;</div>
<div class="line"><span class="lineno"> 55</span> }</div>
<div class="line"><span class="lineno"> 56</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 57</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(0);</div>
<div class="line"><span class="lineno"> 58</span> }</div>
<div class="line"><span class="lineno"> 59</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"> 60</span> }</div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>greedy_algorithms/<a class="el" href="../../d3/d36/digit__separation_8cpp.html">digit_separation.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="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">DigitSeparation</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
da/d49/classgreedy__algorithms_1_1_digit_separation.js Normal file
View File

@@ -0,0 +1,6 @@
var classgreedy__algorithms_1_1_digit_separation =
[
[ "DigitSeparation", "da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e", null ],
[ "digitSeparationForwardOrder", "da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8", null ],
[ "digitSeparationReverseOrder", "da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79", null ]
];

7
da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="greedy_algorithms::DigitSeparation::digitSeparationForwardOrder" name="greedy_algorithms::DigitSeparation::digitSeparationForwardOrder">
<area shape="rect" id="Node000001" title="Implementation of digitSeparationForwardOrder method." alt="" coords="5,39,210,94"/>
<area shape="rect" id="Node000002" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" title="Implementation of digitSeparationReverseOrder method." alt="" coords="258,5,462,61"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="210,50,242,46,242,51,210,56"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/reverse.html#" title=" " alt="" coords="315,86,405,111"/>
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="210,77,300,88,299,94,210,82"/>
</map>

1
da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
c6f4b15afebce0a61636f63d76449450

87
da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph.svg Normal file
View File

@@ -0,0 +1,87 @@
<?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.1 (20240910.0053)
-->
<!-- Title: greedy_algorithms::DigitSeparation::digitSeparationForwardOrder Pages: 1 -->
<svg width="351pt" height="88pt"
viewBox="0.00 0.00 350.50 87.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 83.5)">
<title>greedy_algorithms::DigitSeparation::digitSeparationForwardOrder</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation of digitSeparationForwardOrder method.">
<polygon fill="#999999" stroke="#666666" points="153.25,-54.5 0,-54.5 0,-12.75 153.25,-12.75 153.25,-54.5"/>
<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="76.62" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
<polygon fill="white" stroke="#666666" points="342.5,-79.5 189.25,-79.5 189.25,-37.75 342.5,-37.75 342.5,-79.5"/>
<text text-anchor="start" x="197.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="197.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="265.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</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="M153.52,-43.76C161.44,-44.82 169.54,-45.9 177.58,-46.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177,-50.42 187.37,-48.28 177.93,-43.49 177,-50.42"/>
</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/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="299.75,-19.25 232,-19.25 232,0 299.75,0 299.75,-19.25"/>
<text text-anchor="middle" x="265.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M153.52,-23.9C176.23,-20.99 200.39,-17.89 220.37,-15.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="220.64,-18.82 230.12,-14.08 219.75,-11.88 220.64,-18.82"/>
</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.0 KiB

61
da/d49/classgreedy__algorithms_1_1_digit_separation_a1809ae6828223999374bde5b197a59c8_cgraph_org.svg Normal file
View File

@@ -0,0 +1,61 @@
<?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.1 (20240910.0053)
-->
<!-- Title: greedy_algorithms::DigitSeparation::digitSeparationForwardOrder Pages: 1 -->
<svg width="351pt" height="88pt"
viewBox="0.00 0.00 350.50 87.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 83.5)">
<title>greedy_algorithms::DigitSeparation::digitSeparationForwardOrder</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Implementation of digitSeparationForwardOrder method.">
<polygon fill="#999999" stroke="#666666" points="153.25,-54.5 0,-54.5 0,-12.75 153.25,-12.75 153.25,-54.5"/>
<text text-anchor="start" x="8" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="8" y="-29.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="76.62" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">ForwardOrder</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79" target="_top" xlink:title="Implementation of digitSeparationReverseOrder method.">
<polygon fill="white" stroke="#666666" points="342.5,-79.5 189.25,-79.5 189.25,-37.75 342.5,-37.75 342.5,-79.5"/>
<text text-anchor="start" x="197.25" y="-66" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="start" x="197.25" y="-54.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation::digitSeparation</text>
<text text-anchor="middle" x="265.88" y="-43.5" font-family="Helvetica,sans-Serif" font-size="10.00">ReverseOrder</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="M153.52,-43.76C161.44,-44.82 169.54,-45.9 177.58,-46.97"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="177,-50.42 187.37,-48.28 177.93,-43.49 177,-50.42"/>
</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/reverse.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="299.75,-19.25 232,-19.25 232,0 299.75,0 299.75,-19.25"/>
<text text-anchor="middle" x="265.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::reverse</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="M153.52,-23.9C176.23,-20.99 200.39,-17.89 220.37,-15.33"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="220.64,-18.82 230.12,-14.08 219.75,-11.88 220.64,-18.82"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.2 KiB

125
de/d8f/classgreedy__algorithms_1_1_digit_separation-members.html Normal file
View File

@@ -0,0 +1,125 @@
<!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('da/d49/classgreedy__algorithms_1_1_digit_separation.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::DigitSeparation Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e">DigitSeparation</a>()</td><td class="entry"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">digitSeparationForwardOrder</a>(std::int64_t largeNumber) const</td><td class="entry"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">digitSeparationReverseOrder</a>(std::int64_t largeNumber) const</td><td class="entry"><a class="el" href="../../da/d49/classgreedy__algorithms_1_1_digit_separation.html">greedy_algorithms::DigitSeparation</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
</ul>
</div>
</body>
</html>

3
dir_0eaa691bd54ab0922ca7f50599de6d22.html
View File

@@ -113,6 +113,9 @@ Files</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top"><span class="icondoc"></span>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="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>
<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="d3/d36/digit__separation_8cpp.html">digit_separation.cpp</a></td></tr>
<tr class="memdesc:d3/d36/digit__separation_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Separates digits from numbers in forward and reverse order. <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/dcb/greedy__algorithms_2dijkstra_8cpp.html">dijkstra.cpp</a></td></tr>
<tr class="memdesc:df/dcb/greedy__algorithms_2dijkstra_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" target="_blank">Dijkstra</a> algorithm implementation <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_0eaa691bd54ab0922ca7f50599de6d22.js
View File

@@ -1,6 +1,7 @@
var dir_0eaa691bd54ab0922ca7f50599de6d22 =
[
[ "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" ],
[ "gale_shapley.cpp", "db/d80/gale__shapley_8cpp.html", "db/d80/gale__shapley_8cpp" ],
[ "jump_game.cpp", "d6/dba/jump__game_8cpp.html", "d6/dba/jump__game_8cpp" ],

10
doxygen_crawl.html
View File

@@ -116,6 +116,7 @@
<a href="de/d88/travelling__salesman__problem_8cpp.html"/>
<a href="da/d77/spirograph_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"/>
<a href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html"/>
<a href="db/d80/gale__shapley_8cpp.html"/>
@@ -510,6 +511,8 @@
<a href="d7/d08/namespacegraph__coloring.html"/>
<a href="de/d9b/namespacegray__code.html"/>
<a href="d2/d90/namespacegreedy__algorithms.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"/>
<a href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html"/>
<a href="d9/db6/classgreedy__algorithms_1_1dijkstra_1_1_graph-members.html"/>
@@ -1455,6 +1458,9 @@
<a href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17"/>
<a href="d3/d2a/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1comparison__operator.html"/>
<a href="d3/d2d/namespacedynamic__programming_1_1palindrome__partitioning.html#a52ee22882858d2b1cf04293f02ed839a"/>
<a href="d3/d36/digit__separation_8cpp.html"/>
<a href="d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e"/>
<a href="d3/d36/digit__separation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"/>
<a href="d3/d39/manacher__algorithm_8cpp.html"/>
<a href="d3/d39/manacher__algorithm_8cpp.html#a95e6a2976bb2f332898f373941d52098"/>
<a href="d3/d39/manacher__algorithm_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"/>
@@ -2906,6 +2912,10 @@
<a href="da/d41/uint128__t_8hpp.html"/>
<a href="da/d41/uint128__t_8hpp.html#a3ff77262ffd6743df5b808d41382a6f3"/>
<a href="da/d41/uint128__t_8hpp.html#acce684d03a24f9c13a9ed36de6d24a57"/>
<a href="da/d49/classgreedy__algorithms_1_1_digit_separation.html"/>
<a href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8"/>
<a href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79"/>
<a href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e"/>
<a href="da/d4b/depth__first__search__with__stack_8cpp.html"/>
<a href="da/d4b/depth__first__search__with__stack_8cpp.html#a330a2b0a904f01802ada1f8f3b28e76c"/>
<a href="da/d4b/depth__first__search__with__stack_8cpp.html#a43e30173f12330e85cce6239a277527e"/>

9
files.html
View File

@@ -218,10 +218,11 @@ solve-a-rat-in-a-maze-c-java-pytho/" target="_blank">Rat in a Maze</a> algorithm
<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="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_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="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_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="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_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="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_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_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>

3
functions_d.html
View File

@@ -130,6 +130,9 @@ $(function(){initNavTree('functions_d.html',''); initResizable(true); });
<li>dfs_par()&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></li>
<li>dfs_size()&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>digit_char()&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">large_number</a></li>
<li>DigitSeparation()&#160;:&#160;<a class="el" href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e">greedy_algorithms::DigitSeparation</a></li>
<li>digitSeparationForwardOrder()&#160;:&#160;<a class="el" href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">greedy_algorithms::DigitSeparation</a></li>
<li>digitSeparationReverseOrder()&#160;:&#160;<a class="el" href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation</a></li>
<li>direction()&#160;:&#160;<a class="el" href="d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">SegmentIntersection</a></li>
<li>display()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615">data_structures::linked_list::list</a>, <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array</a>, <a class="el" href="dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain</a>, <a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53">others::lru_cache::LRUCache</a>, <a class="el" href="db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">queue&lt; ValueType &gt;</a>, <a class="el" href="d1/dc2/classstack.html#a8bce109630118a34faae717f72986033">stack&lt; ValueType &gt;</a></li>
<li>displayList()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList</a></li>

3
functions_func_d.html
View File

@@ -127,6 +127,9 @@ $(function(){initNavTree('functions_func_d.html',''); initResizable(true); });
<li>dfs_par()&#160;:&#160;<a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#a2dfbda148aad0bfaba2ebfda9ebc915a">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></li>
<li>dfs_size()&#160;:&#160;<a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#aa339c31ec74cd86a4842a8b09653d460">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></li>
<li>digit_char()&#160;:&#160;<a class="el" href="db/d82/classlarge__number.html#ae35a55607cf52c0b0d485f2129bd39ac">large_number</a></li>
<li>DigitSeparation()&#160;:&#160;<a class="el" href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#afd54c969a6c9bab16b4a064fbc8ed40e">greedy_algorithms::DigitSeparation</a></li>
<li>digitSeparationForwardOrder()&#160;:&#160;<a class="el" href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#a1809ae6828223999374bde5b197a59c8">greedy_algorithms::DigitSeparation</a></li>
<li>digitSeparationReverseOrder()&#160;:&#160;<a class="el" href="da/d49/classgreedy__algorithms_1_1_digit_separation.html#a34769a780845e9d4279152899bd3bf79">greedy_algorithms::DigitSeparation</a></li>
<li>direction()&#160;:&#160;<a class="el" href="d4/db4/struct_segment_intersection.html#a3beb2ac1b35d67354f1dbaf9a971e655">SegmentIntersection</a></li>
<li>display()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a1313837c0e9ec67fd9fbd17987e2d615">data_structures::linked_list::list</a>, <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array</a>, <a class="el" href="dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain</a>, <a class="el" href="d6/dae/classothers_1_1lru__cache_1_1_l_r_u_cache.html#aad506b1c1a3cd5b93cc7e497626bfb53">others::lru_cache::LRUCache</a>, <a class="el" href="db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">queue&lt; ValueType &gt;</a>, <a class="el" href="d1/dc2/classstack.html#a8bce109630118a34faae717f72986033">stack&lt; ValueType &gt;</a></li>
<li>displayList()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList</a></li>

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

@@ -145,7 +145,7 @@ $(function(){initNavTree('globals_func_t.html',''); initResizable(true); });
<li>test_longest_common_string_length_for_reversed_inputs()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#a23ab67b0d9600697695fc8679462d8fe">longest_common_string.cpp</a></li>
<li>test_longest_common_string_length_is_symmetric()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">longest_common_string.cpp</a></li>
<li>test_remove()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">gale_shapley.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">quick_sort_iterative.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">digit_separation.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">gale_shapley.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">quick_sort_iterative.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
<li>TH()&#160;:&#160;<a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
<li>tolowerRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
<li>toupperRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>

2
globals_m.html
View File

File diff suppressed because one or more lines are too long

2
globals_t.html
View File

@@ -146,7 +146,7 @@ $(function(){initNavTree('globals_t.html',''); initResizable(true); });
<li>test_longest_common_string_length_is_symmetric()&#160;:&#160;<a class="el" href="da/d0d/longest__common__string_8cpp.html#ad1e613c1b85cc04ed931b6c745fec155">longest_common_string.cpp</a></li>
<li>test_remove()&#160;:&#160;<a class="el" href="df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">binary_search_tree2.cpp</a></li>
<li>test_set&#160;:&#160;<a class="el" href="d3/d7d/brute__force__string__searching_8cpp.html#ae2abaa9caa13fff35e45edca00bee123">brute_force_string_searching.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">gale_shapley.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">quick_sort_iterative.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
<li>tests()&#160;:&#160;<a class="el" href="d1/db7/dynamic__programming_2armstrong__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">armstrong_number.cpp</a>, <a class="el" href="da/d0d/longest__common__string_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">longest_common_string.cpp</a>, <a class="el" href="d7/d07/bidirectional__dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">bidirectional_dijkstra.cpp</a>, <a class="el" href="df/d82/breadth__first__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">breadth_first_search.cpp</a>, <a class="el" href="df/ddd/connected__components_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">connected_components.cpp</a>, <a class="el" href="da/d4b/depth__first__search__with__stack_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">depth_first_search_with_stack.cpp</a>, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">dijkstra.cpp</a>, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">hopcroft_karp.cpp</a>, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">lowest_common_ancestor.cpp</a>, <a class="el" href="de/d88/travelling__salesman__problem_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">travelling_salesman_problem.cpp</a>, <a class="el" href="d4/d6c/boruvkas__minimum__spanning__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boruvkas_minimum_spanning_tree.cpp</a>, <a class="el" href="d3/d36/digit__separation_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">digit_separation.cpp</a>, <a class="el" href="df/dcb/greedy__algorithms_2dijkstra_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">dijkstra.cpp</a>, <a class="el" href="db/d80/gale__shapley_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">gale_shapley.cpp</a>, <a class="el" href="d0/d51/approximate__pi_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">approximate_pi.cpp</a>, <a class="el" href="d8/db1/binomial__calculate_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">binomial_calculate.cpp</a>, <a class="el" href="d5/df6/check__amicable__pair_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_amicable_pair.cpp</a>, <a class="el" href="d8/dd5/check__factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_factorial.cpp</a>, <a class="el" href="db/d93/check__prime_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">check_prime.cpp</a>, <a class="el" href="d5/d67/complex__numbers_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">complex_numbers.cpp</a>, <a class="el" href="d7/d89/double__factorial_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">double_factorial.cpp</a>, <a class="el" href="d9/d00/factorial_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">factorial.cpp</a>, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">least_common_multiple.cpp</a>, <a class="el" href="d9/d44/magic__number_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">magic_number.cpp</a>, <a class="el" href="d6/d42/miller__rabin_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">miller_rabin.cpp</a>, <a class="el" href="de/dab/ncr__modulo__p_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">ncr_modulo_p.cpp</a>, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">number_of_positive_divisors.cpp</a>, <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">sieve_of_eratosthenes.cpp</a>, <a class="el" href="db/d6b/kelvin__to__celsius_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">kelvin_to_celsius.cpp</a>, <a class="el" href="dc/de1/recursive__tree__traversal_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">recursive_tree_traversal.cpp</a>, <a class="el" href="d6/d2e/fenwick__tree_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">fenwick_tree.cpp</a>, <a class="el" href="d9/d02/linear__search_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">linear_search.cpp</a>, <a class="el" href="d9/dfd/comb__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">comb_sort.cpp</a>, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">insertion_sort.cpp</a>, <a class="el" href="d1/d21/quick__sort_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">quick_sort.cpp</a>, <a class="el" href="d3/d22/quick__sort__iterative_8cpp.html#a88ec9ad42717780d6caaff9d3d6977f9">quick_sort_iterative.cpp</a>, <a class="el" href="d8/d61/radix__sort2_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">radix_sort2.cpp</a>, <a class="el" href="d3/db2/boyer__moore_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">boyer_moore.cpp</a>, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#a483bb8ccf42aaf7375a83e91490eda1e">knuth_morris_pratt.cpp</a></li>
<li>TH()&#160;:&#160;<a class="el" href="db/d3c/tower__of__hanoi_8cpp.html#ab037f72a5eac476535a6cfbbcb965417">tower_of_hanoi.cpp</a></li>
<li>tolowerRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a003fb4e1b08279fe4cd50fbbc2782c2d">decimal_to_roman_numeral.cpp</a></li>
<li>toupperRoman()&#160;:&#160;<a class="el" href="de/d85/decimal__to__roman__numeral_8cpp.html#a214743638eff1336f835310049aef979">decimal_to_roman_numeral.cpp</a></li>

203
hierarchy.html
View File

@@ -133,107 +133,108 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<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="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</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="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_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/df6/class_easter_year_month_day.html" target="_self">EasterYearMonthDay</a></td><td class="desc">For IO operations </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="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></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="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_27_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">double_hashing::Entry</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="db/d19/structlinear__probing_1_1_entry.html" target="_self">linear_probing::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="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">quadratic_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="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_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="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_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="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_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="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_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/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_35_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_35_" class="arrow" onclick="dynsection.toggleFolder('35_')">&#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_35_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_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="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_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="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_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="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_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="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_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/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_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="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_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="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_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="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></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/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_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/d82/classlarge__number.html" target="_self">large_number</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="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_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="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_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="d0/dff/structlinkedlist.html" target="_self">linkedlist</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="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_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="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_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="d8/d10/structlist.html" target="_self">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="d7/da4/struct_list_node.html" target="_self">ListNode</a></td><td class="desc">For IO operations </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="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</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="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_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="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_56_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</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="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></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="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_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="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_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="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_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="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</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="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_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="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_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="db/d8b/struct_node.html" target="_self">Node&lt; ValueType &gt;</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="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_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/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_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="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_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="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_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="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_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/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_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="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_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="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></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="db/d8b/struct_node.html" target="_self">Node&lt; value_type &gt;</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="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_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="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_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="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_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="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</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="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></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/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></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="dd/d1b/structquery.html" target="_self">query</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="dc/db5/struct_queue.html" target="_self">Queue</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="db/da9/classqueue.html" target="_self">queue&lt; ValueType &gt;</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="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_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="d8/d72/class_r_btree.html" target="_self">RBtree</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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</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="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_88_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_88_" class="arrow" onclick="dynsection.toggleFolder('88_')">&#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_88_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_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/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</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/d4f/class_solution.html" target="_self">Solution</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="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_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="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_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="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_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/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_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="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_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/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></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="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_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="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_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="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_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="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_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="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_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="d2/d2c/structtower.html" target="_self">tower</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="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_104_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_104_" class="arrow" onclick="dynsection.toggleFolder('104_')">&#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_104_0_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/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_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="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_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="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_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="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></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="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_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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_110_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_110_" class="arrow" onclick="dynsection.toggleFolder('110_')">&#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_110_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_110_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_110_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_110_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_110_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_110_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_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="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_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="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_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="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_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="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></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="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_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="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_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="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_58_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_59_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</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="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_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="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_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="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_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="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</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="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_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="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_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="db/d8b/struct_node.html" target="_self">Node&lt; ValueType &gt;</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="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_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/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_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="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_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="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_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="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_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="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_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="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_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/da1/structnode.html" target="_self">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="db/d8b/struct_node.html" target="_self">Node&lt; value_type &gt;</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="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_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="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_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="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_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="d7/d48/structgeometry_1_1grahamscan_1_1_point.html" target="_self">geometry::grahamscan::Point</a></td><td class="desc"></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="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></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="d8/dc8/struct_point.html" target="_self">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="dd/d1b/structquery.html" target="_self">query</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="dc/db5/struct_queue.html" target="_self">Queue</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="db/da9/classqueue.html" target="_self">queue&lt; ValueType &gt;</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="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_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="d8/d72/class_r_btree.html" target="_self">RBtree</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="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</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="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_89_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_89_" class="arrow" onclick="dynsection.toggleFolder('89_')">&#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_89_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_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/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</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/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_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="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_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="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_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/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_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="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_97_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></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="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_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="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_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="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_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="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_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="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_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="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_104_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_105_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_105_" class="arrow" onclick="dynsection.toggleFolder('105_')">&#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_105_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_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="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_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="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_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="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></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="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_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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_111_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_111_" class="arrow" onclick="dynsection.toggleFolder('111_')">&#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_111_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_111_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_111_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_111_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_111_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_111_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_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="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_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="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_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="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

@@ -22,6 +22,7 @@ var hierarchy =
[ "others::Cache::D_Node< T >", "de/d21/classothers_1_1_cache_1_1_d___node.html", null ],
[ "others::Cache::D_Node< K, V >", "de/d21/classothers_1_1_cache_1_1_d___node.html", null ],
[ "machine_learning::neural_network::layers::DenseLayer", "dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html", null ],
[ "greedy_algorithms::DigitSeparation", "da/d49/classgreedy__algorithms_1_1_digit_separation.html", null ],
[ "double_linked_list", "d9/dee/classdouble__linked__list.html", null ],
[ "dsu", "dd/d1f/classdsu.html", null ],
[ "EasterYearMonthDay", "d1/df6/class_easter_year_month_day.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="$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_100.md5
View File

@@ -1 +1 @@
717e385118aaa4f551bc0a7a0954681d
ff0be17deb0c0dfb25090b34c2c7d14f

10
inherit_graph_100.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- 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_101.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_101.md5
View File

@@ -1 +1 @@
f583284f2e396e0f7b5fd8bccf0bb840
717e385118aaa4f551bc0a7a0954681d

10
inherit_graph_101.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- 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_102.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_102.md5
View File

@@ -1 +1 @@
adf4423c975497d5fe67f2bb0728f9b9
f583284f2e396e0f7b5fd8bccf0bb840

10
inherit_graph_102.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- 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_103.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_103.md5
View File

@@ -1 +1 @@
efb55af1cccef519836d4c2436ccda42
adf4423c975497d5fe67f2bb0728f9b9

4
inherit_graph_103.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_104.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_104.md5
View File

@@ -1 +1 @@
53ba32e546959cac79e584e353db1db7
efb55af1cccef519836d4c2436ccda42

122
inherit_graph_104.svg
View File

@@ -4,126 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- 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

14
inherit_graph_105.map
View File

@@ -1,3 +1,15 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="5,5,149,46"/>
<area shape="rect" id="Node000000" 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"/>
</map>

2
inherit_graph_105.md5
View File

@@ -1 +1 @@
d6ee5f042479b5982faa79c9932e1b9c
53ba32e546959cac79e584e353db1db7

123
inherit_graph_105.svg
View File

@@ -4,17 +4,126 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="116pt" height="39pt"
viewBox="0.00 0.00 115.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<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)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_top" xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
<polygon fill="white" stroke="#666666" points="107.5,-30.5 0,-30.5 0,0 107.5,0 107.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
<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"/>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 6.3 KiB

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="$da/d86/struct_test_case.html" title="represents single example inputs and expected output of the function longest_common_string_length" alt="" coords="5,5,83,31"/>
<area shape="rect" id="Node000000" href="$dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" title="A structure representing all the data we need to search the preprocessed pattern in text." alt="" coords="5,5,149,46"/>
</map>

2
inherit_graph_106.md5
View File

@@ -1 +1 @@
abd7e48c602c9ba41e00a619e3234e23
d6ee5f042479b5982faa79c9932e1b9c

13
inherit_graph_106.svg
View File

@@ -4,16 +4,17 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="66pt" height="27pt"
viewBox="0.00 0.00 66.00 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<svg width="116pt" height="39pt"
viewBox="0.00 0.00 115.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="da/d86/struct_test_case.html" target="_top" xlink:title="represents single example inputs and expected output of the function longest_common_string_length">
<polygon fill="white" stroke="#666666" points="58,-19.25 0,-19.25 0,0 58,0 58,-19.25"/>
<text text-anchor="middle" x="29" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">TestCase</text>
<g id="a_Node000000"><a xlink:href="dd/d5a/structstrings_1_1boyer__moore_1_1pattern.html" target="_top" xlink:title="A structure representing all the data we need to search the preprocessed pattern in text.">
<polygon fill="white" stroke="#666666" points="107.5,-30.5 0,-30.5 0,0 107.5,0 107.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">strings::boyer_moore</text>
<text text-anchor="middle" x="53.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::pattern</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_107.map
View File

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

2
inherit_graph_107.md5
View File

@@ -1 +1 @@
a9d8d2a80cdf35dfac76eecdbb209456
abd7e48c602c9ba41e00a619e3234e23

10
inherit_graph_107.svg
View File

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

Before

Width:  |  Height:  |  Size: 986 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_108.map
View File

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

2
inherit_graph_108.md5
View File

@@ -1 +1 @@
76f1c23145670e75e2e13d0451b74420
a9d8d2a80cdf35dfac76eecdbb209456

10
inherit_graph_108.svg
View File

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

Before

Width:  |  Height:  |  Size: 922 B

After

Width:  |  Height:  |  Size: 986 B

2
inherit_graph_109.map
View File

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

2
inherit_graph_109.md5
View File

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

10
inherit_graph_109.svg
View File

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

Before

Width:  |  Height:  |  Size: 929 B

After

Width:  |  Height:  |  Size: 922 B

2
inherit_graph_110.map
View File

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

2
inherit_graph_110.md5
View File

@@ -1 +1 @@
a8666508fe9ca12fb7281895f580da44
845eae9f7c70e50cf22fb926bd9e034b

10
inherit_graph_110.svg
View File

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

Before

Width:  |  Height:  |  Size: 957 B

After

Width:  |  Height:  |  Size: 929 B

2
inherit_graph_111.map
View File

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

2
inherit_graph_111.md5
View File

@@ -1 +1 @@
eed75a69314afbb385b920f554ca3c5d
a8666508fe9ca12fb7281895f580da44

10
inherit_graph_111.svg
View File

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

Before

Width:  |  Height:  |  Size: 979 B

After

Width:  |  Height:  |  Size: 957 B

2
inherit_graph_112.map
View File

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

2
inherit_graph_112.md5
View File

@@ -1 +1 @@
805bd0d28e53f8af03d7b4e5906cc299
eed75a69314afbb385b920f554ca3c5d

4
inherit_graph_112.svg
View File

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

Before

Width:  |  Height:  |  Size: 979 B

After

Width:  |  Height:  |  Size: 979 B

3
inherit_graph_113.map Normal file
View File

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

1
inherit_graph_113.md5 Normal file
View File

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

21
inherit_graph_113.svg Normal file
View File

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

After

Width:  |  Height:  |  Size: 979 B

2
inherit_graph_46.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" title="Wrapper class for storing a graph." alt="" coords="5,5,141,46"/>
<area shape="rect" id="Node000000" href="$da/d49/classgreedy__algorithms_1_1_digit_separation.html" title="A class that provides methods to separate the digits of a large positive number." alt="" coords="5,5,141,46"/>
</map>

2
inherit_graph_46.md5
View File

@@ -1 +1 @@
eacbeee425b4f9f6a77295d74c2f76dd
d49275e311f6a88b3379b5c0836eca80

4
inherit_graph_46.svg
View File

@@ -11,10 +11,10 @@
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" target="_top" xlink:title="Wrapper class for storing a graph.">
<g id="a_Node000000"><a xlink:href="da/d49/classgreedy__algorithms_1_1_digit_separation.html" target="_top" xlink:title="A class that provides methods to separate the digits of a large positive number.">
<polygon fill="white" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dijkstra::Graph</text>
<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">DigitSeparation</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_47.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$dd/d1c/classhash__chain.html" title="Chain class with a given modulus." alt="" coords="5,5,93,31"/>
<area shape="rect" id="Node000000" href="$d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" title="Wrapper class for storing a graph." alt="" coords="5,5,141,46"/>
</map>

2
inherit_graph_47.md5
View File

@@ -1 +1 @@
5f49bba0e53577a5b75cb5973529bade
eacbeee425b4f9f6a77295d74c2f76dd

13
inherit_graph_47.svg
View File

@@ -4,16 +4,17 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="74pt" height="27pt"
viewBox="0.00 0.00 73.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)">
<svg width="110pt" height="39pt"
viewBox="0.00 0.00 109.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="dd/d1c/classhash__chain.html" target="_top" xlink:title="Chain class with a given modulus.">
<polygon fill="white" stroke="#666666" points="65.5,-19.25 0,-19.25 0,0 65.5,0 65.5,-19.25"/>
<text text-anchor="middle" x="32.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain</text>
<g id="a_Node000000"><a xlink:href="d2/daa/classgreedy__algorithms_1_1dijkstra_1_1_graph.html" target="_top" xlink:title="Wrapper class for storing a graph.">
<polygon fill="white" stroke="#666666" points="101.5,-30.5 0,-30.5 0,0 101.5,0 101.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">greedy_algorithms::</text>
<text text-anchor="middle" x="50.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">dijkstra::Graph</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 973 B

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_48.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d6/d84/classhashing_1_1sha256_1_1_hash.html" title="Contains hash array and functions to update it and convert it to a hexadecimal string." alt="" coords="5,5,161,31"/>
<area shape="rect" id="Node000000" href="$dd/d1c/classhash__chain.html" title="Chain class with a given modulus." alt="" coords="5,5,93,31"/>
</map>

2
inherit_graph_48.md5
View File

@@ -1 +1 @@
6c9571951ecc9353af9c005c0b55ccb6
5f49bba0e53577a5b75cb5973529bade

10
inherit_graph_48.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="125pt" height="27pt"
viewBox="0.00 0.00 124.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="74pt" height="27pt"
viewBox="0.00 0.00 73.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="d6/d84/classhashing_1_1sha256_1_1_hash.html" target="_top" xlink:title="Contains hash array and functions to update it and convert it to a hexadecimal string.">
<polygon fill="white" stroke="#666666" points="116.5,-19.25 0,-19.25 0,0 116.5,0 116.5,-19.25"/>
<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::Hash</text>
<g id="a_Node000000"><a xlink:href="dd/d1c/classhash__chain.html" target="_top" xlink:title="Chain class with a given modulus.">
<polygon fill="white" stroke="#666666" points="65.5,-19.25 0,-19.25 0,0 65.5,0 65.5,-19.25"/>
<text text-anchor="middle" x="32.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 973 B

2
inherit_graph_49.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$db/d66/struct_item.html" title=" " alt="" coords="5,5,53,31"/>
<area shape="rect" id="Node000000" href="$d6/d84/classhashing_1_1sha256_1_1_hash.html" title="Contains hash array and functions to update it and convert it to a hexadecimal string." alt="" coords="5,5,161,31"/>
</map>

2
inherit_graph_49.md5
View File

@@ -1 +1 @@
59139005b32506728fd8d3323cc419fc
6c9571951ecc9353af9c005c0b55ccb6

10
inherit_graph_49.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="44pt" height="27pt"
viewBox="0.00 0.00 43.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="125pt" height="27pt"
viewBox="0.00 0.00 124.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="db/d66/struct_item.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="35.5,-19.25 0,-19.25 0,0 35.5,0 35.5,-19.25"/>
<text text-anchor="middle" x="17.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Item</text>
<g id="a_Node000000"><a xlink:href="d6/d84/classhashing_1_1sha256_1_1_hash.html" target="_top" xlink:title="Contains hash array and functions to update it and convert it to a hexadecimal string.">
<polygon fill="white" stroke="#666666" points="116.5,-19.25 0,-19.25 0,0 116.5,0 116.5,-19.25"/>
<text text-anchor="middle" x="58.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">hashing::sha256::Hash</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 930 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_50.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$db/d82/classlarge__number.html" title=" " alt="" coords="5,5,105,31"/>
<area shape="rect" id="Node000000" href="$db/d66/struct_item.html" title=" " alt="" coords="5,5,53,31"/>
</map>

2
inherit_graph_50.md5
View File

@@ -1 +1 @@
1c1c2c26230468d96731424183714320
59139005b32506728fd8d3323cc419fc

10
inherit_graph_50.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="83pt" height="27pt"
viewBox="0.00 0.00 82.50 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="44pt" height="27pt"
viewBox="0.00 0.00 43.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="db/d82/classlarge__number.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="74.5,-19.25 0,-19.25 0,0 74.5,0 74.5,-19.25"/>
<text text-anchor="middle" x="37.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number</text>
<g id="a_Node000000"><a xlink:href="db/d66/struct_item.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="35.5,-19.25 0,-19.25 0,0 35.5,0 35.5,-19.25"/>
<text text-anchor="middle" x="17.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">Item</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 945 B

After

Width:  |  Height:  |  Size: 930 B

2
inherit_graph_51.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$db/d19/structlinear__probing_1_1_entry.html" title=" " alt="" coords="5,5,146,31"/>
<area shape="rect" id="Node000000" href="$db/d82/classlarge__number.html" title=" " alt="" coords="5,5,105,31"/>
</map>

2
inherit_graph_51.md5
View File

@@ -1 +1 @@
aec2bb5e51f511ef7811875e5b768be0
1c1c2c26230468d96731424183714320

10
inherit_graph_51.svg
View File

@@ -4,16 +4,16 @@
<!-- Generated by graphviz version 12.1.1 (20240910.0053)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="113pt" height="27pt"
viewBox="0.00 0.00 113.25 27.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="83pt" height="27pt"
viewBox="0.00 0.00 82.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="db/d19/structlinear__probing_1_1_entry.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="105.25,-19.25 0,-19.25 0,0 105.25,0 105.25,-19.25"/>
<text text-anchor="middle" x="52.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">linear_probing::Entry</text>
<g id="a_Node000000"><a xlink:href="db/d82/classlarge__number.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="74.5,-19.25 0,-19.25 0,0 74.5,0 74.5,-19.25"/>
<text text-anchor="middle" x="37.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">large_number</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 975 B

After

Width:  |  Height:  |  Size: 945 B

2
inherit_graph_52.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d0/dff/structlinkedlist.html" title=" " alt="" coords="5,5,78,31"/>
<area shape="rect" id="Node000000" href="$db/d19/structlinear__probing_1_1_entry.html" title=" " alt="" coords="5,5,146,31"/>
</map>

2
inherit_graph_52.md5
View File

@@ -1 +1 @@
8e83f7de99c4092cec0ef9a67422e9cf
aec2bb5e51f511ef7811875e5b768be0

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