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

Documentation for e813f9b2a6

Browse Source
This commit is contained in:
github-actions
2021-02-05 10:11:27 +00:00
parent e044750129
commit 3d06b0aa77
406 changed files with 7862 additions and 6611 deletions
Download Patch File Download Diff File Expand all files Collapse all files

505
d5/dab/structdata__structures_1_1list__array_1_1list.html Normal file
View 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++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.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&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('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> &#124;
<a href="#pub-attribs">Public Attributes</a> &#124;
<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&#160;</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>&lt; uint64_t, 50 &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;val)</td></tr>
<tr class="memdesc:a3b4abfffc730e07fcbd5844e09add8cd"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:ac91272e6c970299e51cccd6cbdfe9e53"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</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>&lt; uint64_t, 50 &gt; &amp;dataArr, const uint64_t &amp;val) const</td></tr>
<tr class="memdesc:ac91272e6c970299e51cccd6cbdfe9e53"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:a1acfd2bc4eb94a8a58dd4a828c93f4b6"><td class="memItemLeft" align="right" valign="top"><a id="a1acfd2bc4eb94a8a58dd4a828c93f4b6"></a>
uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>search</b> (const uint64_t &amp;val)</td></tr>
<tr class="separator:a1acfd2bc4eb94a8a58dd4a828c93f4b6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a39a712c8413b0d7861695ec019474469"><td class="memItemLeft" align="right" valign="top">void&#160;</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">&#160;</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">&#160;</td></tr>
<tr class="memitem:a0f44d5e3a52d35f8ff23ace9569c6305"><td class="memItemLeft" align="right" valign="top">void&#160;</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 &amp;val)</td></tr>
<tr class="memdesc:a0f44d5e3a52d35f8ff23ace9569c6305"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:a0499455a80156134cc79c98eabb376d9"><td class="memItemLeft" align="right" valign="top">void&#160;</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 &amp;val)</td></tr>
<tr class="memdesc:a0499455a80156134cc79c98eabb376d9"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:ae5c15d93819c4e437ebb7a1b41f2d594"><td class="memItemLeft" align="right" valign="top">void&#160;</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">&#160;</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">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem: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>&lt; uint64_t, 50 &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> {}</td></tr>
<tr class="separator:abdadf56c21485e02ab885791af5971fa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad07cb3cd5fc761a0bf24b4fdfc9ba202"><td class="memItemLeft" align="right" valign="top"><a id="ad07cb3cd5fc761a0bf24b4fdfc9ba202"></a>
uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>top</b> = 0</td></tr>
<tr class="separator:ad07cb3cd5fc761a0bf24b4fdfc9ba202"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1bebd34bbfb462670f5671584c8a5cd8"><td class="memItemLeft" align="right" valign="top"><a id="a1bebd34bbfb462670f5671584c8a5cd8"></a>
bool&#160;</td><td class="memItemRight" valign="bottom"><b>isSorted</b> = false</td></tr>
<tr class="separator:a1bebd34bbfb462670f5671584c8a5cd8"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>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">&#9670;&nbsp;</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>&lt; uint64_t, 50 &gt; &amp;&#160;</td>
<td class="paramname"><em>dataArr</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>first</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>last</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>val</em>&#160;</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>&#160; {</div>
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>&#160; <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>&#160; <span class="keywordflow">if</span> (last &lt; first) {</div>
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>&#160; }</div>
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>&#160; uint64_t mid = (first + last) / 2;</div>
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>&#160; <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>&#160; <span class="keywordflow">if</span> (dataArr[mid] == val)</div>
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>&#160; <span class="keywordflow">return</span> mid;</div>
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>&#160; <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>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val &lt; dataArr[mid])</div>
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>&#160; <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>&#160; <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>&#160; <span class="keywordflow">else</span> <span class="keywordflow">if</span> (val &gt; dataArr[mid])</div>
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>&#160; <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>&#160; </div>
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cerr</a> &lt;&lt; __func__ &lt;&lt; <span class="stringliteral">&quot;:&quot;</span> &lt;&lt; __LINE__ &lt;&lt; <span class="stringliteral">&quot;: Undefined condition\n&quot;</span>;</div>
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>&#160; }</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&lt; uint64_t, 50 &gt; &amp;dataArr, const uint64_t &amp;first, const uint64_t &amp;last, const uint64_t &amp;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">&#9670;&nbsp;</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 &amp;&#160;</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>&#160; {</div>
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>&#160; <span class="comment">// overflow check</span></div>
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>&#160; <span class="keywordflow">if</span> (top == 49) {</div>
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nOverflow&quot;</span>;</div>
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; }</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; <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>&#160; <span class="comment">// otherwise place it to correct position</span></div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; <span class="keywordflow">if</span> (!isSorted) {</div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; data[top] = val;</div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; top++;</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160; 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>&#160; <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>&#160; <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top - 1; i++) {</div>
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>&#160; <span class="comment">// check for the correct position</span></div>
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>&#160; <span class="keywordflow">if</span> (data[i] &lt;= val &amp;&amp; val &lt;= data[i + 1]) {</div>
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>&#160; 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>&#160; <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>&#160; }</div>
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>&#160; }</div>
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>&#160; <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>&#160; <span class="keywordflow">if</span> (pos == 0) {</div>
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; pos = top - 1;</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; }</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; <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>&#160; <span class="keywordflow">for</span> (uint64_t i = top; i &gt; pos; i--) {</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; data[i] = data[i - 1];</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160; }</div>
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>&#160; top++; <span class="comment">// Increment the value of top.</span></div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; 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>&#160; }</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ac91272e6c970299e51cccd6cbdfe9e53"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac91272e6c970299e51cccd6cbdfe9e53">&#9670;&nbsp;</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>&lt; uint64_t, 50 &gt; &amp;&#160;</td>
<td class="paramname"><em>dataArr</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint64_t &amp;&#160;</td>
<td class="paramname"><em>val</em>&#160;</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>&#160; {</div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <span class="comment">// Going through each element in the list</span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160; <span class="keywordflow">if</span> (dataArr[i] == val) {</div>
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>&#160; <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>&#160; }</div>
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>&#160; }</div>
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>&#160; <span class="comment">// element is not present in the list</span></div>
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>&#160; <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a0499455a80156134cc79c98eabb376d9"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0499455a80156134cc79c98eabb376d9">&#9670;&nbsp;</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 &amp;&#160;</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>&#160; {</div>
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>&#160; 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>&#160; <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>&#160; <span class="keywordflow">if</span> (pos == -1) {</div>
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n Element does not present in the list &quot;</span>;</div>
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; }</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span> &lt;&lt; data[pos] &lt;&lt; <span class="stringliteral">&quot; deleted&quot;</span>; <span class="comment">// print the appropriate message</span></div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; <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>&#160; <span class="keywordflow">for</span> (uint64_t i = pos; i &lt; top; i++) {</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; <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>&#160; }</div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; 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>&#160; }</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">&#9670;&nbsp;</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>&#160; {</div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="comment">// Going through each element in the list</span></div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; data[i] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>; <span class="comment">// print the element</span></div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; }</div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a39a712c8413b0d7861695ec019474469"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a39a712c8413b0d7861695ec019474469">&#9670;&nbsp;</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>&#160; {</div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160; <span class="comment">//Going through each element in the list</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160; <span class="keywordflow">for</span> (uint64_t i = 0; i &lt; top; i++) {</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; 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>&#160; <span class="keywordflow">for</span> (uint64_t j = i + 1; j &lt; top; j++) {</div>
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>&#160; <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>&#160; <span class="keywordflow">if</span> (data[j] &lt; data[min_idx]) {</div>
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>&#160; min_idx = j; <span class="comment">// update index accordingly</span></div>
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>&#160; }</div>
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>&#160; }</div>
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&#160; <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>&#160; <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>&#160; }</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="comment">// mark isSorted variable as true</span></div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; isSorted = <span class="keyword">true</span>;</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; }</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
View 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 ]
];

4
d5/dab/structdata__structures_1_1list__array_1_1list_a39a712c8413b0d7861695ec019474469_cgraph.map Normal file
View File

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

1
d5/dab/structdata__structures_1_1list__array_1_1list_a39a712c8413b0d7861695ec019474469_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
a3f1110c29d798a840fa417d020e6e6a

38
d5/dab/structdata__structures_1_1list__array_1_1list_a39a712c8413b0d7861695ec019474469_cgraph.svg Normal file
View File

@@ -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&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;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>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB