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

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
dd/d95/classdata__structures_1_1_segment_tree.html
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.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures::SegmentTree&lt; T &gt; Class 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.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -111,41 +111,41 @@ $(document).ready(function(){initNavTree('dd/d95/classdata__structures_1_1_segme
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a330724f79c5d1bdb745c29474ff3eac2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a330724f79c5d1bdb745c29474ff3eac2">SegmentTree</a> (int n)</td></tr>
<tr class="memitem:a330724f79c5d1bdb745c29474ff3eac2" id="r_a330724f79c5d1bdb745c29474ff3eac2"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a330724f79c5d1bdb745c29474ff3eac2">SegmentTree</a> (int n)</td></tr>
<tr class="separator:a330724f79c5d1bdb745c29474ff3eac2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad0e78179ab979ae2bc4304bdc181db17"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17">update</a> (int pos, T val)</td></tr>
<tr class="memitem:ad0e78179ab979ae2bc4304bdc181db17" id="r_ad0e78179ab979ae2bc4304bdc181db17"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#ad0e78179ab979ae2bc4304bdc181db17">update</a> (int pos, T val)</td></tr>
<tr class="memdesc:ad0e78179ab979ae2bc4304bdc181db17"><td class="mdescLeft">&#160;</td><td class="mdescRight">Updates a value at a certain position. <br /></td></tr>
<tr class="separator:ad0e78179ab979ae2bc4304bdc181db17"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1c5331b509d9b55bedfadf979b30dd5b"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b">range_comb</a> (int l, int r)</td></tr>
<tr class="memitem:a1c5331b509d9b55bedfadf979b30dd5b" id="r_a1c5331b509d9b55bedfadf979b30dd5b"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a1c5331b509d9b55bedfadf979b30dd5b">range_comb</a> (int l, int r)</td></tr>
<tr class="memdesc:a1c5331b509d9b55bedfadf979b30dd5b"><td class="mdescLeft">&#160;</td><td class="mdescRight">Returns comb across all values between l and r. <br /></td></tr>
<tr class="separator:a1c5331b509d9b55bedfadf979b30dd5b"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a8d22286b7be3dcbb701ac5c7d9c79841"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841">comb</a> (T x, T y)</td></tr>
<tr class="memitem:a8d22286b7be3dcbb701ac5c7d9c79841" id="r_a8d22286b7be3dcbb701ac5c7d9c79841"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8d22286b7be3dcbb701ac5c7d9c79841">comb</a> (T x, T y)</td></tr>
<tr class="memdesc:a8d22286b7be3dcbb701ac5c7d9c79841"><td class="mdescLeft">&#160;</td><td class="mdescRight">Any associative function that combines x and y. <br /></td></tr>
<tr class="separator:a8d22286b7be3dcbb701ac5c7d9c79841"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6d3beccc936af2377c8eeb17067fd141"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141">mid</a> (int l, int r)</td></tr>
<tr class="memitem:a6d3beccc936af2377c8eeb17067fd141" id="r_a6d3beccc936af2377c8eeb17067fd141"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a6d3beccc936af2377c8eeb17067fd141">mid</a> (int l, int r)</td></tr>
<tr class="memdesc:a6d3beccc936af2377c8eeb17067fd141"><td class="mdescLeft">&#160;</td><td class="mdescRight">Gives the midpoint between two integers. <br /></td></tr>
<tr class="separator:a6d3beccc936af2377c8eeb17067fd141"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2a04f1832c5ce86def50c3021b2ab6b1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a> (int i, int l, int r, int pos, T val)</td></tr>
<tr class="memitem:a2a04f1832c5ce86def50c3021b2ab6b1" id="r_a2a04f1832c5ce86def50c3021b2ab6b1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a2a04f1832c5ce86def50c3021b2ab6b1">update</a> (int i, int l, int r, int pos, T val)</td></tr>
<tr class="memdesc:a2a04f1832c5ce86def50c3021b2ab6b1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Helper method for update method below. <br /></td></tr>
<tr class="separator:a2a04f1832c5ce86def50c3021b2ab6b1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8fecc48e8e3f6f5f6e728495a4282e52"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a> (int i, int l, int r, int tl, int tr)</td></tr>
<tr class="memitem:a8fecc48e8e3f6f5f6e728495a4282e52" id="r_a8fecc48e8e3f6f5f6e728495a4282e52"><td class="memItemLeft" align="right" valign="top">T&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html#a8fecc48e8e3f6f5f6e728495a4282e52">range_comb</a> (int i, int l, int r, int tl, int tr)</td></tr>
<tr class="memdesc:a8fecc48e8e3f6f5f6e728495a4282e52"><td class="mdescLeft">&#160;</td><td class="mdescRight">Helper method for range_comb method below. <br /></td></tr>
<tr class="separator:a8fecc48e8e3f6f5f6e728495a4282e52"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:a10ffa5fc03c66170f0bc2592b843baa3"><td class="memItemLeft" align="right" valign="top"><a id="a10ffa5fc03c66170f0bc2592b843baa3" name="a10ffa5fc03c66170f0bc2592b843baa3"></a>
<tr class="memitem:a10ffa5fc03c66170f0bc2592b843baa3" id="r_a10ffa5fc03c66170f0bc2592b843baa3"><td class="memItemLeft" align="right" valign="top"><a id="a10ffa5fc03c66170f0bc2592b843baa3" name="a10ffa5fc03c66170f0bc2592b843baa3"></a>
const T&#160;</td><td class="memItemRight" valign="bottom"><b>ID</b> = 0</td></tr>
<tr class="memdesc:a10ffa5fc03c66170f0bc2592b843baa3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Comb(ID, x) = x. <br /></td></tr>
<tr class="separator:a10ffa5fc03c66170f0bc2592b843baa3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a735d072a603f3abb7c03818440575258"><td class="memItemLeft" align="right" valign="top"><a id="a735d072a603f3abb7c03818440575258" name="a735d072a603f3abb7c03818440575258"></a>
<tr class="memitem:a735d072a603f3abb7c03818440575258" id="r_a735d072a603f3abb7c03818440575258"><td class="memItemLeft" align="right" valign="top"><a id="a735d072a603f3abb7c03818440575258" name="a735d072a603f3abb7c03818440575258"></a>
<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><b>t</b></td></tr>
<tr class="memdesc:a735d072a603f3abb7c03818440575258"><td class="mdescLeft">&#160;</td><td class="mdescRight">Vector to represent the tree. <br /></td></tr>
<tr class="separator:a735d072a603f3abb7c03818440575258"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a167fd91b68048e49e97859a8947690f3"><td class="memItemLeft" align="right" valign="top"><a id="a167fd91b68048e49e97859a8947690f3" name="a167fd91b68048e49e97859a8947690f3"></a>
<tr class="memitem:a167fd91b68048e49e97859a8947690f3" id="r_a167fd91b68048e49e97859a8947690f3"><td class="memItemLeft" align="right" valign="top"><a id="a167fd91b68048e49e97859a8947690f3" name="a167fd91b68048e49e97859a8947690f3"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>size</b> = 0</td></tr>
<tr class="memdesc:a167fd91b68048e49e97859a8947690f3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Number of elements available for querying in the tree. <br /></td></tr>
<tr class="separator:a167fd91b68048e49e97859a8947690f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -584,7 +584,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"><a class="el" href="../../dd/d95/classdata__structures_1_1_segment_tree.html">SegmentTree</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.7 </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.8 </li>
</ul>
</div>
</body>