546 lines
92 KiB
HTML
546 lines
92 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.8.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: timetable.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('timetable_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">timetable.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="timetable_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2018 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="timetable_8h.html">ortools/sat/timetable.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 <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <functional></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</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="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="sort_8h.html">ortools/util/sort.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span>  </div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#aaa4ecf5818fadc0edcf62443f5d7664f"> 27</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#aaa4ecf5818fadc0edcf62443f5d7664f">TimeTablingPerTask::TimeTablingPerTask</a>(</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  <span class="keyword">const</span> std::vector<AffineExpression>& demands, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>,</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper)</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  : num_tasks_(helper->NumTasks()),</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  demands_(demands),</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  capacity_(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>),</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  integer_trail_(integer_trail),</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  helper_(helper) {</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// Each task may create at most two profile rectangles. Such pattern appear if</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">// the profile is shaped like the Hanoi tower. The additional space is for</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// both extremities and the sentinels.</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  profile_.reserve(2 * num_tasks_ + 4);</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  </div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="comment">// Reversible set of tasks to consider for propagation.</span></div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  forward_num_tasks_to_sweep_ = num_tasks_;</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  forward_tasks_to_sweep_.resize(num_tasks_);</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  backward_num_tasks_to_sweep_ = num_tasks_;</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  backward_tasks_to_sweep_.resize(num_tasks_);</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  num_profile_tasks_ = 0;</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  profile_tasks_.resize(num_tasks_);</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  positions_in_profile_tasks_.resize(num_tasks_);</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  </div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// Reversible bounds and starting height of the profile.</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  starting_profile_height_ = IntegerValue(0);</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>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks_; ++t) {</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  forward_tasks_to_sweep_[t] = t;</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  backward_tasks_to_sweep_[t] = t;</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  profile_tasks_[t] = t;</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  positions_in_profile_tasks_[t] = t;</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</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"><a class="line" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#a6ee8ed57254aec3ae99d399bae5b3736"> 61</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#a6ee8ed57254aec3ae99d399bae5b3736">TimeTablingPerTask::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="l00062"></a><span class="lineno"> 62</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="l00063"></a><span class="lineno"> 63</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="l00064"></a><span class="lineno"> 64</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">WatchUpperBound</a>(capacity_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>, <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks_; t++) {</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">WatchLowerBound</a>(demands_[t].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  }</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">RegisterReversibleInt</a>(<span class="keywordtype">id</span>, &forward_num_tasks_to_sweep_);</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">RegisterReversibleInt</a>(<span class="keywordtype">id</span>, &backward_num_tasks_to_sweep_);</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">RegisterReversibleInt</a>(<span class="keywordtype">id</span>, &num_profile_tasks_);</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span> }</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  </div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 73</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#ac1fe9b1f2b978c4283e42f12e586eb1e">TimeTablingPerTask::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="comment">// Repeat until the propagator does not filter anymore.</span></div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  profile_changed_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordflow">while</span> (profile_changed_) {</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  profile_changed_ = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// This can fail if the profile exceeds the resource capacity.</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">if</span> (!BuildProfile()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="comment">// Update the minimum start times.</span></div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (!SweepAllTasks(<span class="comment">/*is_forward=*/</span><span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// We reuse the same profile, but reversed, to update the maximum end times.</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  ReverseProfile();</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="comment">// Update the maximum end times (reversed problem).</span></div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keywordflow">if</span> (!SweepAllTasks(<span class="comment">/*is_forward=*/</span><span class="keyword">false</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  }</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  </div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span> }</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  </div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span> <span class="keywordtype">bool</span> TimeTablingPerTask::BuildProfile() {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c">SetTimeDirection</a>(<span class="keyword">true</span>); <span class="comment">// forward</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  </div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// Update the set of tasks that contribute to the profile. Tasks that were</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">// contributing are still part of the profile so we only need to check the</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// other tasks.</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_profile_tasks_; i < num_tasks_; ++i) {</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t1 = profile_tasks_[i];</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t1) && helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(t1) < helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(t1)) {</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// Swap values and positions.</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t2 = profile_tasks_[num_profile_tasks_];</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  profile_tasks_[i] = t2;</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  profile_tasks_[num_profile_tasks_] = t1;</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  positions_in_profile_tasks_[t1] = num_profile_tasks_;</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  positions_in_profile_tasks_[t2] = i;</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  num_profile_tasks_++;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  </div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& by_decreasing_start_max = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab63994ddbf7097199cebad7f31b4a8ab">TaskByDecreasingStartMax</a>();</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& by_end_min = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4d62ab6133b482aa6d670f4a8534681a">TaskByIncreasingEndMin</a>();</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  </div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// Build the profile.</span></div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// ------------------</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  profile_.clear();</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  </div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// Start and height of the highest profile rectangle.</span></div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  profile_max_height_ = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  IntegerValue max_height_start = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  </div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// Add a sentinel to simplify the algorithm.</span></div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  profile_.emplace_back(<a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>, IntegerValue(0));</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// Start and height of the currently built profile rectange.</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  IntegerValue current_start = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  IntegerValue current_height = starting_profile_height_;</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>  <span class="comment">// Next start/end of the compulsory parts to be processed. Note that only the</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// task for which IsInProfile() is true must be considered.</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordtype">int</span> next_start = num_tasks_ - 1;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordtype">int</span> next_end = 0;</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">while</span> (next_end < num_tasks_) {</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> IntegerValue old_height = current_height;</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  </div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  IntegerValue t = by_end_min[next_end].time;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">if</span> (next_start >= 0) {</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  t = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(t, by_decreasing_start_max[next_start].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>);</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  }</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// Process the starting compulsory parts.</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">while</span> (next_start >= 0 && by_decreasing_start_max[next_start].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> == t) {</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task_index = by_decreasing_start_max[next_start].task_index;</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">if</span> (IsInProfile(task_index)) current_height += DemandMin(task_index);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  --next_start;</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  </div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// Process the ending compulsory parts.</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">while</span> (next_end < num_tasks_ && by_end_min[next_end].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> == t) {</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> task_index = by_end_min[next_end].task_index;</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">if</span> (IsInProfile(task_index)) current_height -= DemandMin(task_index);</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  ++next_end;</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>  <span class="comment">// Insert a new profile rectangle if any.</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">if</span> (current_height != old_height) {</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  profile_.emplace_back(current_start, old_height);</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">if</span> (current_height > profile_max_height_) {</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  profile_max_height_ = current_height;</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  max_height_start = t;</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>  current_start = t;</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  </div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="comment">// Build the last profile rectangle.</span></div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  DCHECK_GE(current_height, 0);</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  profile_.emplace_back(current_start, IntegerValue(0));</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  </div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// Add a sentinel to simplify the algorithm.</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  profile_.emplace_back(<a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>, IntegerValue(0));</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  </div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// Increase the capacity variable if required.</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">return</span> IncreaseCapacity(max_height_start, profile_max_height_);</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span> }</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  </div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="keywordtype">void</span> TimeTablingPerTask::ReverseProfile() {</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c">SetTimeDirection</a>(<span class="keyword">false</span>); <span class="comment">// backward</span></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// We keep the sentinels inchanged.</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i + 1 < profile_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  profile_[i].start = -profile_[i + 1].start;</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>  std::reverse(profile_.begin() + 1, profile_.end() - 1);</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span> }</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  </div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="keywordtype">bool</span> TimeTablingPerTask::SweepAllTasks(<span class="keywordtype">bool</span> is_forward) {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// Tasks with a lower or equal demand will not be pushed.</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keyword">const</span> IntegerValue demand_threshold(</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <a class="code" href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">CapSub</a>(CapacityMax().<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(), profile_max_height_.value()));</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// Select the correct members depending on the direction.</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordtype">int</span>& num_tasks =</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  is_forward ? forward_num_tasks_to_sweep_ : backward_num_tasks_to_sweep_;</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  std::vector<int>& tasks =</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  is_forward ? forward_tasks_to_sweep_ : backward_tasks_to_sweep_;</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  </div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// TODO(user): On some problem, a big chunk of the time is spend just checking</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// these conditions below because it requires indirect memory access to fetch</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// the demand/size/presence/start ...</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_tasks - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = tasks[i];</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">if</span> (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="l00203"></a><span class="lineno"> 203</span>  (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t) && helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a05c2940dc774c223a59fd22a07a71753">StartIsFixed</a>(t))) {</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// This tasks does not have to be considered for propagation in the rest</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// of the sub-tree. Note that StartIsFixed() depends on the time</span></div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// direction, it is why we use two lists.</span></div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::swap(tasks[i], tasks[--num_tasks]);</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  }</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  </div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// Skip if demand is too low.</span></div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (DemandMin(t) <= demand_threshold) {</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> (DemandMax(t) == 0) {</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">// We can ignore this task for the rest of the subtree like above.</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  std::swap(tasks[i], tasks[--num_tasks]);</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>  </div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="comment">// This task does not have to be considered for propagation in this</span></div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// particular iteration, but maybe it does later.</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  }</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  </div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// Skip if size is zero.</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(t) == 0) {</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afa1aca9725da8adf5c56ea08e7636c32">SizeMax</a>(t) == 0) {</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  std::swap(tasks[i], tasks[--num_tasks]);</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="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  </div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">if</span> (!SweepTask(t)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  }</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> }</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  </div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="keywordtype">bool</span> TimeTablingPerTask::SweepTask(<span class="keywordtype">int</span> task_id) {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(task_id);</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</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_id);</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">const</span> IntegerValue initial_start_min = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(task_id);</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> IntegerValue initial_end_min = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(task_id);</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  </div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  IntegerValue new_start_min = initial_start_min;</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  IntegerValue new_end_min = initial_end_min;</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  </div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="comment">// Find the profile rectangle that overlaps the minimum start time of task_id.</span></div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// The sentinel prevents out of bound exceptions.</span></div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  DCHECK(std::is_sorted(profile_.begin(), profile_.end()));</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="keywordtype">int</span> rec_id =</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  std::upper_bound(profile_.begin(), profile_.end(), new_start_min,</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  [&](IntegerValue <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>, <span class="keyword">const</span> ProfileRectangle& rect) {</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  return value < rect.start;</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  }) -</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  profile_.begin();</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  --rec_id;</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="comment">// A profile rectangle is in conflict with the task if its height exceeds</span></div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="comment">// conflict_height.</span></div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">const</span> IntegerValue conflict_height = CapacityMax() - DemandMin(task_id);</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  </div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="comment">// True if the task is in conflict with at least one profile rectangle.</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordtype">bool</span> conflict_found = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  </div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// Last time point during which task_id was in conflict with a profile</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// rectangle before being pushed.</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  IntegerValue last_initial_conflict = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  </div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="comment">// Push the task from left to right until it does not overlap any conflicting</span></div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// rectangle. Pushing the task may push the end of its compulsory part on the</span></div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// right but will not change its start. The main loop of the propagator will</span></div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// take care of rebuilding the profile with these possible changes and to</span></div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// propagate again in order to reach the timetabling consistency or to fail if</span></div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="comment">// the profile exceeds the resource capacity.</span></div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  IntegerValue limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>, new_end_min);</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">for</span> (; profile_[rec_id].start < limit; ++rec_id) {</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// If the profile rectangle is not conflicting, go to the next rectangle.</span></div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (profile_[rec_id].height <= conflict_height) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  </div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  conflict_found = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  </div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// Compute the next minimum start and end times of task_id. The variables</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// are not updated yet.</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  new_start_min = profile_[rec_id + 1].start; <span class="comment">// i.e. profile_[rec_id].end</span></div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> < new_start_min) {</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (IsInProfile(task_id)) {</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">// Because the task is part of the profile, we cannot push it further.</span></div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  new_start_min = <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>;</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// We have a conflict or we can push the task absence. In both cases</span></div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="comment">// we don't need more than start_max + 1 in the explanation below.</span></div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  new_start_min = <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> + 1;</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>  </div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  new_end_min = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(new_end_min, new_start_min + size_min);</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  limit = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>, new_end_min);</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  </div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> (profile_[rec_id].start < initial_end_min) {</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  last_initial_conflict = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(new_start_min, initial_end_min) - 1;</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>  }</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  </div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">if</span> (!conflict_found) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  </div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">if</span> (initial_start_min != new_start_min &&</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  !UpdateStartingTime(task_id, last_initial_conflict, new_start_min)) {</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">return</span> <span class="keyword">false</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="comment">// The profile needs to be recomputed if we pushed something (because it can</span></div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// have side effects). Note that for the case where the interval is optional</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// but not its start, it is possible that UpdateStartingTime() didn't change</span></div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="comment">// the start, so we need to test this in order to avoid an infinite loop.</span></div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="comment">// TODO(user): find an efficient way to keep the start_max < new_end_min</span></div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// condition. The problem is that ReduceProfile() assumes that by_end_min and</span></div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// by_start_max are up to date (this is not necessarily the case if we use</span></div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// the old condition). A solution is to update those vector before calling</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// ReduceProfile() or to ReduceProfile() directly after BuildProfile() in the</span></div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// main loop.</span></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</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_id) != initial_start_min) {</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  profile_changed_ = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  }</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="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span> }</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  </div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="keywordtype">bool</span> TimeTablingPerTask::UpdateStartingTime(<span class="keywordtype">int</span> task_id, IntegerValue left,</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  IntegerValue right) {</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</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="l00331"></a><span class="lineno"> 331</span>  </div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  AddProfileReason(left, right);</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">if</span> (capacity_.<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>) {</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5610313501004888e9070594ae93729f">MutableIntegerReason</a>()->push_back(</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(capacity_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>));</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  </div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// State of the task to be pushed.</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">AddEndMinReason</a>(task_id, left + 1);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a37d7d6ef38f2acb9f12940ec8f68283a">AddSizeMinReason</a>(task_id, IntegerValue(1));</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">if</span> (demands_[task_id].<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="l00342"></a><span class="lineno"> 342</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5610313501004888e9070594ae93729f">MutableIntegerReason</a>()->push_back(</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(demands_[task_id].var));</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  }</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  </div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// Explain the increase of the minimum start and end times.</span></div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">return</span> helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a82f2ac210f1875a863bdedfa973bd947">IncreaseStartMin</a>(task_id, right);</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span> }</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="keywordtype">void</span> TimeTablingPerTask::AddProfileReason(IntegerValue left,</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  IntegerValue right) {</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_profile_tasks_; ++i) {</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = profile_tasks_[i];</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  </div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="comment">// Do not consider the task if it does not overlap for sure (left, right).</span></div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(t);</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">if</span> (right <= <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(t);</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a> <= left) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  </div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  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="l00362"></a><span class="lineno"> 362</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">AddStartMaxReason</a>(t, <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(left, <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a>));</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">AddEndMinReason</a>(t, <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(right, <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>));</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">if</span> (demands_[t].<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="l00365"></a><span class="lineno"> 365</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5610313501004888e9070594ae93729f">MutableIntegerReason</a>()->push_back(</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(demands_[t].var));</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  }</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  }</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span> }</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  </div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span> <span class="keywordtype">bool</span> TimeTablingPerTask::IncreaseCapacity(IntegerValue <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>,</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  IntegerValue new_min) {</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span> (new_min <= CapacityMin()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  </div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</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="l00376"></a><span class="lineno"> 376</span>  AddProfileReason(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>, <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> + 1);</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="keywordflow">if</span> (capacity_.<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>) {</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</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="l00379"></a><span class="lineno"> 379</span>  }</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>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5610313501004888e9070594ae93729f">MutableIntegerReason</a>()->push_back(</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(capacity_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#ab6516f556b715738034b30d290c40214">var</a>));</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">return</span> helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a15a86f414a12bf85e72bc7608bd3b786">PushIntegerLiteral</a>(capacity_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(new_min));</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span> }</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  </div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_time_tabling_per_task_html_aaa4ecf5818fadc0edcf62443f5d7664f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#aaa4ecf5818fadc0edcf62443f5d7664f">operations_research::sat::TimeTablingPerTask::TimeTablingPerTask</a></div><div class="ttdeci">TimeTablingPerTask(const std::vector< AffineExpression > &demands, AffineExpression capacity, IntegerTrail *integer_trail, SchedulingConstraintHelper *helper)</div><div class="ttdef"><b>Definition:</b> <a href="timetable_8cc_source.html#l00027">timetable.cc:27</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01858">expr_array.cc:1858</a></div></div>
|
|
<div class="ttc" id="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#l01897">integer.cc:1897</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#l00374">intervals.h:374</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a37d7d6ef38f2acb9f12940ec8f68283a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a37d7d6ef38f2acb9f12940ec8f68283a">operations_research::sat::SchedulingConstraintHelper::AddSizeMinReason</a></div><div class="ttdeci">void AddSizeMinReason(int t)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00442">intervals.h:442</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="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#l00203">integer.h:203</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#l00523">integer.h:523</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a228fe84d99348c2b62bb4f70a6371d9b"><div class="ttname"><a href="namespaceoperations__research.html#a228fe84d99348c2b62bb4f70a6371d9b">operations_research::CapSub</a></div><div class="ttdeci">int64 CapSub(int64 x, int64 y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00154">saturated_arithmetic.h:154</a></div></div>
|
|
<div class="ttc" id="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="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_afa1aca9725da8adf5c56ea08e7636c32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afa1aca9725da8adf5c56ea08e7636c32">operations_research::sat::SchedulingConstraintHelper::SizeMax</a></div><div class="ttdeci">IntegerValue SizeMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00362">intervals.h:362</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_aaede7c755aad90772efda6db087f3413"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">operations_research::sat::GenericLiteralWatcher::WatchLowerBound</a></div><div class="ttdeci">void WatchLowerBound(IntegerVariable var, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01301">integer.h:1301</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a82f2ac210f1875a863bdedfa973bd947"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a82f2ac210f1875a863bdedfa973bd947">operations_research::sat::SchedulingConstraintHelper::IncreaseStartMin</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool IncreaseStartMin(int t, IntegerValue new_min_start)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00311">intervals.cc:311</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#l00360">intervals.cc:360</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#l00382">intervals.h:382</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_a8963fd33e7bd70e749b2a37060ef1274"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">operations_research::sat::GenericLiteralWatcher::RegisterReversibleInt</a></div><div class="ttdeci">void RegisterReversibleInt(int id, int *rev)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01941">integer.cc:1941</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</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="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_aeccc78486bd270a6f68f87f4d412ff2c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c">operations_research::sat::SchedulingConstraintHelper::SetTimeDirection</a></div><div class="ttdeci">void SetTimeDirection(bool is_forward)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00143">intervals.cc:143</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="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#l00181">intervals.cc:181</a></div></div>
|
|
<div class="ttc" id="atimetable_8h_html"><div class="ttname"><a href="timetable_8h.html">timetable.h</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#l01067">integer.h:1067</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_ac0a2e8c6619af74b42472bfa9a9e6465"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">operations_research::sat::IntegerTrail::UpperBoundAsLiteral</a></div><div class="ttdeci">IntegerLiteral UpperBoundAsLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01263">integer.h:1263</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#l00238">intervals.h:238</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#l00417">intervals.h:417</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#l00355">intervals.cc:355</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#l00137">intervals.h:137</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#l00378">intervals.h:378</a></div></div>
|
|
<div class="ttc" id="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_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="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#l00412">intervals.h:412</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a615d87982145007855f2102262cf773c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">operations_research::sat::IntegerTrail::LowerBoundAsLiteral</a></div><div class="ttdeci">IntegerLiteral LowerBoundAsLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01258">integer.h:1258</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_affine_expression_html_a5d6f020504838c2d57528f47cd1fe164"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">operations_research::sat::AffineExpression::GreaterOrEqual</a></div><div class="ttdeci">IntegerLiteral GreaterOrEqual(IntegerValue bound) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00028">integer.cc:28</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a7c8133c50ba59755e2162ad1a9478da7"><div class="ttname"><a href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a></div><div class="ttdeci">Rev< int64 > start_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00242">sched_constraints.cc:242</a></div></div>
|
|
<div class="ttc" id="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#l00468">intervals.h:468</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="aclassoperations__research_1_1sat_1_1_time_tabling_per_task_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_tabling_per_task.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::TimeTablingPerTask::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="timetable_8cc_source.html#l00073">timetable.cc:73</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#l00356">intervals.h:356</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a16edac3fa04d9ba10ff012b5fb8add05"><div class="ttname"><a href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a></div><div class="ttdeci">Rev< int64 > end_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00243">sched_constraints.cc:243</a></div></div>
|
|
<div class="ttc" id="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#l00407">intervals.h:407</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a05c2940dc774c223a59fd22a07a71753"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a05c2940dc774c223a59fd22a07a71753">operations_research::sat::SchedulingConstraintHelper::StartIsFixed</a></div><div class="ttdeci">bool StartIsFixed(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00395">intervals.h:395</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#l00476">intervals.h:476</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#l00225">integer.h:225</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf"><div class="ttname"><a href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div><div class="ttdeci">int64 capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00129">routing_flow.cc:129</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a4d62ab6133b482aa6d670f4a8534681a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4d62ab6133b482aa6d670f4a8534681a">operations_research::sat::SchedulingConstraintHelper::TaskByIncreasingEndMin</a></div><div class="ttdeci">const std::vector< TaskTime > & TaskByIncreasingEndMin()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00169">intervals.cc:169</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_ac9d426060b1b7eee72e9e5345379f111"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">operations_research::sat::GenericLiteralWatcher::WatchUpperBound</a></div><div class="ttdeci">void WatchUpperBound(IntegerVariable var, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01310">integer.h:1310</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#l00061">timetable.cc:61</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a13421db7d7e84fff732599bcf954c5cc"><div class="ttname"><a href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a></div><div class="ttdeci">int64 time</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l01683">resource.cc:1683</a></div></div>
|
|
<div class="ttc" id="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#l00426">intervals.h:426</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#l00267">intervals.cc:267</a></div></div>
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="timetable_8cc.html">timetable.cc</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|