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

Documentation for 54a20b447e

Browse Source
This commit is contained in:
realstealthninja
2024-09-01 04:39:22 +00:00
parent 0e621dc6a3
commit 2a5773d8eb
339 changed files with 3051 additions and 1676 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
d5/d3c/namespacedata__structures.html
View File

@@ -137,6 +137,9 @@ Classes</h2></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d90/classdata__structures_1_1_skip_list.html">SkipList</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html">Stack</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Class representation of a stack. <a href="../../d2/dc8/classdata__structures_1_1_stack.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html">trie</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Trie" target="_blank">Trie</a> implementation for small-case English alphabets <code>a-z</code> <a href="../../d0/d3e/classdata__structures_1_1trie.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -171,7 +174,8 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<div class="textblock"><p>for IO operations </p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></p>
<p>For IO operations.</p>
<p>Stack Data Structure Using the <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> Data Structure.</p>
<p><a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> Data Structure Using the <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> Data Structure.</p>
<p>For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/error/out_of_range.html">std::out_of_range</a>.</p>
<p>Data-structure algorithms.</p>
<p>For assert.</p>
<p>for managing dynamic storage</p>
@@ -187,7 +191,9 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<p>For IO operations For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/min.html">std::min</a> and <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert</p>
<p>Data Structures algorithms</p>
<p>Using 2 Queues inside the Stack class, we can easily implement Stack data structure with heavy computation in push function.</p>
<p>For std::assert For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a></p>
<p><a class="el" href="../../d5/d3c/namespacedata__structures.html" title="for IO operations">data_structures</a></p>
<p>Using 2 Queues inside the <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> class, we can easily implement <a class="el" href="../../d2/dc8/classdata__structures_1_1_stack.html" title="Class representation of a stack.">Stack</a> data structure with heavy computation in push function.</p>
<p>References used: <a href="https://www.studytonight.com/data-structures/stack-using-queue" target="_blank">StudyTonight</a> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/tushar2407" target="_blank">tushar2407</a> for assert for IO operations for queue data structure</dd></dl>
<p>Data structures algorithms</p>
<p>For array For assert</p>

1
d5/d3c/namespacedata__structures.js vendored
View File

@@ -6,6 +6,7 @@ var namespacedata__structures =
[ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ],
[ "SegmentTree", "dd/d95/classdata__structures_1_1_segment_tree.html", "dd/d95/classdata__structures_1_1_segment_tree" ],
[ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ],
[ "Stack", "d2/dc8/classdata__structures_1_1_stack.html", "d2/dc8/classdata__structures_1_1_stack" ],
[ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ],
[ "hashDJB2", "d5/d3c/namespacedata__structures.html#a271c753baf6dc5ac6f19fa03c5873eb4", null ],
[ "hashInt_1", "d5/d3c/namespacedata__structures.html#aa6deb9d4a0f63ea97aef3dce4c6c6677", null ],