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

Documentation for 54a20b447e

Browse Source
This commit is contained in:
realstealthninja
2024-09-01 04:39:22 +00:00
parent 0e621dc6a3
commit 2a5773d8eb
339 changed files with 3051 additions and 1676 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
annotated.html
View File

@@ -141,7 +141,8 @@ $(function(){initNavTree('annotated.html',''); initResizable(true); });
<tr id="row_2_10_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_2_11_" class="odd" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html" target="_self">SegmentTree</a></td><td class="desc">Class representation of the segment tree </td></tr>
<tr id="row_2_12_" 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="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">SkipList</a></td><td class="desc"></td></tr>
<tr id="row_2_13_" 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/d3e/classdata__structures_1_1trie.html" target="_self">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_2_13_" 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/dc8/classdata__structures_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Class representation of a stack </td></tr>
<tr id="row_2_14_" 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/d3e/classdata__structures_1_1trie.html" target="_self">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_3_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="dynsection.toggleFolder('3_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/dba/namespacedivide__and__conquer.html" target="_self">divide_and_conquer</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_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_3_0_" class="arrow" onclick="dynsection.toggleFolder('3_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>strassens_multiplication</b></td><td class="desc"></td></tr>
<tr id="row_3_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="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" target="_self">Matrix</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>

1
annotated_dup.js
View File

@@ -42,6 +42,7 @@ var annotated_dup =
[ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ],
[ "SegmentTree", "dd/d95/classdata__structures_1_1_segment_tree.html", "dd/d95/classdata__structures_1_1_segment_tree" ],
[ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ],
[ "Stack", "d2/dc8/classdata__structures_1_1_stack.html", "d2/dc8/classdata__structures_1_1_stack" ],
[ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ]
] ],
[ "divide_and_conquer", "dd/dba/namespacedivide__and__conquer.html", [

2
classes.html
View File

@@ -159,7 +159,7 @@ $(function(){initNavTree('classes.html',''); initResizable(true); });
<dd><a class="el" href="d8/d72/class_r_btree.html">RBtree</a></dd><dd><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a id="letter_S" name="letter_S">S</a></dt>
<dd><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a></dd><dd><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d4f/class_solution.html">Solution</a></dd><dd><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">Sparse_table</a> (data_structures::sparse_table)</dd><dd><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">Stack</a> (data_structures::stack_using_queue)</dd><dd><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> (others::postfix_expression)</dd><dd><a class="el" href="d1/dc2/classstack.html">stack</a></dd><dd><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a></dd><dd><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd><dd><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd></dl>
<dd><a class="el" href="d4/db4/struct_segment_intersection.html">SegmentIntersection</a></dd><dd><a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html">SG</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d4f/class_solution.html">Solution</a></dd><dd><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html">Sparse_table</a> (data_structures::sparse_table)</dd><dd><a class="el" href="d2/dc8/classdata__structures_1_1_stack.html">Stack</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html">Stack</a> (data_structures::stack_using_queue)</dd><dd><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html">Stack</a> (others::postfix_expression)</dd><dd><a class="el" href="d1/dc2/classstack.html">stack</a></dd><dd><a class="el" href="d2/dc4/classstack__linked_list.html">stack_linkedList</a></dd><dd><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html">stats_computer1</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd><dd><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html">stats_computer2</a> (<a class="el" href="d2/dcf/namespacestatistics.html">statistics</a>)</dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a id="letter_T" name="letter_T">T</a></dt>
<dd><a class="el" href="da/d86/struct_test_case.html">TestCase</a></dd><dd><a class="el" href="d5/d58/class_test_cases.html">TestCases</a></dd><dd><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html">Tnode</a> (operations_on_datastructures::trie_operations)</dd><dd><a class="el" href="d2/d2c/structtower.html">tower</a></dd><dd><a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html">Treap</a> (<a class="el" href="dd/d2e/namespacedata__structures_1_1treap.html">data_structures::treap</a>)</dd><dd><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a> (range_queries::heavy_light_decomposition)</dd><dd><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html">Tree234</a> (data_structures::tree_234)</dd><dd><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html">Trie</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="dd/d2f/class_trie.html">Trie</a></dd><dd><a class="el" href="d0/d3e/classdata__structures_1_1trie.html">trie</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="de/d48/struct_trie_1_1_trie_node.html">Trie::TrieNode</a></dd></dl>

517
d2/dc8/classdata__structures_1_1_stack.html Normal file
View File

@@ -0,0 +1,517 @@
<!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++: data_structures::Stack&lt; T &gt; Class Template 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('d2/dc8/classdata__structures_1_1_stack.html','../../'); initResizable(true); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../d3/d25/classdata__structures_1_1_stack-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">data_structures::Stack&lt; T &gt; Class Template Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Class representation of a stack.
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for data_structures::Stack&lt; T &gt;:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/d11/classdata__structures_1_1_stack__coll__graph.svg" width="196" height="214"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a8cb0602c8a9c1603d0315938177ecc6a" id="r_a8cb0602c8a9c1603d0315938177ecc6a"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8cb0602c8a9c1603d0315938177ecc6a">Stack</a> (int size)</td></tr>
<tr class="memdesc:a8cb0602c8a9c1603d0315938177ecc6a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructs a new <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> object. <br /></td></tr>
<tr class="separator:a8cb0602c8a9c1603d0315938177ecc6a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa753346c8ee5f21d4f4482398fe6d5c1" id="r_aa753346c8ee5f21d4f4482398fe6d5c1"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa753346c8ee5f21d4f4482398fe6d5c1">full</a> () const</td></tr>
<tr class="memdesc:aa753346c8ee5f21d4f4482398fe6d5c1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if the stack is full. <br /></td></tr>
<tr class="separator:aa753346c8ee5f21d4f4482398fe6d5c1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a04e2e7cb58b2de6d3a15053bfaaf6080" id="r_a04e2e7cb58b2de6d3a15053bfaaf6080"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a> () const</td></tr>
<tr class="memdesc:a04e2e7cb58b2de6d3a15053bfaaf6080"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if the stack is empty. <br /></td></tr>
<tr class="separator:a04e2e7cb58b2de6d3a15053bfaaf6080"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa9f9b087e9e7c00628e1289f0f1de3b2" id="r_aa9f9b087e9e7c00628e1289f0f1de3b2"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa9f9b087e9e7c00628e1289f0f1de3b2">push</a> (T element)</td></tr>
<tr class="memdesc:aa9f9b087e9e7c00628e1289f0f1de3b2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pushes an element onto the stack. <br /></td></tr>
<tr class="separator:aa9f9b087e9e7c00628e1289f0f1de3b2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac46842bdd9c655d84f865fa3a03da19b" id="r_ac46842bdd9c655d84f865fa3a03da19b"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac46842bdd9c655d84f865fa3a03da19b">pop</a> ()</td></tr>
<tr class="memdesc:ac46842bdd9c655d84f865fa3a03da19b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pops an element from the stack. <br /></td></tr>
<tr class="separator:ac46842bdd9c655d84f865fa3a03da19b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abb86ed67d9d97112897a09cfb10ff586" id="r_abb86ed67d9d97112897a09cfb10ff586"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abb86ed67d9d97112897a09cfb10ff586">show</a> () const</td></tr>
<tr class="memdesc:abb86ed67d9d97112897a09cfb10ff586"><td class="mdescLeft">&#160;</td><td class="mdescRight">Displays all elements in the stack. <br /></td></tr>
<tr class="separator:abb86ed67d9d97112897a09cfb10ff586"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a61dc70e128ee64c9684f03a4c04818b0" id="r_a61dc70e128ee64c9684f03a4c04818b0"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a61dc70e128ee64c9684f03a4c04818b0">topmost</a> () const</td></tr>
<tr class="memdesc:a61dc70e128ee64c9684f03a4c04818b0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Displays the topmost element of the stack. <br /></td></tr>
<tr class="separator:a61dc70e128ee64c9684f03a4c04818b0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2ac469fcc2229d273450e429139d90e6" id="r_a2ac469fcc2229d273450e429139d90e6"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2ac469fcc2229d273450e429139d90e6">bottom</a> () const</td></tr>
<tr class="memdesc:a2ac469fcc2229d273450e429139d90e6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Displays the bottom element of the stack. <br /></td></tr>
<tr class="separator:a2ac469fcc2229d273450e429139d90e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a3f912a0e9bed5b24b206584e3010dce3" id="r_a3f912a0e9bed5b24b206584e3010dce3"><td class="memItemLeft" align="right" valign="top"><a id="a3f912a0e9bed5b24b206584e3010dce3" name="a3f912a0e9bed5b24b206584e3010dce3"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; T[]&gt;&#160;</td><td class="memItemRight" valign="bottom"><b>stack</b></td></tr>
<tr class="memdesc:a3f912a0e9bed5b24b206584e3010dce3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Smart pointer to the stack array. <br /></td></tr>
<tr class="separator:a3f912a0e9bed5b24b206584e3010dce3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a88a10062c0662a385f172669f2f19b86" id="r_a88a10062c0662a385f172669f2f19b86"><td class="memItemLeft" align="right" valign="top"><a id="a88a10062c0662a385f172669f2f19b86" name="a88a10062c0662a385f172669f2f19b86"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>stackSize</b></td></tr>
<tr class="memdesc:a88a10062c0662a385f172669f2f19b86"><td class="mdescLeft">&#160;</td><td class="mdescRight">Maximum size of the stack. <br /></td></tr>
<tr class="separator:a88a10062c0662a385f172669f2f19b86"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a71afc94746d47fb2c0c4fa4b612edee6" id="r_a71afc94746d47fb2c0c4fa4b612edee6"><td class="memItemLeft" align="right" valign="top"><a id="a71afc94746d47fb2c0c4fa4b612edee6" name="a71afc94746d47fb2c0c4fa4b612edee6"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>stackIndex</b></td></tr>
<tr class="memdesc:a71afc94746d47fb2c0c4fa4b612edee6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index pointing to the top element of the stack. <br /></td></tr>
<tr class="separator:a71afc94746d47fb2c0c4fa4b612edee6"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><div class="compoundTemplParams">template&lt;typename T&gt;<br />
class data_structures::Stack&lt; T &gt;</div><p>Class representation of a stack. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">T</td><td>The type of the elements in the stack </td></tr>
</table>
</dd>
</dl>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a8cb0602c8a9c1603d0315938177ecc6a" name="a8cb0602c8a9c1603d0315938177ecc6a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8cb0602c8a9c1603d0315938177ecc6a">&#9670;&#160;</a></span>Stack()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::Stack </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>size</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>Constructs a new <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> object. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">size</td><td>Maximum size of the stack </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 28</span>: <a class="code hl_variable" href="#a88a10062c0662a385f172669f2f19b86">stackSize</a>(size), <a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>(-1), <a class="code hl_variable" href="#a3f912a0e9bed5b24b206584e3010dce3">stack</a>(<span class="keyword">new</span> T[size]) {}</div>
<div class="ttc" id="aclassdata__structures_1_1_stack_html_a3f912a0e9bed5b24b206584e3010dce3"><div class="ttname"><a href="#a3f912a0e9bed5b24b206584e3010dce3">data_structures::Stack::stack</a></div><div class="ttdeci">std::unique_ptr&lt; T[]&gt; stack</div><div class="ttdoc">Smart pointer to the stack array.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:18</div></div>
<div class="ttc" id="aclassdata__structures_1_1_stack_html_a71afc94746d47fb2c0c4fa4b612edee6"><div class="ttname"><a href="#a71afc94746d47fb2c0c4fa4b612edee6">data_structures::Stack::stackIndex</a></div><div class="ttdeci">int stackIndex</div><div class="ttdoc">Index pointing to the top element of the stack.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:20</div></div>
<div class="ttc" id="aclassdata__structures_1_1_stack_html_a88a10062c0662a385f172669f2f19b86"><div class="ttname"><a href="#a88a10062c0662a385f172669f2f19b86">data_structures::Stack::stackSize</a></div><div class="ttdeci">int stackSize</div><div class="ttdoc">Maximum size of the stack.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:19</div></div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="a2ac469fcc2229d273450e429139d90e6" name="a2ac469fcc2229d273450e429139d90e6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2ac469fcc2229d273450e429139d90e6">&#9670;&#160;</a></span>bottom()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">T <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::bottom </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></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>Displays the bottom element of the stack. </p>
<dl class="section return"><dt>Returns</dt><dd>The bottom element of the stack </dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
<table class="exception">
<tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a></td><td>if the stack is empty </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 97</span> {</div>
<div class="line"><span class="lineno"> 98</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
<div class="line"><span class="lineno"> 100</span> }</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[0];</div>
<div class="line"><span class="lineno"> 102</span> }</div>
<div class="ttc" id="aclassdata__structures_1_1_stack_html_a04e2e7cb58b2de6d3a15053bfaaf6080"><div class="ttname"><a href="#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack::empty</a></div><div class="ttdeci">bool empty() const</div><div class="ttdoc">Checks if the stack is empty.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:41</div></div>
<div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdoc">for std::invalid_argument</div><div class="ttdef"><b>Definition</b> stack.hpp:19</div></div>
<div class="ttc" id="aout_of_range_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</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="../../d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.svg" width="366" height="52"><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="a04e2e7cb58b2de6d3a15053bfaaf6080" name="a04e2e7cb58b2de6d3a15053bfaaf6080"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a04e2e7cb58b2de6d3a15053bfaaf6080">&#9670;&#160;</a></span>empty()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::empty </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></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>Checks if the stack is empty. </p>
<dl class="section return"><dt>Returns</dt><dd>true if the stack is empty, false otherwise </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 41</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a> == -1; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="aa753346c8ee5f21d4f4482398fe6d5c1" name="aa753346c8ee5f21d4f4482398fe6d5c1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa753346c8ee5f21d4f4482398fe6d5c1">&#9670;&#160;</a></span>full()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::full </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></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>Checks if the stack is full. </p>
<dl class="section return"><dt>Returns</dt><dd>true if the stack is full, false otherwise </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 35</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a> == <a class="code hl_variable" href="#a88a10062c0662a385f172669f2f19b86">stackSize</a> - 1; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ac46842bdd9c655d84f865fa3a03da19b" name="ac46842bdd9c655d84f865fa3a03da19b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac46842bdd9c655d84f865fa3a03da19b">&#9670;&#160;</a></span>pop()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">T <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::pop </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>Pops an element from the stack. </p>
<dl class="section return"><dt>Returns</dt><dd>The popped element </dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
<table class="exception">
<tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a></td><td>if the stack is empty </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
<div class="line"><span class="lineno"> 65</span> }</div>
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>--];</div>
<div class="line"><span class="lineno"> 67</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.svg" width="395" height="52"><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="aa9f9b087e9e7c00628e1289f0f1de3b2" name="aa9f9b087e9e7c00628e1289f0f1de3b2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa9f9b087e9e7c00628e1289f0f1de3b2">&#9670;&#160;</a></span>push()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::push </td>
<td>(</td>
<td class="paramtype">T</td> <td class="paramname"><span class="paramname"><em>element</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>Pushes an element onto the stack. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">element</td><td>Element to push onto the stack </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 48</span> {</div>
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#aa753346c8ee5f21d4f4482398fe6d5c1">full</a>()) {</div>
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Stack overflow&quot;</span>);</div>
<div class="line"><span class="lineno"> 51</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 52</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[++<a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>] = element;</div>
<div class="line"><span class="lineno"> 53</span> }</div>
<div class="line"><span class="lineno"> 54</span> }</div>
<div class="ttc" id="aclassdata__structures_1_1_stack_html_aa753346c8ee5f21d4f4482398fe6d5c1"><div class="ttname"><a href="#aa753346c8ee5f21d4f4482398fe6d5c1">data_structures::Stack::full</a></div><div class="ttdeci">bool full() const</div><div class="ttdoc">Checks if the stack is full.</div><div class="ttdef"><b>Definition</b> stack_using_array.cpp:35</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="../../d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.svg" width="366" height="52"><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="abb86ed67d9d97112897a09cfb10ff586" name="abb86ed67d9d97112897a09cfb10ff586"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abb86ed67d9d97112897a09cfb10ff586">&#9670;&#160;</a></span>show()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::show </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></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>Displays all elements in the stack. </p>
<div class="fragment"><div class="line"><span class="lineno"> 72</span> {</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt;= <a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>; i++) {</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[i] &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 75</span> }</div>
<div class="line"><span class="lineno"> 76</span> }</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a61dc70e128ee64c9684f03a4c04818b0" name="a61dc70e128ee64c9684f03a4c04818b0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a61dc70e128ee64c9684f03a4c04818b0">&#9670;&#160;</a></span>topmost()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">T <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack</a>&lt; T &gt;::topmost </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></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>Displays the topmost element of the stack. </p>
<dl class="section return"><dt>Returns</dt><dd>The topmost element of the stack </dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
<table class="exception">
<tr><td class="paramname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a></td><td>if the stack is empty </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 84</span> {</div>
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>()) {</div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>(<span class="stringliteral">&quot;Stack underflow&quot;</span>);</div>
<div class="line"><span class="lineno"> 87</span> }</div>
<div class="line"><span class="lineno"> 88</span> <span class="keywordflow">return</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>[<a class="code hl_variable" href="#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a>];</div>
<div class="line"><span class="lineno"> 89</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.svg" width="366" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>data_structures/<b>stack_using_array.cpp</b></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="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">Stack</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>

14
d2/dc8/classdata__structures_1_1_stack.js Normal file
View File

@@ -0,0 +1,14 @@
var classdata__structures_1_1_stack =
[
[ "Stack", "d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a", null ],
[ "bottom", "d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6", null ],
[ "empty", "d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080", null ],
[ "full", "d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1", null ],
[ "pop", "d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b", null ],
[ "push", "d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2", null ],
[ "show", "d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586", null ],
[ "topmost", "d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0", null ],
[ "stack", "d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3", null ],
[ "stackIndex", "d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6", null ],
[ "stackSize", "d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86", null ]
];

5
d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="data_structures::Stack::bottom" name="data_structures::Stack::bottom">
<area shape="rect" id="Node000001" title="Displays the bottom element of the stack." alt="" coords="5,5,159,46"/>
<area shape="rect" id="Node000002" href="$d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" title="Checks if the stack is empty." alt="" coords="207,5,360,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
</map>

1
d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
512dee9322fc30c83b03c7723d356ea5

67
d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph.svg Normal file
View File

@@ -0,0 +1,67 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack::bottom Pages: 1 -->
<svg width="274pt" height="39pt"
viewBox="0.00 0.00 274.00 38.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 34.5)">
<title>data_structures::Stack::bottom</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Displays the bottom element of the stack.">
<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::bottom</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</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="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
</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: 2.7 KiB

41
d2/dc8/classdata__structures_1_1_stack_a2ac469fcc2229d273450e429139d90e6_cgraph_org.svg Normal file
View File

@@ -0,0 +1,41 @@
<?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.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack::bottom Pages: 1 -->
<svg width="274pt" height="39pt"
viewBox="0.00 0.00 274.00 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>data_structures::Stack::bottom</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Displays the bottom element of the stack.">
<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::bottom</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</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="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.0 KiB

5
d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="data_structures::Stack::topmost" name="data_structures::Stack::topmost">
<area shape="rect" id="Node000001" title="Displays the topmost element of the stack." alt="" coords="5,5,159,46"/>
<area shape="rect" id="Node000002" href="$d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" title="Checks if the stack is empty." alt="" coords="207,5,360,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
</map>

1
d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
0bf4679a8dd8bec2876299055859fed6

67
d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph.svg Normal file
View File

@@ -0,0 +1,67 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack::topmost Pages: 1 -->
<svg width="274pt" height="39pt"
viewBox="0.00 0.00 274.00 38.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 34.5)">
<title>data_structures::Stack::topmost</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Displays the topmost element of the stack.">
<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::topmost</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</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="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
</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: 2.8 KiB

41
d2/dc8/classdata__structures_1_1_stack_a61dc70e128ee64c9684f03a4c04818b0_cgraph_org.svg Normal file
View File

@@ -0,0 +1,41 @@
<?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.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack::topmost Pages: 1 -->
<svg width="274pt" height="39pt"
viewBox="0.00 0.00 274.00 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>data_structures::Stack::topmost</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Displays the topmost element of the stack.">
<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::topmost</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</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="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.0 KiB

5
d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="data_structures::Stack::push" name="data_structures::Stack::push">
<area shape="rect" id="Node000001" title="Pushes an element onto the stack." alt="" coords="5,5,159,46"/>
<area shape="rect" id="Node000002" href="$d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1" title="Checks if the stack is full." alt="" coords="207,5,360,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,23,191,23,191,28,159,28"/>
</map>

1
d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
04111dff9752fdbb83c636f658bb2c4c

67
d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph.svg Normal file
View File

@@ -0,0 +1,67 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack::push Pages: 1 -->
<svg width="274pt" height="39pt"
viewBox="0.00 0.00 274.00 38.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 34.5)">
<title>data_structures::Stack::push</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Pushes an element onto the stack.">
<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1" target="_top" xlink:title="Checks if the stack is full.">
<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::full</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="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
</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: 2.7 KiB

41
d2/dc8/classdata__structures_1_1_stack_aa9f9b087e9e7c00628e1289f0f1de3b2_cgraph_org.svg Normal file
View File

@@ -0,0 +1,41 @@
<?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.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack::push Pages: 1 -->
<svg width="274pt" height="39pt"
viewBox="0.00 0.00 274.00 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>data_structures::Stack::push</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Pushes an element onto the stack.">
<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::push</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1" target="_top" xlink:title="Checks if the stack is full.">
<polygon fill="white" stroke="#666666" points="266,-30.5 151,-30.5 151,0 266,0 266,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="208.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::full</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="M115.26,-15.25C123.19,-15.25 131.42,-15.25 139.53,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.39,-18.75 149.39,-15.25 139.39,-11.75 139.39,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.0 KiB

5
d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="data_structures::Stack::pop" name="data_structures::Stack::pop">
<area shape="rect" id="Node000001" title="Pops an element from the stack." alt="" coords="5,13,188,38"/>
<area shape="rect" id="Node000002" href="$d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" title="Checks if the stack is empty." alt="" coords="236,5,389,46"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="188,23,220,23,220,28,188,28"/>
</map>

1
d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
c0b0e361825dc1db439c164ff12ea73f

66
d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph.svg Normal file
View File

@@ -0,0 +1,66 @@
<?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.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack::pop Pages: 1 -->
<svg width="296pt" height="39pt"
viewBox="0.00 0.00 295.75 38.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 34.5)">
<title>data_structures::Stack::pop</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Pops an element from the stack.">
<polygon fill="#999999" stroke="#666666" points="136.75,-24.88 0,-24.88 0,-5.63 136.75,-5.63 136.75,-24.88"/>
<text text-anchor="middle" x="68.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack::pop</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
<polygon fill="white" stroke="#666666" points="287.75,-30.5 172.75,-30.5 172.75,0 287.75,0 287.75,-30.5"/>
<text text-anchor="start" x="180.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="230.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</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="M137.18,-15.25C145.07,-15.25 153.12,-15.25 161.02,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.92,-18.75 170.92,-15.25 160.92,-11.75 160.92,-18.75"/>
</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: 2.7 KiB

40
d2/dc8/classdata__structures_1_1_stack_ac46842bdd9c655d84f865fa3a03da19b_cgraph_org.svg Normal file
View File

@@ -0,0 +1,40 @@
<?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.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack::pop Pages: 1 -->
<svg width="296pt" height="39pt"
viewBox="0.00 0.00 295.75 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>data_structures::Stack::pop</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Pops an element from the stack.">
<polygon fill="#999999" stroke="#666666" points="136.75,-24.88 0,-24.88 0,-5.63 136.75,-5.63 136.75,-24.88"/>
<text text-anchor="middle" x="68.38" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack::pop</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080" target="_top" xlink:title="Checks if the stack is empty.">
<polygon fill="white" stroke="#666666" points="287.75,-30.5 172.75,-30.5 172.75,0 287.75,0 287.75,-30.5"/>
<text text-anchor="start" x="180.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack</text>
<text text-anchor="middle" x="230.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::empty</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="M137.18,-15.25C145.07,-15.25 153.12,-15.25 161.02,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="160.92,-18.75 170.92,-15.25 160.92,-11.75 160.92,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.9 KiB

7
d3/d11/classdata__structures_1_1_stack__coll__graph.map Normal file
View File

@@ -0,0 +1,7 @@
<map id="data_structures::Stack&lt; T &gt;" name="data_structures::Stack&lt; T &gt;">
<area shape="rect" id="Node000001" title="Class representation of a stack." alt="" coords="5,183,191,208"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/memory/unique_ptr.html" title=" " alt="" coords="26,94,170,120"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="101,135,101,182,95,182,95,135"/>
<area shape="rect" id="Node000003" title=" " alt="" coords="79,5,117,31"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="101,47,101,94,95,94,95,47"/>
</map>

1
d3/d11/classdata__structures_1_1_stack__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
e4f07cc465819f91d399e033e545f779

85
d3/d11/classdata__structures_1_1_stack__coll__graph.svg Normal file
View File

@@ -0,0 +1,85 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack&lt; T &gt; Pages: 1 -->
<svg width="147pt" height="160pt"
viewBox="0.00 0.00 147.00 160.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 156.25)">
<title>data_structures::Stack&lt; T &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Class representation of a stack.">
<polygon fill="#999999" stroke="#666666" points="139,-19.25 0,-19.25 0,0 139,0 139,-19.25"/>
<text text-anchor="middle" x="69.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack&lt; T &gt;</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="123.25,-85.75 15.75,-85.75 15.75,-66.5 123.25,-66.5 123.25,-85.75"/>
<text text-anchor="middle" x="69.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; T[]&gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M69.5,-54.65C69.5,-42.82 69.5,-28.54 69.5,-19.52"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="66,-54.64 69.5,-64.64 73,-54.64 66,-54.64"/>
</a>
</g>
<text text-anchor="middle" x="83" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> stack</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="83.9,-152.25 55.1,-152.25 55.1,-133 83.9,-133 83.9,-152.25"/>
<text text-anchor="middle" x="69.5" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M69.5,-121.15C69.5,-109.32 69.5,-95.04 69.5,-86.02"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="66,-121.14 69.5,-131.14 73,-121.14 66,-121.14"/>
</a>
</g>
<text text-anchor="middle" x="76.62" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.5 KiB

59
d3/d11/classdata__structures_1_1_stack__coll__graph_org.svg Normal file
View File

@@ -0,0 +1,59 @@
<?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.0 (20240811.2233)
-->
<!-- Title: data_structures::Stack&lt; T &gt; Pages: 1 -->
<svg width="147pt" height="160pt"
viewBox="0.00 0.00 147.00 160.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 156.25)">
<title>data_structures::Stack&lt; T &gt;</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Class representation of a stack.">
<polygon fill="#999999" stroke="#666666" points="139,-19.25 0,-19.25 0,0 139,0 139,-19.25"/>
<text text-anchor="middle" x="69.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack&lt; T &gt;</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="123.25,-85.75 15.75,-85.75 15.75,-66.5 123.25,-66.5 123.25,-85.75"/>
<text text-anchor="middle" x="69.5" y="-72.25" font-family="Helvetica,sans-Serif" font-size="10.00">std::unique_ptr&lt; T[]&gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node2&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M69.5,-54.65C69.5,-42.82 69.5,-28.54 69.5,-19.52"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="66,-54.64 69.5,-64.64 73,-54.64 66,-54.64"/>
</a>
</g>
<text text-anchor="middle" x="83" y="-39" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> stack</text>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="83.9,-152.25 55.1,-152.25 55.1,-133 83.9,-133 83.9,-152.25"/>
<text text-anchor="middle" x="69.5" y="-138.75" font-family="Helvetica,sans-Serif" font-size="10.00">T</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node3&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M69.5,-121.15C69.5,-109.32 69.5,-95.04 69.5,-86.02"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="66,-121.14 69.5,-131.14 73,-121.14 66,-121.14"/>
</a>
</g>
<text text-anchor="middle" x="76.62" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00" fill="grey"> ptr</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.7 KiB

133
d3/d25/classdata__structures_1_1_stack-members.html Normal file
View File

@@ -0,0 +1,133 @@
<!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('d2/dc8/classdata__structures_1_1_stack.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">data_structures::Stack&lt; T &gt; Member List</div></div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6">bottom</a>() const</td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">empty</a>() const</td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1">full</a>() const</td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b">pop</a>()</td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2">push</a>(T element)</td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586">show</a>() const</td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a">Stack</a>(int size)</td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3">stack</a></td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">stackIndex</a></td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="odd"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86">stackSize</a></td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0">topmost</a>() const</td><td class="entry"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">data_structures::Stack&lt; T &gt;</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>

10
d5/d3c/namespacedata__structures.html
View File

@@ -137,6 +137,9 @@ Classes</h2></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">Stack</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Class representation of a stack. <a href="../../d2/dc8/classdata__structures_1_1_stack.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> <a href="../../d0/d3e/classdata__structures_1_1trie.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -171,7 +174,8 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<div class="textblock"><p>for IO operations </p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p>For IO operations.</p>
<p>Stack Data Structure Using the <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> Data Structure.</p>
<p><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> Data Structure Using the <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> Data Structure.</p>
<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>.</p>
<p>Data-structure algorithms.</p>
<p>For assert.</p>
<p>for managing dynamic storage</p>
@@ -187,7 +191,9 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<p>For IO operations 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/min.html">std::min</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert</p>
<p>Data Structures algorithms</p>
<p>Using 2 Queues inside the Stack class, we can easily implement Stack data structure with heavy computation in push function.</p>
<p>For std::assert For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a></p>
<p><a class="el" href="../../d5/d3c/namespacedata__structures.html" title="for IO operations">data_structures</a></p>
<p>Using 2 Queues inside the <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> class, we can easily implement <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> data structure with heavy computation in push function.</p>
<p>References used: <a href="https://www.studytonight.com/data-structures/stack-using-queue" target="_blank">StudyTonight</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/tushar2407" target="_blank">tushar2407</a> for assert for IO operations for queue data structure</dd></dl>
<p>Data structures algorithms</p>
<p>For array For assert</p>

1
d5/d3c/namespacedata__structures.js vendored
View File

@@ -6,6 +6,7 @@ var namespacedata__structures =
[ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ],
[ "SegmentTree", "dd/d95/classdata__structures_1_1_segment_tree.html", "dd/d95/classdata__structures_1_1_segment_tree" ],
[ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ],
[ "Stack", "d2/dc8/classdata__structures_1_1_stack.html", "d2/dc8/classdata__structures_1_1_stack" ],
[ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ],
[ "hashDJB2", "d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4", null ],
[ "hashInt_1", "d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677", null ],

3
d7/d75/postfix__evaluation_8cpp.html
View File

@@ -391,7 +391,7 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
</dl>
<dl class="section return"><dt>Returns</dt><dd>stack[stackTop] returns the top value from the stack </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 115</span> {</div>
<div class="line"><span class="lineno"> 116</span> Stack <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>;</div>
<div class="line"><span class="lineno"> 116</span> Stack <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
<div class="line"><span class="lineno"> 117</span> <span class="keywordtype">int</span> j = 0;</div>
<div class="line"><span class="lineno"> 118</span> </div>
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">while</span> (j &lt; N) {</div>
@@ -414,6 +414,7 @@ template&lt;<a class="elRef" target="_blank" href="http://en.cppreference.com/w/
<div class="line"><span class="lineno"> 136</span>}</div>
<div class="ttc" id="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div></div>
<div class="ttc" id="anamespacegames_1_1memory__game_html_a33167bb9cce6d527b478b4f6ae8c3f59"><div class="ttname"><a href="../../d8/d41/namespacegames_1_1memory__game.html#a33167bb9cce6d527b478b4f6ae8c3f59">games::memory_game::is_number</a></div><div class="ttdeci">bool is_number(const T &amp;input)</div><div class="ttdoc">Utility function to verify if the given input is a number or not. This is very useful to prevent the ...</div><div class="ttdef"><b>Definition</b> memory_game.cpp:62</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:20</div></div>
<div class="ttc" id="apostfix__evaluation_8cpp_html_a59fd597e0ea394abe027ced4d2ea3338"><div class="ttname"><a href="#a59fd597e0ea394abe027ced4d2ea3338">others::postfix_expression::evaluate</a></div><div class="ttdeci">void evaluate(float a, float b, const std::string &amp;operation, Stack *stack)</div><div class="ttdoc">Evaluate answer using given last two operands from and operation.</div><div class="ttdef"><b>Definition</b> postfix_evaluation.cpp:77</div></div>
<div class="ttc" id="astof_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stof.html">std::stof</a></div><div class="ttdeci">T stof(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">

7
d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html
View File

@@ -197,7 +197,7 @@ Public Member Functions</h2></td></tr>
<p>&lt; List of values, sorted in in-order.</p>
<div class="fragment"><div class="line"><span class="lineno"> 164</span> {</div>
<div class="line"><span class="lineno"> 165</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Node *&gt;</a></div>
<div class="line"><span class="lineno"> 166</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>; <span class="comment">///&lt; is used to find and traverse the child nodes.</span></div>
<div class="line"><span class="lineno"> 166</span> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>; <span class="comment">///&lt; is used to find and traverse the child nodes.</span></div>
<div class="line"><span class="lineno"> 167</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">///&lt; List of values, sorted in in-order.</span></div>
<div class="line"><span class="lineno"> 168</span> </div>
<div class="line"><span class="lineno"> 169</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a> *current = root;</div>
@@ -219,6 +219,7 @@ Public Member Functions</h2></td></tr>
<div class="ttc" id="aclassstack_html_a90df277532c23519aa7ac3c08ed90a1d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack::push</a></div><div class="ttdeci">void push(const value_type &amp;item)</div><div class="ttdef"><b>Definition</b> stack.hpp:47</div></div>
<div class="ttc" id="aclassstack_html_ae09630c4384903d187801921b2ddc709"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack::top</a></div><div class="ttdeci">value_type top() const</div><div class="ttdef"><b>Definition</b> stack.hpp:56</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="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:20</div></div>
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</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">
@@ -257,7 +258,7 @@ Here is the call graph for this function:</div>
<p>&lt; List of values, sorted in post-order.</p>
<div class="fragment"><div class="line"><span class="lineno"> 132</span> {</div>
<div class="line"><span class="lineno"> 133</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Node *&gt;</a></div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>; <span class="comment">///&lt; is used to find and traverse the child nodes.</span></div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>; <span class="comment">///&lt; is used to find and traverse the child nodes.</span></div>
<div class="line"><span class="lineno"> 135</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">///&lt; List of values, sorted in post-order.</span></div>
<div class="line"><span class="lineno"> 136</span> </div>
<div class="line"><span class="lineno"> 137</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>
@@ -316,7 +317,7 @@ Here is the call graph for this function:</div>
<p>&lt; list of values, sorted in pre-order.</p>
<div class="fragment"><div class="line"><span class="lineno"> 102</span> {</div>
<div class="line"><span class="lineno"> 103</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;Node *&gt;</a></div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>; <span class="comment">///&lt; is used to find and traverse the child nodes.</span></div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>; <span class="comment">///&lt; is used to find and traverse the child nodes.</span></div>
<div class="line"><span class="lineno"> 105</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>; <span class="comment">///&lt; list of values, sorted in pre-order.</span></div>
<div class="line"><span class="lineno"> 106</span> </div>
<div class="line"><span class="lineno"> 107</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(root);</div>

3
da/d4b/depth__first__search__with__stack_8cpp.html
View File

@@ -273,7 +273,7 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
<div class="line"><span class="lineno"> 89</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;size_t&gt;</a> checked(<a class="code hl_namespace" href="../../df/dce/namespacegraph.html">graph</a>.size(), <a class="code hl_variable" href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a>), traversed_path;</div>
<div class="line"><span class="lineno"> 90</span> </div>
<div class="line"><span class="lineno"> 91</span> checked[start] = <a class="code hl_variable" href="#a43e30173f12330e85cce6239a277527e">GREY</a>;</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;size_t&gt;</a> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>;</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack&lt;size_t&gt;</a> <a class="code hl_variable" href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a>;</div>
<div class="line"><span class="lineno"> 93</span> <a class="code hl_class" href="../../d1/dc2/classstack.html">stack</a>.<a class="code hl_function" href="../../d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">push</a>(start);</div>
<div class="line"><span class="lineno"> 94</span><span class="comment"></span> </div>
<div class="line"><span class="lineno"> 95</span><span class="comment"> /// while stack is not empty we keep exploring the node on top of stack</span></div>
@@ -305,6 +305,7 @@ constexpr int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>INF</b>
<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_a7f1cd94cf4da32933e8551cb3577e18b"><div class="ttname"><a href="#a7f1cd94cf4da32933e8551cb3577e18b">BLACK</a></div><div class="ttdeci">constexpr int BLACK</div><div class="ttdoc">indicates node is in stack waiting to be explored</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:40</div></div>
<div class="ttc" id="adepth__first__search__with__stack_8cpp_html_afb80b42b42381658a12a57a975ecd0c7"><div class="ttname"><a href="#afb80b42b42381658a12a57a975ecd0c7">WHITE</a></div><div class="ttdeci">constexpr int WHITE</div><div class="ttdef"><b>Definition</b> depth_first_search_with_stack.cpp:38</div></div>
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_aa37d24a036d239b3b528f13b9de880c7"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aa37d24a036d239b3b528f13b9de880c7">stack</a></div><div class="ttdeci">char stack[MAX]</div><div class="ttdef"><b>Definition</b> paranthesis_matching.cpp:20</div></div>
<div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
<div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</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>

14
doxygen_crawl.html
View File

@@ -434,6 +434,8 @@
<a href="da/dac/classdata__structures_1_1_segment_tree-members.html"/>
<a href="d4/d90/classdata__structures_1_1_skip_list.html"/>
<a href="d6/db7/classdata__structures_1_1_skip_list-members.html"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html"/>
<a href="d3/d25/classdata__structures_1_1_stack-members.html"/>
<a href="d0/d3e/classdata__structures_1_1trie.html"/>
<a href="d1/d90/classdata__structures_1_1trie-members.html"/>
<a href="de/d9d/classdata__structures_1_1linked__list_1_1link.html"/>
@@ -1370,6 +1372,18 @@
<a href="d2/dc1/namespacerange__queries_1_1prefix__sum__array.html#a7c8fd967c36dbba5fdf9c71faed604cf"/>
<a href="d2/dc1/namespacerange__queries_1_1prefix__sum__array.html#ab36151479ad37d53ef9fcb60a274b1d9"/>
<a href="d2/dc4/classstack__linked_list.html"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586"/>
<a href="d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b"/>
<a href="d2/dcf/namespacestatistics.html"/>
<a href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html"/>
<a href="d2/de1/namespacehouse__robber.html"/>

1
functions_b.html
View File

@@ -117,6 +117,7 @@ $(function(){initNavTree('functions_b.html',''); initResizable(true); });
<li>Bitset()&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130">data_structures::Bitset</a></li>
<li>blockSize&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#ad7f7d479079a95bcc9175465395fa23f">data_structures::Bitset</a></li>
<li>BloomFilter()&#160;:&#160;<a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a">data_structures::BloomFilter&lt; T &gt;</a></li>
<li>bottom()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6">data_structures::Stack&lt; T &gt;</a></li>
<li>breadth_first_search()&#160;:&#160;<a class="el" href="dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">graph::Graph&lt; T &gt;</a></li>
<li>bst_node()&#160;:&#160;<a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778">binary_search_tree&lt; T &gt;::bst_node</a></li>
</ul>

1
functions_e.html
View File

@@ -109,6 +109,7 @@ $(function(){initNavTree('functions_e.html',''); initResizable(true); });
<h3><a id="index_e" name="index_e"></a>- e -</h3><ul>
<li>Edge()&#160;:&#160;<a class="el" href="d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge</a></li>
<li>EightPuzzle()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>empty()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack&lt; T &gt;</a></li>
<li>encrypt_text()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher</a></li>
<li>end&#160;:&#160;<a class="el" href="d8/d7c/classoperations__on__datastructures_1_1circular__linked__list_1_1_circular_linked_list.html#ab682f854f39582a20c9c4102f0482208">operations_on_datastructures::circular_linked_list::CircularLinkedList</a></li>
<li>enQueue()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue&lt; ValueType &gt;</a></li>

1
functions_f.html
View File

@@ -119,6 +119,7 @@ $(function(){initNavTree('functions_f.html',''); initResizable(true); });
<li>fit_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork</a></li>
<li>forward&#160;:&#160;<a class="el" href="d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">data_structures::Node</a></li>
<li>front&#160;:&#160;<a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array</a>, <a class="el" href="db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue&lt; ValueType &gt;</a></li>
<li>full()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1">data_structures::Stack&lt; T &gt;</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

1
functions_func_b.html
View File

@@ -114,6 +114,7 @@ $(function(){initNavTree('functions_func_b.html',''); initResizable(true); });
<li>BinaryTree()&#160;:&#160;<a class="el" href="de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">operations_on_datastructures::reverse_binary_tree::BinaryTree</a></li>
<li>Bitset()&#160;:&#160;<a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a15b05aabb28f9b1896b0a61e8ef60130">data_structures::Bitset</a></li>
<li>BloomFilter()&#160;:&#160;<a class="el" href="dc/dd4/classdata__structures_1_1_bloom_filter.html#a6910d29951b57ab56e7a3db405aa1f1a">data_structures::BloomFilter&lt; T &gt;</a></li>
<li>bottom()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a2ac469fcc2229d273450e429139d90e6">data_structures::Stack&lt; T &gt;</a></li>
<li>breadth_first_search()&#160;:&#160;<a class="el" href="dc/d61/classgraph_1_1_graph.html#a3755ec9e6a842238c7f4aac10b661981">graph::Graph&lt; T &gt;</a></li>
<li>bst_node()&#160;:&#160;<a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778">binary_search_tree&lt; T &gt;::bst_node</a></li>
</ul>

1
functions_func_e.html
View File

@@ -109,6 +109,7 @@ $(function(){initNavTree('functions_func_e.html',''); initResizable(true); });
<h3><a id="index_e" name="index_e"></a>- e -</h3><ul>
<li>Edge()&#160;:&#160;<a class="el" href="d7/d77/class_edge.html#a415a5d002fe11c58711e48aabe975980">Edge</a></li>
<li>EightPuzzle()&#160;:&#160;<a class="el" href="dd/d9c/classmachine__learning_1_1aystar__search_1_1_eight_puzzle.html#a3dc09f4742a0e1167ed202f7bf94721b">machine_learning::aystar_search::EightPuzzle&lt; N &gt;</a></li>
<li>empty()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a04e2e7cb58b2de6d3a15053bfaaf6080">data_structures::Stack&lt; T &gt;</a></li>
<li>encrypt_text()&#160;:&#160;<a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher</a></li>
<li>enQueue()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue&lt; ValueType &gt;</a></li>
<li>enqueue()&#160;:&#160;<a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array</a></li>

1
functions_func_f.html
View File

@@ -116,6 +116,7 @@ $(function(){initNavTree('functions_func_f.html',''); initResizable(true); });
<li>fit()&#160;:&#160;<a class="el" href="d6/d30/classmachine__learning_1_1adaline.html#a74e3c6c037b67895014414c5d75465e5">machine_learning::adaline</a>, <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a2be1b52bb9f57486f9a436f35c9089c0">machine_learning::neural_network::NeuralNetwork</a></li>
<li>fit_from_csv()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a5172a6791b9bd24f4232bab8d6b81fff">machine_learning::neural_network::NeuralNetwork</a></li>
<li>front()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue&lt; ValueType &gt;</a></li>
<li>full()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#aa753346c8ee5f21d4f4482398fe6d5c1">data_structures::Stack&lt; T &gt;</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->

4
functions_func_p.html
View File

@@ -108,7 +108,7 @@ $(function(){initNavTree('functions_func_p.html',''); initResizable(true); });
<h3><a id="index_p" name="index_p"></a>- p -</h3><ul>
<li>Point()&#160;:&#160;<a class="el" href="d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point</a></li>
<li>pop()&#160;:&#160;<a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack&lt; ValueType &gt;</a></li>
<li>pop()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack&lt; ValueType &gt;</a></li>
<li>populate_parents()&#160;:&#160;<a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree</a></li>
<li>populate_up()&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor</a></li>
<li>postorder()&#160;:&#160;<a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5">others::recursive_tree_traversals::BT</a></li>
@@ -122,7 +122,7 @@ $(function(){initNavTree('functions_func_p.html',''); initResizable(true); });
<li>PrintNode()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#af260f0760344771bf8fce4fc9b1739be">data_structures::tree_234::Tree234</a></li>
<li>printResult()&#160;:&#160;<a class="el" href="dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793">FCFS&lt; S, T, E &gt;</a></li>
<li>probability_density()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">probability::geometric_dist::geometric_distribution</a></li>
<li>push()&#160;:&#160;<a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack&lt; ValueType &gt;</a></li>
<li>push()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack&lt; ValueType &gt;</a></li>
<li>push_back()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496">data_structures::linked_list::list</a></li>
<li>push_front()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">data_structures::linked_list::list</a></li>
</ul>

3
functions_func_s.html
View File

@@ -121,7 +121,7 @@ $(function(){initNavTree('functions_func_s.html',''); initResizable(true); });
<li>SetCount()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#af564fd4b0992fff69f90de201542d3d1">data_structures::tree_234::Node</a></li>
<li>SetItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc">data_structures::tree_234::Node</a></li>
<li>SG()&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>show()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list&lt; N &gt;</a></li>
<li>show()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list&lt; N &gt;</a>, <a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586">data_structures::Stack&lt; T &gt;</a></li>
<li>single_predict()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a></li>
<li>SkipList()&#160;:&#160;<a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a></li>
@@ -129,6 +129,7 @@ $(function(){initNavTree('functions_func_s.html',''); initResizable(true); });
<li>Solution()&#160;:&#160;<a class="el" href="da/d02/classmachine__learning_1_1aystar__search_1_1_ay_star_search.html#a0a26aa9ad3d73707370d9fe83707aca4">machine_learning::aystar_search::AyStarSearch&lt; Puzzle &gt;</a></li>
<li>sort()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a133635ad53bd89e3947ca02448819180">data_structures::list_array::list&lt; N &gt;</a></li>
<li>SplitNode()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234</a></li>
<li>Stack()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a">data_structures::Stack&lt; T &gt;</a></li>
<li>standard_deviation()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">probability::geometric_dist::geometric_distribution</a></li>
<li>startwith()&#160;:&#160;<a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">data_structures::trie_using_hashmap::Trie</a></li>
<li>std()&#160;:&#160;<a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html#af57e942d49f4fd70f059f224b4ac07e1">statistics::stats_computer1&lt; T &gt;</a>, <a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html#acf2e84df4fc386bb3295016ef8fd156e">statistics::stats_computer2&lt; T &gt;</a></li>

1
functions_func_t.html
View File

@@ -113,6 +113,7 @@ $(function(){initNavTree('functions_func_t.html',''); initResizable(true); });
<li>testCase_3()&#160;:&#160;<a class="el" href="d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases</a></li>
<li>to_string()&#160;:&#160;<a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08">hashing::sha256::Hash</a></li>
<li>top()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">data_structures::linked_list::list</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack&lt; ValueType &gt;</a></li>
<li>topmost()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0">data_structures::Stack&lt; T &gt;</a></li>
<li>toVector()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">queue&lt; ValueType &gt;</a></li>
<li>Traverse()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">data_structures::tree_234::Tree234</a></li>
<li>traverse()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">data_structures::linked_list::list</a></li>

4
functions_p.html
View File

@@ -115,7 +115,7 @@ $(function(){initNavTree('functions_p.html',''); initResizable(true); });
<li>pair_v&#160;:&#160;<a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a976ee239402cc2726a280e781c706d77">graph::HKGraph</a></li>
<li>parent&#160;:&#160;<a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#a3831583a91914988897a4cc8748fda43">graph::RootedTree</a></li>
<li>Point()&#160;:&#160;<a class="el" href="d8/dc8/struct_point.html#ae2d6fb1b3fd3a96169d963d62e37130a">Point</a></li>
<li>pop()&#160;:&#160;<a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack&lt; ValueType &gt;</a></li>
<li>pop()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#ac46842bdd9c655d84f865fa3a03da19b">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#abdd461689df4983a3ad3b05d853cf5eb">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#a3647fb4418890f19e0dc414b8092b8b0">stack&lt; ValueType &gt;</a></li>
<li>populate_parents()&#160;:&#160;<a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ae6928f3ebd491541e9570e746b877c1e">graph::RootedTree</a></li>
<li>populate_up()&#160;:&#160;<a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html#a42589cc39d6bbff6c997152f1b96e356">graph::LowestCommonAncestor</a></li>
<li>postorder()&#160;:&#160;<a class="el" href="dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5">others::recursive_tree_traversals::BT</a></li>
@@ -132,7 +132,7 @@ $(function(){initNavTree('functions_p.html',''); initResizable(true); });
<li>probability_density()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#aee973db9f0435e0cb4cc70f8eb3447a1">probability::geometric_dist::geometric_distribution</a></li>
<li>psucc&#160;:&#160;<a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081">data_structures::linked_list::link</a></li>
<li>ptrs&#160;:&#160;<a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree</a></li>
<li>push()&#160;:&#160;<a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack&lt; ValueType &gt;</a></li>
<li>push()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#aa9f9b087e9e7c00628e1289f0f1de3b2">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#af04a8f3536a52d8c9916086b656eefc2">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#a90df277532c23519aa7ac3c08ed90a1d">stack&lt; ValueType &gt;</a></li>
<li>push_back()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a6e9859d1a0755fb51e41904d20c95496">data_structures::linked_list::list</a></li>
<li>push_front()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a332b965afd9d6bea8d3246673acd52c7">data_structures::linked_list::list</a></li>
<li>pvalue&#160;:&#160;<a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936">data_structures::linked_list::link</a></li>

7
functions_s.html
View File

@@ -126,7 +126,7 @@ $(function(){initNavTree('functions_s.html',''); initResizable(true); });
<li>SetItem()&#160;:&#160;<a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html#aaa89a3016b5dd1be3552321c34343cbc">data_structures::tree_234::Node</a></li>
<li>setSize&#160;:&#160;<a class="el" href="dd/d1f/classdsu.html#ac0dc3e17e49fe19b159b4ea4096d7b55">dsu</a></li>
<li>SG()&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>show()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list&lt; N &gt;</a></li>
<li>show()&#160;:&#160;<a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0b7acf65026df1e9dd13eebf309dda5e">data_structures::list_array::list&lt; N &gt;</a>, <a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#abb86ed67d9d97112897a09cfb10ff586">data_structures::Stack&lt; T &gt;</a></li>
<li>side&#160;:&#160;<a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph</a></li>
<li>single_predict()&#160;:&#160;<a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#a3b9eac1824d365dce715fb17c33cb96f">machine_learning::neural_network::NeuralNetwork</a></li>
<li>size()&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree&lt; T &gt;</a>, <a class="el" href="d9/dae/classdata__structures_1_1_bitset.html#a2f1f44d6a12b0de4aaf242872b1c7b54">data_structures::Bitset</a>, <a class="el" href="dd/d95/classdata__structures_1_1_segment_tree.html#a167fd91b68048e49e97859a8947690f3">data_structures::SegmentTree&lt; T &gt;</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#ac0ddec9ab8f778dad23ec446d7a77b39">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d5/d95/structdata__structures_1_1treap_1_1_treap.html#af5f0b8263339485989f8a02ae026114c">data_structures::treap::Treap</a>, <a class="el" href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html#ae4e183ec8eab778cb243e4ae0b22a0f1">divide_and_conquer::strassens_multiplication::Matrix&lt; T, typename &gt;</a>, <a class="el" href="dd/d1f/classdsu.html#a1c24228b0f2f49220133fb8c3566a55c">dsu</a>, <a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree</a>, <a class="el" href="d1/dc2/classstack.html#a0a6b2b93ec970296940798ee98a5072e">stack&lt; ValueType &gt;</a></li>
@@ -138,7 +138,10 @@ $(function(){initNavTree('functions_s.html',''); initResizable(true); });
<li>SplitNode()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234</a></li>
<li>sret_init&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>ST&#160;:&#160;<a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">data_structures::sparse_table::Sparse_table</a></li>
<li>stack&#160;:&#160;<a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1">others::postfix_expression::Stack</a></li>
<li>Stack()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a8cb0602c8a9c1603d0315938177ecc6a">data_structures::Stack&lt; T &gt;</a></li>
<li>stack&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1">others::postfix_expression::Stack</a></li>
<li>stackIndex&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">data_structures::Stack&lt; T &gt;</a></li>
<li>stackSize&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86">data_structures::Stack&lt; T &gt;</a></li>
<li>stackTop&#160;:&#160;<a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c">others::postfix_expression::Stack</a>, <a class="el" href="d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stack&lt; ValueType &gt;</a></li>
<li>standard_deviation()&#160;:&#160;<a class="el" href="da/d19/classprobability_1_1geometric__dist_1_1geometric__distribution.html#a0a10c512e13dd3a052e1c6d7f4d6f0f2">probability::geometric_dist::geometric_distribution</a></li>
<li>startwith()&#160;:&#160;<a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#af3aee573fbabd2c1510c0f74f842dd17">data_structures::trie_using_hashmap::Trie</a></li>

1
functions_t.html
View File

@@ -122,6 +122,7 @@ $(function(){initNavTree('functions_t.html',''); initResizable(true); });
<li>testCase_3()&#160;:&#160;<a class="el" href="d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases</a></li>
<li>to_string()&#160;:&#160;<a class="el" href="d6/d84/classhashing_1_1sha256_1_1_hash.html#a4581f503a263d8e928e5716d54477e08">hashing::sha256::Hash</a></li>
<li>top()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a9785d1478e59f5a90288b2928a7094d6">data_structures::linked_list::list</a>, <a class="el" href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html#a5540434e1b41245205eee86f664906f7">data_structures::stack_using_queue::Stack</a>, <a class="el" href="d1/dc2/classstack.html#ae09630c4384903d187801921b2ddc709">stack&lt; ValueType &gt;</a>, <a class="el" href="d2/d2c/structtower.html#acb535964abd34c47678a4ade0628223d">tower</a></li>
<li>topmost()&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a61dc70e128ee64c9684f03a4c04818b0">data_structures::Stack&lt; T &gt;</a></li>
<li>toVector()&#160;:&#160;<a class="el" href="db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">queue&lt; ValueType &gt;</a></li>
<li>Traverse()&#160;:&#160;<a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a84ab7b4fe7442b5e2eeed8c050bb86bd">data_structures::tree_234::Tree234</a></li>
<li>traverse()&#160;:&#160;<a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#a2b951a3f1123b9b2f4891ec96aa76d69">data_structures::linked_list::list</a></li>

4
functions_vars.html
View File

@@ -266,7 +266,9 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });
<li>size_&#160;:&#160;<a class="el" href="d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree&lt; T &gt;</a></li>
<li>sret_init&#160;:&#160;<a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#aa7f93971a9f891e0bbb7023081f379d5">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></li>
<li>ST&#160;:&#160;<a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html#ad36b9a20fed47b068e407008c04e9f81">data_structures::sparse_table::Sparse_table</a></li>
<li>stack&#160;:&#160;<a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1">others::postfix_expression::Stack</a></li>
<li>stack&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a3f912a0e9bed5b24b206584e3010dce3">data_structures::Stack&lt; T &gt;</a>, <a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#af06360122e20ce2ba32c574a27a20ba1">others::postfix_expression::Stack</a></li>
<li>stackIndex&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a71afc94746d47fb2c0c4fa4b612edee6">data_structures::Stack&lt; T &gt;</a></li>
<li>stackSize&#160;:&#160;<a class="el" href="d2/dc8/classdata__structures_1_1_stack.html#a88a10062c0662a385f172669f2f19b86">data_structures::Stack&lt; T &gt;</a></li>
<li>stackTop&#160;:&#160;<a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html#a6ae98710503b894b843d01cb69d5490c">others::postfix_expression::Stack</a>, <a class="el" href="d1/dc2/classstack.html#aefb3dac828e32b4ec014ff4b5d43a6b8">stack&lt; ValueType &gt;</a></li>
</ul>

57
hierarchy.html
View File

@@ -201,34 +201,35 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<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="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_86_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#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_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="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_88_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#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_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="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_90_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#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_91_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_92_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_93_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_94_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_96_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_97_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_98_" class="even"><td class="entry"><span style="width: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_99_" class="odd"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_99_" class="arrow" onclick="dynsection.toggleFolder('99_')">&#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_99_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_100_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/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_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_102_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_103_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="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_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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></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="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_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/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_105_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_105_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_105_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_105_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_105_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_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="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_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="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_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="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_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="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_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="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_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="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_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="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_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/dc4/classstack__linked_list.html" target="_self">stack_linkedList</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="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_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="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_95_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/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_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="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_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="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_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="d2/d2c/structtower.html" target="_self">tower</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="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_100_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_100_" class="arrow" onclick="dynsection.toggleFolder('100_')">&#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_100_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_101_" class="odd"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/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_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="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_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="dd/d2f/class_trie.html" target="_self">Trie</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="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_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="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_106_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_106_" class="arrow" onclick="dynsection.toggleFolder('106_')">&#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_106_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_106_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_106_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_106_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_106_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_106_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_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="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_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="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_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="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

@@ -92,6 +92,7 @@ var hierarchy =
[ "data_structures::SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", null ],
[ "Solution", "dd/d4f/class_solution.html", null ],
[ "data_structures::sparse_table::Sparse_table", "da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html", null ],
[ "data_structures::Stack< T >", "d2/dc8/classdata__structures_1_1_stack.html", null ],
[ "data_structures::stack_using_queue::Stack", "db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html", null ],
[ "others::postfix_expression::Stack", "d5/d8a/classothers_1_1postfix__expression_1_1_stack.html", null ],
[ "stack< ValueType >", "d1/dc2/classstack.html", null ],

14
inherit_graph_100.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_100.md5
View File

@@ -1 +1 @@
d6ee5f042479b5982faa79c9932e1b9c
53ba32e546959cac79e584e353db1db7

123
inherit_graph_100.svg
View File

@@ -4,17 +4,126 @@
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- 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_101.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_101.md5
View File

@@ -1 +1 @@
abd7e48c602c9ba41e00a619e3234e23
d6ee5f042479b5982faa79c9932e1b9c

13
inherit_graph_101.svg
View File

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

@@ -1 +1 @@
a9d8d2a80cdf35dfac76eecdbb209456
abd7e48c602c9ba41e00a619e3234e23

10
inherit_graph_102.svg
View File

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

@@ -1 +1 @@
76f1c23145670e75e2e13d0451b74420
a9d8d2a80cdf35dfac76eecdbb209456

10
inherit_graph_103.svg
View File

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

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

10
inherit_graph_104.svg
View File

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

@@ -1 +1 @@
a8666508fe9ca12fb7281895f580da44
845eae9f7c70e50cf22fb926bd9e034b

10
inherit_graph_105.svg
View File

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

@@ -1 +1 @@
eed75a69314afbb385b920f554ca3c5d
a8666508fe9ca12fb7281895f580da44

10
inherit_graph_106.svg
View File

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

@@ -1 +1 @@
805bd0d28e53f8af03d7b4e5906cc299
eed75a69314afbb385b920f554ca3c5d

4
inherit_graph_107.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_108.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_108.md5 Normal file
View File

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

21
inherit_graph_108.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.0 (20240811.2233)
-->
<!-- 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_22.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure." alt="" coords="5,5,157,46"/>
<area shape="rect" id="Node000000" href="$d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack." alt="" coords="5,5,191,31"/>
</map>

2
inherit_graph_22.md5
View File

@@ -1 +1 @@
71dae72319ec998cf34b1d7a1b72becd
dfe55200580aa491393969fdc2b328d6

13
inherit_graph_22.svg
View File

@@ -4,17 +4,16 @@
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="122pt" height="39pt"
viewBox="0.00 0.00 121.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="147pt" height="27pt"
viewBox="0.00 0.00 147.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="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_top" xlink:title="Stack Class implementation for basic methods of Stack Data Structure.">
<polygon fill="white" stroke="#666666" points="113.5,-30.5 0,-30.5 0,0 113.5,0 113.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::stack</text>
<text text-anchor="middle" x="56.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_queue::Stack</text>
<g id="a_Node000000"><a xlink:href="d2/dc8/classdata__structures_1_1_stack.html" target="_top" xlink:title="Class representation of a stack.">
<polygon fill="white" stroke="#666666" points="139,-19.25 0,-19.25 0,0 139,0 139,-19.25"/>
<text text-anchor="middle" x="69.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::Stack&lt; T &gt;</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1008 B

2
inherit_graph_23.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html" title="Struct representation of the treap." alt="" coords="5,5,154,46"/>
<area shape="rect" id="Node000000" href="$db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" title="Stack Class implementation for basic methods of Stack Data Structure." alt="" coords="5,5,157,46"/>
</map>

2
inherit_graph_23.md5
View File

@@ -1 +1 @@
fd9643ee1a3cc491f340867c86286bc5
71dae72319ec998cf34b1d7a1b72becd

12
inherit_graph_23.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="119pt" height="39pt"
viewBox="0.00 0.00 119.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="122pt" height="39pt"
viewBox="0.00 0.00 121.50 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d5/d95/structdata__structures_1_1treap_1_1_treap.html" target="_top" xlink:title="Struct representation of the treap.">
<polygon fill="white" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap</text>
<g id="a_Node000000"><a xlink:href="db/d5b/structdata__structures_1_1stack__using__queue_1_1_stack.html" target="_top" xlink:title="Stack Class implementation for basic methods of Stack Data Structure.">
<polygon fill="white" stroke="#666666" points="113.5,-30.5 0,-30.5 0,0 113.5,0 113.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::stack</text>
<text text-anchor="middle" x="56.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_queue::Stack</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_24.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html" title="2&#45;3&#45;4 tree node class" alt="" coords="5,5,147,46"/>
<area shape="rect" id="Node000000" href="$d5/d95/structdata__structures_1_1treap_1_1_treap.html" title="Struct representation of the treap." alt="" coords="5,5,154,46"/>
</map>

2
inherit_graph_24.md5
View File

@@ -1 +1 @@
dccad02b6b2cde5e239fa0cdf6df9f6a
fd9643ee1a3cc491f340867c86286bc5

12
inherit_graph_24.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="114pt" height="39pt"
viewBox="0.00 0.00 114.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="119pt" height="39pt"
viewBox="0.00 0.00 119.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_top" xlink:title="2&#45;3&#45;4 tree node class">
<polygon fill="white" stroke="#666666" points="106,-30.5 0,-30.5 0,0 106,0 106,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node</text>
<g id="a_Node000000"><a xlink:href="d5/d95/structdata__structures_1_1treap_1_1_treap.html" target="_top" xlink:title="Struct representation of the treap.">
<polygon fill="white" stroke="#666666" points="111.25,-30.5 0,-30.5 0,0 111.25,0 111.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::treap</text>
<text text-anchor="middle" x="55.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Treap</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_25.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" title="2&#45;3&#45;4 tree class" alt="" coords="5,5,147,46"/>
<area shape="rect" id="Node000000" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html" title="2&#45;3&#45;4 tree node class" alt="" coords="5,5,147,46"/>
</map>

2
inherit_graph_25.md5
View File

@@ -1 +1 @@
54ab96504a3a8a3864e0ad5cff623661
dccad02b6b2cde5e239fa0cdf6df9f6a

4
inherit_graph_25.svg
View File

@@ -11,10 +11,10 @@
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_top" xlink:title="2&#45;3&#45;4 tree class">
<g id="a_Node000000"><a xlink:href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_top" xlink:title="2&#45;3&#45;4 tree node class">
<polygon fill="white" stroke="#666666" points="106,-30.5 0,-30.5 0,0 106,0 106,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234</text>
<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node</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_26.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d0/d3e/classdata__structures_1_1trie.html" title="Trie implementation for small&#45;case English alphabets a&#45;z" alt="" coords="5,5,143,31"/>
<area shape="rect" id="Node000000" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" title="2&#45;3&#45;4 tree class" alt="" coords="5,5,147,46"/>
</map>

2
inherit_graph_26.md5
View File

@@ -1 +1 @@
bce78f8c12ccb79640d8d75668ba7279
54ab96504a3a8a3864e0ad5cff623661

13
inherit_graph_26.svg
View File

@@ -4,16 +4,17 @@
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- 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">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 23.25)">
<svg width="114pt" height="39pt"
viewBox="0.00 0.00 114.00 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="d0/d3e/classdata__structures_1_1trie.html" target="_top" xlink:title="Trie implementation for small&#45;case English alphabets a&#45;z">
<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">data_structures::trie</text>
<g id="a_Node000000"><a xlink:href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_top" xlink:title="2&#45;3&#45;4 tree class">
<polygon fill="white" stroke="#666666" points="106,-30.5 0,-30.5 0,0 106,0 106,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::tree</text>
<text text-anchor="middle" x="53" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234</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_27.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" 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..." alt="" coords="5,5,155,46"/>
<area shape="rect" id="Node000000" href="$d0/d3e/classdata__structures_1_1trie.html" title="Trie implementation for small&#45;case English alphabets a&#45;z" alt="" coords="5,5,143,31"/>
</map>

2
inherit_graph_27.md5
View File

@@ -1 +1 @@
0f54df00dde18e91d119fa5953d6b2d2
bce78f8c12ccb79640d8d75668ba7279

13
inherit_graph_27.svg
View File

@@ -4,17 +4,16 @@
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="120pt" height="39pt"
viewBox="0.00 0.00 120.00 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="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="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_top" xlink:title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">
<polygon fill="white" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
<g id="a_Node000000"><a xlink:href="d0/d3e/classdata__structures_1_1trie.html" target="_top" xlink:title="Trie implementation for small&#45;case English alphabets a&#45;z">
<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">data_structures::trie</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_28.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" title="struct representing a trie node." alt="" coords="5,5,194,46"/>
<area shape="rect" id="Node000000" 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..." alt="" coords="5,5,155,46"/>
</map>

2
inherit_graph_28.md5
View File

@@ -1 +1 @@
b61968324d87720c5d4901537b7cc54f
0f54df00dde18e91d119fa5953d6b2d2

10
inherit_graph_28.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="149pt" height="39pt"
viewBox="0.00 0.00 149.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="120pt" height="39pt"
viewBox="0.00 0.00 120.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_top" xlink:title="struct representing a trie node.">
<polygon fill="white" stroke="#666666" points="141.25,-30.5 0,-30.5 0,0 141.25,0 141.25,-30.5"/>
<g id="a_Node000000"><a xlink:href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_top" xlink:title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">
<polygon fill="white" stroke="#666666" points="112,-30.5 0,-30.5 0,0 112,0 112,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
<text text-anchor="middle" x="70.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie::Node</text>
<text text-anchor="middle" x="56" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_29.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class." alt="" coords="5,5,175,61"/>
<area shape="rect" id="Node000000" href="$d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" title="struct representing a trie node." alt="" coords="5,5,194,46"/>
</map>

2
inherit_graph_29.md5
View File

@@ -1 +1 @@
79700ddbe15104aa2b66ca832e587b3b
b61968324d87720c5d4901537b7cc54f

15
inherit_graph_29.svg
View File

@@ -4,18 +4,17 @@
<!-- Generated by graphviz version 12.1.0 (20240811.2233)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="135pt" height="50pt"
viewBox="0.00 0.00 135.00 49.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 45.75)">
<svg width="149pt" height="39pt"
viewBox="0.00 0.00 149.25 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>Graphical Class Hierarchy</title>
<!-- Node0 -->
<g id="Node000000" class="node">
<title>Node0</title>
<g id="a_Node000000"><a xlink:href="dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" target="_top" xlink:title="Matrix class.">
<polygon fill="white" stroke="#666666" points="127,-41.75 0,-41.75 0,0 127,0 127,-41.75"/>
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">divide_and_conquer</text>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::strassens_multiplication</text>
<text text-anchor="middle" x="63.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::Matrix&lt; T, typename &gt;</text>
<g id="a_Node000000"><a xlink:href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_top" xlink:title="struct representing a trie node.">
<polygon fill="white" stroke="#666666" points="141.25,-30.5 0,-30.5 0,0 141.25,0 141.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
<text text-anchor="middle" x="70.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_using_hashmap::Trie::Node</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_30.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="Node000000" href="$d9/dde/structdouble__hashing_1_1_entry.html" title=" " alt="" coords="5,5,156,31"/>
<area shape="rect" id="Node000000" href="$dc/d13/classdivide__and__conquer_1_1strassens__multiplication_1_1_matrix.html" title="Matrix class." alt="" coords="5,5,175,61"/>
</map>

2
inherit_graph_30.md5
View File

@@ -1 +1 @@
b1e6afdb5793ad15233e3646a733a097
79700ddbe15104aa2b66ca832e587b3b

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