382 lines
57 KiB
HTML
382 lines
57 KiB
HTML
<!-- 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.h 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
|
|
 <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&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&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&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('theta__tree_8h_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.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="theta__tree_8h.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 "License");</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 "AS IS" 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">#ifndef OR_TOOLS_SAT_THETA_TREE_H_</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="preprocessor">#define OR_TOOLS_SAT_THETA_TREE_H_</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span><span class="preprocessor">#include <vector></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 "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span><span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="comment">// The Theta-Lambda tree can be used to implement several scheduling algorithms.</span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="comment">// This template class is instantiated only for IntegerValue and int64_t.</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="comment">// The tree structure itself is a binary tree coded in a vector, where node 0 is</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="comment">// unused, node 1 is the root, node 2 is the left child of the root, node 3 its</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="comment">// right child, etc.</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="comment">// The API gives access to rightmost events that realize a given envelope.</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="comment">// See:</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="comment">// _ (0) Petr Vilim's PhD thesis "Global Constraints in Scheduling".</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="comment">// _ (1) Petr Vilim "Edge Finding Filtering Algorithm for Discrete Cumulative</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="comment">// Resources in O(kn log n)"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="comment">// _ (2) Petr Vilim "Max energy filtering algorithm for discrete cumulative</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span><span class="comment">// resources".</span></div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="comment">// _ (3) Wolf & Schrader "O(n log n) Overload Checking for the Cumulative</span></div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="comment">// Constraint and Its Application".</span></div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span><span class="comment">// _ (4) Kameugne & Fotso "A cumulative not-first/not-last filtering algorithm</span></div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment">// in O(n^2 log n)".</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment">// _ (5) Ouellet & Quimper "Time-table extended-edge-finding for the cumulative</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment">// constraint".</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment">// Instead of providing one declination of the theta-tree per possible filtering</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span><span class="comment">// algorithm, this generalization intends to provide a data structure that can</span></div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span><span class="comment">// fit several algorithms.</span></div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span><span class="comment">// This tree is based around the notion of events. It has events at its leaves</span></div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="comment">// that can be present or absent, and present events come with an</span></div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span><span class="comment">// initial_envelope, a minimal and a maximal energy.</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span><span class="comment">// All nodes maintain values on the set of present events under them:</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span><span class="comment">// _ sum_energy_min(node) = sum_{leaf \in leaves(node)} energy_min(leaf)</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span><span class="comment">// _ envelope(node) =</span></div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span><span class="comment">// max_{leaf \in leaves(node)}</span></div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span><span class="comment">// initial_envelope(leaf) +</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span><span class="comment">// sum_{leaf' \in leaves(node), leaf' >= leaf} energy_min(leaf').</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span><span class="comment">// Thus, the envelope of a leaf representing an event, when present, is</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span><span class="comment">// initial_envelope(event) + sum_energy_min(event).</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span><span class="comment">// We also maintain envelope_opt with is the maximum envelope a node could take</span></div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span><span class="comment">// if at most one of the events were at its maximum energy.</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span><span class="comment">// _ energy_delta(leaf) = energy_max(leaf) - energy_min(leaf)</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span><span class="comment">// _ max_energy_delta(node) = max_{leaf \in leaves(node)} energy_delta(leaf)</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span><span class="comment">// _ envelope_opt(node) =</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span><span class="comment">// max_{leaf \in leaves(node)}</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span><span class="comment">// initial_envelope(leaf) +</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span><span class="comment">// sum_{leaf' \in leaves(node), leaf' >= leaf} energy_min(leaf') +</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span><span class="comment">// max_{leaf' \in leaves(node), leaf' >= leaf} energy_delta(leaf');</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span><span class="comment">// Most articles using theta-tree variants hack Vilim's original theta tree</span></div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span><span class="comment">// for the disjunctive resource constraint by manipulating envelope and</span></div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span><span class="comment">// energy:</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span><span class="comment">// _ in (0), initial_envelope = start_min, energy = duration</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span><span class="comment">// _ in (3), initial_envelope = C * start_min, energy = demand * duration</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span><span class="comment">// _ in (5), there are several trees in parallel:</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span><span class="comment">// initial_envelope = C * start_min or (C - h) * start_min</span></div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span><span class="comment">// energy = demand * duration, h * (Horizon - start_min),</span></div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span><span class="comment">// or h * (end_min).</span></div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span><span class="comment">// _ in (2), same as (3), but putting the max energy instead of min in lambda.</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span><span class="comment">// _ in OscaR's TimeTableOverloadChecker,</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span><span class="comment">// initial_envelope = C * start_min -</span></div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span><span class="comment">// energy of mandatory profile before start_min,</span></div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span><span class="comment">// energy = demand * duration</span></div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span><span class="comment">// There is hope to unify the variants of these algorithms by abstracting the</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span><span class="comment">// tasks away to reason only on events.</span></div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> </div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span><span class="comment">// The minimal value of an envelope, for instance the envelope of the empty set.</span></div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span><span class="keyword">template</span> <<span class="keyword">typename</span> IntegerType></div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a8b7beb472425b294af9b102a4a98f42c"> 95</a></span><span class="keyword">constexpr</span> IntegerType <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8b7beb472425b294af9b102a4a98f42c">IntegerTypeMinimumValue</a>() {</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<IntegerType>::min</a>();</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span>}</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span><span class="keyword">template</span> <></div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a9fb08d14503090b0fcd0cff9e37013c7"> 99</a></span><span class="keyword">constexpr</span> IntegerValue <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8b7beb472425b294af9b102a4a98f42c">IntegerTypeMinimumValue</a>() {</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keywordflow">return</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span>}</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> </div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span><span class="keyword">template</span> <<span class="keyword">typename</span> IntegerType></div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html"> 104</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">ThetaLambdaTree</a> {</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// Builds a reusable tree. Initialization is done with Reset().</span></div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac07cd2352d92040e62a235df35329a23">ThetaLambdaTree</a>();</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// Initializes this class for events in [0, num_events) and makes all of them</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// absent. Instead of allocating and de-allocating trees at every usage, i.e.</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// at every Propagate() of the scheduling algorithms that uses it, this class</span></div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="comment">// allows to keep the same memory for each call.</span></div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">Reset</a>(<span class="keywordtype">int</span> num_events);</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> </div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// Recomputes the values of internal nodes of the tree from the values in the</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// leaves. We enable batching modifications to the tree by providing</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> <span class="comment">// DelayedXXX() methods that run in O(1), but those methods do not</span></div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="comment">// update internal nodes. This breaks tree invariants, so that GetXXX()</span></div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> <span class="comment">// methods will not reflect modifications made to events.</span></div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <span class="comment">// RecomputeTreeForDelayedOperations() restores those invariants in O(n).</span></div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// Thus, batching operations can be done by first doing calls to DelayedXXX()</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// methods, then calling RecomputeTreeForDelayedOperations() once.</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a11a9dd6adaf582bd893a5b228bdf3dd8">RecomputeTreeForDelayedOperations</a>();</div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// Makes event present and updates its initial envelope and min/max energies.</span></div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// The initial_envelope must be >= ThetaLambdaTreeNegativeInfinity().</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// This updates the tree in O(log n).</span></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(<span class="keywordtype">int</span> event, IntegerType initial_envelope,</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> IntegerType energy_min, IntegerType energy_max);</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> </div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// Delayed version of AddOrUpdateEvent(),</span></div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// see RecomputeTreeForDelayedOperations().</span></div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ab5f279bbc9d594b39b40912b08b67dc1">DelayedAddOrUpdateEvent</a>(<span class="keywordtype">int</span> event, IntegerType initial_envelope,</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> IntegerType energy_min, IntegerType energy_max);</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> </div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="comment">// Adds event to the lambda part of the tree only.</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="comment">// This will leave GetEnvelope() unchanged, only GetOptionalEnvelope() can</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="comment">// be affected. This is done by setting envelope to IntegerTypeMinimumValue(),</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> <span class="comment">// energy_min to 0, and initial_envelope_opt and energy_max to the parameters.</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <span class="comment">// This updates the tree in O(log n).</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">AddOrUpdateOptionalEvent</a>(<span class="keywordtype">int</span> event, IntegerType initial_envelope_opt,</div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> IntegerType energy_max);</div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> </div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> <span class="comment">// Delayed version of AddOrUpdateOptionalEvent(),</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> <span class="comment">// see RecomputeTreeForDelayedOperations().</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac820a181e85984e2506c7de209fe6e44">DelayedAddOrUpdateOptionalEvent</a>(<span class="keywordtype">int</span> event,</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> IntegerType initial_envelope_opt,</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> IntegerType energy_max);</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> </div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="comment">// Makes event absent, compute the new envelope in O(log n).</span></div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">RemoveEvent</a>(<span class="keywordtype">int</span> event);</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> </div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="comment">// Delayed version of RemoveEvent(), see RecomputeTreeForDelayedOperations().</span></div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#aefbee6ed76e3986fe9265e49be71a3c7">DelayedRemoveEvent</a>(<span class="keywordtype">int</span> event);</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> <span class="comment">// Returns the maximum envelope using all the energy_min in O(1).</span></div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="comment">// If theta is empty, returns ThetaLambdaTreeNegativeInfinity().</span></div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> IntegerType <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// Returns the maximum envelope using the energy min of all task but</span></div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// one and the energy max of the last one in O(1).</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> <span class="comment">// If theta and lambda are empty, returns ThetaLambdaTreeNegativeInfinity().</span></div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> IntegerType <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">GetOptionalEnvelope</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> </div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> <span class="comment">// Computes the maximum event s.t. GetEnvelopeOf(event) > envelope_max.</span></div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="comment">// There must be such an event, i.e. GetEnvelope() > envelope_max.</span></div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// This finds the maximum event e such that</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="comment">// initial_envelope(e) + sum_{e' >= e} energy_min(e') > target_envelope.</span></div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="comment">// This operation is O(log n).</span></div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a75c0a813b413b5718813636f2120a790">GetMaxEventWithEnvelopeGreaterThan</a>(IntegerType target_envelope) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> </div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// Returns initial_envelope(event) + sum_{event' >= event} energy_min(event'),</span></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// in time O(log n).</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> IntegerType <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0718fcbb3200da053b8df062e6711d48">GetEnvelopeOf</a>(<span class="keywordtype">int</span> event) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> </div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// Computes a pair of events (critical_event, optional_event) such that</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="comment">// if optional_event was at its maximum energy, the envelope of critical_event</span></div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="comment">// would be greater than target_envelope.</span></div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// This assumes that such a pair exists, i.e. GetOptionalEnvelope() should be</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="comment">// greater than target_envelope. More formally, this finds events such that:</span></div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// initial_envelope(critical_event) +</span></div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// sum_{event' >= critical_event} energy_min(event') +</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="comment">// max_{optional_event >= critical_event} energy_delta(optional_event)</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// > target envelope.</span></div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="comment">// For efficiency reasons, this also fills available_energy with the maximum</span></div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> <span class="comment">// energy the optional task can take such that the optional envelope of the</span></div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> <span class="comment">// pair would be target_envelope, i.e.</span></div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// target_envelope - GetEnvelopeOf(event) + energy_min(optional_event).</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// This operation is O(log n).</span></div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">GetEventsWithOptionalEnvelopeGreaterThan</a>(</div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> IntegerType target_envelope, <span class="keywordtype">int</span>* critical_event, <span class="keywordtype">int</span>* optional_event,</div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> IntegerType* available_energy) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> </div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="comment">// Getters.</span></div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac6641ed613360a1063cc5901ef8b564c"> 198</a></span> IntegerType <a class="code hl_function" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac6641ed613360a1063cc5901ef8b564c">EnergyMin</a>(<span class="keywordtype">int</span> event)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="keywordflow">return</span> tree_[GetLeafFromEvent(event)].sum_of_energy_min;</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">private</span>:</div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="keyword">struct </span>TreeNode {</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> IntegerType envelope;</div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> IntegerType envelope_opt;</div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> IntegerType sum_of_energy_min;</div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> IntegerType max_of_energy_delta;</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> };</div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> </div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> TreeNode ComposeTreeNodes(TreeNode left, TreeNode right);</div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> </div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordtype">int</span> GetLeafFromEvent(<span class="keywordtype">int</span> event) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> <span class="keywordtype">int</span> GetEventFromLeaf(<span class="keywordtype">int</span> leaf) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> </div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// Propagates the change of leaf energies and envelopes towards the root.</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keywordtype">void</span> RefreshNode(<span class="keywordtype">int</span> node);</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> </div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// Finds the maximum leaf under node such that</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="comment">// initial_envelope(leaf) + sum_{leaf' >= leaf} energy_min(leaf')</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="comment">// > target_envelope.</span></div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> <span class="comment">// Fills extra with the difference.</span></div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="keywordtype">int</span> GetMaxLeafWithEnvelopeGreaterThan(<span class="keywordtype">int</span> node, IntegerType target_envelope,</div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> IntegerType* extra) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// Returns the leaf with maximum energy delta under node.</span></div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> <span class="keywordtype">int</span> GetLeafWithMaxEnergyDelta(<span class="keywordtype">int</span> node) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> </div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> <span class="comment">// Finds the leaves and energy relevant for</span></div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// GetEventsWithOptionalEnvelopeGreaterThan().</span></div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="keywordtype">void</span> GetLeavesWithOptionalEnvelopeGreaterThan(</div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> IntegerType target_envelope, <span class="keywordtype">int</span>* critical_leaf, <span class="keywordtype">int</span>* optional_leaf,</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> IntegerType* available_energy) <span class="keyword">const</span>;</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="comment">// Number of events of the last Reset().</span></div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="keywordtype">int</span> num_events_;</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="keywordtype">int</span> num_leaves_;</div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keywordtype">int</span> power_of_two_;</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> </div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// A bool used in debug mode, to check that sequences of delayed operations</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="comment">// are ended by Reset() or RecomputeTreeForDelayedOperations().</span></div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keywordtype">bool</span> leaf_nodes_have_delayed_operations_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> </div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> <span class="comment">// Envelopes and energies of nodes.</span></div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> std::vector<TreeNode> tree_;</div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</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="comment">// Explicit instantiations in theta_Tree.cc.</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span><span class="keyword">extern</span> <span class="keyword">template</span> <span class="keyword">class </span>ThetaLambdaTree<IntegerValue>;</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span><span class="keyword">extern</span> <span class="keyword">template</span> <span class="keyword">class </span>ThetaLambdaTree<int64_t>;</div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> </div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> </div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_THETA_TREE_H_</span></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</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_ac6641ed613360a1063cc5901ef8b564c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac6641ed613360a1063cc5901ef8b564c">operations_research::sat::ThetaLambdaTree::EnergyMin</a></div><div class="ttdeci">IntegerType EnergyMin(int event) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8h_source.html#l00198">theta_tree.h:198</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="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8b7beb472425b294af9b102a4a98f42c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8b7beb472425b294af9b102a4a98f42c">operations_research::sat::IntegerTypeMinimumValue</a></div><div class="ttdeci">constexpr IntegerType IntegerTypeMinimumValue()</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8h_source.html#l00095">theta_tree.h:95</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><!-- 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_8h.html">theta_tree.h</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>
|