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 0953376d31

Browse Source
This commit is contained in:
github-actions
2023-06-16 21:18:14 +00:00
parent 26f1eee566
commit 14deeecd50
7241 changed files with 234176 additions and 54779 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
d7/ded/queue_8hpp_source.html
View File

@@ -3,7 +3,7 @@
<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.6"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/queue.hpp Source File</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -205,22 +205,22 @@ $(document).ready(function(){initNavTree('d7/ded/queue_8hpp_source.html','../../
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> </div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span><span class="preprocessor">#endif </span><span class="comment">// DATA_STRUCTURES_QUEUE_HPP_</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 class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition:</b> queue.hpp:9</div></div>
<div class="ttc" id="aclassqueue_html_a353e4dd5772575905c78b0b30856e368"><div class="ttname"><a href="../../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">queue::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">prints the queue into the std::cout</div><div class="ttdef"><b>Definition:</b> queue.hpp:17</div></div>
<div class="ttc" id="aclassqueue_html_a386fc1df8610948d3117b12f24655c7d"><div class="ttname"><a href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">queue::toVector</a></div><div class="ttdeci">std::vector&lt; value_type &gt; toVector() const</div><div class="ttdoc">converts the queue into the std::vector</div><div class="ttdef"><b>Definition:</b> queue.hpp:29</div></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_a6ed7f8dfefe8687841f36f2223069375"><div class="ttname"><a href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">queue::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">removes all elements from the queue</div><div class="ttdef"><b>Definition:</b> queue.hpp:90</div></div>
<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition:</b> queue.hpp:72</div></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_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_ada88d0c1f34946d66386b7a11bee4e4d"><div class="ttname"><a href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue::enQueue</a></div><div class="ttdeci">void enQueue(const value_type &amp;item)</div><div class="ttdoc">inserts a new item into the queue</div><div class="ttdef"><b>Definition:</b> queue.hpp:54</div></div>
<div class="ttc" id="aclassqueue_html_af27dbb72fb63f58f817a88550d7faa85"><div class="ttname"><a href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">queue::deQueue</a></div><div class="ttdeci">void deQueue()</div><div class="ttdoc">removes the first element from the queue</div><div class="ttdef"><b>Definition:</b> queue.hpp:81</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"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> queue.hpp:9</div></div>
<div class="ttc" id="aclassqueue_html_a353e4dd5772575905c78b0b30856e368"><div class="ttname"><a href="../../db/da9/classqueue.html#a353e4dd5772575905c78b0b30856e368">queue::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">prints the queue into the std::cout</div><div class="ttdef"><b>Definition</b> queue.hpp:17</div></div>
<div class="ttc" id="aclassqueue_html_a386fc1df8610948d3117b12f24655c7d"><div class="ttname"><a href="../../db/da9/classqueue.html#a386fc1df8610948d3117b12f24655c7d">queue::toVector</a></div><div class="ttdeci">std::vector&lt; value_type &gt; toVector() const</div><div class="ttdoc">converts the queue into the std::vector</div><div class="ttdef"><b>Definition</b> queue.hpp:29</div></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_a6ed7f8dfefe8687841f36f2223069375"><div class="ttname"><a href="../../db/da9/classqueue.html#a6ed7f8dfefe8687841f36f2223069375">queue::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdoc">removes all elements from the queue</div><div class="ttdef"><b>Definition</b> queue.hpp:90</div></div>
<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition</b> queue.hpp:72</div></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_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_ada88d0c1f34946d66386b7a11bee4e4d"><div class="ttname"><a href="../../db/da9/classqueue.html#ada88d0c1f34946d66386b7a11bee4e4d">queue::enQueue</a></div><div class="ttdeci">void enQueue(const value_type &amp;item)</div><div class="ttdoc">inserts a new item into the queue</div><div class="ttdef"><b>Definition</b> queue.hpp:54</div></div>
<div class="ttc" id="aclassqueue_html_af27dbb72fb63f58f817a88550d7faa85"><div class="ttname"><a href="../../db/da9/classqueue.html#af27dbb72fb63f58f817a88550d7faa85">queue::deQueue</a></div><div class="ttdeci">void deQueue()</div><div class="ttdoc">removes the first element from the queue</div><div class="ttdef"><b>Definition</b> queue.hpp:81</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="ainvalid_argument_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/error/invalid_argument.html">std::invalid_argument</a></div></div>
<div class="ttc" id="anode_8hpp_html"><div class="ttname"><a href="../../d3/d09/node_8hpp.html">node.hpp</a></div><div class="ttdoc">Provides Node class and related utilities.</div></div>
<div class="ttc" id="ashared_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr.html">std::shared_ptr</a></div></div>
<div class="ttc" id="asize_t_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a></div></div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:14</div></div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</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><!-- contents -->
</div><!-- doc-content -->
@@ -228,7 +228,7 @@ $(document).ready(function(){initNavTree('d7/ded/queue_8hpp_source.html','../../
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><b>queue.hpp</b></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.6 </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.7 </li>
</ul>
</div>
</body>