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

Documentation for 1a1570d775

Browse Source
This commit is contained in:
github-actions
2023-04-28 14:48:59 +00:00
parent ffdd173f0d
commit 7312767170
3827 changed files with 57379 additions and 55777 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
d5/d3c/namespacedata__structures.html
View File

@@ -118,6 +118,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">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d49/structdata__structures_1_1_node.html">Node</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="../../dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">class representation of the segment tree <a href="../../dd/d95/classdata__structures_1_1_segment_tree.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="../../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="../../d0/d3e/classdata__structures_1_1trie.html">trie</a></td></tr>
@@ -156,6 +159,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></p>
<p>Stack Data Structure Using the <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> Data Structure.</p>
<p>Data-structure algorithms.</p>
<p>For assert.</p>
<p>for managing dynamic storage</p>
<p>Algorithms with data structures.</p>
<p>for assert</p>
@@ -166,6 +170,7 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><b>PROBABILIT
<p>Algorithms with data structures</p>
<p>for assert for I/O operations</p>
<p>Data Structures algorithms</p>
<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>