backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for db149bf3b7

Browse Source
This commit is contained in:
github-actions
2022-09-02 14:36:25 +00:00
parent ca6acdc719
commit 766f10286e
5464 changed files with 92674 additions and 78796 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
db/dbc/tree__234_8cpp.html
View File

@@ -1,9 +1,9 @@
<!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">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<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.4"/>
<meta name="generator" content="Doxygen 1.9.5"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/tree_234.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,10 +41,10 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.4 -->
<!-- Generated by Doxygen 1.9.5 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
@@ -84,9 +84,16 @@ $(document).ready(function(){initNavTree('db/dbc/tree__234_8cpp.html','../../');
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
@@ -110,7 +117,7 @@ $(document).ready(function(){initNavTree('db/dbc/tree__234_8cpp.html','../../');
</div><div class="textblock"><div class="dynheader">
Include dependency graph for tree_234.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/dc8/tree__234_8cpp__incl.svg" width="594" 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="../../d4/dc8/tree__234_8cpp__incl.svg" width="594" height="124"><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">
@@ -149,7 +156,7 @@ Functions</h2></td></tr>
<p >2–3–4 tree is a self-balancing data structure that is an isometry of red–black trees. Though we seldom use them in practice, we study them to understand the theory behind Red-Black tree. Please read following links for more infomation. <a href="https://en.wikipedia.org/wiki/2%E2%80%933%E2%80%934_tree" target="_blank">2–3–4 tree</a> <a href="https://www.educative.io/page/5689413791121408/80001" target="_blank">2-3-4 Trees: A Visual Introduction</a> We Only implement some basic and complicated operations in this demo. Other operations should be easy to be added. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/fedom" target="_blank">liuhuan</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a0ddf1224851353fc92bfbff6f499fa97" name="a0ddf1224851353fc92bfbff6f499fa97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&nbsp;</a></span>main()</h2>
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
@@ -187,14 +194,14 @@ Functions</h2></td></tr>
<div class="line"><span class="lineno"> 1299</span> <span class="keywordflow">if</span> (argc &lt; 2) {</div>
<div class="line"><span class="lineno"> 1300</span> <a class="code hl_function" href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a>(); <span class="comment">// execute 1st test</span></div>
<div class="line"><span class="lineno"> 1301</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 1302</span> <a class="code hl_function" href="../../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342">test2</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a>(argv[1])); <span class="comment">// execute 2nd test</span></div>
<div class="line"><span class="lineno"> 1302</span> <a class="code hl_function" href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a>(<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a>(argv[1])); <span class="comment">// execute 2nd test</span></div>
<div class="line"><span class="lineno"> 1303</span> }</div>
<div class="line"><span class="lineno"> 1304</span> </div>
<div class="line"><span class="lineno"> 1305</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 1306</span>}</div>
<div class="ttc" id="adsu__path__compression_8cpp_html_a45d94ead4cf4e1ff9f87c38bc99f59ae"><div class="ttname"><a href="../../d3/dae/dsu__path__compression_8cpp.html#a45d94ead4cf4e1ff9f87c38bc99f59ae">test2</a></div><div class="ttdeci">static void test2()</div><div class="ttdoc">Self-implementations, 2nd test.</div><div class="ttdef"><b>Definition:</b> dsu_path_compression.cpp:186</div></div>
<div class="ttc" id="astol_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/string/basic_string/stol.html">std::stoi</a></div><div class="ttdeci">T stoi(T... args)</div></div>
<div class="ttc" id="atree__234_8cpp_html_ae7880ce913f3058a35ff106d5be9e243"><div class="ttname"><a href="../../db/dbc/tree__234_8cpp.html#ae7880ce913f3058a35ff106d5be9e243">test1</a></div><div class="ttdeci">static void test1()</div><div class="ttdoc">simple test to insert a given array and delete some item, and print the tree</div><div class="ttdef"><b>Definition:</b> tree_234.cpp:1263</div></div>
<div class="ttc" id="atree__234_8cpp_html_af1ac73779b0fcfbbdce3976c0ca57342"><div class="ttname"><a href="../../db/dbc/tree__234_8cpp.html#af1ac73779b0fcfbbdce3976c0ca57342">test2</a></div><div class="ttdeci">static void test2(int64_t n)</div><div class="ttdoc">simple test to insert continuous number of range [0, n), and print the tree</div><div class="ttdef"><b>Definition:</b> tree_234.cpp:1281</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -205,7 +212,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="ae7880ce913f3058a35ff106d5be9e243" name="ae7880ce913f3058a35ff106d5be9e243"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae7880ce913f3058a35ff106d5be9e243">&#9670;&nbsp;</a></span>test1()</h2>
<h2 class="memtitle"><span class="permalink"><a href="#ae7880ce913f3058a35ff106d5be9e243">&#9670;&#160;</a></span>test1()</h2>
<div class="memitem">
<div class="memproto">
@@ -255,7 +262,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="af1ac73779b0fcfbbdce3976c0ca57342" name="af1ac73779b0fcfbbdce3976c0ca57342"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af1ac73779b0fcfbbdce3976c0ca57342">&#9670;&nbsp;</a></span>test2()</h2>
<h2 class="memtitle"><span class="permalink"><a href="#af1ac73779b0fcfbbdce3976c0ca57342">&#9670;&#160;</a></span>test2()</h2>
<div class="memitem">
<div class="memproto">
@@ -300,7 +307,7 @@ Here is the call graph for this function:</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="../../db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg" width="514" height="296"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../db/dbc/tree__234_8cpp_af1ac73779b0fcfbbdce3976c0ca57342_cgraph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -312,7 +319,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="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../db/dbc/tree__234_8cpp.html">tree_234.cpp</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.4 </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.5 </li>
</ul>
</div>
</body>