always-cautious/ortools-clone
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
1eec259105fa2b88f4cb2d04d054140b8a44c8da
ortools-clone/docs/cpp/theta__tree_8cc_source.html
Mizux Seiha 17edcf0e25 Update doc
2021-09-30 01:28:18 +02:00

435 lines
66 KiB
HTML
Raw Blame History

<!-- HTML header for doxygen 1.8.18-->
<!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">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>OR-Tools: theta_tree.cc Source File</title>
<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>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.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>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="styleSheet.tmp.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 style="height: 56px;">
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">OR-Tools
&#160;<span id="projectnumber">9.1</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</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">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('theta__tree_8cc_source.html',''); initResizable(); });
/* @license-end */
</script>
<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">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle"><div class="title">theta_tree.cc</div></div>
</div><!--header-->
<div class="contents">
<a href="theta__tree_8cc.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><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the &quot;License&quot;);</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an &quot;AS IS&quot; BASIS,</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="preprocessor">#include &quot;<a class="code" href="theta__tree_8h.html">ortools/sat/theta_tree.h</a>&quot;</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span> </div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="preprocessor">#include &lt;algorithm&gt;</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include &lt;cstdint&gt;</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include &lt;memory&gt;</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> </div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#include &quot;<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>&quot;</span></div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">namespace </span>sat {</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac07cd2352d92040e62a235df35329a23"> 26</a></span><a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac07cd2352d92040e62a235df35329a23">ThetaLambdaTree&lt;IntegerType&gt;::ThetaLambdaTree</a>() {}</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="keyword">typename</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">ThetaLambdaTree&lt;IntegerType&gt;::TreeNode</a></div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">ThetaLambdaTree&lt;IntegerType&gt;::ComposeTreeNodes</a>(TreeNode left, TreeNode right) {</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> <span class="keywordflow">return</span> {<a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(right.envelope, left.envelope + right.sum_of_energy_min),</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(right.envelope_opt,</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> right.sum_of_energy_min +</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(left.envelope_opt,</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> left.envelope + right.max_of_energy_delta)),</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> left.sum_of_energy_min + right.sum_of_energy_min,</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(right.max_of_energy_delta, left.max_of_energy_delta)};</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span>}</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d"> 41</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">ThetaLambdaTree&lt;IntegerType&gt;::Reset</a>(<span class="keywordtype">int</span> num_events) {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="preprocessor">#ifndef NDEBUG</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> leaf_nodes_have_delayed_operations_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="comment">// Because the algorithm needs to access a node sibling (i.e. node_index ^ 1),</span></div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="comment">// our tree will always have an even number of leaves, just large enough to</span></div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> <span class="comment">// fit our number of events. And at least 2 for the empty tree case.</span></div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> num_events_ = num_events;</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> num_leaves_ = <a class="code hl_variable" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(2, num_events + (num_events &amp; 1));</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> </div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = 2 * num_leaves_;</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> tree_.assign(num_nodes, TreeNode{IntegerTypeMinimumValue&lt;IntegerType&gt;(),</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> IntegerTypeMinimumValue&lt;IntegerType&gt;(),</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> IntegerType{0}, IntegerType{0}});</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> </div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// If num_leaves is not a power or two, the last depth of the tree will not be</span></div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// full, and the array will look like:</span></div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// [( num_leafs parents)(leaves at depth d - 1)(leaves at depth d)</span></div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// The first leaves at depth p will have power_of_two_ as index.</span></div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">for</span> (power_of_two_ = 2; power_of_two_ &lt; num_leaves_; power_of_two_ &lt;&lt;= 1) {</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> }</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span>}</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> </div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="keywordtype">int</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">ThetaLambdaTree&lt;IntegerType&gt;::GetLeafFromEvent</a>(<span class="keywordtype">int</span> event)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, event);</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(event, num_events_);</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// Keeping the ordering of events is important, so the first set of events</span></div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// must be mapped to the set of leaves at depth d, and the second set of</span></div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// events must be mapped to the set of leaves at depth d-1.</span></div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="keyword">const</span> <span class="keywordtype">int</span> r = power_of_two_ + event;</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">return</span> r &lt; 2 * num_leaves_ ? r : r - num_leaves_;</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span>}</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="keywordtype">int</span> ThetaLambdaTree&lt;IntegerType&gt;::GetEventFromLeaf(<span class="keywordtype">int</span> leaf)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <a class="code hl_define" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(leaf, num_leaves_);</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(leaf, 2 * num_leaves_);</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="keyword">const</span> <span class="keywordtype">int</span> r = leaf - power_of_two_;</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">return</span> r &gt;= 0 ? r : r + num_leaves_;</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span>}</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> </div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a11a9dd6adaf582bd893a5b228bdf3dd8"> 84</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a11a9dd6adaf582bd893a5b228bdf3dd8">ThetaLambdaTree&lt;IntegerType&gt;::RecomputeTreeForDelayedOperations</a>() {</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="preprocessor">#ifndef NDEBUG</span></div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> leaf_nodes_have_delayed_operations_ = <span class="keyword">false</span>;</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// Only recompute internal nodes.</span></div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">const</span> <span class="keywordtype">int</span> last_internal_node = tree_.size() / 2 - 1;</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = last_internal_node; node &gt;= 1; --node) {</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keyword">const</span> <span class="keywordtype">int</span> right = 2 * node + 1;</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">const</span> <span class="keywordtype">int</span> left = 2 * node;</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> tree_[node] = ComposeTreeNodes(tree_[left], tree_[right]);</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>}</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> </div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ab5f279bbc9d594b39b40912b08b67dc1"> 98</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ab5f279bbc9d594b39b40912b08b67dc1">ThetaLambdaTree&lt;IntegerType&gt;::DelayedAddOrUpdateEvent</a>(</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordtype">int</span> event, IntegerType initial_envelope, IntegerType energy_min,</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> IntegerType energy_max) {</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="preprocessor">#ifndef NDEBUG</span></div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> leaf_nodes_have_delayed_operations_ = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, energy_min);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(energy_min, energy_max);</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = GetLeafFromEvent(event);</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> tree_[node] = {initial_envelope + energy_min, initial_envelope + energy_max,</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> energy_min, energy_max - energy_min};</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span>}</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> </div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f"> 112</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">ThetaLambdaTree&lt;IntegerType&gt;::AddOrUpdateEvent</a>(</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordtype">int</span> event, IntegerType initial_envelope, IntegerType energy_min,</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> IntegerType energy_max) {</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, energy_min);</div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(energy_min, energy_max);</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = GetLeafFromEvent(event);</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> tree_[node] = {initial_envelope + energy_min, initial_envelope + energy_max,</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> energy_min, energy_max - energy_min};</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> RefreshNode(node);</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span>}</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> </div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557"> 125</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">ThetaLambdaTree&lt;IntegerType&gt;::AddOrUpdateOptionalEvent</a>(</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordtype">int</span> event, IntegerType initial_envelope_opt, IntegerType energy_max) {</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, energy_max);</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = GetLeafFromEvent(event);</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> tree_[node] = {IntegerTypeMinimumValue&lt;IntegerType&gt;(),</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> initial_envelope_opt + energy_max, IntegerType{0}, energy_max};</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> RefreshNode(node);</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span>}</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> </div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac820a181e85984e2506c7de209fe6e44"> 136</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac820a181e85984e2506c7de209fe6e44">ThetaLambdaTree&lt;IntegerType&gt;::DelayedAddOrUpdateOptionalEvent</a>(</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordtype">int</span> event, IntegerType initial_envelope_opt, IntegerType energy_max) {</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><span class="preprocessor">#ifndef NDEBUG</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> leaf_nodes_have_delayed_operations_ = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <a class="code hl_define" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, energy_max);</div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = GetLeafFromEvent(event);</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> tree_[node] = {IntegerTypeMinimumValue&lt;IntegerType&gt;(),</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> initial_envelope_opt + energy_max, IntegerType{0}, energy_max};</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> </div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8"> 148</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">ThetaLambdaTree&lt;IntegerType&gt;::RemoveEvent</a>(<span class="keywordtype">int</span> event) {</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = GetLeafFromEvent(event);</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> tree_[node] = {IntegerTypeMinimumValue&lt;IntegerType&gt;(),</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> IntegerTypeMinimumValue&lt;IntegerType&gt;(), IntegerType{0},</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> IntegerType{0}};</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> RefreshNode(node);</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span>}</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#aefbee6ed76e3986fe9265e49be71a3c7"> 158</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#aefbee6ed76e3986fe9265e49be71a3c7">ThetaLambdaTree&lt;IntegerType&gt;::DelayedRemoveEvent</a>(<span class="keywordtype">int</span> event) {</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span><span class="preprocessor">#ifndef NDEBUG</span></div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> leaf_nodes_have_delayed_operations_ = <span class="keyword">true</span>;</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span><span class="preprocessor">#endif</span></div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="keyword">const</span> <span class="keywordtype">int</span> node = GetLeafFromEvent(event);</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> tree_[node] = {IntegerTypeMinimumValue&lt;IntegerType&gt;(),</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> IntegerTypeMinimumValue&lt;IntegerType&gt;(), IntegerType{0},</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> IntegerType{0}};</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span>}</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> </div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093"> 169</a></span>IntegerType <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">ThetaLambdaTree&lt;IntegerType&gt;::GetEnvelope</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> <span class="keywordflow">return</span> tree_[1].envelope;</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span>}</div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35"> 174</a></span>IntegerType <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">ThetaLambdaTree&lt;IntegerType&gt;::GetOptionalEnvelope</a>()<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="keywordflow">return</span> tree_[1].envelope_opt;</div>
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span>}</div>
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a75c0a813b413b5718813636f2120a790"> 180</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a75c0a813b413b5718813636f2120a790">ThetaLambdaTree&lt;IntegerType&gt;::GetMaxEventWithEnvelopeGreaterThan</a>(</div>
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> IntegerType target_envelope)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(target_envelope, tree_[1].envelope);</div>
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> IntegerType unused;</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordflow">return</span> GetEventFromLeaf(</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> GetMaxLeafWithEnvelopeGreaterThan(1, target_envelope, &amp;unused));</div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span>}</div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> </div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979"> 190</a></span><span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">ThetaLambdaTree&lt;IntegerType&gt;::GetEventsWithOptionalEnvelopeGreaterThan</a>(</div>
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> IntegerType target_envelope, <span class="keywordtype">int</span>* critical_event, <span class="keywordtype">int</span>* optional_event,</div>
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> IntegerType* available_energy)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="keywordtype">int</span> critical_leaf;</div>
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="keywordtype">int</span> optional_leaf;</div>
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> GetLeavesWithOptionalEnvelopeGreaterThan(target_envelope, &amp;critical_leaf,</div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> &amp;optional_leaf, available_energy);</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> *critical_event = GetEventFromLeaf(critical_leaf);</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> *optional_event = GetEventFromLeaf(optional_leaf);</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> </div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0718fcbb3200da053b8df062e6711d48"> 203</a></span>IntegerType <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0718fcbb3200da053b8df062e6711d48">ThetaLambdaTree&lt;IntegerType&gt;::GetEnvelopeOf</a>(<span class="keywordtype">int</span> event)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="keyword">const</span> <span class="keywordtype">int</span> leaf = GetLeafFromEvent(event);</div>
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> IntegerType envelope = tree_[leaf].envelope;</div>
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> node = leaf; node &gt; 1; node &gt;&gt;= 1) {</div>
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> <span class="keyword">const</span> <span class="keywordtype">int</span> right = node | 1;</div>
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="keywordflow">if</span> (node != right) envelope += tree_[right].sum_of_energy_min;</div>
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> }</div>
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="keywordflow">return</span> envelope;</div>
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span>}</div>
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> </div>
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span><span class="keywordtype">void</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">ThetaLambdaTree&lt;IntegerType&gt;::RefreshNode</a>(<span class="keywordtype">int</span> node) {</div>
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keywordflow">do</span> {</div>
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keyword">const</span> <span class="keywordtype">int</span> right = node | 1;</div>
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="keyword">const</span> <span class="keywordtype">int</span> left = right ^ 1;</div>
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> node &gt;&gt;= 1;</div>
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> tree_[node] = ComposeTreeNodes(tree_[left], tree_[right]);</div>
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> } <span class="keywordflow">while</span> (node &gt; 1);</div>
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</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><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span><span class="keywordtype">int</span> ThetaLambdaTree&lt;IntegerType&gt;::GetMaxLeafWithEnvelopeGreaterThan(</div>
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keywordtype">int</span> node, IntegerType target_envelope, IntegerType* extra)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(target_envelope, tree_[node].envelope);</div>
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keywordflow">while</span> (node &lt; num_leaves_) {</div>
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keyword">const</span> <span class="keywordtype">int</span> left = node &lt;&lt; 1;</div>
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keyword">const</span> <span class="keywordtype">int</span> right = left | 1;</div>
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(right, tree_.size());</div>
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> </div>
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keywordflow">if</span> (target_envelope &lt; tree_[right].envelope) {</div>
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> node = right;</div>
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> target_envelope -= tree_[right].sum_of_energy_min;</div>
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> node = left;</div>
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> }</div>
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</div>
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> *extra = tree_[node].envelope - target_envelope;</div>
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keywordflow">return</span> node;</div>
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span>}</div>
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> </div>
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span><span class="keywordtype">int</span> ThetaLambdaTree&lt;IntegerType&gt;::GetLeafWithMaxEnergyDelta(<span class="keywordtype">int</span> node)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keyword">const</span> IntegerType delta_node = tree_[node].max_of_energy_delta;</div>
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> <span class="keywordflow">while</span> (node &lt; num_leaves_) {</div>
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="keyword">const</span> <span class="keywordtype">int</span> left = node &lt;&lt; 1;</div>
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="keyword">const</span> <span class="keywordtype">int</span> right = left | 1;</div>
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(right, tree_.size());</div>
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keywordflow">if</span> (tree_[right].max_of_energy_delta == delta_node) {</div>
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> node = right;</div>
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> <a class="code hl_define" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(tree_[left].max_of_energy_delta, delta_node);</div>
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> node = left;</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> }</div>
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordflow">return</span> node;</div>
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span>}</div>
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> </div>
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span><span class="keyword">template</span> &lt;<span class="keyword">typename</span> IntegerType&gt;</div>
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span><span class="keywordtype">void</span> ThetaLambdaTree&lt;IntegerType&gt;::GetLeavesWithOptionalEnvelopeGreaterThan(</div>
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> IntegerType target_envelope, <span class="keywordtype">int</span>* critical_leaf, <span class="keywordtype">int</span>* optional_leaf,</div>
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> IntegerType* available_energy)<span class="keyword"> const </span>{</div>
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <a class="code hl_define" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!leaf_nodes_have_delayed_operations_);</div>
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(target_envelope, tree_[1].envelope_opt);</div>
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="keywordtype">int</span> node = 1;</div>
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="keywordflow">while</span> (node &lt; num_leaves_) {</div>
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> <span class="keyword">const</span> <span class="keywordtype">int</span> left = node &lt;&lt; 1;</div>
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="keyword">const</span> <span class="keywordtype">int</span> right = left | 1;</div>
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <a class="code hl_define" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(right, tree_.size());</div>
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> </div>
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keywordflow">if</span> (target_envelope &lt; tree_[right].envelope_opt) {</div>
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> node = right;</div>
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="keyword">const</span> IntegerType opt_energy_right =</div>
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> tree_[right].sum_of_energy_min + tree_[right].max_of_energy_delta;</div>
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordflow">if</span> (target_envelope &lt; tree_[left].envelope + opt_energy_right) {</div>
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> *optional_leaf = GetLeafWithMaxEnergyDelta(right);</div>
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> IntegerType extra;</div>
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> *critical_leaf = GetMaxLeafWithEnvelopeGreaterThan(</div>
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> left, target_envelope - opt_energy_right, &amp;extra);</div>
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> *available_energy = tree_[*optional_leaf].sum_of_energy_min +</div>
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> tree_[*optional_leaf].max_of_energy_delta - extra;</div>
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordflow">return</span>;</div>
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> } <span class="keywordflow">else</span> { <span class="comment">// &lt; tree_[left].envelope_opt + tree_[right].sum_of_energy_min</span></div>
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> target_envelope -= tree_[right].sum_of_energy_min;</div>
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> node = left;</div>
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</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> *critical_leaf = node;</div>
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> *optional_leaf = node;</div>
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> *available_energy = target_envelope - (tree_[node].envelope_opt -</div>
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> tree_[node].sum_of_energy_min -</div>
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> tree_[node].max_of_energy_delta);</div>
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span>}</div>
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> </div>
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span><span class="keyword">template</span> <span class="keyword">class </span>ThetaLambdaTree&lt;IntegerValue&gt;;</div>
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span><span class="keyword">template</span> <span class="keyword">class </span>ThetaLambdaTree&lt;int64_t&gt;;</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>} <span class="comment">// namespace sat</span></div>
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span>} <span class="comment">// namespace operations_research</span></div>
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00886">base/logging.h:886</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">operations_research::sat::ThetaLambdaTree</a></div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8h_source.html#l00104">theta_tree.h:104</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a0718fcbb3200da053b8df062e6711d48"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0718fcbb3200da053b8df062e6711d48">operations_research::sat::ThetaLambdaTree::GetEnvelopeOf</a></div><div class="ttdeci">IntegerType GetEnvelopeOf(int event) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00203">theta_tree.cc:203</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a0cd86cea355b2b1f70e5494fdce82979"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">operations_research::sat::ThetaLambdaTree::GetEventsWithOptionalEnvelopeGreaterThan</a></div><div class="ttdeci">void GetEventsWithOptionalEnvelopeGreaterThan(IntegerType target_envelope, int *critical_event, int *optional_event, IntegerType *available_energy) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00190">theta_tree.cc:190</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a11a9dd6adaf582bd893a5b228bdf3dd8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a11a9dd6adaf582bd893a5b228bdf3dd8">operations_research::sat::ThetaLambdaTree::RecomputeTreeForDelayedOperations</a></div><div class="ttdeci">void RecomputeTreeForDelayedOperations()</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00084">theta_tree.cc:84</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a1c2fe501274ef60430486bba0842cd35"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">operations_research::sat::ThetaLambdaTree::GetOptionalEnvelope</a></div><div class="ttdeci">IntegerType GetOptionalEnvelope() const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00174">theta_tree.cc:174</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a1d04b14711a8d3bba829f1b0eb4dd4a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">operations_research::sat::ThetaLambdaTree::RemoveEvent</a></div><div class="ttdeci">void RemoveEvent(int event)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00148">theta_tree.cc:148</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a75c0a813b413b5718813636f2120a790"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a75c0a813b413b5718813636f2120a790">operations_research::sat::ThetaLambdaTree::GetMaxEventWithEnvelopeGreaterThan</a></div><div class="ttdeci">int GetMaxEventWithEnvelopeGreaterThan(IntegerType target_envelope) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00180">theta_tree.cc:180</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a7b4553842be2a65d82b3f40eed71744d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">operations_research::sat::ThetaLambdaTree::Reset</a></div><div class="ttdeci">void Reset(int num_events)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00041">theta_tree.cc:41</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a9045183839ce6286d80eb699209c1557"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">operations_research::sat::ThetaLambdaTree::AddOrUpdateOptionalEvent</a></div><div class="ttdeci">void AddOrUpdateOptionalEvent(int event, IntegerType initial_envelope_opt, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00125">theta_tree.cc:125</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_ab5f279bbc9d594b39b40912b08b67dc1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ab5f279bbc9d594b39b40912b08b67dc1">operations_research::sat::ThetaLambdaTree::DelayedAddOrUpdateEvent</a></div><div class="ttdeci">void DelayedAddOrUpdateEvent(int event, IntegerType initial_envelope, IntegerType energy_min, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00098">theta_tree.cc:98</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_ac07cd2352d92040e62a235df35329a23"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac07cd2352d92040e62a235df35329a23">operations_research::sat::ThetaLambdaTree::ThetaLambdaTree</a></div><div class="ttdeci">ThetaLambdaTree()</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00026">theta_tree.cc:26</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_ac820a181e85984e2506c7de209fe6e44"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac820a181e85984e2506c7de209fe6e44">operations_research::sat::ThetaLambdaTree::DelayedAddOrUpdateOptionalEvent</a></div><div class="ttdeci">void DelayedAddOrUpdateOptionalEvent(int event, IntegerType initial_envelope_opt, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00136">theta_tree.cc:136</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_ad812cddd43d03a817341c9875f4f6f4f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">operations_research::sat::ThetaLambdaTree::AddOrUpdateEvent</a></div><div class="ttdeci">void AddOrUpdateEvent(int event, IntegerType initial_envelope, IntegerType energy_min, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00112">theta_tree.cc:112</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_add1a42315d03f68191df32a019d82093"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">operations_research::sat::ThetaLambdaTree::GetEnvelope</a></div><div class="ttdeci">IntegerType GetEnvelope() const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00169">theta_tree.cc:169</a></div></div>
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_aefbee6ed76e3986fe9265e49be71a3c7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#aefbee6ed76e3986fe9265e49be71a3c7">operations_research::sat::ThetaLambdaTree::DelayedRemoveEvent</a></div><div class="ttdeci">void DelayedRemoveEvent(int event)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00158">theta_tree.cc:158</a></div></div>
<div class="ttc" id="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
<div class="ttc" id="atheta__tree_8h_html"><div class="ttname"><a href="theta__tree_8h.html">theta_tree.h</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- HTML footer for doxygen 1.8.18-->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="theta__tree_8cc.html">theta_tree.cc</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink