backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 20:31:43 +08:00
Code Issues Projects Releases Wiki Activity
Files
3a712e6b4ab42907a69bcd7899d249cc99e07ec6
C-Plus-Plus/d8/d38/queue_8h_source.html
github-actions 3a712e6b4a Documentation for 98bcc5df71
2020-06-23 02:46:25 +00:00

245 lines
32 KiB
HTML
Raw Blame History

<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.18"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/queue.h Source File</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>
<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>
<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 style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">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.8.18 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../'); initResizable(); });
/* @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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">queue.h</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span>&#160;<span class="comment">/* This class specifies the basic operation on a queue as a linked list */</span></div>
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span>&#160;<span class="preprocessor">#ifndef DATA_STRUCTURES_QUEUE_H_</span></div>
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span>&#160;<span class="preprocessor">#define DATA_STRUCTURES_QUEUE_H_</span></div>
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span>&#160; </div>
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span>&#160;<span class="preprocessor">#include &lt;cassert&gt;</span></div>
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span>&#160;<span class="preprocessor">#include &lt;iostream&gt;</span></div>
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span>&#160;<span class="comment">/** Definition of the node */</span></div>
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> Kind&gt;</div>
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span>&#160;<span class="keyword">struct </span><a class="code" href="../../d5/da1/structnode.html">node</a> {</div>
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span>&#160; Kind data;</div>
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#160; <a class="code" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *next;</div>
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>&#160;};</div>
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>&#160;<span class="comment">/** Definition of the queue class */</span></div>
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">class</span> Kind&gt;</div>
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>&#160;<span class="keyword">class </span><a class="code" href="../../d2/d36/structqueue.html">queue</a> {</div>
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>&#160; <span class="keyword">public</span>:<span class="comment"></span></div>
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>&#160;<span class="comment"> /** Show queue */</span></div>
<div class="line"><a name="l00020"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#a26f48801df462ade003b50739196fa4c"> 20</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="../../d2/d36/structqueue.html#a26f48801df462ade003b50739196fa4c">display</a>() {</div>
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span>&#160; <a class="code" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *current = <a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a>;</div>
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>&#160; <a class="codeRef" 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"><a name="l00023"></a><span class="lineno"> 23</span>&#160; <span class="keywordflow">while</span> (current != NULL) {</div>
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; current-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>&#160; current = current-&gt;next;</div>
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>&#160; }</div>
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>&#160; <a class="codeRef" 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; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>&#160; }</div>
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>&#160;<span class="comment"> /** Default constructor*/</span></div>
<div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#a21381ee7f95daae0332665914780e970"> 32</a></span>&#160; <a class="code" href="../../d2/d36/structqueue.html#a21381ee7f95daae0332665914780e970">queue</a>() {</div>
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>&#160; <a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> = NULL;</div>
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>&#160; <a class="code" href="../../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5">queueRear</a> = NULL;</div>
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>&#160; size = 0;</div>
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>&#160; }</div>
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>&#160;<span class="comment"> /** Destructor */</span></div>
<div class="line"><a name="l00039"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#ad215eee654953d25150bb25d5ac12b7c"> 39</a></span>&#160; <a class="code" href="../../d2/d36/structqueue.html#ad215eee654953d25150bb25d5ac12b7c">~queue</a>() {}</div>
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>&#160;<span class="comment"> /** Determine whether the queue is empty */</span></div>
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31"> 42</a></span>&#160; <span class="keywordtype">bool</span> <a class="code" href="../../d2/d36/structqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31">isEmptyQueue</a>() { <span class="keywordflow">return</span> (<a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> == NULL); }</div>
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>&#160;<span class="comment"> /** Add new item to the queue */</span></div>
<div class="line"><a name="l00045"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#a592c0580551ec0d3b4d43e8198d8a377"> 45</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="../../d2/d36/structqueue.html#a592c0580551ec0d3b4d43e8198d8a377">enQueue</a>(Kind item) {</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <a class="code" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *newNode;</div>
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>&#160; newNode = <span class="keyword">new</span> <a class="code" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a>;</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; newNode-&gt;data = item;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; newNode-&gt;next = NULL;</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> == NULL) {</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; <a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> = newNode;</div>
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>&#160; <a class="code" href="../../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5">queueRear</a> = newNode;</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <a class="code" href="../../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5">queueRear</a>-&gt;next = newNode;</div>
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; <a class="code" href="../../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5">queueRear</a> = <a class="code" href="../../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5">queueRear</a>-&gt;next;</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; }</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; size++;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; }</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160;<span class="comment"> /** Return the first element of the queue */</span></div>
<div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#a36d47fdbedc199609818385110d9f922"> 61</a></span>&#160; Kind <a class="code" href="../../d2/d36/structqueue.html#a36d47fdbedc199609818385110d9f922">front</a>() {</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; assert(<a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> != NULL);</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a>-&gt;data;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; }</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;<span class="comment"> /** Remove the top element of the queue */</span></div>
<div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#a089d4af5532e0a801f560070da6e1f86"> 67</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="../../d2/d36/structqueue.html#a089d4af5532e0a801f560070da6e1f86">deQueue</a>() {</div>
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; <a class="code" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *temp;</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <span class="keywordflow">if</span> (!<a class="code" href="../../d2/d36/structqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31">isEmptyQueue</a>()) {</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; temp = <a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a>;</div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> = <a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a>-&gt;next;</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <span class="keyword">delete</span> temp;</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; size--;</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Queue is empty !&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; }</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; }</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160;<span class="comment"></span> </div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160;<span class="comment"> /** Clear queue */</span></div>
<div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#ab2019d91e28c06de325fb3076b93a930"> 80</a></span>&#160; <span class="keywordtype">void</span> <a class="code" href="../../d2/d36/structqueue.html#ab2019d91e28c06de325fb3076b93a930">clear</a>() { <a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a> = NULL; }</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; </div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; <span class="keyword">private</span>:</div>
<div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5"> 83</a></span>&#160; <a class="code" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *<a class="code" href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queueFront</a>; <span class="comment">/**&lt; Pointer to the front of the queue */</span></div>
<div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="../../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5"> 84</a></span>&#160; <a class="code" href="../../d5/da1/structnode.html">node&lt;Kind&gt;</a> *<a class="code" href="../../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5">queueRear</a>; <span class="comment">/**&lt; Pointer to the rear of the queue */</span></div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; <span class="keywordtype">int</span> size;</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160;};</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; </div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160;<span class="preprocessor">#endif // DATA_STRUCTURES_QUEUE_H_</span></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="alist_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="astructqueue_html_a089d4af5532e0a801f560070da6e1f86"><div class="ttname"><a href="../../d2/d36/structqueue.html#a089d4af5532e0a801f560070da6e1f86">queue::deQueue</a></div><div class="ttdeci">void deQueue()</div><div class="ttdef"><b>Definition:</b> queue.h:67</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 class="ttdoc">STL class.</div></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> avltree.cpp:13</div></div>
<div class="ttc" id="asearch_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/search.html">std::search</a></div><div class="ttdeci">T search(T... args)</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></div>
<div class="ttc" id="astructqueue_html_ae2a7a36270f5d15218a180fa59e5b3a5"><div class="ttname"><a href="../../d2/d36/structqueue.html#ae2a7a36270f5d15218a180fa59e5b3a5">queue::queueRear</a></div><div class="ttdeci">node&lt; Kind &gt; * queueRear</div><div class="ttdef"><b>Definition:</b> queue.h:84</div></div>
<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:79</div></div>
<div class="ttc" id="areverse_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/reverse.html">std::reverse</a></div><div class="ttdeci">T reverse(T... args)</div></div>
<div class="ttc" id="astructqueue_html_a36d47fdbedc199609818385110d9f922"><div class="ttname"><a href="../../d2/d36/structqueue.html#a36d47fdbedc199609818385110d9f922">queue::front</a></div><div class="ttdeci">Kind front()</div><div class="ttdef"><b>Definition:</b> queue.h:61</div></div>
<div class="ttc" id="astructqueue_html_ad215eee654953d25150bb25d5ac12b7c"><div class="ttname"><a href="../../d2/d36/structqueue.html#ad215eee654953d25150bb25d5ac12b7c">queue::~queue</a></div><div class="ttdeci">~queue()</div><div class="ttdef"><b>Definition:</b> queue.h:39</div></div>
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</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="astructqueue_html"><div class="ttname"><a href="../../d2/d36/structqueue.html">queue</a></div><div class="ttdef"><b>Definition:</b> binary_search_tree.cpp:17</div></div>
<div class="ttc" id="aparanthesis__matching_8cpp_html_af93f4f37fc2ad9c37af4a715423b110c"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#af93f4f37fc2ad9c37af4a715423b110c">top</a></div><div class="ttdeci">int top</div><div class="ttdoc">pointer to track stack index</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:23</div></div>
<div class="ttc" id="aclasscll_html"><div class="ttname"><a href="../../d5/d15/classcll.html">cll</a></div><div class="ttdef"><b>Definition:</b> cll.h:17</div></div>
<div class="ttc" id="astructqueue_html_ab2019d91e28c06de325fb3076b93a930"><div class="ttname"><a href="../../d2/d36/structqueue.html#ab2019d91e28c06de325fb3076b93a930">queue::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> queue.h:80</div></div>
<div class="ttc" id="aavltree_8cpp_html_aa7cd8a68075fae1c33df41233c1bed6a"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#aa7cd8a68075fae1c33df41233c1bed6a">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:66</div></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="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
<div class="ttc" id="astructqueue_html_a21381ee7f95daae0332665914780e970"><div class="ttname"><a href="../../d2/d36/structqueue.html#a21381ee7f95daae0332665914780e970">queue::queue</a></div><div class="ttdeci">queue()</div><div class="ttdef"><b>Definition:</b> queue.h:32</div></div>
<div class="ttc" id="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></div><div class="ttdoc">STL class.</div></div>
<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_afcb07da7984e20b3207934696791f5df"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#afcb07da7984e20b3207934696791f5df">insertAtTheBeginning</a></div><div class="ttdeci">void insertAtTheBeginning(int data)</div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:50</div></div>
<div class="ttc" id="aremove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/remove.html">std::remove</a></div><div class="ttdeci">T remove(T... args)</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a600eaf353befc174637855795f12d258"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a600eaf353befc174637855795f12d258">endl</a></div><div class="ttdeci">#define endl</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:36</div></div>
<div class="ttc" id="astructqueue_html_ac2fff88dce4d7d2eb7134af382bd1b31"><div class="ttname"><a href="../../d2/d36/structqueue.html#ac2fff88dce4d7d2eb7134af382bd1b31">queue::isEmptyQueue</a></div><div class="ttdeci">bool isEmptyQueue()</div><div class="ttdef"><b>Definition:</b> queue.h:42</div></div>
<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_a73e11e0871f56342a30da93b6c93e8be"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a73e11e0871f56342a30da93b6c93e8be">getnode</a></div><div class="ttdeci">int getnode()</div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:32</div></div>
<div class="ttc" id="amatrix__exponentiation_8cpp_html_a9ecd98ce0064e2f7f97bb6a92f58ee72"><div class="ttname"><a href="../../d7/d35/matrix__exponentiation_8cpp.html#a9ecd98ce0064e2f7f97bb6a92f58ee72">a</a></div><div class="ttdeci">vector&lt; ll &gt; a</div><div class="ttdef"><b>Definition:</b> matrix_exponentiation.cpp:53</div></div>
<div class="ttc" id="astructqueue_html_ac16ccadebb765e1ddbe415cdce1a17a5"><div class="ttname"><a href="../../d2/d36/structqueue.html#ac16ccadebb765e1ddbe415cdce1a17a5">queue::queueFront</a></div><div class="ttdeci">node&lt; Kind &gt; * queueFront</div><div class="ttdef"><b>Definition:</b> queue.h:83</div></div>
<div class="ttc" id="amin_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a></div><div class="ttdeci">T min(T... args)</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:24</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="astructqueue_html_a26f48801df462ade003b50739196fa4c"><div class="ttname"><a href="../../d2/d36/structqueue.html#a26f48801df462ade003b50739196fa4c">queue::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> queue.h:20</div></div>
<div class="ttc" id="aleft_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/left.html">std::left</a></div><div class="ttdeci">T left(T... args)</div></div>
<div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="../../d8/dcc/namespacestd.html">std</a></div><div class="ttdoc">STL namespace.</div></div>
<div class="ttc" id="ainsert_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/list/insert.html">std::list::insert</a></div><div class="ttdeci">T insert(T... args)</div></div>
<div class="ttc" id="atower__of__hanoi_8cpp_html_a746d9a3984bba88fd6dd91978f6931ed"><div class="ttname"><a href="../../db/d3c/tower__of__hanoi_8cpp.html#a746d9a3984bba88fd6dd91978f6931ed">show</a></div><div class="ttdeci">void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)</div><div class="ttdef"><b>Definition:</b> tower_of_hanoi.cpp:19</div></div>
<div class="ttc" id="aavltree_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> avltree.cpp:134</div></div>
<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_a08ba214242a900e7251cec556b592f02"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#a08ba214242a900e7251cec556b592f02">freeNode</a></div><div class="ttdeci">void freeNode(int nodeToBeDeleted)</div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:42</div></div>
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
<div class="ttc" id="astructqueue_html_a592c0580551ec0d3b4d43e8198d8a377"><div class="ttname"><a href="../../d2/d36/structqueue.html#a592c0580551ec0d3b4d43e8198d8a377">queue::enQueue</a></div><div class="ttdeci">void enQueue(Kind item)</div><div class="ttdef"><b>Definition:</b> queue.h:45</div></div>
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
<div class="ttc" id="astruct_btree_html"><div class="ttname"><a href="../../d9/d90/struct_btree.html">Btree</a></div><div class="ttdef"><b>Definition:</b> morrisinorder.cpp:10</div></div>
<div class="ttc" id="aclassdouble__linked__list_html"><div class="ttname"><a href="../../d9/dee/classdouble__linked__list.html">double_linked_list</a></div><div class="ttdef"><b>Definition:</b> doubly_linked_list.cpp:11</div></div>
<div class="ttc" id="alinkedlist__implentation__usingarray_8cpp_html_aed19b403f559fc5d5a4bce724f9e263c"><div class="ttname"><a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html#aed19b403f559fc5d5a4bce724f9e263c">AvailArray</a></div><div class="ttdeci">Node AvailArray[100]</div><div class="ttdoc">array that will act as nodes of a linked list.</div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:19</div></div>
<!-- start footer part -->
<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.h</b></li>
<li class="footer">Generated on Tue Jun 23 2020 02:45:39 for Algorithms_in_C++ by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.18 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink