Documentation for b4b182a61d

2026-03-23 21:32:09 +08:00 · 2020-11-14 02:04:38 +00:00
parent fbcc091f32
commit 565a705309
342 changed files with 6382 additions and 5442 deletions
--- a/d7/de0/stack_8h_source.html
+++ b/d7/de0/stack_8h_source.html
@@ -249,27 +249,35 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
 <div class="ttc" id="aclassstack_html_a6cd4b95d5de00d41b2491392338384dc"><div class="ttname"><a href="../../d1/dc2/classstack.html#a6cd4b95d5de00d41b2491392338384dc">stack::pop</a></div><div class="ttdeci">void pop()</div><div class="ttdef"><b>Definition:</b> stack.h:99</div></div>
 <div class="ttc" id="asrand_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/srand.html">std::srand</a></div><div class="ttdeci">T srand(T... args)</div></div>
 <div class="ttc" id="aclassstack_html_ae8547e097cc753d5eab0207ed23d8920"><div class="ttname"><a href="../../d1/dc2/classstack.html#ae8547e097cc753d5eab0207ed23d8920">stack::stack</a></div><div class="ttdeci">stack(const stack&lt; Type &gt; &amp;otherStack)</div><div class="ttdef"><b>Definition:</b> stack.h:47</div></div>
+<div class="ttc" id="anamespacequeue__using__array_html"><div class="ttname"><a href="../../d9/d70/namespacequeue__using__array.html">queue_using_array</a></div><div class="ttdoc">Functions for Queue using Array implementation.</div></div>
 <div class="ttc" id="astructdata__structures_1_1_node_html_a54a6777e72b639c3ee6446a541db8e78"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#a54a6777e72b639c3ee6446a541db8e78">data_structures::Node::Node</a></div><div class="ttdeci">Node(int key, int level, void *value=nullptr)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:44</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&lt; Node &gt;</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a2f676f2f249eb36dfd49711a03e9e67e"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array::front</a></div><div class="ttdeci">int8_t front</div><div class="ttdoc">Index of head of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:46</div></div>
 <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a812611f80b8079268dbb19cc4e9bee5c"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a812611f80b8079268dbb19cc4e9bee5c">data_structures::SkipList::displayList</a></div><div class="ttdeci">void displayList()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:191</div></div>
 <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a3e249c2c35a8b7f5ffd2d77fee60d650"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a3e249c2c35a8b7f5ffd2d77fee60d650">data_structures::SkipList::level</a></div><div class="ttdeci">int level</div><div class="ttdoc">Maximum level of the skiplist.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:56</div></div>
 <div class="ttc" id="anamespacedata__structures_html_ac0d7e0be24da9f41bcb19745873c436a"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#ac0d7e0be24da9f41bcb19745873c436a">data_structures::MAX_LEVEL</a></div><div class="ttdeci">constexpr int MAX_LEVEL</div><div class="ttdoc">Maximum level of skip list.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:27</div></div>
 <div class="ttc" id="aclassdata__structures_1_1_skip_list_html"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html">data_structures::SkipList</a></div><div class="ttdef"><b>Definition:</b> skip_list.cpp:55</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="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/size.html">std::array::size</a></div><div class="ttdeci">T size(T... args)</div></div>
 <div class="ttc" id="astack_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/stack.html">std::stack</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="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_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:40</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="askip__list_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:212</div></div>
 <div class="ttc" id="apush_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">std::vector::push_back</a></div><div class="ttdeci">T push_back(T... args)</div></div>
 <div class="ttc" id="astructdata__structures_1_1_node_html"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html">data_structures::Node</a></div><div class="ttdef"><b>Definition:</b> skip_list.cpp:33</div></div>
 <div class="ttc" id="agraph__coloring_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d3/d40/graph__coloring_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdef"><b>Definition:</b> graph_coloring.cpp:96</div></div>
+<div class="ttc" id="aat_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array/at.html">std::array::at</a></div><div class="ttdeci">T at(T... args)</div></div>
+<div class="ttc" id="aqueue__using__array_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:109</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="astructdata__structures_1_1_node_html_a6b973b0bded99b0c0bd84e887bf8c731"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#a6b973b0bded99b0c0bd84e887bf8c731">data_structures::Node::value</a></div><div class="ttdeci">void * value</div><div class="ttdoc">pointer of value</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:35</div></div>
 <div class="ttc" id="aclassstack__linked_list_html"><div class="ttname"><a href="../../d2/dc4/classstack__linked_list.html">stack_linkedList</a></div><div class="ttdef"><b>Definition:</b> queue_using_linkedlist.cpp:10</div></div>
 <div class="ttc" id="aqueue__using__two__stacks_8cpp_html_a831ded10ecad88c14a8e22b96f4c1863"><div class="ttname"><a href="../../df/dd0/queue__using__two__stacks_8cpp.html#a831ded10ecad88c14a8e22b96f4c1863">queue_test</a></div><div class="ttdeci">void queue_test()</div><div class="ttdef"><b>Definition:</b> queue_using_two_stacks.cpp:101</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="aarray_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/array.html">std::array&lt; int16_t, max_size &gt;</a></div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_a9883dfcceede9a42227d2d313ae86f85"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array::rear</a></div><div class="ttdeci">int8_t rear</div><div class="ttdoc">Index of tail of the array.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:47</div></div>
 <div class="ttc" id="astructlinkedlist_html"><div class="ttname"><a href="../../d0/dff/structlinkedlist.html">linkedlist</a></div><div class="ttdef"><b>Definition:</b> queue_using_linkedlist.cpp:6</div></div>
+<div class="ttc" id="aclassdata__structures_1_1queue__using__array_1_1_queue___array_html_ae69a0bf6c9921b37c516c8a4d2fb904d"><div class="ttname"><a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array::arr</a></div><div class="ttdeci">std::array&lt; int16_t, max_size &gt; arr</div><div class="ttdoc">All stored data.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:48</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="aclassstack_html_a5705c3926dcf5fd3f9c964467a50b81d"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5705c3926dcf5fd3f9c964467a50b81d">stack::push</a></div><div class="ttdeci">void push(Type item)</div><div class="ttdef"><b>Definition:</b> stack.h:83</div></div>
 <div class="ttc" id="astructdata__structures_1_1_node_html_ac75aa86a598357c5c882ec6a1174aa68"><div class="ttname"><a href="../../d9/d49/structdata__structures_1_1_node.html#ac75aa86a598357c5c882ec6a1174aa68">data_structures::Node::key</a></div><div class="ttdeci">int key</div><div class="ttdoc">key integer</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:34</div></div>
@@ -289,7 +297,7 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
 <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="aclassdata__structures_1_1_skip_list_html_aa3f3813e9896792fc86b296547689ba4"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#aa3f3813e9896792fc86b296547689ba4">data_structures::SkipList::randomLevel</a></div><div class="ttdeci">int randomLevel()</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:75</div></div>
 <div class="ttc" id="aclassstack_html"><div class="ttname"><a href="../../d1/dc2/classstack.html">stack</a></div><div class="ttdef"><b>Definition:</b> stack.h:26</div></div>
-<div class="ttc" id="aclass_queue___array_html"><div class="ttname"><a href="../../d0/dd2/class_queue___array.html">Queue_Array</a></div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:13</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 &amp;)</div><div class="ttdoc">Add element to the first of the queue.</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:55</div></div>
 <div class="ttc" id="aclassstack_html_a67f65710c376f67d1ba3bde45a9cb628"><div class="ttname"><a href="../../d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628">stack::display</a></div><div class="ttdeci">void display()</div><div class="ttdef"><b>Definition:</b> stack.h:29</div></div>
 <div class="ttc" id="aclassstack_html_a066e4505155b009913c47b2648b1067a"><div class="ttname"><a href="../../d1/dc2/classstack.html#a066e4505155b009913c47b2648b1067a">stack::isEmptyStack</a></div><div class="ttdeci">bool isEmptyStack()</div><div class="ttdef"><b>Definition:</b> stack.h:80</div></div>
 <div class="ttc" id="astructnode_html_a42309387b3fa0237ec200c025071ad37"><div class="ttname"><a href="../../d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37">node::data</a></div><div class="ttdeci">Type data</div><div class="ttdoc">data at current node</div><div class="ttdef"><b>Definition:</b> stack.h:17</div></div>
@@ -297,14 +305,17 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
 <div class="ttc" id="aclassstack_html_a7289037c059aaad492b4d68e6bd54453"><div class="ttname"><a href="../../d1/dc2/classstack.html#a7289037c059aaad492b4d68e6bd54453">stack::stackTop</a></div><div class="ttdeci">node&lt; Type &gt; * stackTop</div><div class="ttdef"><b>Definition:</b> stack.h:146</div></div>
 <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_ad7e392386d7db622185d6f7c718e4f16"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#ad7e392386d7db622185d6f7c718e4f16">data_structures::SkipList::header</a></div><div class="ttdeci">std::shared_ptr&lt; Node &gt; header</div><div class="ttdoc">Pointer to the header node.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:57</div></div>
 <div class="ttc" id="aclassstack_html_a0ac1dba9c7019acdc825b31d06eb0b71"><div class="ttname"><a href="../../d1/dc2/classstack.html#a0ac1dba9c7019acdc825b31d06eb0b71">stack::~stack</a></div><div class="ttdeci">~stack()</div><div class="ttdef"><b>Definition:</b> stack.h:77</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:72</div></div>
 <div class="ttc" id="aparanthesis__matching_8cpp_html_aae41c72130114bf31204cde6873b6095"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#aae41c72130114bf31204cde6873b6095">push</a></div><div class="ttdeci">void push(char ch)</div><div class="ttdoc">push byte to stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:26</div></div>
 <div class="ttc" id="aparanthesis__matching_8cpp_html_a6d25c7dfbfeb52c3cb9d1b56ab49b664"><div class="ttname"><a href="../../dc/dc5/paranthesis__matching_8cpp.html#a6d25c7dfbfeb52c3cb9d1b56ab49b664">pop</a></div><div class="ttdeci">char pop()</div><div class="ttdoc">pop a byte out of stack variable</div><div class="ttdef"><b>Definition:</b> paranthesis_matching.cpp:29</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="anamespacedata__structures_html_a903639d8e6f955dd8d5c263781455d61"><div class="ttname"><a href="../../d5/d3c/namespacedata__structures.html#a903639d8e6f955dd8d5c263781455d61">data_structures::PROBABILITY</a></div><div class="ttdeci">constexpr float PROBABILITY</div><div class="ttdoc">Current probability for &quot;coin toss&quot;.</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:28</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:90</div></div>
 <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a2249e3ab2f8a0f2334b90635202de4f2"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a2249e3ab2f8a0f2334b90635202de4f2">data_structures::SkipList::searchElement</a></div><div class="ttdeci">void * searchElement(int key)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:170</div></div>
 <div class="ttc" id="aclassdata__structures_1_1_skip_list_html_a40a4042bdf0b6683b5f21ae7854de8a9"><div class="ttname"><a href="../../d4/d90/classdata__structures_1_1_skip_list.html#a40a4042bdf0b6683b5f21ae7854de8a9">data_structures::SkipList::insertElement</a></div><div class="ttdeci">void insertElement(int key, void *value)</div><div class="ttdef"><b>Definition:</b> skip_list.cpp:90</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="aclassstack_html_a5cc5efbbd4ea14b3e378580f1388423b"><div class="ttname"><a href="../../d1/dc2/classstack.html#a5cc5efbbd4ea14b3e378580f1388423b">stack::clear</a></div><div class="ttdeci">void clear()</div><div class="ttdef"><b>Definition:</b> stack.h:112</div></div>
+<div class="ttc" id="aqueue__using__array_8cpp_html_a2d49e79bd164c298912db252970520d8"><div class="ttname"><a href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a></div><div class="ttdeci">constexpr uint16_t max_size</div><div class="ttdoc">for std::array</div><div class="ttdef"><b>Definition:</b> queue_using_array.cpp:22</div></div>
 <div class="ttc" id="anext_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/iterator/next.html">std::next</a></div><div class="ttdeci">T next(T... args)</div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->