backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-06-15 22:58:56 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for b4b182a61d

Browse Source
This commit is contained in:
github-actions
2020-11-14 02:04:38 +00:00
parent fbcc091f32
commit 565a705309
342 changed files with 6382 additions and 5442 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
annotated.html
View File

@@ -102,9 +102,11 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_1_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_1_0_" class="arrow" onclick="toggleFolder('1_0_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>linked_list</b></td><td class="desc"></td></tr>
<tr id="row_1_0_0_" class="even"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html" target="_self">link</a></td><td class="desc"></td></tr>
<tr id="row_1_0_1_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_1_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_1_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">SkipList</a></td><td class="desc"></td></tr>
<tr id="row_1_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_1_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_1_1_" class="arrow" onclick="toggleFolder('1_1_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><b>queue_using_array</b></td><td class="desc"></td></tr>
<tr id="row_1_1_0_"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_1_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_1_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">SkipList</a></td><td class="desc"></td></tr>
<tr id="row_1_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_2_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d65/namespacedouble__hashing.html" target="_self">double_hashing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Double_hashing">double hashing</a> algorithm </td></tr>
<tr id="row_2_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/structdouble__hashing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d5/d5f/namespacegeometry.html" target="_self">geometry</a></td><td class="desc">Geometry algorithms </td></tr>
@@ -162,14 +164,13 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_39_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_40_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_40_" class="arrow" onclick="toggleFolder('40_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_40_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_39_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_39_" class="arrow" onclick="toggleFolder('39_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_39_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

1
annotated_dup.js
View File

@@ -34,7 +34,6 @@ var annotated_dup =
[ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ],
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
[ "Queue_Array", "d0/dd2/class_queue___array.html", "d0/dd2/class_queue___array" ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
[ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ],
[ "stack", "d1/dc2/classstack.html", "d1/dc2/classstack" ],

2
classes.html
View File

@@ -159,7 +159,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<tr><td valign="top"><a class="el" href="da/d5a/class_complex.html">Complex</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html">Graph</a> (graph::is_graph_bipartite)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d0/dd2/class_queue___array.html">Queue_Array</a>&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a> (data_structures::queue_using_array)&#160;&#160;&#160;</td>
<td valign="top"><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html">Tree</a> (range_queries::heavy_light_decomposition)&#160;&#160;&#160;</td>
</tr>
<tr><td valign="top"><a class="el" href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html">Convexhull</a> (geometry::jarvis)&#160;&#160;&#160;</td>

11
d0/dd2/class_queue___array.js
View File

@@ -1,11 +0,0 @@
var class_queue___array =
[
[ "Queue_Array", "d0/dd2/class_queue___array.html#abf20bb235f99915addd7f162008365be", null ],
[ "dequeue", "d0/dd2/class_queue___array.html#a4e1ea2bf04c99ef258888fd4303f09cd", null ],
[ "display", "d0/dd2/class_queue___array.html#aa8c58cb7bfd146c39e9dd0a39d47dce7", null ],
[ "enqueue", "d0/dd2/class_queue___array.html#a52de5f54eee2b875016fed8abb64d47a", null ],
[ "arr", "d0/dd2/class_queue___array.html#a81c4648299cc693c61e73b2d7022f420", null ],
[ "front", "d0/dd2/class_queue___array.html#a6de07e48dcd70df0b6c9affe94f7742f", null ],
[ "rear", "d0/dd2/class_queue___array.html#abf0003cf9a3ef11c752a40475f586609", null ],
[ "size", "d0/dd2/class_queue___array.html#a02be998c5cb601b25709804f6887909b", null ]
];

5
d1/d6d/queue__using__array_8cpp__incl.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="data_structures/queue_using_array.cpp" name="data_structures/queue_using_array.cpp">
<area shape="rect" id="node1" title="Implementation of Linear Queue using array." alt="" coords="9,5,159,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,77,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="101,95,152,121"/>
</map>

1
d1/d6d/queue__using__array_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
531e2cf0e1ec125b5b629a3919e25196

53
d1/d6d/queue__using__array_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,53 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: data_structures/queue_using_array.cpp Pages: 1 -->
<svg width="124pt" height="95pt"
viewBox="0.00 0.00 123.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>data_structures/queue_using_array.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 119.5,-91 119.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Implementation of Linear Queue using array.">
<polygon fill="#bfbfbf" stroke="black" points="2.5,-56.5 2.5,-86.5 115.5,-86.5 115.5,-56.5 2.5,-56.5"/>
<text text-anchor="start" x="10.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/queue</text>
<text text-anchor="middle" x="59" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 54,-19.5 54,-0.5 0,-0.5"/>
<text text-anchor="middle" x="27" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M51.42,-56.4C46.96,-48.11 41.28,-37.55 36.52,-28.71"/>
<polygon fill="midnightblue" stroke="midnightblue" points="39.48,-26.81 31.66,-19.66 33.31,-30.12 39.48,-26.81"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="72,-0.5 72,-19.5 110,-19.5 110,-0.5 72,-0.5"/>
<text text-anchor="middle" x="91" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M66.58,-56.4C71.04,-48.11 76.72,-37.55 81.48,-28.71"/>
<polygon fill="midnightblue" stroke="midnightblue" points="84.69,-30.12 86.34,-19.66 78.52,-26.81 84.69,-30.12"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.4 KiB

12
d1/d9a/hopcroft__karp_8cpp.html
View File

@@ -138,22 +138,22 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm">Hopcroft–Karp</a> algorithm. </p>
<p>The Hopcroft–Karp algorithm is an algorithm that takes as input a bipartite graph and produces as output a maximum cardinality matching, it runs in O(E√V) time in worst case.</p>
<h3><a class="anchor" id="autotoc_md55"></a>
<h3><a class="anchor" id="autotoc_md56"></a>
Bipartite graph</h3>
<p>A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.</p>
<h3><a class="anchor" id="autotoc_md56"></a>
<h3><a class="anchor" id="autotoc_md57"></a>
Matching and Not-Matching edges</h3>
<p>Given a matching M, edges that are part of matching are called Matching edges and edges that are not part of M (or connect free nodes) are called Not-Matching edges.</p>
<h3><a class="anchor" id="autotoc_md57"></a>
<h3><a class="anchor" id="autotoc_md58"></a>
Maximum cardinality matching</h3>
<p>Given a bipartite graphs G = ( V = ( X , Y ) , E ) whose partition has the parts X and Y, with E denoting the edges of the graph, the goal is to find a matching with as many edges as possible. Equivalently, a matching that covers as many vertices as possible.</p>
<h3><a class="anchor" id="autotoc_md58"></a>
<h3><a class="anchor" id="autotoc_md59"></a>
Augmenting paths</h3>
<p>Given a matching M, an augmenting path is an alternating path that starts from and ends on free vertices. All single edge paths that start and end with free vertices are augmenting paths.</p>
<h3><a class="anchor" id="autotoc_md59"></a>
<h3><a class="anchor" id="autotoc_md60"></a>
Concept</h3>
<p>A matching M is not maximum if there exists an augmenting path. It is also true other way, i.e, a matching is maximum if no augmenting path exists.</p>
<h3><a class="anchor" id="autotoc_md60"></a>
<h3><a class="anchor" id="autotoc_md61"></a>
Algorithm</h3>
<p>1) Initialize the Maximal Matching M as empty. 2) While there exists an Augmenting Path P Remove matching edges of P from M and add not-matching edges of P to M (This increases size of M by 1 as P starts and ends with a free vertex i.e. a node that is not part of matching.) 3) Return M.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Krishnapal4050">Krishna Pal Deora</a> </dd></dl>

2
d4/d8d/jarvis__algorithm_8cpp.html
View File

@@ -137,7 +137,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Gift_wrapping_algorithm">Jarvis’s</a> algorithm. </p>
<p>Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of it.</p>
<h3><a class="anchor" id="autotoc_md54"></a>
<h3><a class="anchor" id="autotoc_md55"></a>
Algorithm</h3>
<p>The idea of Jarvis’s Algorithm is simple, we start from the leftmost point (or point with minimum x coordinate value) and we keep wrapping points in counterclockwise direction.</p>
<p>The idea is to use orientation() here. Next point is selected as the point that beats all other points at counterclockwise orientation, i.e., next point is q if for any other point r, we have “orientation(p, q, r) = counterclockwise”.</p>

2
d5/d33/gram__schmidt_8cpp.html
View File

@@ -141,7 +141,7 @@ Functions</h2></td></tr>
<p><br />
</p>
<p>Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.</p>
<h3><a class="anchor" id="autotoc_md61"></a>
<h3><a class="anchor" id="autotoc_md62"></a>
Algorithm</h3>
<p>Take the first vector of given LI vectors as first vector of Orthogonal vectors. Take projection of second input vector on the first vector of Orthogonal vector and subtract it from the 2nd LI vector. Take projection of third vector on the second vector of Othogonal vectors and subtract it from the 3rd LI vector. Keep repeating the above process until all the vectors in the given input array are exhausted.</p>
<p>For Example: In R2, Input LI Vectors={(3,1),(2,2)} then Orthogonal Vectors= {(3, 1),(-0.4, 1.2)}</p>

3
d5/d3c/namespacedata__structures.html
View File

@@ -124,7 +124,8 @@ constexpr float&#160;</td><td class="memItemRight" valign="bottom"><a class="el"
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Data Structures algorithms. </p>
<p>Data-structure algorithms. </p>
<p>Data-structure algorithms.</p>
<p>Algorithms with data structures. </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->

3
d5/d3c/namespacedata__structures.js vendored
View File

@@ -4,6 +4,9 @@ var namespacedata__structures =
[ "link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", "de/d9d/classdata__structures_1_1linked__list_1_1link" ],
[ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ]
] ],
[ "queue_using_array", null, [
[ "Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array" ]
] ],
[ "Node", "d9/d49/structdata__structures_1_1_node.html", "d9/d49/structdata__structures_1_1_node" ],
[ "SkipList", "d4/d90/classdata__structures_1_1_skip_list.html", "d4/d90/classdata__structures_1_1_skip_list" ],
[ "trie", "d0/d3e/classdata__structures_1_1trie.html", "d0/d3e/classdata__structures_1_1trie" ]

