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

Documentation for 6e77f98494

Browse Source
This commit is contained in:
github-actions
2020-09-04 00:07:13 +00:00
parent bf1dd6a8dc
commit ae342b89e2
387 changed files with 7230 additions and 4978 deletions
Download Patch File Download Diff File Expand all files Collapse all files

27
d8/d38/queue_8h_source.html
View File

@@ -185,41 +185,62 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<div class="ttc" id="adisjoint__set_8cpp_html_a010965fc5f16cca5a62506afab24e4ec"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec">CreateSet</a></div><div class="ttdeci">void CreateSet(int n)</div><div class="ttdef"><b>Definition:</b> disjoint_set.cpp:37</div></div>
<div class="ttc" id="alinked__list_8cpp_html_ab1a372fe1e605bc0e0987dcdd7361180"><div class="ttname"><a href="../../da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180">data_structures::linked_list::isDigit</a></div><div class="ttdeci">bool isDigit(const std::string &amp;s)</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:40</div></div>
<div class="ttc" id="aclassqueue_html_ac16ccadebb765e1ddbe415cdce1a17a5"><div class="ttname"><a href="../../db/da9/classqueue.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="aclassdata__structures_1_1linked__list_1_1link_html_acf96f3a9a1d3b15268c38e8822300c11"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#acf96f3a9a1d3b15268c38e8822300c11">data_structures::linked_list::link::val</a></div><div class="ttdeci">int val()</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:63</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a1fb1792ab867dc26639eef368a56989e"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a1fb1792ab867dc26639eef368a56989e">data_structures::linked_list::list::erase</a></div><div class="ttdeci">void erase(int old_elem)</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:152</div></div>
<div class="ttc" id="aclassqueue_html_a26f48801df462ade003b50739196fa4c"><div class="ttname"><a href="../../db/da9/classqueue.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="abasic_string_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a></div><div class="ttdoc">STL class.</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 class="ttdoc">STL class.</div></div>
<div class="ttc" id="anamespacelinked__list_html"><div class="ttname"><a href="../../d3/db0/namespacelinked__list.html">linked_list</a></div><div class="ttdoc">Functions for singly linked list algorithm.</div></div>
<div class="ttc" id="adisjoint__set_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> disjoint_set.cpp:93</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html">data_structures::linked_list::list</a></div><div class="ttdef"><b>Definition:</b> linked_list.cpp:81</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="aclassdata__structures_1_1linked__list_1_1link_html_aba4672fbc40c38962d1510b843a577bb"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb">data_structures::linked_list::link::link</a></div><div class="ttdeci">link(int value=0)</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:75</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ae8a5aa5c6dbbc5b882030b52619dd1a3"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8a5aa5c6dbbc5b882030b52619dd1a3">data_structures::linked_list::list::last</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; last</div><div class="ttdoc">last link on the list</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:84</div></div>
<div class="ttc" id="adisjoint__set_8cpp_html_a34b9ead0608e676d9ae5188672427cc8"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#a34b9ead0608e676d9ae5188672427cc8">Find</a></div><div class="ttdeci">int Find(int x)</div><div class="ttdef"><b>Definition:</b> disjoint_set.cpp:53</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="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="aclassdata__structures_1_1linked__list_1_1link_html_af94c06f3220e5406245680f58b8e7081"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#af94c06f3220e5406245680f58b8e7081">data_structures::linked_list::link::psucc</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; psucc</div><div class="ttdoc">pointer to the next value on the list</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:56</div></div>
<div class="ttc" id="aclassqueue_html_a21381ee7f95daae0332665914780e970"><div class="ttname"><a href="../../db/da9/classqueue.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="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="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="areset_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/shared_ptr/reset.html">std::shared_ptr::reset</a></div><div class="ttdeci">T reset(T... args)</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1link_html_ac121ce37b6ea864b160ebcada0bce936"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#ac121ce37b6ea864b160ebcada0bce936">data_structures::linked_list::link::pvalue</a></div><div class="ttdeci">int pvalue</div><div class="ttdoc">value of the current link</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:55</div></div>
<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">Search algorithms.</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="aclassdata__structures_1_1linked__list_1_1list_html_abf7c97616b873ffeebdd0eac2d19d13e"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e">data_structures::linked_list::list::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:178</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_a9c73f393e984f93f33852334d1a04be0"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a9c73f393e984f93f33852334d1a04be0">data_structures::linked_list::list::push_front</a></div><div class="ttdeci">void push_front(int new_elem)</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:137</div></div>
<div class="ttc" id="astol_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a></div><div class="ttdeci">T stoi(T... args)</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ad585670a392c7e842c992d088093dff5"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ad585670a392c7e842c992d088093dff5">data_structures::linked_list::list::push_back</a></div><div class="ttdeci">void push_back(int new_elem)</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:123</div></div>
<div class="ttc" id="aclassqueue_html_a592c0580551ec0d3b4d43e8198d8a377"><div class="ttname"><a href="../../db/da9/classqueue.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="aclassqueue_html_ac2fff88dce4d7d2eb7134af382bd1b31"><div class="ttname"><a href="../../db/da9/classqueue.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="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="aclassqueue_html_ab2019d91e28c06de325fb3076b93a930"><div class="ttname"><a href="../../db/da9/classqueue.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="aclassdata__structures_1_1linked__list_1_1link_html_a28781355a468a1b95278ffe6277f3b6c"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html#a28781355a468a1b95278ffe6277f3b6c">data_structures::linked_list::link::succ</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; &amp; succ()</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:69</div></div>
<div class="ttc" id="alinked__list_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:219</div></div>
<div class="ttc" id="anamespacedata__structures_html"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html">data_structures</a></div><div class="ttdoc">Data Structures algorithms.</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="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="adisjoint__set_8cpp_html_a2fb0a7cd26a477e2d48ba7e0118bc985"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#a2fb0a7cd26a477e2d48ba7e0118bc985">InSameUnion</a></div><div class="ttdeci">bool InSameUnion(int x, int y)</div><div class="ttdef"><b>Definition:</b> disjoint_set.cpp:67</div></div>
<div class="ttc" id="anamespacedouble__hashing_html_a28083ecac6eb94b643281875c8665931"><div class="ttname"><a href="../../d0/d65/namespacedouble__hashing.html#a28083ecac6eb94b643281875c8665931">double_hashing::remove</a></div><div class="ttdeci">void remove(int key)</div><div class="ttdef"><b>Definition:</b> double_hash_hash_table.cpp:199</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="aclassqueue_html_ad215eee654953d25150bb25d5ac12b7c"><div class="ttname"><a href="../../db/da9/classqueue.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="aclassdata__structures_1_1linked__list_1_1list_html_a098be172c737f236763afdb8cada4835"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a098be172c737f236763afdb8cada4835">data_structures::linked_list::list::search</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; search(int find_elem)</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:194</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="aclassqueue_html_a36d47fdbedc199609818385110d9f922"><div class="ttname"><a href="../../db/da9/classqueue.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="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition:</b> queue.h:17</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_aa3801cea564a3b3bb7b03abfffdcf1e1"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#aa3801cea564a3b3bb7b03abfffdcf1e1">data_structures::linked_list::list::first</a></div><div class="ttdeci">std::shared_ptr&lt; link &gt; first</div><div class="ttdoc">link before the actual first element</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:83</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="aclassdata__structures_1_1linked__list_1_1list_html_a50e209b55b83622254177050945e7826"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#a50e209b55b83622254177050945e7826">data_structures::linked_list::list::list</a></div><div class="ttdeci">list()</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:89</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="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="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="adisjoint__set_8cpp_html_a44481bb75386fbb0f958a388d4b9f757"><div class="ttname"><a href="../../de/d23/disjoint__set_8cpp.html#a44481bb75386fbb0f958a388d4b9f757">Union</a></div><div class="ttdeci">void Union(int x, int y)</div><div class="ttdef"><b>Definition:</b> disjoint_set.cpp:78</div></div>
<div class="ttc" id="aclassdata__structures_1_1linked__list_1_1list_html_ae8424a4fce3d483f7c85d6f6a5c79a1a"><div class="ttname"><a href="../../d1/def/classdata__structures_1_1linked__list_1_1list.html#ae8424a4fce3d483f7c85d6f6a5c79a1a">data_structures::linked_list::list::isEmpty</a></div><div class="ttdeci">bool isEmpty()</div><div class="ttdef"><b>Definition:</b> linked_list.cpp:111</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="aclassdata__structures_1_1linked__list_1_1link_html"><div class="ttname"><a href="../../de/d9d/classdata__structures_1_1linked__list_1_1link.html">data_structures::linked_list::link</a></div><div class="ttdef"><b>Definition:</b> linked_list.cpp:53</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="aclassqueue_html_ae2a7a36270f5d15218a180fa59e5b3a5"><div class="ttname"><a href="../../db/da9/classqueue.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>