mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
Documentation for c6af943508
This commit is contained in:
@@ -116,11 +116,12 @@ $(function(){initNavTree('d8/df0/queue__using__array_8cpp.html','../../'); initR
|
||||
<p>Implementation of Linear [<a class="el" href="../../dc/db5/struct_queue.html">Queue</a> using array] (<a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">https://www.geeksforgeeks.org/array-implementation-of-queue-simple/</a>).
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <array></code><br />
|
||||
<code>#include <cstdint></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for queue_using_array.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d6d/queue__using__array_8cpp__incl.svg" width="164" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d6d/queue__using__array_8cpp__incl.svg" width="242" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
|
||||
@@ -147,7 +148,7 @@ Functions</h2></td></tr>
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
|
||||
Variables</h2></td></tr>
|
||||
<tr class="memitem:a2d49e79bd164c298912db252970520d8" id="r_a2d49e79bd164c298912db252970520d8"><td class="memItemLeft" align="right" valign="top">constexpr uint16_t </td><td class="memItemRight" valign="bottom"><a class="el" href="#a2d49e79bd164c298912db252970520d8">max_size</a> {10}</td></tr>
|
||||
<tr class="memdesc:a2d49e79bd164c298912db252970520d8"><td class="mdescLeft"> </td><td class="mdescRight">for io operations <br /></td></tr>
|
||||
<tr class="memdesc:a2d49e79bd164c298912db252970520d8"><td class="mdescLeft"> </td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> <br /></td></tr>
|
||||
<tr class="separator:a2d49e79bd164c298912db252970520d8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
@@ -178,41 +179,41 @@ Algorithm</h3>
|
||||
|
||||
<p>Main function. </p>
|
||||
<p>Allows the user to add and delete values from the queue. Also allows user to display values in the queue. </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 111</span> {</div>
|
||||
<div class="line"><span class="lineno"> 112</span> <span class="keywordtype">int</span> op{0}, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{0};</div>
|
||||
<div class="line"><span class="lineno"> 113</span> <a class="code hl_class" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a> ob;</div>
|
||||
<div class="line"><span class="lineno"> 114</span> </div>
|
||||
<div class="line"><span class="lineno"> 115</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n1. enqueue(Insertion) "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 116</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n2. dequeue(Deletion)"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 117</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n3. Display"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 118</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n4. Exit"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 119</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 120</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nEnter your choice "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 121</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> op;</div>
|
||||
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">if</span> (op == 1) {</div>
|
||||
<div class="line"><span class="lineno"> 123</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter data "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
|
||||
<div class="line"><span class="lineno"> 125</span> ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
|
||||
<div class="line"><span class="lineno"> 126</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 2) {</div>
|
||||
<div class="line"><span class="lineno"> 127</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>();</div>
|
||||
<div class="line"><span class="lineno"> 128</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\ndequeue element is:\t"</span> << <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
|
||||
<div class="line"><span class="lineno"> 129</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 3) {</div>
|
||||
<div class="line"><span class="lineno"> 130</span> ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>();</div>
|
||||
<div class="line"><span class="lineno"> 131</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 4) {</div>
|
||||
<div class="line"><span class="lineno"> 132</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(0);</div>
|
||||
<div class="line"><span class="lineno"> 133</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 134</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nWrong choice "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 135</span> }</div>
|
||||
<div class="line"><span class="lineno"> 136</span> }</div>
|
||||
<div class="line"><span class="lineno"> 137</span> </div>
|
||||
<div class="line"><span class="lineno"> 138</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 139</span>}</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 112</span> {</div>
|
||||
<div class="line"><span class="lineno"> 113</span> <span class="keywordtype">int</span> op{0}, <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{0};</div>
|
||||
<div class="line"><span class="lineno"> 114</span> <a class="code hl_class" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a> ob;</div>
|
||||
<div class="line"><span class="lineno"> 115</span> </div>
|
||||
<div class="line"><span class="lineno"> 116</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n1. enqueue(Insertion) "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 117</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n2. dequeue(Deletion)"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 118</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n3. Display"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 119</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n4. Exit"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 120</span> <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 121</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nEnter your choice "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 122</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> op;</div>
|
||||
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (op == 1) {</div>
|
||||
<div class="line"><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Enter data "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 125</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
|
||||
<div class="line"><span class="lineno"> 126</span> ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
|
||||
<div class="line"><span class="lineno"> 127</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 2) {</div>
|
||||
<div class="line"><span class="lineno"> 128</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>();</div>
|
||||
<div class="line"><span class="lineno"> 129</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\ndequeue element is:\t"</span> << <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
|
||||
<div class="line"><span class="lineno"> 130</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 3) {</div>
|
||||
<div class="line"><span class="lineno"> 131</span> ob.<a class="code hl_function" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>();</div>
|
||||
<div class="line"><span class="lineno"> 132</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 4) {</div>
|
||||
<div class="line"><span class="lineno"> 133</span> <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(0);</div>
|
||||
<div class="line"><span class="lineno"> 134</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 135</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nWrong choice "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 136</span> }</div>
|
||||
<div class="line"><span class="lineno"> 137</span> }</div>
|
||||
<div class="line"><span class="lineno"> 138</span> </div>
|
||||
<div class="line"><span class="lineno"> 139</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 140</span>}</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="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="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:43</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:75</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:58</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:93</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></div><div class="ttdoc">Queue_Array class containing the main data and also index of head and tail of the array.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:44</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2aaf88c9954ef3ab686f8e4bfbd87622"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array::dequeue</a></div><div class="ttdeci">int dequeue()</div><div class="ttdoc">Delete element from back of the queue.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:76</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a4dc64488c36f84d927365fa8d1933663"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array::enqueue</a></div><div class="ttdeci">void enqueue(const int16_t &)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:59</div></div>
|
||||
<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a688b7ea064739ea9fa66bf64bf4ae631"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array::display</a></div><div class="ttdeci">void display() const</div><div class="ttdoc">Show all saved data.</div><div class="ttdef"><b>Definition</b> queue_using_array.cpp:94</div></div>
|
||||
<div class="ttc" id="aexit_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/program/exit.html">std::exit</a></div><div class="ttdeci">T exit(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><!-- fragment --><div class="dynheader">
|
||||
@@ -244,9 +245,9 @@ Here is the call graph for this function:</div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>for io operations </p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> Maximum size of the queue </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 23</span>{10}; <span class="comment">///< Maximum size of the queue</span></div>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> </p>
|
||||
<p>for io operations Maximum size of the queue </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 24</span>{10}; <span class="comment">///< Maximum size of the queue</span></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user