1648 lines
326 KiB
HTML
1648 lines
326 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: disjunctive.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">9.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<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','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih: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('disjunctive_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">disjunctive.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="disjunctive_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-2021 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="preprocessor">#include "<a class="code" href="disjunctive_8h.html">ortools/sat/disjunctive.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "<a class="code" href="iterator__adaptors_8h.html">ortools/base/iterator_adaptors.h</a>"</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</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="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="all__different_8h.html">ortools/sat/all_different.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="sat__parameters_8pb_8h.html">ortools/sat/sat_parameters.pb.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="timetable_8h.html">ortools/sat/timetable.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="sort_8h.html">ortools/util/sort.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0"> 30</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0">Disjunctive</a>(</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars) {</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordtype">bool</span> is_all_different = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>* repository = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">if</span> (repository-><a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#ad60fd00d952a6e8a23e11986bfff121a">IsOptional</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) || repository-><a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#a7a7a69d2e822ff3cb2e87d63811259c5">MinSize</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != 1 ||</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  repository-><a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#a47498392329550af590cc3f6d9dedbf5">MaxSize</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) != 1 ||</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  repository-><a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#a558d12a34c3e461abaa1995ad5b193e6">Start</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">constant</a> != 0 ||</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  repository-><a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#a558d12a34c3e461abaa1995ad5b193e6">Start</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ad7d5fda7881b6c8fdc9d1e7a74ee4a2e">coeff</a> != 1) {</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  is_all_different = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  }</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  }</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">if</span> (is_all_different) {</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  std::vector<IntegerVariable> starts;</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  starts.reserve(vars.size());</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  starts.push_back(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Get(<a class="code" href="namespaceoperations__research_1_1sat.html#aa9db4da9c740b17ac7e7e3b7915328a7">StartVar</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)));</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>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a467d0c8bf263413aae5e5e530d4c5259">AllDifferentOnBounds</a>(starts));</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  }</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">auto</span>* watcher = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>();</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& sat_parameters = *<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatParameters>();</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">if</span> (vars.size() > 2 && sat_parameters.use_combined_no_overlap()) {</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html">CombinedDisjunctive<true></a>>()->AddNoOverlap(vars);</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html">CombinedDisjunctive<false></a>>()->AddNoOverlap(vars);</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  </div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper =</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(vars, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(helper);</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>  <span class="comment">// Experiments to use the timetable only to propagate the disjunctive.</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (<span class="comment">/*DISABLES_CODE*/</span> (<span class="keyword">false</span>)) {</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> one(IntegerValue(1));</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  std::vector<AffineExpression> demands(vars.size(), one);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">TimeTablingPerTask</a>* timetable = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">TimeTablingPerTask</a>(</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  demands, one, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>(), helper);</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  timetable-><a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(timetable);</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">return</span>;</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="keywordflow">if</span> (vars.size() == 2) {</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html">DisjunctiveWithTwoItems</a>* propagator = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html">DisjunctiveWithTwoItems</a>(helper);</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  propagator-><a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#a1868d977c2e9baed0f16c9ec71d6626e">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(propagator);</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// We decided to create the propagators in this particular order, but it</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="comment">// shouldn't matter much because of the different priorities used.</span></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>  <span class="comment">// Only one direction is needed by this one.</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html">DisjunctiveOverloadChecker</a>* overload_checker =</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html">DisjunctiveOverloadChecker</a>(helper);</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = overload_checker-><a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  watcher->SetPropagatorPriority(<span class="keywordtype">id</span>, 1);</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(overload_checker);</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  }</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">bool</span> time_direction : {<span class="keyword">true</span>, <span class="keyword">false</span>}) {</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html">DisjunctiveDetectablePrecedences</a>* detectable_precedences =</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html">DisjunctiveDetectablePrecedences</a>(time_direction, helper);</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = detectable_precedences-><a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#a1868d977c2e9baed0f16c9ec71d6626e">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  watcher->SetPropagatorPriority(<span class="keywordtype">id</span>, 2);</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(detectable_precedences);</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">bool</span> time_direction : {<span class="keyword">true</span>, <span class="keyword">false</span>}) {</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html">DisjunctiveNotLast</a>* not_last =</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html">DisjunctiveNotLast</a>(time_direction, helper);</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = not_last-><a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#a1868d977c2e9baed0f16c9ec71d6626e">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  watcher->SetPropagatorPriority(<span class="keywordtype">id</span>, 3);</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(not_last);</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  }</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">bool</span> time_direction : {<span class="keyword">true</span>, <span class="keyword">false</span>}) {</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html">DisjunctiveEdgeFinding</a>* edge_finding =</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html">DisjunctiveEdgeFinding</a>(time_direction, helper);</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = edge_finding-><a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#a1868d977c2e9baed0f16c9ec71d6626e">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  watcher->SetPropagatorPriority(<span class="keywordtype">id</span>, 4);</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(edge_finding);</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>  }</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="comment">// Note that we keep this one even when there is just two intervals. This is</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// because it might push a variable that is after both of the intervals</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// using the fact that they are in disjunction.</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (sat_parameters.use_precedences_in_disjunctive_constraint() &&</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  !sat_parameters.use_combined_no_overlap()) {</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">bool</span> time_direction : {<span class="keyword">true</span>, <span class="keyword">false</span>}) {</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html">DisjunctivePrecedences</a>* precedences = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html">DisjunctivePrecedences</a>(</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  time_direction, helper, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>(),</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>());</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = precedences-><a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#a1868d977c2e9baed0f16c9ec71d6626e">RegisterWith</a>(watcher);</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  watcher->SetPropagatorPriority(<span class="keywordtype">id</span>, 5);</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(precedences);</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  }</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  };</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> }</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  </div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a73098886bd45684da9f3b3019c25ab93"> 132</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a73098886bd45684da9f3b3019c25ab93">DisjunctiveWithBooleanPrecedencesOnly</a>(</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars) {</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* sat_solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>();</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>* repository = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* precedences =</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>();</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < i; ++j) {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keyword">const</span> BooleanVariable boolean_var = sat_solver-><a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html#a43684a0a8ef85b1cea0076dba3fb271d">NewBooleanVariable</a>();</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> i_before_j = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(boolean_var, <span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> j_before_i = i_before_j.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  precedences->AddConditionalPrecedence(repository->EndVar(vars[i]),</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  repository->StartVar(vars[j]),</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  i_before_j);</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  precedences->AddConditionalPrecedence(repository->EndVar(vars[j]),</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  repository->StartVar(vars[i]),</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  j_before_i);</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>  }</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  };</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span> }</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  </div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a89be28cfe3c4682b26fd153f9f133705"> 155</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a89be28cfe3c4682b26fd153f9f133705">DisjunctiveWithBooleanPrecedences</a>(</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars) {</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a73098886bd45684da9f3b3019c25ab93">DisjunctiveWithBooleanPrecedencesOnly</a>(vars));</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0">Disjunctive</a>(vars));</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> }</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  </div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a98c223e2c82a01f67cd71dd4eca70b70"> 163</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a98c223e2c82a01f67cd71dd4eca70b70">TaskSet::AddEntry</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">Entry</a>& e) {</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordtype">int</span> j = sorted_tasks_.size();</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  sorted_tasks_.push_back(e);</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordflow">while</span> (j > 0 && sorted_tasks_[j - 1].<a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> > e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a>) {</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  sorted_tasks_[j] = sorted_tasks_[j - 1];</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  --j;</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  sorted_tasks_[j] = e;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(sorted_tasks_.begin(), sorted_tasks_.end()));</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  </div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// If the task is added after optimized_restart_, we know that we don't need</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// to scan the task before optimized_restart_ in the next ComputeEndMin().</span></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">if</span> (j <= optimized_restart_) optimized_restart_ = 0;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> }</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a7e3986de45625c55b092944d4cd9e547"> 178</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a7e3986de45625c55b092944d4cd9e547">TaskSet::AddShiftedStartMinEntry</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>& helper,</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keywordtype">int</span> t) {</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keyword">const</span> IntegerValue dmin = helper.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(t);</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a98c223e2c82a01f67cd71dd4eca70b70">AddEntry</a>({t, <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(helper.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(t), helper.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(t) - dmin), dmin});</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> }</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  </div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a122123bd7c7d530bbd686617ffb4c798"> 184</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a122123bd7c7d530bbd686617ffb4c798">TaskSet::NotifyEntryIsNowLastIfPresent</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">Entry</a>& e) {</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = sorted_tasks_.size();</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0;; ++i) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (i == size) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">if</span> (sorted_tasks_[i].task == e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a427ef99d8b77e4cac03718a0a769f806">task</a>) {</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  sorted_tasks_.erase(sorted_tasks_.begin() + i);</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</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>  optimized_restart_ = sorted_tasks_.size();</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  sorted_tasks_.push_back(e);</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(sorted_tasks_.begin(), sorted_tasks_.end()));</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"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a34dd782f4175fa103604d994fba1d6de"> 199</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a34dd782f4175fa103604d994fba1d6de">TaskSet::RemoveEntryWithIndex</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  sorted_tasks_.erase(sorted_tasks_.begin() + <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  optimized_restart_ = 0;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> }</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  </div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a95dc40a61faa48e7996a4c139a9d119d"> 204</a></span> IntegerValue <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a95dc40a61faa48e7996a4c139a9d119d">TaskSet::ComputeEndMin</a>()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(sorted_tasks_.begin(), sorted_tasks_.end()));</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = sorted_tasks_.size();</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  IntegerValue <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = optimized_restart_; i < size; ++i) {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">Entry</a>& e = sorted_tasks_[i];</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> >= <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>) {</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  optimized_restart_ = i;</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> = e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> + e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a65aeef300c5d89103a5b85a3191a9a20">size_min</a>;</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> += e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a65aeef300c5d89103a5b85a3191a9a20">size_min</a>;</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>  }</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">return</span> <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>;</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span> }</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  </div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a9b7d82da31ff9f63b9c25d7841065d99"> 220</a></span> IntegerValue <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a95dc40a61faa48e7996a4c139a9d119d">TaskSet::ComputeEndMin</a>(<span class="keywordtype">int</span> task_to_ignore,</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordtype">int</span>* critical_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// The order in which we process tasks with the same start-min doesn't matter.</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(sorted_tasks_.begin(), sorted_tasks_.end()));</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordtype">bool</span> ignored = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = sorted_tasks_.size();</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  IntegerValue <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  </div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// If the ignored task is last and was the start of the critical block, then</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// we need to reset optimized_restart_.</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">if</span> (optimized_restart_ + 1 == size &&</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  sorted_tasks_[optimized_restart_].task == task_to_ignore) {</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  optimized_restart_ = 0;</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  }</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  </div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = optimized_restart_; i < size; ++i) {</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">Entry</a>& e = sorted_tasks_[i];</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a427ef99d8b77e4cac03718a0a769f806">task</a> == task_to_ignore) {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  ignored = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span> (e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> >= <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>) {</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  *critical_index = i;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  <span class="keywordflow">if</span> (!ignored) optimized_restart_ = i;</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> = e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> + e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a65aeef300c5d89103a5b85a3191a9a20">size_min</a>;</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> += e.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a65aeef300c5d89103a5b85a3191a9a20">size_min</a>;</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordflow">return</span> <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</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>  </div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 252</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#ac1fe9b1f2b978c4283e42f12e586eb1e">DisjunctiveWithTwoItems::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>(), 2);</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  </div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// We can't propagate anything if one of the interval is absent for sure.</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(0) || helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(1)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  </div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="comment">// Note that this propagation also take care of the "overload checker" part.</span></div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="comment">// It also propagates as much as possible, even in the presence of task with</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// variable sizes.</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// TODO(user): For optional interval whose presence in unknown and without</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// optional variable, the end-min may not be propagated to at least (start_min</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// + size_min). Consider that into the computation so we may decide the</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// interval forced absence? Same for the start-max.</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordtype">int</span> task_before = 0;</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordtype">int</span> task_after = 1;</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(0) < helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(1)) {</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// Task 0 must be before task 1.</span></div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(1) < helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(0)) {</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// Task 1 must be before task 0.</span></div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(task_before, task_after);</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  }</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  </div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(task_before)) {</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keyword">const</span> IntegerValue end_min_before = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(task_before);</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(task_after) < end_min_before) {</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// Reason for precedences if both present.</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(task_before, task_after);</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  </div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// Reason for the bound push.</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(task_before);</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">AddEndMinReason</a>(task_before, end_min_before);</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36">IncreaseStartMin</a>(task_after, end_min_before)) {</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</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>  </div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(task_after)) {</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keyword">const</span> IntegerValue start_max_after = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(task_after);</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(task_before) > start_max_after) {</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// Reason for precedences if both present.</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(task_before, task_after);</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  </div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">// Reason for the bound push.</span></div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(task_after);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">AddStartMaxReason</a>(task_after, start_max_after);</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9cff7d47d665651c22433d6c793092a8">DecreaseEndMax</a>(task_before, start_max_after)) {</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  }</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  </div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span> }</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  </div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#a1868d977c2e9baed0f16c9ec71d6626e"> 313</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#a1868d977c2e9baed0f16c9ec71d6626e">DisjunctiveWithTwoItems::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="comment">// This propagator reach the fix point in one pass.</span></div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher);</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">return</span> id;</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span> }</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  </div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> time_direction></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#a72c8b5cc99139caeaa87018bcf71732c"> 321</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#a72c8b5cc99139caeaa87018bcf71732c">CombinedDisjunctive<time_direction>::CombinedDisjunctive</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  : helper_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_all_intervals_helper.html">AllIntervalsHelper</a>>()) {</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  task_to_disjunctives_.resize(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>());</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">auto</span>* watcher = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>();</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher, <span class="comment">/*watch_start_max=*/</span><span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">/*watch_end_max=*/</span><span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  watcher->NotifyThatPropagatorMayNotReachFixedPointInOnePass(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span> }</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  </div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> time_direction></div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#a55a91d657715ec9c9d5a0d2a54239957"> 333</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#a55a91d657715ec9c9d5a0d2a54239957">CombinedDisjunctive<time_direction>::AddNoOverlap</a>(</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars) {</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = task_sets_.size();</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  task_sets_.emplace_back(vars.size());</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  end_mins_.push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>);</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  task_to_disjunctives_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value()].push_back(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  }</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span> }</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  </div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> time_direction></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 344</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#ac1fe9b1f2b978c4283e42f12e586eb1e">CombinedDisjunctive<time_direction>::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  helper_->SynchronizeAndSetTimeDirection(time_direction);</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& task_by_increasing_end_min = helper_->TaskByIncreasingEndMin();</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& task_by_decreasing_start_max =</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  helper_->TaskByDecreasingStartMax();</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  </div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span>& task_set : task_sets_) task_set.Clear();</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  end_mins_.assign(end_mins_.size(), <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>);</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  IntegerValue max_of_end_min = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</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="keyword">const</span> <span class="keywordtype">int</span> num_tasks = helper_->NumTasks();</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  task_is_added_.assign(num_tasks, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordtype">int</span> queue_index = num_tasks - 1;</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> task_time : task_by_increasing_end_min) {</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = task_time.task_index;</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> = task_time.time;</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">if</span> (helper_->IsAbsent(t)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  </div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="comment">// Update all task sets.</span></div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">while</span> (queue_index >= 0) {</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">const</span> <span class="keyword">auto</span> to_insert = task_by_decreasing_start_max[queue_index];</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task_index = to_insert.task_index;</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> = to_insert.time;</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> <= <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">if</span> (helper_->IsPresent(task_index)) {</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  task_is_added_[task_index] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keyword">const</span> IntegerValue shifted_smin = helper_->ShiftedStartMin(task_index);</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">const</span> IntegerValue size_min = helper_->SizeMin(task_index);</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> d_index : task_to_disjunctives_[task_index]) {</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="comment">// TODO(user): AddEntry() and ComputeEndMin() could be combined.</span></div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  task_sets_[d_index].AddEntry({task_index, shifted_smin, size_min});</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  end_mins_[d_index] = task_sets_[d_index].ComputeEndMin();</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  max_of_end_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_of_end_min, end_mins_[d_index]);</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>  }</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  --queue_index;</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="comment">// Find out amongst the disjunctives in which t appear, the one with the</span></div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// largest end_min, ignoring t itself. This will be the new start min for t.</span></div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  IntegerValue new_start_min = helper_->StartMin(t);</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="keywordflow">if</span> (new_start_min >= max_of_end_min) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordtype">int</span> best_critical_index = 0;</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordtype">int</span> best_d_index = -1;</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keywordflow">if</span> (task_is_added_[t]) {</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> d_index : task_to_disjunctives_[t]) {</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">if</span> (new_start_min >= end_mins_[d_index]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordtype">int</span> critical_index = 0;</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keyword">const</span> IntegerValue end_min_of_critical_tasks =</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  task_sets_[d_index].ComputeEndMin(<span class="comment">/*task_to_ignore=*/</span>t,</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  &critical_index);</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(end_min_of_critical_tasks, max_of_end_min);</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">if</span> (end_min_of_critical_tasks > new_start_min) {</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  new_start_min = end_min_of_critical_tasks;</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  best_d_index = d_index;</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  best_critical_index = critical_index;</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  }</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="comment">// If the task t was not added, then there is no task to ignore and</span></div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">// end_mins_[d_index] is up to date.</span></div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> d_index : task_to_disjunctives_[t]) {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">if</span> (end_mins_[d_index] > new_start_min) {</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  new_start_min = end_mins_[d_index];</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  best_d_index = d_index;</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  }</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">if</span> (best_d_index != -1) {</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keyword">const</span> IntegerValue end_min_of_critical_tasks =</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  task_sets_[best_d_index].ComputeEndMin(<span class="comment">/*task_to_ignore=*/</span>t,</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  &best_critical_index);</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(end_min_of_critical_tasks, new_start_min);</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>  }</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  </div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="comment">// Do we push something?</span></div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">if</span> (best_d_index == -1) <span class="keywordflow">continue</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>  <span class="comment">// Same reason as DisjunctiveDetectablePrecedences.</span></div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="comment">// TODO(user): Maybe factor out the code? It does require a function with a</span></div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// lot of arguments though.</span></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  helper_->ClearReason();</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keyword">const</span> std::vector<TaskSet::Entry>& sorted_tasks =</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  task_sets_[best_d_index].SortedTasks();</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keyword">const</span> IntegerValue window_start =</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  sorted_tasks[best_critical_index].start_min;</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = best_critical_index; i < sorted_tasks.size(); ++i) {</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = sorted_tasks[i].task;</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> == t) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  helper_->AddPresenceReason(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  helper_->AddEnergyAfterReason(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, sorted_tasks[i].size_min, window_start);</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  helper_->AddStartMaxReason(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> - 1);</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>  helper_->AddEndMinReason(t, <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>);</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">if</span> (!helper_->IncreaseStartMin(t, new_start_min)) {</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  }</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  </div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// We need to reorder t inside task_set_. Note that if t is in the set,</span></div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="comment">// it means that the task is present and that IncreaseStartMin() did push</span></div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// its start (by opposition to an optional interval where the push might</span></div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="comment">// not happen if its start is not optional).</span></div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (task_is_added_[t]) {</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keyword">const</span> IntegerValue shifted_smin = helper_->ShiftedStartMin(t);</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keyword">const</span> IntegerValue size_min = helper_->SizeMin(t);</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> d_index : task_to_disjunctives_[t]) {</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  task_sets_[d_index].NotifyEntryIsNowLastIfPresent(</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  {t, shifted_smin, size_min});</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  end_mins_[d_index] = task_sets_[d_index].ComputeEndMin();</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  max_of_end_min = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_of_end_min, end_mins_[d_index]);</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 460</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">DisjunctiveOverloadChecker::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(<span class="comment">/*is_forward=*/</span><span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  </div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// Split problem into independent part.</span></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="comment">// Many propagators in this file use the same approach, we start by processing</span></div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">// the task by increasing start-min, packing everything to the left. We then</span></div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// process each "independent" set of task separately. A task is independent</span></div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// from the one before it, if its start-min wasn't pushed.</span></div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// This way, we get one or more window [window_start, window_end] so that for</span></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="comment">// all task in the window, [start_min, end_min] is inside the window, and the</span></div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="comment">// end min of any set of task to the left is <= window_start, and the</span></div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="comment">// start_min of any task to the right is >= end_min.</span></div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  window_.clear();</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  IntegerValue window_end = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  IntegerValue relevant_end;</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordtype">int</span> relevant_size = 0;</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a> task_time : helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d">TaskByIncreasingShiftedStartMin</a>()) {</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = task_time.task_index;</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(task)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  </div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> = task_time.time;</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> < window_end) {</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  window_.push_back(task_time);</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  window_end += helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keywordflow">if</span> (window_end > helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(task)) {</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  relevant_size = window_.size();</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  relevant_end = window_end;</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  }</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">continue</span>;</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>  </div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// Process current window.</span></div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// We don't need to process the end of the window (after relevant_size)</span></div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="comment">// because these interval can be greedily assembled in a feasible solution.</span></div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  window_.resize(relevant_size);</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">if</span> (relevant_size > 0 && !PropagateSubwindow(relevant_end)) {</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  </div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// Start of the next window.</span></div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  window_.clear();</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  window_.push_back(task_time);</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  window_end = <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> + helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  relevant_size = 0;</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  </div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// Process last window.</span></div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  window_.resize(relevant_size);</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">if</span> (relevant_size > 0 && !PropagateSubwindow(relevant_end)) {</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  </div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span> }</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="comment">// TODO(user): Improve the Overload Checker using delayed insertion.</span></div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span> <span class="comment">// We insert events at the cost of O(log n) per insertion, and this is where</span></div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="comment">// the algorithm spends most of its time, thus it is worth improving.</span></div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span> <span class="comment">// We can insert an arbitrary set of tasks at the cost of O(n) for the whole</span></div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span> <span class="comment">// set. This is useless for the overload checker as is since we need to check</span></div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span> <span class="comment">// overload after every insertion, but we could use an upper bound of the</span></div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span> <span class="comment">// theta envelope to save us from checking the actual value.</span></div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="keywordtype">bool</span> DisjunctiveOverloadChecker::PropagateSubwindow(</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  IntegerValue global_window_end) {</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="comment">// Set up theta tree and task_by_increasing_end_max_.</span></div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> window_size = window_.size();</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">Reset</a>(window_size);</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  task_by_increasing_end_max_.clear();</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < window_size; ++i) {</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">// No point adding a task if its end_max is too large.</span></div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = window_[i].task_index;</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(task);</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> < global_window_end) {</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  task_to_event_[task] = i;</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  task_by_increasing_end_max_.push_back({task, <a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a>});</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</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>  </div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  <span class="comment">// Introduce events by increasing end_max, check for overloads.</span></div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  std::sort(task_by_increasing_end_max_.begin(),</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  task_by_increasing_end_max_.end());</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> task_time : task_by_increasing_end_max_) {</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_task = task_time.task_index;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  </div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="comment">// We filtered absent task while constructing the subwindow, but it is</span></div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="comment">// possible that as we propagate task absence below, other task also become</span></div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">// absent (if they share the same presence Boolean).</span></div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(current_task)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  </div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(task_to_event_[current_task], -1);</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  {</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_event = task_to_event_[current_task];</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keyword">const</span> IntegerValue energy_min = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(current_task);</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(current_task)) {</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="comment">// TODO(user,user): Add max energy deduction for variable</span></div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="comment">// sizes by putting the energy_max here and modifying the code</span></div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="comment">// dealing with the optional envelope greater than current_end below.</span></div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(current_event, window_[current_event].<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>,</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  energy_min, energy_min);</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">AddOrUpdateOptionalEvent</a>(</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  current_event, window_[current_event].<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>, energy_min);</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>  }</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  </div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keyword">const</span> IntegerValue current_end = task_time.time;</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">if</span> (theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>() > current_end) {</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// Explain failure with tasks in critical interval.</span></div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> critical_event =</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a75c0a813b413b5718813636f2120a790">GetMaxEventWithEnvelopeGreaterThan</a>(current_end);</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keyword">const</span> IntegerValue window_start = window_[critical_event].time;</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keyword">const</span> IntegerValue window_end =</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0718fcbb3200da053b8df062e6711d48">GetEnvelopeOf</a>(critical_event) - 1;</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = critical_event; <span class="keyword">event</span> < window_size; <span class="keyword">event</span>++) {</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keyword">const</span> IntegerValue energy_min = theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac6641ed613360a1063cc5901ef8b564c">EnergyMin</a>(event);</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keywordflow">if</span> (energy_min > 0) {</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = window_[event].task_index;</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(task);</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(task, energy_min, window_start);</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">AddEndMaxReason</a>(task, window_end);</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  }</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  }</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">return</span> helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  }</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  </div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">// Exclude all optional tasks that would overload an interval ending here.</span></div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="keywordflow">while</span> (theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">GetOptionalEnvelope</a>() > current_end) {</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="comment">// Explain exclusion with tasks present in the critical interval.</span></div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">// TODO(user): This could be done lazily, like most of the loop to</span></div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// compute the reasons in this file.</span></div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordtype">int</span> critical_event;</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="keywordtype">int</span> optional_event;</div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  IntegerValue available_energy;</div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">GetEventsWithOptionalEnvelopeGreaterThan</a>(</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  current_end, &critical_event, &optional_event, &available_energy);</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  </div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> optional_task = window_[optional_event].task_index;</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">const</span> IntegerValue optional_size_min = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(optional_task);</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keyword">const</span> IntegerValue window_start = window_[critical_event].time;</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keyword">const</span> IntegerValue window_end =</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  current_end + optional_size_min - available_energy - 1;</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = critical_event; <span class="keyword">event</span> < window_size; <span class="keyword">event</span>++) {</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  <span class="keyword">const</span> IntegerValue energy_min = theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac6641ed613360a1063cc5901ef8b564c">EnergyMin</a>(event);</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">if</span> (energy_min > 0) {</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = window_[event].task_index;</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(task);</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(task, energy_min, window_start);</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">AddEndMaxReason</a>(task, window_end);</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  }</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  </div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(optional_task, optional_size_min,</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  window_start);</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">AddEndMaxReason</a>(optional_task, window_end);</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  </div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// If tasks shares the same presence literal, it is possible that we</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// already pushed this task absence.</span></div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(optional_task)) {</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">PushTaskAbsence</a>(optional_task)) <span class="keywordflow">return</span> <span class="keyword">false</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>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">RemoveEvent</a>(optional_event);</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>  }</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  </div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span> }</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  </div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e"> 631</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">DisjunctiveOverloadChecker::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="comment">// This propagator reach the fix point in one pass.</span></div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(<span class="comment">/*is_forward=*/</span><span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher, <span class="comment">/*watch_start_max=*/</span><span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">/*watch_end_max=*/</span><span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keywordflow">return</span> id;</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span> }</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  </div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 640</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e">DisjunctiveDetectablePrecedences::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(time_direction_);</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  </div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  to_propagate_.clear();</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  processed_.assign(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>(), <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  </div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  <span class="comment">// Split problem into independent part.</span></div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// The "independent" window can be processed separately because for each of</span></div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="comment">// them, a task [start-min, end-min] is in the window [window_start,</span></div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  <span class="comment">// window_end]. So any task to the left of the window cannot push such</span></div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="comment">// task start_min, and any task to the right of the window will have a</span></div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="comment">// start_max >= end_min, so wouldn't be in detectable precedence.</span></div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  task_by_increasing_end_min_.clear();</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  IntegerValue window_end = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a> task_time : helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d">TaskByIncreasingShiftedStartMin</a>()) {</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = task_time.task_index;</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(task)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  </div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keyword">const</span> IntegerValue shifted_smin = task_time.time;</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="keyword">const</span> IntegerValue size_min = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</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>  <span class="comment">// Tricky: Because we use the up to date version of size_min (that might</span></div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">// have increased in one of the PropagateSubwindow() call) and the cached</span></div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">// shifted_smin which didn't change, we cannot do shifted_smin +</span></div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="comment">// size_min which might be higher than the actual end_min_if_present.</span></div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="comment">// So we use the updated value instead.</span></div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="comment">// Note that we have the same problem below when window_end might be higher</span></div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="comment">// that it is actually, but that is fine since we will just decompose less.</span></div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keyword">const</span> IntegerValue end_min_if_present =</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(task), helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(task) + size_min);</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="comment">// Note that we use the real StartMin() here, as this is the one we will</span></div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="comment">// push.</span></div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(task) < window_end) {</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  task_by_increasing_end_min_.push_back({task, end_min_if_present});</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  window_end = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(window_end, shifted_smin) + size_min;</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  }</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  </div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="comment">// Process current window.</span></div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  <span class="keywordflow">if</span> (task_by_increasing_end_min_.size() > 1 && !PropagateSubwindow()) {</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  }</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  </div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="comment">// Start of the next window.</span></div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  task_by_increasing_end_min_.clear();</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  task_by_increasing_end_min_.push_back({task, end_min_if_present});</div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  window_end = end_min_if_present;</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>  </div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="keywordflow">if</span> (task_by_increasing_end_min_.size() > 1 && !PropagateSubwindow()) {</div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  }</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  </div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span> }</div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  </div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span> <span class="keywordtype">bool</span> DisjunctiveDetectablePrecedences::PropagateSubwindow() {</div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!task_by_increasing_end_min_.empty());</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>  <span class="comment">// The vector is already sorted by shifted_start_min, so there is likely a</span></div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="comment">// good correlation, hence the incremental sort.</span></div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <a class="code" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(task_by_increasing_end_min_.begin(),</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  task_by_increasing_end_min_.end());</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keyword">const</span> IntegerValue max_end_min = task_by_increasing_end_min_.back().time;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  </div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="comment">// Fill and sort task_by_increasing_start_max_.</span></div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="comment">// TODO(user): we should use start max if present, but more generally, all</span></div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="comment">// helper function should probably return values "if present".</span></div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  task_by_increasing_start_max_.clear();</div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a> entry : task_by_increasing_end_min_) {</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = entry.task_index;</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(task);</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">if</span> (start_max < max_end_min && helper_->IsPresent(task)) {</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  task_by_increasing_start_max_.push_back({task, <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>});</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</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="keywordflow">if</span> (task_by_increasing_start_max_.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  std::sort(task_by_increasing_start_max_.begin(),</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  task_by_increasing_start_max_.end());</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  </div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// Invariant: need_update is false implies that task_set_end_min is equal to</span></div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="comment">// task_set_.ComputeEndMin().</span></div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// TODO(user): Maybe it is just faster to merge ComputeEndMin() with</span></div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">// AddEntry().</span></div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keywordtype">bool</span> need_update = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  IntegerValue task_set_end_min = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  </div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordtype">int</span> queue_index = 0;</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="keywordtype">int</span> blocking_task = -1;</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> queue_size = task_by_increasing_start_max_.size();</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> task_time : task_by_increasing_end_min_) {</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="comment">// Note that we didn't put absent task in task_by_increasing_end_min_, but</span></div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="comment">// the absence might have been pushed while looping here. This is fine since</span></div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="comment">// any push we do on this task should handle this case correctly.</span></div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="comment">// TODO(user): Still test and continue the status even if in most cases the</span></div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="comment">// task will not be absent?</span></div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> current_task = task_time.task_index;</div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keyword">const</span> IntegerValue current_end_min = task_time.time;</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>  <span class="keywordflow">for</span> (; queue_index < queue_size; ++queue_index) {</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keyword">const</span> <span class="keyword">auto</span> to_insert = task_by_increasing_start_max_[queue_index];</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> = to_insert.time;</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordflow">if</span> (current_end_min <= <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  </div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = to_insert.task_index;</div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t));</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="comment">// If t has not been processed yet, it has a mandatory part, and rather</span></div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="comment">// than adding it right away to task_set, we will delay all propagation</span></div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="comment">// until current_task is equal to this "blocking task".</span></div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="comment">// This idea is introduced in "Linear-Time Filtering Algorithms for the</span></div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// Disjunctive Constraints" Hamed Fahimi, Claude-Guy Quimper.</span></div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="comment">// Experiments seems to indicate that it is slighlty faster rather than</span></div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="comment">// having to ignore one of the task already inserted into task_set_ when</span></div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  <span class="comment">// we have tasks with mandatory parts. It also open-up more option for the</span></div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">// data structure used in task_set_.</span></div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">if</span> (!processed_[t]) {</div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordflow">if</span> (blocking_task != -1) {</div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">// We have two blocking tasks, which means they are in conflict.</span></div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(blocking_task);</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(t);</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(blocking_task, t);</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(t, blocking_task);</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="keywordflow">return</span> helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  }</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(<a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>, helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">ShiftedStartMin</a>(t) + helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(t))</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  << <span class="stringliteral">" task should have mandatory part: "</span></div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  << helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a747c0efc6328c426805df876287111ef">TaskDebugString</a>(t);</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(to_propagate_.empty());</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  blocking_task = t;</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  to_propagate_.push_back(t);</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  need_update = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a7e3986de45625c55b092944d4cd9e547">AddShiftedStartMinEntry</a>(*helper_, t);</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  }</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  }</div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  </div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="comment">// If we have a blocking task, we delay the propagation until current_task</span></div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="comment">// is the blocking task.</span></div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">if</span> (blocking_task != current_task) {</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  to_propagate_.push_back(current_task);</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="keywordflow">if</span> (blocking_task != -1) <span class="keywordflow">continue</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>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> t : to_propagate_) {</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!processed_[t]);</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  processed_[t] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">if</span> (need_update) {</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  need_update = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  task_set_end_min = task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a9b7d82da31ff9f63b9c25d7841065d99">ComputeEndMin</a>();</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  }</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  </div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="comment">// task_set_ contains all the tasks that must be executed before t. They</span></div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="comment">// are in "detectable precedence" because their start_max is smaller than</span></div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="comment">// the end-min of t like so:</span></div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="comment">// [(the task t)</span></div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="comment">// (a task in task_set_)]</span></div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="comment">// From there, we deduce that the start-min of t is greater or equal to</span></div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="comment">// the end-min of the critical tasks.</span></div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="comment">// Note that this works as well when IsPresent(t) is false.</span></div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">if</span> (task_set_end_min > helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(t)) {</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> critical_index = task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a425191fbad86521fccd89226ed8dfbb0">GetCriticalIndex</a>();</div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keyword">const</span> std::vector<TaskSet::Entry>& sorted_tasks =</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#ab1073196aabdb8a939860e16e9f8b505">SortedTasks</a>();</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  </div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="comment">// We need:</span></div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="comment">// - StartMax(ct) < EndMin(t) for the detectable precedence.</span></div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="comment">// - StartMin(ct) >= window_start for the value of task_set_end_min.</span></div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keyword">const</span> IntegerValue end_min_if_present =</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">ShiftedStartMin</a>(t) + helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(t);</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keyword">const</span> IntegerValue window_start =</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  sorted_tasks[critical_index].start_min;</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = critical_index; i < sorted_tasks.size(); ++i) {</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = sorted_tasks[i].task;</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, t);</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, sorted_tasks[i].size_min,</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  window_start);</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">AddStartMaxReason</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, end_min_if_present - 1);</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  }</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  </div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="comment">// Add the reason for t (we only need the end-min).</span></div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">AddEndMinReason</a>(t, end_min_if_present);</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  </div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="comment">// This augment the start-min of t. Note that t is not in task set</span></div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="comment">// yet, so we will use this updated start if we ever add it there.</span></div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36">IncreaseStartMin</a>(t, task_set_end_min)) {</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  }</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  </div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="comment">// This propagators assumes that every push is reflected for its</span></div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="comment">// correctness.</span></div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a697964c4df6330b5d4720be3658ac35a">InPropagationLoop</a>()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  }</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  </div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keywordflow">if</span> (t == blocking_task) {</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="comment">// Insert the blocking_task. Note that because we just pushed it,</span></div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">// it will be last in task_set_ and also the only reason used to push</span></div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="comment">// any of the subsequent tasks. In particular, the reason will be valid</span></div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="comment">// even though task_set might contains tasks with a start_max greater or</span></div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="comment">// equal to the end_min of the task we push.</span></div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  need_update = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  blocking_task = -1;</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a7e3986de45625c55b092944d4cd9e547">AddShiftedStartMinEntry</a>(*helper_, t);</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>  }</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  to_propagate_.clear();</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  }</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span> }</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  </div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#a1868d977c2e9baed0f16c9ec71d6626e"> 862</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#a1868d977c2e9baed0f16c9ec71d6626e">DisjunctiveDetectablePrecedences::RegisterWith</a>(</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(time_direction_);</div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher, <span class="comment">/*watch_start_max=*/</span><span class="keyword">true</span>,</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="comment">/*watch_end_max=*/</span><span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keywordflow">return</span> id;</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"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 872</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e">DisjunctivePrecedences::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(time_direction_);</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  window_.clear();</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  IntegerValue window_end = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a> task_time : helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d">TaskByIncreasingShiftedStartMin</a>()) {</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = task_time.task_index;</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(task)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  </div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> = task_time.time;</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> < window_end) {</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  window_.push_back(task_time);</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  window_end += helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keywordflow">continue</span>;</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>  </div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">if</span> (window_.size() > 1 && !PropagateSubwindow()) {</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  }</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  </div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="comment">// Start of the next window.</span></div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  window_.clear();</div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  window_.push_back(task_time);</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  window_end = <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> + helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</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="keywordflow">if</span> (window_.size() > 1 && !PropagateSubwindow()) {</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">return</span> <span class="keyword">false</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>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span> }</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  </div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span> <span class="keywordtype">bool</span> DisjunctivePrecedences::PropagateSubwindow() {</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="comment">// TODO(user): We shouldn't consider ends for fixed intervals here. But</span></div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="comment">// then we should do a better job of computing the min-end of a subset of</span></div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// intervals from this disjunctive (like using fixed intervals even if there</span></div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// is no "before that variable" relationship). Ex: If a variable is after two</span></div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="comment">// intervals that cannot be both before a fixed one, we could propagate more.</span></div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  index_to_end_vars_.clear();</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> task_time : window_) {</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = task_time.task_index;</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>& end_exp = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">Ends</a>()[task];</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="comment">// TODO(user): Handle generic affine relation?</span></div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (end_exp.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a> || end_exp.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ad7d5fda7881b6c8fdc9d1e7a74ee4a2e">coeff</a> != 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  index_to_end_vars_.push_back(end_exp.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>);</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  precedences_-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a880ad5f7514aee33f81302d8af2a7be2">ComputePrecedences</a>(index_to_end_vars_, &before_);</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  </div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = before_.size();</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size;) {</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = before_[i].var;</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  </div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> initial_i = i;</div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  IntegerValue min_offset = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">for</span> (; i < size && before_[i].var == <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>; ++i) {</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keyword">const</span> TaskTime task_time = window_[before_[i].index];</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  </div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="comment">// We have var >= end_exp.var + offset, so</span></div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="comment">// var >= (end_exp.var + end_exp.constant) + (offset - end_exp.constant)</span></div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="comment">// var >= task end + new_offset.</span></div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="keyword">const</span> AffineExpression& end_exp = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">Ends</a>()[task_time.task_index];</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  min_offset = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_offset, before_[i].offset - end_exp.constant);</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>  <span class="comment">// The task are actually in sorted order, so we do not need to call</span></div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="comment">// task_set_.Sort(). This property is DCHECKed.</span></div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a032dc7e53f9416a067c429709cc83ba6">AddUnsortedEntry</a>({task_time.task_index, task_time.time,</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task_time.task_index)});</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  }</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#ab1073196aabdb8a939860e16e9f8b505">SortedTasks</a>().size(), 2);</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  </div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="comment">// TODO(user): Only use the min_offset of the critical task? Or maybe do a</span></div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="comment">// more general computation to find by how much we can push var?</span></div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keyword">const</span> IntegerValue new_lb = task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a9b7d82da31ff9f63b9c25d7841065d99">ComputeEndMin</a>() + min_offset;</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keywordflow">if</span> (new_lb > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keyword">const</span> std::vector<TaskSet::Entry>& sorted_tasks = task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#ab1073196aabdb8a939860e16e9f8b505">SortedTasks</a>();</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  </div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  <span class="comment">// Fill task_to_arc_index_ since we need it for the reason.</span></div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="comment">// Note that we do not care about the initial content of this vector.</span></div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = initial_i; j < i; ++j) {</div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = window_[before_[j].index].task_index;</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  task_to_arc_index_[task] = before_[j].arc_index;</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  }</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  </div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> critical_index = task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a425191fbad86521fccd89226ed8dfbb0">GetCriticalIndex</a>();</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keyword">const</span> IntegerValue window_start = sorted_tasks[critical_index].start_min;</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = critical_index; i < sorted_tasks.size(); ++i) {</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = sorted_tasks[i].task;</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, sorted_tasks[i].size_min,</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  window_start);</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  </div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keyword">const</span> AffineExpression& end_exp = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">Ends</a>()[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>];</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  precedences_-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a09ebe3a2f1825d6366649cd157e5020f">AddPrecedenceReason</a>(</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  task_to_arc_index_[<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>], min_offset + end_exp.constant,</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1b1aa6fc0495b30c60002421f7640dab">MutableLiteralReason</a>(), helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5610313501004888e9070594ae93729f">MutableIntegerReason</a>());</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="comment">// TODO(user): If var is actually a start-min of an interval, we</span></div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="comment">// could push the end-min and check the interval consistency right away.</span></div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a15a86f414a12bf85e72bc7608bd3b786">PushIntegerLiteral</a>(</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, new_lb))) {</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  }</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  }</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  }</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span> }</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  </div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#a1868d977c2e9baed0f16c9ec71d6626e"> 983</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#a1868d977c2e9baed0f16c9ec71d6626e">DisjunctivePrecedences::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="comment">// This propagator reach the fixed point in one go.</span></div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(time_direction_);</div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher, <span class="comment">/*watch_start_max=*/</span><span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="comment">/*watch_end_max=*/</span><span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="keywordflow">return</span> id;</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span> }</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  </div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 992</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#ac1fe9b1f2b978c4283e42f12e586eb1e">DisjunctiveNotLast::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(time_direction_);</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  </div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& task_by_decreasing_start_max =</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab63994ddbf7097199cebad7f31b4a8ab">TaskByDecreasingStartMax</a>();</div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& task_by_increasing_shifted_start_min =</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d">TaskByIncreasingShiftedStartMin</a>();</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  </div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="comment">// Split problem into independent part.</span></div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="comment">// The situation is trickier here, and we use two windows:</span></div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="comment">// - The classical "start_min_window_" as in the other propagator.</span></div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="comment">// - A second window, that includes all the task with a start_max inside</span></div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <span class="comment">// [window_start, window_end].</span></div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="comment">// Now, a task from the second window can be detected to be "not last" by only</span></div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="comment">// looking at the task in the first window. Tasks to the left do not cause</span></div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="comment">// issue for the task to be last, and tasks to the right will not lower the</span></div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="comment">// end-min of the task under consideration.</span></div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keywordtype">int</span> queue_index = task_by_decreasing_start_max.size() - 1;</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = task_by_increasing_shifted_start_min.size();</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_tasks;) {</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  start_min_window_.clear();</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  IntegerValue window_end = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="keywordflow">for</span> (; i < num_tasks; ++i) {</div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a> task_time = task_by_increasing_shifted_start_min[i];</div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = task_time.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ae2db4f5bc477001abcb8987f30e6b22c">task_index</a>;</div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(task)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  </div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> = task_time.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">time</a>;</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="keywordflow">if</span> (start_min_window_.empty()) {</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  start_min_window_.push_back(task_time);</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  window_end = <a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> + helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a> < window_end) {</div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  start_min_window_.push_back(task_time);</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  window_end += helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  }</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  }</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  </div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="comment">// Add to start_max_window_ all the task whose start_max</span></div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="comment">// fall into [window_start, window_end).</span></div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  start_max_window_.clear();</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keywordflow">for</span> (; queue_index >= 0; queue_index--) {</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  <span class="keyword">const</span> <span class="keyword">auto</span> task_time = task_by_decreasing_start_max[queue_index];</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  </div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="comment">// Note that we add task whose presence is still unknown here.</span></div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordflow">if</span> (task_time.time >= window_end) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(task_time.task_index)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  start_max_window_.push_back(task_time);</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>  <span class="comment">// If this is the case, we cannot propagate more than the detectable</span></div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="comment">// precedence propagator. Note that this continue must happen after we</span></div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="comment">// computed start_max_window_ though.</span></div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="keywordflow">if</span> (start_min_window_.size() <= 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  </div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="comment">// Process current window.</span></div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keywordflow">if</span> (!start_max_window_.empty() && !PropagateSubwindow()) {</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  }</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordflow">return</span> <span class="keyword">true</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>  </div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span> <span class="keywordtype">bool</span> DisjunctiveNotLast::PropagateSubwindow() {</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keyword">auto</span>& task_by_increasing_end_max = start_max_window_;</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>& entry : task_by_increasing_end_max) {</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  entry.time = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(entry.task_index);</div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  }</div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <a class="code" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(task_by_increasing_end_max.begin(),</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  task_by_increasing_end_max.end());</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>  <span class="keyword">const</span> IntegerValue threshold = task_by_increasing_end_max.back().time;</div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keyword">auto</span>& task_by_increasing_start_max = start_min_window_;</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keywordtype">int</span> queue_size = 0;</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> TaskTime entry : task_by_increasing_start_max) {</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = entry.task_index;</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(task);</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(task));</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> < threshold) {</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  task_by_increasing_start_max[queue_size++] = {task, <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>};</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>  }</div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  </div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  <span class="comment">// If the size is one, we cannot propagate more than the detectable precedence</span></div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="comment">// propagator.</span></div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keywordflow">if</span> (queue_size <= 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  </div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  task_by_increasing_start_max.resize(queue_size);</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  std::sort(task_by_increasing_start_max.begin(),</div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  task_by_increasing_start_max.end());</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  </div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>();</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="keywordtype">int</span> queue_index = 0;</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> task_time : task_by_increasing_end_max) {</div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = task_time.task_index;</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> = task_time.time;</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(t));</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="comment">// task_set_ contains all the tasks that must start before the end-max of t.</span></div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="comment">// These are the only candidates that have a chance to decrease the end-max</span></div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="comment">// of t.</span></div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordflow">while</span> (queue_index < queue_size) {</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keyword">const</span> <span class="keyword">auto</span> to_insert = task_by_increasing_start_max[queue_index];</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> = to_insert.time;</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> <= <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  </div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task_index = to_insert.task_index;</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(task_index));</div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a98c223e2c82a01f67cd71dd4eca70b70">AddEntry</a>({task_index, helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">ShiftedStartMin</a>(task_index),</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task_index)});</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  ++queue_index;</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">// In the following case, task t cannot be after all the critical tasks</span></div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="comment">// (i.e. it cannot be last):</span></div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="comment">// [(critical tasks)</span></div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="comment">// | <- t start-max</span></div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="comment">// So we can deduce that the end-max of t is smaller than or equal to the</span></div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="comment">// largest start-max of the critical tasks.</span></div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  <span class="comment">// Note that this works as well when the presence of t is still unknown.</span></div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="keywordtype">int</span> critical_index = 0;</div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="keyword">const</span> IntegerValue end_min_of_critical_tasks =</div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a9b7d82da31ff9f63b9c25d7841065d99">ComputeEndMin</a>(<span class="comment">/*task_to_ignore=*/</span>t, &critical_index);</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">if</span> (end_min_of_critical_tasks <= helper_->StartMax(t)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  </div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="comment">// Find the largest start-max of the critical tasks (excluding t). The</span></div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="comment">// end-max for t need to be smaller than or equal to this.</span></div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  IntegerValue largest_ct_start_max = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="keyword">const</span> std::vector<TaskSet::Entry>& sorted_tasks = task_set_.<a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#ab1073196aabdb8a939860e16e9f8b505">SortedTasks</a>();</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> sorted_tasks_size = sorted_tasks.size();</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = critical_index; i < sorted_tasks_size; ++i) {</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = sorted_tasks[i].task;</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="keywordflow">if</span> (t == <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> > largest_ct_start_max) {</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  largest_ct_start_max = <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>;</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  }</div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  }</div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  </div>
|
|
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="comment">// If we have any critical task, the test will always be true because</span></div>
|
|
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="comment">// of the tasks we put in task_set_.</span></div>
|
|
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(largest_ct_start_max == <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a> ||</div>
|
|
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> > largest_ct_start_max);</div>
|
|
<div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> > largest_ct_start_max) {</div>
|
|
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  </div>
|
|
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keyword">const</span> IntegerValue window_start = sorted_tasks[critical_index].start_min;</div>
|
|
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = critical_index; i < sorted_tasks_size; ++i) {</div>
|
|
<div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = sorted_tasks[i].task;</div>
|
|
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> == t) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>);</div>
|
|
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, sorted_tasks[i].size_min,</div>
|
|
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  window_start);</div>
|
|
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">AddStartMaxReason</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, largest_ct_start_max);</div>
|
|
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  }</div>
|
|
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  </div>
|
|
<div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  <span class="comment">// Add the reason for t, we only need the start-max.</span></div>
|
|
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">AddStartMaxReason</a>(t, end_min_of_critical_tasks - 1);</div>
|
|
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  </div>
|
|
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="comment">// Enqueue the new end-max for t.</span></div>
|
|
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <span class="comment">// Note that changing it will not influence the rest of the loop.</span></div>
|
|
<div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9cff7d47d665651c22433d6c793092a8">DecreaseEndMax</a>(t, largest_ct_start_max)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  }</div>
|
|
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  }</div>
|
|
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <span class="keywordflow">return</span> <span class="keyword">true</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>  </div>
|
|
<div class="line"><a name="l01165"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#a1868d977c2e9baed0f16c9ec71d6626e"> 1165</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#a1868d977c2e9baed0f16c9ec71d6626e">DisjunctiveNotLast::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher);</div>
|
|
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="keywordflow">return</span> id;</div>
|
|
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span> }</div>
|
|
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  </div>
|
|
<div class="line"><a name="l01172"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 1172</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e">DisjunctiveEdgeFinding::Propagate</a>() {</div>
|
|
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>();</div>
|
|
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(time_direction_);</div>
|
|
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  is_gray_.resize(num_tasks, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  non_gray_task_to_event_.resize(num_tasks);</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>  window_.clear();</div>
|
|
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  IntegerValue window_end = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a> task_time : helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d">TaskByIncreasingShiftedStartMin</a>()) {</div>
|
|
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = task_time.task_index;</div>
|
|
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(task)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  </div>
|
|
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  <span class="comment">// Note that we use the real start min here not the shifted one. This is</span></div>
|
|
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  <span class="comment">// because we might be able to push it if it is smaller than window end.</span></div>
|
|
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(task) < window_end) {</div>
|
|
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  window_.push_back(task_time);</div>
|
|
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  window_end += helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</div>
|
|
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  }</div>
|
|
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  </div>
|
|
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="comment">// We need at least 3 tasks for the edge-finding to be different from</span></div>
|
|
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="comment">// detectable precedences.</span></div>
|
|
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keywordflow">if</span> (window_.size() > 2 && !PropagateSubwindow(window_end)) {</div>
|
|
<div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  }</div>
|
|
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  </div>
|
|
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  <span class="comment">// Start of the next window.</span></div>
|
|
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  window_.clear();</div>
|
|
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  window_.push_back(task_time);</div>
|
|
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  window_end = task_time.time + helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</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="keywordflow">if</span> (window_.size() > 2 && !PropagateSubwindow(window_end)) {</div>
|
|
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  }</div>
|
|
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span> }</div>
|
|
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  </div>
|
|
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span> <span class="keywordtype">bool</span> DisjunctiveEdgeFinding::PropagateSubwindow(IntegerValue window_end_min) {</div>
|
|
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  <span class="comment">// Cache the task end-max and abort early if possible.</span></div>
|
|
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  task_by_increasing_end_max_.clear();</div>
|
|
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> task_time : window_) {</div>
|
|
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = task_time.task_index;</div>
|
|
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(task));</div>
|
|
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  </div>
|
|
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="comment">// We already mark all the non-present task as gray.</span></div>
|
|
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="comment">// Same for task with an end-max that is too large: Tasks that are not</span></div>
|
|
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="comment">// present can never trigger propagation or an overload checking failure.</span></div>
|
|
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="comment">// theta_tree_.GetOptionalEnvelope() is always <= window_end, so tasks whose</span></div>
|
|
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="comment">// end_max is >= window_end can never trigger propagation or failure either.</span></div>
|
|
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  <span class="comment">// Thus, those tasks can be marked as gray, which removes their contribution</span></div>
|
|
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="comment">// to theta right away.</span></div>
|
|
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(task);</div>
|
|
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(task) && <a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a> < window_end_min) {</div>
|
|
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  is_gray_[task] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  task_by_increasing_end_max_.push_back({task, <a class="code" href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a>});</div>
|
|
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  is_gray_[task] = <span class="keyword">true</span>;</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>  }</div>
|
|
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  </div>
|
|
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="comment">// If we have just 1 non-gray task, then this propagator does not propagate</span></div>
|
|
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="comment">// more than the detectable precedences, so we abort early.</span></div>
|
|
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="keywordflow">if</span> (task_by_increasing_end_max_.size() < 2) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  std::sort(task_by_increasing_end_max_.begin(),</div>
|
|
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  task_by_increasing_end_max_.end());</div>
|
|
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  </div>
|
|
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <span class="comment">// Set up theta tree.</span></div>
|
|
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  <span class="comment">// Some task in the theta tree will be considered "gray".</span></div>
|
|
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  <span class="comment">// When computing the end-min of the sorted task, we will compute it for:</span></div>
|
|
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="comment">// - All the non-gray task</span></div>
|
|
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  <span class="comment">// - All the non-gray task + at most one gray task.</span></div>
|
|
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="comment">// TODO(user): it should be faster to initialize it all at once rather</span></div>
|
|
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="comment">// than calling AddOrUpdate() n times.</span></div>
|
|
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> window_size = window_.size();</div>
|
|
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  event_size_.clear();</div>
|
|
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">Reset</a>(window_size);</div>
|
|
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = 0; <span class="keyword">event</span> < window_size; ++event) {</div>
|
|
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  <span class="keyword">const</span> TaskTime task_time = window_[event];</div>
|
|
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = task_time.task_index;</div>
|
|
<div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  <span class="keyword">const</span> IntegerValue energy_min = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(task);</div>
|
|
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  event_size_.push_back(energy_min);</div>
|
|
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  <span class="keywordflow">if</span> (is_gray_[task]) {</div>
|
|
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">AddOrUpdateOptionalEvent</a>(event, task_time.time, energy_min);</div>
|
|
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  non_gray_task_to_event_[task] = event;</div>
|
|
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">AddOrUpdateEvent</a>(event, task_time.time, energy_min,</div>
|
|
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  energy_min);</div>
|
|
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  }</div>
|
|
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  }</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>  <span class="comment">// At each iteration we either transform a non-gray task into a gray one or</span></div>
|
|
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="comment">// remove a gray task, so this loop is linear in complexity.</span></div>
|
|
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!is_gray_[task_by_increasing_end_max_.back().task_index]);</div>
|
|
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  <span class="keyword">const</span> IntegerValue non_gray_end_max =</div>
|
|
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  task_by_increasing_end_max_.back().time;</div>
|
|
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  </div>
|
|
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="comment">// Overload checking.</span></div>
|
|
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keyword">const</span> IntegerValue non_gray_end_min = theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">GetEnvelope</a>();</div>
|
|
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keywordflow">if</span> (non_gray_end_min > non_gray_end_max) {</div>
|
|
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</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="comment">// We need the reasons for the critical tasks to fall in:</span></div>
|
|
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> critical_event =</div>
|
|
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a75c0a813b413b5718813636f2120a790">GetMaxEventWithEnvelopeGreaterThan</a>(non_gray_end_max);</div>
|
|
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <span class="keyword">const</span> IntegerValue window_start = window_[critical_event].time;</div>
|
|
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  <span class="keyword">const</span> IntegerValue window_end =</div>
|
|
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0718fcbb3200da053b8df062e6711d48">GetEnvelopeOf</a>(critical_event) - 1;</div>
|
|
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = critical_event; <span class="keyword">event</span> < window_size; <span class="keyword">event</span>++) {</div>
|
|
<div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = window_[event].task_index;</div>
|
|
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">if</span> (is_gray_[task]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(task);</div>
|
|
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(task, event_size_[event], window_start);</div>
|
|
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">AddEndMaxReason</a>(task, window_end);</div>
|
|
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  }</div>
|
|
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordflow">return</span> helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div>
|
|
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  }</div>
|
|
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  </div>
|
|
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  <span class="comment">// Edge-finding.</span></div>
|
|
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="comment">// If we have a situation like:</span></div>
|
|
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  <span class="comment">// [(critical_task_with_gray_task)</span></div>
|
|
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="comment">// ]</span></div>
|
|
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  <span class="comment">// ^ end-max without the gray task.</span></div>
|
|
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  <span class="comment">// Then the gray task must be after all the critical tasks (all the non-gray</span></div>
|
|
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="comment">// tasks in the tree actually), otherwise there will be no way to schedule</span></div>
|
|
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="comment">// the critical_tasks inside their time window.</span></div>
|
|
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keywordflow">while</span> (theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">GetOptionalEnvelope</a>() > non_gray_end_max) {</div>
|
|
<div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordtype">int</span> critical_event_with_gray;</div>
|
|
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  <span class="keywordtype">int</span> gray_event;</div>
|
|
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  IntegerValue available_energy;</div>
|
|
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">GetEventsWithOptionalEnvelopeGreaterThan</a>(</div>
|
|
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  non_gray_end_max, &critical_event_with_gray, &gray_event,</div>
|
|
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  &available_energy);</div>
|
|
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> gray_task = window_[gray_event].task_index;</div>
|
|
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  </div>
|
|
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="comment">// Since the gray task is after all the other, we have a new lower bound.</span></div>
|
|
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(is_gray_[gray_task]);</div>
|
|
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(gray_task) < non_gray_end_min) {</div>
|
|
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="comment">// The API is not ideal here. We just want the start of the critical</span></div>
|
|
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  <span class="comment">// tasks that explain the non_gray_end_min computed above.</span></div>
|
|
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> critical_event =</div>
|
|
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a75c0a813b413b5718813636f2120a790">GetMaxEventWithEnvelopeGreaterThan</a>(non_gray_end_min -</div>
|
|
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  1);</div>
|
|
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> first_event =</div>
|
|
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(critical_event, critical_event_with_gray);</div>
|
|
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> second_event =</div>
|
|
<div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(critical_event, critical_event_with_gray);</div>
|
|
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keyword">const</span> IntegerValue first_start = window_[first_event].time;</div>
|
|
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keyword">const</span> IntegerValue second_start = window_[second_event].time;</div>
|
|
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  </div>
|
|
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  <span class="comment">// window_end is chosen to be has big as possible and still have an</span></div>
|
|
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="comment">// overload if the gray task is not last.</span></div>
|
|
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  <span class="keyword">const</span> IntegerValue window_end =</div>
|
|
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  non_gray_end_max + event_size_[gray_event] - available_energy - 1;</div>
|
|
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(window_end, non_gray_end_max);</div>
|
|
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  </div>
|
|
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="comment">// The non-gray part of the explanation as detailed above.</span></div>
|
|
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div>
|
|
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> event = first_event; <span class="keyword">event</span> < window_size; <span class="keyword">event</span>++) {</div>
|
|
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task = window_[event].task_index;</div>
|
|
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keywordflow">if</span> (is_gray_[task]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(task);</div>
|
|
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(</div>
|
|
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  task, event_size_[event],</div>
|
|
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  event >= second_event ? second_start : first_start);</div>
|
|
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">AddEndMaxReason</a>(task, window_end);</div>
|
|
<div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  }</div>
|
|
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  </div>
|
|
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="comment">// Add the reason for the gray_task (we don't need the end-max or</span></div>
|
|
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  <span class="comment">// presence reason).</span></div>
|
|
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">AddEnergyAfterReason</a>(gray_task, event_size_[gray_event],</div>
|
|
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  window_[critical_event_with_gray].<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>);</div>
|
|
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  </div>
|
|
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="comment">// Enqueue the new start-min for gray_task.</span></div>
|
|
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  <span class="comment">// TODO(user): propagate the precedence Boolean here too? I think it</span></div>
|
|
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="comment">// will be more powerful. Even if eventually all these precedence will</span></div>
|
|
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <span class="comment">// become detectable (see Petr Villim PhD).</span></div>
|
|
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36">IncreaseStartMin</a>(gray_task, non_gray_end_min)) {</div>
|
|
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  <span class="keywordflow">return</span> <span class="keyword">false</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>  }</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">// Remove the gray_task.</span></div>
|
|
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">RemoveEvent</a>(gray_event);</div>
|
|
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  }</div>
|
|
<div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  </div>
|
|
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  <span class="comment">// Stop before we get just one non-gray task.</span></div>
|
|
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  <span class="keywordflow">if</span> (task_by_increasing_end_max_.size() <= 2) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  </div>
|
|
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  <span class="comment">// Stop if the min of end_max is too big.</span></div>
|
|
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  <span class="keywordflow">if</span> (task_by_increasing_end_max_[0].<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a> >=</div>
|
|
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">GetOptionalEnvelope</a>()) {</div>
|
|
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordflow">break</span>;</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>  </div>
|
|
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="comment">// Make the non-gray task with larger end-max gray.</span></div>
|
|
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_gray_task = task_by_increasing_end_max_.back().task_index;</div>
|
|
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  task_by_increasing_end_max_.pop_back();</div>
|
|
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_gray_event = non_gray_task_to_event_[new_gray_task];</div>
|
|
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!is_gray_[new_gray_task]);</div>
|
|
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  is_gray_[new_gray_task] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  theta_tree_.<a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">AddOrUpdateOptionalEvent</a>(new_gray_event,</div>
|
|
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  window_[new_gray_event].<a class="code" href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a>,</div>
|
|
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  event_size_[new_gray_event]);</div>
|
|
<div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  }</div>
|
|
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  </div>
|
|
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span> }</div>
|
|
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  </div>
|
|
<div class="line"><a name="l01386"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#a1868d977c2e9baed0f16c9ec71d6626e"> 1386</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#a1868d977c2e9baed0f16c9ec71d6626e">DisjunctiveEdgeFinding::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(time_direction_);</div>
|
|
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher, <span class="comment">/*watch_start_max=*/</span><span class="keyword">false</span>,</div>
|
|
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="comment">/*watch_end_max=*/</span><span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="keywordflow">return</span> id;</div>
|
|
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span> }</div>
|
|
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  </div>
|
|
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aall__different_8h_html"><div class="ttname"><a href="all__different_8h.html">all_different.h</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="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#l00895">base/logging.h:895</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#l00894">base/logging.h:894</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#l00705">base/logging.h:705</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#l00709">base/logging.h:709</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#l00897">base/logging.h:897</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#l00896">base/logging.h:896</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#l00892">base/logging.h:892</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#l00893">base/logging.h:893</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_intervals_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_intervals_helper.html">operations_research::sat::AllIntervalsHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00184">disjunctive.h:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_combined_disjunctive_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_combined_disjunctive.html">operations_research::sat::CombinedDisjunctive</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00195">disjunctive.h:195</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_combined_disjunctive_html_a55a91d657715ec9c9d5a0d2a54239957"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#a55a91d657715ec9c9d5a0d2a54239957">operations_research::sat::CombinedDisjunctive::AddNoOverlap</a></div><div class="ttdeci">void AddNoOverlap(const std::vector< IntervalVariable > &var)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00333">disjunctive.cc:333</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_combined_disjunctive_html_a72c8b5cc99139caeaa87018bcf71732c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#a72c8b5cc99139caeaa87018bcf71732c">operations_research::sat::CombinedDisjunctive::CombinedDisjunctive</a></div><div class="ttdeci">CombinedDisjunctive(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00321">disjunctive.cc:321</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_combined_disjunctive_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_combined_disjunctive.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::CombinedDisjunctive::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00344">disjunctive.cc:344</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_detectable_precedences_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html">operations_research::sat::DisjunctiveDetectablePrecedences</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00158">disjunctive.h:158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_detectable_precedences_html_a1868d977c2e9baed0f16c9ec71d6626e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#a1868d977c2e9baed0f16c9ec71d6626e">operations_research::sat::DisjunctiveDetectablePrecedences::RegisterWith</a></div><div class="ttdeci">int RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00862">disjunctive.cc:862</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_detectable_precedences_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveDetectablePrecedences::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00640">disjunctive.cc:640</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_edge_finding_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html">operations_research::sat::DisjunctiveEdgeFinding</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00233">disjunctive.h:233</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_edge_finding_html_a1868d977c2e9baed0f16c9ec71d6626e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#a1868d977c2e9baed0f16c9ec71d6626e">operations_research::sat::DisjunctiveEdgeFinding::RegisterWith</a></div><div class="ttdeci">int RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l01386">disjunctive.cc:1386</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_edge_finding_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveEdgeFinding::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l01172">disjunctive.cc:1172</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_not_last_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html">operations_research::sat::DisjunctiveNotLast</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00213">disjunctive.h:213</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_not_last_html_a1868d977c2e9baed0f16c9ec71d6626e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#a1868d977c2e9baed0f16c9ec71d6626e">operations_research::sat::DisjunctiveNotLast::RegisterWith</a></div><div class="ttdeci">int RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l01165">disjunctive.cc:1165</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_not_last_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveNotLast::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00992">disjunctive.cc:992</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_overload_checker_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html">operations_research::sat::DisjunctiveOverloadChecker</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00136">disjunctive.h:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_overload_checker_html_a1868d977c2e9baed0f16c9ec71d6626e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">operations_research::sat::DisjunctiveOverloadChecker::RegisterWith</a></div><div class="ttdeci">int RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00631">disjunctive.cc:631</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_overload_checker_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveOverloadChecker::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00460">disjunctive.cc:460</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_precedences_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html">operations_research::sat::DisjunctivePrecedences</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00263">disjunctive.h:263</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_precedences_html_a1868d977c2e9baed0f16c9ec71d6626e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#a1868d977c2e9baed0f16c9ec71d6626e">operations_research::sat::DisjunctivePrecedences::RegisterWith</a></div><div class="ttdeci">int RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00983">disjunctive.cc:983</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_precedences_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctivePrecedences::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00872">disjunctive.cc:872</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_with_two_items_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html">operations_research::sat::DisjunctiveWithTwoItems</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00298">disjunctive.h:298</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_with_two_items_html_a1868d977c2e9baed0f16c9ec71d6626e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#a1868d977c2e9baed0f16c9ec71d6626e">operations_research::sat::DisjunctiveWithTwoItems::RegisterWith</a></div><div class="ttdeci">int RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00313">disjunctive.cc:313</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_with_two_items_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveWithTwoItems::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00252">disjunctive.cc:252</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">operations_research::sat::GenericLiteralWatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01113">integer.h:1113</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_adeee4ac52bfe0f1b48ee8958bb88b4e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">operations_research::sat::GenericLiteralWatcher::Register</a></div><div class="ttdeci">int Register(PropagatorInterface *propagator)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01945">integer.cc:1945</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_aef66ce77e5b87afecf1c5696f44d4d1c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">operations_research::sat::GenericLiteralWatcher::NotifyThatPropagatorMayNotReachFixedPointInOnePass</a></div><div class="ttdeci">void NotifyThatPropagatorMayNotReachFixedPointInOnePass(int id)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01975">integer.cc:1975</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00545">integer.h:545</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a309d057e12c8d4d393f13975eea2e2a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a309d057e12c8d4d393f13975eea2e2a9">operations_research::sat::IntegerTrail::IsCurrentlyIgnored</a></div><div class="ttdeci">bool IsCurrentlyIgnored(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00630">integer.h:630</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01305">integer.h:1305</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_intervals_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html">operations_research::sat::IntervalsRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00046">intervals.h:46</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_intervals_repository_html_a47498392329550af590cc3f6d9dedbf5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#a47498392329550af590cc3f6d9dedbf5">operations_research::sat::IntervalsRepository::MaxSize</a></div><div class="ttdeci">IntegerValue MaxSize(IntervalVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00126">intervals.h:126</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_intervals_repository_html_a558d12a34c3e461abaa1995ad5b193e6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#a558d12a34c3e461abaa1995ad5b193e6">operations_research::sat::IntervalsRepository::Start</a></div><div class="ttdeci">AffineExpression Start(IntervalVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00094">intervals.h:94</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_intervals_repository_html_a7a7a69d2e822ff3cb2e87d63811259c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#a7a7a69d2e822ff3cb2e87d63811259c5">operations_research::sat::IntervalsRepository::MinSize</a></div><div class="ttdeci">IntegerValue MinSize(IntervalVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00121">intervals.h:121</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_intervals_repository_html_ad60fd00d952a6e8a23e11986bfff121a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#ad60fd00d952a6e8a23e11986bfff121a">operations_research::sat::IntervalsRepository::IsOptional</a></div><div class="ttdeci">bool IsOptional(IntervalVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00071">intervals.h:71</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00092">sat_base.h:92</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html">operations_research::sat::PrecedencesPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00052">precedences.h:52</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_a09ebe3a2f1825d6366649cd157e5020f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a09ebe3a2f1825d6366649cd157e5020f">operations_research::sat::PrecedencesPropagator::AddPrecedenceReason</a></div><div class="ttdeci">void AddPrecedenceReason(int arc_index, IntegerValue min_offset, std::vector< Literal > *literal_reason, std::vector< IntegerLiteral > *integer_reason) const</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00212">precedences.cc:212</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html_a880ad5f7514aee33f81302d8af2a7be2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#a880ad5f7514aee33f81302d8af2a7be2">operations_research::sat::PrecedencesPropagator::ComputePrecedences</a></div><div class="ttdeci">void ComputePrecedences(const std::vector< IntegerVariable > &vars, std::vector< IntegerPrecedences > *output)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00135">precedences.cc:135</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a43684a0a8ef85b1cea0076dba3fb271d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a43684a0a8ef85b1cea0076dba3fb271d">operations_research::sat::SatSolver::NewBooleanVariable</a></div><div class="ttdeci">BooleanVariable NewBooleanVariable()</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00084">sat_solver.h:84</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">operations_research::sat::SchedulingConstraintHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00172">intervals.h:173</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a0d7780af676ab4fd1c57e62da9e03686"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">operations_research::sat::SchedulingConstraintHelper::ShiftedStartMin</a></div><div class="ttdeci">IntegerValue ShiftedStartMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00248">intervals.h:248</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a11b6d6eef1159c1801cfa033778f09db"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">operations_research::sat::SchedulingConstraintHelper::EndMin</a></div><div class="ttdeci">IntegerValue EndMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00230">intervals.h:230</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a15a86f414a12bf85e72bc7608bd3b786"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a15a86f414a12bf85e72bc7608bd3b786">operations_research::sat::SchedulingConstraintHelper::PushIntegerLiteral</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool PushIntegerLiteral(IntegerLiteral lit)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00378">intervals.cc:378</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a1b1aa6fc0495b30c60002421f7640dab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1b1aa6fc0495b30c60002421f7640dab">operations_research::sat::SchedulingConstraintHelper::MutableLiteralReason</a></div><div class="ttdeci">std::vector< Literal > * MutableLiteralReason()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00296">intervals.h:296</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a1ce92d1c5015cd62d1c4b64ee117d8aa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">operations_research::sat::SchedulingConstraintHelper::PushTaskAbsence</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool PushTaskAbsence(int t)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00423">intervals.cc:423</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a3f981878c21fbe2f41a2daf010c93804"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">operations_research::sat::SchedulingConstraintHelper::WatchAllTasks</a></div><div class="ttdeci">void WatchAllTasks(int id, GenericLiteralWatcher *watcher, bool watch_start_max=true, bool watch_end_max=true) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00460">intervals.cc:460</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a4ac5e628ca1613b614ccd82bfa785631"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">operations_research::sat::SchedulingConstraintHelper::AddPresenceReason</a></div><div class="ttdeci">void AddPresenceReason(int t)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00473">intervals.h:473</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a5610313501004888e9070594ae93729f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5610313501004888e9070594ae93729f">operations_research::sat::SchedulingConstraintHelper::MutableIntegerReason</a></div><div class="ttdeci">std::vector< IntegerLiteral > * MutableIntegerReason()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00297">intervals.h:297</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a58ca51a90e49e887146f760ba5eb6520"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">operations_research::sat::SchedulingConstraintHelper::IsPresent</a></div><div class="ttdeci">bool IsPresent(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00454">intervals.h:454</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a6793c2382552f34cecb4fcf8951f13d4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6793c2382552f34cecb4fcf8951f13d4">operations_research::sat::SchedulingConstraintHelper::AddEnergyAfterReason</a></div><div class="ttdeci">void AddEnergyAfterReason(int t, IntegerValue energy_min, IntegerValue time)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00567">intervals.h:567</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a697964c4df6330b5d4720be3658ac35a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a697964c4df6330b5d4720be3658ac35a">operations_research::sat::SchedulingConstraintHelper::InPropagationLoop</a></div><div class="ttdeci">bool InPropagationLoop() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00357">intervals.h:357</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a747c0efc6328c426805df876287111ef"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a747c0efc6328c426805df876287111ef">operations_research::sat::SchedulingConstraintHelper::TaskDebugString</a></div><div class="ttdeci">std::string TaskDebugString(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00502">intervals.cc:502</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a78d1b48df2c7530fc020d37902ca59d2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">operations_research::sat::SchedulingConstraintHelper::AddEndMinReason</a></div><div class="ttdeci">void AddEndMinReason(int t, IntegerValue lower_bound)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00536">intervals.h:536</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a7cf01605afaa07af160e933df8433e36"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36">operations_research::sat::SchedulingConstraintHelper::IncreaseStartMin</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool IncreaseStartMin(int t, IntegerValue new_start_min)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00405">intervals.cc:405</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a84d83df1877d50258c1a63b83a5315b3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">operations_research::sat::SchedulingConstraintHelper::SynchronizeAndSetTimeDirection</a></div><div class="ttdeci">void SynchronizeAndSetTimeDirection(bool is_forward)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00234">intervals.cc:234</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a8e6fcd6ce93a128626dede9f9cc89348"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">operations_research::sat::SchedulingConstraintHelper::IsAbsent</a></div><div class="ttdeci">bool IsAbsent(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00459">intervals.h:459</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9125ec8126e6035eacce8a5eb52b45c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">operations_research::sat::SchedulingConstraintHelper::EndMax</a></div><div class="ttdeci">IntegerValue EndMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00232">intervals.h:232</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9583bbea958febd24d92742c2f137d22"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">operations_research::sat::SchedulingConstraintHelper::ReportConflict</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool ReportConflict()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00455">intervals.cc:455</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9cff7d47d665651c22433d6c793092a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9cff7d47d665651c22433d6c793092a8">operations_research::sat::SchedulingConstraintHelper::DecreaseEndMax</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool DecreaseEndMax(int t, IntegerValue new_start_max)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00414">intervals.cc:414</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ab3a2a28d08246d8f3432caa1a27811b8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">operations_research::sat::SchedulingConstraintHelper::StartMin</a></div><div class="ttdeci">IntegerValue StartMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00229">intervals.h:229</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ab63994ddbf7097199cebad7f31b4a8ab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab63994ddbf7097199cebad7f31b4a8ab">operations_research::sat::SchedulingConstraintHelper::TaskByDecreasingStartMax</a></div><div class="ttdeci">const std::vector< TaskTime > & TaskByDecreasingStartMax()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00289">intervals.cc:289</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_aca49afb19cf18dfc1ea50a7d0a36d961"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">operations_research::sat::SchedulingConstraintHelper::AddEndMaxReason</a></div><div class="ttdeci">void AddEndMaxReason(int t, IntegerValue upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00558">intervals.h:558</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ad8f69698386f241297b78589c1f57c3e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">operations_research::sat::SchedulingConstraintHelper::StartMax</a></div><div class="ttdeci">IntegerValue StartMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00231">intervals.h:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ad9b4a962b743e358f3a7c4b2279f99c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">operations_research::sat::SchedulingConstraintHelper::NumTasks</a></div><div class="ttdeci">int NumTasks() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00203">intervals.h:203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_adb72b59458c581ae6e85295da4e1917d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d">operations_research::sat::SchedulingConstraintHelper::TaskByIncreasingShiftedStartMin</a></div><div class="ttdeci">const std::vector< TaskTime > & TaskByIncreasingShiftedStartMin()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00314">intervals.cc:314</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_adbfab9aa6e8f73dcff6e5f1d7d7debfa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">operations_research::sat::SchedulingConstraintHelper::AddReasonForBeingBefore</a></div><div class="ttdeci">void AddReasonForBeingBefore(int before, int after)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00334">intervals.cc:334</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ae6aff7693fe8d422dedbc67f30621d4d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">operations_research::sat::SchedulingConstraintHelper::AddStartMaxReason</a></div><div class="ttdeci">void AddStartMaxReason(int t, IntegerValue upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00514">intervals.h:514</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_af9c040735b02626e2c373e820d4b6416"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">operations_research::sat::SchedulingConstraintHelper::ClearReason</a></div><div class="ttdeci">void ClearReason()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00464">intervals.h:464</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_afdbd968230d01fa0e91bc15b6f5994e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">operations_research::sat::SchedulingConstraintHelper::SizeMin</a></div><div class="ttdeci">IntegerValue SizeMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00224">intervals.h:224</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_affb6ad259bc1c6bd004308fb3b8a6b05"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">operations_research::sat::SchedulingConstraintHelper::Ends</a></div><div class="ttdeci">const std::vector< AffineExpression > & Ends() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00321">intervals.h:321</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a032dc7e53f9416a067c429709cc83ba6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a032dc7e53f9416a067c429709cc83ba6">operations_research::sat::TaskSet::AddUnsortedEntry</a></div><div class="ttdeci">void AddUnsortedEntry(const Entry &e)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00089">disjunctive.h:89</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a122123bd7c7d530bbd686617ffb4c798"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a122123bd7c7d530bbd686617ffb4c798">operations_research::sat::TaskSet::NotifyEntryIsNowLastIfPresent</a></div><div class="ttdeci">void NotifyEntryIsNowLastIfPresent(const Entry &e)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00184">disjunctive.cc:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a34dd782f4175fa103604d994fba1d6de"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a34dd782f4175fa103604d994fba1d6de">operations_research::sat::TaskSet::RemoveEntryWithIndex</a></div><div class="ttdeci">void RemoveEntryWithIndex(int index)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00199">disjunctive.cc:199</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a425191fbad86521fccd89226ed8dfbb0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a425191fbad86521fccd89226ed8dfbb0">operations_research::sat::TaskSet::GetCriticalIndex</a></div><div class="ttdeci">int GetCriticalIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00117">disjunctive.h:117</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a7e3986de45625c55b092944d4cd9e547"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a7e3986de45625c55b092944d4cd9e547">operations_research::sat::TaskSet::AddShiftedStartMinEntry</a></div><div class="ttdeci">void AddShiftedStartMinEntry(const SchedulingConstraintHelper &helper, int t)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00178">disjunctive.cc:178</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a95dc40a61faa48e7996a4c139a9d119d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a95dc40a61faa48e7996a4c139a9d119d">operations_research::sat::TaskSet::ComputeEndMin</a></div><div class="ttdeci">IntegerValue ComputeEndMin() const</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00204">disjunctive.cc:204</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a98c223e2c82a01f67cd71dd4eca70b70"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a98c223e2c82a01f67cd71dd4eca70b70">operations_research::sat::TaskSet::AddEntry</a></div><div class="ttdeci">void AddEntry(const Entry &e)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00163">disjunctive.cc:163</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a9b7d82da31ff9f63b9c25d7841065d99"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a9b7d82da31ff9f63b9c25d7841065d99">operations_research::sat::TaskSet::ComputeEndMin</a></div><div class="ttdeci">IntegerValue ComputeEndMin(int task_to_ignore, int *critical_index) const</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00220">disjunctive.cc:220</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::sat::TaskSet::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00070">disjunctive.h:70</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_ab1073196aabdb8a939860e16e9f8b505"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#ab1073196aabdb8a939860e16e9f8b505">operations_research::sat::TaskSet::SortedTasks</a></div><div class="ttdeci">const std::vector< Entry > & SortedTasks() const</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00119">disjunctive.h:119</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a0718fcbb3200da053b8df062e6711d48"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0718fcbb3200da053b8df062e6711d48">operations_research::sat::ThetaLambdaTree::GetEnvelopeOf</a></div><div class="ttdeci">IntegerType GetEnvelopeOf(int event) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00203">theta_tree.cc:203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a0cd86cea355b2b1f70e5494fdce82979"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a0cd86cea355b2b1f70e5494fdce82979">operations_research::sat::ThetaLambdaTree::GetEventsWithOptionalEnvelopeGreaterThan</a></div><div class="ttdeci">void GetEventsWithOptionalEnvelopeGreaterThan(IntegerType target_envelope, int *critical_event, int *optional_event, IntegerType *available_energy) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00190">theta_tree.cc:190</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a1c2fe501274ef60430486bba0842cd35"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1c2fe501274ef60430486bba0842cd35">operations_research::sat::ThetaLambdaTree::GetOptionalEnvelope</a></div><div class="ttdeci">IntegerType GetOptionalEnvelope() const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00174">theta_tree.cc:174</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a1d04b14711a8d3bba829f1b0eb4dd4a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a1d04b14711a8d3bba829f1b0eb4dd4a8">operations_research::sat::ThetaLambdaTree::RemoveEvent</a></div><div class="ttdeci">void RemoveEvent(int event)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00148">theta_tree.cc:148</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a75c0a813b413b5718813636f2120a790"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a75c0a813b413b5718813636f2120a790">operations_research::sat::ThetaLambdaTree::GetMaxEventWithEnvelopeGreaterThan</a></div><div class="ttdeci">int GetMaxEventWithEnvelopeGreaterThan(IntegerType target_envelope) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00180">theta_tree.cc:180</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a7b4553842be2a65d82b3f40eed71744d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a7b4553842be2a65d82b3f40eed71744d">operations_research::sat::ThetaLambdaTree::Reset</a></div><div class="ttdeci">void Reset(int num_events)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00041">theta_tree.cc:41</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_a9045183839ce6286d80eb699209c1557"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#a9045183839ce6286d80eb699209c1557">operations_research::sat::ThetaLambdaTree::AddOrUpdateOptionalEvent</a></div><div class="ttdeci">void AddOrUpdateOptionalEvent(int event, IntegerType initial_envelope_opt, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00125">theta_tree.cc:125</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_ac6641ed613360a1063cc5901ef8b564c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ac6641ed613360a1063cc5901ef8b564c">operations_research::sat::ThetaLambdaTree::EnergyMin</a></div><div class="ttdeci">IntegerType EnergyMin(int event) const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8h_source.html#l00198">theta_tree.h:198</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_ad812cddd43d03a817341c9875f4f6f4f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#ad812cddd43d03a817341c9875f4f6f4f">operations_research::sat::ThetaLambdaTree::AddOrUpdateEvent</a></div><div class="ttdeci">void AddOrUpdateEvent(int event, IntegerType initial_envelope, IntegerType energy_min, IntegerType energy_max)</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00112">theta_tree.cc:112</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html_add1a42315d03f68191df32a019d82093"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html#add1a42315d03f68191df32a019d82093">operations_research::sat::ThetaLambdaTree::GetEnvelope</a></div><div class="ttdeci">IntegerType GetEnvelope() const</div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8cc_source.html#l00169">theta_tree.cc:169</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_time_tabling_per_task_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html">operations_research::sat::TimeTablingPerTask</a></div><div class="ttdef"><b>Definition:</b> <a href="timetable_8h_source.html#l00104">timetable.h:104</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_time_tabling_per_task_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::TimeTablingPerTask::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="timetable_8cc_source.html#l00314">timetable.cc:314</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="adisjunctive_8h_html"><div class="ttname"><a href="disjunctive_8h.html">disjunctive.h</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#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="aiterator__adaptors_8h_html"><div class="ttname"><a href="iterator__adaptors_8h.html">iterator_adaptors.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">operations_research::sat::kMaxIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a467d0c8bf263413aae5e5e530d4c5259"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a467d0c8bf263413aae5e5e530d4c5259">operations_research::sat::AllDifferentOnBounds</a></div><div class="ttdeci">std::function< void(Model *)> AllDifferentOnBounds(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00067">all_different.cc:67</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a73098886bd45684da9f3b3019c25ab93"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a73098886bd45684da9f3b3019c25ab93">operations_research::sat::DisjunctiveWithBooleanPrecedencesOnly</a></div><div class="ttdeci">std::function< void(Model *)> DisjunctiveWithBooleanPrecedencesOnly(const std::vector< IntervalVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00132">disjunctive.cc:132</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a89be28cfe3c4682b26fd153f9f133705"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a89be28cfe3c4682b26fd153f9f133705">operations_research::sat::DisjunctiveWithBooleanPrecedences</a></div><div class="ttdeci">std::function< void(Model *)> DisjunctiveWithBooleanPrecedences(const std::vector< IntervalVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00155">disjunctive.cc:155</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a93f88f728c3591678a7052bb92ee53d0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0">operations_research::sat::Disjunctive</a></div><div class="ttdeci">std::function< void(Model *)> Disjunctive(const std::vector< IntervalVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00030">disjunctive.cc:30</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aa9db4da9c740b17ac7e7e3b7915328a7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa9db4da9c740b17ac7e7e3b7915328a7">operations_research::sat::StartVar</a></div><div class="ttdeci">std::function< IntegerVariable(const Model &)> StartVar(IntervalVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00588">intervals.h:588</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a793092fb9f25552acabb89ee399bbd81"><div class="ttname"><a href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">operations_research::IncrementalSort</a></div><div class="ttdeci">void IncrementalSort(int max_comparisons, Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false)</div><div class="ttdef"><b>Definition:</b> <a href="sort_8h_source.html#l00046">sort.h:46</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_aee52de7b225665566aa47246b9d6b8fa"><div class="ttname"><a href="resource_8cc.html#aee52de7b225665566aa47246b9d6b8fa">time</a></div><div class="ttdeci">int64_t time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01691">resource.cc:1691</a></div></div>
|
|
<div class="ttc" id="asat__parameters_8pb_8h_html"><div class="ttname"><a href="sat__parameters_8pb_8h.html">sat_parameters.pb.h</a></div></div>
|
|
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a0d94a083ebe1975ac196611f87a4e0a2"><div class="ttname"><a href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a></div><div class="ttdeci">Rev< int64_t > start_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00244">sched_constraints.cc:244</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a368fa95d42fa4962a75cedd9df656694"><div class="ttname"><a href="sched__constraints_8cc.html#a368fa95d42fa4962a75cedd9df656694">end_max</a></div><div class="ttdeci">Rev< int64_t > end_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00246">sched_constraints.cc:246</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a826c744af066625acb241b17ae3e2be9"><div class="ttname"><a href="sched__constraints_8cc.html#a826c744af066625acb241b17ae3e2be9">start_min</a></div><div class="ttdeci">Rev< int64_t > start_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="asched__constraints_8cc_html_ad3f96403731a9e915dad229813609e74"><div class="ttname"><a href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a></div><div class="ttdeci">Rev< int64_t > end_min</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="asort_8h_html"><div class="ttname"><a href="sort_8h.html">sort.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html">operations_research::sat::AffineExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00210">integer.h:210</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_a06a78ca452e0ab05313a836b024352f2"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a06a78ca452e0ab05313a836b024352f2">operations_research::sat::AffineExpression::constant</a></div><div class="ttdeci">IntegerValue constant</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00247">integer.h:247</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">operations_research::sat::AffineExpression::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00245">integer.h:245</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_ad7d5fda7881b6c8fdc9d1e7a74ee4a2e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#ad7d5fda7881b6c8fdc9d1e7a74ee4a2e">operations_research::sat::AffineExpression::coeff</a></div><div class="ttdeci">IntegerValue coeff</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00246">integer.h:246</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01269">integer.h:1269</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">operations_research::sat::TaskSet::Entry</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00060">disjunctive.h:60</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html_a427ef99d8b77e4cac03718a0a769f806"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a427ef99d8b77e4cac03718a0a769f806">operations_research::sat::TaskSet::Entry::task</a></div><div class="ttdeci">int task</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00061">disjunctive.h:61</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html_a65aeef300c5d89103a5b85a3191a9a20"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a65aeef300c5d89103a5b85a3191a9a20">operations_research::sat::TaskSet::Entry::size_min</a></div><div class="ttdeci">IntegerValue size_min</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00063">disjunctive.h:63</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html_a79a74bd07a8525e729a55c74f7edf5a8"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">operations_research::sat::TaskSet::Entry::start_min</a></div><div class="ttdeci">IntegerValue start_min</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00062">disjunctive.h:62</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_time_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_time.html">operations_research::sat::TaskTime</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00160">intervals.h:160</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_time_html_ab0a87862f63b7d6715386f80338ff3cb"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">operations_research::sat::TaskTime::time</a></div><div class="ttdeci">IntegerValue time</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00162">intervals.h:162</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_time_html_ae2db4f5bc477001abcb8987f30e6b22c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_time.html#ae2db4f5bc477001abcb8987f30e6b22c">operations_research::sat::TaskTime::task_index</a></div><div class="ttdeci">int task_index</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00161">intervals.h:161</a></div></div>
|
|
<div class="ttc" id="atimetable_8h_html"><div class="ttname"><a href="timetable_8h.html">timetable.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="disjunctive_8cc.html">disjunctive.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|