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

Documentation for 2dadbf73f4

Browse Source
This commit is contained in:
github-actions
2024-02-12 20:07:08 +00:00
parent b5b4d78981
commit a1eb9bd385
1261 changed files with 30404 additions and 29974 deletions
Download Patch File Download Diff File Expand all files Collapse all files

89
db/da9/classqueue.html
View File

@@ -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&lt; ValueType &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="../../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&amp;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&amp;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&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('db/da9/classqueue.html','../../'); initResizable(); });
$(function(){initNavTree('db/da9/classqueue.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -123,44 +125,44 @@ using&#160;</td><td class="memItemRight" valign="bottom"><b>value_type</b> = Val
</table><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:a353e4dd5772575905c78b0b30856e368" id="r_a353e4dd5772575905c78b0b30856e368"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">display</a> () const</td></tr>
<tr class="memitem:a353e4dd5772575905c78b0b30856e368" id="r_a353e4dd5772575905c78b0b30856e368"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a353e4dd5772575905c78b0b30856e368">display</a> () const</td></tr>
<tr class="memdesc:a353e4dd5772575905c78b0b30856e368"><td class="mdescLeft">&#160;</td><td class="mdescRight">prints the queue into the <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> <br /></td></tr>
<tr class="separator:a353e4dd5772575905c78b0b30856e368"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a386fc1df8610948d3117b12f24655c7d" id="r_a386fc1df8610948d3117b12f24655c7d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; value_type &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">toVector</a> () const</td></tr>
<tr class="memitem:a386fc1df8610948d3117b12f24655c7d" id="r_a386fc1df8610948d3117b12f24655c7d"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; value_type &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a386fc1df8610948d3117b12f24655c7d">toVector</a> () const</td></tr>
<tr class="memdesc:a386fc1df8610948d3117b12f24655c7d"><td class="mdescLeft">&#160;</td><td class="mdescRight">converts the queue into the <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:a386fc1df8610948d3117b12f24655c7d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4bc52ad6ed6b0cc33ad05f87f05f8bec" id="r_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a> () const</td></tr>
<tr class="memitem:a4bc52ad6ed6b0cc33ad05f87f05f8bec" id="r_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a> () const</td></tr>
<tr class="memdesc:a4bc52ad6ed6b0cc33ad05f87f05f8bec"><td class="mdescLeft">&#160;</td><td class="mdescRight">checks if the queue has no elements <br /></td></tr>
<tr class="separator:a4bc52ad6ed6b0cc33ad05f87f05f8bec"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ada88d0c1f34946d66386b7a11bee4e4d" id="r_ada88d0c1f34946d66386b7a11bee4e4d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a> (const value_type &amp;item)</td></tr>
<tr class="memitem:ada88d0c1f34946d66386b7a11bee4e4d" id="r_ada88d0c1f34946d66386b7a11bee4e4d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ada88d0c1f34946d66386b7a11bee4e4d">enQueue</a> (const value_type &amp;item)</td></tr>
<tr class="memdesc:ada88d0c1f34946d66386b7a11bee4e4d"><td class="mdescLeft">&#160;</td><td class="mdescRight">inserts a new item into the queue <br /></td></tr>
<tr class="separator:ada88d0c1f34946d66386b7a11bee4e4d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a75e231798bc706b8b0773a07f78713e7" id="r_a75e231798bc706b8b0773a07f78713e7"><td class="memItemLeft" align="right" valign="top">value_type&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a> () const</td></tr>
<tr class="memitem:a75e231798bc706b8b0773a07f78713e7" id="r_a75e231798bc706b8b0773a07f78713e7"><td class="memItemLeft" align="right" valign="top">value_type&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75e231798bc706b8b0773a07f78713e7">front</a> () const</td></tr>
<tr class="separator:a75e231798bc706b8b0773a07f78713e7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af27dbb72fb63f58f817a88550d7faa85" id="r_af27dbb72fb63f58f817a88550d7faa85"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">deQueue</a> ()</td></tr>
<tr class="memitem:af27dbb72fb63f58f817a88550d7faa85" id="r_af27dbb72fb63f58f817a88550d7faa85"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af27dbb72fb63f58f817a88550d7faa85">deQueue</a> ()</td></tr>
<tr class="memdesc:af27dbb72fb63f58f817a88550d7faa85"><td class="mdescLeft">&#160;</td><td class="mdescRight">removes the first element from the queue <br /></td></tr>
<tr class="separator:af27dbb72fb63f58f817a88550d7faa85"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6ed7f8dfefe8687841f36f2223069375" id="r_a6ed7f8dfefe8687841f36f2223069375"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">clear</a> ()</td></tr>
<tr class="memitem:a6ed7f8dfefe8687841f36f2223069375" id="r_a6ed7f8dfefe8687841f36f2223069375"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6ed7f8dfefe8687841f36f2223069375">clear</a> ()</td></tr>
<tr class="memdesc:a6ed7f8dfefe8687841f36f2223069375"><td class="mdescLeft">&#160;</td><td class="mdescRight">removes all elements from the queue <br /></td></tr>
<tr class="separator:a6ed7f8dfefe8687841f36f2223069375"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-types" name="pri-types"></a>
Private Types</h2></td></tr>
<tr class="memitem:a509d8e7c43f334eb0e582690305a6519" id="r_a509d8e7c43f334eb0e582690305a6519"><td class="memItemLeft" align="right" valign="top"><a id="a509d8e7c43f334eb0e582690305a6519" name="a509d8e7c43f334eb0e582690305a6519"></a>
using&#160;</td><td class="memItemRight" valign="bottom"><b>node_type</b> = <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt; ValueType &gt;</td></tr>
using&#160;</td><td class="memItemRight" valign="bottom"><b>node_type</b> = <a class="el" href="../../db/d8b/struct_node.html">Node</a>&lt;ValueType&gt;</td></tr>
<tr class="separator:a509d8e7c43f334eb0e582690305a6519"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:ac08ebdd38cb4ad74fc0a3f51888da604" id="r_ac08ebdd38cb4ad74fc0a3f51888da604"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a> () const</td></tr>
<tr class="memitem:ac08ebdd38cb4ad74fc0a3f51888da604" id="r_ac08ebdd38cb4ad74fc0a3f51888da604"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a> () const</td></tr>
<tr class="memdesc:ac08ebdd38cb4ad74fc0a3f51888da604"><td class="mdescLeft">&#160;</td><td class="mdescRight">throws an exception if queue is empty <br /></td></tr>
<tr class="separator:ac08ebdd38cb4ad74fc0a3f51888da604"><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:af6780e9b43326f557da405b65f7ad094" id="r_af6780e9b43326f557da405b65f7ad094"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../db/d8b/struct_node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a></td></tr>
<tr class="memitem:af6780e9b43326f557da405b65f7ad094" id="r_af6780e9b43326f557da405b65f7ad094"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../db/d8b/struct_node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a></td></tr>
<tr class="separator:af6780e9b43326f557da405b65f7ad094"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7611df63ebefae613d311039d7305143" id="r_a7611df63ebefae613d311039d7305143"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../db/d8b/struct_node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queueRear</a></td></tr>
<tr class="memitem:a7611df63ebefae613d311039d7305143" id="r_a7611df63ebefae613d311039d7305143"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a>&lt; <a class="el" href="../../db/d8b/struct_node.html">node_type</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a7611df63ebefae613d311039d7305143">queueRear</a></td></tr>
<tr class="separator:a7611df63ebefae613d311039d7305143"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad30c1f3cc9c107dcc10fc06c8580354e" id="r_ad30c1f3cc9c107dcc10fc06c8580354e"><td class="memItemLeft" align="right" valign="top"><a id="ad30c1f3cc9c107dcc10fc06c8580354e" name="ad30c1f3cc9c107dcc10fc06c8580354e"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>size</b> = 0</td></tr>
@@ -184,7 +186,7 @@ template&lt;class ValueType &gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::clear </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -197,12 +199,12 @@ template&lt;class ValueType &gt; </div>
<p>removes all elements from the queue </p>
<div class="fragment"><div class="line"><span class="lineno"> 90</span> {</div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queueRear</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 91</span> <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_variable" href="#a7611df63ebefae613d311039d7305143">queueRear</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 93</span> size = 0;</div>
<div class="line"><span class="lineno"> 94</span> }</div>
<div class="ttc" id="aclassqueue_html_a7611df63ebefae613d311039d7305143"><div class="ttname"><a href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queue::queueRear</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueRear</div><div class="ttdef"><b>Definition</b> queue.hpp:99</div></div>
<div class="ttc" id="aclassqueue_html_af6780e9b43326f557da405b65f7ad094"><div class="ttname"><a href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queue::queueFront</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueFront</div><div class="ttdef"><b>Definition</b> queue.hpp:97</div></div>
<div class="ttc" id="aclassqueue_html_a7611df63ebefae613d311039d7305143"><div class="ttname"><a href="#a7611df63ebefae613d311039d7305143">queue::queueRear</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueRear</div><div class="ttdef"><b>Definition</b> queue.hpp:99</div></div>
<div class="ttc" id="aclassqueue_html_af6780e9b43326f557da405b65f7ad094"><div class="ttname"><a href="#af6780e9b43326f557da405b65f7ad094">queue::queueFront</a></div><div class="ttdeci">std::shared_ptr&lt; node_type &gt; queueFront</div><div class="ttdef"><b>Definition</b> queue.hpp:97</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -220,7 +222,7 @@ template&lt;class ValueType &gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::deQueue </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -239,11 +241,11 @@ template&lt;class ValueType &gt; </div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 81</span> {</div>
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>();</div>
<div class="line"><span class="lineno"> 83</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a> = <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a>-&gt;next;</div>
<div class="line"><span class="lineno"> 82</span> <a class="code hl_function" href="#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>();</div>
<div class="line"><span class="lineno"> 83</span> <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a> = <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a>-&gt;next;</div>
<div class="line"><span class="lineno"> 84</span> --size;</div>
<div class="line"><span class="lineno"> 85</span> }</div>
<div class="ttc" id="aclassqueue_html_ac08ebdd38cb4ad74fc0a3f51888da604"><div class="ttname"><a href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">queue::ensureNotEmpty</a></div><div class="ttdeci">void ensureNotEmpty() const</div><div class="ttdoc">throws an exception if queue is empty</div><div class="ttdef"><b>Definition</b> queue.hpp:38</div></div>
<div class="ttc" id="aclassqueue_html_ac08ebdd38cb4ad74fc0a3f51888da604"><div class="ttname"><a href="#ac08ebdd38cb4ad74fc0a3f51888da604">queue::ensureNotEmpty</a></div><div class="ttdeci">void ensureNotEmpty() const</div><div class="ttdoc">throws an exception if queue is empty</div><div class="ttdef"><b>Definition</b> queue.hpp:38</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -266,7 +268,7 @@ template&lt;class ValueType &gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::display </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -280,7 +282,7 @@ template&lt;class ValueType &gt; </div>
<p>prints the queue into the <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> </p>
<div class="fragment"><div class="line"><span class="lineno"> 17</span> {</div>
<div class="line"><span class="lineno"> 18</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Front --&gt; &quot;</span>;</div>
<div class="line"><span class="lineno"> 19</span> display_all(this-&gt;<a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a>.get());</div>
<div class="line"><span class="lineno"> 19</span> display_all(this-&gt;<a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a>.get());</div>
<div class="line"><span class="lineno"> 20</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><span class="lineno"> 21</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Size of queue: &quot;</span> &lt;&lt; size &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><span class="lineno"> 22</span> }</div>
@@ -302,8 +304,7 @@ template&lt;class ValueType &gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::enQueue </td>
<td>(</td>
<td class="paramtype">const value_type &amp;&#160;</td>
<td class="paramname"><em>item</em></td><td>)</td>
<td class="paramtype">const value_type &amp;</td> <td class="paramname"><span class="paramname"><em>item</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -319,16 +320,16 @@ template&lt;class ValueType &gt; </div>
<div class="line"><span class="lineno"> 55</span> <span class="keyword">auto</span> newNode = std::make_shared&lt;node_type&gt;();</div>
<div class="line"><span class="lineno"> 56</span> newNode-&gt;data = item;</div>
<div class="line"><span class="lineno"> 57</span> newNode-&gt;next = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()) {</div>
<div class="line"><span class="lineno"> 59</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a> = newNode;</div>
<div class="line"><span class="lineno"> 60</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queueRear</a> = newNode;</div>
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()) {</div>
<div class="line"><span class="lineno"> 59</span> <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a> = newNode;</div>
<div class="line"><span class="lineno"> 60</span> <a class="code hl_variable" href="#a7611df63ebefae613d311039d7305143">queueRear</a> = newNode;</div>
<div class="line"><span class="lineno"> 61</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 62</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queueRear</a>-&gt;next = newNode;</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queueRear</a> = <a class="code hl_variable" href="../../db/da9/classqueue.html#a7611df63ebefae613d311039d7305143">queueRear</a>-&gt;next;</div>
<div class="line"><span class="lineno"> 62</span> <a class="code hl_variable" href="#a7611df63ebefae613d311039d7305143">queueRear</a>-&gt;next = newNode;</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_variable" href="#a7611df63ebefae613d311039d7305143">queueRear</a> = <a class="code hl_variable" href="#a7611df63ebefae613d311039d7305143">queueRear</a>-&gt;next;</div>
<div class="line"><span class="lineno"> 64</span> }</div>
<div class="line"><span class="lineno"> 65</span> ++size;</div>
<div class="line"><span class="lineno"> 66</span> }</div>
<div class="ttc" id="aclassqueue_html_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><div class="ttname"><a href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">queue::isEmptyQueue</a></div><div class="ttdeci">bool isEmptyQueue() const</div><div class="ttdoc">checks if the queue has no elements</div><div class="ttdef"><b>Definition</b> queue.hpp:49</div></div>
<div class="ttc" id="aclassqueue_html_a4bc52ad6ed6b0cc33ad05f87f05f8bec"><div class="ttname"><a href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">queue::isEmptyQueue</a></div><div class="ttdeci">bool isEmptyQueue() const</div><div class="ttdoc">checks if the queue has no elements</div><div class="ttdef"><b>Definition</b> queue.hpp:49</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -351,7 +352,7 @@ template&lt;class ValueType &gt; </div>
<tr>
<td class="memname">void <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::ensureNotEmpty </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -370,7 +371,7 @@ template&lt;class ValueType &gt; </div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 38</span> {</div>
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../db/da9/classqueue.html#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()) {</div>
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#a4bc52ad6ed6b0cc33ad05f87f05f8bec">isEmptyQueue</a>()) {</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">throw</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a>(<span class="stringliteral">&quot;Queue is empty.&quot;</span>);</div>
<div class="line"><span class="lineno"> 41</span> }</div>
<div class="line"><span class="lineno"> 42</span> }</div>
@@ -397,7 +398,7 @@ template&lt;class ValueType &gt; </div>
<tr>
<td class="memname">value_type <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::front </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -415,8 +416,8 @@ template&lt;class ValueType &gt; </div>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 72</span> {</div>
<div class="line"><span class="lineno"> 73</span> <a class="code hl_function" href="../../db/da9/classqueue.html#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>();</div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a>-&gt;data;</div>
<div class="line"><span class="lineno"> 73</span> <a class="code hl_function" href="#ac08ebdd38cb4ad74fc0a3f51888da604">ensureNotEmpty</a>();</div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a>-&gt;data;</div>
<div class="line"><span class="lineno"> 75</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -440,7 +441,7 @@ template&lt;class ValueType &gt; </div>
<tr>
<td class="memname">bool <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::isEmptyQueue </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -453,7 +454,7 @@ template&lt;class ValueType &gt; </div>
<p>checks if the queue has no elements </p>
<dl class="section return"><dt>Returns</dt><dd>true if the queue is empty, false otherwise </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 49</span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a> == <span class="keyword">nullptr</span>); }</div>
<div class="fragment"><div class="line"><span class="lineno"> 49</span>{ <span class="keywordflow">return</span> (<a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a> == <span class="keyword">nullptr</span>); }</div>
</div><!-- fragment -->
</div>
</div>
@@ -471,7 +472,7 @@ template&lt;class ValueType &gt; </div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; value_type &gt; <a class="el" href="../../db/da9/classqueue.html">queue</a>&lt; ValueType &gt;::toVector </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td> const</td>
</tr>
</table>
@@ -485,7 +486,7 @@ template&lt;class ValueType &gt; </div>
<p>converts the queue into the <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> containning all of the elements of the queue in the same order </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 29</span> {</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">return</span> push_all_to_vector(this-&gt;<a class="code hl_variable" href="../../db/da9/classqueue.html#af6780e9b43326f557da405b65f7ad094">queueFront</a>.get(), this-&gt;size);</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">return</span> push_all_to_vector(this-&gt;<a class="code hl_variable" href="#af6780e9b43326f557da405b65f7ad094">queueFront</a>.get(), this-&gt;size);</div>
<div class="line"><span class="lineno"> 31</span> }</div>
</div><!-- fragment -->
</div>
@@ -557,7 +558,7 @@ template&lt;class ValueType &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../db/da9/classqueue.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>