mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-23 13:22:47 +08:00
Documentation for 2dadbf73f4
This commit is contained in:
github-actions
@@ -3,16 +3,18 @@
|
||||
<head>
|
||||
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.9.8"/>
|
||||
<meta name="generator" content="Doxygen 1.10.0"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: Queue Class Reference</title>
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.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>
|
||||
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.9.8 -->
|
||||
<!-- Generated by Doxygen 1.10.0 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search');
|
||||
$(document).ready(function() { init_search(); });
|
||||
$(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
@@ -71,7 +73,7 @@ $(function() {
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(document).ready(function(){initNavTree('dc/db5/struct_queue.html','../../'); initResizable(); });
|
||||
$(function(){initNavTree('dc/db5/struct_queue.html','../../'); initResizable(); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
@@ -113,13 +115,13 @@ Collaboration diagram for Queue:</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:a7df5a5794b817bccb0d288e3e7893326" id="r_a7df5a5794b817bccb0d288e3e7893326"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/db5/struct_queue.html#a7df5a5794b817bccb0d288e3e7893326">createNode</a> (int val)</td></tr>
|
||||
<tr class="memitem:a7df5a5794b817bccb0d288e3e7893326" id="r_a7df5a5794b817bccb0d288e3e7893326"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a7df5a5794b817bccb0d288e3e7893326">createNode</a> (int val)</td></tr>
|
||||
<tr class="separator:a7df5a5794b817bccb0d288e3e7893326"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a8e9326b15e162c2d7d663c5cfbdd4405" id="r_a8e9326b15e162c2d7d663c5cfbdd4405"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/db5/struct_queue.html#a8e9326b15e162c2d7d663c5cfbdd4405">enqueue</a> (int val)</td></tr>
|
||||
<tr class="memitem:a8e9326b15e162c2d7d663c5cfbdd4405" id="r_a8e9326b15e162c2d7d663c5cfbdd4405"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a8e9326b15e162c2d7d663c5cfbdd4405">enqueue</a> (int val)</td></tr>
|
||||
<tr class="separator:a8e9326b15e162c2d7d663c5cfbdd4405"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa01ff898c2bdab7e804bf243eb5bfb31" id="r_aa01ff898c2bdab7e804bf243eb5bfb31"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/db5/struct_queue.html#aa01ff898c2bdab7e804bf243eb5bfb31">dequeue</a> ()</td></tr>
|
||||
<tr class="memitem:aa01ff898c2bdab7e804bf243eb5bfb31" id="r_aa01ff898c2bdab7e804bf243eb5bfb31"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#aa01ff898c2bdab7e804bf243eb5bfb31">dequeue</a> ()</td></tr>
|
||||
<tr class="separator:aa01ff898c2bdab7e804bf243eb5bfb31"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:af679dbf13749275935f617ac6ab0f9e9" id="r_af679dbf13749275935f617ac6ab0f9e9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/db5/struct_queue.html#af679dbf13749275935f617ac6ab0f9e9">traverse</a> ()</td></tr>
|
||||
<tr class="memitem:af679dbf13749275935f617ac6ab0f9e9" id="r_af679dbf13749275935f617ac6ab0f9e9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#af679dbf13749275935f617ac6ab0f9e9">traverse</a> ()</td></tr>
|
||||
<tr class="separator:af679dbf13749275935f617ac6ab0f9e9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
|
||||
@@ -156,8 +158,7 @@ Private Attributes</h2></td></tr>
|
||||
<tr>
|
||||
<td class="memname">void Queue::createNode </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>val</em></td><td>)</td>
|
||||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>val</em></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
@@ -168,13 +169,13 @@ Private Attributes</h2></td></tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 13</span> {</div>
|
||||
<div class="line"><span class="lineno"> 14</span> <span class="keyword">auto</span>* nn = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
|
||||
<div class="line"><span class="lineno"> 14</span> <span class="keyword">auto</span>* nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
|
||||
<div class="line"><span class="lineno"> 15</span> nn->data = val;</div>
|
||||
<div class="line"><span class="lineno"> 16</span> nn->next = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><span class="lineno"> 17</span> front = nn;</div>
|
||||
<div class="line"><span class="lineno"> 18</span> rear = nn;</div>
|
||||
<div class="line"><span class="lineno"> 19</span> }</div>
|
||||
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -190,7 +191,7 @@ Private Attributes</h2></td></tr>
|
||||
<tr>
|
||||
<td class="memname">void Queue::dequeue </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td class="paramname"><span class="paramname"></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
@@ -208,6 +209,7 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 38</span> <span class="keyword">delete</span> n;</div>
|
||||
<div class="line"><span class="lineno"> 39</span> }</div>
|
||||
<div class="line"><span class="lineno"> 40</span> }</div>
|
||||
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -223,8 +225,7 @@ Private Attributes</h2></td></tr>
|
||||
<tr>
|
||||
<td class="memname">void Queue::enqueue </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">int </td>
|
||||
<td class="paramname"><em>val</em></td><td>)</td>
|
||||
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>val</em></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
@@ -240,7 +241,7 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 23</span> }</div>
|
||||
<div class="line"><span class="lineno"> 24</span> <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 25</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>* nn;</div>
|
||||
<div class="line"><span class="lineno"> 26</span> nn = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
|
||||
<div class="line"><span class="lineno"> 26</span> nn = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
|
||||
<div class="line"><span class="lineno"> 27</span> nn->data = val;</div>
|
||||
<div class="line"><span class="lineno"> 28</span> rear->next = nn;</div>
|
||||
<div class="line"><span class="lineno"> 29</span> nn->next = front;</div>
|
||||
@@ -262,7 +263,7 @@ Private Attributes</h2></td></tr>
|
||||
<tr>
|
||||
<td class="memname">void Queue::traverse </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td class="paramname"><span class="paramname"></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
@@ -298,7 +299,7 @@ Private Attributes</h2></td></tr>
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </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.10.0 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user