mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-06-10 12:06:29 +08:00
Documentation for e813f9b2a6
This commit is contained in:
github-actions
@@ -102,14 +102,16 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
|
||||
<tr id="row_1_0_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_0_" class="arrow" onclick="toggleFolder('1_0_')">▼</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;"> </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;"> </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:16px;display:inline-block;"> </span><span id="arr_1_1_" class="arrow" onclick="toggleFolder('1_1_')">▼</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;"> </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:16px;display:inline-block;"> </span><span id="arr_1_2_" class="arrow" onclick="toggleFolder('1_2_')">▼</span><span class="icona"><span class="icon">N</span></span><b>tree_234</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_1_2_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
|
||||
<tr id="row_1_2_1_" class="even"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
|
||||
<tr id="row_1_3_"><td class="entry"><span style="width:32px;display:inline-block;"> </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_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </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_5_"><td class="entry"><span style="width:32px;display:inline-block;"> </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;"> </span><span id="arr_1_1_" class="arrow" onclick="toggleFolder('1_1_')">▼</span><span class="icona"><span class="icon">N</span></span><b>list_array</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_1_1_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html" target="_self">list</a></td><td class="desc">Structure of List with supporting methods </td></tr>
|
||||
<tr id="row_1_2_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_2_" class="arrow" onclick="toggleFolder('1_2_')">▼</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_2_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </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_3_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span id="arr_1_3_" class="arrow" onclick="toggleFolder('1_3_')">▼</span><span class="icona"><span class="icon">N</span></span><b>tree_234</b></td><td class="desc"></td></tr>
|
||||
<tr id="row_1_3_0_"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
|
||||
<tr id="row_1_3_1_" class="even"><td class="entry"><span style="width:48px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
|
||||
<tr id="row_1_4_"><td class="entry"><span style="width:32px;display:inline-block;"> </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_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </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_6_"><td class="entry"><span style="width:32px;display:inline-block;"> </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_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_2_" class="arrow" onclick="toggleFolder('2_')">▼</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_"><td class="entry"><span style="width:32px;display:inline-block;"> </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_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_3_" class="arrow" onclick="toggleFolder('3_')">▼</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>
|
||||
@@ -168,8 +170,8 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
|
||||
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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>
|
||||
|
||||
@@ -8,6 +8,9 @@ var annotated_dup =
|
||||
[ "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" ]
|
||||
] ],
|
||||
[ "list_array", null, [
|
||||
[ "list", "d5/dab/structdata__structures_1_1list__array_1_1list.html", "d5/dab/structdata__structures_1_1list__array_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" ]
|
||||
] ],
|
||||
@@ -94,8 +97,8 @@ var annotated_dup =
|
||||
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
|
||||
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
|
||||
[ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ],
|
||||
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
|
||||
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
|
||||
[ "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" ],
|
||||
|
||||
@@ -125,7 +125,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
|
||||
<dd><a class="el" href="db/d66/struct_item.html">Item</a></dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a name="letter_L">L</a></dt>
|
||||
<dd><a class="el" href="db/d82/classlarge__number.html">large_number</a></dd><dd><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> (data_structures::linked_list)</dd><dd><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a></dd><dd><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> (data_structures::linked_list)</dd><dd><a class="el" href="d8/d10/structlist.html">list</a></dd><dd><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd></dl>
|
||||
<dd><a class="el" href="db/d82/classlarge__number.html">large_number</a></dd><dd><a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html">link</a> (data_structures::linked_list)</dd><dd><a class="el" href="d0/dff/structlinkedlist.html">linkedlist</a></dd><dd><a class="el" href="d1/def/classdata__structures_1_1linked__list_1_1list.html">list</a> (data_structures::linked_list)</dd><dd><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html">list</a> (data_structures::list_array)</dd><dd><a class="el" href="d8/d10/structlist.html">list</a></dd><dd><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html">LowestCommonAncestor</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd></dl>
|
||||
<dl class="classindex even">
|
||||
<dt class="alphachar"><a name="letter_M">M</a></dt>
|
||||
<dd><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a></dd><dd><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a></dd><dd><a class="el" href="d1/d77/structmst.html">mst</a></dd></dl>
|
||||
@@ -137,7 +137,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
|
||||
<dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>
|
||||
<dl class="classindex odd">
|
||||
<dt class="alphachar"><a name="letter_Q">Q</a></dt>
|
||||
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><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)</dd></dl>
|
||||
<dd><a class="el" href="dd/d1b/structquery.html">query</a></dd><dd><a class="el" href="dc/db5/struct_queue.html">Queue</a></dd><dd><a class="el" href="db/da9/classqueue.html">queue</a></dd><dd><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)</dd></dl>
|
||||
<dl class="classindex even">
|
||||
<dt class="alphachar"><a name="letter_R">R</a></dt>
|
||||
<dd><a class="el" href="d0/d58/classgraph_1_1_rooted_tree.html">RootedTree</a> (<a class="el" href="df/dce/namespacegraph.html">graph</a>)</dd></dl>
|
||||
|
||||
@@ -479,7 +479,7 @@ Here is the call graph for this function:</div>
|
||||
<p>Test case: result should be: <br />
|
||||
Circle with <br />
|
||||
radius 1.821078397711709 <br />
|
||||
centre at (2.142857142857143, 1.7857142857142856) </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000010">Todo:</a></b></dt><dd>This test fails </dd></dl>
|
||||
centre at (2.142857142857143, 1.7857142857142856) </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000009">Todo:</a></b></dt><dd>This test fails </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  {</div>
|
||||
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Point></a> Pv;</div>
|
||||
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  Pv.<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/push_back.html">push_back</a>(<a class="code" href="../../d8/dc8/struct_point.html">Point</a>(0.5, 1));</div>
|
||||
|
||||
@@ -235,7 +235,7 @@ Here is the call graph for this function:</div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>removes the string if it is not a prefix of any other string, if it is then just sets the ::data_structure::trie::isEndofWord to false, else removes the given string </p><dl class="section note"><dt>Note</dt><dd>the function ::data_structure::trie::deleteString might be erroneous </dd></dl>
|
||||
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000005">Todo:</a></b></dt><dd>review the function ::data_structure::trie::deleteString and the commented lines </dd></dl>
|
||||
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000004">Todo:</a></b></dt><dd>review the function ::data_structure::trie::deleteString and the commented lines </dd></dl>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">str</td><td>string to remove </td></tr>
|
||||
|
||||
@@ -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_md57"></a>
|
||||
<h3><a class="anchor" id="autotoc_md58"></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_md58"></a>
|
||||
<h3><a class="anchor" id="autotoc_md59"></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_md59"></a>
|
||||
<h3><a class="anchor" id="autotoc_md60"></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_md60"></a>
|
||||
<h3><a class="anchor" id="autotoc_md61"></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_md61"></a>
|
||||
<h3><a class="anchor" id="autotoc_md62"></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_md62"></a>
|
||||
<h3><a class="anchor" id="autotoc_md63"></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>
|
||||
|
||||
@@ -164,7 +164,7 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
<dl class="section copyright"><dt>Copyright</dt><dd>2020 Arctic2333</dd></dl>
|
||||
<p>In this algorithm, we use the method of division and reservation remainder to construct the hash function, and use the method of chain address to solve the conflict, that is, we link a chain list after the data, and store all the records whose keywords are synonyms in the same linear chain list.</p>
|
||||
<dl class="section warning"><dt>Warning</dt><dd>This program is only for educational purposes. It has serious flaws in implementation with regards to memory management resulting in large amounts of memory leaks. </dd></dl>
|
||||
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000012">Todo:</a></b></dt><dd>fix the program for memory leaks and better structure in C++ and not C fashion </dd></dl>
|
||||
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000011">Todo:</a></b></dt><dd>fix the program for memory leaks and better structure in C++ and not C fashion </dd></dl>
|
||||
</div><h2 class="groupheader">Typedef Documentation</h2>
|
||||
<a id="a8ca8dcb494104d273679e219e53d0555"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a8ca8dcb494104d273679e219e53d0555">◆ </a></span>node</h2>
|
||||
@@ -204,7 +204,7 @@ int </td><td class="memItemRight" valign="bottom"><a class="el" href="../..
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section warning"><dt>Warning</dt><dd>dynamic memory allocated to <code>n</code> never gets freed. </dd></dl>
|
||||
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000013">Todo:</a></b></dt><dd>fix memory leak </dd></dl>
|
||||
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000012">Todo:</a></b></dt><dd>fix memory leak </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  { <span class="comment">// Construct hash table</span></div>
|
||||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">link</a> p, n;</div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordtype">int</span> index;</div>
|
||||
|
||||
@@ -152,7 +152,7 @@ Functions</h2></td></tr>
|
||||
<p>two elements a[i] and a[j] form an inversion if <code>a[i]</code> > <code>a[j]</code> and i < j</p>
|
||||
<p>Time Complexity --> <code>O(n.log n)</code></p>
|
||||
<p>Space Complexity --> <code>O(n)</code> ; additional array <code>temp[1..n]</code> </p>
|
||||
<h3><a class="anchor" id="autotoc_md71"></a>
|
||||
<h3><a class="anchor" id="autotoc_md72"></a>
|
||||
Algorithm</h3>
|
||||
<ol type="1">
|
||||
<li>The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.</li>
|
||||
|
||||
@@ -167,7 +167,7 @@ Functions</h2></td></tr>
|
||||
<li>Call obj.update(node, new_val), to update the value at index 'node' to the new value. Note: node must be 0 indexed</li>
|
||||
<li>Call obj.query(a, b) to get the (sum) of node values in the simple path from a to b. Note: a and b, must be 0 indexed.</li>
|
||||
</ol>
|
||||
<p>Sample I/O at the bottom. </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000011">Todo:</a></b></dt><dd>Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: <a href="https://cses.fi/problemset/task/1138">https://cses.fi/problemset/task/1138</a> </dd></dl>
|
||||
<p>Sample I/O at the bottom. </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000010">Todo:</a></b></dt><dd>Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: <a href="https://cses.fi/problemset/task/1138">https://cses.fi/problemset/task/1138</a> </dd></dl>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
|
||||
@@ -0,0 +1,119 @@
|
||||
<!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.9.1"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: Member List</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++
|
||||
 <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.9.1 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
