mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 04:18:34 +08:00
365 lines
51 KiB
HTML
365 lines
51 KiB
HTML
<!-- 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++: range_queries/persistent_seg_tree_lazy_prop.cpp Source File</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"> 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('d5/d58/persistent__seg__tree__lazy__prop_8cpp_source.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">persistent_seg_tree_lazy_prop.cpp</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <iostream></span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <memory></span> </div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="preprocessor">#include <vector></span> </div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../dd/d69/namespacerange__queries.html">range_queries</a> {</div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span></div>
|
|
<div class="foldopen" id="foldopen00039" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html"> 39</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> {</div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">private</span>:</div>
|
|
<div class="foldopen" id="foldopen00041" data-start="{" data-end="};">
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html"> 41</a></span> <span class="keyword">class </span><a class="code hl_class" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a> {</div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> std::shared_ptr<Node> left = <span class="keyword">nullptr</span>; </div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"><a class="line" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088"> 44</a></span> std::shared_ptr<Node> <a class="code hl_variable" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088">right</a> = <span class="keyword">nullptr</span>; </div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"><a class="line" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf"> 45</a></span> int64_t <a class="code hl_variable" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf">val</a> = 0,</div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> prop = 0; </div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> };</div>
|
|
</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> </div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> uint32_t n = 0; </div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> std::vector<std::shared_ptr<Node>></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5"> 54</a></span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>{}; </div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3"> 57</a></span> std::vector<int64_t> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>{}; </div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span></div>
|
|
<div class="foldopen" id="foldopen00065" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817"> 65</a></span> std::shared_ptr<Node> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(std::shared_ptr<Node> <span class="keyword">const</span> &curr) {</div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">auto</span> newNode = std::make_shared<Node>(<a class="code hl_class" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>());</div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> newNode->left = curr->left;</div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> newNode->right = curr->right;</div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> newNode->prop = curr->prop;</div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> newNode->val = curr->val;</div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keywordflow">return</span> newNode;</div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span></div>
|
|
<div class="foldopen" id="foldopen00083" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79"> 83</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(<span class="keyword">const</span> uint32_t &i, <span class="keyword">const</span> uint32_t &j,</div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> std::shared_ptr<Node> <span class="keyword">const</span> &curr) {</div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="keywordflow">if</span> (!curr->prop) {</div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> }</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> curr->val += (j - i + 1) * curr->prop;</div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keywordflow">if</span> (i != j) {</div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> curr->left = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr->left);</div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> curr->right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr->right);</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> curr->left->prop += curr->prop;</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> curr->right->prop += curr->prop;</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> }</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> curr->prop = 0;</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span></div>
|
|
<div class="foldopen" id="foldopen00106" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4"> 106</a></span> std::shared_ptr<Node> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(<span class="keyword">const</span> uint32_t &i, <span class="keyword">const</span> uint32_t &j) {</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">auto</span> newNode = std::make_shared<Node>(<a class="code hl_class" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>());</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> <span class="keywordflow">if</span> (i == j) {</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> newNode->val = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>[i];</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> uint32_t mid = i + (j - i) / 2;</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keyword">auto</span> leftt = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(i, mid);</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keyword">auto</span> right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(mid + 1, j);</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> newNode->val = leftt->val + right->val;</div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> newNode->left = leftt;</div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> newNode->right = right;</div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> }</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">return</span> newNode;</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span></div>
|
|
<div class="foldopen" id="foldopen00135" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6"> 135</a></span> std::shared_ptr<Node> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(<span class="keyword">const</span> uint32_t &i, <span class="keyword">const</span> uint32_t &j,</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keyword">const</span> uint32_t &l, <span class="keyword">const</span> uint32_t &r,</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keyword">const</span> int64_t &value,</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> std::shared_ptr<Node> <span class="keyword">const</span> &curr) {</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="keywordflow">if</span> (i >= l && j <= r) {</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> std::shared_ptr<Node> newNode = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">newKid</a>(curr);</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> newNode->prop += value;</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, newNode);</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="keywordflow">return</span> newNode;</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> }</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordflow">if</span> (i > r || j < l) {</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">return</span> curr;</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> }</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <span class="keyword">auto</span> newNode = std::make_shared<Node>(<a class="code hl_class" href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">Node</a>());</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> uint32_t mid = i + (j - i) / 2;</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> newNode->left = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(i, mid, l, r, value, curr->left);</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> newNode->right = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(mid + 1, j, l, r, value, curr->right);</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> newNode->val = newNode->left->val + newNode->right->val;</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordflow">return</span> newNode;</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span></div>
|
|
<div class="foldopen" id="foldopen00171" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4"> 171</a></span> int64_t <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(<span class="keyword">const</span> uint32_t &i, <span class="keyword">const</span> uint32_t &j, <span class="keyword">const</span> uint32_t &l,</div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="keyword">const</span> uint32_t &r, std::shared_ptr<Node> <span class="keyword">const</span> &curr) {</div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">lazy</a>(i, j, curr);</div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="keywordflow">if</span> (j < l || r < i) {</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> }</div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordflow">if</span> (i >= l && j <= r) {</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keywordflow">return</span> curr->val;</div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> }</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> uint32_t mid = i + (j - i) / 2;</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, mid, l, r, curr->left) +</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(mid + 1, j, l, r, curr->right);</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="keyword">public</span>:</div>
|
|
<div class="foldopen" id="foldopen00197" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3"> 197</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">construct</a>(<span class="keyword">const</span> std::vector<int64_t></div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> &<a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>) <span class="comment">// the segment tree will be built from the values</span></div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// in "vec", "vec" is 0 indexed</span></div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> {</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.empty()) {</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> }</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> n = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>.size();</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> this->vec = <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">vec</a>;</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="keyword">auto</span> root = <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(0, n - 1);</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.push_back(root);</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span></div>
|
|
<div class="foldopen" id="foldopen00219" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d"> 219</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d">update</a>(<span class="keyword">const</span> uint32_t &l, <span class="keyword">const</span> uint32_t &r,</div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keyword">const</span> int64_t</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> &value) <span class="comment">// all elements from index "l" to index "r" would</span></div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// by updated by "value", "l" and "r" are 0 indexed</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> {</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.push_back(<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(</div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> 0, n - 1, l, r, value,</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[<a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.size() -</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> 1])); <span class="comment">// saving the root pointer to the new segment tree</span></div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span></div>
|
|
<div class="foldopen" id="foldopen00241" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571"> 241</a></span> int64_t <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571">query</a>(</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keyword">const</span> uint32_t &l, <span class="keyword">const</span> uint32_t &r,</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="keyword">const</span> uint32_t</div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> &version) <span class="comment">// querying the range from "l" to "r" in a segment tree</span></div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// after "version" updates, "l" and "r" are 0 indexed</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> {</div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(0, n - 1, l, r, <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>[version]);</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span></div>
|
|
<div class="foldopen" id="foldopen00255" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"><a class="line" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865"> 255</a></span> uint32_t <a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">size</a>() <span class="comment">// returns the number of segment trees (versions) , the</span></div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// number of updates done so far = returned value - 1</span></div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// ,because one of the trees is the original segment tree</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> {</div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">ptrs</a>.size();</div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span>};</div>
|
|
</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span>} <span class="comment">// namespace range_queries</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span></div>
|
|
<div class="foldopen" id="foldopen00268" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"><a class="line" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d"> 268</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>() {</div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> std::vector<int64_t> arr = {-5, 2, 3, 11, -2, 7, 0, 1};</div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <a class="code hl_class" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">range_queries::perSegTree</a> tree;</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> std::cout << <span class="stringliteral">"Elements before any updates are {"</span>;</div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keywordflow">for</span> (uint32_t i = 0; i < arr.size(); ++i) {</div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> std::cout << arr[i];</div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> std::cout << <span class="stringliteral">","</span>;</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> }</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> }</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> std::cout << <span class="stringliteral">"}\n"</span>;</div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">construct</a>(</div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> arr); <span class="comment">// constructing the original segment tree (version = 0)</span></div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> std::cout << <span class="stringliteral">"Querying range sum on version 0 from index 2 to 4 = 3+11-2 = "</span></div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> << tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(2, 4, 0) << <span class="charliteral">'\n'</span>;</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> std::cout</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> << <span class="stringliteral">"Subtract 7 from all elements from index 1 to index 5 inclusive\n"</span>;</div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(1, 5, -7); <span class="comment">// subtracting 7 from index 1 to index 5</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> std::cout << <span class="stringliteral">"Elements of the segment tree whose version = 1 (after 1 "</span></div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="stringliteral">"update) are {"</span>;</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> <span class="keywordflow">for</span> (uint32_t i = 0; i < arr.size(); ++i) {</div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> std::cout << tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, i, 1);</div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> std::cout << <span class="stringliteral">","</span>;</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> }</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> }</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> std::cout << <span class="stringliteral">"}\n"</span>;</div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> std::cout << <span class="stringliteral">"Add 10 to all elements from index 0 to index 7 inclusive\n"</span>;</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">update</a>(0, 7, 10); <span class="comment">// adding 10 to all elements</span></div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> std::cout << <span class="stringliteral">"Elements of the segment tree whose version = 2 (after 2 "</span></div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> <span class="stringliteral">"updates) are {"</span>;</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <span class="keywordflow">for</span> (uint32_t i = 0; i < arr.size(); ++i) {</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> std::cout << tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(i, i, 2);</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> <span class="keywordflow">if</span> (i != arr.size() - 1) {</div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> std::cout << <span class="stringliteral">","</span>;</div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> }</div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> }</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> std::cout << <span class="stringliteral">"}\n"</span>;</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> std::cout << <span class="stringliteral">"Number of segment trees (versions) now = "</span> << tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">size</a>()</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> << <span class="charliteral">'\n'</span>;</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> std::cout << <span class="stringliteral">"Querying range sum on version 0 from index 3 to 5 = 11-2+7 = "</span></div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> << tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(3, 5, 0) << <span class="charliteral">'\n'</span>;</div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> std::cout << <span class="stringliteral">"Querying range sum on version 1 from index 3 to 5 = 4-9+0 = "</span></div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> << tree.<a class="code hl_function" href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">query</a>(3, 5, 1) << <span class="charliteral">'\n'</span>;</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span></div>
|
|
<div class="foldopen" id="foldopen00318" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"><a class="line" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 318</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> <a class="code hl_function" href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span>}</div>
|
|
</div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_1_1_node_html"><div class="ttname"><a href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">range_queries::perSegTree::Node</a></div><div class="ttdef"><b>Definition</b> <a href="#l00041">persistent_seg_tree_lazy_prop.cpp:41</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_1_1_node_html_a9adb4639a0797e94a3e556b6b902c088"><div class="ttname"><a href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088">range_queries::perSegTree::Node::right</a></div><div class="ttdeci">std::shared_ptr< Node > right</div><div class="ttdoc">pointer to the left node</div><div class="ttdef"><b>Definition</b> <a href="#l00044">persistent_seg_tree_lazy_prop.cpp:44</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_1_1_node_html_acc044f787c90b815773726d7fdfdaccf"><div class="ttname"><a href="../../d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#acc044f787c90b815773726d7fdfdaccf">range_queries::perSegTree::Node::val</a></div><div class="ttdeci">int64_t val</div><div class="ttdoc">pointer to the right node</div><div class="ttdef"><b>Definition</b> <a href="#l00045">persistent_seg_tree_lazy_prop.cpp:45</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html">range_queries::perSegTree</a></div><div class="ttdoc">Range query here is range sum, but the code can be modified to make different queries like range max ...</div><div class="ttdef"><b>Definition</b> <a href="#l00039">persistent_seg_tree_lazy_prop.cpp:39</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0cec4b77d264521717cf9b0482c45817"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0cec4b77d264521717cf9b0482c45817">range_queries::perSegTree::newKid</a></div><div class="ttdeci">std::shared_ptr< Node > newKid(std::shared_ptr< Node > const &curr)</div><div class="ttdoc">Creating a new node with the same values of curr node.</div><div class="ttdef"><b>Definition</b> <a href="#l00065">persistent_seg_tree_lazy_prop.cpp:65</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a0fe4e431f3e09c274ecd7d2d58dcb865"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a0fe4e431f3e09c274ecd7d2d58dcb865">range_queries::perSegTree::size</a></div><div class="ttdeci">uint32_t size()</div><div class="ttdoc">Getting the number of versions after updates so far which is equal to the size of the pointers vector...</div><div class="ttdef"><b>Definition</b> <a href="#l00255">persistent_seg_tree_lazy_prop.cpp:255</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a1eac9cf0613dfc8e2b0195009dd5c9d5"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a1eac9cf0613dfc8e2b0195009dd5c9d5">range_queries::perSegTree::ptrs</a></div><div class="ttdeci">std::vector< std::shared_ptr< Node > > ptrs</div><div class="ttdoc">number of elements/leaf nodes in the segment tree</div><div class="ttdef"><b>Definition</b> <a href="#l00054">persistent_seg_tree_lazy_prop.cpp:54</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a24487eda25123bc4d112e8430821a6c6"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a24487eda25123bc4d112e8430821a6c6">range_queries::perSegTree::update</a></div><div class="ttdeci">std::shared_ptr< Node > update(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, const int64_t &value, std::shared_ptr< Node > const &curr)</div><div class="ttdoc">Doing range update, checking at every node if it has some value to be propagated. All nodes affected ...</div><div class="ttdef"><b>Definition</b> <a href="#l00135">persistent_seg_tree_lazy_prop.cpp:135</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a6d3f2465a7c5803a1ff16c5378bcc5e4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a6d3f2465a7c5803a1ff16c5378bcc5e4">range_queries::perSegTree::construct</a></div><div class="ttdeci">std::shared_ptr< Node > construct(const uint32_t &i, const uint32_t &j)</div><div class="ttdoc">Constructing the segment tree with the early passed vector. Every call creates a node to hold the sum...</div><div class="ttdef"><b>Definition</b> <a href="#l00106">persistent_seg_tree_lazy_prop.cpp:106</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_a8ff495d2f389b4aaa54449c26c6078f3"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#a8ff495d2f389b4aaa54449c26c6078f3">range_queries::perSegTree::vec</a></div><div class="ttdeci">std::vector< int64_t > vec</div><div class="ttdef"><b>Definition</b> <a href="#l00057">persistent_seg_tree_lazy_prop.cpp:57</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ac83bcabf5a8db8b0d8d156a4c1bcd4c3"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ac83bcabf5a8db8b0d8d156a4c1bcd4c3">range_queries::perSegTree::construct</a></div><div class="ttdeci">void construct(const std::vector< int64_t > &vec)</div><div class="ttdoc">Constructing the segment tree with the values in the passed vector. Returned root pointer is pushed i...</div><div class="ttdef"><b>Definition</b> <a href="#l00197">persistent_seg_tree_lazy_prop.cpp:197</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ace7f57935b3bb9446f11c239fd89ae79"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ace7f57935b3bb9446f11c239fd89ae79">range_queries::perSegTree::lazy</a></div><div class="ttdeci">void lazy(const uint32_t &i, const uint32_t &j, std::shared_ptr< Node > const &curr)</div><div class="ttdoc">If there is some value to be propagated to the passed node, value is added to the node and the childr...</div><div class="ttdef"><b>Definition</b> <a href="#l00083">persistent_seg_tree_lazy_prop.cpp:83</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ad484002bcb701820d55f32ea5d525571"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ad484002bcb701820d55f32ea5d525571">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &l, const uint32_t &r, const uint32_t &version)</div><div class="ttdoc">Querying the range from index l to index r, getting the sum of the elements whose index x satisfies l...</div><div class="ttdef"><b>Definition</b> <a href="#l00241">persistent_seg_tree_lazy_prop.cpp:241</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_ae8ae4b1835e5e8aec32f68c5059ed4d4"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#ae8ae4b1835e5e8aec32f68c5059ed4d4">range_queries::perSegTree::query</a></div><div class="ttdeci">int64_t query(const uint32_t &i, const uint32_t &j, const uint32_t &l, const uint32_t &r, std::shared_ptr< Node > const &curr)</div><div class="ttdoc">Querying the range from index l to index r, checking at every node if it has some value to be propaga...</div><div class="ttdef"><b>Definition</b> <a href="#l00171">persistent_seg_tree_lazy_prop.cpp:171</a></div></div>
|
|
<div class="ttc" id="aclassrange__queries_1_1per_seg_tree_html_af87494e6cf012d28c4f5b9d1c15f9c5d"><div class="ttname"><a href="../../d8/d28/classrange__queries_1_1per_seg_tree.html#af87494e6cf012d28c4f5b9d1c15f9c5d">range_queries::perSegTree::update</a></div><div class="ttdeci">void update(const uint32_t &l, const uint32_t &r, const int64_t &value)</div><div class="ttdoc">Doing range update by passing the left and right indexes of the range as well as the value to be adde...</div><div class="ttdef"><b>Definition</b> <a href="#l00219">persistent_seg_tree_lazy_prop.cpp:219</a></div></div>
|
|
<div class="ttc" id="anamespacerange__queries_html"><div class="ttname"><a href="../../dd/d69/namespacerange__queries.html">range_queries</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../d6/d2e/fenwick__tree_8cpp_source.html#l00028">fenwick_tree.cpp:28</a></div></div>
|
|
<div class="ttc" id="apersistent__seg__tree__lazy__prop_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test implementations.</div><div class="ttdef"><b>Definition</b> <a href="#l00268">persistent_seg_tree_lazy_prop.cpp:268</a></div></div>
|
|
<div class="ttc" id="apersistent__seg__tree__lazy__prop_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00318">persistent_seg_tree_lazy_prop.cpp:318</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../dir_074119ce3a874b57120c49a0cc4bb5ad.html">range_queries</a></li><li class="navelem"><a href="../../d5/d58/persistent__seg__tree__lazy__prop_8cpp.html">persistent_seg_tree_lazy_prop.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>
|