2852 lines
469 KiB
HTML
2852 lines
469 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.8.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: resource.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
|
|
 <span id="projectnumber">8.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('resource_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">resource.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="resource_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a 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 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 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 name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a 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 name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a 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 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 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 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 name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// This file contains implementations of several resource constraints.</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// The implemented constraints are:</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// * Disjunctive: forces a set of intervals to be non-overlapping</span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// * Cumulative: forces a set of intervals with associated demands to be such</span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// that the sum of demands of the intervals containing any given integer</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// does not exceed a capacity.</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// In addition, it implements the SequenceVar that allows ranking decisions</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// on a set of interval variables.</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <queue></span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include <string></span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  </div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "absl/strings/str_cat.h"</span></div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#include "absl/strings/str_join.h"</span></div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#include "<a class="code" href="commandlineflags_8h.html">ortools/base/commandlineflags.h</a>"</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include "<a class="code" href="mathutil_8h.html">ortools/base/mathutil.h</a>"</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include "<a class="code" href="constraint__solver_8h.html">ortools/constraint_solver/constraint_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include "<a class="code" href="constraint__solveri_8h.html">ortools/constraint_solver/constraint_solveri.h</a>"</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#include "<a class="code" href="bitset_8h.html">ortools/util/bitset.h</a>"</span></div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "<a class="code" href="monoid__operation__tree_8h.html">ortools/util/monoid_operation_tree.h</a>"</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include "<a class="code" href="string__array_8h.html">ortools/util/string_array.h</a>"</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// ----- Comparison functions -----</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  </div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment">// TODO(user): Tie breaking.</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// Comparison methods, used by the STL sort.</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="keyword">template</span> <<span class="keyword">class</span> Task></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="keywordtype">bool</span> StartMinLessThan(Task* <span class="keyword">const</span> w1, Task* <span class="keyword">const</span> w2) {</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">return</span> (w1->interval->StartMin() < w2->interval->StartMin());</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span> }</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  </div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// A comparator that sorts the tasks by their effective earliest start time when</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// using the shortest duration possible. This comparator can be used when</span></div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// sorting the tasks before they are inserted to a Theta-tree.</span></div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="keyword">template</span> <<span class="keyword">class</span> Task></div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="keywordtype">bool</span> ShortestDurationStartMinLessThan(Task* <span class="keyword">const</span> w1, Task* <span class="keyword">const</span> w2) {</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">return</span> w1->interval->EndMin() - w1->interval->DurationMin() <</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  w2->interval->EndMin() - w2->interval->DurationMin();</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span> }</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  </div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="keyword">template</span> <<span class="keyword">class</span> Task></div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="keywordtype">bool</span> StartMaxLessThan(Task* <span class="keyword">const</span> w1, Task* <span class="keyword">const</span> w2) {</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> (w1->interval->StartMax() < w2->interval->StartMax());</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> }</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  </div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">template</span> <<span class="keyword">class</span> Task></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="keywordtype">bool</span> EndMinLessThan(Task* <span class="keyword">const</span> w1, Task* <span class="keyword">const</span> w2) {</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span> (w1->interval->EndMin() < w2->interval->EndMin());</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span> }</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  </div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="keyword">template</span> <<span class="keyword">class</span> Task></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="keywordtype">bool</span> EndMaxLessThan(Task* <span class="keyword">const</span> w1, Task* <span class="keyword">const</span> w2) {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">return</span> (w1->interval->EndMax() < w2->interval->EndMax());</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span> }</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  </div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="keywordtype">bool</span> IntervalStartMinLessThan(IntervalVar* i1, IntervalVar* i2) {</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordflow">return</span> i1->StartMin() < i2->StartMin();</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span> }</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span> <span class="comment">// ----- Wrappers around intervals -----</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  </div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// A DisjunctiveTask is a non-preemptive task sharing a disjunctive resource.</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// That is, it corresponds to an interval, and this interval cannot overlap with</span></div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// any other interval of a DisjunctiveTask sharing the same resource.</span></div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="comment">// It is indexed, that is it is aware of its position in a reference array.</span></div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">struct </span>DisjunctiveTask {</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">explicit</span> DisjunctiveTask(IntervalVar* <span class="keyword">const</span> interval_)</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  : <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>(interval_), <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>(-1) {}</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  </div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  std::string DebugString()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DebugString(); }</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  </div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"><a class="line" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada"> 98</a></span>  IntervalVar* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"><a class="line" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0"> 99</a></span>  <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span> };</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  </div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="comment">// A CumulativeTask is a non-preemptive task sharing a cumulative resource.</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="comment">// That is, it corresponds to an interval and a demand. The sum of demands of</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="comment">// all cumulative tasks CumulativeTasks sharing a resource of capacity c those</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// intervals contain any integer t cannot exceed c.</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// It is indexed, that is it is aware of its position in a reference array.</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">struct </span>CumulativeTask {</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  CumulativeTask(IntervalVar* <span class="keyword">const</span> interval_, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> demand_)</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  : <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>(interval_), <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>(demand_), <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>(-1) {}</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  </div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> EnergyMin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin() * <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>; }</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  </div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> DemandMin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>; }</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  </div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordtype">void</span> WhenAnything(Demon* <span class="keyword">const</span> demon) { <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->WhenAnything(demon); }</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  </div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  std::string DebugString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"Task{ %s, demand: %d }"</span>, <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DebugString(),</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>);</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  </div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  IntervalVar* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"><a class="line" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20"> 123</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> };</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  </div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// A VariableCumulativeTask is a non-preemptive task sharing a</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// cumulative resource. That is, it corresponds to an interval and a</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// demand. The sum of demands of all cumulative tasks</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// VariableCumulativeTasks sharing a resource of capacity c whose</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment">// intervals contain any integer t cannot exceed c. It is indexed,</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// that is it is aware of its position in a reference array.</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="keyword">struct </span>VariableCumulativeTask {</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  VariableCumulativeTask(IntervalVar* <span class="keyword">const</span> interval_, IntVar* demand_)</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  : <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>(interval_), <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>(demand_), <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>(-1) {}</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  </div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> EnergyMin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin() * <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>->Min(); }</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  </div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> DemandMin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>->Min(); }</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  </div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordtype">void</span> WhenAnything(Demon* <span class="keyword">const</span> demon) {</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->WhenAnything(demon);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>->WhenRange(demon);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  std::string DebugString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"Task{ %s, demand: %s }"</span>, <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DebugString(),</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>->DebugString());</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  </div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  IntVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>;</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span> };</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  </div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="comment">// ---------- Theta-Trees ----------</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  </div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="comment">// This is based on Petr Vilim (public) PhD work.</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="comment">// All names comes from his work. See http://vilim.eu/petr.</span></div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  </div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// Node of a Theta-tree</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="keyword">struct </span>ThetaNode {</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// Identity element</span></div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  ThetaNode() : <a class="code" href="resource_8cc.html#a5d590142778c354f4fd48d6f12909af3">total_processing</a>(0), <a class="code" href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610">total_ect</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>) {}</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  </div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Single interval element</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">explicit</span> ThetaNode(<span class="keyword">const</span> IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>)</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  : <a class="code" href="resource_8cc.html#a5d590142778c354f4fd48d6f12909af3">total_processing</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin()),</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <a class="code" href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610">total_ect</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin()) {</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// NOTE(user): Petr Vilim's thesis assumes that all tasks in the</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// scheduling problem have fixed duration and that propagation already</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// updated the bounds of the start/end times accordingly.</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// The problem in this case is that the recursive formula for computing</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// total_ect was only proved for the case where the duration is fixed; in</span></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// our case, we use StartMin() + DurationMin() for the earliest completion</span></div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">// time of a task, which should not break any assumptions, but may give</span></div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// bounds that are too loose.</span></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  </div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordtype">void</span> Compute(<span class="keyword">const</span> ThetaNode& left, <span class="keyword">const</span> ThetaNode& right) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="resource_8cc.html#a5d590142778c354f4fd48d6f12909af3">total_processing</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.total_processing, right.total_processing);</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <a class="code" href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610">total_ect</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.total_ect, right.total_processing),</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  right.total_ect);</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  </div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordtype">bool</span> IsIdentity()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#a5d590142778c354f4fd48d6f12909af3">total_processing</a> == 0LL && <a class="code" href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610">total_ect</a> == <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  }</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  std::string DebugString()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">return</span> absl::StrCat(<span class="stringliteral">"ThetaNode{ p = "</span>, <a class="code" href="resource_8cc.html#a5d590142778c354f4fd48d6f12909af3">total_processing</a>,</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="stringliteral">", e = "</span>, <a class="code" href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610">total_ect</a> < 0LL ? -1LL : <a class="code" href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610">total_ect</a>, <span class="stringliteral">" }"</span>);</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"><a class="line" href="resource_8cc.html#a5d590142778c354f4fd48d6f12909af3"> 195</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a5d590142778c354f4fd48d6f12909af3">total_processing</a>;</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"><a class="line" href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610"> 196</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610">total_ect</a>;</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span> };</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment">// A theta-tree is a container for a set of intervals supporting the following</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment">// operations:</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// * Insertions and deletion in O(log size_), with size_ the maximal number of</span></div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// tasks the tree may contain;</span></div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="comment">// * Querying the following quantity in O(1):</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment">// Max_{subset S of the set of contained intervals} (</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// Min_{i in S}(i.StartMin) + Sum_{i in S}(i.DurationMin) )</span></div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="keyword">class </span>ThetaTree : <span class="keyword">public</span> MonoidOperationTree<ThetaNode> {</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">explicit</span> ThetaTree(<span class="keywordtype">int</span> size) : MonoidOperationTree<ThetaNode>(size) {}</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  </div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> Ect()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> result().total_ect; }</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  </div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordtype">void</span> Insert(<span class="keyword">const</span> DisjunctiveTask* <span class="keyword">const</span> task) {</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  Set(task->index, ThetaNode(task->interval));</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordtype">void</span> Remove(<span class="keyword">const</span> DisjunctiveTask* <span class="keyword">const</span> task) { Reset(task->index); }</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  </div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordtype">bool</span> IsInserted(<span class="keyword">const</span> DisjunctiveTask* <span class="keyword">const</span> task)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordflow">return</span> !GetOperand(task->index).IsIdentity();</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  }</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span> };</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  </div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment">// ----------------- Lambda Theta Tree -----------------------</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  </div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// Lambda-theta-node</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// These nodes are cumulative lambda theta-node. This is reflected in the</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment">// terminology. They can also be used in the disjunctive case, and this incurs</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment">// no performance penalty.</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="keyword">struct </span>LambdaThetaNode {</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// Special value for task indices meaning 'no such task'.</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"><a class="line" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc"> 231</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>;</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  </div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// Identity constructor</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  LambdaThetaNode()</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(0LL),</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>(0LL),</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a>(<a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>),</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>) {}</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  </div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// Constructor for a single cumulative task in the Theta set</span></div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  LambdaThetaNode(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keyword">const</span> CumulativeTask& task)</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(task.EnergyMin()),</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> * task.<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(), <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>)),</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>(<a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>),</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a>(<a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>),</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>),</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>) {}</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  </div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// Constructor for a single cumulative task in the Lambda set</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  LambdaThetaNode(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keyword">const</span> CumulativeTask& task, <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(0LL),</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>(task.EnergyMin()),</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> * task.<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin() +</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>),</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  </div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// Constructor for a single cumulative task in the Theta set</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  LambdaThetaNode(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keyword">const</span> VariableCumulativeTask& task)</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(task.EnergyMin()),</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> * task.<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(), <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>)),</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>(<a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>),</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a>(<a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>),</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>),</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>) {}</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  </div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// Constructor for a single cumulative task in the Lambda set</span></div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  LambdaThetaNode(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keyword">const</span> VariableCumulativeTask& task, <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(0LL),</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>(task.EnergyMin()),</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> * task.<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin() +</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>),</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// Constructor for a single interval in the Theta set</span></div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">explicit</span> LambdaThetaNode(<span class="keyword">const</span> IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>)</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin()),</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin()),</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin()),</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a>(<a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>),</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin()),</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>) {}</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  </div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// Constructor for a single interval in the Lambda set</span></div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// 'index' is the index of the given interval in the est vector</span></div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  LambdaThetaNode(<span class="keyword">const</span> IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>, <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>)</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(0LL),</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin()),</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>),</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin()),</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, 0);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  </div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="comment">// Sets this LambdaThetaNode to the result of the natural binary operations</span></div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">// over the two given operands, corresponding to the following set operations:</span></div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// Theta = left.Theta union right.Theta</span></div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// Lambda = left.Lambda union right.Lambda</span></div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// No set operation actually occur: we only maintain the relevant quantities</span></div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// associated with such sets.</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordtype">void</span> Compute(<span class="keyword">const</span> LambdaThetaNode& left, <span class="keyword">const</span> LambdaThetaNode& right) {</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.energy, right.energy);</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(right.energetic_end_min,</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.energetic_end_min, right.energy));</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> energy_left_opt = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.energy_opt, right.energy);</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> energy_right_opt = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.energy, right.energy_opt);</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keywordflow">if</span> (energy_left_opt > energy_right_opt) {</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a> = energy_left_opt;</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a> = left.argmax_energy_opt;</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a> = energy_right_opt;</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a> = right.argmax_energy_opt;</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ect1 = right.energetic_end_min_opt;</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ect2 = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.energetic_end_min, right.energy_opt);</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ect3 = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.energetic_end_min_opt, right.energy);</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (ect1 >= ect2 && ect1 >= ect3) { <span class="comment">// ect1 max</span></div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a> = ect1;</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a> = right.argmax_energetic_end_min_opt;</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (ect2 >= ect1 && ect2 >= ect3) { <span class="comment">// ect2 max</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a> = ect2;</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a> = right.argmax_energy_opt;</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  } <span class="keywordflow">else</span> { <span class="comment">// ect3 max</span></div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a> = ect3;</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a> = left.argmax_energetic_end_min_opt;</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// The processing time, with one grey interval, should be no less than</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// without any grey interval.</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(<a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a> >= <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// If there is no responsible grey interval for the processing time,</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// the processing time with a grey interval should equal the one</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// without.</span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>((<a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a> != <a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>) || (<a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a> == <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>));</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  }</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  </div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// Amount of resource consumed by the Theta set, in units of demand X time.</span></div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="comment">// This is energy(Theta).</span></div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"><a class="line" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694"> 349</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>;</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  </div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="comment">// Max_{subset S of Theta} (capacity * start_min(S) + energy(S))</span></div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"><a class="line" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9"> 352</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>;</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  </div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// Max_{i in Lambda} (energy(Theta union {i}))</span></div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"><a class="line" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226"> 355</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a>;</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  </div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="comment">// The argmax in energy_opt_. It is the index of the chosen task in the Lambda</span></div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="comment">// set, if any, or kNone if none.</span></div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"><a class="line" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea"> 359</a></span>  <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a>;</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  </div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="comment">// Max_{subset S of Theta, i in Lambda}</span></div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="comment">// (capacity * start_min(S union {i}) + energy(S union {i}))</span></div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"><a class="line" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7"> 363</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>;</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  </div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="comment">// The argmax in energetic_end_min_opt_. It is the index of the chosen task in</span></div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="comment">// the Lambda set, if any, or kNone if none.</span></div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"><a class="line" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47"> 367</a></span>  <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>;</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> };</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  </div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">LambdaThetaNode::kNone</a> = -1;</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  </div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span> <span class="comment">// Disjunctive Lambda-Theta tree</span></div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="keyword">class </span>DisjunctiveLambdaThetaTree : <span class="keyword">public</span> MonoidOperationTree<LambdaThetaNode> {</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keyword">explicit</span> DisjunctiveLambdaThetaTree(<span class="keywordtype">int</span> size)</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  : MonoidOperationTree<LambdaThetaNode>(size) {}</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  </div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordtype">void</span> Insert(<span class="keyword">const</span> DisjunctiveTask& task) {</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  Set(task.index, LambdaThetaNode(task.interval));</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  }</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  </div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordtype">void</span> Grey(<span class="keyword">const</span> DisjunctiveTask& task) {</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = task.index;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  Set(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, LambdaThetaNode(task.interval, <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  }</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  </div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> Ect()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> result().energetic_end_min; }</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> EctOpt()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> result().energetic_end_min_opt; }</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordtype">int</span> ResponsibleOpt()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> result().argmax_energetic_end_min_opt; }</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span> };</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  </div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment">// A cumulative lambda-theta tree</span></div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="keyword">class </span>CumulativeLambdaThetaTree : <span class="keyword">public</span> MonoidOperationTree<LambdaThetaNode> {</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  CumulativeLambdaThetaTree(<span class="keywordtype">int</span> size, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_max)</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  : MonoidOperationTree<LambdaThetaNode>(size),</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  capacity_max_(capacity_max) {}</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  </div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordtype">void</span> Init(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_max) {</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  Clear();</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  capacity_max_ = capacity_max;</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  </div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordtype">void</span> Insert(<span class="keyword">const</span> CumulativeTask& task) {</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  Set(task.index, LambdaThetaNode(capacity_max_, task));</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  }</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  </div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordtype">void</span> Grey(<span class="keyword">const</span> CumulativeTask& task) {</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = task.index;</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  Set(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, LambdaThetaNode(capacity_max_, task, <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  </div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordtype">void</span> Insert(<span class="keyword">const</span> VariableCumulativeTask& task) {</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  Set(task.index, LambdaThetaNode(capacity_max_, task));</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  </div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordtype">void</span> Grey(<span class="keyword">const</span> VariableCumulativeTask& task) {</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = task.index;</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  Set(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, LambdaThetaNode(capacity_max_, task, <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>));</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  </div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> result().energetic_end_min; }</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> result().energetic_end_min_opt; }</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> Ect()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_math_util.html#a0cfaf8b139304c54e3403d4ffbd60157">MathUtil::CeilOfRatio</a>(<a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(), capacity_max_);</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  }</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> EctOpt()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_math_util.html#a0cfaf8b139304c54e3403d4ffbd60157">MathUtil::CeilOfRatio</a>(result().<a class="code" href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a>, capacity_max_);</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  }</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> result().argmax_energetic_end_min_opt;</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  </div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_max_;</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span> };</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  </div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment">// -------------- Not Last -----------------------------------------</span></div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  </div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span> <span class="comment">// A class that implements the 'Not-Last' propagation algorithm for the unary</span></div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> <span class="comment">// resource constraint.</span></div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span> <span class="keyword">class </span>NotLast {</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  NotLast(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordtype">bool</span> mirror, <span class="keywordtype">bool</span> strict);</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  </div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  ~NotLast() { <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&by_start_min_); }</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  </div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordtype">bool</span> Propagate();</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  </div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  ThetaTree theta_tree_;</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  std::vector<DisjunctiveTask*> by_start_min_;</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  std::vector<DisjunctiveTask*> by_end_max_;</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  std::vector<DisjunctiveTask*> by_start_max_;</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  std::vector<int64> new_lct_;</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> strict_;</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span> };</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  </div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span> NotLast::NotLast(Solver* <span class="keyword">const</span> solver,</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& intervals, <span class="keywordtype">bool</span> mirror,</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordtype">bool</span> strict)</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  : theta_tree_(intervals.size()),</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  by_start_min_(intervals.size()),</div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  by_end_max_(intervals.size()),</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  by_start_max_(intervals.size()),</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  new_lct_(intervals.size(), -1LL),</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  strict_(strict) {</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// Populate the different vectors.</span></div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals.size(); ++i) {</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  IntervalVar* <span class="keyword">const</span> underlying =</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  mirror ? solver->MakeMirrorInterval(intervals[i]) : intervals[i];</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  IntervalVar* <span class="keyword">const</span> relaxed = solver->MakeIntervalRelaxedMin(underlying);</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  by_start_min_[i] = <span class="keyword">new</span> DisjunctiveTask(relaxed);</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  by_end_max_[i] = by_start_min_[i];</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  by_start_max_[i] = by_start_min_[i];</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  }</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span> }</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  </div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span> <span class="keywordtype">bool</span> NotLast::Propagate() {</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="comment">// ---- Init ----</span></div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  std::sort(by_start_max_.begin(), by_start_max_.end(),</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  StartMaxLessThan<DisjunctiveTask>);</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  std::sort(by_end_max_.begin(), by_end_max_.end(),</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  EndMaxLessThan<DisjunctiveTask>);</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// Update start min positions</span></div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  std::sort(by_start_min_.begin(), by_start_min_.end(),</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  StartMinLessThan<DisjunctiveTask>);</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < by_start_min_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  by_start_min_[i]->index = i;</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  }</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  theta_tree_.Clear();</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < by_start_min_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  new_lct_[i] = by_start_min_[i]->interval->EndMax();</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  </div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// --- Execute ----</span></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordtype">int</span> j = 0;</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">for</span> (DisjunctiveTask* <span class="keyword">const</span> twi : by_end_max_) {</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">while</span> (j < by_start_max_.size() &&</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  twi->interval->EndMax() > by_start_max_[j]->interval->StartMax()) {</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (j > 0 && theta_tree_.Ect() > by_start_max_[j]->interval->StartMax()) {</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_end_max = by_start_max_[j - 1]->interval->StartMax();</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  new_lct_[by_start_max_[j]->index] = new_end_max;</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  }</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  theta_tree_.Insert(by_start_max_[j]);</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  j++;</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  }</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> inserted = theta_tree_.IsInserted(twi);</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">if</span> (inserted) {</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  theta_tree_.Remove(twi);</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  }</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ect_theta_less_i = theta_tree_.Ect();</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">if</span> (inserted) {</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  theta_tree_.Insert(twi);</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">if</span> (ect_theta_less_i > twi->interval->EndMax() && j > 0) {</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_end_max = by_start_max_[j - 1]->interval->EndMax();</div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keywordflow">if</span> (new_end_max > new_lct_[twi->index]) {</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  new_lct_[twi->index] = new_end_max;</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  }</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  }</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  </div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="comment">// Apply modifications</span></div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordtype">bool</span> modified = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < by_start_min_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = by_start_min_[i]->interval;</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">if</span> ((strict_ || <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->DurationMin() > 0) && <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->EndMax() > new_lct_[i]) {</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  modified = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetEndMax(new_lct_[i]);</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  }</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  }</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span> modified;</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span> }</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  </div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="comment">// ------ Edge finder + detectable precedences -------------</span></div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  </div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span> <span class="comment">// A class that implements two propagation algorithms: edge finding and</span></div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span> <span class="comment">// detectable precedences. These algorithms both push intervals to the right,</span></div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span> <span class="comment">// which is why they are grouped together.</span></div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span> <span class="keyword">class </span>EdgeFinderAndDetectablePrecedences {</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  EdgeFinderAndDetectablePrecedences(Solver* <span class="keyword">const</span> solver,</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordtype">bool</span> mirror, <span class="keywordtype">bool</span> strict);</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  ~EdgeFinderAndDetectablePrecedences() {</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&by_start_min_);</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  }</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> by_start_min_.size(); }</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  IntervalVar* <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>(<span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) { <span class="keywordflow">return</span> by_start_min_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->interval; }</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordtype">void</span> UpdateEst();</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordtype">void</span> OverloadChecking();</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordtype">bool</span> DetectablePrecedences();</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordtype">bool</span> EdgeFinder();</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  </div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  Solver* <span class="keyword">const</span> solver_;</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  </div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// --- All the following member variables are essentially used as local ones:</span></div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// no invariant is maintained about them, except for the fact that the vectors</span></div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="comment">// always contains all the considered intervals, so any function that wants to</span></div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">// use them must first sort them in the right order.</span></div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  </div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// All of these vectors store the same set of objects. Therefore, at</span></div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// destruction time, STLDeleteElements should be called on only one of them.</span></div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="comment">// It does not matter which one.</span></div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  </div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  ThetaTree theta_tree_;</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  std::vector<DisjunctiveTask*> by_end_min_;</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  std::vector<DisjunctiveTask*> by_start_min_;</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  std::vector<DisjunctiveTask*> by_end_max_;</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  std::vector<DisjunctiveTask*> by_start_max_;</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// new_est_[i] is the new start min for interval est_[i]->interval.</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  std::vector<int64> new_est_;</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// new_lct_[i] is the new end max for interval est_[i]->interval.</span></div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  std::vector<int64> new_lct_;</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  DisjunctiveLambdaThetaTree lt_tree_;</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> strict_;</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span> };</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  </div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span> EdgeFinderAndDetectablePrecedences::EdgeFinderAndDetectablePrecedences(</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordtype">bool</span> mirror, <span class="keywordtype">bool</span> strict)</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  : solver_(solver),</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  theta_tree_(intervals.size()),</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  lt_tree_(intervals.size()),</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  strict_(strict) {</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="comment">// Populate of the array of intervals</span></div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordflow">for</span> (IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : intervals) {</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  IntervalVar* <span class="keyword">const</span> underlying =</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  mirror ? solver->MakeMirrorInterval(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>) : <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>;</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  IntervalVar* <span class="keyword">const</span> relaxed = solver->MakeIntervalRelaxedMax(underlying);</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  DisjunctiveTask* <span class="keyword">const</span> task = <span class="keyword">new</span> DisjunctiveTask(relaxed);</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  by_end_min_.push_back(task);</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  by_start_min_.push_back(task);</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  by_end_max_.push_back(task);</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  by_start_max_.push_back(task);</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  new_est_.push_back(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>);</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span> }</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  </div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span> <span class="keywordtype">void</span> EdgeFinderAndDetectablePrecedences::UpdateEst() {</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  std::sort(by_start_min_.begin(), by_start_min_.end(),</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  ShortestDurationStartMinLessThan<DisjunctiveTask>);</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  by_start_min_[i]->index = i;</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  }</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span> }</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  </div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span> <span class="keywordtype">void</span> EdgeFinderAndDetectablePrecedences::OverloadChecking() {</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// Initialization.</span></div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  UpdateEst();</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  std::sort(by_end_max_.begin(), by_end_max_.end(),</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  EndMaxLessThan<DisjunctiveTask>);</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  theta_tree_.Clear();</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  </div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keywordflow">for</span> (DisjunctiveTask* <span class="keyword">const</span> task : by_end_max_) {</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  theta_tree_.Insert(task);</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keywordflow">if</span> (theta_tree_.Ect() > task->interval->EndMax()) {</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  solver_->Fail();</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  }</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span> }</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  </div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span> <span class="keywordtype">bool</span> EdgeFinderAndDetectablePrecedences::DetectablePrecedences() {</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="comment">// Initialization.</span></div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  UpdateEst();</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  new_est_.assign(size(), <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>);</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  </div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="comment">// Propagate in one direction</span></div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  std::sort(by_end_min_.begin(), by_end_min_.end(),</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  EndMinLessThan<DisjunctiveTask>);</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  std::sort(by_start_max_.begin(), by_start_max_.end(),</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  StartMaxLessThan<DisjunctiveTask>);</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  theta_tree_.Clear();</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordtype">int</span> j = 0;</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keywordflow">for</span> (DisjunctiveTask* <span class="keyword">const</span> task_i : by_end_min_) {</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">if</span> (j < size()) {</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  DisjunctiveTask* task_j = by_start_max_[j];</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">while</span> (task_i->interval->EndMin() > task_j->interval->StartMax()) {</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  theta_tree_.Insert(task_j);</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  j++;</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keywordflow">if</span> (j == size()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  task_j = by_start_max_[j];</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  }</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  }</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> esti = task_i->interval->StartMin();</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordtype">bool</span> inserted = theta_tree_.IsInserted(task_i);</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="keywordflow">if</span> (inserted) {</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  theta_tree_.Remove(task_i);</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  }</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> oesti = theta_tree_.Ect();</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">if</span> (inserted) {</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  theta_tree_.Insert(task_i);</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">if</span> (oesti > esti) {</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  new_est_[task_i->index] = oesti;</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  new_est_[task_i->index] = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  }</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  }</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  </div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">// Apply modifications</span></div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordtype">bool</span> modified = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = by_start_min_[i]->interval;</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordflow">if</span> (new_est_[i] != <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a> && (strict_ || <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->DurationMin() > 0)) {</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  modified = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  by_start_min_[i]->interval->SetStartMin(new_est_[i]);</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  }</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">return</span> modified;</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span> }</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  </div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span> <span class="keywordtype">bool</span> EdgeFinderAndDetectablePrecedences::EdgeFinder() {</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="comment">// Initialization.</span></div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  UpdateEst();</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  new_est_[i] = by_start_min_[i]->interval->StartMin();</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  }</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  </div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">// Push in one direction.</span></div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  std::sort(by_end_max_.begin(), by_end_max_.end(),</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  EndMaxLessThan<DisjunctiveTask>);</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  lt_tree_.Clear();</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  lt_tree_.Insert(*by_start_min_[i]);</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(i, by_start_min_[i]-><a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  }</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = size() - 2; j >= 0; --j) {</div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  lt_tree_.Grey(*by_end_max_[j + 1]);</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  DisjunctiveTask* <span class="keyword">const</span> twj = by_end_max_[j];</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// We should have checked for overloading earlier.</span></div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(lt_tree_.Ect(), twj->interval->EndMax());</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">while</span> (lt_tree_.EctOpt() > twj->interval->EndMax()) {</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> i = lt_tree_.ResponsibleOpt();</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(i, 0);</div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">if</span> (lt_tree_.Ect() > new_est_[i]) {</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  new_est_[i] = lt_tree_.Ect();</div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  }</div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  lt_tree_.Reset(i);</div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  }</div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  }</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  </div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="comment">// Apply modifications.</span></div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="keywordtype">bool</span> modified = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size(); ++i) {</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = by_start_min_[i]->interval;</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->StartMin() < new_est_[i] && (strict_ || <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->DurationMin() > 0)) {</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  modified = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SetStartMin(new_est_[i]);</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  }</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  }</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">return</span> modified;</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span> }</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  </div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span> <span class="comment">// --------- Disjunctive Constraint ----------</span></div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  </div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span> <span class="comment">// ----- Propagation on ranked activities -----</span></div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  </div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span> <span class="keyword">class </span>RankedPropagator : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  RankedPropagator(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<IntVar*>& nexts,</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="keyword">const</span> std::vector<IntVar*>& slacks,</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  DisjunctiveConstraint* <span class="keyword">const</span> disjunctive)</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  : Constraint(solver),</div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  nexts_(nexts),</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  intervals_(intervals),</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  slacks_(slacks),</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  disjunctive_(disjunctive),</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  partial_sequence_(intervals.size()),</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  previous_(intervals.size() + 2, 0) {}</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  </div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  ~RankedPropagator()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  </div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  Demon* <span class="keyword">const</span> delayed =</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  solver()->MakeDelayedConstraintInitialPropagateCallback(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  nexts_[i]->WhenBound(delayed);</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  intervals_[i]->WhenAnything(delayed);</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  slacks_[i]->WhenRange(delayed);</div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  }</div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  nexts_.back()->WhenBound(delayed);</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  }</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  </div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  PropagateNexts();</div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  PropagateSequence();</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  }</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  </div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordtype">void</span> PropagateNexts() {</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ranked_first = partial_sequence_.NumFirstRanked();</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ranked_last = partial_sequence_.NumLastRanked();</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> sentinel =</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  ranked_last == 0</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  ? nexts_.size()</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  : partial_sequence_[intervals_.size() - ranked_last] + 1;</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keywordtype">int</span> first = 0;</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="keywordtype">int</span> counter = 0;</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">while</span> (nexts_[first]->Bound()) {</div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(first, nexts_[first]->Min());</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  first = nexts_[first]->Min();</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordflow">if</span> (first == sentinel) {</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  }</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keywordflow">if</span> (++counter > ranked_first) {</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(intervals_[first - 1]->MayBePerformed());</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  partial_sequence_.RankFirst(s, first - 1);</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"RankFirst "</span> << first - 1 << <span class="stringliteral">" -> "</span></div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  << partial_sequence_.DebugString();</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  }</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  }</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  previous_.assign(previous_.size(), -1);</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < nexts_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <span class="keywordflow">if</span> (nexts_[i]->Bound()) {</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  previous_[nexts_[i]->Min()] = i;</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  }</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  }</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordtype">int</span> last = previous_.size() - 1;</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  counter = 0;</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">while</span> (previous_[last] != -1) {</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  last = previous_[last];</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordflow">if</span> (++counter > ranked_last) {</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  partial_sequence_.RankLast(s, last - 1);</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(2) << <span class="stringliteral">"RankLast "</span> << last - 1 << <span class="stringliteral">" -> "</span></div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  << partial_sequence_.DebugString();</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  }</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  }</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  }</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  </div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordtype">void</span> PropagateSequence() {</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> last_position = intervals_.size() - 1;</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> first_sentinel = partial_sequence_.NumFirstRanked();</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> last_sentinel = last_position - partial_sequence_.NumLastRanked();</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// Propagates on ranked first from left to right.</span></div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < first_sentinel - 1; ++i) {</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = RankedInterval(i);</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  IntervalVar* <span class="keyword">const</span> next_interval = RankedInterval(i + 1);</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  IntVar* <span class="keyword">const</span> slack = RankedSlack(i);</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transition_time = RankedTransitionTime(i, i + 1);</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  next_interval->SetStartRange(</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(), <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Min(), transition_time)),</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax(), <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Max(), transition_time)));</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  }</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="comment">// Propagates on ranked last from right to left.</span></div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = last_position; i > last_sentinel + 1; --i) {</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = RankedInterval(i - 1);</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  IntervalVar* <span class="keyword">const</span> next_interval = RankedInterval(i);</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  IntVar* <span class="keyword">const</span> slack = RankedSlack(i - 1);</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transition_time = RankedTransitionTime(i - 1, i);</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetStartRange(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(next_interval->StartMin(),</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Max(), transition_time)),</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(next_interval->StartMax(),</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Min(), transition_time)));</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  }</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="comment">// Propagate across.</span></div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  IntervalVar* <span class="keyword">const</span> first_interval =</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  first_sentinel > 0 ? RankedInterval(first_sentinel - 1) : nullptr;</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  IntVar* <span class="keyword">const</span> first_slack =</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  first_sentinel > 0 ? RankedSlack(first_sentinel - 1) : nullptr;</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  IntervalVar* <span class="keyword">const</span> last_interval = last_sentinel < last_position</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  ? RankedInterval(last_sentinel + 1)</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  : nullptr;</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  </div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="comment">// Nothing to do afterwards, exiting.</span></div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="keywordflow">if</span> (first_interval == <span class="keyword">nullptr</span> && last_interval == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  }</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="comment">// Propagates to the middle part.</span></div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="comment">// This assumes triangular inequality in the transition times.</span></div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = first_sentinel; i <= last_sentinel; ++i) {</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = RankedInterval(i);</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  IntVar* <span class="keyword">const</span> slack = RankedSlack(i);</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="sched__constraints_8cc.html#a57ac40de3cbc6dab5c737cc16b672814">performed</a> = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed();</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordflow">if</span> (first_interval != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transition_time =</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  RankedTransitionTime(first_sentinel - 1, i);</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetStartRange(</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(first_interval->StartMin(),</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(first_slack->Min(), transition_time)),</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(first_interval->StartMax(),</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(first_slack->Max(), transition_time)));</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a57ac40de3cbc6dab5c737cc16b672814">performed</a>) {</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  first_interval->SetStartRange(</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(),</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(first_slack->Max(), transition_time)),</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax(),</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(first_slack->Min(), transition_time)));</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  }</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  }</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keywordflow">if</span> (last_interval != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transition_time =</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  RankedTransitionTime(i, last_sentinel + 1);</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetStartRange(</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(last_interval->StartMin(),</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Max(), transition_time)),</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(last_interval->StartMax(),</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Min(), transition_time)));</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a57ac40de3cbc6dab5c737cc16b672814">performed</a>) {</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  last_interval->SetStartRange(</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(),</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Min(), transition_time)),</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax(),</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Max(), transition_time)));</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  }</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  }</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  }</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  }</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="comment">// TODO(user): cache transition on ranked intervals in a vector.</span></div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="comment">// Propagates on ranked first from right to left.</span></div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(first_sentinel - 2, last_position - 1); i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = RankedInterval(i);</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  IntervalVar* <span class="keyword">const</span> next_interval = RankedInterval(i + 1);</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  IntVar* <span class="keyword">const</span> slack = RankedSlack(i);</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transition_time = RankedTransitionTime(i, i + 1);</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetStartRange(<a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(next_interval->StartMin(),</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Max(), transition_time)),</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(next_interval->StartMax(),</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Min(), transition_time)));</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  }</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="comment">// Propagates on ranked last from left to right.</span></div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = last_sentinel + 1; i < last_position - 1; ++i) {</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = RankedInterval(i);</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  IntervalVar* <span class="keyword">const</span> next_interval = RankedInterval(i + 1);</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  IntVar* <span class="keyword">const</span> slack = RankedSlack(i);</div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> transition_time = RankedTransitionTime(i, i + 1);</div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  next_interval->SetStartRange(</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(), <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Min(), transition_time)),</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax(), <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(slack->Max(), transition_time)));</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  }</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="comment">// TODO(user) : Propagate on slacks.</span></div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  }</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  </div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  IntervalVar* RankedInterval(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = partial_sequence_[i];</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keywordflow">return</span> intervals_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  }</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  </div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  IntVar* RankedSlack(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = partial_sequence_[i];</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">return</span> slacks_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  }</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  </div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> RankedTransitionTime(<span class="keywordtype">int</span> before, <span class="keywordtype">int</span> after)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> before_index = partial_sequence_[before];</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> after_index = partial_sequence_[after];</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  </div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordflow">return</span> disjunctive_->TransitionTime(before_index, after_index);</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  }</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  </div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordflow">return</span> absl::StrFormat(</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="stringliteral">"RankedPropagator([%s], nexts = [%s], intervals = [%s])"</span>,</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  partial_sequence_.DebugString(), <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(nexts_, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(intervals_, <span class="stringliteral">", "</span>));</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  }</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  </div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Not yet implemented"</span>;</div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="comment">// TODO(user): IMPLEMENT ME.</span></div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  }</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  </div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  std::vector<IntervalVar*> intervals_;</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  std::vector<IntVar*> slacks_;</div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  DisjunctiveConstraint* <span class="keyword">const</span> disjunctive_;</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  RevPartialSequence partial_sequence_;</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  std::vector<int> previous_;</div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"> 935</span> };</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  </div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span> <span class="comment">// A class that stores several propagators for the sequence constraint, and</span></div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span> <span class="comment">// calls them until a fixpoint is reached.</span></div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  </div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span> <span class="keyword">class </span>FullDisjunctiveConstraint : <span class="keyword">public</span> DisjunctiveConstraint {</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  FullDisjunctiveConstraint(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, <span class="keywordtype">bool</span> strict)</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  : DisjunctiveConstraint(s, intervals, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>),</div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  sequence_var_(nullptr),</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  straight_(s, intervals, false, strict),</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  mirror_(s, intervals, true, strict),</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  straight_not_last_(s, intervals, false, strict),</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  mirror_not_last_(s, intervals, true, strict),</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  strict_(strict) {}</div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  </div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  ~FullDisjunctiveConstraint()<span class="keyword"> override </span>{}</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  </div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  Demon* <span class="keyword">const</span> d = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  solver(), <span class="keyword">this</span>, &FullDisjunctiveConstraint::InitialPropagate,</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="stringliteral">"InitialPropagate"</span>);</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a> i = 0; i < straight_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  straight_.interval(i)->WhenAnything(d);</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  }</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  }</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  </div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keywordtype">bool</span> all_optional_or_unperformed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : intervals_) {</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) {</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  all_optional_or_unperformed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  }</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  }</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="keywordflow">if</span> (all_optional_or_unperformed) { <span class="comment">// Nothing to deduce</span></div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  }</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  </div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keywordtype">bool</span> all_times_fixed = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : intervals_) {</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed() &&</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin() != <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax() ||</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin() != <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMax() ||</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin() != <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMax())) {</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  all_times_fixed = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  }</div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  }</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  </div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordflow">if</span> (all_times_fixed) {</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  PropagatePerformed();</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keywordflow">do</span> {</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="comment">// OverloadChecking is symmetrical. It has the same effect on the</span></div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="comment">// straight and the mirrored version.</span></div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  straight_.OverloadChecking();</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  } <span class="keywordflow">while</span> (straight_.DetectablePrecedences() ||</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  mirror_.DetectablePrecedences());</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  } <span class="keywordflow">while</span> (straight_not_last_.Propagate() ||</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  mirror_not_last_.Propagate());</div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  } <span class="keywordflow">while</span> (straight_.EdgeFinder() || mirror_.EdgeFinder());</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  }</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  </div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordtype">bool</span> Intersect(IntervalVar* <span class="keyword">const</span> i1, IntervalVar* <span class="keyword">const</span> i2)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="keywordflow">return</span> i1->StartMin() < i2->EndMax() && i2->StartMin() < i1->EndMax();</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  }</div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  </div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="keywordtype">void</span> PropagatePerformed() {</div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  performed_.clear();</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  optional_.clear();</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keywordflow">for</span> (IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> : intervals_) {</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed()) {</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  performed_.push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  optional_.push_back(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  }</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  }</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="comment">// Checks feasibility of performed;</span></div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">if</span> (performed_.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  std::sort(performed_.begin(), performed_.end(), IntervalStartMinLessThan);</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < performed_.size() - 1; ++i) {</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keywordflow">if</span> (performed_[i]->EndMax() > performed_[i + 1]->StartMin()) {</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  }</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  }</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  </div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  <span class="comment">// Checks if optional intervals can be inserted.</span></div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">if</span> (optional_.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_performed = performed_.size();</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  std::sort(optional_.begin(), optional_.end(), IntervalStartMinLessThan);</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="keywordflow">for</span> (IntervalVar* <span class="keyword">const</span> candidate : optional_) {</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> start = candidate->StartMin();</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keywordflow">while</span> (index < num_performed && start >= performed_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]->EndMax()) {</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>++;</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  }</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> == num_performed) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">if</span> (Intersect(candidate, performed_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]) ||</div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  (<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < num_performed - 1 &&</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  Intersect(candidate, performed_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1]))) {</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  candidate->SetPerformed(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  }</div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  }</div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  </div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  visitor->BeginVisitConstraint(ModelVisitor::kDisjunctive, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  visitor->VisitIntervalArrayArgument(ModelVisitor::kIntervalsArgument,</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  intervals_);</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keywordflow">if</span> (sequence_var_ != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  visitor->VisitSequenceArgument(ModelVisitor::kSequenceArgument,</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  sequence_var_);</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  }</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  visitor->EndVisitConstraint(ModelVisitor::kDisjunctive, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  }</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  </div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  SequenceVar* MakeSequenceVar()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  BuildNextModelIfNeeded();</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keywordflow">if</span> (sequence_var_ == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  solver()->SaveValue(<span class="keyword">reinterpret_cast<</span><span class="keywordtype">void</span>**<span class="keyword">></span>(&sequence_var_));</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  sequence_var_ = solver()->RevAlloc(</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="keyword">new</span> SequenceVar(solver(), intervals_, nexts_, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>()));</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  }</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="keywordflow">return</span> sequence_var_;</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  }</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  </div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"FullDisjunctiveConstraint([%s], %i)"</span>,</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <a class="code" href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">JoinDebugStringPtr</a>(intervals_, <span class="stringliteral">", "</span>), strict_);</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  }</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  </div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keyword">const</span> std::vector<IntVar*>& nexts()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> nexts_; }</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  </div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  <span class="keyword">const</span> std::vector<IntVar*>& actives()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> actives_; }</div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  </div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keyword">const</span> std::vector<IntVar*>& time_cumuls()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  <span class="keywordflow">return</span> time_cumuls_;</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  }</div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  </div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keyword">const</span> std::vector<IntVar*>& time_slacks()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordflow">return</span> time_slacks_;</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  }</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  </div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> Distance(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> activity_plus_one, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_activity_plus_one) {</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="keywordflow">return</span> (activity_plus_one == 0 ||</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  next_activity_plus_one > intervals_.size())</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  ? 0</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  : transition_time_(activity_plus_one - 1,</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  next_activity_plus_one - 1);</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  }</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  </div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordtype">void</span> BuildNextModelIfNeeded() {</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keywordflow">if</span> (!nexts_.empty()) {</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  }</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keyword">const</span> std::string& ct_name = <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>();</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_intervals = intervals_.size();</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = intervals_.size() + 1;</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> horizon = 0;</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keywordflow">if</span> (intervals_[i]->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  horizon = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(horizon, intervals_[i]->EndMax());</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  }</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  }</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  </div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="comment">// Create the next model.</span></div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  s->MakeIntVarArray(num_nodes, 1, num_nodes, ct_name + <span class="stringliteral">"_nexts"</span>, &nexts_);</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="comment">// Alldifferent on the nexts variable (the equivalent problem is a tsp).</span></div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  s->AddConstraint(s->MakeAllDifferent(nexts_));</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  </div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  actives_.resize(num_nodes);</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_intervals; ++i) {</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  actives_[i + 1] = intervals_[i]->PerformedExpr()->Var();</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  s->AddConstraint(</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  s->MakeIsDifferentCstCt(nexts_[i + 1], i + 1, actives_[i + 1]));</div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  }</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  std::vector<IntVar*> short_actives(actives_.begin() + 1, actives_.end());</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  actives_[0] = s->MakeMax(short_actives)->Var();</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  </div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="comment">// No Cycle on the corresponding tsp.</span></div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  s->AddConstraint(s->MakeNoCycle(nexts_, actives_));</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  </div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="comment">// Cumul on time.</span></div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  time_cumuls_.resize(num_nodes + 1);</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="comment">// Slacks between activities.</span></div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  time_slacks_.resize(num_nodes);</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  </div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  time_slacks_[0] = s->MakeIntVar(0, horizon, <span class="stringliteral">"initial_slack"</span>);</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <span class="comment">// TODO(user): check this.</span></div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  time_cumuls_[0] = s->MakeIntConst(0);</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  </div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> i = 0; i < num_intervals; ++i) {</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = intervals_[i];</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> duration_min = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->DurationMin();</div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  time_slacks_[i + 1] = s->MakeIntVar(</div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  duration_min, horizon, absl::StrFormat(<span class="stringliteral">"time_slacks(%d)"</span>, i + 1));</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="comment">// TODO(user): Check SafeStartExpr();</span></div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  time_cumuls_[i + 1] = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SafeStartExpr(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->StartMin())->Var();</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->DurationMax() != duration_min) {</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  s->AddConstraint(s->MakeGreaterOrEqual(</div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  time_slacks_[i + 1], <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>->SafeDurationExpr(duration_min)));</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  }</div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  time_slacks_[i + 1] = s->MakeIntVar(</div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  0, horizon, absl::StrFormat(<span class="stringliteral">"time_slacks(%d)"</span>, i + 1));</div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  time_cumuls_[i + 1] = s->MakeIntConst(horizon);</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  }</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  }</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <span class="comment">// TODO(user): Find a better UB for the last time cumul.</span></div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  time_cumuls_[num_nodes] = s->MakeIntVar(0, 2 * horizon, ct_name + <span class="stringliteral">"_ect"</span>);</div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  s->AddConstraint(</div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  s->MakePathCumul(nexts_, actives_, time_cumuls_, time_slacks_,</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  [<span class="keyword">this</span>](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> x, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> y) { return Distance(x, y); }));</div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  </div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  std::vector<IntVar*> short_slacks(time_slacks_.begin() + 1,</div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  time_slacks_.end());</div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  s->AddConstraint(s->RevAlloc(</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="keyword">new</span> RankedPropagator(s, nexts_, intervals_, short_slacks, <span class="keyword">this</span>)));</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  }</div>
|
|
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  </div>
|
|
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  SequenceVar* sequence_var_;</div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  EdgeFinderAndDetectablePrecedences straight_;</div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  EdgeFinderAndDetectablePrecedences mirror_;</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  NotLast straight_not_last_;</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  NotLast mirror_not_last_;</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  std::vector<IntVar*> nexts_;</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  std::vector<IntVar*> actives_;</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  std::vector<IntVar*> time_cumuls_;</div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  std::vector<IntVar*> time_slacks_;</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  std::vector<IntervalVar*> performed_;</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  std::vector<IntervalVar*> optional_;</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> strict_;</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(FullDisjunctiveConstraint);</div>
|
|
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span> };</div>
|
|
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  </div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span> <span class="comment">// =====================================================================</span></div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span> <span class="comment">// Cumulative</span></div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span> <span class="comment">// =====================================================================</span></div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  </div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span> <span class="comment">// A cumulative Theta node, where two energies, corresponding to 2 capacities,</span></div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span> <span class="comment">// are stored.</span></div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span> <span class="keyword">struct </span>DualCapacityThetaNode {</div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="comment">// Special value for task indices meaning 'no such task'.</span></div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a>;</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  </div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="comment">// Identity constructor</span></div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  DualCapacityThetaNode()</div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(0LL),</div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>),</div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <a class="code" href="resource_8cc.html#a9963e75216f4b7b935649eb3e7e81c6b">residual_energetic_end_min</a>(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>) {}</div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  </div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="comment">// Constructor for a single cumulative task in the Theta set.</span></div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  DualCapacityThetaNode(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> residual_capacity,</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keyword">const</span> CumulativeTask& task)</div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(task.EnergyMin()),</div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> * task.<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(), <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>)),</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  <a class="code" href="resource_8cc.html#a9963e75216f4b7b935649eb3e7e81c6b">residual_energetic_end_min</a>(</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(residual_capacity * task.<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(), <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>)) {}</div>
|
|
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  </div>
|
|
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="comment">// Constructor for a single variable cumulative task in the Theta set.</span></div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  DualCapacityThetaNode(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> residual_capacity,</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  <span class="keyword">const</span> VariableCumulativeTask& task)</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  : <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>(task.EnergyMin()),</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> * task.<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(), <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>)),</div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <a class="code" href="resource_8cc.html#a9963e75216f4b7b935649eb3e7e81c6b">residual_energetic_end_min</a>(</div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(residual_capacity * task.<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin(), <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>)) {}</div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  </div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  <span class="comment">// Sets this DualCapacityThetaNode to the result of the natural binary</span></div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  <span class="comment">// operation over the two given operands, corresponding to the following set</span></div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="comment">// operation: Theta = left.Theta union right.Theta</span></div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  <span class="comment">// No set operation actually occur: we only maintain the relevant quantities</span></div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="comment">// associated with such sets.</span></div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="keywordtype">void</span> Compute(<span class="keyword">const</span> DualCapacityThetaNode& left,</div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="keyword">const</span> DualCapacityThetaNode& right) {</div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a> = <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.energy, right.energy);</div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.energetic_end_min, right.energy),</div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  right.energetic_end_min);</div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  <a class="code" href="resource_8cc.html#a9963e75216f4b7b935649eb3e7e81c6b">residual_energetic_end_min</a> =</div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left.residual_energetic_end_min, right.energy),</div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  right.residual_energetic_end_min);</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  }</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  </div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="comment">// Amount of resource consumed by the Theta set, in units of demand X time.</span></div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="comment">// This is energy(Theta).</span></div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>;</div>
|
|
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  </div>
|
|
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="comment">// Max_{subset S of Theta} (capacity * start_min(S) + energy(S))</span></div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a>;</div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  </div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="comment">// Max_{subset S of Theta} (residual_capacity * start_min(S) + energy(S))</span></div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"><a class="line" href="resource_8cc.html#a9963e75216f4b7b935649eb3e7e81c6b"> 1235</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a9963e75216f4b7b935649eb3e7e81c6b">residual_energetic_end_min</a>;</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span> };</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  </div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">DualCapacityThetaNode::kNone</a> = -1;</div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  </div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span> <span class="comment">// A tree for dual capacity theta nodes</span></div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span> <span class="keyword">class </span>DualCapacityThetaTree</div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  : <span class="keyword">public</span> MonoidOperationTree<DualCapacityThetaNode> {</div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"><a class="line" href="resource_8cc.html#aa20b709e09ee1ec845d311fe197cd0a7"> 1244</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#aa20b709e09ee1ec845d311fe197cd0a7">kNotInitialized</a>;</div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  </div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="keyword">explicit</span> DualCapacityThetaTree(<span class="keywordtype">int</span> size)</div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  : MonoidOperationTree<DualCapacityThetaNode>(size),</div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  capacity_max_(-1),</div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  residual_capacity_(-1) {}</div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  </div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  <span class="keyword">virtual</span> ~DualCapacityThetaTree() {}</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  </div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keywordtype">void</span> Init(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_max, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> residual_capacity) {</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(0, residual_capacity);</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(residual_capacity, capacity_max);</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  Clear();</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  capacity_max_ = capacity_max;</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  residual_capacity_ = residual_capacity;</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  }</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  </div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keywordtype">void</span> Insert(<span class="keyword">const</span> CumulativeTask* task) {</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  Set(task->index,</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  DualCapacityThetaNode(capacity_max_, residual_capacity_, *task));</div>
|
|
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  }</div>
|
|
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  </div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="keywordtype">void</span> Insert(<span class="keyword">const</span> VariableCumulativeTask* task) {</div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  Set(task->index,</div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  DualCapacityThetaNode(capacity_max_, residual_capacity_, *task));</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  }</div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  </div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_max_;</div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> residual_capacity_;</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(DualCapacityThetaTree);</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span> };</div>
|
|
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  </div>
|
|
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#aa20b709e09ee1ec845d311fe197cd0a7">DualCapacityThetaTree::kNotInitialized</a> = -1LL;</div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  </div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span> <span class="comment">// An object that can dive down a branch of a DualCapacityThetaTree to compute</span></div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span> <span class="comment">// Env(j, c) in Petr Vilim's notations.</span></div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span> <span class="comment">// In 'Edge finding filtering algorithm for discrete cumulative resources in</span></div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span> <span class="comment">// O(kn log n)' by Petr Vilim, this corresponds to line 6--8 in algorithm 1.3,</span></div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span> <span class="comment">// plus all of algorithm 1.2.</span></div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span> <span class="comment">// http://vilim.eu/petr/cp2009.pdf</span></div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> <span class="comment">// Note: use the version pointed to by this pointer, not the version from the</span></div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span> <span class="comment">// conference proceedings, which has a few errors.</span></div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span> <span class="keyword">class </span>EnvJCComputeDiver {</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"><a class="line" href="resource_8cc.html#aaf8ce6c1dff1e40b52ef7e0cb71f0020"> 1291</a></span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#aaf8ce6c1dff1e40b52ef7e0cb71f0020">kNotAvailable</a>;</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keyword">explicit</span> EnvJCComputeDiver(<span class="keywordtype">int</span> energy_threshold)</div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  : energy_threshold_(energy_threshold),</div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  energy_alpha_(<a class="code" href="resource_8cc.html#aaf8ce6c1dff1e40b52ef7e0cb71f0020">kNotAvailable</a>),</div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  energetic_end_min_alpha_(<a class="code" href="resource_8cc.html#aaf8ce6c1dff1e40b52ef7e0cb71f0020">kNotAvailable</a>) {}</div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="keywordtype">void</span> OnArgumentReached(<span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keyword">const</span> DualCapacityThetaNode& argument) {</div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  energy_alpha_ = argument.energy;</div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  energetic_end_min_alpha_ = argument.energetic_end_min;</div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="comment">// We should reach a leaf that is not the identity</span></div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="comment">// DCHECK_GT(energetic_end_min_alpha_, kint64min);</span></div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="comment">// TODO(user): Check me.</span></div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  }</div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordtype">bool</span> ChooseGoLeft(<span class="keyword">const</span> DualCapacityThetaNode& current,</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keyword">const</span> DualCapacityThetaNode& left_child,</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  <span class="keyword">const</span> DualCapacityThetaNode& right_child) {</div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  <span class="keywordflow">if</span> (right_child.residual_energetic_end_min > energy_threshold_) {</div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// enough energy on right</span></div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  energy_threshold_ -= right_child.energy;</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  }</div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  }</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  <span class="keywordtype">void</span> OnComeBackFromLeft(<span class="keyword">const</span> DualCapacityThetaNode& current,</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="keyword">const</span> DualCapacityThetaNode& left_child,</div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  <span class="keyword">const</span> DualCapacityThetaNode& right_child) {</div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="comment">// The left subtree intersects the alpha set.</span></div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="comment">// The right subtree does not intersect the alpha set.</span></div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="comment">// The energy_alpha_ and energetic_end_min_alpha_ previously</span></div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="comment">// computed are valid for this node too: there's nothing to do.</span></div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  }</div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keywordtype">void</span> OnComeBackFromRight(<span class="keyword">const</span> DualCapacityThetaNode& current,</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keyword">const</span> DualCapacityThetaNode& left_child,</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keyword">const</span> DualCapacityThetaNode& right_child) {</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="comment">// The left subtree is included in the alpha set.</span></div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="comment">// The right subtree intersects the alpha set.</span></div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  energetic_end_min_alpha_ =</div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(energetic_end_min_alpha_,</div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(left_child.energetic_end_min, energy_alpha_));</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  energy_alpha_ += left_child.energy;</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  }</div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> GetEnvJC(<span class="keyword">const</span> DualCapacityThetaNode& root)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a> = root.energy;</div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> energy_beta = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(<a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>, energy_alpha_);</div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(energetic_end_min_alpha_, energy_beta);</div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  }</div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  </div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  <span class="comment">// Energy threshold such that if a set has an energetic_end_min greater than</span></div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="comment">// the threshold, then it can push tasks that must end at or after the</span></div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="comment">// currently considered end max.</span></div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="comment">// Used when diving down only.</span></div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> energy_threshold_;</div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  </div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="comment">// Energy of the alpha set, that is, the set of tasks whose start min does not</span></div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  <span class="comment">// exceed the max start min of a set with excess residual energy.</span></div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="comment">// Used when swimming up only.</span></div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> energy_alpha_;</div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  </div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="comment">// Energetic end min of the alpha set.</span></div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <span class="comment">// Used when swimming up only.</span></div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> energetic_end_min_alpha_;</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span> };</div>
|
|
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>  </div>
|
|
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span> <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#aaf8ce6c1dff1e40b52ef7e0cb71f0020">EnvJCComputeDiver::kNotAvailable</a> = -1LL;</div>
|
|
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  </div>
|
|
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span> <span class="comment">// In all the following, the term 'update' means 'a potential new start min for</span></div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span> <span class="comment">// a task'. The edge-finding algorithm is in two phase: one compute potential</span></div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span> <span class="comment">// new start mins, the other detects whether they are applicable or not for each</span></div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span> <span class="comment">// task.</span></div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  </div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span> <span class="comment">// Collection of all updates (i.e., potential new start mins) for a given value</span></div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span> <span class="comment">// of the demand.</span></div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span> <span class="keyword">class </span>UpdatesForADemand {</div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  <span class="keyword">explicit</span> UpdatesForADemand(<span class="keywordtype">int</span> size)</div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  : updates_(size, 0), up_to_date_(false) {}</div>
|
|
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  </div>
|
|
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> Update(<span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) { <span class="keywordflow">return</span> updates_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]; }</div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="keywordtype">void</span> Reset() { up_to_date_ = <span class="keyword">false</span>; }</div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="keywordtype">void</span> SetUpdate(<span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> update) {</div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!up_to_date_);</div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, updates_.size());</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  updates_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = update;</div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  }</div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  <span class="keywordtype">bool</span> up_to_date()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> up_to_date_; }</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  <span class="keywordtype">void</span> set_up_to_date() { up_to_date_ = <span class="keyword">true</span>; }</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  </div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  std::vector<int64> updates_;</div>
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="keywordtype">bool</span> up_to_date_;</div>
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(UpdatesForADemand);</div>
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span> };</div>
|
|
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  </div>
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span> <span class="comment">// One-sided cumulative edge finder.</span></div>
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span> <span class="keyword">template</span> <<span class="keyword">class</span> Task></div>
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span> <span class="keyword">class </span>EdgeFinder : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  EdgeFinder(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<Task*>& tasks,</div>
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  IntVar* <span class="keyword">const</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>)</div>
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  : Constraint(solver),</div>
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  capacity_(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>),</div>
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  tasks_(tasks),</div>
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  by_start_min_(tasks.size()),</div>
|
|
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  by_end_max_(tasks.size()),</div>
|
|
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  by_end_min_(tasks.size()),</div>
|
|
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  lt_tree_(tasks.size(), capacity_->Max()),</div>
|
|
<div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  dual_capacity_tree_(tasks.size()),</div>
|
|
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  has_zero_demand_tasks_(true) {}</div>
|
|
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>  </div>
|
|
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  ~EdgeFinder()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>  <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&tasks_);</div>
|
|
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <a class="code" href="namespacegtl.html#a115efd2ec0ec9c7ced30f4daadd89ab7">gtl::STLDeleteValues</a>(&update_map_);</div>
|
|
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  }</div>
|
|
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  </div>
|
|
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  <span class="comment">// Add the demons</span></div>
|
|
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  Demon* <span class="keyword">const</span> demon = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  solver(), <span class="keyword">this</span>, &EdgeFinder::InitialPropagate, <span class="stringliteral">"RangeChanged"</span>);</div>
|
|
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordflow">for</span> (Task* <span class="keyword">const</span> task : tasks_) {</div>
|
|
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="comment">// Delay propagation, as this constraint is not incremental: we pay</span></div>
|
|
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="comment">// O(n log n) each time the constraint is awakened.</span></div>
|
|
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  task->WhenAnything(demon);</div>
|
|
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  }</div>
|
|
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  capacity_->WhenRange(demon);</div>
|
|
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  }</div>
|
|
<div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  </div>
|
|
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  <span class="comment">// The propagation algorithms: checks for overloading, computes new start mins</span></div>
|
|
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  <span class="comment">// according to the edge-finding rules, and applies them.</span></div>
|
|
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  InitPropagation();</div>
|
|
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  PropagateBasedOnEndMinGreaterThanEndMax();</div>
|
|
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  FillInTree();</div>
|
|
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  PropagateBasedOnEnergy();</div>
|
|
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  ApplyNewBounds();</div>
|
|
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  }</div>
|
|
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  </div>
|
|
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should Not Be Visited"</span>;</div>
|
|
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  }</div>
|
|
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  </div>
|
|
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"EdgeFinder"</span>; }</div>
|
|
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  </div>
|
|
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  UpdatesForADemand* GetOrMakeUpdate(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> demand_min) {</div>
|
|
<div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  UpdatesForADemand* update = <a class="code" href="namespacegtl.html#a10ae48a53bb9d0ce3024501a7750260b">gtl::FindPtrOrNull</a>(update_map_, demand_min);</div>
|
|
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <span class="keywordflow">if</span> (update == <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  update = <span class="keyword">new</span> UpdatesForADemand(tasks_.size());</div>
|
|
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  update_map_[demand_min] = update;</div>
|
|
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  }</div>
|
|
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  <span class="keywordflow">return</span> update;</div>
|
|
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  }</div>
|
|
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  </div>
|
|
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="comment">// Sets the fields in a proper state to run the propagation algorithm.</span></div>
|
|
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="keywordtype">void</span> InitPropagation() {</div>
|
|
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  <span class="comment">// Clear the update stack</span></div>
|
|
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  start_min_update_.clear();</div>
|
|
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  <span class="comment">// Re_init vectors if has_zero_demand_tasks_ is true</span></div>
|
|
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  <span class="keywordflow">if</span> (has_zero_demand_tasks_.Value()) {</div>
|
|
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  by_start_min_.clear();</div>
|
|
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  by_end_min_.clear();</div>
|
|
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  by_end_max_.clear();</div>
|
|
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <span class="comment">// Only populate tasks with demand_min > 0.</span></div>
|
|
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="keywordtype">bool</span> zero_demand = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <span class="keywordflow">for</span> (Task* <span class="keyword">const</span> task : tasks_) {</div>
|
|
<div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  <span class="keywordflow">if</span> (task->DemandMin() > 0) {</div>
|
|
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  by_start_min_.push_back(task);</div>
|
|
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  by_end_min_.push_back(task);</div>
|
|
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  by_end_max_.push_back(task);</div>
|
|
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  zero_demand = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  }</div>
|
|
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  }</div>
|
|
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  <span class="keywordflow">if</span> (!zero_demand) {</div>
|
|
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  has_zero_demand_tasks_.SetValue(solver(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  }</div>
|
|
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  }</div>
|
|
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  </div>
|
|
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="comment">// sort by start min.</span></div>
|
|
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  std::sort(by_start_min_.begin(), by_start_min_.end(),</div>
|
|
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  StartMinLessThan<Task>);</div>
|
|
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < by_start_min_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  by_start_min_[i]->index = i;</div>
|
|
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  }</div>
|
|
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  <span class="comment">// Sort by end max.</span></div>
|
|
<div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  std::sort(by_end_max_.begin(), by_end_max_.end(), EndMaxLessThan<Task>);</div>
|
|
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  <span class="comment">// Sort by end min.</span></div>
|
|
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  std::sort(by_end_min_.begin(), by_end_min_.end(), EndMinLessThan<Task>);</div>
|
|
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <span class="comment">// Initialize the tree with the new capacity.</span></div>
|
|
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  lt_tree_.Init(capacity_->Max());</div>
|
|
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  <span class="comment">// Clear updates</span></div>
|
|
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& entry : update_map_) {</div>
|
|
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  entry.second->Reset();</div>
|
|
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>  }</div>
|
|
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>  }</div>
|
|
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  </div>
|
|
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  <span class="comment">// Computes all possible update values for tasks of given demand, and stores</span></div>
|
|
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  <span class="comment">// these values in update_map_[demand].</span></div>
|
|
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  <span class="comment">// Runs in O(n log n).</span></div>
|
|
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  <span class="comment">// This corresponds to lines 2--13 in algorithm 1.3 in Petr Vilim's paper.</span></div>
|
|
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  <span class="keywordtype">void</span> ComputeConditionalStartMins(UpdatesForADemand* updates,</div>
|
|
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> demand_min) {</div>
|
|
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(demand_min, 0);</div>
|
|
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(updates != <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> capacity_max = capacity_->Max();</div>
|
|
<div class="line"><a name="l01498"></a><span class="lineno"> 1498</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> residual_capacity = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(capacity_max, demand_min);</div>
|
|
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  dual_capacity_tree_.Init(capacity_max, residual_capacity);</div>
|
|
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  <span class="comment">// It's important to initialize the update at IntervalVar::kMinValidValue</span></div>
|
|
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  <span class="comment">// rather than at kInt64min, because its opposite may be used if it's a</span></div>
|
|
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  <span class="comment">// mirror variable, and</span></div>
|
|
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="comment">// -kInt64min = -(-kInt64max - 1) = kInt64max + 1 = -kInt64min</span></div>
|
|
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> update = IntervalVar::kMinValidValue;</div>
|
|
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < by_end_max_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  Task* <span class="keyword">const</span> task = by_end_max_[i];</div>
|
|
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keywordflow">if</span> (task->EnergyMin() == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> current_end_max = task->interval->EndMax();</div>
|
|
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  dual_capacity_tree_.Insert(task);</div>
|
|
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> energy_threshold = residual_capacity * current_end_max;</div>
|
|
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  <span class="keyword">const</span> DualCapacityThetaNode& root = dual_capacity_tree_.result();</div>
|
|
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> res_energetic_end_min = root.residual_energetic_end_min;</div>
|
|
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  <span class="keywordflow">if</span> (res_energetic_end_min > energy_threshold) {</div>
|
|
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  EnvJCComputeDiver diver(energy_threshold);</div>
|
|
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  dual_capacity_tree_.DiveInTree(&diver);</div>
|
|
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> enjv = diver.GetEnvJC(dual_capacity_tree_.result());</div>
|
|
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> numerator = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(enjv, energy_threshold);</div>
|
|
<div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> diff = MathUtil::CeilOfRatio(numerator, demand_min);</div>
|
|
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  update = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(update, diff);</div>
|
|
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  }</div>
|
|
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  updates->SetUpdate(i, update);</div>
|
|
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  }</div>
|
|
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  updates->set_up_to_date();</div>
|
|
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  }</div>
|
|
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  </div>
|
|
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  <span class="comment">// Returns the new start min that can be inferred for task_to_push if it is</span></div>
|
|
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  <span class="comment">// proved that it cannot end before by_end_max[end_max_index] does.</span></div>
|
|
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> ConditionalStartMin(<span class="keyword">const</span> Task& task_to_push, <span class="keywordtype">int</span> end_max_index) {</div>
|
|
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="keywordflow">if</span> (task_to_push.EnergyMin() == 0) {</div>
|
|
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  <span class="keywordflow">return</span> task_to_push.interval->StartMin();</div>
|
|
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  }</div>
|
|
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> demand_min = task_to_push.DemandMin();</div>
|
|
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  UpdatesForADemand* <span class="keyword">const</span> updates = GetOrMakeUpdate(demand_min);</div>
|
|
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <span class="keywordflow">if</span> (!updates->up_to_date()) {</div>
|
|
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  ComputeConditionalStartMins(updates, demand_min);</div>
|
|
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  }</div>
|
|
<div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(updates->up_to_date());</div>
|
|
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <span class="keywordflow">return</span> updates->Update(end_max_index);</div>
|
|
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  }</div>
|
|
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  </div>
|
|
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <span class="comment">// Propagates by discovering all end-after-end relationships purely based on</span></div>
|
|
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  <span class="comment">// comparisons between end mins and end maxes: there is no energetic reasoning</span></div>
|
|
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  <span class="comment">// here, but this allow updates that the standard edge-finding detection rule</span></div>
|
|
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  <span class="comment">// misses.</span></div>
|
|
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="comment">// See paragraph 6.2 in http://vilim.eu/petr/cp2009.pdf.</span></div>
|
|
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  <span class="keywordtype">void</span> PropagateBasedOnEndMinGreaterThanEndMax() {</div>
|
|
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  <span class="keywordtype">int</span> end_max_index = 0;</div>
|
|
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_start_min = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  <span class="keywordflow">for</span> (Task* <span class="keyword">const</span> task : by_end_min_) {</div>
|
|
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a> = task->interval->EndMin();</div>
|
|
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  <span class="keywordflow">while</span> (end_max_index < by_start_min_.size() &&</div>
|
|
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  by_end_max_[end_max_index]->interval->EndMax() <= <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>) {</div>
|
|
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  max_start_min = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(</div>
|
|
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  max_start_min, by_end_max_[end_max_index]-><a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin());</div>
|
|
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  ++end_max_index;</div>
|
|
<div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  }</div>
|
|
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  <span class="keywordflow">if</span> (end_max_index > 0 && task->interval->StartMin() <= max_start_min &&</div>
|
|
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  task->interval->EndMax() > task->interval->EndMin()) {</div>
|
|
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(by_end_max_[end_max_index - 1]-><a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMax(), <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>);</div>
|
|
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="comment">// The update is valid and may be interesting:</span></div>
|
|
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  <span class="comment">// * If task->StartMin() > max_start_min, then all tasks whose end_max</span></div>
|
|
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  <span class="comment">// is less than or equal to end_min have a start min that is less</span></div>
|
|
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  <span class="comment">// than task->StartMin(). In this case, any update we could</span></div>
|
|
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  <span class="comment">// compute would also be computed by the standard edge-finding</span></div>
|
|
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  <span class="comment">// rule. It's better not to compute it, then: it may not be</span></div>
|
|
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  <span class="comment">// needed.</span></div>
|
|
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <span class="comment">// * If task->EndMax() <= task->EndMin(), that means the end max is</span></div>
|
|
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  <span class="comment">// bound. In that case, 'task' itself belong to the set of tasks</span></div>
|
|
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  <span class="comment">// that must end before end_min, which may cause the result of</span></div>
|
|
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  <span class="comment">// ConditionalStartMin(task, end_max_index - 1) not to be a valid</span></div>
|
|
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  <span class="comment">// update.</span></div>
|
|
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> update = ConditionalStartMin(*task, end_max_index - 1);</div>
|
|
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  start_min_update_.push_back(std::make_pair(task->interval, update));</div>
|
|
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  }</div>
|
|
<div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  }</div>
|
|
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  }</div>
|
|
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  </div>
|
|
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  <span class="comment">// Fill the theta-lambda-tree, and check for overloading.</span></div>
|
|
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  <span class="keywordtype">void</span> FillInTree() {</div>
|
|
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  <span class="keywordflow">for</span> (Task* <span class="keyword">const</span> task : by_end_max_) {</div>
|
|
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  lt_tree_.Insert(*task);</div>
|
|
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  <span class="comment">// Maximum energetic end min without overload.</span></div>
|
|
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_feasible =</div>
|
|
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(capacity_->Max(), task->interval->EndMax());</div>
|
|
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  <span class="keywordflow">if</span> (lt_tree_.energetic_end_min() > max_feasible) {</div>
|
|
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  solver()->Fail();</div>
|
|
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  }</div>
|
|
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  }</div>
|
|
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  }</div>
|
|
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  </div>
|
|
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  <span class="comment">// The heart of the propagation algorithm. Should be called with all tasks</span></div>
|
|
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  <span class="comment">// being in the Theta set. It detects tasks that need to be pushed.</span></div>
|
|
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  <span class="keywordtype">void</span> PropagateBasedOnEnergy() {</div>
|
|
<div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = by_start_min_.size() - 2; j >= 0; --j) {</div>
|
|
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  lt_tree_.Grey(*by_end_max_[j + 1]);</div>
|
|
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  Task* <span class="keyword">const</span> twj = by_end_max_[j];</div>
|
|
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  <span class="comment">// We should have checked for overload earlier.</span></div>
|
|
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_feasible =</div>
|
|
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <a class="code" href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">CapProd</a>(capacity_->Max(), twj->interval->EndMax());</div>
|
|
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(lt_tree_.energetic_end_min(), max_feasible);</div>
|
|
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  <span class="keywordflow">while</span> (lt_tree_.energetic_end_min_opt() > max_feasible) {</div>
|
|
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> i = lt_tree_.argmax_energetic_end_min_opt();</div>
|
|
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(i, 0);</div>
|
|
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  PropagateTaskCannotEndBefore(i, j);</div>
|
|
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  lt_tree_.Reset(i);</div>
|
|
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  }</div>
|
|
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  }</div>
|
|
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  }</div>
|
|
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  </div>
|
|
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  <span class="comment">// Takes into account the fact that the task of given index cannot end before</span></div>
|
|
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  <span class="comment">// the given new end min.</span></div>
|
|
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <span class="keywordtype">void</span> PropagateTaskCannotEndBefore(<span class="keywordtype">int</span> <a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, <span class="keywordtype">int</span> end_max_index) {</div>
|
|
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  Task* <span class="keyword">const</span> task_to_push = by_start_min_[<a class="code" href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> update = ConditionalStartMin(*task_to_push, end_max_index);</div>
|
|
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  start_min_update_.push_back(std::make_pair(task_to_push->interval, update));</div>
|
|
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  }</div>
|
|
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  </div>
|
|
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  <span class="comment">// Applies the previously computed updates.</span></div>
|
|
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  <span class="keywordtype">void</span> ApplyNewBounds() {</div>
|
|
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> std::pair<IntervalVar*, int64>& update : start_min_update_) {</div>
|
|
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  update.first->SetStartMin(update.second);</div>
|
|
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  }</div>
|
|
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  }</div>
|
|
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  </div>
|
|
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  <span class="comment">// Capacity of the cumulative resource.</span></div>
|
|
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  IntVar* <span class="keyword">const</span> capacity_;</div>
|
|
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  </div>
|
|
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="comment">// Initial vector of tasks</span></div>
|
|
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  std::vector<Task*> tasks_;</div>
|
|
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>  </div>
|
|
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  <span class="comment">// Cumulative tasks, ordered by non-decreasing start min.</span></div>
|
|
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>  std::vector<Task*> by_start_min_;</div>
|
|
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  </div>
|
|
<div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  <span class="comment">// Cumulative tasks, ordered by non-decreasing end max.</span></div>
|
|
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  std::vector<Task*> by_end_max_;</div>
|
|
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  </div>
|
|
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  <span class="comment">// Cumulative tasks, ordered by non-decreasing end min.</span></div>
|
|
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  std::vector<Task*> by_end_min_;</div>
|
|
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>  </div>
|
|
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <span class="comment">// Cumulative theta-lamba tree.</span></div>
|
|
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  CumulativeLambdaThetaTree lt_tree_;</div>
|
|
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  </div>
|
|
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>  <span class="comment">// Needed by ComputeConditionalStartMins.</span></div>
|
|
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  DualCapacityThetaTree dual_capacity_tree_;</div>
|
|
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>  </div>
|
|
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  <span class="comment">// Stack of updates to the new start min to do.</span></div>
|
|
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>  std::vector<std::pair<IntervalVar*, int64>> start_min_update_;</div>
|
|
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>  </div>
|
|
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="comment">// update_map_[d][i] is an integer such that if a task</span></div>
|
|
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  <span class="comment">// whose demand is d cannot end before by_end_max_[i], then it cannot start</span></div>
|
|
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  <span class="comment">// before update_map_[d][i].</span></div>
|
|
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  absl::flat_hash_map<int64, UpdatesForADemand*> update_map_;</div>
|
|
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  </div>
|
|
<div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  <span class="comment">// Has one task a demand min == 0</span></div>
|
|
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  Rev<bool> has_zero_demand_tasks_;</div>
|
|
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  </div>
|
|
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(EdgeFinder);</div>
|
|
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span> };</div>
|
|
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  </div>
|
|
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span> <span class="comment">// A point in time where the usage profile changes.</span></div>
|
|
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span> <span class="comment">// Starting from time (included), the usage is what it was immediately before</span></div>
|
|
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span> <span class="comment">// time, plus the delta.</span></div>
|
|
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span> <span class="comment">// Example:</span></div>
|
|
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span> <span class="comment">// Consider the following vector of ProfileDelta's:</span></div>
|
|
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span> <span class="comment">// { t=1, d=+3}, { t=4, d=+1 }, { t=5, d=-2}, { t=8, d=-1}</span></div>
|
|
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span> <span class="comment">// This represents the following usage profile:</span></div>
|
|
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span> <span class="comment">// usage</span></div>
|
|
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span> <span class="comment">// 4 | ****.</span></div>
|
|
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span> <span class="comment">// 3 | ************. .</span></div>
|
|
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span> <span class="comment">// 2 | . . ************.</span></div>
|
|
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span> <span class="comment">// 1 | . . . .</span></div>
|
|
<div class="line"><a name="l01674"></a><span class="lineno"> 1674</span> <span class="comment">// 0 |*******----------------------------*******************-> time</span></div>
|
|
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span> <span class="comment">// 0 1 2 3 4 5 6 7 8 9</span></div>
|
|
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span> <span class="comment">// Note that the usage profile is right-continuous (see</span></div>
|
|
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span> <span class="comment">// http://en.wikipedia.org/wiki/Left-continuous#Directional_continuity).</span></div>
|
|
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span> <span class="comment">// This is because intervals for tasks are always closed on the start side</span></div>
|
|
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span> <span class="comment">// and open on the end side.</span></div>
|
|
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span> <span class="keyword">struct </span>ProfileDelta {</div>
|
|
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  ProfileDelta(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> _time, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> _delta) : <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>(_time), <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>(_delta) {}</div>
|
|
<div class="line"><a name="l01683"></a><span class="lineno"><a class="line" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc"> 1683</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l01684"></a><span class="lineno"><a class="line" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442"> 1684</a></span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a>;</div>
|
|
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span> };</div>
|
|
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  </div>
|
|
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span> <span class="keywordtype">bool</span> TimeLessThan(<span class="keyword">const</span> ProfileDelta& delta1, <span class="keyword">const</span> ProfileDelta& delta2) {</div>
|
|
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  <span class="keywordflow">return</span> delta1.time < delta2.time;</div>
|
|
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span> }</div>
|
|
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  </div>
|
|
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span> <span class="comment">// Cumulative time-table.</span></div>
|
|
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01693"></a><span class="lineno"> 1693</span> <span class="comment">// This class implements a propagator for the CumulativeConstraint which is not</span></div>
|
|
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span> <span class="comment">// incremental, and where a call to InitialPropagate() takes time which is</span></div>
|
|
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span> <span class="comment">// O(n^2) and Omega(n log n) with n the number of cumulative tasks.</span></div>
|
|
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span> <span class="comment">// Despite the high complexity, this propagator is needed, because of those</span></div>
|
|
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span> <span class="comment">// implemented, it is the only one that satisfy that if all instantiated, no</span></div>
|
|
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span> <span class="comment">// contradiction will be detected if and only if the constraint is satisfied.</span></div>
|
|
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span> <span class="comment">// The implementation is quite naive, and could certainly be improved, for</span></div>
|
|
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span> <span class="comment">// example by maintaining the profile incrementally.</span></div>
|
|
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span> <span class="keyword">template</span> <<span class="keyword">class</span> Task></div>
|
|
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span> <span class="keyword">class </span>CumulativeTimeTable : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>  CumulativeTimeTable(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<Task*>& tasks,</div>
|
|
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  IntVar* <span class="keyword">const</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>)</div>
|
|
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>  : Constraint(solver), by_start_min_(tasks), capacity_(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>) {</div>
|
|
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>  <span class="comment">// There may be up to 2 delta's per interval (one on each side),</span></div>
|
|
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  <span class="comment">// plus two sentinels</span></div>
|
|
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> profile_max_size = 2 * by_start_min_.size() + 2;</div>
|
|
<div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  profile_non_unique_time_.reserve(profile_max_size);</div>
|
|
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  profile_unique_time_.reserve(profile_max_size);</div>
|
|
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  }</div>
|
|
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  </div>
|
|
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  ~CumulativeTimeTable()<span class="keyword"> override </span>{ <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&by_start_min_); }</div>
|
|
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  </div>
|
|
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  BuildProfile();</div>
|
|
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  PushTasks();</div>
|
|
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  <span class="comment">// TODO(user): When a task has a fixed part, we could propagate</span></div>
|
|
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  <span class="comment">// max_demand from its current location.</span></div>
|
|
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  }</div>
|
|
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  </div>
|
|
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  Demon* demon = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  solver(), <span class="keyword">this</span>, &CumulativeTimeTable::InitialPropagate,</div>
|
|
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  <span class="stringliteral">"InitialPropagate"</span>);</div>
|
|
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  <span class="keywordflow">for</span> (Task* <span class="keyword">const</span> task : by_start_min_) {</div>
|
|
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  task->WhenAnything(demon);</div>
|
|
<div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  }</div>
|
|
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  capacity_->WhenRange(demon);</div>
|
|
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  }</div>
|
|
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  </div>
|
|
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be visited"</span>;</div>
|
|
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  }</div>
|
|
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  </div>
|
|
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"CumulativeTimeTable"</span>; }</div>
|
|
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  </div>
|
|
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  <span class="comment">// Build the usage profile. Runs in O(n log n).</span></div>
|
|
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  <span class="keywordtype">void</span> BuildProfile() {</div>
|
|
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  <span class="comment">// Build profile with non unique time</span></div>
|
|
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  profile_non_unique_time_.clear();</div>
|
|
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Task* <span class="keyword">const</span> task : by_start_min_) {</div>
|
|
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  <span class="keyword">const</span> IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = task->interval;</div>
|
|
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax();</div>
|
|
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a> = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin();</div>
|
|
<div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed() && <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> < <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>) {</div>
|
|
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> demand_min = task->DemandMin();</div>
|
|
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  <span class="keywordflow">if</span> (demand_min > 0) {</div>
|
|
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  profile_non_unique_time_.emplace_back(<a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>, +demand_min);</div>
|
|
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  profile_non_unique_time_.emplace_back(<a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>, -demand_min);</div>
|
|
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  }</div>
|
|
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  }</div>
|
|
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  }</div>
|
|
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  <span class="comment">// Sort</span></div>
|
|
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  std::sort(profile_non_unique_time_.begin(), profile_non_unique_time_.end(),</div>
|
|
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  TimeLessThan);</div>
|
|
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  <span class="comment">// Build profile with unique times</span></div>
|
|
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  profile_unique_time_.clear();</div>
|
|
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  profile_unique_time_.emplace_back(<a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>, 0);</div>
|
|
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> usage = 0;</div>
|
|
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ProfileDelta& step : profile_non_unique_time_) {</div>
|
|
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  <span class="keywordflow">if</span> (step.time == profile_unique_time_.back().time) {</div>
|
|
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  profile_unique_time_.back().delta += step.delta;</div>
|
|
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  profile_unique_time_.push_back(step);</div>
|
|
<div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  }</div>
|
|
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  <span class="comment">// Update usage.</span></div>
|
|
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  usage += step.delta;</div>
|
|
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  }</div>
|
|
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  <span class="comment">// Check final usage to be 0.</span></div>
|
|
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, usage);</div>
|
|
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  <span class="comment">// Scan to find max usage.</span></div>
|
|
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_usage = 0;</div>
|
|
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> ProfileDelta& step : profile_unique_time_) {</div>
|
|
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  usage += step.delta;</div>
|
|
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  <span class="keywordflow">if</span> (usage > max_usage) {</div>
|
|
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  max_usage = usage;</div>
|
|
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  }</div>
|
|
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  }</div>
|
|
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(0, usage);</div>
|
|
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  capacity_->SetMin(max_usage);</div>
|
|
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  <span class="comment">// Add a sentinel.</span></div>
|
|
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  profile_unique_time_.emplace_back(<a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>, 0);</div>
|
|
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  }</div>
|
|
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  </div>
|
|
<div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  <span class="comment">// Update the start min for all tasks. Runs in O(n^2) and Omega(n).</span></div>
|
|
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  <span class="keywordtype">void</span> PushTasks() {</div>
|
|
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  std::sort(by_start_min_.begin(), by_start_min_.end(),</div>
|
|
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  StartMinLessThan<Task>);</div>
|
|
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> usage = 0;</div>
|
|
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  <span class="keywordtype">int</span> profile_index = 0;</div>
|
|
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Task* <span class="keyword">const</span> task : by_start_min_) {</div>
|
|
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  <span class="keyword">const</span> IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = task->interval;</div>
|
|
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin() == <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax() &&</div>
|
|
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin() == <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMax()) {</div>
|
|
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  }</div>
|
|
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  <span class="keywordflow">while</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin() > profile_unique_time_[profile_index].time) {</div>
|
|
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(profile_index < profile_unique_time_.size());</div>
|
|
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  ++profile_index;</div>
|
|
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  usage += profile_unique_time_[profile_index].delta;</div>
|
|
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  }</div>
|
|
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  PushTask(task, profile_index, usage);</div>
|
|
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  }</div>
|
|
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  }</div>
|
|
<div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  </div>
|
|
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  <span class="comment">// Push the given task to new_start_min, defined as the smallest integer such</span></div>
|
|
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="comment">// that the profile usage for all tasks, excluding the current one, does not</span></div>
|
|
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="comment">// exceed capacity_ - task->demand on the interval</span></div>
|
|
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  <span class="comment">// [new_start_min, new_start_min + task->interval->DurationMin() ).</span></div>
|
|
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  <span class="keywordtype">void</span> PushTask(<span class="keyword">const</span> Task* <span class="keyword">const</span> task, <span class="keywordtype">int</span> profile_index, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> usage) {</div>
|
|
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  <span class="comment">// Init</span></div>
|
|
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  <span class="keyword">const</span> IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = task->interval;</div>
|
|
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> demand_min = task->DemandMin();</div>
|
|
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  <span class="keywordflow">if</span> (demand_min == 0) { <span class="comment">// Demand can be null, nothing to propagate.</span></div>
|
|
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  }</div>
|
|
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> residual_capacity = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(capacity_->Max(), demand_min);</div>
|
|
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> duration = task->interval->DurationMin();</div>
|
|
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  <span class="keyword">const</span> ProfileDelta& first_prof_delta = profile_unique_time_[profile_index];</div>
|
|
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  </div>
|
|
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_start_min = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin();</div>
|
|
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  </div>
|
|
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(first_prof_delta.time, <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin());</div>
|
|
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="comment">// The check above is with a '>='. Let's first treat the '>' case</span></div>
|
|
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="keywordflow">if</span> (first_prof_delta.time > <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMin()) {</div>
|
|
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  <span class="comment">// There was no profile delta at a time between interval->StartMin()</span></div>
|
|
<div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  <span class="comment">// (included) and the current one.</span></div>
|
|
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  <span class="comment">// As we don't delete delta's of 0 value, this means the current task</span></div>
|
|
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  <span class="comment">// does not contribute to the usage before:</span></div>
|
|
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>((<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax() >= first_prof_delta.time) ||</div>
|
|
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax() >= <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin()));</div>
|
|
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  <span class="comment">// The 'usage' given in argument is valid at first_prof_delta.time. To</span></div>
|
|
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  <span class="comment">// compute the usage at the start min, we need to remove the last delta.</span></div>
|
|
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> usage_at_start_min = <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(usage, first_prof_delta.delta);</div>
|
|
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  <span class="keywordflow">if</span> (usage_at_start_min > residual_capacity) {</div>
|
|
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  new_start_min = profile_unique_time_[profile_index].time;</div>
|
|
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  }</div>
|
|
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  }</div>
|
|
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  </div>
|
|
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  <span class="comment">// Influence of current task</span></div>
|
|
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->StartMax();</div>
|
|
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a> = <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->EndMin();</div>
|
|
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>  ProfileDelta delta_start(<a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>, 0);</div>
|
|
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  ProfileDelta delta_end(<a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>, 0);</div>
|
|
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MustBePerformed() && <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> < <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>) {</div>
|
|
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  delta_start.delta = +demand_min;</div>
|
|
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  delta_end.delta = -demand_min;</div>
|
|
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  }</div>
|
|
<div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  <span class="keywordflow">while</span> (profile_unique_time_[profile_index].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> <</div>
|
|
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  <a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(duration, new_start_min)) {</div>
|
|
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  <span class="keyword">const</span> ProfileDelta& profile_delta = profile_unique_time_[profile_index];</div>
|
|
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(profile_index < profile_unique_time_.size());</div>
|
|
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  <span class="comment">// Compensate for current task</span></div>
|
|
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  <span class="keywordflow">if</span> (profile_delta.time == delta_start.time) {</div>
|
|
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  usage -= delta_start.delta;</div>
|
|
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  }</div>
|
|
<div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  <span class="keywordflow">if</span> (profile_delta.time == delta_end.time) {</div>
|
|
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  usage -= delta_end.delta;</div>
|
|
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  }</div>
|
|
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  <span class="comment">// Increment time</span></div>
|
|
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  ++profile_index;</div>
|
|
<div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(profile_index < profile_unique_time_.size());</div>
|
|
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  <span class="comment">// Does it fit?</span></div>
|
|
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  <span class="keywordflow">if</span> (usage > residual_capacity) {</div>
|
|
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  new_start_min = profile_unique_time_[profile_index].time;</div>
|
|
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  }</div>
|
|
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  usage += profile_unique_time_[profile_index].delta;</div>
|
|
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  }</div>
|
|
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  task->interval->SetStartMin(new_start_min);</div>
|
|
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  }</div>
|
|
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  </div>
|
|
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  <span class="keyword">typedef</span> std::vector<ProfileDelta> Profile;</div>
|
|
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  </div>
|
|
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  Profile profile_unique_time_;</div>
|
|
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  Profile profile_non_unique_time_;</div>
|
|
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  std::vector<Task*> by_start_min_;</div>
|
|
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  IntVar* <span class="keyword">const</span> capacity_;</div>
|
|
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  </div>
|
|
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(CumulativeTimeTable);</div>
|
|
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span> };</div>
|
|
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  </div>
|
|
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span> <span class="comment">// Cumulative idempotent Time-Table.</span></div>
|
|
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span> <span class="comment">// This propagator is based on Letort et al. 2012 add Gay et al. 2015.</span></div>
|
|
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span> <span class="comment">// TODO(user): fill the description once the incremental aspect are</span></div>
|
|
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span> <span class="comment">// implemented.</span></div>
|
|
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span> <span class="comment">// Worst case: O(n^2 log n) -- really unlikely in practice.</span></div>
|
|
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span> <span class="comment">// Best case: Omega(1).</span></div>
|
|
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span> <span class="comment">// Practical: Almost linear in the number of unfixed tasks.</span></div>
|
|
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span> <span class="keyword">template</span> <<span class="keyword">class</span> Task></div>
|
|
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span> <span class="keyword">class </span>TimeTableSync : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  TimeTableSync(Solver* <span class="keyword">const</span> solver, <span class="keyword">const</span> std::vector<Task*>& tasks,</div>
|
|
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  IntVar* <span class="keyword">const</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>)</div>
|
|
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  : Constraint(solver), tasks_(tasks), capacity_(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>) {</div>
|
|
<div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  num_tasks_ = tasks_.size();</div>
|
|
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  gap_ = 0;</div>
|
|
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  prev_gap_ = 0;</div>
|
|
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  pos_ = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  next_pos_ = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  <span class="comment">// Allocate vectors to contain no more than n_tasks.</span></div>
|
|
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  start_min_.reserve(num_tasks_);</div>
|
|
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  start_max_.reserve(num_tasks_);</div>
|
|
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  end_min_.reserve(num_tasks_);</div>
|
|
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  durations_.reserve(num_tasks_);</div>
|
|
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  demands_.reserve(num_tasks_);</div>
|
|
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  }</div>
|
|
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  </div>
|
|
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  ~TimeTableSync()<span class="keyword"> override </span>{ <a class="code" href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a>(&tasks_); }</div>
|
|
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  </div>
|
|
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  <span class="comment">// Reset data structures.</span></div>
|
|
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>  BuildEvents();</div>
|
|
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  <span class="keywordflow">while</span> (!events_scp_.empty() && !events_ecp_.empty()) {</div>
|
|
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <span class="comment">// Move the sweep line.</span></div>
|
|
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  pos_ = NextEventTime();</div>
|
|
<div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  <span class="comment">// Update the profile with compulsory part events.</span></div>
|
|
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  ProcessEventsScp();</div>
|
|
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  ProcessEventsEcp();</div>
|
|
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  <span class="comment">// Update minimum capacity (may fail)</span></div>
|
|
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  capacity_->SetMin(capacity_->Max() - gap_);</div>
|
|
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  <span class="comment">// Time to the next possible profile increase.</span></div>
|
|
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  next_pos_ = NextScpTime();</div>
|
|
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  <span class="comment">// Consider new task to schedule.</span></div>
|
|
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  ProcessEventsPr();</div>
|
|
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  <span class="comment">// Filter.</span></div>
|
|
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  FilterMin();</div>
|
|
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  }</div>
|
|
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  }</div>
|
|
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  </div>
|
|
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  Demon* demon = <a class="code" href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">MakeDelayedConstraintDemon0</a>(</div>
|
|
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  solver(), <span class="keyword">this</span>, &TimeTableSync::InitialPropagate, <span class="stringliteral">"InitialPropagate"</span>);</div>
|
|
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  <span class="keywordflow">for</span> (Task* <span class="keyword">const</span> task : tasks_) {</div>
|
|
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  task->WhenAnything(demon);</div>
|
|
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  }</div>
|
|
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  capacity_->WhenRange(demon);</div>
|
|
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  }</div>
|
|
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  </div>
|
|
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should not be visited"</span>;</div>
|
|
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  }</div>
|
|
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  </div>
|
|
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  std::string DebugString()<span class="keyword"> const override </span>{ <span class="keywordflow">return</span> <span class="stringliteral">"TimeTableSync"</span>; }</div>
|
|
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  </div>
|
|
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  <span class="comment">// Task state.</span></div>
|
|
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  <span class="keyword">enum</span> State { NONE, READY, <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>, CONFLICT };</div>
|
|
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  </div>
|
|
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  <span class="keyword">inline</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> NextScpTime() {</div>
|
|
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  <span class="keywordflow">return</span> !events_scp_.empty() ? events_scp_.top().first : <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  }</div>
|
|
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  </div>
|
|
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  <span class="keyword">inline</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> NextEventTime() {</div>
|
|
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  <span class="keywordflow">if</span> (!events_pr_.empty()) {</div>
|
|
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = events_pr_.top().first;</div>
|
|
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  }</div>
|
|
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keywordflow">if</span> (!events_scp_.empty()) {</div>
|
|
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> t = events_scp_.top().first;</div>
|
|
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = t < <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> ? t : <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  }</div>
|
|
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  <span class="keywordflow">if</span> (!events_ecp_.empty()) {</div>
|
|
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> t = events_ecp_.top().first;</div>
|
|
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = t < <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> ? t : <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  }</div>
|
|
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  <span class="keywordflow">return</span> <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  }</div>
|
|
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  </div>
|
|
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  <span class="keywordtype">void</span> ProcessEventsScp() {</div>
|
|
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  <span class="keywordflow">while</span> (!events_scp_.empty() && events_scp_.top().first == pos_) {</div>
|
|
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> task_id = events_scp_.top().second;</div>
|
|
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  events_scp_.pop();</div>
|
|
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> old_end_min = end_min_[task_id];</div>
|
|
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  <span class="keywordflow">if</span> (states_[task_id] == State::CONFLICT) {</div>
|
|
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  <span class="comment">// Update cached values.</span></div>
|
|
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> new_end_min = pos_ + durations_[task_id];</div>
|
|
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  start_min_[task_id] = pos_;</div>
|
|
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  end_min_[task_id] = new_end_min;</div>
|
|
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  <span class="comment">// Filter the domain</span></div>
|
|
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  tasks_[task_id]->interval->SetStartMin(pos_);</div>
|
|
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  }</div>
|
|
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  <span class="comment">// The task is scheduled.</span></div>
|
|
<div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  states_[task_id] = State::READY;</div>
|
|
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  <span class="comment">// Update the profile if the task has a compulsory part.</span></div>
|
|
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  <span class="keywordflow">if</span> (pos_ < end_min_[task_id]) {</div>
|
|
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  gap_ -= demands_[task_id];</div>
|
|
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  <span class="keywordflow">if</span> (old_end_min <= pos_) {</div>
|
|
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  events_ecp_.push(kv(end_min_[task_id], task_id));</div>
|
|
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  }</div>
|
|
<div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  }</div>
|
|
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  }</div>
|
|
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  }</div>
|
|
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  </div>
|
|
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  <span class="keywordtype">void</span> ProcessEventsEcp() {</div>
|
|
<div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  <span class="keywordflow">while</span> (!events_ecp_.empty() && events_ecp_.top().first == pos_) {</div>
|
|
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> task_id = events_ecp_.top().second;</div>
|
|
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  events_ecp_.pop();</div>
|
|
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  <span class="comment">// Update the event if it is not up to date.</span></div>
|
|
<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  <span class="keywordflow">if</span> (pos_ < end_min_[task_id]) {</div>
|
|
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  events_ecp_.push(kv(end_min_[task_id], task_id));</div>
|
|
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  gap_ += demands_[task_id];</div>
|
|
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  }</div>
|
|
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  }</div>
|
|
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  }</div>
|
|
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  </div>
|
|
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  <span class="keywordtype">void</span> ProcessEventsPr() {</div>
|
|
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  <span class="keywordflow">while</span> (!events_pr_.empty() && events_pr_.top().first == pos_) {</div>
|
|
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> task_id = events_pr_.top().second;</div>
|
|
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  events_pr_.pop();</div>
|
|
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  <span class="comment">// The task is in conflict with the current profile.</span></div>
|
|
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  <span class="keywordflow">if</span> (demands_[task_id] > gap_) {</div>
|
|
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  states_[task_id] = State::CONFLICT;</div>
|
|
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  conflict_.push(kv(demands_[task_id], task_id));</div>
|
|
<div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  }</div>
|
|
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  <span class="comment">// The task is not in conflict for the moment.</span></div>
|
|
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  <span class="keywordflow">if</span> (next_pos_ < end_min_[task_id]) {</div>
|
|
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  states_[task_id] = <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">State::CHECK</a>;</div>
|
|
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  check_.push(kv(demands_[task_id], task_id));</div>
|
|
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  }</div>
|
|
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  <span class="comment">// The task is not in conflict and can be scheduled.</span></div>
|
|
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  states_[task_id] = State::READY;</div>
|
|
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  }</div>
|
|
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  }</div>
|
|
<div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  </div>
|
|
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  <span class="keywordtype">void</span> FilterMin() {</div>
|
|
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <span class="comment">// The profile exceeds the capacity.</span></div>
|
|
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  capacity_->SetMin(capacity_->Max() - gap_);</div>
|
|
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  <span class="comment">// The profile has increased.</span></div>
|
|
<div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  <span class="keywordflow">if</span> (gap_ < prev_gap_) {</div>
|
|
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  <span class="comment">// Reconsider the task in check state.</span></div>
|
|
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  <span class="keywordflow">while</span> (!check_.empty() && demands_[check_.top().second] > gap_) {</div>
|
|
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> task_id = check_.top().second;</div>
|
|
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  check_.pop();</div>
|
|
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  <span class="keywordflow">if</span> (states_[task_id] == <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">State::CHECK</a> && pos_ < end_min_[task_id]) {</div>
|
|
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  states_[task_id] = State::CONFLICT;</div>
|
|
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  conflict_.push(kv(demands_[task_id], task_id));</div>
|
|
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  }</div>
|
|
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  states_[task_id] = State::READY;</div>
|
|
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  }</div>
|
|
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  prev_gap_ = gap_;</div>
|
|
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  }</div>
|
|
<div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  <span class="comment">// The profile has decreased.</span></div>
|
|
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  <span class="keywordflow">if</span> (gap_ > prev_gap_) {</div>
|
|
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  <span class="comment">// Reconsider the tasks in conflict.</span></div>
|
|
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  <span class="keywordflow">while</span> (!conflict_.empty() && demands_[conflict_.top().second] <= gap_) {</div>
|
|
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> task_id = conflict_.top().second;</div>
|
|
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  conflict_.pop();</div>
|
|
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  <span class="keywordflow">if</span> (states_[task_id] != State::CONFLICT) {</div>
|
|
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  }</div>
|
|
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> old_end_min = end_min_[task_id];</div>
|
|
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  <span class="comment">// Update the cache.</span></div>
|
|
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  start_min_[task_id] = pos_;</div>
|
|
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  end_min_[task_id] = pos_ + durations_[task_id];</div>
|
|
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  <span class="comment">// Filter the domain.</span></div>
|
|
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  tasks_[task_id]->interval->SetStartMin(pos_); <span class="comment">// should not fail.</span></div>
|
|
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  <span class="comment">// The task still have to be checked.</span></div>
|
|
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  <span class="keywordflow">if</span> (next_pos_ < end_min_[task_id]) {</div>
|
|
<div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  states_[task_id] = <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">State::CHECK</a>;</div>
|
|
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>  check_.push(kv(demands_[task_id], task_id));</div>
|
|
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>  states_[task_id] = State::READY;</div>
|
|
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  }</div>
|
|
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  <span class="comment">// Update possible compulsory part.</span></div>
|
|
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> = start_max_[task_id];</div>
|
|
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> >= old_end_min && <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> < end_min_[task_id]) {</div>
|
|
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  events_ecp_.push(kv(end_min_[task_id], task_id));</div>
|
|
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  }</div>
|
|
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  }</div>
|
|
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  }</div>
|
|
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  prev_gap_ = gap_;</div>
|
|
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  }</div>
|
|
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  </div>
|
|
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  <span class="keywordtype">void</span> BuildEvents() {</div>
|
|
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  <span class="comment">// Reset the sweep line.</span></div>
|
|
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  pos_ = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  next_pos_ = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  gap_ = capacity_->Max();</div>
|
|
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  prev_gap_ = capacity_->Max();</div>
|
|
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  <span class="comment">// Reset dynamic states.</span></div>
|
|
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  conflict_ = min_heap();</div>
|
|
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  check_ = max_heap();</div>
|
|
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  <span class="comment">// Reset profile events.</span></div>
|
|
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  events_pr_ = min_heap();</div>
|
|
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  events_scp_ = min_heap();</div>
|
|
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  events_ecp_ = min_heap();</div>
|
|
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  <span class="comment">// Reset cache.</span></div>
|
|
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  start_min_.clear();</div>
|
|
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  start_max_.clear();</div>
|
|
<div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  end_min_.clear();</div>
|
|
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  durations_.clear();</div>
|
|
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>  demands_.clear();</div>
|
|
<div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  states_.clear();</div>
|
|
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  <span class="comment">// Build events.</span></div>
|
|
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_tasks_; i++) {</div>
|
|
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> s_min = tasks_[i]->interval->StartMin();</div>
|
|
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> s_max = tasks_[i]->interval->StartMax();</div>
|
|
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> e_min = tasks_[i]->interval->EndMin();</div>
|
|
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  <span class="comment">// Cache the values.</span></div>
|
|
<div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  start_min_.push_back(s_min);</div>
|
|
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  start_max_.push_back(s_max);</div>
|
|
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  end_min_.push_back(e_min);</div>
|
|
<div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  durations_.push_back(tasks_[i]-><a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->DurationMin());</div>
|
|
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  demands_.push_back(tasks_[i]->DemandMin());</div>
|
|
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  <span class="comment">// Reset task state.</span></div>
|
|
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  states_.push_back(State::NONE);</div>
|
|
<div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>  <span class="comment">// Start compulsory part event.</span></div>
|
|
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  events_scp_.push(kv(s_max, i));</div>
|
|
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>  <span class="comment">// Pruning event only if the start time of the task is not fixed.</span></div>
|
|
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  <span class="keywordflow">if</span> (s_min != s_max) {</div>
|
|
<div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>  events_pr_.push(kv(s_min, i));</div>
|
|
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>  }</div>
|
|
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  <span class="comment">// End of compulsory part only if the task has a compulsory part.</span></div>
|
|
<div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>  <span class="keywordflow">if</span> (s_max < e_min) {</div>
|
|
<div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  events_ecp_.push(kv(e_min, i));</div>
|
|
<div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  }</div>
|
|
<div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  }</div>
|
|
<div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  }</div>
|
|
<div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  </div>
|
|
<div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> num_tasks_;</div>
|
|
<div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  std::vector<Task*> tasks_;</div>
|
|
<div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  IntVar* <span class="keyword">const</span> capacity_;</div>
|
|
<div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  </div>
|
|
<div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  std::vector<int64> start_min_;</div>
|
|
<div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  std::vector<int64> start_max_;</div>
|
|
<div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  std::vector<int64> end_min_;</div>
|
|
<div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  std::vector<int64> end_max_;</div>
|
|
<div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  std::vector<int64> durations_;</div>
|
|
<div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  std::vector<int64> demands_;</div>
|
|
<div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  </div>
|
|
<div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  <span class="comment">// Pair key value.</span></div>
|
|
<div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  <span class="keyword">typedef</span> std::pair<int64, int64> kv;</div>
|
|
<div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  <span class="keyword">typedef</span> std::priority_queue<kv, std::vector<kv>, std::greater<kv>> min_heap;</div>
|
|
<div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  <span class="keyword">typedef</span> std::priority_queue<kv, std::vector<kv>, std::less<kv>> max_heap;</div>
|
|
<div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  </div>
|
|
<div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  <span class="comment">// Profile events.</span></div>
|
|
<div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>  min_heap events_pr_;</div>
|
|
<div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>  min_heap events_scp_;</div>
|
|
<div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>  min_heap events_ecp_;</div>
|
|
<div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  </div>
|
|
<div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>  <span class="comment">// Task state.</span></div>
|
|
<div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  std::vector<State> states_;</div>
|
|
<div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  min_heap conflict_;</div>
|
|
<div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  max_heap check_;</div>
|
|
<div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  </div>
|
|
<div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  <span class="comment">// Sweep line state.</span></div>
|
|
<div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> pos_;</div>
|
|
<div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> next_pos_;</div>
|
|
<div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> gap_;</div>
|
|
<div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> prev_gap_;</div>
|
|
<div class="line"><a name="l02163"></a><span class="lineno"> 2163</span> };</div>
|
|
<div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>  </div>
|
|
<div class="line"><a name="l02165"></a><span class="lineno"> 2165</span> <span class="keyword">class </span>CumulativeConstraint : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02167"></a><span class="lineno"> 2167</span>  CumulativeConstraint(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>  <span class="keyword">const</span> std::vector<int64>& demands,</div>
|
|
<div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>  IntVar* <span class="keyword">const</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>)</div>
|
|
<div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>  capacity_(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>),</div>
|
|
<div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>  intervals_(intervals),</div>
|
|
<div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>  demands_(demands) {</div>
|
|
<div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>  tasks_.reserve(intervals.size());</div>
|
|
<div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals.size(); ++i) {</div>
|
|
<div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>  tasks_.push_back(CumulativeTask(intervals[i], demands[i]));</div>
|
|
<div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  }</div>
|
|
<div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  }</div>
|
|
<div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  </div>
|
|
<div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  <span class="comment">// For the cumulative constraint, there are many propagators, and they</span></div>
|
|
<div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  <span class="comment">// don't dominate each other. So the strongest propagation is obtained</span></div>
|
|
<div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  <span class="comment">// by posting a bunch of different propagators.</span></div>
|
|
<div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  <span class="keyword">const</span> ConstraintSolverParameters& params = solver()->parameters();</div>
|
|
<div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  <span class="keywordflow">if</span> (params.use_cumulative_time_table()) {</div>
|
|
<div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  <span class="keywordflow">if</span> (params.use_cumulative_time_table_sync()) {</div>
|
|
<div class="line"><a name="l02188"></a><span class="lineno"> 2188</span>  PostOneSidedConstraint(<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  PostOneSidedConstraint(<span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  PostOneSidedConstraint(<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  PostOneSidedConstraint(<span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  }</div>
|
|
<div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  }</div>
|
|
<div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  <span class="keywordflow">if</span> (params.use_cumulative_edge_finder()) {</div>
|
|
<div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>  PostOneSidedConstraint(<span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>  PostOneSidedConstraint(<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>  }</div>
|
|
<div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>  <span class="keywordflow">if</span> (params.use_sequence_high_demand_tasks()) {</div>
|
|
<div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  PostHighDemandSequenceConstraint();</div>
|
|
<div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>  }</div>
|
|
<div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  <span class="keywordflow">if</span> (params.use_all_possible_disjunctions()) {</div>
|
|
<div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>  PostAllDisjunctions();</div>
|
|
<div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>  }</div>
|
|
<div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>  }</div>
|
|
<div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>  </div>
|
|
<div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>  <span class="comment">// Nothing to do: this constraint delegates all the work to other classes</span></div>
|
|
<div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  }</div>
|
|
<div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>  </div>
|
|
<div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>  <span class="comment">// TODO(user): Build arrays on demand?</span></div>
|
|
<div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>  visitor->BeginVisitConstraint(ModelVisitor::kCumulative, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  visitor->VisitIntervalArrayArgument(ModelVisitor::kIntervalsArgument,</div>
|
|
<div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>  intervals_);</div>
|
|
<div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>  visitor->VisitIntegerArrayArgument(ModelVisitor::kDemandsArgument,</div>
|
|
<div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>  demands_);</div>
|
|
<div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>  visitor->VisitIntegerExpressionArgument(ModelVisitor::kCapacityArgument,</div>
|
|
<div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>  capacity_);</div>
|
|
<div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>  visitor->EndVisitConstraint(ModelVisitor::kCumulative, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  }</div>
|
|
<div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>  </div>
|
|
<div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"CumulativeConstraint([%s], %s)"</span>,</div>
|
|
<div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  <a class="code" href="namespaceoperations__research.html#af1e66b2f134ccc2e06344f1935bbc16a">JoinDebugString</a>(tasks_, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>  capacity_->DebugString());</div>
|
|
<div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>  }</div>
|
|
<div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>  </div>
|
|
<div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>  <span class="comment">// Post temporal disjunctions for tasks that cannot overlap.</span></div>
|
|
<div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  <span class="keywordtype">void</span> PostAllDisjunctions() {</div>
|
|
<div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  IntervalVar* <span class="keyword">const</span> interval_i = intervals_[i];</div>
|
|
<div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  <span class="keywordflow">if</span> (interval_i->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j < intervals_.size(); ++j) {</div>
|
|
<div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>  IntervalVar* <span class="keyword">const</span> interval_j = intervals_[j];</div>
|
|
<div class="line"><a name="l02237"></a><span class="lineno"> 2237</span>  <span class="keywordflow">if</span> (interval_j->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks_[i].<a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>, tasks_[j].<a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>) > capacity_->Max()) {</div>
|
|
<div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>  Constraint* <span class="keyword">const</span> constraint =</div>
|
|
<div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  solver()->MakeTemporalDisjunction(interval_i, interval_j);</div>
|
|
<div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>  solver()->AddConstraint(constraint);</div>
|
|
<div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  }</div>
|
|
<div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>  }</div>
|
|
<div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>  }</div>
|
|
<div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>  }</div>
|
|
<div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>  }</div>
|
|
<div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>  }</div>
|
|
<div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>  </div>
|
|
<div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>  <span class="comment">// Post a Sequence constraint for tasks that requires strictly more than half</span></div>
|
|
<div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  <span class="comment">// of the resource</span></div>
|
|
<div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>  <span class="keywordtype">void</span> PostHighDemandSequenceConstraint() {</div>
|
|
<div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>  Constraint* constraint = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>  { <span class="comment">// Need a block to avoid memory leaks in case the AddConstraint fails</span></div>
|
|
<div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>  std::vector<IntervalVar*> high_demand_intervals;</div>
|
|
<div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>  high_demand_intervals.reserve(intervals_.size());</div>
|
|
<div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < demands_.size(); ++i) {</div>
|
|
<div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a> = tasks_[i].demand;</div>
|
|
<div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  <span class="comment">// Consider two tasks with demand d1 and d2 such that</span></div>
|
|
<div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  <span class="comment">// d1 * 2 > capacity_ and d2 * 2 > capacity_.</span></div>
|
|
<div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>  <span class="comment">// Then d1 + d2 = 1/2 (d1 * 2 + d2 * 2)</span></div>
|
|
<div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>  <span class="comment">// > 1/2 (capacity_ + capacity_)</span></div>
|
|
<div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>  <span class="comment">// > capacity_.</span></div>
|
|
<div class="line"><a name="l02263"></a><span class="lineno"> 2263</span>  <span class="comment">// Therefore these two tasks cannot overlap.</span></div>
|
|
<div class="line"><a name="l02264"></a><span class="lineno"> 2264</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a> * 2 > capacity_->Max() &&</div>
|
|
<div class="line"><a name="l02265"></a><span class="lineno"> 2265</span>  tasks_[i].interval->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l02266"></a><span class="lineno"> 2266</span>  high_demand_intervals.push_back(tasks_[i].<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a name="l02267"></a><span class="lineno"> 2267</span>  }</div>
|
|
<div class="line"><a name="l02268"></a><span class="lineno"> 2268</span>  }</div>
|
|
<div class="line"><a name="l02269"></a><span class="lineno"> 2269</span>  <span class="keywordflow">if</span> (high_demand_intervals.size() >= 2) {</div>
|
|
<div class="line"><a name="l02270"></a><span class="lineno"> 2270</span>  <span class="comment">// If there are less than 2 such intervals, the constraint would do</span></div>
|
|
<div class="line"><a name="l02271"></a><span class="lineno"> 2271</span>  <span class="comment">// nothing</span></div>
|
|
<div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>  std::string seq_name = absl::StrCat(<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>(), <span class="stringliteral">"-HighDemandSequence"</span>);</div>
|
|
<div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>  constraint = solver()->MakeDisjunctiveConstraint(high_demand_intervals,</div>
|
|
<div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>  seq_name);</div>
|
|
<div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>  }</div>
|
|
<div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  }</div>
|
|
<div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>  <span class="keywordflow">if</span> (constraint != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>  solver()->AddConstraint(constraint);</div>
|
|
<div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  }</div>
|
|
<div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>  }</div>
|
|
<div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>  </div>
|
|
<div class="line"><a name="l02282"></a><span class="lineno"> 2282</span>  <span class="comment">// Populate the given vector with useful tasks, meaning the ones on which</span></div>
|
|
<div class="line"><a name="l02283"></a><span class="lineno"> 2283</span>  <span class="comment">// some propagation can be done</span></div>
|
|
<div class="line"><a name="l02284"></a><span class="lineno"> 2284</span>  <span class="keywordtype">void</span> PopulateVectorUsefulTasks(</div>
|
|
<div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>  <span class="keywordtype">bool</span> mirror, std::vector<CumulativeTask*>* <span class="keyword">const</span> useful_tasks) {</div>
|
|
<div class="line"><a name="l02286"></a><span class="lineno"> 2286</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(useful_tasks->empty());</div>
|
|
<div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < tasks_.size(); ++i) {</div>
|
|
<div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>  <span class="keyword">const</span> CumulativeTask& original_task = tasks_[i];</div>
|
|
<div class="line"><a name="l02289"></a><span class="lineno"> 2289</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = original_task.interval;</div>
|
|
<div class="line"><a name="l02290"></a><span class="lineno"> 2290</span>  <span class="comment">// Check if exceed capacity</span></div>
|
|
<div class="line"><a name="l02291"></a><span class="lineno"> 2291</span>  <span class="keywordflow">if</span> (original_task.demand > capacity_->Max()) {</div>
|
|
<div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetPerformed(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  }</div>
|
|
<div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>  <span class="comment">// Add to the useful_task vector if it may be performed and that it</span></div>
|
|
<div class="line"><a name="l02295"></a><span class="lineno"> 2295</span>  <span class="comment">// actually consumes some of the resource.</span></div>
|
|
<div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed() && original_task.demand > 0) {</div>
|
|
<div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  IntervalVar* <span class="keyword">const</span> original_interval = original_task.interval;</div>
|
|
<div class="line"><a name="l02299"></a><span class="lineno"> 2299</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> =</div>
|
|
<div class="line"><a name="l02300"></a><span class="lineno"> 2300</span>  mirror ? s->MakeMirrorInterval(original_interval)</div>
|
|
<div class="line"><a name="l02301"></a><span class="lineno"> 2301</span>  : original_interval;</div>
|
|
<div class="line"><a name="l02302"></a><span class="lineno"> 2302</span>  IntervalVar* <span class="keyword">const</span> relaxed_max = s->MakeIntervalRelaxedMax(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>  useful_tasks->push_back(</div>
|
|
<div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>  <span class="keyword">new</span> CumulativeTask(relaxed_max, original_task.demand));</div>
|
|
<div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  }</div>
|
|
<div class="line"><a name="l02306"></a><span class="lineno"> 2306</span>  }</div>
|
|
<div class="line"><a name="l02307"></a><span class="lineno"> 2307</span>  }</div>
|
|
<div class="line"><a name="l02308"></a><span class="lineno"> 2308</span>  </div>
|
|
<div class="line"><a name="l02309"></a><span class="lineno"> 2309</span>  <span class="comment">// Makes and return an edge-finder or a time table, or nullptr if it is not</span></div>
|
|
<div class="line"><a name="l02310"></a><span class="lineno"> 2310</span>  <span class="comment">// necessary.</span></div>
|
|
<div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>  Constraint* MakeOneSidedConstraint(<span class="keywordtype">bool</span> mirror, <span class="keywordtype">bool</span> edge_finder,</div>
|
|
<div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>  <span class="keywordtype">bool</span> tt_sync) {</div>
|
|
<div class="line"><a name="l02313"></a><span class="lineno"> 2313</span>  std::vector<CumulativeTask*> useful_tasks;</div>
|
|
<div class="line"><a name="l02314"></a><span class="lineno"> 2314</span>  PopulateVectorUsefulTasks(mirror, &useful_tasks);</div>
|
|
<div class="line"><a name="l02315"></a><span class="lineno"> 2315</span>  <span class="keywordflow">if</span> (useful_tasks.empty()) {</div>
|
|
<div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>  <span class="keywordflow">if</span> (edge_finder) {</div>
|
|
<div class="line"><a name="l02320"></a><span class="lineno"> 2320</span>  <span class="keyword">const</span> ConstraintSolverParameters& params = solver()->parameters();</div>
|
|
<div class="line"><a name="l02321"></a><span class="lineno"> 2321</span>  <span class="keywordflow">return</span> useful_tasks.size() < params.max_edge_finder_size()</div>
|
|
<div class="line"><a name="l02322"></a><span class="lineno"> 2322</span>  ? s->RevAlloc(<span class="keyword">new</span> EdgeFinder<CumulativeTask>(s, useful_tasks,</div>
|
|
<div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>  capacity_))</div>
|
|
<div class="line"><a name="l02324"></a><span class="lineno"> 2324</span>  : <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>  }</div>
|
|
<div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>  <span class="keywordflow">if</span> (tt_sync) {</div>
|
|
<div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>  <span class="keywordflow">return</span> s->RevAlloc(</div>
|
|
<div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>  <span class="keyword">new</span> TimeTableSync<CumulativeTask>(s, useful_tasks, capacity_));</div>
|
|
<div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>  }</div>
|
|
<div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  <span class="keywordflow">return</span> s->RevAlloc(</div>
|
|
<div class="line"><a name="l02331"></a><span class="lineno"> 2331</span>  <span class="keyword">new</span> CumulativeTimeTable<CumulativeTask>(s, useful_tasks, capacity_));</div>
|
|
<div class="line"><a name="l02332"></a><span class="lineno"> 2332</span>  }</div>
|
|
<div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>  }</div>
|
|
<div class="line"><a name="l02334"></a><span class="lineno"> 2334</span>  </div>
|
|
<div class="line"><a name="l02335"></a><span class="lineno"> 2335</span>  <span class="comment">// Post a straight or mirrored edge-finder, if needed</span></div>
|
|
<div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>  <span class="keywordtype">void</span> PostOneSidedConstraint(<span class="keywordtype">bool</span> mirror, <span class="keywordtype">bool</span> edge_finder, <span class="keywordtype">bool</span> tt_sync) {</div>
|
|
<div class="line"><a name="l02337"></a><span class="lineno"> 2337</span>  Constraint* <span class="keyword">const</span> constraint =</div>
|
|
<div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>  MakeOneSidedConstraint(mirror, edge_finder, tt_sync);</div>
|
|
<div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>  <span class="keywordflow">if</span> (constraint != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02340"></a><span class="lineno"> 2340</span>  solver()->AddConstraint(constraint);</div>
|
|
<div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>  }</div>
|
|
<div class="line"><a name="l02342"></a><span class="lineno"> 2342</span>  }</div>
|
|
<div class="line"><a name="l02343"></a><span class="lineno"> 2343</span>  </div>
|
|
<div class="line"><a name="l02344"></a><span class="lineno"> 2344</span>  <span class="comment">// Capacity of the cumulative resource</span></div>
|
|
<div class="line"><a name="l02345"></a><span class="lineno"> 2345</span>  IntVar* <span class="keyword">const</span> capacity_;</div>
|
|
<div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>  </div>
|
|
<div class="line"><a name="l02347"></a><span class="lineno"> 2347</span>  <span class="comment">// The tasks that share the cumulative resource</span></div>
|
|
<div class="line"><a name="l02348"></a><span class="lineno"> 2348</span>  std::vector<CumulativeTask> tasks_;</div>
|
|
<div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>  </div>
|
|
<div class="line"><a name="l02350"></a><span class="lineno"> 2350</span>  <span class="comment">// Array of intervals for the visitor.</span></div>
|
|
<div class="line"><a name="l02351"></a><span class="lineno"> 2351</span>  <span class="keyword">const</span> std::vector<IntervalVar*> intervals_;</div>
|
|
<div class="line"><a name="l02352"></a><span class="lineno"> 2352</span>  <span class="comment">// Array of demands for the visitor.</span></div>
|
|
<div class="line"><a name="l02353"></a><span class="lineno"> 2353</span>  <span class="keyword">const</span> std::vector<int64> demands_;</div>
|
|
<div class="line"><a name="l02354"></a><span class="lineno"> 2354</span>  </div>
|
|
<div class="line"><a name="l02355"></a><span class="lineno"> 2355</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(CumulativeConstraint);</div>
|
|
<div class="line"><a name="l02356"></a><span class="lineno"> 2356</span> };</div>
|
|
<div class="line"><a name="l02357"></a><span class="lineno"> 2357</span>  </div>
|
|
<div class="line"><a name="l02358"></a><span class="lineno"> 2358</span> <span class="keyword">class </span>VariableDemandCumulativeConstraint : <span class="keyword">public</span> Constraint {</div>
|
|
<div class="line"><a name="l02359"></a><span class="lineno"> 2359</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l02360"></a><span class="lineno"> 2360</span>  VariableDemandCumulativeConstraint(Solver* <span class="keyword">const</span> s,</div>
|
|
<div class="line"><a name="l02361"></a><span class="lineno"> 2361</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02362"></a><span class="lineno"> 2362</span>  <span class="keyword">const</span> std::vector<IntVar*>& demands,</div>
|
|
<div class="line"><a name="l02363"></a><span class="lineno"> 2363</span>  IntVar* <span class="keyword">const</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l02364"></a><span class="lineno"> 2364</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>)</div>
|
|
<div class="line"><a name="l02365"></a><span class="lineno"> 2365</span>  : Constraint(s),</div>
|
|
<div class="line"><a name="l02366"></a><span class="lineno"> 2366</span>  capacity_(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>),</div>
|
|
<div class="line"><a name="l02367"></a><span class="lineno"> 2367</span>  intervals_(intervals),</div>
|
|
<div class="line"><a name="l02368"></a><span class="lineno"> 2368</span>  demands_(demands) {</div>
|
|
<div class="line"><a name="l02369"></a><span class="lineno"> 2369</span>  tasks_.reserve(intervals.size());</div>
|
|
<div class="line"><a name="l02370"></a><span class="lineno"> 2370</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals.size(); ++i) {</div>
|
|
<div class="line"><a name="l02371"></a><span class="lineno"> 2371</span>  tasks_.push_back(VariableCumulativeTask(intervals[i], demands[i]));</div>
|
|
<div class="line"><a name="l02372"></a><span class="lineno"> 2372</span>  }</div>
|
|
<div class="line"><a name="l02373"></a><span class="lineno"> 2373</span>  }</div>
|
|
<div class="line"><a name="l02374"></a><span class="lineno"> 2374</span>  </div>
|
|
<div class="line"><a name="l02375"></a><span class="lineno"> 2375</span>  <span class="keywordtype">void</span> Post()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02376"></a><span class="lineno"> 2376</span>  <span class="comment">// For the cumulative constraint, there are many propagators, and they</span></div>
|
|
<div class="line"><a name="l02377"></a><span class="lineno"> 2377</span>  <span class="comment">// don't dominate each other. So the strongest propagation is obtained</span></div>
|
|
<div class="line"><a name="l02378"></a><span class="lineno"> 2378</span>  <span class="comment">// by posting a bunch of different propagators.</span></div>
|
|
<div class="line"><a name="l02379"></a><span class="lineno"> 2379</span>  <span class="keyword">const</span> ConstraintSolverParameters& params = solver()->parameters();</div>
|
|
<div class="line"><a name="l02380"></a><span class="lineno"> 2380</span>  <span class="keywordflow">if</span> (params.use_cumulative_time_table()) {</div>
|
|
<div class="line"><a name="l02381"></a><span class="lineno"> 2381</span>  PostOneSidedConstraint(<span class="keyword">false</span>, <span class="keyword">false</span>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02382"></a><span class="lineno"> 2382</span>  PostOneSidedConstraint(<span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02383"></a><span class="lineno"> 2383</span>  }</div>
|
|
<div class="line"><a name="l02384"></a><span class="lineno"> 2384</span>  <span class="keywordflow">if</span> (params.use_cumulative_edge_finder()) {</div>
|
|
<div class="line"><a name="l02385"></a><span class="lineno"> 2385</span>  PostOneSidedConstraint(<span class="keyword">false</span>, <span class="keyword">true</span>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02386"></a><span class="lineno"> 2386</span>  PostOneSidedConstraint(<span class="keyword">true</span>, <span class="keyword">true</span>, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02387"></a><span class="lineno"> 2387</span>  }</div>
|
|
<div class="line"><a name="l02388"></a><span class="lineno"> 2388</span>  <span class="keywordflow">if</span> (params.use_sequence_high_demand_tasks()) {</div>
|
|
<div class="line"><a name="l02389"></a><span class="lineno"> 2389</span>  PostHighDemandSequenceConstraint();</div>
|
|
<div class="line"><a name="l02390"></a><span class="lineno"> 2390</span>  }</div>
|
|
<div class="line"><a name="l02391"></a><span class="lineno"> 2391</span>  <span class="keywordflow">if</span> (params.use_all_possible_disjunctions()) {</div>
|
|
<div class="line"><a name="l02392"></a><span class="lineno"> 2392</span>  PostAllDisjunctions();</div>
|
|
<div class="line"><a name="l02393"></a><span class="lineno"> 2393</span>  }</div>
|
|
<div class="line"><a name="l02394"></a><span class="lineno"> 2394</span>  }</div>
|
|
<div class="line"><a name="l02395"></a><span class="lineno"> 2395</span>  </div>
|
|
<div class="line"><a name="l02396"></a><span class="lineno"> 2396</span>  <span class="keywordtype">void</span> InitialPropagate()<span class="keyword"> override </span>{</div>
|
|
<div class="line"><a name="l02397"></a><span class="lineno"> 2397</span>  <span class="comment">// Nothing to do: this constraint delegates all the work to other classes</span></div>
|
|
<div class="line"><a name="l02398"></a><span class="lineno"> 2398</span>  }</div>
|
|
<div class="line"><a name="l02399"></a><span class="lineno"> 2399</span>  </div>
|
|
<div class="line"><a name="l02400"></a><span class="lineno"> 2400</span>  <span class="keywordtype">void</span> Accept(ModelVisitor* <span class="keyword">const</span> visitor)<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02401"></a><span class="lineno"> 2401</span>  <span class="comment">// TODO(user): Build arrays on demand?</span></div>
|
|
<div class="line"><a name="l02402"></a><span class="lineno"> 2402</span>  visitor->BeginVisitConstraint(ModelVisitor::kCumulative, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02403"></a><span class="lineno"> 2403</span>  visitor->VisitIntervalArrayArgument(ModelVisitor::kIntervalsArgument,</div>
|
|
<div class="line"><a name="l02404"></a><span class="lineno"> 2404</span>  intervals_);</div>
|
|
<div class="line"><a name="l02405"></a><span class="lineno"> 2405</span>  visitor->VisitIntegerVariableArrayArgument(ModelVisitor::kDemandsArgument,</div>
|
|
<div class="line"><a name="l02406"></a><span class="lineno"> 2406</span>  demands_);</div>
|
|
<div class="line"><a name="l02407"></a><span class="lineno"> 2407</span>  visitor->VisitIntegerExpressionArgument(ModelVisitor::kCapacityArgument,</div>
|
|
<div class="line"><a name="l02408"></a><span class="lineno"> 2408</span>  capacity_);</div>
|
|
<div class="line"><a name="l02409"></a><span class="lineno"> 2409</span>  visitor->EndVisitConstraint(ModelVisitor::kCumulative, <span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l02410"></a><span class="lineno"> 2410</span>  }</div>
|
|
<div class="line"><a name="l02411"></a><span class="lineno"> 2411</span>  </div>
|
|
<div class="line"><a name="l02412"></a><span class="lineno"> 2412</span>  std::string DebugString()<span class="keyword"> const override </span>{</div>
|
|
<div class="line"><a name="l02413"></a><span class="lineno"> 2413</span>  <span class="keywordflow">return</span> absl::StrFormat(<span class="stringliteral">"VariableDemandCumulativeConstraint([%s], %s)"</span>,</div>
|
|
<div class="line"><a name="l02414"></a><span class="lineno"> 2414</span>  <a class="code" href="namespaceoperations__research.html#af1e66b2f134ccc2e06344f1935bbc16a">JoinDebugString</a>(tasks_, <span class="stringliteral">", "</span>),</div>
|
|
<div class="line"><a name="l02415"></a><span class="lineno"> 2415</span>  capacity_->DebugString());</div>
|
|
<div class="line"><a name="l02416"></a><span class="lineno"> 2416</span>  }</div>
|
|
<div class="line"><a name="l02417"></a><span class="lineno"> 2417</span>  </div>
|
|
<div class="line"><a name="l02418"></a><span class="lineno"> 2418</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l02419"></a><span class="lineno"> 2419</span>  <span class="comment">// Post temporal disjunctions for tasks that cannot overlap.</span></div>
|
|
<div class="line"><a name="l02420"></a><span class="lineno"> 2420</span>  <span class="keywordtype">void</span> PostAllDisjunctions() {</div>
|
|
<div class="line"><a name="l02421"></a><span class="lineno"> 2421</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals_.size(); ++i) {</div>
|
|
<div class="line"><a name="l02422"></a><span class="lineno"> 2422</span>  IntervalVar* <span class="keyword">const</span> interval_i = intervals_[i];</div>
|
|
<div class="line"><a name="l02423"></a><span class="lineno"> 2423</span>  <span class="keywordflow">if</span> (interval_i->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l02424"></a><span class="lineno"> 2424</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = i + 1; j < intervals_.size(); ++j) {</div>
|
|
<div class="line"><a name="l02425"></a><span class="lineno"> 2425</span>  IntervalVar* <span class="keyword">const</span> interval_j = intervals_[j];</div>
|
|
<div class="line"><a name="l02426"></a><span class="lineno"> 2426</span>  <span class="keywordflow">if</span> (interval_j->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l02427"></a><span class="lineno"> 2427</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">CapAdd</a>(tasks_[i].<a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a>->Min(), tasks_[j].demand->Min()) ></div>
|
|
<div class="line"><a name="l02428"></a><span class="lineno"> 2428</span>  capacity_->Max()) {</div>
|
|
<div class="line"><a name="l02429"></a><span class="lineno"> 2429</span>  Constraint* <span class="keyword">const</span> constraint =</div>
|
|
<div class="line"><a name="l02430"></a><span class="lineno"> 2430</span>  solver()->MakeTemporalDisjunction(interval_i, interval_j);</div>
|
|
<div class="line"><a name="l02431"></a><span class="lineno"> 2431</span>  solver()->AddConstraint(constraint);</div>
|
|
<div class="line"><a name="l02432"></a><span class="lineno"> 2432</span>  }</div>
|
|
<div class="line"><a name="l02433"></a><span class="lineno"> 2433</span>  }</div>
|
|
<div class="line"><a name="l02434"></a><span class="lineno"> 2434</span>  }</div>
|
|
<div class="line"><a name="l02435"></a><span class="lineno"> 2435</span>  }</div>
|
|
<div class="line"><a name="l02436"></a><span class="lineno"> 2436</span>  }</div>
|
|
<div class="line"><a name="l02437"></a><span class="lineno"> 2437</span>  }</div>
|
|
<div class="line"><a name="l02438"></a><span class="lineno"> 2438</span>  </div>
|
|
<div class="line"><a name="l02439"></a><span class="lineno"> 2439</span>  <span class="comment">// Post a Sequence constraint for tasks that requires strictly more than half</span></div>
|
|
<div class="line"><a name="l02440"></a><span class="lineno"> 2440</span>  <span class="comment">// of the resource</span></div>
|
|
<div class="line"><a name="l02441"></a><span class="lineno"> 2441</span>  <span class="keywordtype">void</span> PostHighDemandSequenceConstraint() {</div>
|
|
<div class="line"><a name="l02442"></a><span class="lineno"> 2442</span>  Constraint* constraint = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02443"></a><span class="lineno"> 2443</span>  { <span class="comment">// Need a block to avoid memory leaks in case the AddConstraint fails</span></div>
|
|
<div class="line"><a name="l02444"></a><span class="lineno"> 2444</span>  std::vector<IntervalVar*> high_demand_intervals;</div>
|
|
<div class="line"><a name="l02445"></a><span class="lineno"> 2445</span>  high_demand_intervals.reserve(intervals_.size());</div>
|
|
<div class="line"><a name="l02446"></a><span class="lineno"> 2446</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < demands_.size(); ++i) {</div>
|
|
<div class="line"><a name="l02447"></a><span class="lineno"> 2447</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a> = tasks_[i].demand->Min();</div>
|
|
<div class="line"><a name="l02448"></a><span class="lineno"> 2448</span>  <span class="comment">// Consider two tasks with demand d1 and d2 such that</span></div>
|
|
<div class="line"><a name="l02449"></a><span class="lineno"> 2449</span>  <span class="comment">// d1 * 2 > capacity_ and d2 * 2 > capacity_.</span></div>
|
|
<div class="line"><a name="l02450"></a><span class="lineno"> 2450</span>  <span class="comment">// Then d1 + d2 = 1/2 (d1 * 2 + d2 * 2)</span></div>
|
|
<div class="line"><a name="l02451"></a><span class="lineno"> 2451</span>  <span class="comment">// > 1/2 (capacity_ + capacity_)</span></div>
|
|
<div class="line"><a name="l02452"></a><span class="lineno"> 2452</span>  <span class="comment">// > capacity_.</span></div>
|
|
<div class="line"><a name="l02453"></a><span class="lineno"> 2453</span>  <span class="comment">// Therefore these two tasks cannot overlap.</span></div>
|
|
<div class="line"><a name="l02454"></a><span class="lineno"> 2454</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a> * 2 > capacity_->Max() &&</div>
|
|
<div class="line"><a name="l02455"></a><span class="lineno"> 2455</span>  tasks_[i].interval->MayBePerformed()) {</div>
|
|
<div class="line"><a name="l02456"></a><span class="lineno"> 2456</span>  high_demand_intervals.push_back(tasks_[i].<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a name="l02457"></a><span class="lineno"> 2457</span>  }</div>
|
|
<div class="line"><a name="l02458"></a><span class="lineno"> 2458</span>  }</div>
|
|
<div class="line"><a name="l02459"></a><span class="lineno"> 2459</span>  <span class="keywordflow">if</span> (high_demand_intervals.size() >= 2) {</div>
|
|
<div class="line"><a name="l02460"></a><span class="lineno"> 2460</span>  <span class="comment">// If there are less than 2 such intervals, the constraint would do</span></div>
|
|
<div class="line"><a name="l02461"></a><span class="lineno"> 2461</span>  <span class="comment">// nothing</span></div>
|
|
<div class="line"><a name="l02462"></a><span class="lineno"> 2462</span>  <span class="keyword">const</span> std::string seq_name =</div>
|
|
<div class="line"><a name="l02463"></a><span class="lineno"> 2463</span>  absl::StrCat(<a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>(), <span class="stringliteral">"-HighDemandSequence"</span>);</div>
|
|
<div class="line"><a name="l02464"></a><span class="lineno"> 2464</span>  constraint = solver()->MakeStrictDisjunctiveConstraint(</div>
|
|
<div class="line"><a name="l02465"></a><span class="lineno"> 2465</span>  high_demand_intervals, seq_name);</div>
|
|
<div class="line"><a name="l02466"></a><span class="lineno"> 2466</span>  }</div>
|
|
<div class="line"><a name="l02467"></a><span class="lineno"> 2467</span>  }</div>
|
|
<div class="line"><a name="l02468"></a><span class="lineno"> 2468</span>  <span class="keywordflow">if</span> (constraint != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02469"></a><span class="lineno"> 2469</span>  solver()->AddConstraint(constraint);</div>
|
|
<div class="line"><a name="l02470"></a><span class="lineno"> 2470</span>  }</div>
|
|
<div class="line"><a name="l02471"></a><span class="lineno"> 2471</span>  }</div>
|
|
<div class="line"><a name="l02472"></a><span class="lineno"> 2472</span>  </div>
|
|
<div class="line"><a name="l02473"></a><span class="lineno"> 2473</span>  <span class="comment">// Populates the given vector with useful tasks, meaning the ones on which</span></div>
|
|
<div class="line"><a name="l02474"></a><span class="lineno"> 2474</span>  <span class="comment">// some propagation can be done</span></div>
|
|
<div class="line"><a name="l02475"></a><span class="lineno"> 2475</span>  <span class="keywordtype">void</span> PopulateVectorUsefulTasks(</div>
|
|
<div class="line"><a name="l02476"></a><span class="lineno"> 2476</span>  <span class="keywordtype">bool</span> mirror, std::vector<VariableCumulativeTask*>* <span class="keyword">const</span> useful_tasks) {</div>
|
|
<div class="line"><a name="l02477"></a><span class="lineno"> 2477</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(useful_tasks->empty());</div>
|
|
<div class="line"><a name="l02478"></a><span class="lineno"> 2478</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < tasks_.size(); ++i) {</div>
|
|
<div class="line"><a name="l02479"></a><span class="lineno"> 2479</span>  <span class="keyword">const</span> VariableCumulativeTask& original_task = tasks_[i];</div>
|
|
<div class="line"><a name="l02480"></a><span class="lineno"> 2480</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> = original_task.interval;</div>
|
|
<div class="line"><a name="l02481"></a><span class="lineno"> 2481</span>  <span class="comment">// Check if exceed capacity</span></div>
|
|
<div class="line"><a name="l02482"></a><span class="lineno"> 2482</span>  <span class="keywordflow">if</span> (original_task.demand->Min() > capacity_->Max()) {</div>
|
|
<div class="line"><a name="l02483"></a><span class="lineno"> 2483</span>  <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->SetPerformed(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l02484"></a><span class="lineno"> 2484</span>  }</div>
|
|
<div class="line"><a name="l02485"></a><span class="lineno"> 2485</span>  <span class="comment">// Add to the useful_task vector if it may be performed and that it</span></div>
|
|
<div class="line"><a name="l02486"></a><span class="lineno"> 2486</span>  <span class="comment">// may actually consume some of the resource.</span></div>
|
|
<div class="line"><a name="l02487"></a><span class="lineno"> 2487</span>  <span class="keywordflow">if</span> (<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>->MayBePerformed() && original_task.demand->Max() > 0) {</div>
|
|
<div class="line"><a name="l02488"></a><span class="lineno"> 2488</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l02489"></a><span class="lineno"> 2489</span>  IntervalVar* <span class="keyword">const</span> original_interval = original_task.interval;</div>
|
|
<div class="line"><a name="l02490"></a><span class="lineno"> 2490</span>  IntervalVar* <span class="keyword">const</span> <a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a> =</div>
|
|
<div class="line"><a name="l02491"></a><span class="lineno"> 2491</span>  mirror ? s->MakeMirrorInterval(original_interval)</div>
|
|
<div class="line"><a name="l02492"></a><span class="lineno"> 2492</span>  : original_interval;</div>
|
|
<div class="line"><a name="l02493"></a><span class="lineno"> 2493</span>  IntervalVar* <span class="keyword">const</span> relaxed_max = s->MakeIntervalRelaxedMax(<a class="code" href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a>);</div>
|
|
<div class="line"><a name="l02494"></a><span class="lineno"> 2494</span>  useful_tasks->push_back(</div>
|
|
<div class="line"><a name="l02495"></a><span class="lineno"> 2495</span>  <span class="keyword">new</span> VariableCumulativeTask(relaxed_max, original_task.demand));</div>
|
|
<div class="line"><a name="l02496"></a><span class="lineno"> 2496</span>  }</div>
|
|
<div class="line"><a name="l02497"></a><span class="lineno"> 2497</span>  }</div>
|
|
<div class="line"><a name="l02498"></a><span class="lineno"> 2498</span>  }</div>
|
|
<div class="line"><a name="l02499"></a><span class="lineno"> 2499</span>  </div>
|
|
<div class="line"><a name="l02500"></a><span class="lineno"> 2500</span>  <span class="comment">// Makes and returns an edge-finder or a time table, or nullptr if it is not</span></div>
|
|
<div class="line"><a name="l02501"></a><span class="lineno"> 2501</span>  <span class="comment">// necessary.</span></div>
|
|
<div class="line"><a name="l02502"></a><span class="lineno"> 2502</span>  Constraint* MakeOneSidedConstraint(<span class="keywordtype">bool</span> mirror, <span class="keywordtype">bool</span> edge_finder,</div>
|
|
<div class="line"><a name="l02503"></a><span class="lineno"> 2503</span>  <span class="keywordtype">bool</span> tt_sync) {</div>
|
|
<div class="line"><a name="l02504"></a><span class="lineno"> 2504</span>  std::vector<VariableCumulativeTask*> useful_tasks;</div>
|
|
<div class="line"><a name="l02505"></a><span class="lineno"> 2505</span>  PopulateVectorUsefulTasks(mirror, &useful_tasks);</div>
|
|
<div class="line"><a name="l02506"></a><span class="lineno"> 2506</span>  <span class="keywordflow">if</span> (useful_tasks.empty()) {</div>
|
|
<div class="line"><a name="l02507"></a><span class="lineno"> 2507</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l02508"></a><span class="lineno"> 2508</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02509"></a><span class="lineno"> 2509</span>  Solver* <span class="keyword">const</span> s = solver();</div>
|
|
<div class="line"><a name="l02510"></a><span class="lineno"> 2510</span>  <span class="keywordflow">if</span> (edge_finder) {</div>
|
|
<div class="line"><a name="l02511"></a><span class="lineno"> 2511</span>  <span class="keywordflow">return</span> s->RevAlloc(</div>
|
|
<div class="line"><a name="l02512"></a><span class="lineno"> 2512</span>  <span class="keyword">new</span> EdgeFinder<VariableCumulativeTask>(s, useful_tasks, capacity_));</div>
|
|
<div class="line"><a name="l02513"></a><span class="lineno"> 2513</span>  }</div>
|
|
<div class="line"><a name="l02514"></a><span class="lineno"> 2514</span>  <span class="keywordflow">if</span> (tt_sync) {</div>
|
|
<div class="line"><a name="l02515"></a><span class="lineno"> 2515</span>  <span class="keywordflow">return</span> s->RevAlloc(<span class="keyword">new</span> TimeTableSync<VariableCumulativeTask>(</div>
|
|
<div class="line"><a name="l02516"></a><span class="lineno"> 2516</span>  s, useful_tasks, capacity_));</div>
|
|
<div class="line"><a name="l02517"></a><span class="lineno"> 2517</span>  }</div>
|
|
<div class="line"><a name="l02518"></a><span class="lineno"> 2518</span>  <span class="keywordflow">return</span> s->RevAlloc(<span class="keyword">new</span> CumulativeTimeTable<VariableCumulativeTask>(</div>
|
|
<div class="line"><a name="l02519"></a><span class="lineno"> 2519</span>  s, useful_tasks, capacity_));</div>
|
|
<div class="line"><a name="l02520"></a><span class="lineno"> 2520</span>  }</div>
|
|
<div class="line"><a name="l02521"></a><span class="lineno"> 2521</span>  }</div>
|
|
<div class="line"><a name="l02522"></a><span class="lineno"> 2522</span>  </div>
|
|
<div class="line"><a name="l02523"></a><span class="lineno"> 2523</span>  <span class="comment">// Post a straight or mirrored edge-finder, if needed</span></div>
|
|
<div class="line"><a name="l02524"></a><span class="lineno"> 2524</span>  <span class="keywordtype">void</span> PostOneSidedConstraint(<span class="keywordtype">bool</span> mirror, <span class="keywordtype">bool</span> edge_finder, <span class="keywordtype">bool</span> tt_sync) {</div>
|
|
<div class="line"><a name="l02525"></a><span class="lineno"> 2525</span>  Constraint* <span class="keyword">const</span> constraint =</div>
|
|
<div class="line"><a name="l02526"></a><span class="lineno"> 2526</span>  MakeOneSidedConstraint(mirror, edge_finder, tt_sync);</div>
|
|
<div class="line"><a name="l02527"></a><span class="lineno"> 2527</span>  <span class="keywordflow">if</span> (constraint != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02528"></a><span class="lineno"> 2528</span>  solver()->AddConstraint(constraint);</div>
|
|
<div class="line"><a name="l02529"></a><span class="lineno"> 2529</span>  }</div>
|
|
<div class="line"><a name="l02530"></a><span class="lineno"> 2530</span>  }</div>
|
|
<div class="line"><a name="l02531"></a><span class="lineno"> 2531</span>  </div>
|
|
<div class="line"><a name="l02532"></a><span class="lineno"> 2532</span>  <span class="comment">// Capacity of the cumulative resource</span></div>
|
|
<div class="line"><a name="l02533"></a><span class="lineno"> 2533</span>  IntVar* <span class="keyword">const</span> capacity_;</div>
|
|
<div class="line"><a name="l02534"></a><span class="lineno"> 2534</span>  </div>
|
|
<div class="line"><a name="l02535"></a><span class="lineno"> 2535</span>  <span class="comment">// The tasks that share the cumulative resource</span></div>
|
|
<div class="line"><a name="l02536"></a><span class="lineno"> 2536</span>  std::vector<VariableCumulativeTask> tasks_;</div>
|
|
<div class="line"><a name="l02537"></a><span class="lineno"> 2537</span>  </div>
|
|
<div class="line"><a name="l02538"></a><span class="lineno"> 2538</span>  <span class="comment">// Array of intervals for the visitor.</span></div>
|
|
<div class="line"><a name="l02539"></a><span class="lineno"> 2539</span>  <span class="keyword">const</span> std::vector<IntervalVar*> intervals_;</div>
|
|
<div class="line"><a name="l02540"></a><span class="lineno"> 2540</span>  <span class="comment">// Array of demands for the visitor.</span></div>
|
|
<div class="line"><a name="l02541"></a><span class="lineno"> 2541</span>  <span class="keyword">const</span> std::vector<IntVar*> demands_;</div>
|
|
<div class="line"><a name="l02542"></a><span class="lineno"> 2542</span>  </div>
|
|
<div class="line"><a name="l02543"></a><span class="lineno"> 2543</span>  <a class="code" href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a>(VariableDemandCumulativeConstraint);</div>
|
|
<div class="line"><a name="l02544"></a><span class="lineno"> 2544</span> };</div>
|
|
<div class="line"><a name="l02545"></a><span class="lineno"> 2545</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l02546"></a><span class="lineno"> 2546</span>  </div>
|
|
<div class="line"><a name="l02547"></a><span class="lineno"> 2547</span> <span class="comment">// Sequence Constraint</span></div>
|
|
<div class="line"><a name="l02548"></a><span class="lineno"> 2548</span>  </div>
|
|
<div class="line"><a name="l02549"></a><span class="lineno"> 2549</span> <span class="comment">// ----- Public class -----</span></div>
|
|
<div class="line"><a name="l02550"></a><span class="lineno"> 2550</span>  </div>
|
|
<div class="line"><a name="l02551"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_constraint.html#ad00d844c640d64524ddd7d08916950c0"> 2551</a></span> DisjunctiveConstraint::DisjunctiveConstraint(</div>
|
|
<div class="line"><a name="l02552"></a><span class="lineno"> 2552</span>  <a class="code" href="classoperations__research_1_1_solver.html">Solver</a>* <span class="keyword">const</span> s, <span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02553"></a><span class="lineno"> 2553</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>)</div>
|
|
<div class="line"><a name="l02554"></a><span class="lineno"> 2554</span>  : <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>(s), intervals_(intervals) {</div>
|
|
<div class="line"><a name="l02555"></a><span class="lineno"> 2555</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1_propagation_base_object.html#a1d89c28bd42ba9a52da008bb69367171">name</a>.empty()) {</div>
|
|
<div class="line"><a name="l02556"></a><span class="lineno"> 2556</span>  <a class="code" href="classoperations__research_1_1_propagation_base_object.html#ad5260b9627048b854b45d05ed34adc22">set_name</a>(<a class="code" href="classoperations__research_1_1_propagation_base_object.html#a1d89c28bd42ba9a52da008bb69367171">name</a>);</div>
|
|
<div class="line"><a name="l02557"></a><span class="lineno"> 2557</span>  }</div>
|
|
<div class="line"><a name="l02558"></a><span class="lineno"> 2558</span>  <a class="code" href="classoperations__research_1_1_disjunctive_constraint.html#afc37bcfd26805cab838cef7ae4c87444">transition_time_</a> = [](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> x, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> y) { <span class="keywordflow">return</span> 0; };</div>
|
|
<div class="line"><a name="l02559"></a><span class="lineno"> 2559</span> }</div>
|
|
<div class="line"><a name="l02560"></a><span class="lineno"> 2560</span>  </div>
|
|
<div class="line"><a name="l02561"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_constraint.html#aba974c73a007aa0553c09999b6ea0c2c"> 2561</a></span> <a class="code" href="classoperations__research_1_1_disjunctive_constraint.html#aba974c73a007aa0553c09999b6ea0c2c">DisjunctiveConstraint::~DisjunctiveConstraint</a>() {}</div>
|
|
<div class="line"><a name="l02562"></a><span class="lineno"> 2562</span>  </div>
|
|
<div class="line"><a name="l02563"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_disjunctive_constraint.html#ae01c325872694c6f9a780832c3ac65f4"> 2563</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1_disjunctive_constraint.html#ae01c325872694c6f9a780832c3ac65f4">DisjunctiveConstraint::SetTransitionTime</a>(</div>
|
|
<div class="line"><a name="l02564"></a><span class="lineno"> 2564</span>  std::function<<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>(<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a>)> transition_time) {</div>
|
|
<div class="line"><a name="l02565"></a><span class="lineno"> 2565</span>  <span class="keywordflow">if</span> (transition_time != <span class="keyword">nullptr</span>) {</div>
|
|
<div class="line"><a name="l02566"></a><span class="lineno"> 2566</span>  <a class="code" href="classoperations__research_1_1_disjunctive_constraint.html#afc37bcfd26805cab838cef7ae4c87444">transition_time_</a> = transition_time;</div>
|
|
<div class="line"><a name="l02567"></a><span class="lineno"> 2567</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l02568"></a><span class="lineno"> 2568</span>  <a class="code" href="classoperations__research_1_1_disjunctive_constraint.html#afc37bcfd26805cab838cef7ae4c87444">transition_time_</a> = [](<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> x, <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> y) { <span class="keywordflow">return</span> 0; };</div>
|
|
<div class="line"><a name="l02569"></a><span class="lineno"> 2569</span>  }</div>
|
|
<div class="line"><a name="l02570"></a><span class="lineno"> 2570</span> }</div>
|
|
<div class="line"><a name="l02571"></a><span class="lineno"> 2571</span>  </div>
|
|
<div class="line"><a name="l02572"></a><span class="lineno"> 2572</span> <span class="comment">// ---------- Factory methods ----------</span></div>
|
|
<div class="line"><a name="l02573"></a><span class="lineno"> 2573</span>  </div>
|
|
<div class="line"><a name="l02574"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a62dca63c6e5610d51dc8c3abe6227747"> 2574</a></span> <a class="code" href="classoperations__research_1_1_disjunctive_constraint.html">DisjunctiveConstraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a62dca63c6e5610d51dc8c3abe6227747">Solver::MakeDisjunctiveConstraint</a>(</div>
|
|
<div class="line"><a name="l02575"></a><span class="lineno"> 2575</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& intervals, <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div>
|
|
<div class="line"><a name="l02576"></a><span class="lineno"> 2576</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> FullDisjunctiveConstraint(<span class="keyword">this</span>, intervals, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, <span class="keyword">false</span>));</div>
|
|
<div class="line"><a name="l02577"></a><span class="lineno"> 2577</span> }</div>
|
|
<div class="line"><a name="l02578"></a><span class="lineno"> 2578</span>  </div>
|
|
<div class="line"><a name="l02579"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a24b4b61a5f3c224f86354447abdccaa8"> 2579</a></span> <a class="code" href="classoperations__research_1_1_disjunctive_constraint.html">DisjunctiveConstraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a24b4b61a5f3c224f86354447abdccaa8">Solver::MakeStrictDisjunctiveConstraint</a>(</div>
|
|
<div class="line"><a name="l02580"></a><span class="lineno"> 2580</span>  <span class="keyword">const</span> std::vector<IntervalVar*>& intervals, <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div>
|
|
<div class="line"><a name="l02581"></a><span class="lineno"> 2581</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> FullDisjunctiveConstraint(<span class="keyword">this</span>, intervals, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>, <span class="keyword">true</span>));</div>
|
|
<div class="line"><a name="l02582"></a><span class="lineno"> 2582</span> }</div>
|
|
<div class="line"><a name="l02583"></a><span class="lineno"> 2583</span>  </div>
|
|
<div class="line"><a name="l02584"></a><span class="lineno"> 2584</span> <span class="comment">// Demands are constant</span></div>
|
|
<div class="line"><a name="l02585"></a><span class="lineno"> 2585</span>  </div>
|
|
<div class="line"><a name="l02586"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda"> 2586</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">Solver::MakeCumulative</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02587"></a><span class="lineno"> 2587</span>  <span class="keyword">const</span> std::vector<int64>& demands,</div>
|
|
<div class="line"><a name="l02588"></a><span class="lineno"> 2588</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div>
|
|
<div class="line"><a name="l02589"></a><span class="lineno"> 2589</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(intervals.size(), demands.size());</div>
|
|
<div class="line"><a name="l02590"></a><span class="lineno"> 2590</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals.size(); ++i) {</div>
|
|
<div class="line"><a name="l02591"></a><span class="lineno"> 2591</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(demands[i], 0);</div>
|
|
<div class="line"><a name="l02592"></a><span class="lineno"> 2592</span>  }</div>
|
|
<div class="line"><a name="l02593"></a><span class="lineno"> 2593</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> == 1 && <a class="code" href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">AreAllOnes</a>(demands)) {</div>
|
|
<div class="line"><a name="l02594"></a><span class="lineno"> 2594</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#a62dca63c6e5610d51dc8c3abe6227747">MakeDisjunctiveConstraint</a>(intervals, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>);</div>
|
|
<div class="line"><a name="l02595"></a><span class="lineno"> 2595</span>  }</div>
|
|
<div class="line"><a name="l02596"></a><span class="lineno"> 2596</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> CumulativeConstraint(<span class="keyword">this</span>, intervals, demands,</div>
|
|
<div class="line"><a name="l02597"></a><span class="lineno"> 2597</span>  <a class="code" href="classoperations__research_1_1_solver.html#af8e836568edff7ff497a6982b403a3ab">MakeIntConst</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>), <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>));</div>
|
|
<div class="line"><a name="l02598"></a><span class="lineno"> 2598</span> }</div>
|
|
<div class="line"><a name="l02599"></a><span class="lineno"> 2599</span>  </div>
|
|
<div class="line"><a name="l02600"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a77443009380c4c406b39bb1299607f4e"> 2600</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">Solver::MakeCumulative</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02601"></a><span class="lineno"> 2601</span>  <span class="keyword">const</span> std::vector<int>& demands,</div>
|
|
<div class="line"><a name="l02602"></a><span class="lineno"> 2602</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div>
|
|
<div class="line"><a name="l02603"></a><span class="lineno"> 2603</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">MakeCumulative</a>(intervals, <a class="code" href="namespaceoperations__research.html#abf97a851d233a8ec9d94e1275fe7e34f">ToInt64Vector</a>(demands), <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>);</div>
|
|
<div class="line"><a name="l02604"></a><span class="lineno"> 2604</span> }</div>
|
|
<div class="line"><a name="l02605"></a><span class="lineno"> 2605</span>  </div>
|
|
<div class="line"><a name="l02606"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#ae6365c8ad4dcc8b689384992f95ddc80"> 2606</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">Solver::MakeCumulative</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02607"></a><span class="lineno"> 2607</span>  <span class="keyword">const</span> std::vector<int64>& demands,</div>
|
|
<div class="line"><a name="l02608"></a><span class="lineno"> 2608</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l02609"></a><span class="lineno"> 2609</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div>
|
|
<div class="line"><a name="l02610"></a><span class="lineno"> 2610</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(intervals.size(), demands.size());</div>
|
|
<div class="line"><a name="l02611"></a><span class="lineno"> 2611</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals.size(); ++i) {</div>
|
|
<div class="line"><a name="l02612"></a><span class="lineno"> 2612</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(demands[i], 0);</div>
|
|
<div class="line"><a name="l02613"></a><span class="lineno"> 2613</span>  }</div>
|
|
<div class="line"><a name="l02614"></a><span class="lineno"> 2614</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(</div>
|
|
<div class="line"><a name="l02615"></a><span class="lineno"> 2615</span>  <span class="keyword">new</span> CumulativeConstraint(<span class="keyword">this</span>, intervals, demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>));</div>
|
|
<div class="line"><a name="l02616"></a><span class="lineno"> 2616</span> }</div>
|
|
<div class="line"><a name="l02617"></a><span class="lineno"> 2617</span>  </div>
|
|
<div class="line"><a name="l02618"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a93e20bcba087839713b8f10e0f906396"> 2618</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">Solver::MakeCumulative</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02619"></a><span class="lineno"> 2619</span>  <span class="keyword">const</span> std::vector<int>& demands,</div>
|
|
<div class="line"><a name="l02620"></a><span class="lineno"> 2620</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l02621"></a><span class="lineno"> 2621</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div>
|
|
<div class="line"><a name="l02622"></a><span class="lineno"> 2622</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">MakeCumulative</a>(intervals, <a class="code" href="namespaceoperations__research.html#abf97a851d233a8ec9d94e1275fe7e34f">ToInt64Vector</a>(demands), <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>);</div>
|
|
<div class="line"><a name="l02623"></a><span class="lineno"> 2623</span> }</div>
|
|
<div class="line"><a name="l02624"></a><span class="lineno"> 2624</span>  </div>
|
|
<div class="line"><a name="l02625"></a><span class="lineno"> 2625</span> <span class="comment">// Demands are variable</span></div>
|
|
<div class="line"><a name="l02626"></a><span class="lineno"> 2626</span>  </div>
|
|
<div class="line"><a name="l02627"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a6cd3daabc584b0d60c8eddb00f09d7c0"> 2627</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">Solver::MakeCumulative</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02628"></a><span class="lineno"> 2628</span>  <span class="keyword">const</span> std::vector<IntVar*>& demands,</div>
|
|
<div class="line"><a name="l02629"></a><span class="lineno"> 2629</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div>
|
|
<div class="line"><a name="l02630"></a><span class="lineno"> 2630</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(intervals.size(), demands.size());</div>
|
|
<div class="line"><a name="l02631"></a><span class="lineno"> 2631</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals.size(); ++i) {</div>
|
|
<div class="line"><a name="l02632"></a><span class="lineno"> 2632</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(demands[i]->Min(), 0);</div>
|
|
<div class="line"><a name="l02633"></a><span class="lineno"> 2633</span>  }</div>
|
|
<div class="line"><a name="l02634"></a><span class="lineno"> 2634</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae4c7a8bfc6877606e512d3279549f44d">AreAllBound</a>(demands)) {</div>
|
|
<div class="line"><a name="l02635"></a><span class="lineno"> 2635</span>  std::vector<int64> fixed_demands(demands.size());</div>
|
|
<div class="line"><a name="l02636"></a><span class="lineno"> 2636</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < demands.size(); ++i) {</div>
|
|
<div class="line"><a name="l02637"></a><span class="lineno"> 2637</span>  fixed_demands[i] = demands[i]->Value();</div>
|
|
<div class="line"><a name="l02638"></a><span class="lineno"> 2638</span>  }</div>
|
|
<div class="line"><a name="l02639"></a><span class="lineno"> 2639</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">MakeCumulative</a>(intervals, fixed_demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>);</div>
|
|
<div class="line"><a name="l02640"></a><span class="lineno"> 2640</span>  }</div>
|
|
<div class="line"><a name="l02641"></a><span class="lineno"> 2641</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> VariableDemandCumulativeConstraint(</div>
|
|
<div class="line"><a name="l02642"></a><span class="lineno"> 2642</span>  <span class="keyword">this</span>, intervals, demands, <a class="code" href="classoperations__research_1_1_solver.html#af8e836568edff7ff497a6982b403a3ab">MakeIntConst</a>(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>), <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>));</div>
|
|
<div class="line"><a name="l02643"></a><span class="lineno"> 2643</span> }</div>
|
|
<div class="line"><a name="l02644"></a><span class="lineno"> 2644</span>  </div>
|
|
<div class="line"><a name="l02645"></a><span class="lineno"><a class="line" href="classoperations__research_1_1_solver.html#a251bbe8741707d92c5ff1fbf2ddcd51c"> 2645</a></span> <a class="code" href="classoperations__research_1_1_constraint.html">Constraint</a>* <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">Solver::MakeCumulative</a>(<span class="keyword">const</span> std::vector<IntervalVar*>& intervals,</div>
|
|
<div class="line"><a name="l02646"></a><span class="lineno"> 2646</span>  <span class="keyword">const</span> std::vector<IntVar*>& demands,</div>
|
|
<div class="line"><a name="l02647"></a><span class="lineno"> 2647</span>  <a class="code" href="classoperations__research_1_1_int_var.html">IntVar</a>* <span class="keyword">const</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l02648"></a><span class="lineno"> 2648</span>  <span class="keyword">const</span> std::string& <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>) {</div>
|
|
<div class="line"><a name="l02649"></a><span class="lineno"> 2649</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(intervals.size(), demands.size());</div>
|
|
<div class="line"><a name="l02650"></a><span class="lineno"> 2650</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < intervals.size(); ++i) {</div>
|
|
<div class="line"><a name="l02651"></a><span class="lineno"> 2651</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(demands[i]->Min(), 0);</div>
|
|
<div class="line"><a name="l02652"></a><span class="lineno"> 2652</span>  }</div>
|
|
<div class="line"><a name="l02653"></a><span class="lineno"> 2653</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research.html#ae4c7a8bfc6877606e512d3279549f44d">AreAllBound</a>(demands)) {</div>
|
|
<div class="line"><a name="l02654"></a><span class="lineno"> 2654</span>  std::vector<int64> fixed_demands(demands.size());</div>
|
|
<div class="line"><a name="l02655"></a><span class="lineno"> 2655</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < demands.size(); ++i) {</div>
|
|
<div class="line"><a name="l02656"></a><span class="lineno"> 2656</span>  fixed_demands[i] = demands[i]->Value();</div>
|
|
<div class="line"><a name="l02657"></a><span class="lineno"> 2657</span>  }</div>
|
|
<div class="line"><a name="l02658"></a><span class="lineno"> 2658</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">MakeCumulative</a>(intervals, fixed_demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>);</div>
|
|
<div class="line"><a name="l02659"></a><span class="lineno"> 2659</span>  }</div>
|
|
<div class="line"><a name="l02660"></a><span class="lineno"> 2660</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">RevAlloc</a>(<span class="keyword">new</span> VariableDemandCumulativeConstraint(</div>
|
|
<div class="line"><a name="l02661"></a><span class="lineno"> 2661</span>  <span class="keyword">this</span>, intervals, demands, <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a>));</div>
|
|
<div class="line"><a name="l02662"></a><span class="lineno"> 2662</span> }</div>
|
|
<div class="line"><a name="l02663"></a><span class="lineno"> 2663</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aclassoperations__research_1_1_int_var_html"><div class="ttname"><a href="classoperations__research_1_1_int_var.html">operations_research::IntVar</a></div><div class="ttdoc">The class IntVar is a subset of IntExpr.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03992">constraint_solver.h:3992</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01858">expr_array.cc:1858</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_abf97a851d233a8ec9d94e1275fe7e34f"><div class="ttname"><a href="namespaceoperations__research.html#abf97a851d233a8ec9d94e1275fe7e34f">operations_research::ToInt64Vector</a></div><div class="ttdeci">std::vector< int64 > ToInt64Vector(const std::vector< int > &input)</div><div class="ttdef"><b>Definition:</b> <a href="utilities_8cc_source.html#l00822">utilities.cc:822</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</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#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00978">base/logging.h:978</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html_a1d89c28bd42ba9a52da008bb69367171"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#a1d89c28bd42ba9a52da008bb69367171">operations_research::PropagationBaseObject::name</a></div><div class="ttdeci">virtual std::string name() const</div><div class="ttdoc">Object naming.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02505">constraint_solver.cc:2505</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a228fe84d99348c2b62bb4f70a6371d9b"><div class="ttname"><a href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">operations_research::CapSub</a></div><div class="ttdeci">int64 CapSub(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00154">saturated_arithmetic.h:154</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</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="aresource_8cc_html_affbc8e3c8c971cf860d20d9e80b15ce7"><div class="ttname"><a href="resource_8cc.html#affbc8e3c8c971cf860d20d9e80b15ce7">energetic_end_min_opt</a></div><div class="ttdeci">int64 energetic_end_min_opt</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00363">resource.cc:363</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ab216763dccd16f5060d2fbcfb08173fb"><div class="ttname"><a href="namespaceoperations__research.html#ab216763dccd16f5060d2fbcfb08173fb">operations_research::CapProd</a></div><div class="ttdeci">int64 CapProd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00231">saturated_arithmetic.h:231</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a1bf2861503e93569c60093cdaec9d694"><div class="ttname"><a href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a></div><div class="ttdeci">int64 energy</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00349">resource.cc:349</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ae3e4f71c4c79e0b4ec00c4e715a7c298"><div class="ttname"><a href="namespaceoperations__research.html#ae3e4f71c4c79e0b4ec00c4e715a7c298">operations_research::AreAllOnes</a></div><div class="ttdeci">bool AreAllOnes(const std::vector< T > &values)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02848">constraint_solveri.h:2848</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_ab741cb25dd32d1cbe02fbfb36337d9bb"><div class="ttname"><a href="classoperations__research_1_1_solver.html#ab741cb25dd32d1cbe02fbfb36337d9bb">operations_research::Solver::RevAlloc</a></div><div class="ttdeci">T * RevAlloc(T *object)</div><div class="ttdoc">Registers the given object as being reversible.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00791">constraint_solver.h:791</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="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(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="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.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">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</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="aresource_8cc_html_aa20b709e09ee1ec845d311fe197cd0a7"><div class="ttname"><a href="resource_8cc.html#aa20b709e09ee1ec845d311fe197cd0a7">kNotInitialized</a></div><div class="ttdeci">static const int64 kNotInitialized</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01244">resource.cc:1244</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_af458164b470cbba416d5ed579e00ff60"><div class="ttname"><a href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div><div class="ttdeci">static const int64 kint64min</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00060">integral_types.h:60</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a34bf102d2fba5e6c9378dd9efe7b1cea"><div class="ttname"><a href="resource_8cc.html#a34bf102d2fba5e6c9378dd9efe7b1cea">argmax_energy_opt</a></div><div class="ttdeci">int argmax_energy_opt</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00359">resource.cc:359</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_ad2d8ce7194f620bb3e20a0b006097e47"><div class="ttname"><a href="resource_8cc.html#ad2d8ce7194f620bb3e20a0b006097e47">argmax_energetic_end_min_opt</a></div><div class="ttdeci">int argmax_energetic_end_min_opt</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00367">resource.cc:367</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aconstraint__solveri_8h_html"><div class="ttname"><a href="constraint__solveri_8h.html">constraint_solveri.h</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a117a9d7745a1c44b90af9f6738f67610"><div class="ttname"><a href="resource_8cc.html#a117a9d7745a1c44b90af9f6738f67610">total_ect</a></div><div class="ttdeci">int64 total_ect</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00196">resource.cc:196</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a62dca63c6e5610d51dc8c3abe6227747"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a62dca63c6e5610d51dc8c3abe6227747">operations_research::Solver::MakeDisjunctiveConstraint</a></div><div class="ttdeci">DisjunctiveConstraint * MakeDisjunctiveConstraint(const std::vector< IntervalVar * > &intervals, const std::string &name)</div><div class="ttdoc">This constraint forces all interval vars into an non-overlapping sequence.</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l02574">resource.cc:2574</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a56f1a81c92849566ae864511088eb7e8"><div class="ttname"><a href="integral__types_8h.html#a56f1a81c92849566ae864511088eb7e8">int32</a></div><div class="ttdeci">int int32</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00033">integral_types.h:33</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="resource_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00099">resource.cc:99</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_constraint.html">operations_research::DisjunctiveConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05334">constraint_solver.h:5334</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(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="aresource_8cc_html_a29fb0dd9484d890b12b280c41c150e20"><div class="ttname"><a href="resource_8cc.html#a29fb0dd9484d890b12b280c41c150e20">demand</a></div><div class="ttdeci">int64 demand</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00123">resource.cc:123</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a82110ba1f45aa29ffc933102880dbd82"><div class="ttname"><a href="namespaceoperations__research.html#a82110ba1f45aa29ffc933102880dbd82">operations_research::MakeDelayedConstraintDemon0</a></div><div class="ttdeci">Demon * MakeDelayedConstraintDemon0(Solver *const s, T *const ct, void(T::*method)(), const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l00688">constraint_solveri.h:688</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a5d590142778c354f4fd48d6f12909af3"><div class="ttname"><a href="resource_8cc.html#a5d590142778c354f4fd48d6f12909af3">total_processing</a></div><div class="ttdeci">int64 total_processing</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00195">resource.cc:195</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_8h_html"><div class="ttname"><a href="constraint__solver_8h.html">constraint_solver.h</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_aaf8ce6c1dff1e40b52ef7e0cb71f0020"><div class="ttname"><a href="resource_8cc.html#aaf8ce6c1dff1e40b52ef7e0cb71f0020">kNotAvailable</a></div><div class="ttdeci">static const int64 kNotAvailable</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01291">resource.cc:1291</a></div></div>
|
|
<div class="ttc" id="astring__array_8h_html"><div class="ttname"><a href="string__array_8h.html">string_array.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a99264812cf177270e521f226a5c012c3"><div class="ttname"><a href="namespaceoperations__research.html#a99264812cf177270e521f226a5c012c3">operations_research::CapAdd</a></div><div class="ttdeci">int64 CapAdd(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00124">saturated_arithmetic.h:124</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_constraint_html_afc37bcfd26805cab838cef7ae4c87444"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_constraint.html#afc37bcfd26805cab838cef7ae4c87444">operations_research::DisjunctiveConstraint::transition_time_</a></div><div class="ttdeci">Solver::IndexEvaluator2 transition_time_</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l05364">constraint_solver.h:5364</a></div></div>
|
|
<div class="ttc" id="amathutil_8h_html"><div class="ttname"><a href="mathutil_8h.html">mathutil.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00697">base/logging.h:697</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_constraint_html_aba974c73a007aa0553c09999b6ea0c2c"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_constraint.html#aba974c73a007aa0553c09999b6ea0c2c">operations_research::DisjunctiveConstraint::~DisjunctiveConstraint</a></div><div class="ttdeci">~DisjunctiveConstraint() override</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l02561">resource.cc:2561</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a7c8133c50ba59755e2162ad1a9478da7"><div class="ttname"><a href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a></div><div class="ttdeci">Rev< int64 > start_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00242">sched_constraints.cc:242</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#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a57ac40de3cbc6dab5c737cc16b672814"><div class="ttname"><a href="sched__constraints_8cc.html#a57ac40de3cbc6dab5c737cc16b672814">performed</a></div><div class="ttdeci">Rev< int > performed</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00245">sched_constraints.cc:245</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#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_constraint_html"><div class="ttname"><a href="classoperations__research_1_1_constraint.html">operations_research::Constraint</a></div><div class="ttdoc">A constraint is the main modeling object.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l03579">constraint_solver.h:3579</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html"><div class="ttname"><a href="classoperations__research_1_1_solver.html">operations_research::Solver</a></div><div class="ttdoc">Solver Class.</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8h_source.html#l00248">constraint_solver.h:248</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ae4c7a8bfc6877606e512d3279549f44d"><div class="ttname"><a href="namespaceoperations__research.html#ae4c7a8bfc6877606e512d3279549f44d">operations_research::AreAllBound</a></div><div class="ttdeci">bool AreAllBound(const std::vector< IntVar * > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solveri_8h_source.html#l02928">constraint_solveri.h:2928</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_af1e66b2f134ccc2e06344f1935bbc16a"><div class="ttname"><a href="namespaceoperations__research.html#af1e66b2f134ccc2e06344f1935bbc16a">operations_research::JoinDebugString</a></div><div class="ttdeci">std::string JoinDebugString(const std::vector< T > &v, const std::string &separator)</div><div class="ttdef"><b>Definition:</b> <a href="string__array_8h_source.html#l00038">string_array.h:38</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a16edac3fa04d9ba10ff012b5fb8add05"><div class="ttname"><a href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a></div><div class="ttdeci">Rev< int64 > end_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00243">sched_constraints.cc:243</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a604bd96cbe6fa5c664c8e85a1f86c8c9"><div class="ttname"><a href="resource_8cc.html#a604bd96cbe6fa5c664c8e85a1f86c8c9">energetic_end_min</a></div><div class="ttdeci">int64 energetic_end_min</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00352">resource.cc:352</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_math_util_html_a0cfaf8b139304c54e3403d4ffbd60157"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#a0cfaf8b139304c54e3403d4ffbd60157">operations_research::MathUtil::CeilOfRatio</a></div><div class="ttdeci">static IntegralType CeilOfRatio(IntegralType numerator, IntegralType denominator)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00039">mathutil.h:39</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#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a73461c37822b6ebb75b54ba1a9ffb442"><div class="ttname"><a href="resource_8cc.html#a73461c37822b6ebb75b54ba1a9ffb442">delta</a></div><div class="ttdeci">int64 delta</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01684">resource.cc:1684</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_af8e836568edff7ff497a6982b403a3ab"><div class="ttname"><a href="classoperations__research_1_1_solver.html#af8e836568edff7ff497a6982b403a3ab">operations_research::Solver::MakeIntConst</a></div><div class="ttdeci">IntVar * MakeIntConst(int64 val, const std::string &name)</div><div class="ttdoc">IntConst will create a constant expression.</div><div class="ttdef"><b>Definition:</b> <a href="expressions_8cc_source.html#l06447">expressions.cc:6447</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_propagation_base_object_html_ad5260b9627048b854b45d05ed34adc22"><div class="ttname"><a href="classoperations__research_1_1_propagation_base_object.html#ad5260b9627048b854b45d05ed34adc22">operations_research::PropagationBaseObject::set_name</a></div><div class="ttdeci">void set_name(const std::string &name)</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l02509">constraint_solver.cc:2509</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_af8df3547bfde53a5acb93e2607b0034a"><div class="ttname"><a href="macros_8h.html#af8df3547bfde53a5acb93e2607b0034a">DISALLOW_COPY_AND_ASSIGN</a></div><div class="ttdeci">#define DISALLOW_COPY_AND_ASSIGN(TypeName)</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00029">macros.h:29</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a9963e75216f4b7b935649eb3e7e81c6b"><div class="ttname"><a href="resource_8cc.html#a9963e75216f4b7b935649eb3e7e81c6b">residual_energetic_end_min</a></div><div class="ttdeci">int64 residual_energetic_end_min</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01235">resource.cc:1235</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf"><div class="ttname"><a href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div><div class="ttdeci">int64 capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00129">routing_flow.cc:129</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_af92a8383a05fdf586a52263d358f5ada"><div class="ttname"><a href="resource_8cc.html#af92a8383a05fdf586a52263d358f5ada">interval</a></div><div class="ttdeci">IntervalVar * interval</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00098">resource.cc:98</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a237a7ad6faa12d814d47d69ee56f2cfc"><div class="ttname"><a href="resource_8cc.html#a237a7ad6faa12d814d47d69ee56f2cfc">kNone</a></div><div class="ttdeci">static const int kNone</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00231">resource.cc:231</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a4ee3db0c4acaa0f277a0d7006f5ad1e6"><div class="ttname"><a href="namespacegtl.html#a4ee3db0c4acaa0f277a0d7006f5ad1e6">gtl::STLDeleteElements</a></div><div class="ttdeci">void STLDeleteElements(T *container)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00372">stl_util.h:372</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a4d68e84f2cdbfec2a2764d1ce523ccda"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a4d68e84f2cdbfec2a2764d1ce523ccda">operations_research::Solver::MakeCumulative</a></div><div class="ttdeci">Constraint * MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int64 > &demands, int64 capacity, const std::string &name)</div><div class="ttdoc">This constraint forces that, for any integer t, the sum of the demands corresponding to an interval c...</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l02586">resource.cc:2586</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a10ae48a53bb9d0ce3024501a7750260b"><div class="ttname"><a href="namespacegtl.html#a10ae48a53bb9d0ce3024501a7750260b">gtl::FindPtrOrNull</a></div><div class="ttdeci">const Collection::value_type::second_type FindPtrOrNull(const Collection &collection, const typename Collection::value_type::first_type &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00070">map_util.h:70</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_disjunctive_constraint_html_ae01c325872694c6f9a780832c3ac65f4"><div class="ttname"><a href="classoperations__research_1_1_disjunctive_constraint.html#ae01c325872694c6f9a780832c3ac65f4">operations_research::DisjunctiveConstraint::SetTransitionTime</a></div><div class="ttdeci">void SetTransitionTime(Solver::IndexEvaluator2 transition_time)</div><div class="ttdoc">Add a transition time between intervals.</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l02563">resource.cc:2563</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#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_html_a24b4b61a5f3c224f86354447abdccaa8"><div class="ttname"><a href="classoperations__research_1_1_solver.html#a24b4b61a5f3c224f86354447abdccaa8">operations_research::Solver::MakeStrictDisjunctiveConstraint</a></div><div class="ttdeci">DisjunctiveConstraint * MakeStrictDisjunctiveConstraint(const std::vector< IntervalVar * > &intervals, const std::string &name)</div><div class="ttdoc">This constraint forces all interval vars into an non-overlapping sequence.</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l02579">resource.cc:2579</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="acommandlineflags_8h_html"><div class="ttname"><a href="commandlineflags_8h.html">commandlineflags.h</a></div></div>
|
|
<div class="ttc" id="adefault__search_8cc_html_ac673bc430bdc3fdaa09f7becf98ef267"><div class="ttname"><a href="default__search_8cc.html#ac673bc430bdc3fdaa09f7becf98ef267">name</a></div><div class="ttdeci">const std::string name</div><div class="ttdef"><b>Definition:</b> <a href="default__search_8cc_source.html#l00808">default_search.cc:808</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a9be76edcbd5ccb982d92c8d90421a73c"><div class="ttname"><a href="namespaceoperations__research.html#a9be76edcbd5ccb982d92c8d90421a73c">operations_research::JoinDebugStringPtr</a></div><div class="ttdeci">std::string JoinDebugStringPtr(const std::vector< T > &v, const std::string &separator)</div><div class="ttdef"><b>Definition:</b> <a href="string__array_8h_source.html#l00045">string_array.h:45</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a115efd2ec0ec9c7ced30f4daadd89ab7"><div class="ttname"><a href="namespacegtl.html#a115efd2ec0ec9c7ced30f4daadd89ab7">gtl::STLDeleteValues</a></div><div class="ttdeci">void STLDeleteValues(T *v)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00382">stl_util.h:382</a></div></div>
|
|
<div class="ttc" id="abitset_8h_html"><div class="ttname"><a href="bitset_8h.html">bitset.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00062">integral_types.h:62</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a13421db7d7e84fff732599bcf954c5cc"><div class="ttname"><a href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a></div><div class="ttdeci">int64 time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01683">resource.cc:1683</a></div></div>
|
|
<div class="ttc" id="amonoid__operation__tree_8h_html"><div class="ttname"><a href="monoid__operation__tree_8h.html">monoid_operation_tree.h</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a1de62b7d2a8338e5c5f3fd7a7cebe226"><div class="ttname"><a href="resource_8cc.html#a1de62b7d2a8338e5c5f3fd7a7cebe226">energy_opt</a></div><div class="ttdeci">int64 energy_opt</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00355">resource.cc:355</a></div></div>
|
|
<!-- 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_afbb39f66221aac28bbdefd1dca2b2b0.html">constraint_solver</a></li><li class="navelem"><a class="el" href="resource_8cc.html">resource.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.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|