backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-11 19:17:21 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 445f6722d8

Browse Source
This commit is contained in:
github-actions
2020-06-23 16:13:04 +00:00
parent 563d8880ef
commit 4c453e21a3
399 changed files with 3643 additions and 3455 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
d8/d38/queue_8h_source.html
View File

@@ -184,7 +184,6 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
<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>
@@ -199,14 +198,12 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
<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>
@@ -214,13 +211,11 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
<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>
@@ -230,12 +225,13 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
<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="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition:</b> list_array.cpp:8</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 14:32:53 for Algorithms_in_C++ by
<li class="footer">Generated on Tue Jun 23 2020 16:11:59 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>