backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity
Files
53d5cb127986a932893efaee077fade7bed2a679
C-Plus-Plus/d0/dd2/treap_8cpp.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

273 lines
21 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.12.0-->
<!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" 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.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: data_structures/treap.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
<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>
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
<script type="text/javascript">
DoxygenAwesomeDarkModeToggle.init()
</script>
<script type="text/javascript" src="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.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/javascript">
window.MathJax = {
options: {
ignoreHtmlClass: 'tex2jax_ignore',
processHtmlClass: 'tex2jax_process'
},
loader: {
load: ['[tex]/ams']
},
tex: {
macros: {},
packages: ['base','configmacros','ams']
}
};
</script>
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
<link href="../../doxygen-awesome.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 id="projectrow">
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
<td id="projectalign">
<div id="projectname">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</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">
$(function(){initNavTree('d0/dd2/treap_8cpp.html','../../',''); });
</script>
<div id="container">
<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">
<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">
<div class="headertitle"><div class="title">treap.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>A balanced binary search tree (BST) on the basis of binary search tree and heap: the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;array&gt;</code><br />
<code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cstdint&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for treap.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../da/de6/treap_8cpp__incl.svg" width="330" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<p><a href="../../d0/dd2/treap_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:data_5Fstructures_3A_3Atreap_3A_3ATreap" id="r_data_5Fstructures_3A_3Atreap_3A_3ATreap"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Struct representation of the treap. <a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#details">More...</a><br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:data_5Fstructures" id="r_data_5Fstructures"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d3c/namespacedata__structures.html">data_structures</a></td></tr>
<tr class="memdesc:d5/d3c/namespacedata__structures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for IO operations <br /></td></tr>
<tr class="memitem:data_5Fstructures_3A_3Atreap" id="r_data_5Fstructures_3A_3Atreap"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html">data_structures::treap</a></td></tr>
<tr class="memdesc:dd/d2e/namespacedata__structures_1_1treap"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation. <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <br /></td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-var-members" class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:ad939ec178d0069aeea14b7d6d7d12099" id="r_ad939ec178d0069aeea14b7d6d7d12099"><td class="memItemLeft" align="right" valign="top">const int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d2e/namespacedata__structures_1_1treap.html#ad939ec178d0069aeea14b7d6d7d12099">data_structures::treap::maxNode</a> = 1e5 + 5</td></tr>
<tr class="memdesc:ad939ec178d0069aeea14b7d6d7d12099"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum number of nodes <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A balanced binary search tree (BST) on the basis of binary search tree and heap: the <a href="https://en.wikipedia.org/wiki/Treap" target="_blank">Treap</a> algorithm implementation. </p>
<p>Implementation of the treap data structre</p>
<p>Support operations including insert, erase, and query (the rank of specified element or the element ranked x) as the same as BST</p>
<p>But these operations take O(log N) time, since treap keeps property of heap using rotate operation, and the desired depth of the tree is O(log N). There's very little chance that it will degenerate into a chain like BST</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/fgmn" target="_blank">Kairao ZHENG</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</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"><span class="paramname"><em></em></span></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>
<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00255">255</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 255</span> {</div>
<div class="line"><span class="lineno"> 256</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 257</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 258</span>}</div>
<div class="ttc" id="atreap_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00229">treap.cpp:229</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</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">void test </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; Treap object instance</p>
<p class="definition">Definition at line <a class="el" href="../../d0/dd2/treap_8cpp_source.html#l00229">229</a> of file <a class="el" href="../../d0/dd2/treap_8cpp_source.html">treap.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 229</span> {</div>
<div class="line"><span class="lineno"> 230</span> <a class="code hl_struct" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a> mTreap; </div>
<div class="line"><span class="lineno"> 231</span> </div>
<div class="line"><span class="lineno"> 232</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(1);</div>
<div class="line"><span class="lineno"> 233</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(2);</div>
<div class="line"><span class="lineno"> 234</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(3);</div>
<div class="line"><span class="lineno"> 235</span> assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">get_k_th</a>(2) == 2);</div>
<div class="line"><span class="lineno"> 236</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(4);</div>
<div class="line"><span class="lineno"> 237</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(5);</div>
<div class="line"><span class="lineno"> 238</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(6);</div>
<div class="line"><span class="lineno"> 239</span> assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">get_next</a>(4) == 5);</div>
<div class="line"><span class="lineno"> 240</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(7);</div>
<div class="line"><span class="lineno"> 241</span> assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">get_predecessor</a>(7) == 6);</div>
<div class="line"><span class="lineno"> 242</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">erase</a>(4);</div>
<div class="line"><span class="lineno"> 243</span> assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">get_k_th</a>(4) == 5);</div>
<div class="line"><span class="lineno"> 244</span> assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">get_rank</a>(5) == 4);</div>
<div class="line"><span class="lineno"> 245</span> mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">insert</a>(10);</div>
<div class="line"><span class="lineno"> 246</span> assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">get_rank</a>(10) == 7);</div>
<div class="line"><span class="lineno"> 247</span> assert(mTreap.<a class="code hl_function" href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">get_predecessor</a>(10) == 7);</div>
<div class="line"><span class="lineno"> 248</span> </div>
<div class="line"><span class="lineno"> 249</span> std::cout &lt;&lt; <span class="stringliteral">&quot;All tests have successfully passed!\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 250</span>}</div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html">data_structures::treap::Treap</a></div><div class="ttdoc">Struct representation of the treap.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00040">treap.cpp:40</a></div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a5e884d2686aff501ef589b0d1185492f"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a5e884d2686aff501ef589b0d1185492f">data_structures::treap::Treap::insert</a></div><div class="ttdeci">void insert(int k)</div><div class="ttdoc">Insert element (External method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00203">treap.cpp:203</a></div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a767b28f9911fc32b8462862be058a4a4"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a767b28f9911fc32b8462862be058a4a4">data_structures::treap::Treap::get_next</a></div><div class="ttdeci">int get_next(int k)</div><div class="ttdoc">Get the successor node of element k.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00188">treap.cpp:188</a></div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_a9ea2becd904e2e7d22f23a001b444469"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#a9ea2becd904e2e7d22f23a001b444469">data_structures::treap::Treap::erase</a></div><div class="ttdeci">void erase(int k)</div><div class="ttdoc">Erase element (External method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00208">treap.cpp:208</a></div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab2db3ad3aecc240011e0c8b8604d2c69"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab2db3ad3aecc240011e0c8b8604d2c69">data_structures::treap::Treap::get_k_th</a></div><div class="ttdeci">int get_k_th(int k)</div><div class="ttdoc">Get the KTH largest value (External method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00214">treap.cpp:214</a></div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ab8b9899f22070cfa01db5bf874296126"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ab8b9899f22070cfa01db5bf874296126">data_structures::treap::Treap::get_predecessor</a></div><div class="ttdeci">int get_predecessor(int k)</div><div class="ttdoc">Get the predecessor node of element k.</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00172">treap.cpp:172</a></div></div>
<div class="ttc" id="astructdata__structures_1_1treap_1_1_treap_html_ac94e9d69305940f6d8804031455af039"><div class="ttname"><a href="../../d5/d95/structdata__structures_1_1treap_1_1_treap.html#ac94e9d69305940f6d8804031455af039">data_structures::treap::Treap::get_rank</a></div><div class="ttdeci">int get_rank(int k)</div><div class="ttdoc">Get the rank of specified element (External method)</div><div class="ttdef"><b>Definition</b> <a href="../../d0/dd2/treap_8cpp_source.html#l00220">treap.cpp:220</a></div></div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a href="../../d0/dd2/treap_8cpp.html">treap.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.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink