Documentation for 0953376d31

This commit is contained in:
github-actions
2023-06-16 21:18:14 +00:00
parent 26f1eee566
commit 14deeecd50
7241 changed files with 234176 additions and 54779 deletions

View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures::list_array::list&lt; N &gt; Struct Template Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -110,8 +110,7 @@ $(document).ready(function(){initNavTree('d5/dab/structdata__structures_1_1list_
<div class="dynheader">
Collaboration diagram for data_structures::list_array::list&lt; N &gt;:</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="147" height="244"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dd/d9d/structdata__structures_1_1list__array_1_1list__coll__graph.svg" width="147" height="244"><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 id="pub-methods" name="pub-methods"></a>
@@ -232,12 +231,11 @@ template&lt;uint64_t N&gt; </div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">return</span> -1;</div>
<div class="line"><span class="lineno"> 64</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_a412bdb3910181f3c384d86aee7e217cf"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array&lt; uint64_t, N &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:45</div></div>
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_a412bdb3910181f3c384d86aee7e217cf"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#a412bdb3910181f3c384d86aee7e217cf">data_structures::list_array::list::BinarySearch</a></div><div class="ttdeci">uint64_t BinarySearch(const std::array&lt; uint64_t, N &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:45</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_a412bdb3910181f3c384d86aee7e217cf_cgraph.svg" width="179" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dab/structdata__structures_1_1list__array_1_1list_a412bdb3910181f3c384d86aee7e217cf_cgraph.svg" width="179" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -418,8 +416,8 @@ template&lt;uint64_t N&gt; </div>
<div class="line"><span class="lineno"> 183</span> }</div>
<div class="line"><span class="lineno"> 184</span> top--; <span class="comment">// decrement the top variable to maintain last index</span></div>
<div class="line"><span class="lineno"> 185</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">for std::vector</div><div class="ttdef"><b>Definition:</b> binary_search.cpp:45</div></div>
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
<div class="ttc" id="anamespacesearch_html"><div class="ttname"><a href="../../d9/dca/namespacesearch.html">search</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> binary_search.cpp:45</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -466,7 +464,7 @@ template&lt;uint64_t N&gt; </div>
<div class="line"><span class="lineno"> 103</span> <span class="comment">// return the index of element or -1.</span></div>
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> pos;</div>
<div class="line"><span class="lineno"> 105</span> }</div>
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ad202ae68fe8d98082afa9dafea9e22b9"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list::LinearSearch</a></div><div class="ttdeci">uint64_t LinearSearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</div><div class="ttdoc">Search an element using linear search.</div><div class="ttdef"><b>Definition:</b> list_array.cpp:72</div></div>
<div class="ttc" id="astructdata__structures_1_1list__array_1_1list_html_ad202ae68fe8d98082afa9dafea9e22b9"><div class="ttname"><a href="../../d5/dab/structdata__structures_1_1list__array_1_1list.html#ad202ae68fe8d98082afa9dafea9e22b9">data_structures::list_array::list::LinearSearch</a></div><div class="ttdeci">uint64_t LinearSearch(const std::array&lt; uint64_t, N &gt; &amp;dataArr, const uint64_t &amp;val) const</div><div class="ttdoc">Search an element using linear search.</div><div class="ttdef"><b>Definition</b> list_array.cpp:72</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -554,8 +552,7 @@ template&lt;uint64_t N&gt; </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_a133635ad53bd89e3947ca02448819180_cgraph.svg" width="274" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/dab/structdata__structures_1_1list__array_1_1list_a133635ad53bd89e3947ca02448819180_cgraph.svg" width="274" 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>
@@ -569,7 +566,7 @@ Here is the call graph for this function:</div>
<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.6 </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.7 </li>
</ul>
</div>
</body>

View File

@@ -1,4 +1,5 @@
<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,142,46"/>
<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="190,13,268,39"/>
<area shape="rect" id="Node000001" title="Sort the list." alt="" coords="5,5,142,46"/>
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/algorithm/swap.html#" title=" " alt="" coords="190,13,268,39"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="142,23,175,23,175,28,142,28"/>
</map>

View File

@@ -1 +1 @@
96536e11ab0aba7ff121634c8e7891dc
0e12ea6bae13862c91418a8e57c78cd0

View File

@@ -6,12 +6,22 @@
<!-- Title: data_structures::list_array::list::sort Pages: 1 -->
<svg width="205pt" height="39pt"
viewBox="0.00 0.00 205.00 38.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 34.5)">
<title>data_structures::list_array::list::sort</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Sort the list.">
<g id="a_Node000001"><a xlink:title="Sort the list.">
<polygon fill="#999999" stroke="#666666" points="102.25,-30.5 0,-30.5 0,0 102.25,0 102.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
<text text-anchor="middle" x="51.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
@@ -19,19 +29,37 @@
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" 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=" ">
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="197,-24.88 138.25,-24.88 138.25,-5.63 197,-5.63 197,-24.88"/>
<text text-anchor="middle" x="167.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M102.68,-15.25C110.9,-15.25 119.32,-15.25 127.22,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.99,-18.75 136.99,-15.25 126.99,-11.75 126.99,-18.75"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>

Before

Width:  |  Height:  |  Size: 1.7 KiB

After

Width:  |  Height:  |  Size: 2.6 KiB

View File

@@ -0,0 +1,40 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: data_structures::list_array::list::sort Pages: 1 -->
<svg width="205pt" height="39pt"
viewBox="0.00 0.00 205.00 38.50" 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 34.5)">
<title>data_structures::list_array::list::sort</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Sort the list.">
<polygon fill="#999999" stroke="#666666" points="102.25,-30.5 0,-30.5 0,0 102.25,0 102.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
<text text-anchor="middle" x="51.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::sort</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/algorithm/swap.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="197,-24.88 138.25,-24.88 138.25,-5.63 197,-5.63 197,-24.88"/>
<text text-anchor="middle" x="167.62" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">std::swap</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M102.68,-15.25C110.9,-15.25 119.32,-15.25 127.22,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="126.99,-18.75 136.99,-15.25 126.99,-11.75 126.99,-18.75"/>
</a>
</g>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 1.8 KiB

View File

@@ -1,3 +1,4 @@
<map id="data_structures::list_array::list::BinarySearch" name="data_structures::list_array::list::BinarySearch">
<area shape="rect" id="node1" title="Search an element in the list using binarySearch." alt="" coords="5,29,174,70"/>
<area shape="rect" id="Node000001" title="Search an element in the list using binarySearch." alt="" coords="5,29,174,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="57,29,55,19,61,11,72,5,90,3,109,5,119,12,117,16,107,10,89,8,74,10,64,14,61,20,62,28"/>
</map>

View File

@@ -1 +1 @@
0f746ddf3ca0f1490918a719e1814657
ad17b5d8ce4a021cd9018ddd10baa4ce

View File

@@ -6,12 +6,22 @@
<!-- Title: data_structures::list_array::list::BinarySearch Pages: 1 -->
<svg width="134pt" height="57pt"
viewBox="0.00 0.00 134.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>data_structures::list_array::list::BinarySearch</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Search an element in the list using binarySearch.">
<g id="a_Node000001"><a xlink:title="Search an element in the list using binarySearch.">
<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::BinarySearch</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 74.08,-48.5 81.24,-45.83 84.59,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.15,-42.24 85.5,-31.99 81.17,-41.66 88.15,-42.24"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: data_structures::list_array::list::BinarySearch Pages: 1 -->
<svg width="134pt" height="57pt"
viewBox="0.00 0.00 134.25 56.50" 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 52.5)">
<title>data_structures::list_array::list::BinarySearch</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Search an element in the list using binarySearch.">
<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures::list</text>
<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">_array::list::BinarySearch</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M40.75,-30.99C36.19,-40.06 43.65,-48.5 63.12,-48.5 74.08,-48.5 81.24,-45.83 84.59,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="88.15,-42.24 85.5,-31.99 81.17,-41.66 88.15,-42.24"/>
</a>
</g>
</g>
</g>
</svg>

After

Width:  |  Height:  |  Size: 1.5 KiB