|
||||
/* @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&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&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d5/dab/structdata__structures_1_1list__array_1_1list.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="headertitle">
|
||||
<div class="title">data_structures::list_array::list Member List</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(const std::array< uint64_t, 50 > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>data</b> (defined in <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>)</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a>(const uint64_t &val)</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>isSorted</b> (defined in <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>)</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53">LinearSearch</a>(const std::array< uint64_t, 50 > &dataArr, const uint64_t &val) const</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">remove</a>(const uint64_t &val)</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>search</b>(const uint64_t &val) (defined in <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>)</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">show</a>()</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469">sort</a>()</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>top</b> (defined in <a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a>)</td><td class="entry"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td><td class="entry"></td></tr>
|
||||
</table></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -216,7 +216,7 @@ Static Private Member Functions</h2></td></tr>
|
||||
<div class="ttc" id="anamespacegraph_html"><div class="ttname"><a href="../../df/dce/namespacegraph.html">graph</a></div><div class="ttdoc">Graph Algorithms.</div></div>
|
||||
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
|
||||
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
|
||||
<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition:</b> list_array.cpp:9</div></div>
|
||||
<div class="ttc" id="astructlist_html"><div class="ttname"><a href="../../d8/d10/structlist.html">list</a></div><div class="ttdef"><b>Definition:</b> hash_search.cpp:29</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="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< unsigned int ></a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
|
||||
@@ -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_md55"></a>
|
||||
<h3><a class="anchor" id="autotoc_md56"></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>
|
||||
|
||||
@@ -140,7 +140,7 @@ Functions</h2></td></tr>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process">Gram Schmidt Orthogonalisation Process</a> </p>
|
||||
<p>Takes the input of Linearly Independent Vectors, returns vectors orthogonal to each other.</p>
|
||||
<h3><a class="anchor" id="autotoc_md63"></a>
|
||||
<h3><a class="anchor" id="autotoc_md64"></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>
|
||||
|
||||
@@ -127,6 +127,9 @@ constexpr float </td><td class="memItemRight" valign="bottom"><a class="el"
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/to_string.html">std::to_string</a></p>
|
||||
<p>Data-structure algorithms.</p>
|
||||
<p>Algorithms with data structures.</p>
|
||||
<p>for assert</p>
|
||||
<p>for io operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a></p>
|
||||
<p>Algorithms with data structures</p>
|
||||
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a> for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ofstream.html">std::ofstream</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a> for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></p>
|
||||
<p>Algorithms with data structures </p>
|
||||
</div></div><!-- contents -->
|
||||
|
||||
3
d5/d3c/namespacedata__structures.js
vendored
3
d5/d3c/namespacedata__structures.js
vendored
@@ -5,6 +5,9 @@ var namespacedata__structures =
|
||||
[ "list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", "d1/def/classdata__structures_1_1linked__list_1_1list" ],
|
||||
[ "isDigit", "da/dc3/linked__list_8cpp.html#ab1a372fe1e605bc0e0987dcdd7361180", null ]
|
||||
] ],
|
||||
[ "list_array", null, [
|
||||
[ "list", "d5/dab/structdata__structures_1_1list__array_1_1list.html", "d5/dab/structdata__structures_1_1list__array_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" ]
|
||||
] ],
|
||||
|
||||
@@ -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_md30"></a>
|
||||
<div class="textblock"><h1><a class="anchor" id="autotoc_md31"></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_md31"></a>
|
||||
<h1><a class="anchor" id="autotoc_md32"></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_md32"></a>
|
||||
<h1><a class="anchor" id="autotoc_md33"></a>
|
||||
Data Structures</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/data_structures/avltree.cpp">Avltree</a></li>
|
||||
@@ -152,7 +152,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_md33"></a>
|
||||
<h1><a class="anchor" id="autotoc_md34"></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>
|
||||
@@ -172,6 +172,7 @@ Dynamic Programming</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/longest_common_subsequence.cpp">Longest Common Subsequence</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/longest_increasing_subsequence.cpp">Longest Increasing Subsequence</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/longest_increasing_subsequence_(nlogn).cpp">Longest Increasing Subsequence (Nlogn)</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/longest_palindromic_subsequence.cpp">Longest Palindromic Subsequence</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/matrix_chain_multiplication.cpp">Matrix Chain Multiplication</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/palindrome_partitioning.cpp">Palindrome Partitioning</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/searching_of_element_in_dynamic_array.cpp">Searching Of Element In Dynamic Array</a></li>
|
||||
@@ -179,13 +180,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_md34"></a>
|
||||
<h1><a class="anchor" id="autotoc_md35"></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_md35"></a>
|
||||
<h1><a class="anchor" id="autotoc_md36"></a>
|
||||
Graph</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/bidirectional_dijkstra.cpp">Bidirectional Dijkstra</a></li>
|
||||
@@ -208,12 +209,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_md36"></a>
|
||||
<h1><a class="anchor" id="autotoc_md37"></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_md37"></a>
|
||||
<h1><a class="anchor" id="autotoc_md38"></a>
|
||||
Greedy Algorithms</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/greedy_algorithms/dijkstra.cpp">Dijkstra</a></li>
|
||||
@@ -223,7 +224,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_md38"></a>
|
||||
<h1><a class="anchor" id="autotoc_md39"></a>
|
||||
Hashing</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/hashing/chaining.cpp">Chaining</a></li>
|
||||
@@ -231,12 +232,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_md39"></a>
|
||||
<h1><a class="anchor" id="autotoc_md40"></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_md40"></a>
|
||||
<h1><a class="anchor" id="autotoc_md41"></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>
|
||||
@@ -246,7 +247,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_md41"></a>
|
||||
<h1><a class="anchor" id="autotoc_md42"></a>
|
||||
Math</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/armstrong_number.cpp">Armstrong Number</a></li>
|
||||
@@ -293,7 +294,7 @@ Math</h1>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/sum_of_digits.cpp">Sum Of Digits</a></li>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/math/vector_cross_product.cpp">Vector Cross Product</a></li>
|
||||
</ul>
|
||||
<h1><a class="anchor" id="autotoc_md42"></a>
|
||||
<h1><a class="anchor" id="autotoc_md43"></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>
|
||||
@@ -314,7 +315,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_md43"></a>
|
||||
<h1><a class="anchor" id="autotoc_md44"></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>
|
||||
@@ -327,7 +328,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_md44"></a>
|
||||
<h1><a class="anchor" id="autotoc_md45"></a>
|
||||
Others</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/others/buzz_number.cpp">Buzz Number</a></li>
|
||||
@@ -349,7 +350,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_md45"></a>
|
||||
<h1><a class="anchor" id="autotoc_md46"></a>
|
||||
Probability</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/probability/addition_rule.cpp">Addition Rule</a></li>
|
||||
@@ -357,7 +358,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_md46"></a>
|
||||
<h1><a class="anchor" id="autotoc_md47"></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>
|
||||
@@ -366,7 +367,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_md47"></a>
|
||||
<h1><a class="anchor" id="autotoc_md48"></a>
|
||||
Search</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/search/binary_search.cpp">Binary Search</a></li>
|
||||
@@ -382,7 +383,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_md48"></a>
|
||||
<h1><a class="anchor" id="autotoc_md49"></a>
|
||||
Sorting</h1>
|
||||
<ul>
|
||||
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/sorting/bead_sort.cpp">Bead Sort</a></li>
|
||||
@@ -420,7 +421,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_md49"></a>
|
||||
<h1><a class="anchor" id="autotoc_md50"></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>
|
||||
|
||||
505
d5/dab/structdata__structures_1_1list__array_1_1list.html
Normal file
505
d5/dab/structdata__structures_1_1list__array_1_1list.html
Normal file
@@ -0,0 +1,505 @@
|
||||
<!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.9.1"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: data_structures::list_array::list Struct 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++
|
||||
 <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.9.1 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
|
||||
/* @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&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&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d5/dab/structdata__structures_1_1list__array_1_1list.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> |
|
||||
<a href="#pub-attribs">Public Attributes</a> |
|
||||
<a href="../../d3/d1f/structdata__structures_1_1list__array_1_1list-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">data_structures::list_array::list Struct Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Structure of List with supporting methods.
|
||||
<a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#details">More...</a></p>
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for data_structures::list_array::list:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg" width="148" 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:a3b4abfffc730e07fcbd5844e09add8cd"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< uint64_t, 50 > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)</td></tr>
|
||||
<tr class="memdesc:a3b4abfffc730e07fcbd5844e09add8cd"><td class="mdescLeft"> </td><td class="mdescRight">Search an element in the list using binarySearch. <a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">More...</a><br /></td></tr>
|
||||
<tr class="separator:a3b4abfffc730e07fcbd5844e09add8cd"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac91272e6c970299e51cccd6cbdfe9e53"><td class="memItemLeft" align="right" valign="top">uint64_t </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53">LinearSearch</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< uint64_t, 50 > &dataArr, const uint64_t &val) const</td></tr>
|
||||
<tr class="memdesc:ac91272e6c970299e51cccd6cbdfe9e53"><td class="mdescLeft"> </td><td class="mdescRight">Search an element using linear search. <a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53">More...</a><br /></td></tr>
|
||||
<tr class="separator:ac91272e6c970299e51cccd6cbdfe9e53"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1acfd2bc4eb94a8a58dd4a828c93f4b6"><td class="memItemLeft" align="right" valign="top"><a id="a1acfd2bc4eb94a8a58dd4a828c93f4b6"></a>
|
||||
uint64_t </td><td class="memItemRight" valign="bottom"><b>search</b> (const uint64_t &val)</td></tr>
|
||||
<tr class="separator:a1acfd2bc4eb94a8a58dd4a828c93f4b6"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a39a712c8413b0d7861695ec019474469"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469">sort</a> ()</td></tr>
|
||||
<tr class="memdesc:a39a712c8413b0d7861695ec019474469"><td class="mdescLeft"> </td><td class="mdescRight">Sort the list. <a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469">More...</a><br /></td></tr>
|
||||
<tr class="separator:a39a712c8413b0d7861695ec019474469"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0f44d5e3a52d35f8ff23ace9569c6305"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a> (const uint64_t &val)</td></tr>
|
||||
<tr class="memdesc:a0f44d5e3a52d35f8ff23ace9569c6305"><td class="mdescLeft"> </td><td class="mdescRight">Insert the new element in the list. <a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">More...</a><br /></td></tr>
|
||||
<tr class="separator:a0f44d5e3a52d35f8ff23ace9569c6305"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a0499455a80156134cc79c98eabb376d9"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">remove</a> (const uint64_t &val)</td></tr>
|
||||
<tr class="memdesc:a0499455a80156134cc79c98eabb376d9"><td class="mdescLeft"> </td><td class="mdescRight">To remove the element from the list. <a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">More...</a><br /></td></tr>
|
||||
<tr class="separator:a0499455a80156134cc79c98eabb376d9"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae5c15d93819c4e437ebb7a1b41f2d594"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">show</a> ()</td></tr>
|
||||
<tr class="memdesc:ae5c15d93819c4e437ebb7a1b41f2d594"><td class="mdescLeft"> </td><td class="mdescRight">Utility function to print array. <a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae5c15d93819c4e437ebb7a1b41f2d594"><td class="memSeparator" colspan="2"> </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:abdadf56c21485e02ab885791af5971fa"><td class="memItemLeft" align="right" valign="top"><a id="abdadf56c21485e02ab885791af5971fa"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< uint64_t, 50 > </td><td class="memItemRight" valign="bottom"><b>data</b> {}</td></tr>
|
||||
<tr class="separator:abdadf56c21485e02ab885791af5971fa"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ad07cb3cd5fc761a0bf24b4fdfc9ba202"><td class="memItemLeft" align="right" valign="top"><a id="ad07cb3cd5fc761a0bf24b4fdfc9ba202"></a>
|
||||
uint64_t </td><td class="memItemRight" valign="bottom"><b>top</b> = 0</td></tr>
|
||||
<tr class="separator:ad07cb3cd5fc761a0bf24b4fdfc9ba202"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1bebd34bbfb462670f5671584c8a5cd8"><td class="memItemLeft" align="right" valign="top"><a id="a1bebd34bbfb462670f5671584c8a5cd8"></a>
|
||||
bool </td><td class="memItemRight" valign="bottom"><b>isSorted</b> = false</td></tr>
|
||||
<tr class="separator:a1bebd34bbfb462670f5671584c8a5cd8"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Structure of List with supporting methods. </p>
|
||||
</div><h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="a3b4abfffc730e07fcbd5844e09add8cd"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a3b4abfffc730e07fcbd5844e09add8cd">◆ </a></span>BinarySearch()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">uint64_t data_structures::list_array::list::BinarySearch </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< uint64_t, 50 > & </td>
|
||||
<td class="paramname"><em>dataArr</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const uint64_t & </td>
|
||||
<td class="paramname"><em>first</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const uint64_t & </td>
|
||||
<td class="paramname"><em>last</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const uint64_t & </td>
|
||||
<td class="paramname"><em>val</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Search an element in the list using binarySearch. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">dataArr</td><td>list </td></tr>
|
||||
<tr><td class="paramname">first</td><td>pointer to the first element in the remaining list </td></tr>
|
||||
<tr><td class="paramname">last</td><td>pointer to the last element in the remaining list </td></tr>
|
||||
<tr><td class="paramname">val</td><td>element that will be searched </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index of element in the list if present else -1 </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  {</div>
|
||||
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// If both pointer cross each other means no element present in the list which is equal to the val</span></div>
|
||||
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">if</span> (last < first) {</div>
|
||||
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  }</div>
|
||||
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  uint64_t mid = (first + last) / 2;</div>
|
||||
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// check whether current mid pointer value is equal to element or not</span></div>
|
||||
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordflow">if</span> (dataArr[mid] == val)</div>
|
||||
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">return</span> mid;</div>
|
||||
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// if current mid value is greater than element we have to search in first half</span></div>
|
||||
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val < dataArr[mid])</div>
|
||||
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">return</span> (<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(dataArr, first, mid - 1, val));</div>
|
||||
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// if current mid value is greater than element we have to search in second half</span></div>
|
||||
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val > dataArr[mid])</div>
|
||||
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> (<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">BinarySearch</a>(dataArr, mid + 1, last, val));</div>
|
||||
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  </div>
|
||||
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> << __func__ << <span class="stringliteral">":"</span> << __LINE__ << <span class="stringliteral">": Undefined condition\n"</span>;</div>
|
||||
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a></div></div>
|
||||
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a3b4abfffc730e07fcbd5844e09add8cd"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array< uint64_t, 50 > &dataArr, const uint64_t &first, const uint64_t &last, const uint64_t &val)</div><div class="ttdoc">Search an element in the list using binarySearch.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:44</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a0f44d5e3a52d35f8ff23ace9569c6305"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a0f44d5e3a52d35f8ff23ace9569c6305">◆ </a></span>insert()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void data_structures::list_array::list::insert </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const uint64_t & </td>
|
||||
<td class="paramname"><em>val</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Insert the new element in the list. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">val</td><td>element that will be inserted </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  {</div>
|
||||
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="comment">// overflow check</span></div>
|
||||
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span> (top == 49) {</div>
|
||||
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\nOverflow"</span>;</div>
|
||||
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</div>
|
||||
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// if list is not sorted, insert at the last</span></div>
|
||||
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// otherwise place it to correct position</span></div>
|
||||
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">if</span> (!isSorted) {</div>
|
||||
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  data[top] = val;</div>
|
||||
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  top++;</div>
|
||||
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  uint64_t pos = 0; <span class="comment">// Initialize the index variable</span></div>
|
||||
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// Going through each element and find correct position for element</span></div>
|
||||
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">for</span> (uint64_t i = 0; i < top - 1; i++) {</div>
|
||||
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// check for the correct position</span></div>
|
||||
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">if</span> (data[i] <= val && val <= data[i + 1]) {</div>
|
||||
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  pos = i + 1; <span class="comment">// assign correct pos to the index var</span></div>
|
||||
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">break</span>; <span class="comment">// to get out from the loop</span></div>
|
||||
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div>
|
||||
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  }</div>
|
||||
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// if all elements are smaller than the element</span></div>
|
||||
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">if</span> (pos == 0) {</div>
|
||||
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  pos = top - 1;</div>
|
||||
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div>
|
||||
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// shift all element to make a room for new element</span></div>
|
||||
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">for</span> (uint64_t i = top; i > pos; i--) {</div>
|
||||
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  data[i] = data[i - 1];</div>
|
||||
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div>
|
||||
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  top++; <span class="comment">// Increment the value of top.</span></div>
|
||||
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  data[pos] = val; <span class="comment">// Assign the value to the correct index in the array</span></div>
|
||||
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div>
|
||||
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="ac91272e6c970299e51cccd6cbdfe9e53"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ac91272e6c970299e51cccd6cbdfe9e53">◆ </a></span>LinearSearch()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">uint64_t data_structures::list_array::list::LinearSearch </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< uint64_t, 50 > & </td>
|
||||
<td class="paramname"><em>dataArr</em>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype">const uint64_t & </td>
|
||||
<td class="paramname"><em>val</em> </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td></td>
|
||||
<td>)</td>
|
||||
<td></td><td> const</td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Search an element using linear search. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">dataArr</td><td>list </td></tr>
|
||||
<tr><td class="paramname">val</td><td>element that will be searched </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>index of element in the list if present else -1 </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  {</div>
|
||||
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// Going through each element in the list</span></div>
|
||||
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (dataArr[i] == val) {</div>
|
||||
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> i; <span class="comment">// element found at ith index</span></div>
|
||||
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div>
|
||||
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div>
|
||||
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// element is not present in the list</span></div>
|
||||
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">return</span> -1;</div>
|
||||
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a0499455a80156134cc79c98eabb376d9"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a0499455a80156134cc79c98eabb376d9">◆ </a></span>remove()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void data_structures::list_array::list::remove </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const uint64_t & </td>
|
||||
<td class="paramname"><em>val</em></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>To remove the element from the list. </p>
|
||||
<dl class="params"><dt>Parameters</dt><dd>
|
||||
<table class="params">
|
||||
<tr><td class="paramname">val</td><td>element that will be removed </td></tr>
|
||||
</table>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  {</div>
|
||||
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  uint64_t pos = <a class="code" href="../../d9/dca/namespacesearch.html">search</a>(val); <span class="comment">// search the index of the value</span></div>
|
||||
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// if search returns -1, element does not present in the list</span></div>
|
||||
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">if</span> (pos == -1) {</div>
|
||||
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n Element does not present in the list "</span>;</div>
|
||||
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  }</div>
|
||||
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span> << data[pos] << <span class="stringliteral">" deleted"</span>; <span class="comment">// print the appropriate message</span></div>
|
||||
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// shift all the element 1 left to fill vacant space</span></div>
|
||||
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">for</span> (uint64_t i = pos; i < top; i++) {</div>
|
||||
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i] = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>[i + 1];</div>
|
||||
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div>
|
||||
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  top--; <span class="comment">// decrement the top variable to maintain last index</span></div>
|
||||
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</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="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">Search algorithms.</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="ae5c15d93819c4e437ebb7a1b41f2d594"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae5c15d93819c4e437ebb7a1b41f2d594">◆ </a></span>show()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void data_structures::list_array::list::show </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Utility function to print array. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  {</div>
|
||||
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// Going through each element in the list</span></div>
|
||||
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="charliteral">'\n'</span>;</div>
|
||||
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << data[i] << <span class="stringliteral">" "</span>; <span class="comment">// print the element</span></div>
|
||||
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div>
|
||||
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  }</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a39a712c8413b0d7861695ec019474469"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a39a712c8413b0d7861695ec019474469">◆ </a></span>sort()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">void data_structures::list_array::list::sort </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Sort the list. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  {</div>
|
||||
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">//Going through each element in the list</span></div>
|
||||
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">for</span> (uint64_t i = 0; i < top; i++) {</div>
|
||||
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  uint64_t min_idx = i; <span class="comment">// Initialize the min variable</span></div>
|
||||
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">for</span> (uint64_t j = i + 1; j < top; j++) {</div>
|
||||
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// check whether any element less than current min value</span></div>
|
||||
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">if</span> (data[j] < data[min_idx]) {</div>
|
||||
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  min_idx = j; <span class="comment">// update index accordingly</span></div>
|
||||
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div>
|
||||
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div>
|
||||
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="comment">// swap min value and element at the ith index</span></div>
|
||||
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a>(data[min_idx], data[i]);</div>
|
||||
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div>
|
||||
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">// mark isSorted variable as true</span></div>
|
||||
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  isSorted = <span class="keyword">true</span>;</div>
|
||||
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div>
|
||||
<div class="ttc" id="aswap_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/swap.html">std::swap</a></div><div class="ttdeci">T swap(T... args)</div></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="../../d5/dab/structdata__structures_1_1list__array_1_1list_a39a712c8413b0d7861695ec019474469_cgraph.svg" width="275" height="52"><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 struct was generated from the following file:<ul>
|
||||
<li>data_structures/<a class="el" href="../../d7/d00/list__array_8cpp.html">list_array.cpp</a></li>
|
||||
</ul>
|
||||
</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="../../d5/d3c/namespacedata__structures.html">data_structures</a></li><li class="navelem"><b>list_array</b></li><li class="navelem"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">list</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
13
d5/dab/structdata__structures_1_1list__array_1_1list.js
Normal file
13
d5/dab/structdata__structures_1_1list__array_1_1list.js
Normal file
@@ -0,0 +1,13 @@
|
||||
var structdata__structures_1_1list__array_1_1list =
|
||||
[
|
||||
[ "BinarySearch", "d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd", null ],
|
||||
[ "insert", "d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305", null ],
|
||||
[ "LinearSearch", "d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53", null ],
|
||||
[ "remove", "d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9", null ],
|
||||
[ "search", "d5/dab/structdata__structures_1_1list__array_1_1list.html#a1acfd2bc4eb94a8a58dd4a828c93f4b6", null ],
|
||||
[ "show", "d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594", null ],
|
||||
[ "sort", "d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469", null ],
|
||||
[ "data", "d5/dab/structdata__structures_1_1list__array_1_1list.html#abdadf56c21485e02ab885791af5971fa", null ],
|
||||
[ "isSorted", "d5/dab/structdata__structures_1_1list__array_1_1list.html#a1bebd34bbfb462670f5671584c8a5cd8", null ],
|
||||
[ "top", "d5/dab/structdata__structures_1_1list__array_1_1list.html#ad07cb3cd5fc761a0bf24b4fdfc9ba202", null ]
|
||||
];
|
||||
@@ -0,0 +1,4 @@
|
||||
<map id="data_structures::list_array::list::sort" name="data_structures::list_array::list::sort">
|
||||
<area shape="rect" id="node1" title="Sort the list." alt="" coords="5,5,143,47"/>
|
||||
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="191,13,269,39"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
a3f1110c29d798a840fa417d020e6e6a
|
||||
@@ -0,0 +1,38 @@
|
||||
<?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.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- Title: data_structures::list_array::list::sort Pages: 1 -->
|
||||
<svg width="206pt" height="39pt"
|
||||
viewBox="0.00 0.00 206.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>data_structures::list_array::list::sort</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 202,-35 202,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Sort the list.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 103,-30.5 103,-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::list</text>
|
||||
<text text-anchor="middle" x="51.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</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/algorithm/swap.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="139,-6 139,-25 198,-25 198,-6 139,-6"/>
|
||||
<text text-anchor="middle" x="168.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M103.28,-15.5C111.73,-15.5 120.37,-15.5 128.47,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="128.74,-19 138.74,-15.5 128.74,-12 128.74,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 1.8 KiB |
@@ -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_md70"></a>
|
||||
<h3><a class="anchor" id="autotoc_md71"></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>
|
||||
|
||||
@@ -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<=n. Determine the maximum profit obtainable by cutting up the rod and selling the pieces.</p>
|
||||
<h3><a class="anchor" id="autotoc_md53"></a>
|
||||
<h3><a class="anchor" id="autotoc_md54"></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>
|
||||
|
||||
@@ -92,35 +92,165 @@ $(document).ready(function(){initNavTree('d7/d00/list__array_8cpp.html','../../'
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#nested-classes">Classes</a> |
|
||||
<a href="#namespaces">Namespaces</a> |
|
||||
<a href="#func-members">Functions</a> </div>
|
||||
<div class="headertitle">
|
||||
<div class="title">list_array.cpp File Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<div class="textblock"><code>#include <array></code><br />
|
||||
<code>#include <iostream></code><br />
|
||||
|
||||
<p><a href="https://en.wikipedia.org/wiki/Dynamic_array">Dynamic Array</a>
|
||||
<a href="#details">More...</a></p>
|
||||
<div class="textblock"><code>#include <iostream></code><br />
|
||||
<code>#include <array></code><br />
|
||||
<code>#include <cassert></code><br />
|
||||
</div><div class="textblock"><div class="dynheader">
|
||||
Include dependency graph for list_array.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d4d/list__array_8cpp__incl.svg" width="158" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d4d/list__array_8cpp__incl.svg" width="248" 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">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d10/structlist.html">list</a></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></td></tr>
|
||||
<tr class="memdesc:"><td class="mdescLeft"> </td><td class="mdescRight">Structure of List with supporting methods. <a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#details">More...</a><br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </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">  </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"> </td><td class="mdescRight">Data Structures algorithms. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d9/d27/namespacelist__array"><td class="memItemLeft" align="right" valign="top">  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/d27/namespacelist__array.html">list_array</a></td></tr>
|
||||
<tr class="memdesc:d9/d27/namespacelist__array"><td class="mdescLeft"> </td><td class="mdescRight">Functions for <a href="https://en.wikipedia.org/wiki/Dynamic_array">Dynamic Array</a> algorithm. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </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"><a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>main</b> ()</td></tr>
|
||||
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
||||
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Test implementations. <a href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
|
||||
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
|
||||
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft"> </td><td class="mdescRight">Main function. <a href="../../d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">More...</a><br /></td></tr>
|
||||
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000004">Todo:</a></b></dt><dd>Add documentation </dd></dl>
|
||||
<dl class="section warning"><dt>Warning</dt><dd>The sorting algorithm is erroneous </dd></dl>
|
||||
</div></div><!-- contents -->
|
||||
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Dynamic_array">Dynamic Array</a> </p>
|
||||
<p>The <a class="el" href="../../d9/d27/namespacelist__array.html" title="Functions for Dynamic Array algorithm.">list_array</a> is the implementation of list represented using array. We can perform basic CRUD operations as well as other operations like sorting etc.</p>
|
||||
<h3><a class="anchor" id="autotoc_md28"></a>
|
||||
Algorithm</h3>
|
||||
<p>It implements various method like insert, sort, search etc. efficiently. You can select the operation and methods will do the rest work for you. You can insert element, sort them in order, search efficiently, delete values and print the list. </p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </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 </td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  {</div>
|
||||
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// Execute the tests</span></div>
|
||||
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span> }</div>
|
||||
<div class="ttc" id="alist__array_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:205</div></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="../../d7/d00/list__array_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="466" height="248"><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="aa8dca7b867074164d5f45b0f3851269d"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">◆ </a></span>test()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">static void test </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">static</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Test implementations. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  {</div>
|
||||
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a> L;</div>
|
||||
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  </div>
|
||||
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="comment">// Insert testing</span></div>
|
||||
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a>(11);</div>
|
||||
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a>(12);</div>
|
||||
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  assert(L.top == 2);</div>
|
||||
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a>(15);</div>
|
||||
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a>(10);</div>
|
||||
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a>(12);</div>
|
||||
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a>(20);</div>
|
||||
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">insert</a>(18);</div>
|
||||
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  assert(L.top == 7);</div>
|
||||
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">show</a>(); <span class="comment">// To print the array</span></div>
|
||||
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  </div>
|
||||
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// Remove testing</span></div>
|
||||
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">remove</a>(12); <span class="comment">// Remove Duplicate value in the list</span></div>
|
||||
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">remove</a>(15); <span class="comment">// Remove the existing value in the list</span></div>
|
||||
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  assert(L.top == 5);</div>
|
||||
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">remove</a>(50); <span class="comment">// Try to remove the non-existing value in the list</span></div>
|
||||
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  assert(L.top == 5);</div>
|
||||
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  </div>
|
||||
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// LinearSearch testing</span></div>
|
||||
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  assert(L.search(11) == 0); <span class="comment">// search for the existing element</span></div>
|
||||
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  assert(L.search(12) == 2);</div>
|
||||
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  assert(L.search(50) == -1); <span class="comment">// search for the non-existing element</span></div>
|
||||
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  </div>
|
||||
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// Sort testing</span></div>
|
||||
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469">sort</a>();</div>
|
||||
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  assert(L.isSorted == <span class="keyword">true</span>);</div>
|
||||
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  L.<a class="code" href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">show</a>();</div>
|
||||
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  </div>
|
||||
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">// BinarySearch testing</span></div>
|
||||
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  assert(L.search(11) == 1); <span class="comment">// search for the existing element</span></div>
|
||||
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  assert(L.search(12) == 2);</div>
|
||||
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  assert(L.search(50) == -1); <span class="comment">// search for the non-existing element</span></div>
|
||||
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span> }</div>
|
||||
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html">data_structures::list_array::list</a></div><div class="ttdoc">Structure of List with supporting methods.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:32</div></div>
|
||||
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a0499455a80156134cc79c98eabb376d9"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">data_structures::list_array::list::remove</a></div><div class="ttdeci">void remove(const uint64_t &val)</div><div class="ttdoc">To remove the element from the list.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:171</div></div>
|
||||
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a0f44d5e3a52d35f8ff23ace9569c6305"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">data_structures::list_array::list::insert</a></div><div class="ttdeci">void insert(const uint64_t &val)</div><div class="ttdoc">Insert the new element in the list.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:132</div></div>
|
||||
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a39a712c8413b0d7861695ec019474469"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469">data_structures::list_array::list::sort</a></div><div class="ttdeci">void sort()</div><div class="ttdoc">Sort the list.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:110</div></div>
|
||||
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ae5c15d93819c4e437ebb7a1b41f2d594"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">data_structures::list_array::list::show</a></div><div class="ttdeci">void show()</div><div class="ttdoc">Utility function to print array.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:190</div></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="../../d7/d00/list__array_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="367" height="248"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
|
||||
@@ -1,5 +1,6 @@
|
||||
var list__array_8cpp =
|
||||
[
|
||||
[ "list", "d8/d10/structlist.html", "d8/d10/structlist" ],
|
||||
[ "main", "d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ]
|
||||
[ "list", "d5/dab/structdata__structures_1_1list__array_1_1list.html", "d5/dab/structdata__structures_1_1list__array_1_1list" ],
|
||||
[ "main", "d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4", null ],
|
||||
[ "test", "d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
|
||||
];
|
||||
@@ -0,0 +1,8 @@
|
||||
<map id="test" name="test">
|
||||
<area shape="rect" id="node1" title="Test implementations." alt="" coords="5,111,49,138"/>
|
||||
<area shape="rect" id="node2" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305" title="Insert the new element in the list." alt="" coords="97,5,235,47"/>
|
||||
<area shape="rect" id="node3" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9" title="To remove the element from the list." alt="" coords="97,71,235,112"/>
|
||||
<area shape="rect" id="node4" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594" title="Utility function to print array." alt="" coords="97,136,235,177"/>
|
||||
<area shape="rect" id="node5" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469" title="Sort the list." alt="" coords="97,201,235,243"/>
|
||||
<area shape="rect" id="node6" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="283,209,361,235"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
790e4f068a1e7504287a1f4131eff72a
|
||||
@@ -0,0 +1,101 @@
|
||||
<?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.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- Title: test Pages: 1 -->
|
||||
<svg width="275pt" height="186pt"
|
||||
viewBox="0.00 0.00 275.00 186.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 182)">
|
||||
<title>test</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-182 271,-182 271,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Test implementations.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-79 0,-98 33,-98 33,-79 0,-79"/>
|
||||
<text text-anchor="middle" x="16.5" y="-86" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="node2" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_node2"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305" target="_top" xlink:title="Insert the new element in the list.">
|
||||
<polygon fill="white" stroke="black" points="69,-147.5 69,-177.5 172,-177.5 172,-147.5 69,-147.5"/>
|
||||
<text text-anchor="start" x="77" y="-165.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
|
||||
<text text-anchor="middle" x="120.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::insert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M25.82,-98.32C35.4,-109.18 52.01,-126.7 69,-138.5 70.88,-139.8 72.84,-141.07 74.85,-142.3"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="73.47,-145.54 83.9,-147.4 76.91,-139.44 73.47,-145.54"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9" target="_top" xlink:title="To remove the element from the list.">
|
||||
<polygon fill="white" stroke="black" points="69,-98.5 69,-128.5 172,-128.5 172,-98.5 69,-98.5"/>
|
||||
<text text-anchor="start" x="77" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
|
||||
<text text-anchor="middle" x="120.5" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::remove</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M33.44,-92.41C40.59,-94.16 49.53,-96.35 58.91,-98.65"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="58.25,-102.09 68.8,-101.07 59.92,-95.29 58.25,-102.09"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594" target="_top" xlink:title="Utility function to print array.">
|
||||
<polygon fill="white" stroke="black" points="69,-49.5 69,-79.5 172,-79.5 172,-49.5 69,-49.5"/>
|
||||
<text text-anchor="start" x="77" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
|
||||
<text text-anchor="middle" x="120.5" y="-56.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::show</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M33.44,-84.75C40.59,-83.07 49.53,-80.96 58.91,-78.76"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="59.87,-82.13 68.8,-76.43 58.26,-75.31 59.87,-82.13"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469" target="_top" xlink:title="Sort the list.">
|
||||
<polygon fill="white" stroke="black" points="69,-0.5 69,-30.5 172,-30.5 172,-0.5 69,-0.5"/>
|
||||
<text text-anchor="start" x="77" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
|
||||
<text text-anchor="middle" x="120.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M26.29,-78.77C36.01,-68.39 52.51,-51.9 69,-40.5 71.49,-38.78 74.13,-37.1 76.82,-35.49"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="78.57,-38.53 85.58,-30.58 75.15,-32.42 78.57,-38.53"/>
|
||||
</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/algorithm/swap.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="208,-6 208,-25 267,-25 267,-6 208,-6"/>
|
||||
<text text-anchor="middle" x="237.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node5->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M172.28,-15.5C180.73,-15.5 189.37,-15.5 197.47,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="197.74,-19 207.74,-15.5 197.74,-12 197.74,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 5.3 KiB |
@@ -0,0 +1,9 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="node1" title="Main function." alt="" coords="5,111,56,138"/>
|
||||
<area shape="rect" id="node2" href="$d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Test implementations." alt="" coords="104,111,148,138"/>
|
||||
<area shape="rect" id="node3" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305" title="Insert the new element in the list." alt="" coords="196,5,333,47"/>
|
||||
<area shape="rect" id="node4" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9" title="To remove the element from the list." alt="" coords="196,71,333,112"/>
|
||||
<area shape="rect" id="node5" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594" title="Utility function to print array." alt="" coords="196,136,333,177"/>
|
||||
<area shape="rect" id="node6" href="$d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469" title="Sort the list." alt="" coords="196,201,333,243"/>
|
||||
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="381,209,460,235"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
e8e9d559f4ebf420605aa36e7f223b77
|
||||
@@ -0,0 +1,116 @@
|
||||
<?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.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="349pt" height="186pt"
|
||||
viewBox="0.00 0.00 349.00 186.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 182)">
|
||||
<title>main</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-182 345,-182 345,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,-79 0,-98 38,-98 38,-79 0,-79"/>
|
||||
<text text-anchor="middle" x="19" y="-86" 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="../../d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Test implementations.">
|
||||
<polygon fill="white" stroke="black" points="74,-79 74,-98 107,-98 107,-79 74,-79"/>
|
||||
<text text-anchor="middle" x="90.5" y="-86" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M38.26,-88.5C46.07,-88.5 55.31,-88.5 63.79,-88.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-92 73.95,-88.5 63.95,-85 63.95,-92"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305" target="_top" xlink:title="Insert the new element in the list.">
|
||||
<polygon fill="white" stroke="black" points="143,-147.5 143,-177.5 246,-177.5 246,-147.5 143,-147.5"/>
|
||||
<text text-anchor="start" x="151" y="-165.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
|
||||
<text text-anchor="middle" x="194.5" y="-154.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::insert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M99.82,-98.32C109.4,-109.18 126.01,-126.7 143,-138.5 144.88,-139.8 146.84,-141.07 148.85,-142.3"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="147.47,-145.54 157.9,-147.4 150.91,-139.44 147.47,-145.54"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9" target="_top" xlink:title="To remove the element from the list.">
|
||||
<polygon fill="white" stroke="black" points="143,-98.5 143,-128.5 246,-128.5 246,-98.5 143,-98.5"/>
|
||||
<text text-anchor="start" x="151" y="-116.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
|
||||
<text text-anchor="middle" x="194.5" y="-105.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::remove</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.44,-92.41C114.59,-94.16 123.53,-96.35 132.91,-98.65"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="132.25,-102.09 142.8,-101.07 133.92,-95.29 132.25,-102.09"/>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="node5" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_node5"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594" target="_top" xlink:title="Utility function to print array.">
|
||||
<polygon fill="white" stroke="black" points="143,-49.5 143,-79.5 246,-79.5 246,-49.5 143,-49.5"/>
|
||||
<text text-anchor="start" x="151" y="-67.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
|
||||
<text text-anchor="middle" x="194.5" y="-56.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::show</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<path fill="none" stroke="midnightblue" d="M107.44,-84.75C114.59,-83.07 123.53,-80.96 132.91,-78.76"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="133.87,-82.13 142.8,-76.43 132.26,-75.31 133.87,-82.13"/>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="node6" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_node6"><a xlink:href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469" target="_top" xlink:title="Sort the list.">
|
||||
<polygon fill="white" stroke="black" points="143,-0.5 143,-30.5 246,-30.5 246,-0.5 143,-0.5"/>
|
||||
<text text-anchor="start" x="151" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
|
||||
<text text-anchor="middle" x="194.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge5" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<path fill="none" stroke="midnightblue" d="M100.29,-78.77C110.01,-68.39 126.51,-51.9 143,-40.5 145.49,-38.78 148.13,-37.1 150.82,-35.49"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="152.57,-38.53 159.58,-30.58 149.15,-32.42 152.57,-38.53"/>
|
||||
</g>
|
||||
<!-- Node7 -->
|
||||
<g id="node7" class="node">
|
||||
<title>Node7</title>
|
||||
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="282,-6 282,-25 341,-25 341,-6 282,-6"/>
|
||||
<text text-anchor="middle" x="311.5" y="-13" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6->Node7 -->
|
||||
<g id="edge6" class="edge">
|
||||
<title>Node6->Node7</title>
|
||||
<path fill="none" stroke="midnightblue" d="M246.28,-15.5C254.73,-15.5 263.37,-15.5 271.47,-15.5"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="271.74,-19 281.74,-15.5 271.74,-12 271.74,-19"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 6.0 KiB |
@@ -430,7 +430,7 @@ Here is the call graph for this function:</div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>global vector variables used in the <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a> function. </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000008">Todo:</a></b></dt><dd>@stepfencurryxiao add documetnation </dd></dl>
|
||||
<p>global vector variables used in the <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html#ad8389ed58fd0ec66df248014775ad1fa">ans</a> function. </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000007">Todo:</a></b></dt><dd>@stepfencurryxiao add documetnation </dd></dl>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
@@ -445,7 +445,7 @@ Here is the call graph for this function:</div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>global variable mat_size </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000007">Todo:</a></b></dt><dd>@stepfencurryxiao add documetnation </dd></dl>
|
||||
<p>global variable mat_size </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000006">Todo:</a></b></dt><dd>@stepfencurryxiao add documetnation </dd></dl>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
|
||||
@@ -91,7 +91,6 @@ $(document).ready(function(){initNavTree('d8/d10/structlist.html','../../'); ini
|
||||
|
||||
<div class="header">
|
||||
<div class="summary">
|
||||
<a href="#pub-methods">Public Member Functions</a> |
|
||||
<a href="#pub-attribs">Public Attributes</a> |
|
||||
<a href="../../de/d91/structlist-members.html">List of all members</a> </div>
|
||||
<div class="headertitle">
|
||||
@@ -101,45 +100,12 @@ $(document).ready(function(){initNavTree('d8/d10/structlist.html','../../'); ini
|
||||
<div class="dynheader">
|
||||
Collaboration diagram for list:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dd4/structlist__coll__graph.svg" width="152" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/dd4/structlist__coll__graph.svg" width="103" height="38"><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:a6fdd041bec576751d0c7f8fbc7c5d495"><td class="memItemLeft" align="right" valign="top"><a id="a6fdd041bec576751d0c7f8fbc7c5d495"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>BinarySearch</b> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, 50 > &dataArr, int first, int last, int x)</td></tr>
|
||||
<tr class="separator:a6fdd041bec576751d0c7f8fbc7c5d495"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:afd6ce3d4055023917766e30a17dfd316"><td class="memItemLeft" align="right" valign="top"><a id="afd6ce3d4055023917766e30a17dfd316"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>LinearSearch</b> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, 50 > &dataArr, int x) const</td></tr>
|
||||
<tr class="separator:afd6ce3d4055023917766e30a17dfd316"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac75c5419552b0a4d506c3fdbcdb89311"><td class="memItemLeft" align="right" valign="top"><a id="ac75c5419552b0a4d506c3fdbcdb89311"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>Search</b> (int x)</td></tr>
|
||||
<tr class="separator:ac75c5419552b0a4d506c3fdbcdb89311"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a959d0064283c4c04a9504161fed936da"><td class="memItemLeft" align="right" valign="top"><a id="a959d0064283c4c04a9504161fed936da"></a>
|
||||
void </td><td class="memItemRight" valign="bottom"><b>Sort</b> ()</td></tr>
|
||||
<tr class="separator:a959d0064283c4c04a9504161fed936da"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ad21e95792529f165f01361f9f42505b3"><td class="memItemLeft" align="right" valign="top"><a id="ad21e95792529f165f01361f9f42505b3"></a>
|
||||
void </td><td class="memItemRight" valign="bottom"><b>insert</b> (int x)</td></tr>
|
||||
<tr class="separator:ad21e95792529f165f01361f9f42505b3"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a8c0c536c5db7dd69ff470c4b0445ca09"><td class="memItemLeft" align="right" valign="top"><a id="a8c0c536c5db7dd69ff470c4b0445ca09"></a>
|
||||
void </td><td class="memItemRight" valign="bottom"><b>Remove</b> (int x)</td></tr>
|
||||
<tr class="separator:a8c0c536c5db7dd69ff470c4b0445ca09"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1dfa9c59c5038a9e1bea0bb7f4c35178"><td class="memItemLeft" align="right" valign="top"><a id="a1dfa9c59c5038a9e1bea0bb7f4c35178"></a>
|
||||
void </td><td class="memItemRight" valign="bottom"><b>Show</b> ()</td></tr>
|
||||
<tr class="separator:a1dfa9c59c5038a9e1bea0bb7f4c35178"><td class="memSeparator" colspan="2"> </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:a8e4bfbad14cdf4a8093767e9e4774e76"><td class="memItemLeft" align="right" valign="top"><a id="a8e4bfbad14cdf4a8093767e9e4774e76"></a>
|
||||
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/array.html">std::array</a>< int, 50 > </td><td class="memItemRight" valign="bottom"><b>data</b> {}</td></tr>
|
||||
<tr class="separator:a8e4bfbad14cdf4a8093767e9e4774e76"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a3c852e1981fe1d68e02deecb0b72e3a4"><td class="memItemLeft" align="right" valign="top"><a id="a3c852e1981fe1d68e02deecb0b72e3a4"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><b>top</b> = 0</td></tr>
|
||||
<tr class="separator:a3c852e1981fe1d68e02deecb0b72e3a4"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a02290e44ad1bce31911fd995c65613ec"><td class="memItemLeft" align="right" valign="top"><a id="a02290e44ad1bce31911fd995c65613ec"></a>
|
||||
bool </td><td class="memItemRight" valign="bottom"><b>isSorted</b> = false</td></tr>
|
||||
<tr class="separator:a02290e44ad1bce31911fd995c65613ec"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aaab2e33bc1ca6f44e72239bfb58f100c"><td class="memItemLeft" align="right" valign="top"><a id="aaab2e33bc1ca6f44e72239bfb58f100c"></a>
|
||||
int </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a></td></tr>
|
||||
<tr class="memdesc:aaab2e33bc1ca6f44e72239bfb58f100c"><td class="mdescLeft"> </td><td class="mdescRight">key value for node <br /></td></tr>
|
||||
@@ -151,8 +117,7 @@ struct <a class="el" href="../../d8/d10/structlist.html">list</a> * </td><t
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>a one-way linked list </p>
|
||||
</div><hr/>The documentation for this struct was generated from the following files:<ul>
|
||||
<li>data_structures/<a class="el" href="../../d7/d00/list__array_8cpp.html">list_array.cpp</a></li>
|
||||
</div><hr/>The documentation for this struct was generated from the following file:<ul>
|
||||
<li>search/<a class="el" href="../../d1/df3/hash__search_8cpp.html">hash_search.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -1,15 +1,5 @@
|
||||
var structlist =
|
||||
[
|
||||
[ "BinarySearch", "d8/d10/structlist.html#a6fdd041bec576751d0c7f8fbc7c5d495", null ],
|
||||
[ "insert", "d8/d10/structlist.html#ad21e95792529f165f01361f9f42505b3", null ],
|
||||
[ "LinearSearch", "d8/d10/structlist.html#afd6ce3d4055023917766e30a17dfd316", null ],
|
||||
[ "Remove", "d8/d10/structlist.html#a8c0c536c5db7dd69ff470c4b0445ca09", null ],
|
||||
[ "Search", "d8/d10/structlist.html#ac75c5419552b0a4d506c3fdbcdb89311", null ],
|
||||
[ "Show", "d8/d10/structlist.html#a1dfa9c59c5038a9e1bea0bb7f4c35178", null ],
|
||||
[ "Sort", "d8/d10/structlist.html#a959d0064283c4c04a9504161fed936da", null ],
|
||||
[ "data", "d8/d10/structlist.html#a8e4bfbad14cdf4a8093767e9e4774e76", null ],
|
||||
[ "isSorted", "d8/d10/structlist.html#a02290e44ad1bce31911fd995c65613ec", null ],
|
||||
[ "key", "d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c", null ],
|
||||
[ "next", "d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f", null ],
|
||||
[ "top", "d8/d10/structlist.html#a3c852e1981fe1d68e02deecb0b72e3a4", null ]
|
||||
[ "next", "d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f", null ]
|
||||
];
|
||||
@@ -156,7 +156,7 @@ uint32_t </td><td class="memItemRight" valign="bottom"><b>graph::disjoint_u
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p><a href="https://en.wikipedia.org/wiki/Disjoint_union">Disjoint union</a> </p>
|
||||
<p>The Disjoint union is the technique to find connected component in graph efficiently.</p>
|
||||
<h3><a class="anchor" id="autotoc_md56"></a>
|
||||
<h3><a class="anchor" id="autotoc_md57"></a>
|
||||
Algorithm</h3>
|
||||
<p>In <a class="el" href="../../da/d9a/class_graph.html">Graph</a>, if you have to find out the number of connected components, there are 2 options</p><ol type="1">
|
||||
<li>Depth first search</li>
|
||||
|
||||
@@ -141,7 +141,7 @@ Variables</h2></td></tr>
|
||||
<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>
|
||||
<h3><a class="anchor" id="autotoc_md29"></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>
|
||||
|
||||
112
d9/d27/namespacelist__array.html
Normal file
112
d9/d27/namespacelist__array.html
Normal file
@@ -0,0 +1,112 @@
|
||||
<!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.9.1"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: list_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>
|
||||
<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++
|
||||
 <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.9.1 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
||||
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
|
||||
/* @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&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&dn=gpl-2.0.txt GPL-v2 */
|
||||
$(document).ready(function(){initNavTree('d9/d27/namespacelist__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="headertitle">
|
||||
<div class="title">list_array Namespace Reference</div> </div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
|
||||
<p>Functions for <a href="https://en.wikipedia.org/wiki/Dynamic_array">Dynamic Array</a> algorithm.
|
||||
<a href="../../d9/d27/namespacelist__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://en.wikipedia.org/wiki/Dynamic_array">Dynamic Array</a> algorithm. </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="../../d9/d27/namespacelist__array.html">list_array</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -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_md50"></a>
|
||||
<h3><a class="anchor" id="autotoc_md51"></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>
|
||||
|
||||
@@ -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_md54"></a>
|
||||
<h3><a class="anchor" id="autotoc_md55"></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>
|
||||
|
||||
@@ -1,4 +1,3 @@
|
||||
<map id="list" name="list">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="55,95,93,121"/>
|
||||
<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="5,5,143,32"/>
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="5,5,44,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
6ffed9121e4ea2f09f675ee144e31b81
|
||||
b27f82817fdb09c9c12cc0ea928971fc
|
||||
@@ -4,42 +4,26 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- Title: list Pages: 1 -->
|
||||
<svg width="114pt" height="95pt"
|
||||
viewBox="0.00 0.00 114.00 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)">
|
||||
<svg width="77pt" height="28pt"
|
||||
viewBox="0.00 0.00 77.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>list</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 110,-91 110,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-24 73,-24 73,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="37,-0.5 37,-19.5 66,-19.5 66,-0.5 37,-0.5"/>
|
||||
<text text-anchor="middle" x="51.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">list</text>
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-19.5 29,-19.5 29,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="14.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">list</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M76.55,-15.63C80.94,-14.88 84,-13.01 84,-10 84,-4.94 75.32,-3.08 66.21,-4.42"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="76.22,-12.13 66.21,-15.58 76.19,-19.13 76.22,-12.13"/>
|
||||
<text text-anchor="middle" x="95" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00"> next</text>
|
||||
</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" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="0,-67.5 0,-86.5 103,-86.5 103,-67.5 0,-67.5"/>
|
||||
<text text-anchor="middle" x="51.5" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array< int, 50 ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M51.5,-57.04C51.5,-44.67 51.5,-29.12 51.5,-19.63"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="48,-57.23 51.5,-67.23 55,-57.23 48,-57.23"/>
|
||||
<text text-anchor="middle" x="62.5" y="-41" font-family="Helvetica,sans-Serif" font-size="10.00"> data</text>
|
||||
<title>Node1->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M39.55,-13.52C43.94,-13.05 47,-11.88 47,-10 47,-6.84 38.32,-5.67 29.21,-6.51"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="39.22,-10.02 29.21,-13.49 39.2,-17.02 39.22,-10.02"/>
|
||||
<text text-anchor="middle" x="58" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00"> next</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.1 KiB After Width: | Height: | Size: 1.3 KiB |
@@ -141,7 +141,7 @@ char </td><td class="memItemRight" valign="bottom"><a class="el" href="../.
|
||||
<dl class="section note"><dt>Note</dt><dd>Do not know the application of this, however. </dd>
|
||||
<dd>
|
||||
Implementation is C-type and does not utilize the C++ constructs </dd></dl>
|
||||
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000009">Todo:</a></b></dt><dd>implement as a C++ class </dd></dl>
|
||||
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000008">Todo:</a></b></dt><dd>implement as a C++ class </dd></dl>
|
||||
</div><h2 class="groupheader">Macro Definition Documentation</h2>
|
||||
<a id="a392fb874e547e582e9c66a08a1f23326"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a392fb874e547e582e9c66a08a1f23326">◆ </a></span>MAX</h2>
|
||||
|
||||
@@ -185,7 +185,7 @@ Functions</h2></td></tr>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>get_input function is to receive input from standard IO </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000014">Todo:</a></b></dt><dd>@christianbender Get input from STDIO or write input to memory as done above. </dd></dl>
|
||||
<p>get_input function is to receive input from standard IO </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000013">Todo:</a></b></dt><dd>@christianbender Get input from STDIO or write input to memory as done above. </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> {}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
|
||||
@@ -1,5 +1,6 @@
|
||||
<map id="data_structures/list_array.cpp" name="data_structures/list_array.cpp">
|
||||
<area shape="rect" id="node1" title=" " alt="" coords="7,5,140,47"/>
|
||||
<area shape="rect" id="node2" title=" " alt="" coords="5,95,56,121"/>
|
||||
<area shape="rect" id="node3" title=" " alt="" coords="80,95,152,121"/>
|
||||
<area shape="rect" id="node1" title="Dynamic Array" alt="" coords="60,5,193,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"/>
|
||||
<area shape="rect" id="node4" title=" " alt="" coords="177,95,242,121"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
60f19e4be5abe7a0b77e8b48f3312522
|
||||
9065b498217aafdb8a30b065f219a1d6
|
||||
@@ -4,18 +4,18 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- Title: data_structures/list_array.cpp Pages: 1 -->
|
||||
<svg width="118pt" height="95pt"
|
||||
viewBox="0.00 0.00 118.00 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<svg width="186pt" height="95pt"
|
||||
viewBox="0.00 0.00 185.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/list_array.cpp</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 114,-91 114,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 181.5,-91 181.5,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title=" ">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="1,-56.5 1,-86.5 101,-86.5 101,-56.5 1,-56.5"/>
|
||||
<text text-anchor="start" x="9" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/list</text>
|
||||
<text text-anchor="middle" x="51" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array.cpp</text>
|
||||
<g id="a_node1"><a xlink:title="Dynamic Array">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="41,-56.5 41,-86.5 141,-86.5 141,-56.5 41,-56.5"/>
|
||||
<text text-anchor="start" x="49" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/list</text>
|
||||
<text text-anchor="middle" x="91" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array.cpp</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
@@ -23,31 +23,46 @@
|
||||
<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 38,-19.5 38,-0.5 0,-0.5"/>
|
||||
<text text-anchor="middle" x="19" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">array</text>
|
||||
<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->Node2 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<path fill="none" stroke="midnightblue" d="M43.42,-56.4C38.96,-48.11 33.28,-37.55 28.52,-28.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="31.48,-26.81 23.66,-19.66 25.31,-30.12 31.48,-26.81"/>
|
||||
<path fill="none" stroke="midnightblue" d="M75.83,-56.4C66.25,-47.49 53.84,-35.95 43.93,-26.74"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="46.02,-23.9 36.31,-19.66 41.25,-29.03 46.02,-23.9"/>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="node3" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_node3"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="56,-0.5 56,-19.5 110,-19.5 110,-0.5 56,-0.5"/>
|
||||
<text text-anchor="middle" x="83" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
|
||||
<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->Node3 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<path fill="none" stroke="midnightblue" d="M58.58,-56.4C63.04,-48.11 68.72,-37.55 73.48,-28.71"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="76.69,-30.12 78.34,-19.66 70.52,-26.81 76.69,-30.12"/>
|
||||
<path fill="none" stroke="midnightblue" d="M91,-56.4C91,-48.47 91,-38.46 91,-29.86"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="94.5,-29.66 91,-19.66 87.5,-29.66 94.5,-29.66"/>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="node4" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_node4"><a xlink:title=" ">
|
||||
<polygon fill="white" stroke="#bfbfbf" points="128.5,-0.5 128.5,-19.5 177.5,-19.5 177.5,-0.5 128.5,-0.5"/>
|
||||
<text text-anchor="middle" x="153" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<path fill="none" stroke="midnightblue" d="M105.69,-56.4C114.98,-47.49 127,-35.95 136.6,-26.74"/>
|
||||
<polygon fill="midnightblue" stroke="midnightblue" points="139.19,-29.11 143.98,-19.66 134.34,-24.06 139.19,-29.11"/>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
|
Before Width: | Height: | Size: 2.3 KiB After Width: | Height: | Size: 2.9 KiB |
@@ -242,7 +242,7 @@ Here is the call graph for this function:</div>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Test LU decomposition </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000006">Todo:</a></b></dt><dd>better ways to self-check a matrix output? </dd></dl>
|
||||
<p>Test LU decomposition </p><dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000005">Todo:</a></b></dt><dd>better ways to self-check a matrix output? </dd></dl>
|
||||
<div class="fragment"><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  {</div>
|
||||
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordtype">int</span> <a class="code" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> = 3; <span class="comment">// default matrix size</span></div>
|
||||
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> range = 50;</div>
|
||||
|
||||
@@ -0,0 +1,5 @@
|
||||
<map id="data_structures::list_array::list" name="data_structures::list_array::list">
|
||||
<area shape="rect" id="node1" title="Structure of List with supporting methods." alt="" coords="5,199,143,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="12,95,136,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="27,5,121,32"/>
|
||||
</map>
|
||||
@@ -0,0 +1 @@
|
||||
500447622d08d9f56b3b5119c0944fb5
|
||||
@@ -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.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- Title: data_structures::list_array::list Pages: 1 -->
|
||||
<svg width="111pt" height="184pt"
|
||||
viewBox="0.00 0.00 111.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::list_array::list</title>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-180 107,-180 107,4 -4,4"/>
|
||||
<!-- Node1 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_node1"><a xlink:title="Structure of List with supporting methods.">
|
||||
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 103,-30.5 103,-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::list</text>
|
||||
<text text-anchor="middle" x="51.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list</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" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="5,-78.5 5,-108.5 98,-108.5 98,-78.5 5,-78.5"/>
|
||||
<text text-anchor="start" x="13" y="-96.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::array< uint64</text>
|
||||
<text text-anchor="middle" x="51.5" y="-85.5" font-family="Helvetica,sans-Serif" font-size="10.00">_t, 50 ></text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node1 -->
|
||||
<g id="edge1" class="edge">
|
||||
<title>Node2->Node1</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M51.5,-68.09C51.5,-55.76 51.5,-41.22 51.5,-30.73"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="48,-68.2 51.5,-78.2 55,-68.21 48,-68.2"/>
|
||||
<text text-anchor="middle" x="62.5" y="-52" font-family="Helvetica,sans-Serif" font-size="10.00"> data</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" xlink:title=" ">
|
||||
<polygon fill="white" stroke="black" points="16,-156.5 16,-175.5 87,-175.5 87,-156.5 16,-156.5"/>
|
||||
<text text-anchor="middle" x="51.5" y="-163.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::uint64_t</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3->Node2 -->
|
||||
<g id="edge2" class="edge">
|
||||
<title>Node3->Node2</title>
|
||||
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M51.5,-146.24C51.5,-134.41 51.5,-119.38 51.5,-108.58"/>
|
||||
<polygon fill="#9a32cd" stroke="#9a32cd" points="48,-146.36 51.5,-156.36 55,-146.36 48,-146.36"/>
|
||||
<text text-anchor="middle" x="73" y="-130" font-family="Helvetica,sans-Serif" font-size="10.00"> elements</text>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
After Width: | Height: | Size: 2.9 KiB |
@@ -100,29 +100,27 @@ $(document).ready(function(){initNavTree('dd/da0/todo.html','../../'); initResiz
|
||||
<dt>File <a class="el" href="../../d3/d26/binary__search__tree_8cpp.html">binary_search_tree.cpp</a> </dt>
|
||||
<dd><a class="anchor" id="_todo000003"></a>update code to use C++ STL library features and OO structure </dd>
|
||||
<dt>Member <a class="el" href="../../d1/df3/hash__search_8cpp.html#ad0831425f1389166a9518f422d0c6ec5">create_list</a> (int key)</dt>
|
||||
<dd><a class="anchor" id="_todo000013"></a>fix memory leak </dd>
|
||||
<dd><a class="anchor" id="_todo000012"></a>fix memory leak </dd>
|
||||
<dt>Member <a class="el" href="../../d0/d3e/classdata__structures_1_1trie.html#aeac27cfd397d2dd3f2f519efffafeeab">data_structures::trie::deleteString</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string.html">std::string</a> &str, int index)</dt>
|
||||
<dd><a class="anchor" id="_todo000005"></a>review the function ::data_structure::trie::deleteString and the commented lines </dd>
|
||||
<dd><a class="anchor" id="_todo000004"></a>review the function ::data_structure::trie::deleteString and the commented lines </dd>
|
||||
<dt>Member <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html#a35b7c98af53ad2ec18658679ad7d43de">fib_b</a> </dt>
|
||||
<dd><a class="anchor" id="_todo000008"></a>@stepfencurryxiao add documetnation </dd>
|
||||
<dd><a class="anchor" id="_todo000007"></a>@stepfencurryxiao add documetnation </dd>
|
||||
<dt>Member <a class="el" href="../../dc/dfe/ternary__search_8cpp.html#a7f7d866eccdabe51bb16818a792618b1">get_input</a> ()</dt>
|
||||
<dd><a class="anchor" id="_todo000014"></a>@christianbender Get input from STDIO or write input to memory as done above. </dd>
|
||||
<dd><a class="anchor" id="_todo000013"></a>@christianbender Get input from STDIO or write input to memory as done above. </dd>
|
||||
<dt>File <a class="el" href="../../d1/df3/hash__search_8cpp.html">hash_search.cpp</a> </dt>
|
||||
<dd><a class="anchor" id="_todo000012"></a>fix the program for memory leaks and better structure in C++ and not C fashion </dd>
|
||||
<dd><a class="anchor" id="_todo000011"></a>fix the program for memory leaks and better structure in C++ and not C fashion </dd>
|
||||
<dt>File <a class="el" href="../../d2/de9/heavy__light__decomposition_8cpp.html">heavy_light_decomposition.cpp</a> </dt>
|
||||
<dd><a class="anchor" id="_todo000011"></a>Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: <a href="https://cses.fi/problemset/task/1138">https://cses.fi/problemset/task/1138</a> </dd>
|
||||
<dd><a class="anchor" id="_todo000010"></a>Support edge weight queries, by storing the edge weight value in it's child algorithm verified by testing in CSES path queries: <a href="https://cses.fi/problemset/task/1138">https://cses.fi/problemset/task/1138</a> </dd>
|
||||
<dt>File <a class="el" href="../../d7/db9/hill__cipher_8cpp.html">hill_cipher.cpp</a> </dt>
|
||||
<dd><a class="anchor" id="_todo000001"></a>Better matrix generation algorithm. </dd>
|
||||
<dt>File <a class="el" href="../../d7/d00/list__array_8cpp.html">list_array.cpp</a> </dt>
|
||||
<dd><a class="anchor" id="_todo000004"></a>Add documentation </dd>
|
||||
<dt>Member <a class="el" href="../../d7/d35/matrix__exponentiation_8cpp.html#a9977ad12548c4a49dee9dc3f0685aa54">mat_size</a> </dt>
|
||||
<dd><a class="anchor" id="_todo000007"></a>@stepfencurryxiao add documetnation </dd>
|
||||
<dd><a class="anchor" id="_todo000006"></a>@stepfencurryxiao add documetnation </dd>
|
||||
<dt>File <a class="el" href="../../dc/dc5/paranthesis__matching_8cpp.html">paranthesis_matching.cpp</a> </dt>
|
||||
<dd><a class="anchor" id="_todo000009"></a>implement as a C++ class </dd>
|
||||
<dd><a class="anchor" id="_todo000008"></a>implement as a C++ class </dd>
|
||||
<dt>Member <a class="el" href="../../dd/d65/lu__decompose_8cpp.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a> ()</dt>
|
||||
<dd><a class="anchor" id="_todo000006"></a>better ways to self-check a matrix output? </dd>
|
||||
<dd><a class="anchor" id="_todo000005"></a>better ways to self-check a matrix output? </dd>
|
||||
<dt>Member <a class="el" href="../../d0/d01/smallest__circle_8cpp.html#a6d0455dd5c30adda100e95f0423c786e">test3</a> ()</dt>
|
||||
<dd><a class="anchor" id="_todo000010"></a>This test fails </dd>
|
||||
<dd><a class="anchor" id="_todo000009"></a>This test fails </dd>
|
||||
</dl>
|
||||
</div></div><!-- contents -->
|
||||
</div><!-- PageDoc -->
|
||||
|
||||
@@ -97,18 +97,8 @@ $(document).ready(function(){initNavTree('d8/d10/structlist.html','../../'); ini
|
||||
|
||||
<p>This is the complete list of members for <a class="el" href="../../d8/d10/structlist.html">list</a>, including all inherited members.</p>
|
||||
<table class="directory">
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>BinarySearch</b>(const std::array< int, 50 > &dataArr, int first, int last, int x) (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>data</b> (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>insert</b>(int x) (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>isSorted</b> (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d8/d10/structlist.html#aaab2e33bc1ca6f44e72239bfb58f100c">key</a></td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>LinearSearch</b>(const std::array< int, 50 > &dataArr, int x) const (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr class="even"><td class="entry"><a class="el" href="../../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">next</a></td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>Remove</b>(int x) (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>Search</b>(int x) (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>Show</b>() (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>Sort</b>() (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
|
||||
<tr bgcolor="#f0f0f0"><td class="entry"><b>top</b> (defined in <a class="el" href="../../d8/d10/structlist.html">list</a>)</td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"></td></tr>
|
||||
<tr><td class="entry"><a class="el" href="../../d8/d10/structlist.html#a1900fe79e875e2838625b2eb60837f8f">next</a></td><td class="entry"><a class="el" href="../../d8/d10/structlist.html">list</a></td><td class="entry"></td></tr>
|
||||
</table></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
|
||||
@@ -145,7 +145,7 @@ Functions</h2></td></tr>
|
||||
</div><!-- fragment --><p>The direction ratios (DR) are calculated as follows: 1st DR, J: (b * z) - (c * y) 2nd DR, A: -((a * z) - (c * x)) 3rd DR, N: (a * y) - (b * x)</p>
|
||||
<p>Therefore, the direction ratios of the cross product are: J, A, N The following C++ Program calculates the direction ratios of the cross products of two vector. The program uses a function, <a class="el" href="../../df/d66/vector__cross__product_8cpp.html#abed307975124243d63fe2e118254defe" title="Function to calculate the cross product of the passed arrays containing the direction ratios of the t...">cross()</a> for doing so. The direction ratios for the first and the second vector has to be passed one by one seperated by a space character.</p>
|
||||
<p>Magnitude of a vector is the square root of the sum of the squares of the direction ratios.</p>
|
||||
<h3><a class="anchor" id="autotoc_md64"></a>
|
||||
<h3><a class="anchor" id="autotoc_md65"></a>
|
||||
Example:</h3>
|
||||
<p>An example of a running instance of the executable program: </p><pre class="fragment">Pass the first Vector: 1 2 3
|
||||
</pre><p> Pass the second Vector: 4 5 6 The cross product is: -3 6 -3 Magnitude: 7.34847</p>
|
||||
|
||||
@@ -119,6 +119,7 @@ Files</h2></td></tr>
|
||||
<tr class="memdesc:d3/dce/linkedlist__implentation__usingarray_8cpp"><td class="mdescLeft"> </td><td class="mdescRight">Linked list implementation using Arrays. <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d7/d00/list__array_8cpp"><td class="memItemLeft" align="right" valign="top">file  </td><td class="memItemRight" valign="bottom"><a class="el" href="d7/d00/list__array_8cpp.html">list_array.cpp</a></td></tr>
|
||||
<tr class="memdesc:d7/d00/list__array_8cpp"><td class="mdescLeft"> </td><td class="mdescRight"><a href="https://en.wikipedia.org/wiki/Dynamic_array">Dynamic Array</a> <br /></td></tr>
|
||||
<tr class="separator:"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:d8/df0/queue__using__array_8cpp"><td class="memItemLeft" align="right" valign="top">file  </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"> </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>
|
||||
|
||||
@@ -121,7 +121,7 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
|
||||
<tr id="row_2_4_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="de/d23/disjoint__set_8cpp.html" target="_self">disjoint_set.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Disjoint-set_data_structure">Disjoint Sets Data Structure (Disjoint Sets)</a> </td></tr>
|
||||
<tr id="row_2_5_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span class="icondoc"></span><a class="el" href="da/dc3/linked__list_8cpp.html" target="_self">linked_list.cpp</a></td><td class="desc">Implementation of singly linked list algorithm </td></tr>
|
||||
<tr id="row_2_6_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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;"> </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_7_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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"><a href="https://en.wikipedia.org/wiki/Dynamic_array">Dynamic Array</a> </td></tr>
|
||||
<tr id="row_2_8_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </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;"> </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;"> </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>
|
||||
|
||||
@@ -99,6 +99,9 @@ $(document).ready(function(){initNavTree('functions_b.html',''); initResizable()
|
||||
<li>bfs()
|
||||
: <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph</a>
|
||||
</li>
|
||||
<li>BinarySearch()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>breadth_first_search()
|
||||
: <a class="el" href="dc/d61/classgraph_1_1_graph.html#ab1a1a96cd4cddf0d4feb02855c4c16af">graph::Graph< T ></a>
|
||||
</li>
|
||||
|
||||
@@ -99,6 +99,9 @@ $(document).ready(function(){initNavTree('functions_func_b.html',''); initResiza
|
||||
<li>bfs()
|
||||
: <a class="el" href="d8/d69/classgraph_1_1_h_k_graph.html#a7491add14d9fc04f679114ca6d6f0f93">graph::HKGraph</a>
|
||||
</li>
|
||||
<li>BinarySearch()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a3b4abfffc730e07fcbd5844e09add8cd">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>breadth_first_search()
|
||||
: <a class="el" href="dc/d61/classgraph_1_1_graph.html#ab1a1a96cd4cddf0d4feb02855c4c16af">graph::Graph< T ></a>
|
||||
</li>
|
||||
|
||||
@@ -100,6 +100,9 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
|
||||
: <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD< X ></a>
|
||||
, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree< X ></a>
|
||||
</li>
|
||||
<li>insert()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>Insert()
|
||||
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a>
|
||||
</li>
|
||||
|
||||
@@ -108,6 +108,9 @@ $(document).ready(function(){initNavTree('functions_func_l.html',''); initResiza
|
||||
<li>lift()
|
||||
: <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">range_queries::heavy_light_decomposition::Tree< X ></a>
|
||||
</li>
|
||||
<li>LinearSearch()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>link()
|
||||
: <a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb">data_structures::linked_list::link</a>
|
||||
</li>
|
||||
|
||||
@@ -102,6 +102,9 @@ $(document).ready(function(){initNavTree('functions_func_r.html',''); initResiza
|
||||
<li>real()
|
||||
: <a class="el" href="da/d5a/class_complex.html#a312e4b19146128408fb06e0150b0faf6">Complex</a>
|
||||
</li>
|
||||
<li>remove()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>Remove()
|
||||
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">data_structures::tree_234::Tree234</a>
|
||||
</li>
|
||||
|
||||
@@ -122,12 +122,18 @@ $(document).ready(function(){initNavTree('functions_func_s.html',''); initResiza
|
||||
<li>SG()
|
||||
: <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG< X ></a>
|
||||
</li>
|
||||
<li>show()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>single_predict()
|
||||
: <a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html#ac130322a5abb1ff763b7c1a55405a35e">machine_learning::neural_network::NeuralNetwork</a>
|
||||
</li>
|
||||
<li>SkipList()
|
||||
: <a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a>
|
||||
</li>
|
||||
<li>sort()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>SplitNode()
|
||||
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234</a>
|
||||
</li>
|
||||
|
||||
@@ -100,6 +100,9 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
|
||||
: <a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html#ae9e979edd69678b85665c01e2ee97828">range_queries::heavy_light_decomposition::HLD< X ></a>
|
||||
, <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ad22d760a5a33545a70e7ea5e1786c8dc">range_queries::heavy_light_decomposition::Tree< X ></a>
|
||||
</li>
|
||||
<li>insert()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>Insert()
|
||||
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a>
|
||||
</li>
|
||||
|
||||
@@ -118,6 +118,9 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
|
||||
<li>lift()
|
||||
: <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html#ac7761255f2ba06b398b9aae5e4dce5f3">range_queries::heavy_light_decomposition::Tree< X ></a>
|
||||
</li>
|
||||
<li>LinearSearch()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#ac91272e6c970299e51cccd6cbdfe9e53">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>link()
|
||||
: <a class="el" href="de/d9d/classdata__structures_1_1linked__list_1_1link.html#aba4672fbc40c38962d1510b843a577bb">data_structures::linked_list::link</a>
|
||||
</li>
|
||||
|
||||
@@ -105,6 +105,9 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
|
||||
<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>remove()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0499455a80156134cc79c98eabb376d9">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>Remove()
|
||||
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a5da1be3f5b5d967ebb36a201f3ebad11">data_structures::tree_234::Tree234</a>
|
||||
</li>
|
||||
|
||||
@@ -128,6 +128,9 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
|
||||
<li>SG()
|
||||
: <a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html#afba5c1225ba04c0025c7786c09ff28f1">range_queries::heavy_light_decomposition::SG< X ></a>
|
||||
</li>
|
||||
<li>show()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#ae5c15d93819c4e437ebb7a1b41f2d594">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>side
|
||||
: <a class="el" href="de/d00/classgraph_1_1is__graph__bipartite_1_1_graph.html#a9d10768f927baa8a4d4a5ffce295b6b6">graph::is_graph_bipartite::Graph</a>
|
||||
</li>
|
||||
@@ -140,6 +143,9 @@ $(document).ready(function(){initNavTree('functions_s.html',''); initResizable()
|
||||
<li>SkipList()
|
||||
: <a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html#a7ffc3688725b9d1ec6e5bb881a6e2ae4">data_structures::SkipList</a>
|
||||
</li>
|
||||
<li>sort()
|
||||
: <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a39a712c8413b0d7861695ec019474469">data_structures::list_array::list</a>
|
||||
</li>
|
||||
<li>SplitNode()
|
||||
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a370b625ca9f16bbef2b65e024ef78ea9">data_structures::tree_234::Tree234</a>
|
||||
</li>
|
||||
|
||||
@@ -111,6 +111,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
|
||||
, <a class="el" href="de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">disjoint_set.cpp</a>
|
||||
, <a class="el" href="da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linked_list.cpp</a>
|
||||
, <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linkedlist_implentation_usingarray.cpp</a>
|
||||
, <a class="el" href="d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">list_array.cpp</a>
|
||||
, <a class="el" href="d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_array.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="d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">skip_list.cpp</a>
|
||||
|
||||
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
|
||||
, <a class="el" href="d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">morse_code.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">xor_cipher.cpp</a>
|
||||
, <a class="el" href="d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">list_array.cpp</a>
|
||||
, <a class="el" href="d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">trie_tree.cpp</a>
|
||||
, <a class="el" href="db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">0_1_knapsack.cpp</a>
|
||||
, <a class="el" href="d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">coin_change_topdown.cpp</a>
|
||||
|
||||
@@ -111,6 +111,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
|
||||
, <a class="el" href="de/d23/disjoint__set_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">disjoint_set.cpp</a>
|
||||
, <a class="el" href="da/dc3/linked__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linked_list.cpp</a>
|
||||
, <a class="el" href="d3/dce/linkedlist__implentation__usingarray_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">linkedlist_implentation_usingarray.cpp</a>
|
||||
, <a class="el" href="d7/d00/list__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">list_array.cpp</a>
|
||||
, <a class="el" href="d8/df0/queue__using__array_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">queue_using_array.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="d0/d5a/skip__list_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">skip_list.cpp</a>
|
||||
|
||||
@@ -102,6 +102,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
|
||||
, <a class="el" href="d8/d76/morse__code_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">morse_code.cpp</a>
|
||||
, <a class="el" href="dd/d12/vigenere__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">vigenere_cipher.cpp</a>
|
||||
, <a class="el" href="d3/d4c/xor__cipher_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">xor_cipher.cpp</a>
|
||||
, <a class="el" href="d7/d00/list__array_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">list_array.cpp</a>
|
||||
, <a class="el" href="d7/d83/trie__tree_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">trie_tree.cpp</a>
|
||||
, <a class="el" href="db/d16/0__1__knapsack_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">0_1_knapsack.cpp</a>
|
||||
, <a class="el" href="d9/d31/coin__change__topdown_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">coin_change_topdown.cpp</a>
|
||||
|
||||
@@ -124,41 +124,42 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
|
||||
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;"> </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">data_structures::linked_list::link</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;"> </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">data_structures::linked_list::list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
|
||||
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_40_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html" target="_self">data_structures::list_array::list</a></td><td class="desc">Structure of List with supporting methods </td></tr>
|
||||
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d23/classgraph_1_1_lowest_common_ancestor.html" target="_self">graph::LowestCommonAncestor</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">math::ncr_modulo_p::NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
|
||||
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html" target="_self">machine_learning::neural_network::NeuralNetwork</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
|
||||
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_42_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_44_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_44_" class="arrow" onclick="toggleFolder('44_')">▼</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< X ></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_44_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </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< X ></a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_45_"><td class="entry"><span style="width:16px;display:inline-block;"> </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">data_structures::SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_46_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_47_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
|
||||
<tr id="row_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_49_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_50_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_51_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_53_"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_53_" class="arrow" onclick="toggleFolder('53_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree< X ></a></td><td class="desc">A Basic <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>, which supports binary lifting </td></tr>
|
||||
<tr id="row_53_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;"> </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< X ></a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_54_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
|
||||
<tr id="row_55_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::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_56_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_57_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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">Trie::TrieNode</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue< Kind ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_44_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_45_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_45_" class="arrow" onclick="toggleFolder('45_')">▼</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< X ></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_45_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </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< X ></a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_46_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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">data_structures::SkipList</a></td><td class="desc"></td></tr>
|
||||
<tr id="row_47_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
|
||||
<tr id="row_49_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack< Type ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_50_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_51_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_52_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2< T ></a></td><td class="desc"></td></tr>
|
||||
<tr id="row_53_"><td class="entry"><span style="width:16px;display:inline-block;"> </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_54_" class="even"><td class="entry"><span style="width:0px;display:inline-block;"> </span><span id="arr_54_" class="arrow" onclick="toggleFolder('54_')">▼</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree< X ></a></td><td class="desc">A Basic <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>, which supports binary lifting </td></tr>
|
||||
<tr id="row_54_0_"><td class="entry"><span style="width:32px;display:inline-block;"> </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< X ></a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
|
||||
<tr id="row_55_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
|
||||
<tr id="row_56_"><td class="entry"><span style="width:16px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::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_57_" class="even"><td class="entry"><span style="width:16px;display:inline-block;"> </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_58_"><td class="entry"><span style="width:16px;display:inline-block;"> </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">Trie::TrieNode</a></td><td class="desc"></td></tr>
|
||||
</table>
|
||||
</div><!-- directory -->
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -27,6 +27,7 @@ var hierarchy =
|
||||
[ "data_structures::linked_list::link", "de/d9d/classdata__structures_1_1linked__list_1_1link.html", null ],
|
||||
[ "linkedlist", "d0/dff/structlinkedlist.html", null ],
|
||||
[ "data_structures::linked_list::list", "d1/def/classdata__structures_1_1linked__list_1_1list.html", null ],
|
||||
[ "data_structures::list_array::list", "d5/dab/structdata__structures_1_1list__array_1_1list.html", null ],
|
||||
[ "list", "d8/d10/structlist.html", null ],
|
||||
[ "graph::LowestCommonAncestor", "d9/d23/classgraph_1_1_lowest_common_ancestor.html", null ],
|
||||
[ "MinHeap", "d2/d05/class_min_heap.html", null ],
|
||||
@@ -42,8 +43,8 @@ var hierarchy =
|
||||
[ "geometry::jarvis::Point", "d9/d5a/structgeometry_1_1jarvis_1_1_point.html", null ],
|
||||
[ "Point", "d8/dc8/struct_point.html", null ],
|
||||
[ "query", "dd/d1b/structquery.html", null ],
|
||||
[ "queue< Kind >", "db/da9/classqueue.html", null ],
|
||||
[ "Queue", "dc/db5/struct_queue.html", null ],
|
||||
[ "queue< Kind >", "db/da9/classqueue.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", [
|
||||
|
||||
@@ -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&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&logo=gitter&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&message=Welcome&color=0059b3&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&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_md65"></a>
|
||||
<h1><a class="anchor" id="autotoc_md66"></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_md66"></a>
|
||||
<h1><a class="anchor" id="autotoc_md67"></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_md67"></a>
|
||||
<h1><a class="anchor" id="autotoc_md68"></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_md68"></a>
|
||||
<h1><a class="anchor" id="autotoc_md69"></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 -->
|
||||
|
||||
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d4/d90/classdata__structures_1_1_skip_list.html" title=" " alt="" coords="5,5,172,32"/>
|
||||
<area shape="rect" id="node1" 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." alt="" coords="5,5,185,47"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
29c2cad0bf4ed559e4d21194b66ddffa
|
||||
921790e8cb5d50aeda395a6cc32215da
|
||||
@@ -4,17 +4,18 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<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)">
|
||||
<svg width="143pt" height="39pt"
|
||||
viewBox="0.00 0.00 143.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 129,-24 129,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 139,-35 139,4 -4,4"/>
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<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>
|
||||
<g id="a_node1"><a xlink:href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_top" xlink:title="Queue_Array class containing the main data and also index of head and tail of the array.">
|
||||
<polygon fill="white" 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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1.3 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html" title="2-3-4 tree node class" alt="" coords="5,5,148,47"/>
|
||||
<area shape="rect" id="node1" href="$d4/d90/classdata__structures_1_1_skip_list.html" title=" " alt="" coords="5,5,172,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
78eaa96ae8525e3154dcedb7aca703a6
|
||||
29c2cad0bf4ed559e4d21194b66ddffa
|
||||
@@ -4,18 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- Title: Graphical Class Hierarchy Pages: 1 -->
|
||||
<svg width="115pt" height="39pt"
|
||||
viewBox="0.00 0.00 115.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="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,-35 111,-35 111,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="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_top" xlink:title="2-3-4 tree node class">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 107,-30.5 107,-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::tree</text>
|
||||
<text text-anchor="middle" x="53.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node</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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.2 KiB After Width: | Height: | Size: 1.0 KiB |
@@ -1,3 +1,3 @@
|
||||
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
|
||||
<area shape="rect" id="node1" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" title="2-3-4 tree class" alt="" coords="5,5,148,47"/>
|
||||
<area shape="rect" id="node1" href="$dd/d40/classdata__structures_1_1tree__234_1_1_node.html" title="2-3-4 tree node class" alt="" coords="5,5,148,47"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
196f8a75bb216ce01e5eaabea30101e3
|
||||
78eaa96ae8525e3154dcedb7aca703a6
|
||||
@@ -12,10 +12,10 @@
|
||||
<!-- Node0 -->
|
||||
<g id="node1" class="node">
|
||||
<title>Node0</title>
|
||||
<g id="a_node1"><a xlink:href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_top" xlink:title="2-3-4 tree class">
|
||||
<g id="a_node1"><a xlink:href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_top" xlink:title="2-3-4 tree node class">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 107,-30.5 107,-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::tree</text>
|
||||
<text text-anchor="middle" x="53.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234</text>
|
||||
<text text-anchor="middle" x="53.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Node</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.2 KiB After Width: | Height: | Size: 1.2 KiB |
@@ -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-case English alphabets a-z" alt="" coords="5,5,144,32"/>
|
||||
<area shape="rect" id="node1" href="$d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" title="2-3-4 tree class" alt="" coords="5,5,148,47"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
328ab509bf116ce8b376591ac881beaf
|
||||
196f8a75bb216ce01e5eaabea30101e3
|
||||
@@ -4,17 +4,18 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- 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">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 24)">
|
||||
<svg width="115pt" height="39pt"
|
||||
viewBox="0.00 0.00 115.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 108,-24 108,4 -4,4"/>
|
||||
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 111,-35 111,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-case English alphabets a-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="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_top" xlink:title="2-3-4 tree class">
|
||||
<polygon fill="white" stroke="black" points="0,-0.5 0,-30.5 107,-30.5 107,-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::tree</text>
|
||||
<text text-anchor="middle" x="53.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">_234::Tree234</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.1 KiB After Width: | Height: | Size: 1.2 KiB |
@@ -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-case English alphabets a-z" alt="" coords="5,5,144,32"/>
|
||||
</map>
|
||||
|
||||
@@ -1 +1 @@
|
||||
5bc10ee734d6914f823e79216ece320c
|
||||
328ab509bf116ce8b376591ac881beaf
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- 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-case English alphabets a-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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1.1 KiB |
@@ -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>
|
||||
|
||||
@@ -1 +1 @@
|
||||
3698eafa20825f92264fab47ce72bb67
|
||||
5bc10ee734d6914f823e79216ece320c
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- 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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1019 B After Width: | Height: | Size: 1.0 KiB |
@@ -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>
|
||||
|
||||
@@ -1 +1 @@
|
||||
e148e1f3f544084b7aa1e7be1efaa9bb
|
||||
3698eafa20825f92264fab47ce72bb67
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- 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>
|
||||
|
||||
|
Before Width: | Height: | Size: 990 B After Width: | Height: | Size: 1019 B |
@@ -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>
|
||||
|
||||
@@ -1 +1 @@
|
||||
26396299a5a5a0cf88af656fc914cf13
|
||||
e148e1f3f544084b7aa1e7be1efaa9bb
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- 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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1005 B After Width: | Height: | Size: 990 B |
@@ -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>
|
||||
|
||||
@@ -1 +1 @@
|
||||
6940f502400c229af84789c6c00f1735
|
||||
26396299a5a5a0cf88af656fc914cf13
|
||||
@@ -4,17 +4,17 @@
|
||||
<!-- Generated by graphviz version 2.46.0 (20210118.1747)
|
||||
-->
|
||||
<!-- 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>
|
||||
|
||||
|
Before Width: | Height: | Size: 1.0 KiB After Width: | Height: | Size: 1005 B |
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user