40
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@@ -94,7 +94,7 @@ $(document).ready(function(){initNavTree('d5/d88/md__d_i_r_e_c_t_o_r_y.html','..
<div class="title">List of all files </div> </div>
</div><!--header-->
<div class="contents">
<div class="textblock"><h1><a class="anchor" id="autotoc_md29"></a>
<div class="textblock"><h1><a class="anchor" id="autotoc_md30"></a>
Backtracking</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/graph_coloring.cpp">Graph Coloring</a></li>
@@ -106,7 +106,7 @@ Backtracking</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/rat_maze.cpp">Rat Maze</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/backtracking/sudoku_solve.cpp">Sudoku Solve</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md30"></a>
<h1><a class="anchor" id="autotoc_md31"></a>
Ciphers</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/caesar_cipher.cpp">Caesar Cipher</a></li>
@@ -115,7 +115,7 @@ Ciphers</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/vigenere_cipher.cpp">Vigenere Cipher</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/ciphers/xor_cipher.cpp">Xor Cipher</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md31"></a>
<h1><a class="anchor" id="autotoc_md32"></a>
Data Structures</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/avltree.cpp">Avltree</a></li>
@@ -151,7 +151,7 @@ Data Structures</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_modern.cpp">Trie Modern</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/trie_tree.cpp">Trie Tree</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md32"></a>
<h1><a class="anchor" id="autotoc_md33"></a>
Dynamic Programming</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/0_1_knapsack.cpp">0 1 Knapsack</a></li>
@@ -178,13 +178,13 @@ Dynamic Programming</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/tree_height.cpp">Tree Height</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/word_break.cpp">Word Break</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md33"></a>
<h1><a class="anchor" id="autotoc_md34"></a>
Geometry</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/jarvis_algorithm.cpp">Jarvis Algorithm</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/line_segment_intersection.cpp">Line Segment Intersection</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md34"></a>
<h1><a class="anchor" id="autotoc_md35"></a>
Graph</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/breadth_first_search.cpp">Breadth First Search</a></li>
@@ -206,12 +206,12 @@ Graph</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/topological_sort.cpp">Topological Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/topological_sort_by_kahns_algo.cpp">Topological Sort By Kahns Algo</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md35"></a>
<h1><a class="anchor" id="autotoc_md36"></a>
Graphics</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graphics/spirograph.cpp">Spirograph</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md36"></a>
<h1><a class="anchor" id="autotoc_md37"></a>
Greedy Algorithms</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/dijkstra.cpp">Dijkstra</a></li>
@@ -221,7 +221,7 @@ Greedy Algorithms</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/kruskals_minimum_spanning_tree.cpp">Kruskals Minimum Spanning Tree</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/prims_minimum_spanning_tree.cpp">Prims Minimum Spanning Tree</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md37"></a>
<h1><a class="anchor" id="autotoc_md38"></a>
Hashing</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/chaining.cpp">Chaining</a></li>
@@ -229,12 +229,12 @@ Hashing</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/linear_probing_hash_table.cpp">Linear Probing Hash Table</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/quadratic_probing_hash_table.cpp">Quadratic Probing Hash Table</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md38"></a>
<h1><a class="anchor" id="autotoc_md39"></a>
Linear Algebra</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/linear_algebra/gram_schmidt.cpp">Gram Schmidt</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md39"></a>
<h1><a class="anchor" id="autotoc_md40"></a>
Machine Learning</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/adaline_learning.cpp">Adaline Learning</a></li>
@@ -244,7 +244,7 @@ Machine Learning</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/ordinary_least_squares_regressor.cpp">Ordinary Least Squares Regressor</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/machine_learning/vector_ops.hpp">Vector Ops</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md40"></a>
<h1><a class="anchor" id="autotoc_md41"></a>
Math</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/armstrong_number.cpp">Armstrong Number</a></li>
@@ -285,7 +285,7 @@ Math</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/sum_of_binomial_coefficient.cpp">Sum Of Binomial Coefficient</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/sum_of_digits.cpp">Sum Of Digits</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md41"></a>
<h1><a class="anchor" id="autotoc_md42"></a>
Numerical Methods</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/bisection_method.cpp">Bisection Method</a></li>
@@ -306,7 +306,7 @@ Numerical Methods</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/rungekutta.cpp">Rungekutta</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/numerical_methods/successive_approximation.cpp">Successive Approximation</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md42"></a>
<h1><a class="anchor" id="autotoc_md43"></a>
Operations On Datastructures</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/array_left_rotation.cpp">Array Left Rotation</a></li>
@@ -319,7 +319,7 @@ Operations On Datastructures</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/selectionsortlinkedlist.cpp">Selectionsortlinkedlist</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/union_of_2_arrays.cpp">Union Of 2 Arrays</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md43"></a>
<h1><a class="anchor" id="autotoc_md44"></a>
Others</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/buzz_number.cpp">Buzz Number</a></li>
@@ -341,7 +341,7 @@ Others</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/tower_of_hanoi.cpp">Tower Of Hanoi</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/vector_important_functions.cpp">Vector Important Functions</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md44"></a>
<h1><a class="anchor" id="autotoc_md45"></a>
Probability</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/addition_rule.cpp">Addition Rule</a></li>
@@ -349,7 +349,7 @@ Probability</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/binomial_dist.cpp">Binomial Dist</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/poisson_dist.cpp">Poisson Dist</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md45"></a>
<h1><a class="anchor" id="autotoc_md46"></a>
Range Queries</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/fenwick_tree.cpp">Fenwick Tree</a></li>
@@ -358,7 +358,7 @@ Range Queries</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/segtree.cpp">Segtree</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/range_queries/sparse_table.cpp">Sparse Table</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md46"></a>
<h1><a class="anchor" id="autotoc_md47"></a>
Search</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp">Binary Search</a></li>
@@ -373,7 +373,7 @@ Search</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/ternary_search.cpp">Ternary Search</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/text_search.cpp">Text Search</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md47"></a>
<h1><a class="anchor" id="autotoc_md48"></a>
Sorting</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bead_sort.cpp">Bead Sort</a></li>
@@ -410,7 +410,7 @@ Sorting</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/tim_sort.cpp">Tim Sort</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/wiggle_sort.cpp">Wiggle Sort</a></li>
</ul>
<h1><a class="anchor" id="autotoc_md48"></a>
<h1><a class="anchor" id="autotoc_md49"></a>
Strings</h1>
<ul>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/strings/brute_force_string_searching.cpp">Brute Force String Searching</a></li>

2
d5/ddb/bogo__sort_8cpp.html
View File

@@ -136,7 +136,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort">Bogosort algorithm</a> </p>
<p>In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.</p>
<h3><a class="anchor" id="autotoc_md67"></a>
<h3><a class="anchor" id="autotoc_md68"></a>
Algorithm</h3>
<p>Shuffle the array untill array is sorted.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905">Deep Raval</a> </dd></dl>

279
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html Normal file
View File

@@ -0,0 +1,279 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures::queue_using_array::Queue_Array Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.20 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">data_structures::queue_using_array::Queue_Array Class Reference</div> </div>
</div><!--header-->
<div class="contents">
<p><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array.
<a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for data_structures::queue_using_array::Queue_Array:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg" width="191" height="246"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a4dc64488c36f84d927365fa8d1933663"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a> (const int16_t &amp;)</td></tr>
<tr class="memdesc:a4dc64488c36f84d927365fa8d1933663"><td class="mdescLeft">&#160;</td><td class="mdescRight">Add element to the first of the queue. <a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">More...</a><br /></td></tr>
<tr class="separator:a4dc64488c36f84d927365fa8d1933663"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2aaf88c9954ef3ab686f8e4bfbd87622"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a> ()</td></tr>
<tr class="memdesc:a2aaf88c9954ef3ab686f8e4bfbd87622"><td class="mdescLeft">&#160;</td><td class="mdescRight">Delete element from back of the queue. <a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">More...</a><br /></td></tr>
<tr class="separator:a2aaf88c9954ef3ab686f8e4bfbd87622"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a688b7ea064739ea9fa66bf64bf4ae631"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a> () const</td></tr>
<tr class="memdesc:a688b7ea064739ea9fa66bf64bf4ae631"><td class="mdescLeft">&#160;</td><td class="mdescRight">Show all saved data. <a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">More...</a><br /></td></tr>
<tr class="separator:a688b7ea064739ea9fa66bf64bf4ae631"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a2f676f2f249eb36dfd49711a03e9e67e"><td class="memItemLeft" align="right" valign="top"><a id="a2f676f2f249eb36dfd49711a03e9e67e"></a>
int8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> {-1}</td></tr>
<tr class="memdesc:a2f676f2f249eb36dfd49711a03e9e67e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of head of the array. <br /></td></tr>
<tr class="separator:a2f676f2f249eb36dfd49711a03e9e67e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9883dfcceede9a42227d2d313ae86f85"><td class="memItemLeft" align="right" valign="top"><a id="a9883dfcceede9a42227d2d313ae86f85"></a>
int8_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> {-1}</td></tr>
<tr class="memdesc:a9883dfcceede9a42227d2d313ae86f85"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of tail of the array. <br /></td></tr>
<tr class="separator:a9883dfcceede9a42227d2d313ae86f85"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memItemLeft" align="right" valign="top"><a id="ae69a0bf6c9921b37c516c8a4d2fb904d"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>&lt; int16_t, <a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a></td></tr>
<tr class="memdesc:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="mdescLeft">&#160;</td><td class="mdescRight">All stored data. <br /></td></tr>
<tr class="separator:ae69a0bf6c9921b37c516c8a4d2fb904d"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array. </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a id="a2aaf88c9954ef3ab686f8e4bfbd87622"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2aaf88c9954ef3ab686f8e4bfbd87622">&#9670;&nbsp;</a></span>dequeue()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int data_structures::queue_using_array::Queue_Array::dequeue </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Delete element from back of the queue. </p>
<p>Remove element that is located at the first of the queue.</p>
<dl class="section return"><dt>Returns</dt><dd>data that is deleted if queue is not empty </dd></dl>
<div class="fragment"><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; {</div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; int8_t d{0};</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nstack is empty &quot;</span>;</div>
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>) {</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; d = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>);</div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> = -1;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>&#160; d = <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>++);</div>
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; }</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; </div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; <span class="keywordflow">return</span> d;</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.svg" width="335" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a688b7ea064739ea9fa66bf64bf4ae631"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a688b7ea064739ea9fa66bf64bf4ae631">&#9670;&nbsp;</a></span>display()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void data_structures::queue_using_array::Queue_Array::display </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td> const</td>
</tr>
</table>
</div><div class="memdoc">
<p>Show all saved data. </p>
<p>Utility function to show all elements in the queue. </p>
<div class="fragment"><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; {</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1) {</div>
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is empty&quot;</span>;</div>
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>&#160; <span class="keywordflow">for</span> (int16_t i{<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a>}; i &lt;= <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>; ++i) <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/at.html">at</a>(i) &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>&#160; }</div>
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.svg" width="335" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a4dc64488c36f84d927365fa8d1933663"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4dc64488c36f84d927365fa8d1933663">&#9670;&nbsp;</a></span>enqueue()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void data_structures::queue_using_array::Queue_Array::enqueue </td>
<td>(</td>
<td class="paramtype">const int16_t &amp;&#160;</td>
<td class="paramname"><em>ele</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Add element to the first of the queue. </p>
<p>Adds new element to the end of the queue.</p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">ele</td><td>to be added to the end of the queue </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>&#160; {</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> == <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>() - 1) {</div>
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nStack is full&quot;</span>;</div>
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> == -1 &amp;&amp; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> == -1) {</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a> = 0;</div>
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> = 0;</div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a> &lt; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array/size.html">size</a>()) {</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; ++<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>;</div>
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a>[<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a>] = ele;</div>
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>&#160; }</div>
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.svg" width="348" height="67"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>data_structures/<a class="el" href="../../d8/df0/queue__using__array_8cpp.html">queue_using_array.cpp</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<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="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="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="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_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="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>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>queue_using_array</b></li><li class="navelem"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">Queue_Array</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
</ul>
</div>
</body>
</html>

9
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.js Normal file
View File

@@ -0,0 +1,9 @@
var classdata__structures_1_1queue__using__array_1_1_queue___array =
[
[ "dequeue", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622", null ],
[ "display", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631", null ],
[ "enqueue", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663", null ],
[ "arr", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d", null ],
[ "front", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e", null ],
[ "rear", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85", null ]
];

4
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="data_structures::queue_using_array::Queue_Array::dequeue" name="data_structures::queue_using_array::Queue_Array::dequeue">
<area shape="rect" id="node1" title="Delete element from back of the queue." alt="" coords="5,5,185,61"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="233,20,329,47"/>
</map>

1
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
bbc79cb6300ff44e8292ac13d64dd614

39
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a2aaf88c9954ef3ab686f8e4bfbd87622_cgraph.svg Normal file
View File

@@ -0,0 +1,39 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: data_structures::queue_using_array::Queue_Array::dequeue Pages: 1 -->
<svg width="251pt" height="50pt"
viewBox="0.00 0.00 251.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46)">
<title>data_structures::queue_using_array::Queue_Array::dequeue</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 247,-46 247,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Delete element from back of the queue.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 135,-41.5 135,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
<text text-anchor="middle" x="67.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::dequeue</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="171,-11.5 171,-30.5 243,-30.5 243,-11.5 171,-11.5"/>
<text text-anchor="middle" x="207" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M135.24,-21C143.9,-21 152.6,-21 160.79,-21"/>
<polygon fill="midnightblue" stroke="midnightblue" points="160.86,-24.5 170.86,-21 160.86,-17.5 160.86,-24.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.0 KiB

4
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="data_structures::queue_using_array::Queue_Array::enqueue" name="data_structures::queue_using_array::Queue_Array::enqueue">
<area shape="rect" id="node1" title="Add element to the first of the queue." alt="" coords="5,5,185,61"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="233,20,343,47"/>
</map>

1
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
dc5ec4c944d65bda8c341863db172ac3

39
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a4dc64488c36f84d927365fa8d1933663_cgraph.svg Normal file
View File

@@ -0,0 +1,39 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: data_structures::queue_using_array::Queue_Array::enqueue Pages: 1 -->
<svg width="261pt" height="50pt"
viewBox="0.00 0.00 261.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46)">
<title>data_structures::queue_using_array::Queue_Array::enqueue</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 257,-46 257,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Add element to the first of the queue.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 135,-41.5 135,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
<text text-anchor="middle" x="67.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::enqueue</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="171,-11.5 171,-30.5 253,-30.5 253,-11.5 171,-11.5"/>
<text text-anchor="middle" x="212" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M135.16,-21C143.72,-21 152.36,-21 160.6,-21"/>
<polygon fill="midnightblue" stroke="midnightblue" points="160.78,-24.5 170.78,-21 160.78,-17.5 160.78,-24.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.0 KiB

4
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.map Normal file
View File

@@ -0,0 +1,4 @@
<map id="data_structures::queue_using_array::Queue_Array::display" name="data_structures::queue_using_array::Queue_Array::display">
<area shape="rect" id="node1" title="Show all saved data." alt="" coords="5,5,185,61"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="233,20,329,47"/>
</map>

1
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
cfba9e04a67dce717db618ea1539425a

39
d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array_a688b7ea064739ea9fa66bf64bf4ae631_cgraph.svg Normal file
View File

@@ -0,0 +1,39 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: data_structures::queue_using_array::Queue_Array::display Pages: 1 -->
<svg width="251pt" height="50pt"
viewBox="0.00 0.00 251.00 50.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 46)">
<title>data_structures::queue_using_array::Queue_Array::display</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-46 247,-46 247,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Show all saved data.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 135,-41.5 135,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
<text text-anchor="middle" x="67.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::display</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="171,-11.5 171,-30.5 243,-30.5 243,-11.5 171,-11.5"/>
<text text-anchor="middle" x="207" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M135.24,-21C143.9,-21 152.6,-21 160.79,-21"/>
<polygon fill="midnightblue" stroke="midnightblue" points="160.86,-24.5 170.86,-21 160.86,-17.5 160.86,-24.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.0 KiB

2
d6/d10/cut__rod_8cpp.html
View File

@@ -136,7 +136,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of cutting a rod problem. </p>
<p>Given a rod of length n inches and an array of prices that contains prices of all pieces of size&lt;=n. Determine the maximum profit obtainable by cutting up the rod and selling the pieces.</p>
<h3><a class="anchor" id="autotoc_md52"></a>
<h3><a class="anchor" id="autotoc_md53"></a>
Algorithm</h3>
<p>The idea is to break the given rod into every smaller piece as possible and then check profit for each piece, by calculating maximum profit for smaller pieces we will build the solution for larger pieces in bottom-up manner.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Anmol3299">Anmol</a> </dd>

15
d7/de0/stack_8h_source.html
View File

@@ -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! -->

20
de/d91/class_queue___array-members.html → d8/dba/classdata__structures_1_1queue__using__array_1_1_queue___array-members.html
View File

@@ -71,7 +71,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d0/dd2/class_queue___array.html','../../'); initResizable(); });
$(document).ready(function(){initNavTree('d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -91,20 +91,18 @@ $(document).ready(function(){initNavTree('d0/dd2/class_queue___array.html','../.
<div class="header">
<div class="headertitle">
<div class="title">Queue_Array Member List</div> </div>
<div class="title">data_structures::queue_using_array::Queue_Array Member List</div> </div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>, including all inherited members.</p>
<p>This is the complete list of members for <a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a>, including all inherited members.</p>
<table class="directory">
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>arr</b> (defined in <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>)</td><td class="entry"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>dequeue</b>() (defined in <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>)</td><td class="entry"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>display</b>() (defined in <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>)</td><td class="entry"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>enqueue</b>(int) (defined in <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>)</td><td class="entry"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></td><td class="entry"></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>front</b> (defined in <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>)</td><td class="entry"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>Queue_Array</b>() (defined in <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>)</td><td class="entry"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>rear</b> (defined in <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>)</td><td class="entry"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr bgcolor="#f0f0f0"><td class="entry"><b>size</b> (defined in <a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a>)</td><td class="entry"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">arr</a></td><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>()</td><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>() const</td><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(const int16_t &amp;)</td><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">front</a></td><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">rear</a></td><td class="entry"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></td><td class="entry"><span class="mlabel">private</span></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->

252
d8/df0/queue__using__array_8cpp.html Normal file
View File

@@ -0,0 +1,252 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/queue_using_array.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.20 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d8/df0/queue__using__array_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> &#124;
<a href="#var-members">Variables</a> </div>
<div class="headertitle">
<div class="title">queue_using_array.cpp File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Implementation of Linear <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using array</a>.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;array&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for queue_using_array.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d1/d6d/queue__using__array_8cpp__incl.svg" width="166" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a class="el" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array. <a href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:d5/d3c/namespacedata__structures"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html">data_structures</a></td></tr>
<tr class="memdesc:d5/d3c/namespacedata__structures"><td class="mdescLeft">&#160;</td><td class="mdescRight">Data Structures algorithms. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d9/d70/namespacequeue__using__array"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d70/namespacequeue__using__array.html">queue_using_array</a></td></tr>
<tr class="memdesc:d9/d70/namespacequeue__using__array"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using Array</a> implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:a2d49e79bd164c298912db252970520d8"><td class="memItemLeft" align="right" valign="top">constexpr uint16_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">max_size</a> {10}</td></tr>
<tr class="memdesc:a2d49e79bd164c298912db252970520d8"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html" title="STL class.">std::array</a> <a href="../../d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">More...</a><br /></td></tr>
<tr class="separator:a2d49e79bd164c298912db252970520d8"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of Linear <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using array</a>. </p>
<p>The Linear <a class="el" href="../../dc/db5/struct_queue.html">Queue</a> is a data structure used for holding a sequence of values, which can be added to the end line (enqueue), removed from head of line (dequeue) and displayed. </p>
<h3><a class="anchor" id="autotoc_md28"></a>
Algorithm</h3>
<p>Values can be added by increasing the <code>rear</code> variable by 1 (which points to the end of the array), then assigning new value to <code>rear</code>'s element of the array.</p>
<p>Values can be removed by increasing the <code>front</code> variable by 1 (which points to the first of the array), so it cannot reached any more.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/pooja-git11">Pooja</a> </dd>
<dd>
<a href="https://github.com/farbodahm">Farbod Ahmadian</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&nbsp;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<p>Allows the user to add and delete values from the queue. Also allows user to display values in the queue. </p><dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<div class="fragment"><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; {</div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160; <span class="keywordtype">int</span> op{0}, <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>{0};</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html">data_structures::queue_using_array::Queue_Array</a> ob;</div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; </div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n1. enqueue(Insertion) &quot;</span>;</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n2. dequeue(Deletion)&quot;</span>;</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n3. Display&quot;</span>;</div>
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n4. Exit&quot;</span>;</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter your choice &quot;</span>;</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; op;</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <span class="keywordflow">if</span> (op == 1) {</div>
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Enter data &quot;</span>;</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">enqueue</a>(<a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 2) {</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> = ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">dequeue</a>();</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\ndequeue element is:\t&quot;</span> &lt;&lt; <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 3) {</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; ob.<a class="code" href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">display</a>();</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (op == 4) {</div>
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/program/exit.html">exit</a>(0);</div>
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nWrong choice &quot;</span>;</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; }</div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; }</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; </div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="447" height="227"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<h2 class="groupheader">Variable Documentation</h2>
<a id="a2d49e79bd164c298912db252970520d8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2d49e79bd164c298912db252970520d8">&#9670;&nbsp;</a></span>max_size</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">constexpr uint16_t max_size {10}</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">constexpr</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html" title="STL class.">std::array</a> </p>
<p>for io operations Maximum size of the queue </p>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<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="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="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="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="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="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_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="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>
<!-- 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"><a class="el" href="../../d8/df0/queue__using__array_8cpp.html">queue_using_array.cpp</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
</ul>
</div>
</body>
</html>

6
d8/df0/queue__using__array_8cpp.js Normal file
View File

@@ -0,0 +1,6 @@
var queue__using__array_8cpp =
[
[ "Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array" ],
[ "main", "d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
[ "max_size", "d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8", null ]
];

8
d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map Normal file
View File

@@ -0,0 +1,8 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,100,56,127"/>
<area shape="rect" id="node2" href="$d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622" title="Delete element from back of the queue." alt="" coords="104,5,284,61"/>
<area shape="rect" id="node4" href="$d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631" title="Show all saved data." alt="" coords="104,85,284,141"/>
<area shape="rect" id="node5" href="$d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663" title="Add element to the first of the queue." alt="" coords="104,165,284,221"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/at.html#" title=" " alt="" coords="339,60,435,87"/>
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="332,180,441,207"/>
</map>

1
d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
ae0b29215619114ddbad32fe8de68466

109
d8/df0/queue__using__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg Normal file
View File

@@ -0,0 +1,109 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: main Pages: 1 -->
<svg width="335pt" height="170pt"
viewBox="0.00 0.00 335.00 170.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 166)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-166 331,-166 331,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#bfbfbf" stroke="black" points="0,-71.5 0,-90.5 38,-90.5 38,-71.5 0,-71.5"/>
<text text-anchor="middle" x="19" y="-78.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622" target="_top" xlink:title="Delete element from back of the queue.">
<polygon fill="white" stroke="black" points="74,-120.5 74,-161.5 209,-161.5 209,-120.5 74,-120.5"/>
<text text-anchor="start" x="82" y="-149.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
<text text-anchor="start" x="82" y="-138.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
<text text-anchor="middle" x="141.5" y="-127.5" font-family="Helvetica,sans-Serif" font-size="10.00">::dequeue</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M36.35,-90.55C46.96,-96.63 61.16,-104.55 74,-111 77.31,-112.66 80.73,-114.33 84.19,-115.99"/>
<polygon fill="midnightblue" stroke="midnightblue" points="82.86,-119.24 93.4,-120.34 85.85,-112.91 82.86,-119.24"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631" target="_top" xlink:title="Show all saved data.">
<polygon fill="white" stroke="black" points="74,-60.5 74,-101.5 209,-101.5 209,-60.5 74,-60.5"/>
<text text-anchor="start" x="82" y="-89.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
<text text-anchor="start" x="82" y="-78.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
<text text-anchor="middle" x="141.5" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">::display</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M38.04,-81C45.3,-81 54.2,-81 63.7,-81"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.77,-84.5 73.77,-81 63.77,-77.5 63.77,-84.5"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663" target="_top" xlink:title="Add element to the first of the queue.">
<polygon fill="white" stroke="black" points="74,-0.5 74,-41.5 209,-41.5 209,-0.5 74,-0.5"/>
<text text-anchor="start" x="82" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
<text text-anchor="start" x="82" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
<text text-anchor="middle" x="141.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::enqueue</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M36.35,-71.45C46.96,-65.37 61.16,-57.45 74,-51 77.31,-49.34 80.73,-47.67 84.19,-46.01"/>
<polygon fill="midnightblue" stroke="midnightblue" points="85.85,-49.09 93.4,-41.66 82.86,-42.76 85.85,-49.09"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/at.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="250,-101.5 250,-120.5 322,-120.5 322,-101.5 250,-101.5"/>
<text text-anchor="middle" x="286" y="-108.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::at</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M209.16,-126.97C219.59,-124.77 230.15,-122.55 239.95,-120.49"/>
<polygon fill="midnightblue" stroke="midnightblue" points="240.77,-123.89 249.84,-118.4 239.33,-117.04 240.77,-123.89"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M209.16,-95.03C219.59,-97.23 230.15,-99.45 239.95,-101.51"/>
<polygon fill="midnightblue" stroke="midnightblue" points="239.33,-104.96 249.84,-103.6 240.77,-98.11 239.33,-104.96"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array/size.html#" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="245,-11.5 245,-30.5 327,-30.5 327,-11.5 245,-11.5"/>
<text text-anchor="middle" x="286" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array::size</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M209.16,-21C217.72,-21 226.36,-21 234.6,-21"/>
<polygon fill="midnightblue" stroke="midnightblue" points="234.78,-24.5 244.78,-21 234.78,-17.5 234.78,-24.5"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 5.9 KiB

54
d0/dd2/class_queue___array.html → d9/d70/namespacequeue__using__array.html
View File

@@ -5,7 +5,7 @@
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.20"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Queue_Array Class Reference</title>
<title>Algorithms_in_C++: queue_using_array Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
@@ -71,7 +71,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d0/dd2/class_queue___array.html','../../'); initResizable(); });
$(document).ready(function(){initNavTree('d9/d70/namespacequeue__using__array.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -90,55 +90,21 @@ $(document).ready(function(){initNavTree('d0/dd2/class_queue___array.html','../.
</div>
<div class="header">
<div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../de/d91/class_queue___array-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">Queue_Array Class Reference</div> </div>
<div class="title">queue_using_array Namespace Reference</div> </div>
</div><!--header-->
<div class="contents">
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a52de5f54eee2b875016fed8abb64d47a"><td class="memItemLeft" align="right" valign="top"><a id="a52de5f54eee2b875016fed8abb64d47a"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>enqueue</b> (int)</td></tr>
<tr class="separator:a52de5f54eee2b875016fed8abb64d47a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4e1ea2bf04c99ef258888fd4303f09cd"><td class="memItemLeft" align="right" valign="top"><a id="a4e1ea2bf04c99ef258888fd4303f09cd"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>dequeue</b> ()</td></tr>
<tr class="separator:a4e1ea2bf04c99ef258888fd4303f09cd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8c58cb7bfd146c39e9dd0a39d47dce7"><td class="memItemLeft" align="right" valign="top"><a id="aa8c58cb7bfd146c39e9dd0a39d47dce7"></a>
void&#160;</td><td class="memItemRight" valign="bottom"><b>display</b> ()</td></tr>
<tr class="separator:aa8c58cb7bfd146c39e9dd0a39d47dce7"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a81c4648299cc693c61e73b2d7022f420"><td class="memItemLeft" align="right" valign="top"><a id="a81c4648299cc693c61e73b2d7022f420"></a>
int *&#160;</td><td class="memItemRight" valign="bottom"><b>arr</b> = new int[size]</td></tr>
<tr class="separator:a81c4648299cc693c61e73b2d7022f420"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a6de07e48dcd70df0b6c9affe94f7742f"><td class="memItemLeft" align="right" valign="top"><a id="a6de07e48dcd70df0b6c9affe94f7742f"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>front</b></td></tr>
<tr class="separator:a6de07e48dcd70df0b6c9affe94f7742f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abf0003cf9a3ef11c752a40475f586609"><td class="memItemLeft" align="right" valign="top"><a id="abf0003cf9a3ef11c752a40475f586609"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>rear</b></td></tr>
<tr class="separator:abf0003cf9a3ef11c752a40475f586609"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a02be998c5cb601b25709804f6887909b"><td class="memItemLeft" align="right" valign="top"><a id="a02be998c5cb601b25709804f6887909b"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b></td></tr>
<tr class="separator:a02be998c5cb601b25709804f6887909b"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>data_structures/queue_using_array.cpp</li>
</ul>
</div><!-- contents -->
<p>Functions for <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using Array</a> implementation.
<a href="../../d9/d70/namespacequeue__using__array.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using Array</a> implementation. </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/dd2/class_queue___array.html">Queue_Array</a></li>
<li class="navelem"><a class="el" href="../../d9/d70/namespacequeue__using__array.html">queue_using_array</a></li>
<li class="footer">Generated by <a href="http://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.8.20 </li>
</ul>
</div>

5
db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.map Normal file
View File

@@ -0,0 +1,5 @@
<map id="data_structures::queue_using_array::Queue_Array" name="data_structures::queue_using_array::Queue_Array">
<area shape="rect" id="node1" title="Queue_Array class containing the main data and also index of head and tail of the array." alt="" coords="5,199,185,240"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array.html" title=" " alt="" coords="29,95,161,136"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="52,5,139,32"/>
</map>

1
db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
db27848e9a64e618488a8665cb3ae1d1

56
db/d0f/classdata__structures_1_1queue__using__array_1_1_queue___array__coll__graph.svg Normal file
View File

@@ -0,0 +1,56 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: data_structures::queue_using_array::Queue_Array Pages: 1 -->
<svg width="143pt" height="184pt"
viewBox="0.00 0.00 143.00 184.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 180)">
<title>data_structures::queue_using_array::Queue_Array</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-180 139,-180 139,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Queue_Array class containing the main data and also index of head and tail of the array.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 135,-30.5 135,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::queue</text>
<text text-anchor="middle" x="67.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_using_array::Queue_Array</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/array.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="18,-78.5 18,-108.5 117,-108.5 117,-78.5 18,-78.5"/>
<text text-anchor="start" x="26" y="-96.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array&lt; int16_t,</text>
<text text-anchor="middle" x="67.5" y="-85.5" font-family="Helvetica,sans-Serif" font-size="10.00"> max_size &gt;</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node2&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.5,-68.09C67.5,-55.76 67.5,-41.22 67.5,-30.73"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="64,-68.2 67.5,-78.2 71,-68.21 64,-68.2"/>
<text text-anchor="middle" x="75" y="-52" font-family="Helvetica,sans-Serif" font-size="10.00"> arr</text>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/types/integer.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="35,-156.5 35,-175.5 100,-175.5 100,-156.5 35,-156.5"/>
<text text-anchor="middle" x="67.5" y="-163.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::int16_t</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M67.5,-146.24C67.5,-134.41 67.5,-119.38 67.5,-108.58"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="64,-146.36 67.5,-156.36 71,-146.36 64,-146.36"/>
<text text-anchor="middle" x="89" y="-130" font-family="Helvetica,sans-Serif" font-size="10.00"> elements</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.0 KiB

2
db/d16/0__1__knapsack_8cpp.html
View File

@@ -136,7 +136,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Knapsack_problem">0-1 Knapsack Problem</a> </p>
<p>Given weights and values of n items, put these items in a knapsack of capacity <code>W</code> to get the maximum total value in the knapsack. In other words, given two integer arrays <code>val[0..n-1]</code> and <code>wt[0..n-1]</code> which represent values and weights associated with n items respectively. Also given an integer W which represents knapsack capacity, find out the maximum value subset of <code>val[]</code> such that sum of the weights of this subset is smaller than or equal to W. You cannot break an item, either pick the complete item or don’t pick it (0-1 property)</p>
<h3><a class="anchor" id="autotoc_md49"></a>
<h3><a class="anchor" id="autotoc_md50"></a>
Algorithm</h3>
<p>The idea is to consider all subsets of items and calculate the total weight and value of all subsets. Consider the only subsets whose total weight is smaller than <code>W</code>. From all such subsets, pick the maximum value subset.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/Anmol3299">Anmol</a> </dd>

2
db/dca/kadane2_8cpp.html
View File

@@ -132,7 +132,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Kadane%27s_algorithm">Kadane Algorithm</a> </p>
<p>Kadane algorithm is used to find the maximum sum subarray in an array and maximum sum subarray problem is the task of finding a contiguous subarray with the largest sum</p>
<h3><a class="anchor" id="autotoc_md53"></a>
<h3><a class="anchor" id="autotoc_md54"></a>
Algorithm</h3>
<p>The simple idea of the algorithm is to search for all positive contiguous segments of the array and keep track of maximum sum contiguous segment among all positive segments(curr_sum is used for this) Each time we get a positive sum we compare it with max_sum and update max_sum if it is greater than curr_sum</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/ayush523">Ayush Singh</a> </dd></dl>

3
dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html
View File

@@ -120,6 +120,9 @@ Files</h2></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d7/d00/list__array_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d00/list__array_8cpp.html">list_array.cpp</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d8/df0/queue__using__array_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d8/df0/queue__using__array_8cpp.html">queue_using_array.cpp</a></td></tr>
<tr class="memdesc:d8/df0/queue__using__array_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">Implementation of Linear <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using array</a>. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:df/dd0/queue__using__two__stacks_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html">queue_using_two_stacks.cpp</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d0/d5a/skip__list_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d0/d5a/skip__list_8cpp.html">skip_list.cpp</a></td></tr>

1
dir_2e746e9d06bf2d8ff842208bcc6ebcfc.js
View File

@@ -9,6 +9,7 @@ var dir_2e746e9d06bf2d8ff842208bcc6ebcfc =
[ "linkedlist_implentation_usingarray.cpp", "d3/dce/linkedlist__implentation__usingarray_8cpp.html", "d3/dce/linkedlist__implentation__usingarray_8cpp" ],
[ "list_array.cpp", "d7/d00/list__array_8cpp.html", "d7/d00/list__array_8cpp" ],
[ "queue.h", "d8/d38/queue_8h_source.html", null ],
[ "queue_using_array.cpp", "d8/df0/queue__using__array_8cpp.html", "d8/df0/queue__using__array_8cpp" ],
[ "queue_using_two_stacks.cpp", "df/dd0/queue__using__two__stacks_8cpp.html", "df/dd0/queue__using__two__stacks_8cpp" ],
[ "skip_list.cpp", "d0/d5a/skip__list_8cpp.html", "d0/d5a/skip__list_8cpp" ],
[ "stack.h", "d7/de0/stack_8h.html", [

11
files.html
View File

@@ -123,11 +123,12 @@ solve-a-rat-in-a-maze-c-java-pytho/">Rat in a Maze</a> algorithm </td></tr>
<tr id="row_2_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html" target="_self">linkedlist_implentation_usingarray.cpp</a></td><td class="desc">Linked list implementation using Arrays </td></tr>
<tr id="row_2_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d00/list__array_8cpp.html" target="_self">list_array.cpp</a></td><td class="desc"></td></tr>
<tr id="row_2_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d8/d38/queue_8h_source.html"><span class="icondoc"></span></a><b>queue.h</b></td><td class="desc"></td></tr>
<tr id="row_2_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html" target="_self">queue_using_two_stacks.cpp</a></td><td class="desc"></td></tr>
<tr id="row_2_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
<tr id="row_2_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/de0/stack_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d7/de0/stack_8h.html" target="_self">stack.h</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
<tr id="row_2_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
<tr id="row_2_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d83/trie__tree_8cpp.html" target="_self">trie_tree.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie">Trie</a> data structure for English alphabets in small characters </td></tr>
<tr id="row_2_9_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d8/df0/queue__using__array_8cpp.html" target="_self">queue_using_array.cpp</a></td><td class="desc">Implementation of Linear <a href="https://www.geeksforgeeks.org/array-implementation-of-queue-simple/">Queue using array</a> </td></tr>
<tr id="row_2_10_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html" target="_self">queue_using_two_stacks.cpp</a></td><td class="desc"></td></tr>
<tr id="row_2_11_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d0/d5a/skip__list_8cpp.html" target="_self">skip_list.cpp</a></td><td class="desc">Data structure for fast searching and insertion in \(O(\log n)\) time </td></tr>
<tr id="row_2_12_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><a href="d7/de0/stack_8h_source.html"><span class="icondoc"></span></a><a class="el" href="d7/de0/stack_8h.html" target="_self">stack.h</a></td><td class="desc">This class specifies the basic operation on a stack as a linked list </td></tr>
<tr id="row_2_13_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="dc/d93/trie__modern_8cpp.html" target="_self">trie_modern.cpp</a></td><td class="desc">A basic implementation of trie class to store only lower-case strings </td></tr>
<tr id="row_2_14_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/d83/trie__tree_8cpp.html" target="_self">trie_tree.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Trie">Trie</a> data structure for English alphabets in small characters </td></tr>
<tr id="row_3_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">&#9658;</span><span id="img_3_" class="iconfclosed" onclick="toggleFolder('3_')">&#160;</span><a class="el" href="dir_8a20dd5bfd5341a725342bf72b6b686f.html" target="_self">dynamic_programming</a></td><td class="desc"></td></tr>
<tr id="row_3_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="db/d16/0__1__knapsack_8cpp.html" target="_self">0_1_knapsack.cpp</a></td><td class="desc">Implementation of <a href="https://en.wikipedia.org/wiki/Knapsack_problem">0-1 Knapsack Problem</a> </td></tr>
<tr id="row_3_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d9/d31/coin__change__topdown_8cpp.html" target="_self">coin_change_topdown.cpp</a></td><td class="desc"><a href="https://leetcode.com/problems/coin-change/">Minimum coins</a> change problem is a problem used to find the minimum number of coins required to completely reach a target amount </td></tr>

3
functions_a.html
View File

@@ -134,7 +134,8 @@ $(document).ready(function(){initNavTree('functions_a.html',''); initResizable()
: <a class="el" href="da/d5a/class_complex.html#ae1e03712837450549e0c9b4017533a41">Complex</a>
</li>
<li>arr
: <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie</a>
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array</a>
, <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie</a>
</li>
</ul>
</div><!-- contents -->

4
functions_d.html
View File

@@ -114,6 +114,9 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable()
<li>DenseLayer()
: <a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a35ab6f1b2840f89a858ca36b78739b69">machine_learning::neural_network::layers::DenseLayer</a>
</li>
<li>dequeue()
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array</a>
</li>
<li>deQueue()
: <a class="el" href="db/da9/classqueue.html#a089d4af5532e0a801f560070da6e1f86">queue&lt; Kind &gt;</a>
</li>
@@ -143,6 +146,7 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable()
</li>
<li>display()
: <a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e">data_structures::linked_list::list</a>
, <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array</a>
, <a class="el" href="dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain</a>
, <a class="el" href="db/da9/classqueue.html#a26f48801df462ade003b50739196fa4c">queue&lt; Kind &gt;</a>
, <a class="el" href="d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628">stack&lt; Type &gt;</a>

3
functions_e.html
View File

@@ -99,6 +99,9 @@ $(document).ready(function(){initNavTree('functions_e.html',''); initResizable()
<li>encrypt_text()
: <a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher</a>
</li>
<li>enqueue()
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array</a>
</li>
<li>enQueue()
: <a class="el" href="db/da9/classqueue.html#a592c0580551ec0d3b4d43e8198d8a377">queue&lt; Kind &gt;</a>
</li>

5
functions_f.html
View File

@@ -112,8 +112,9 @@ $(document).ready(function(){initNavTree('functions_f.html',''); initResizable()
<li>forward
: <a class="el" href="d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">data_structures::Node</a>
</li>
<li>front()
: <a class="el" href="db/da9/classqueue.html#a36d47fdbedc199609818385110d9f922">queue&lt; Kind &gt;</a>
<li>front
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array</a>
, <a class="el" href="db/da9/classqueue.html#a36d47fdbedc199609818385110d9f922">queue&lt; Kind &gt;</a>
</li>
</ul>
</div><!-- contents -->

4
functions_func_d.html
View File

@@ -111,6 +111,9 @@ $(document).ready(function(){initNavTree('functions_func_d.html',''); initResiza
<li>DenseLayer()
: <a class="el" href="dc/d93/classmachine__learning_1_1neural__network_1_1layers_1_1_dense_layer.html#a2871146feaaa453558239df67b21e0d2">machine_learning::neural_network::layers::DenseLayer</a>
</li>
<li>dequeue()
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2aaf88c9954ef3ab686f8e4bfbd87622">data_structures::queue_using_array::Queue_Array</a>
</li>
<li>deQueue()
: <a class="el" href="db/da9/classqueue.html#a089d4af5532e0a801f560070da6e1f86">queue&lt; Kind &gt;</a>
</li>
@@ -140,6 +143,7 @@ $(document).ready(function(){initNavTree('functions_func_d.html',''); initResiza
</li>
<li>display()
: <a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html#abf7c97616b873ffeebdd0eac2d19d13e">data_structures::linked_list::list</a>
, <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a688b7ea064739ea9fa66bf64bf4ae631">data_structures::queue_using_array::Queue_Array</a>
, <a class="el" href="dd/d1c/classhash__chain.html#a706964ad13587fc9a8b3fe8381d410ed">hash_chain</a>
, <a class="el" href="db/da9/classqueue.html#a26f48801df462ade003b50739196fa4c">queue&lt; Kind &gt;</a>
, <a class="el" href="d1/dc2/classstack.html#a67f65710c376f67d1ba3bde45a9cb628">stack&lt; Type &gt;</a>

3
functions_func_e.html
View File

@@ -99,6 +99,9 @@ $(document).ready(function(){initNavTree('functions_func_e.html',''); initResiza
<li>encrypt_text()
: <a class="el" href="d6/d26/classciphers_1_1_hill_cipher.html#aa8bbb6e4a5749f6008b06602d5103917">ciphers::HillCipher</a>
</li>
<li>enqueue()
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a4dc64488c36f84d927365fa8d1933663">data_structures::queue_using_array::Queue_Array</a>
</li>
<li>enQueue()
: <a class="el" href="db/da9/classqueue.html#a592c0580551ec0d3b4d43e8198d8a377">queue&lt; Kind &gt;</a>
</li>

3
functions_r.html
View File

@@ -102,6 +102,9 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
<li>real()
: <a class="el" href="da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">Complex</a>
</li>
<li>rear
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array</a>
</li>
<li>removeWordHelper()
: <a class="el" href="dd/d2f/class_trie.html#a95216ffc56cb9f8cede982cecb872af4">Trie</a>
</li>

9
functions_vars.html
View File

@@ -114,7 +114,8 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
: <a class="el" href="dc/d61/classgraph_1_1_graph.html#a3ab95bb3ba618a7e883ead8ee696c25c">graph::Graph&lt; T &gt;</a>
</li>
<li>arr
: <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie</a>
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#ae69a0bf6c9921b37c516c8a4d2fb904d">data_structures::queue_using_array::Queue_Array</a>
, <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a362dd78748a1f01ab019e55fd6098a8b">data_structures::trie</a>
</li>
</ul>
@@ -150,6 +151,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<li>forward
: <a class="el" href="d9/d49/structdata__structures_1_1_node.html#ac916d833aad2b9c41f01a92db2f8c48e">data_structures::Node</a>
</li>
<li>front
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a2f676f2f249eb36dfd49711a03e9e67e">data_structures::queue_using_array::Queue_Array</a>
</li>
</ul>
@@ -266,6 +270,9 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index_r"></a>- r -</h3><ul>
<li>rear
: <a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html#a9883dfcceede9a42227d2d313ae86f85">data_structures::queue_using_array::Queue_Array</a>
</li>
<li>root
: <a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html#ab22a97bf6209a085fc2d788c3c0dacbe">graph::RootedTree</a>
</li>

45
globals_func_m.html
View File

@@ -99,16 +99,16 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">n_queens.cpp</a>
, <a class="el" href="d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solve.cpp</a>
, <a class="el" href="da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linked_list.cpp</a>
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
, <a class="el" href="de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_sum.cpp</a>
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
, <a class="el" href="d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">interpolation_search.cpp</a>
, <a class="el" href="df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">interpolation_search2.cpp</a>
, <a class="el" href="de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_sum.cpp</a>
, <a class="el" href="d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_search.cpp</a>
, <a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_iterative_euclidean.cpp</a>
, <a class="el" href="d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">median_search.cpp</a>
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
, <a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_iterative_euclidean.cpp</a>
, <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ternary_search.cpp</a>
, <a class="el" href="da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">depth_first_search.cpp</a>
, <a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_of_n_numbers.cpp</a>
, <a class="el" href="dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">text_search.cpp</a>
, <a class="el" href="d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">rabin_karp.cpp</a>
, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knuth_morris_pratt.cpp</a>
, <a class="el" href="d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">horspool.cpp</a>
@@ -125,15 +125,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">insertion_sort.cpp</a>
, <a class="el" href="d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">heap_sort.cpp</a>
, <a class="el" href="d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gnome_sort.cpp</a>
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">bogo_sort.cpp</a>
, <a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_recursive_euclidean.cpp</a>
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">comb_sort.cpp</a>
, <a class="el" href="de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">cycle_sort.cpp</a>
, <a class="el" href="dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">text_search.cpp</a>
, <a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_of_n_numbers.cpp</a>
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">bogo_sort.cpp</a>
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">comb_sort.cpp</a>
, <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linkedlist_implentation_usingarray.cpp</a>
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">dijkstra.cpp</a>
, <a class="el" href="da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">depth_first_search.cpp</a>
, <a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_recursive_euclidean.cpp</a>
, <a class="el" href="d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">large_factorial.cpp</a>
, <a class="el" href="d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lcm_sum.cpp</a>
, <a class="el" href="d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">interpolation_search.cpp</a>
, <a class="el" href="d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_search.cpp</a>
, <a class="el" href="de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_search.cpp</a>
, <a class="el" href="d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">exponential_search.cpp</a>
@@ -189,15 +189,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modular_inverse_fermat_little_theorem.cpp</a>
, <a class="el" href="d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modular_exponentiation.cpp</a>
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">miller_rabin.cpp</a>
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">least_common_multiple.cpp</a>
, <a class="el" href="d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">magic_number.cpp</a>
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">dijkstra.cpp</a>
, <a class="el" href="d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lcm_sum.cpp</a>
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">least_common_multiple.cpp</a>
, <a class="el" href="d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">caesar_cipher.cpp</a>
, <a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_two_stacks.cpp</a>
, <a class="el" href="d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_array.cpp</a>
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hopcroft_karp.cpp</a>
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">is_graph_bipartite.cpp</a>
, <a class="el" href="d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">skip_list.cpp</a>
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
, <a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_two_stacks.cpp</a>
, <a class="el" href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci.cpp</a>
, <a class="el" href="d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_power.cpp</a>
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
@@ -221,15 +221,15 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
, <a class="el" href="d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">chaining.cpp</a>
, <a class="el" href="df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">jumpgame.cpp</a>
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">is_graph_bipartite.cpp</a>
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
, <a class="el" href="da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">n_queens_all_solution_optimised.cpp</a>
, <a class="el" href="d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hill_cipher.cpp</a>
, <a class="el" href="d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">skip_list.cpp</a>
, <a class="el" href="dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_modern.cpp</a>
, <a class="el" href="d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_tree.cpp</a>
, <a class="el" href="d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">morse_code.cpp</a>
, <a class="el" href="db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">0_1_knapsack.cpp</a>
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
, <a class="el" href="d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_tree.cpp</a>
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
, <a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">jarvis_algorithm.cpp</a>
, <a class="el" href="d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">word_break.cpp</a>
@@ -238,6 +238,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">kadane2.cpp</a>
, <a class="el" href="d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">cut_rod.cpp</a>
, <a class="el" href="d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">coin_change_topdown.cpp</a>
, <a class="el" href="db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">0_1_knapsack.cpp</a>
, <a class="el" href="df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">minimax.cpp</a>
, <a class="el" href="d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">nqueen_print_all_solutions.cpp</a>
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">vigenere_cipher.cpp</a>

6
globals_i.html
View File

@@ -123,15 +123,15 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>is_square()
: <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f">ordinary_least_squares_regressor.cpp</a>
</li>
<li>isPrime()
: <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a>
</li>
<li>IsPrime()
: <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a>
</li>
<li>isprime
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a>
</li>
<li>isPrime()
: <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a>
</li>
<li>it_ternary_search()
: <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a>
</li>

88
globals_m.html
View File

@@ -99,26 +99,27 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d4/d3e/n__queens_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">n_queens.cpp</a>
, <a class="el" href="d6/d7b/sudoku__solve_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">sudoku_solve.cpp</a>
, <a class="el" href="da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linked_list.cpp</a>
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
, <a class="el" href="de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_sum.cpp</a>
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
, <a class="el" href="d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">interpolation_search.cpp</a>
, <a class="el" href="df/d39/interpolation__search2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">interpolation_search2.cpp</a>
, <a class="el" href="de/dc3/fibonacci__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_sum.cpp</a>
, <a class="el" href="d9/d02/linear__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_search.cpp</a>
, <a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_iterative_euclidean.cpp</a>
, <a class="el" href="d9/d69/median__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">median_search.cpp</a>
, <a class="el" href="df/ddd/connected__components_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">connected_components.cpp</a>
, <a class="el" href="d4/da0/gcd__iterative__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_iterative_euclidean.cpp</a>
, <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">ternary_search.cpp</a>
, <a class="el" href="da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">depth_first_search.cpp</a>
, <a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_of_n_numbers.cpp</a>
, <a class="el" href="dc/db5/text__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">text_search.cpp</a>
, <a class="el" href="d1/d11/gcd__of__n__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_of_n_numbers.cpp</a>
, <a class="el" href="d5/ddb/bogo__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">bogo_sort.cpp</a>
, <a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_recursive_euclidean.cpp</a>
, <a class="el" href="d9/dfd/comb__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">comb_sort.cpp</a>
, <a class="el" href="de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">cycle_sort.cpp</a>
, <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linkedlist_implentation_usingarray.cpp</a>
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">dijkstra.cpp</a>
, <a class="el" href="d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">large_factorial.cpp</a>
, <a class="el" href="da/d8d/depth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">depth_first_search.cpp</a>
, <a class="el" href="d4/d45/gcd__recursive__euclidean_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gcd_recursive_euclidean.cpp</a>
, <a class="el" href="de/d07/cycle__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">cycle_sort.cpp</a>
, <a class="el" href="d2/d21/gnome__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gnome_sort.cpp</a>
, <a class="el" href="d6/d9d/large__factorial_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">large_factorial.cpp</a>
, <a class="el" href="d2/d52/heap__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">heap_sort.cpp</a>
, <a class="el" href="d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lcm_sum.cpp</a>
, <a class="el" href="d6/dce/rabin__karp_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">rabin_karp.cpp</a>
, <a class="el" href="de/d6a/knuth__morris__pratt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">knuth_morris_pratt.cpp</a>
, <a class="el" href="d3/dfe/horspool_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">horspool.cpp</a>
@@ -129,21 +130,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d3/d4c/quick__sort__3_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">quick_sort_3.cpp</a>
, <a class="el" href="d1/d21/quick__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">quick_sort.cpp</a>
, <a class="el" href="dd/da8/pigeonhole__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">pigeonhole_sort.cpp</a>
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">insertion_sort.cpp</a>
, <a class="el" href="de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">merge_insertion_sort.cpp</a>
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">least_common_multiple.cpp</a>
, <a class="el" href="d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4">merge_sort.cpp</a>
, <a class="el" href="d3/d92/pancake__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">pancake_sort.cpp</a>
, <a class="el" href="d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">magic_number.cpp</a>
, <a class="el" href="dd/d0d/insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">insertion_sort.cpp</a>
, <a class="el" href="d7/d1e/graph_2dijkstra_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">dijkstra.cpp</a>
, <a class="el" href="d5/d83/lcm__sum_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lcm_sum.cpp</a>
, <a class="el" href="de/d7b/merge__insertion__sort_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">merge_insertion_sort.cpp</a>
, <a class="el" href="d5/d4c/group__sorting.html#gae66f6b31b5ad750f1fe042a706a4e3d4">merge_sort.cpp</a>
, <a class="el" href="d4/d21/least__common__multiple_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">least_common_multiple.cpp</a>
, <a class="el" href="d6/d2c/caesar__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">caesar_cipher.cpp</a>
, <a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_two_stacks.cpp</a>
, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hopcroft_karp.cpp</a>
, <a class="el" href="d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_array.cpp</a>
, <a class="el" href="dd/d0c/hamiltons__cycle_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">hamiltons_cycle.cpp</a>
, <a class="el" href="d9/d44/magic__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">magic_number.cpp</a>
, <a class="el" href="d6/d42/miller__rabin_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">miller_rabin.cpp</a>
, <a class="el" href="d1/d9a/hopcroft__karp_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hopcroft_karp.cpp</a>
, <a class="el" href="d0/d6d/modular__exponentiation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modular_exponentiation.cpp</a>
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">is_graph_bipartite.cpp</a>
, <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">modular_inverse_fermat_little_theorem.cpp</a>
, <a class="el" href="d9/dd7/interpolation__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">interpolation_search.cpp</a>
, <a class="el" href="d1/df3/hash__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hash_search.cpp</a>
, <a class="el" href="de/d0d/fibonacci__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_search.cpp</a>
, <a class="el" href="d8/d8a/exponential__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">exponential_search.cpp</a>
@@ -193,21 +194,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d0/d08/realtime__stats_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">realtime_stats.cpp</a>
, <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">primes_up_to_billion.cpp</a>
, <a class="el" href="de/d9b/prime__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">prime_numbers.cpp</a>
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">number_of_positive_divisors.cpp</a>
, <a class="el" href="d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">skip_list.cpp</a>
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
, <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">power_for_huge_numbers.cpp</a>
, <a class="el" href="db/d0d/prime__factorization_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">prime_factorization.cpp</a>
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
, <a class="el" href="df/dd0/queue__using__two__stacks_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_two_stacks.cpp</a>
, <a class="el" href="d6/dd8/is__graph__bipartite_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">is_graph_bipartite.cpp</a>
, <a class="el" href="d0/da2/number__of__positive__divisors_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">number_of_positive_divisors.cpp</a>
, <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">power_for_huge_numbers.cpp</a>
, <a class="el" href="de/dde/lowest__common__ancestor_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">lowest_common_ancestor.cpp</a>
, <a class="el" href="da/dac/n__queens__all__solution__optimised_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">n_queens_all_solution_optimised.cpp</a>
, <a class="el" href="d7/db9/hill__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">hill_cipher.cpp</a>
, <a class="el" href="dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_modern.cpp</a>
, <a class="el" href="d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">skip_list.cpp</a>
, <a class="el" href="da/d77/spirograph_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">spirograph.cpp</a>
, <a class="el" href="df/d64/jumpgame_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">jumpgame.cpp</a>
, <a class="el" href="dc/d93/trie__modern_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_modern.cpp</a>
, <a class="el" href="d9/d92/chaining_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">chaining.cpp</a>
, <a class="el" href="d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_tree.cpp</a>
, <a class="el" href="d6/d80/double__hash__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">double_hash_hash_table.cpp</a>
, <a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_probing_hash_table.cpp</a>
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci_fast.cpp</a>
, <a class="el" href="d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">morse_code.cpp</a>
, <a class="el" href="d9/d89/fibonacci_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fibonacci.cpp</a>
, <a class="el" href="d2/d0b/fast__power_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">fast_power.cpp</a>
, <a class="el" href="d9/d00/factorial_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">factorial.cpp</a>
@@ -225,25 +226,25 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="d9/d49/kohonen__som__trace_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_trace.cpp</a>
, <a class="el" href="d4/def/kohonen__som__topology_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">kohonen_som_topology.cpp</a>
, <a class="el" href="d5/db0/adaline__learning_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">adaline_learning.cpp</a>
, <a class="el" href="d8/d76/morse__code_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">morse_code.cpp</a>
, <a class="el" href="db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">0_1_knapsack.cpp</a>
, <a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">quadratic_probing_hash_table.cpp</a>
, <a class="el" href="d5/d33/gram__schmidt_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">gram_schmidt.cpp</a>
, <a class="el" href="d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">coin_change_topdown.cpp</a>
, <a class="el" href="d7/d83/trie__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">trie_tree.cpp</a>
, <a class="el" href="d1/dc7/linear__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linear_probing_hash_table.cpp</a>
, <a class="el" href="db/d71/quadratic__probing__hash__table_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">quadratic_probing_hash_table.cpp</a>
, <a class="el" href="db/d16/0__1__knapsack_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">0_1_knapsack.cpp</a>
, <a class="el" href="df/dfb/minimax_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">minimax.cpp</a>
, <a class="el" href="d7/d24/nqueen__print__all__solutions_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">nqueen_print_all_solutions.cpp</a>
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">vigenere_cipher.cpp</a>
, <a class="el" href="d9/d31/coin__change__topdown_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">coin_change_topdown.cpp</a>
, <a class="el" href="d6/d10/cut__rod_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">cut_rod.cpp</a>
, <a class="el" href="db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">kadane2.cpp</a>
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">xor_cipher.cpp</a>
, <a class="el" href="db/dca/kadane2_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">kadane2.cpp</a>
, <a class="el" href="d5/d90/palindrome__partitioning_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">palindrome_partitioning.cpp</a>
, <a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">shortest_common_supersequence.cpp</a>
, <a class="el" href="dc/d5a/rat__maze_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">rat_maze.cpp</a>
, <a class="el" href="df/d82/breadth__first__search_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">breadth_first_search.cpp</a>
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
, <a class="el" href="d8/dee/avltree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">avltree.cpp</a>
, <a class="el" href="d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">word_break.cpp</a>
, <a class="el" href="d8/d6c/line__segment__intersection_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">line_segment_intersection.cpp</a>
, <a class="el" href="d4/d8d/jarvis__algorithm_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">jarvis_algorithm.cpp</a>
, <a class="el" href="d7/d65/shortest__common__supersequence_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">shortest_common_supersequence.cpp</a>
, <a class="el" href="d3/d84/word__break_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">word_break.cpp</a>
, <a class="el" href="de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">disjoint_set.cpp</a>
</li>
<li>mat_mul()
@@ -256,18 +257,21 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
: <a class="el" href="d1/dbe/lu__decomposition_8h.html#aed8766713ee9b561a4acdcdff5f90ea5">lu_decomposition.h</a>
</li>
<li>MAX
: <a class="el" href="d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">hash_search.cpp</a>
: <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">fibonacci_fast.cpp</a>
, <a class="el" href="df/def/power__for__huge__numbers_8cpp.html#a392fb874e547e582e9c66a08a1f23326">power_for_huge_numbers.cpp</a>
, <a class="el" href="dc/dc5/paranthesis__matching_8cpp.html#a392fb874e547e582e9c66a08a1f23326">paranthesis_matching.cpp</a>
, <a class="el" href="d4/d32/fibonacci__fast_8cpp.html#a392fb874e547e582e9c66a08a1f23326">fibonacci_fast.cpp</a>
, <a class="el" href="dc/dfe/ternary__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">ternary_search.cpp</a>
, <a class="el" href="d1/df3/hash__search_8cpp.html#a392fb874e547e582e9c66a08a1f23326">hash_search.cpp</a>
</li>
<li>MAX_ITER
: <a class="el" href="d9/d66/group__machine__learning.html#ga5118e5cbc4f0886e27b3a7a2544dded1">adaline_learning.cpp</a>
</li>
<li>MAX_ITERATIONS
: <a class="el" href="d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">bisection_method.cpp</a>
, <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">newton_raphson_method.cpp</a>
: <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">newton_raphson_method.cpp</a>
, <a class="el" href="d7/d6a/bisection__method_8cpp.html#a0a3abbca80bc98e7abcb3ae73abe0f14">bisection_method.cpp</a>
</li>
<li>max_size
: <a class="el" href="d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">queue_using_array.cpp</a>
</li>
<li>merge()
: <a class="el" href="d5/d4c/group__sorting.html#ga460c61cd948203b4816bef2accb3fc73">merge_sort.cpp</a>

3
globals_vars.html
View File

@@ -121,6 +121,9 @@ $(document).ready(function(){initNavTree('globals_vars.html',''); initResizable(
<li>MAX_ITERATIONS
: <a class="el" href="de/dd3/newton__raphson__method_8cpp.html#a5c5ff05b9f37ae59dad67e1d4f6cd51d">newton_raphson_method.cpp</a>
</li>
<li>max_size
: <a class="el" href="d8/df0/queue__using__array_8cpp.html#a2d49e79bd164c298912db252970520d8">queue_using_array.cpp</a>
</li>
<li>prime
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#ac0f4b77b901ddb15dab4c4dee1ac6e95">primes_up_to_billion.cpp</a>
</li>

2
hierarchy.html
View File

@@ -139,7 +139,7 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dd2/class_queue___array.html" target="_self">Queue_Array</a></td><td class="desc"></td></tr>
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_42_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_42_" class="arrow" onclick="toggleFolder('42_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_42_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>

2
hierarchy.js
View File

@@ -42,7 +42,7 @@ var hierarchy =
[ "query", "dd/d1b/structquery.html", null ],
[ "Queue", "dc/db5/struct_queue.html", null ],
[ "queue< Kind >", "db/da9/classqueue.html", null ],
[ "Queue_Array", "d0/dd2/class_queue___array.html", null ],
[ "data_structures::queue_using_array::Queue_Array", "d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html", null ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", null ],
[ "range_queries::heavy_light_decomposition::SG< X >", "d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html", [
[ "range_queries::heavy_light_decomposition::HLD< X >", "d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html", null ]

8
index.html
View File

@@ -96,10 +96,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
<div class="contents">
<div class="textblock"><p><a class="anchor" id="mainpage"></a></p>
<p><a href="https://gitpod.io/#https://github.com/TheAlgorithms/C-Plus-Plus"><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code" class="inline"/></a> <a href="https://lgtm.com/projects/g/TheAlgorithms/C-Plus-Plus/context:cpp"><img src="https://img.shields.io/lgtm/grade/cpp/g/TheAlgorithms/C-Plus-Plus.svg?logo=lgtm&amp;logoWidth=18" alt="Language grade: C/C++" style="pointer-events: none;" class="inline"/></a> <a href="https://gitter.im/TheAlgorithms"><img src="https://img.shields.io/badge/Chat-Gitter-ff69b4.svg?label=Chat&amp;logo=gitter&amp;style=flat-square" alt="Gitter chat" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md"><img src="https://img.shields.io/static/v1.svg?label=Contributions&amp;message=Welcome&amp;color=0059b3&amp;style=flat-square" alt="contributions welcome" style="pointer-events: none;" class="inline"/></a> <img src="https://img.shields.io/github/repo-size/TheAlgorithms/C-Plus-Plus?color=red&amp;style=flat-square" alt="GitHub repo size" class="inline"/> <a href="https://TheAlgorithms.github.io/C-Plus-Plus"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Doxygen%20CI/badge.svg" alt="Doxygen CI" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/actions?query=workflow%3A%22Awesome+CI+Workflow%22"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Awesome%20CI%20Workflow/badge.svg" alt="Awesome CI" style="pointer-events: none;" class="inline"/></a></p>
<h1><a class="anchor" id="autotoc_md62"></a>
<h1><a class="anchor" id="autotoc_md63"></a>
Overview</h1>
<p>The repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/LICENSE">MIT License</a>. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.</p>
<h1><a class="anchor" id="autotoc_md63"></a>
<h1><a class="anchor" id="autotoc_md64"></a>
Features</h1>
<ul>
<li>The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - <a href="https://en.wikipedia.org/wiki/C%2B%2B">C++</a>.</li>
@@ -110,12 +110,12 @@ Features</h1>
<li>Self-checks within programs ensure correct implementations with confidence.</li>
<li>Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.</li>
</ul>
<h1><a class="anchor" id="autotoc_md64"></a>
<h1><a class="anchor" id="autotoc_md65"></a>
Documentation</h1>
<p><a href="https://TheAlgorithms.github.io/C-Plus-Plus">Online Documentation</a> is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on <a href="https://TheAlgorithms.github.io/C-Plus-Plus/files.html">Files menu</a> to see the list of all the files documented with the code.</p>
<p><a href="https://thealgorithms.github.io/C-Plus-Plus">Documentation of Algorithms in C++</a> by <a href="https://github.com/TheAlgorithms/C-Plus-Plus/graphs/contributors">The Algorithms Contributors</a> is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/?ref=chooser-v1">CC BY-SA 4.0</a><br />
<a href="https://creativecommons.org/licenses/by-sa/4.0"><img src="https://mirrors.creativecommons.org/presskit/icons/cc.svg" alt="Creative Commons License" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/by.svg" alt="Credit must be given to the creator" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/sa.svg" alt="Adaptations must be shared under the same terms" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/></a></p>
<h1><a class="anchor" id="autotoc_md65"></a>
<h1><a class="anchor" id="autotoc_md66"></a>
Contributions</h1>
<p>As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md">Contribution Guidelines</a>. </p>
</div></div><!-- PageDoc -->

2
inherit_graph_10.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d0/d3e/classdata__structures_1_1trie.html" title="Trie implementation for small&#45;case English alphabets a&#45;z" alt="" coords="5,5,144,32"/>
<area shape="rect" id="node1" href="$d4/d90/classdata__structures_1_1_skip_list.html" title=" " alt="" coords="5,5,172,32"/>
</map>

2
inherit_graph_10.md5
View File

@@ -1 +1 @@
328ab509bf116ce8b376591ac881beaf
29c2cad0bf4ed559e4d21194b66ddffa

12
inherit_graph_10.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="112pt" height="28pt"
viewBox="0.00 0.00 112.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="133pt" height="28pt"
viewBox="0.00 0.00 133.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 108,-24 108,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 129,-24 129,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d0/d3e/classdata__structures_1_1trie.html" target="_top" xlink:title="Trie implementation for small&#45;case English alphabets a&#45;z">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 104,-19.5 104,-0.5 0,-0.5"/>
<text text-anchor="middle" x="52" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
<g id="a_node1"><a xlink:href="d4/d90/classdata__structures_1_1_skip_list.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 125,-19.5 125,-0.5 0,-0.5"/>
<text text-anchor="middle" x="62.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::SkipList</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.1 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_11.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/dde/structdouble__hashing_1_1_entry.html" title=" " alt="" coords="5,5,156,32"/>
<area shape="rect" id="node1" href="$d0/d3e/classdata__structures_1_1trie.html" title="Trie implementation for small&#45;case English alphabets a&#45;z" alt="" coords="5,5,144,32"/>
</map>

2
inherit_graph_11.md5
View File

@@ -1 +1 @@
5bc10ee734d6914f823e79216ece320c
328ab509bf116ce8b376591ac881beaf

12
inherit_graph_11.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="121pt" height="28pt"
viewBox="0.00 0.00 121.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="112pt" height="28pt"
viewBox="0.00 0.00 112.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 117,-24 117,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 108,-24 108,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d9/dde/structdouble__hashing_1_1_entry.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 113,-19.5 113,-0.5 0,-0.5"/>
<text text-anchor="middle" x="56.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::Entry</text>
<g id="a_node1"><a xlink:href="d0/d3e/classdata__structures_1_1trie.html" target="_top" xlink:title="Trie implementation for small&#45;case English alphabets a&#45;z">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 104,-19.5 104,-0.5 0,-0.5"/>
<text text-anchor="middle" x="52" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::trie</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.1 KiB

2
inherit_graph_12.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/dee/classdouble__linked__list.html" title=" " alt="" coords="5,5,131,32"/>
<area shape="rect" id="node1" href="$d9/dde/structdouble__hashing_1_1_entry.html" title=" " alt="" coords="5,5,156,32"/>
</map>

2
inherit_graph_12.md5
View File

@@ -1 +1 @@
3698eafa20825f92264fab47ce72bb67
5bc10ee734d6914f823e79216ece320c

12
inherit_graph_12.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="102pt" height="28pt"
viewBox="0.00 0.00 102.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="121pt" height="28pt"
viewBox="0.00 0.00 121.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 98,-24 98,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 117,-24 117,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d9/dee/classdouble__linked__list.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 94,-19.5 94,-0.5 0,-0.5"/>
<text text-anchor="middle" x="47" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">double_linked_list</text>
<g id="a_node1"><a xlink:href="d9/dde/structdouble__hashing_1_1_entry.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 113,-19.5 113,-0.5 0,-0.5"/>
<text text-anchor="middle" x="56.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">double_hashing::Entry</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1019 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_13.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d7/d77/class_edge.html" title=" " alt="" coords="5,5,57,32"/>
<area shape="rect" id="node1" href="$d9/dee/classdouble__linked__list.html" title=" " alt="" coords="5,5,131,32"/>
</map>

2
inherit_graph_13.md5
View File

@@ -1 +1 @@
e148e1f3f544084b7aa1e7be1efaa9bb
3698eafa20825f92264fab47ce72bb67

12
inherit_graph_13.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="47pt" height="28pt"
viewBox="0.00 0.00 47.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="102pt" height="28pt"
viewBox="0.00 0.00 102.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 43,-24 43,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 98,-24 98,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d7/d77/class_edge.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 39,-19.5 39,-0.5 0,-0.5"/>
<text text-anchor="middle" x="19.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Edge</text>
<g id="a_node1"><a xlink:href="d9/dee/classdouble__linked__list.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 94,-19.5 94,-0.5 0,-0.5"/>
<text text-anchor="middle" x="47" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">double_linked_list</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 990 B

After

Width:  |  Height:  |  Size: 1019 B

2
inherit_graph_14.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dd/d91/class_fenwick_tree.html" title=" " alt="" coords="5,5,103,32"/>
<area shape="rect" id="node1" href="$d7/d77/class_edge.html" title=" " alt="" coords="5,5,57,32"/>
</map>

2
inherit_graph_14.md5
View File

@@ -1 +1 @@
26396299a5a5a0cf88af656fc914cf13
e148e1f3f544084b7aa1e7be1efaa9bb

12
inherit_graph_14.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="81pt" height="28pt"
viewBox="0.00 0.00 81.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="47pt" height="28pt"
viewBox="0.00 0.00 47.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 77,-24 77,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 43,-24 43,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/d91/class_fenwick_tree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 73,-19.5 73,-0.5 0,-0.5"/>
<text text-anchor="middle" x="36.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">FenwickTree</text>
<g id="a_node1"><a xlink:href="d7/d77/class_edge.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 39,-19.5 39,-0.5 0,-0.5"/>
<text text-anchor="middle" x="19.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Edge</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1005 B

After

Width:  |  Height:  |  Size: 990 B

2
inherit_graph_15.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" title=" " alt="" coords="5,5,193,32"/>
<area shape="rect" id="node1" href="$dd/d91/class_fenwick_tree.html" title=" " alt="" coords="5,5,103,32"/>
</map>

2
inherit_graph_15.md5
View File

@@ -1 +1 @@
6940f502400c229af84789c6c00f1735
26396299a5a5a0cf88af656fc914cf13

12
inherit_graph_15.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="149pt" height="28pt"
viewBox="0.00 0.00 149.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="81pt" height="28pt"
viewBox="0.00 0.00 81.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 145,-24 145,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 77,-24 77,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 141,-19.5 141,-0.5 0,-0.5"/>
<text text-anchor="middle" x="70.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
<g id="a_node1"><a xlink:href="dd/d91/class_fenwick_tree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 73,-19.5 73,-0.5 0,-0.5"/>
<text text-anchor="middle" x="36.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">FenwickTree</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1005 B

2
inherit_graph_16.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/d5a/structgeometry_1_1jarvis_1_1_point.html" title=" " alt="" coords="5,5,159,32"/>
<area shape="rect" id="node1" href="$d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" title=" " alt="" coords="5,5,193,32"/>
</map>

2
inherit_graph_16.md5
View File

@@ -1 +1 @@
595208590648226e9aacf172b391904d
6940f502400c229af84789c6c00f1735

12
inherit_graph_16.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="123pt" height="28pt"
viewBox="0.00 0.00 123.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="149pt" height="28pt"
viewBox="0.00 0.00 149.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 119,-24 119,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 145,-24 145,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 115,-19.5 115,-0.5 0,-0.5"/>
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Point</text>
<g id="a_node1"><a xlink:href="d4/dde/classgeometry_1_1jarvis_1_1_convexhull.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 141,-19.5 141,-0.5 0,-0.5"/>
<text text-anchor="middle" x="70.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Convexhull</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_17.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$da/d9a/class_graph.html" title=" " alt="" coords="5,5,63,32"/>
<area shape="rect" id="node1" href="$d9/d5a/structgeometry_1_1jarvis_1_1_point.html" title=" " alt="" coords="5,5,159,32"/>
</map>

2
inherit_graph_17.md5
View File

@@ -1 +1 @@
4eeb1b22e1ab39b25c3d6d16904bf56f
595208590648226e9aacf172b391904d

12
inherit_graph_17.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="51pt" height="28pt"
viewBox="0.00 0.00 51.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="123pt" height="28pt"
viewBox="0.00 0.00 123.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 47,-24 47,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 119,-24 119,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="da/d9a/class_graph.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 43,-19.5 43,-0.5 0,-0.5"/>
<text text-anchor="middle" x="21.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Graph</text>
<g id="a_node1"><a xlink:href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 115,-19.5 115,-0.5 0,-0.5"/>
<text text-anchor="middle" x="57.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">geometry::jarvis::Point</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 992 B

After

Width:  |  Height:  |  Size: 1.0 KiB

3
inherit_graph_18.map
View File

@@ -1,4 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="5,5,135,32"/>
<area shape="rect" id="node2" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="183,5,313,32"/>
<area shape="rect" id="node1" href="$da/d9a/class_graph.html" title=" " alt="" coords="5,5,63,32"/>
</map>

2
inherit_graph_18.md5
View File

@@ -1 +1 @@
6eafaf6d042df9847e0e9a0f31d08595
4eeb1b22e1ab39b25c3d6d16904bf56f

27
inherit_graph_18.svg
View File

@@ -4,34 +4,19 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="239pt" height="28pt"
viewBox="0.00 0.00 239.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="51pt" height="28pt"
viewBox="0.00 0.00 51.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 235,-24 235,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 47,-24 47,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dc/d61/classgraph_1_1_graph.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 97,-19.5 97,-0.5 0,-0.5"/>
<text text-anchor="middle" x="48.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph&lt; T &gt;</text>
<g id="a_node1"><a xlink:href="da/d9a/class_graph.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 43,-19.5 43,-0.5 0,-0.5"/>
<text text-anchor="middle" x="21.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Graph</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="node2" class="node">
<title>Node1</title>
<g id="a_node2"><a xlink:href="d0/d58/classgraph_1_1_rooted_tree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="133,-0.5 133,-19.5 231,-19.5 231,-0.5 133,-0.5"/>
<text text-anchor="middle" x="182" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node0&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M107.57,-10C116.06,-10 124.71,-10 132.97,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="107.35,-6.5 97.35,-10 107.35,-13.5 107.35,-6.5"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 992 B

3
inherit_graph_19.map
View File

@@ -1,3 +1,4 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d8/d69/classgraph_1_1_h_k_graph.html" title="Represents Bipartite graph for Hopcroft Karp implementation." alt="" coords="5,5,121,32"/>
<area shape="rect" id="node1" href="$dc/d61/classgraph_1_1_graph.html" title=" " alt="" coords="5,5,135,32"/>
<area shape="rect" id="node2" href="$d0/d58/classgraph_1_1_rooted_tree.html" title=" " alt="" coords="183,5,313,32"/>
</map>

2
inherit_graph_19.md5
View File

@@ -1 +1 @@
30974a2267f7342480d9da8515eba7fd
6eafaf6d042df9847e0e9a0f31d08595

27
inherit_graph_19.svg
View File

@@ -4,19 +4,34 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="95pt" height="28pt"
viewBox="0.00 0.00 95.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="239pt" height="28pt"
viewBox="0.00 0.00 239.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 91,-24 91,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 235,-24 235,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d8/d69/classgraph_1_1_h_k_graph.html" target="_top" xlink:title="Represents Bipartite graph for Hopcroft Karp implementation.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 87,-19.5 87,-0.5 0,-0.5"/>
<text text-anchor="middle" x="43.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph</text>
<g id="a_node1"><a xlink:href="dc/d61/classgraph_1_1_graph.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 97,-19.5 97,-0.5 0,-0.5"/>
<text text-anchor="middle" x="48.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::Graph&lt; T &gt;</text>
</a>
</g>
</g>
<!-- Node1 -->
<g id="node2" class="node">
<title>Node1</title>
<g id="a_node2"><a xlink:href="d0/d58/classgraph_1_1_rooted_tree.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="133,-0.5 133,-19.5 231,-19.5 231,-0.5 133,-0.5"/>
<text text-anchor="middle" x="182" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::RootedTree</text>
</a>
</g>
</g>
<!-- Node0&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node0&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M107.57,-10C116.06,-10 124.71,-10 132.97,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="107.35,-6.5 97.35,-10 107.35,-13.5 107.35,-6.5"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.7 KiB

2
inherit_graph_20.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" title="Class for representing graph as an adjacency list." alt="" coords="5,5,169,47"/>
<area shape="rect" id="node1" href="$d8/d69/classgraph_1_1_h_k_graph.html" title="Represents Bipartite graph for Hopcroft Karp implementation." alt="" coords="5,5,121,32"/>
</map>

2
inherit_graph_20.md5
View File

@@ -1 +1 @@
caa13fcf076ba3470984229bfbfdc7c1
30974a2267f7342480d9da8515eba7fd

15
inherit_graph_20.svg
View File

@@ -4,18 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="131pt" height="39pt"
viewBox="0.00 0.00 131.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<svg width="95pt" height="28pt"
viewBox="0.00 0.00 95.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 127,-35 127,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 91,-24 91,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_top" xlink:title="Class for representing graph as an adjacency list.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 123,-30.5 123,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
<text text-anchor="middle" x="61.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph</text>
<g id="a_node1"><a xlink:href="d8/d69/classgraph_1_1_h_k_graph.html" target="_top" xlink:title="Represents Bipartite graph for Hopcroft Karp implementation.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 87,-19.5 87,-0.5 0,-0.5"/>
<text text-anchor="middle" x="43.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::HKGraph</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.2 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_21.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html" title=" " alt="" coords="5,5,215,32"/>
<area shape="rect" id="node1" href="$de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" title="Class for representing graph as an adjacency list." alt="" coords="5,5,169,47"/>
</map>

2
inherit_graph_21.md5
View File

@@ -1 +1 @@
bafb3280f8e20dc1a7424343016b176d
caa13fcf076ba3470984229bfbfdc7c1

15
inherit_graph_21.svg
View File

@@ -4,17 +4,18 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="165pt" height="28pt"
viewBox="0.00 0.00 165.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<svg width="131pt" height="39pt"
viewBox="0.00 0.00 131.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 161,-24 161,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 127,-35 127,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 157,-19.5 157,-0.5 0,-0.5"/>
<text text-anchor="middle" x="78.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
<g id="a_node1"><a xlink:href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html" target="_top" xlink:title="Class for representing graph as an adjacency list.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 123,-30.5 123,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::is_graph_bipartite</text>
<text text-anchor="middle" x="61.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::Graph</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.2 KiB

2
inherit_graph_22.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$dd/d1c/classhash__chain.html" title="Chain class with a given modulus." alt="" coords="5,5,93,32"/>
<area shape="rect" id="node1" href="$d9/d23/classgraph_1_1_lowest_common_ancestor.html" title=" " alt="" coords="5,5,215,32"/>
</map>

2
inherit_graph_22.md5
View File

@@ -1 +1 @@
6a0f93ba427d9329d424820da1078327
bafb3280f8e20dc1a7424343016b176d

12
inherit_graph_22.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="74pt" height="28pt"
viewBox="0.00 0.00 74.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="165pt" height="28pt"
viewBox="0.00 0.00 165.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 70,-24 70,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 161,-24 161,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="dd/d1c/classhash__chain.html" target="_top" xlink:title="Chain class with a given modulus.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 66,-19.5 66,-0.5 0,-0.5"/>
<text text-anchor="middle" x="33" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain</text>
<g id="a_node1"><a xlink:href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 157,-19.5 157,-0.5 0,-0.5"/>
<text text-anchor="middle" x="78.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">graph::LowestCommonAncestor</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.0 KiB

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_23.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$db/d66/struct_item.html" title=" " alt="" coords="5,5,53,32"/>
<area shape="rect" id="node1" href="$dd/d1c/classhash__chain.html" title="Chain class with a given modulus." alt="" coords="5,5,93,32"/>
</map>

2
inherit_graph_23.md5
View File

@@ -1 +1 @@
458fe77fc737dff37fe3ca54afe8d9fd
6a0f93ba427d9329d424820da1078327

12
inherit_graph_23.svg
View File

@@ -4,17 +4,17 @@
<!-- Generated by graphviz version 2.44.1 (20200629.0846)
-->
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
<svg width="44pt" height="28pt"
viewBox="0.00 0.00 44.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="74pt" height="28pt"
viewBox="0.00 0.00 74.00 28.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
<title>Graphical Class Hierarchy</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 40,-24 40,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 70,-24 70,4 -4,4"/>
<!-- Node0 -->
<g id="node1" class="node">
<title>Node0</title>
<g id="a_node1"><a xlink:href="db/d66/struct_item.html" target="_top" xlink:title=" ">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 36,-19.5 36,-0.5 0,-0.5"/>
<text text-anchor="middle" x="18" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">Item</text>
<g id="a_node1"><a xlink:href="dd/d1c/classhash__chain.html" target="_top" xlink:title="Chain class with a given modulus.">
<polygon fill="white" stroke="black" points="0,-0.5 0,-19.5 66,-19.5 66,-0.5 0,-0.5"/>
<text text-anchor="middle" x="33" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">hash_chain</text>
</a>
</g>
</g>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 989 B

After

Width:  |  Height:  |  Size: 1.0 KiB

2
inherit_graph_24.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$db/d82/classlarge__number.html" title=" " alt="" coords="5,5,105,32"/>
<area shape="rect" id="node1" href="$db/d66/struct_item.html" title=" " alt="" coords="5,5,53,32"/>
</map>

Some files were not shown because too many files have changed in this diff Show More