518 lines
89 KiB
HTML
518 lines
89 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_edgefinding.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">8.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('timetable__edgefinding_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_edgefinding.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="timetable__edgefinding_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__edgefinding_8h.html">ortools/sat/timetable_edgefinding.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> <span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span>  </div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</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="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="iterator__adaptors_8h.html">ortools/base/iterator_adaptors.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</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="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="sort_8h.html">ortools/util/sort.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span>  </div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a79c007a4dcb11e92cfa7de9149d81f6f"> 30</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a79c007a4dcb11e92cfa7de9149d81f6f">TimeTableEdgeFinding::TimeTableEdgeFinding</a>(</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</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="l00032"></a><span class="lineno"> 32</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  : num_tasks_(helper->NumTasks()),</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  demands_(demands),</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  capacity_(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>),</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  helper_(helper),</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  integer_trail_(integer_trail) {</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="comment">// Edge finding structures.</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  mandatory_energy_before_end_max_.resize(num_tasks_);</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  mandatory_energy_before_start_min_.resize(num_tasks_);</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// Energy of free parts.</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  size_free_.resize(num_tasks_);</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  energy_free_.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>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736"> 47</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736">TimeTableEdgeFinding::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="l00048"></a><span class="lineno"> 48</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="l00049"></a><span class="lineno"> 49</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="l00050"></a><span class="lineno"> 50</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="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks_; t++) {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</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="l00053"></a><span class="lineno"> 53</span>  }</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> }</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  </div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 56</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e">TimeTableEdgeFinding::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> old_timestamp = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9974fec8135545ed78d68333b6ec7cec">num_enqueues</a>();</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>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> (!TimeTableEdgeFindingPass()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</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#a84d83df1877d50258c1a63b83a5315b3">SynchronizeAndSetTimeDirection</a>(<span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">if</span> (!TimeTableEdgeFindingPass()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  </div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="comment">// Stop if no propagation.</span></div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (old_timestamp == integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9974fec8135545ed78d68333b6ec7cec">num_enqueues</a>()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span> }</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  </div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keywordtype">void</span> TimeTableEdgeFinding::BuildTimeTable() {</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  scp_.clear();</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  ecp_.clear();</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Build start of compulsory part events.</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> task_time :</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  ::<a class="code" href="namespacegtl.html#ae625b5510ffc29d1a66a422ec14809f7">gtl::reversed_view</a>(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab63994ddbf7097199cebad7f31b4a8ab">TaskByDecreasingStartMax</a>())) {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = task_time.task_index;</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (task_time.time < 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="l00082"></a><span class="lineno"> 82</span>  scp_.push_back(task_time);</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  }</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  </div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// Build end of compulsory part events.</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span> task_time : helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4d62ab6133b482aa6d670f4a8534681a">TaskByIncreasingEndMin</a>()) {</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = task_time.task_index;</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(t) < task_time.time) {</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  ecp_.push_back(task_time);</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</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>  </div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(scp_.size(), ecp_.size());</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  </div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keyword">const</span> std::vector<TaskTime>& by_decreasing_end_max =</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a164da36570ca5032417fffe5e081bba3">TaskByDecreasingEndMax</a>();</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keyword">const</span> std::vector<TaskTime>& by_start_min =</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3a35a6e84b9bd02b6842e3bdb7f0b3f2">TaskByIncreasingStartMin</a>();</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  </div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  IntegerValue height = IntegerValue(0);</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  IntegerValue <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a> = IntegerValue(0);</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  </div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// We don't care since at the beginning heigh is zero, and previous_time will</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// be correct after the first iteration.</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  IntegerValue previous_time = IntegerValue(0);</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>  <span class="keywordtype">int</span> index_scp = 0; <span class="comment">// index of the next value in scp</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordtype">int</span> index_ecp = 0; <span class="comment">// index of the next value in ecp</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordtype">int</span> index_smin = 0; <span class="comment">// index of the next value in by_start_min_</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordtype">int</span> index_emax = num_tasks_ - 1; <span class="comment">// index of the next value in by_end_max_</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  </div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">while</span> (index_emax >= 0) {</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// Next time point.</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// TODO(user): could be simplified with a sentinel.</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  IntegerValue <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = by_decreasing_end_max[index_emax].time;</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (index_smin < num_tasks_) {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>, by_start_min[index_smin].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</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="keywordflow">if</span> (index_scp < scp_.size()) {</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>, scp_[index_scp].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>);</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="keywordflow">if</span> (index_ecp < ecp_.size()) {</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>, ecp_[index_ecp].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>);</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  }</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  </div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="comment">// Total amount of energy contained in the timetable until time.</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a> += (<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> - previous_time) * height;</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  previous_time = <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>;</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  </div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="comment">// Store the energy contained in the timetable just before those events.</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">while</span> (index_smin < num_tasks_ && by_start_min[index_smin].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> == <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>) {</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  mandatory_energy_before_start_min_[by_start_min[index_smin].task_index] =</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  index_smin++;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  }</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>  <span class="comment">// Store the energy contained in the timetable just before those events.</span></div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">while</span> (index_emax >= 0 && by_decreasing_end_max[index_emax].<a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a> == <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>) {</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  mandatory_energy_before_end_max_[by_decreasing_end_max[index_emax]</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  .task_index] = <a class="code" href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a>;</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  index_emax--;</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// Process the starting compulsory parts.</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">while</span> (index_scp < scp_.size() && scp_[index_scp].time == <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>) {</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  height += DemandMin(scp_[index_scp].task_index);</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  index_scp++;</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  }</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  </div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Process the ending compulsory parts.</span></div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">while</span> (index_ecp < ecp_.size() && ecp_[index_ecp].time == <a class="code" href="resource_8cc.html#a13421db7d7e84fff732599bcf954c5cc">time</a>) {</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  height -= DemandMin(ecp_[index_ecp].task_index);</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  index_ecp++;</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  }</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> }</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  </div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span> <span class="keywordtype">bool</span> TimeTableEdgeFinding::TimeTableEdgeFindingPass() {</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// Initialize the data structures and build the free parts.</span></div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// --------------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks_; ++t) {</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// If the task has no mandatory part, then its free part is the task itself.</span></div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</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="l00166"></a><span class="lineno"> 166</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="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> >= <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>) {</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  size_free_[t] = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(t);</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  size_free_[t] = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(t) + <a class="code" href="sched__constraints_8cc.html#a7c8133c50ba59755e2162ad1a9478da7">start_max</a> - <a class="code" href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a>;</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  energy_free_[t] = size_free_[t] * DemandMin(t);</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  }</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>  BuildTimeTable();</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& by_start_min = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3a35a6e84b9bd02b6842e3bdb7f0b3f2">TaskByIncreasingStartMin</a>();</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  IntegerValue previous_end = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  </div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// Apply the Timetabling Edge Finding filtering rule.</span></div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// --------------------------------------------------</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// The loop order is not important for correctness.</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> TaskTime end_task_time : helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a164da36570ca5032417fffe5e081bba3">TaskByDecreasingEndMax</a>()) {</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> end_task = end_task_time.task_index;</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="comment">// TODO(user): consider optional tasks for additional propagation.</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(end_task)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="keywordflow">if</span> (energy_free_[end_task] == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  </div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// We only need to consider each time point once.</span></div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (end_task_time.time == previous_end) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  previous_end = end_task_time.time;</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  </div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// Energy of the free parts contained in the interval [begin, end).</span></div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  IntegerValue energy_free_parts = IntegerValue(0);</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">// Task that requires the biggest additional amount of energy to be</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// scheduled at its minimum start time in the task interval [begin, end).</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordtype">int</span> max_task = -1;</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  IntegerValue free_energy_of_max_task_in_window(0);</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  IntegerValue extra_energy_required_by_max_task = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  </div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="comment">// Process task by decreasing start min.</span></div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> TaskTime begin_task_time : <a class="code" href="namespacegtl.html#ae625b5510ffc29d1a66a422ec14809f7">gtl::reversed_view</a>(by_start_min)) {</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> begin_task = begin_task_time.task_index;</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  </div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="comment">// TODO(user): consider optional tasks for additional propagation.</span></div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(begin_task)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">if</span> (energy_free_[begin_task] == 0) <span class="keywordflow">continue</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">// The considered time window. Note that we use the "cached" values so</span></div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="comment">// that our mandatory energy before computation is correct.</span></div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> IntegerValue begin = begin_task_time.time; <span class="comment">// Start min.</span></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> IntegerValue end = end_task_time.time; <span class="comment">// End max.</span></div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  </div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="comment">// Not a valid time window.</span></div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="keywordflow">if</span> (end <= begin) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// We consider two different cases: either the free part overlaps the</span></div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="comment">// end of the interval (right) or it does not (inside).</span></div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// begin end</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// v v</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// right: ======|===</span></div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="comment">// begin end</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="comment">// v v</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="comment">// inside: ========== |</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// In the inside case, the additional amount of energy required to</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// schedule the task at its minimum start time is equal to the whole</span></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="comment">// energy of the free part. In the right case, the additional energy is</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="comment">// equal to the largest part of the free part that can fit in the task</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="comment">// interval.</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a3db7a45809ea7c6000b10a58f003b331">end_max</a> = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(begin_task);</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a3db7a45809ea7c6000b10a58f003b331">end_max</a> <= end) {</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="comment">// The whole task energy is contained in the task interval.</span></div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  energy_free_parts += energy_free_[begin_task];</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keyword">const</span> IntegerValue demand_min = DemandMin(begin_task);</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keyword">const</span> IntegerValue extra_energy =</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(size_free_[begin_task], (end - begin)) * demand_min;</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  </div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// This is not in the paper, but it is almost free for us to account for</span></div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// the free energy of this task that must be present in the window.</span></div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">const</span> IntegerValue free_energy_in_window =</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(IntegerValue(0),</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  size_free_[begin_task] - (<a class="code" href="sched__constraints_8cc.html#a3db7a45809ea7c6000b10a58f003b331">end_max</a> - end)) *</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  demand_min;</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  </div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keywordflow">if</span> (extra_energy > extra_energy_required_by_max_task) {</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  max_task = begin_task;</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  extra_energy_required_by_max_task = extra_energy;</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  </div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// Account for the free energy of the old max task, and cache the</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// new one for later.</span></div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  energy_free_parts += free_energy_of_max_task_in_window;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  free_energy_of_max_task_in_window = free_energy_in_window;</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  energy_free_parts += free_energy_in_window;</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  }</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  </div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="comment">// No task to push. This happens if all the tasks that overlap the task</span></div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="comment">// interval are entirely contained in it.</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="comment">// TODO(user): check that we should not fail if the interval is</span></div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="comment">// overloaded, i.e., available_energy < 0.</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keywordflow">if</span> (max_task == -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  </div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// Compute the amount of energy available to schedule max_task.</span></div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keyword">const</span> IntegerValue interval_energy = CapacityMax() * (end - begin);</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keyword">const</span> IntegerValue energy_mandatory =</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  mandatory_energy_before_end_max_[end_task] -</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  mandatory_energy_before_start_min_[begin_task];</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keyword">const</span> IntegerValue available_energy =</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  interval_energy - energy_free_parts - energy_mandatory;</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  </div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// Enough energy to schedule max_task at its minimum start time.</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (extra_energy_required_by_max_task <= available_energy) <span class="keywordflow">continue</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 length of the mandatory subpart of max_task that should be</span></div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// considered as available.</span></div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// TODO(user): Because this use updated bounds, it might be more than what</span></div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// we accounted for in the precomputation. This is correct but could be</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">// improved uppon.</span></div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">const</span> IntegerValue mandatory_in = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  IntegerValue(0), <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(end, helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(max_task)) -</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(begin, helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(max_task)));</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  </div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// Compute the new minimum start time of max_task.</span></div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">const</span> IntegerValue new_start =</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  end - mandatory_in - (available_energy / DemandMin(max_task));</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>  <span class="comment">// Push and explain only if the new start is bigger than the current one.</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(max_task) < new_start) {</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="keywordflow">if</span> (!IncreaseStartMin(begin, end, max_task, new_start)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  }</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>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span> }</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  </div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span> <span class="keywordtype">bool</span> TimeTableEdgeFinding::IncreaseStartMin(IntegerValue begin,</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  IntegerValue end, <span class="keywordtype">int</span> task_index,</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  IntegerValue new_start) {</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</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="l00309"></a><span class="lineno"> 309</span>  std::vector<IntegerLiteral>* mutable_reason = helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5610313501004888e9070594ae93729f">MutableIntegerReason</a>();</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  </div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// Capacity of the resource.</span></div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</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="l00313"></a><span class="lineno"> 313</span>  mutable_reason->push_back(</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</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="l00315"></a><span class="lineno"> 315</span>  }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  </div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// Variables of the task to be pushed. We do not need the end max for this</span></div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// task and we only need for it to begin in the time window.</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="keywordflow">if</span> (demands_[task_index].<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="l00320"></a><span class="lineno"> 320</span>  mutable_reason->push_back(</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(demands_[task_index].var));</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  }</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3dc35c00655b5b7a99fea52e432adf4b">AddStartMinReason</a>(task_index, begin);</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a37d7d6ef38f2acb9f12940ec8f68283a">AddSizeMinReason</a>(task_index);</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  </div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="comment">// Task contributing to the energy in the interval.</span></div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks_; ++t) {</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">if</span> (t == task_index) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">if</span> (!helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(t) <= begin) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">if</span> (helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(t) >= end) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  </div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</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="l00334"></a><span class="lineno"> 334</span>  mutable_reason->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#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(demands_[t].var));</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">// We need the reason for the energy contribution of this interval into</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// [begin, end].</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// TODO(user): Since we actually do not account fully for this energy, we</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// could relax the reason more.</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">// TODO(user): This reason might not be enough in the presence of variable</span></div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// size intervals where StartMax and EndMin give rise to more energy</span></div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// that just using size min and these bounds. Fix.</span></div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3dc35c00655b5b7a99fea52e432adf4b">AddStartMinReason</a>(t, <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(begin, helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(t)));</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">AddEndMaxReason</a>(t, <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(end, helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(t)));</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a37d7d6ef38f2acb9f12940ec8f68283a">AddSizeMinReason</a>(t);</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</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="l00351"></a><span class="lineno"> 351</span>  }</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  </div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">return</span> helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36">IncreaseStartMin</a>(task_index, new_start);</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>  </div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<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#l01939">integer.cc:1939</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#l00228">intervals.h:228</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#l00488">intervals.h:488</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="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#l00205">integer.h:205</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#l00533">integer.h:533</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="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#l01366">integer.h:1366</a></div></div>
|
|
<div class="ttc" id="aresource_8cc_html_a1bf2861503e93569c60093cdaec9d694"><div class="ttname"><a href="resource_8cc.html#a1bf2861503e93569c60093cdaec9d694">energy</a></div><div class="ttdeci">int64 energy</div><div class="ttdef"><b>Definition:</b> <a href="resource_8cc_source.html#l00349">resource.cc:349</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a3db7a45809ea7c6000b10a58f003b331"><div class="ttname"><a href="sched__constraints_8cc.html#a3db7a45809ea7c6000b10a58f003b331">end_max</a></div><div class="ttdeci">Rev< int64 > end_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00244">sched_constraints.cc:244</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a3f981878c21fbe2f41a2daf010c93804"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">operations_research::sat::SchedulingConstraintHelper::WatchAllTasks</a></div><div class="ttdeci">void WatchAllTasks(int id, GenericLiteralWatcher *watcher, bool watch_start_max=true, bool watch_end_max=true) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00460">intervals.cc:460</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_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#l00229">intervals.h:229</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_scheduling_constraint_helper_html_a164da36570ca5032417fffe5e081bba3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a164da36570ca5032417fffe5e081bba3">operations_research::sat::SchedulingConstraintHelper::TaskByDecreasingEndMax</a></div><div class="ttdeci">const std::vector< TaskTime > & TaskByDecreasingEndMax()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00302">intervals.cc:302</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_a9125ec8126e6035eacce8a5eb52b45c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">operations_research::sat::SchedulingConstraintHelper::EndMax</a></div><div class="ttdeci">IntegerValue EndMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00231">intervals.h:231</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a3dc35c00655b5b7a99fea52e432adf4b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3dc35c00655b5b7a99fea52e432adf4b">operations_research::sat::SchedulingConstraintHelper::AddStartMinReason</a></div><div class="ttdeci">void AddStartMinReason(int t, IntegerValue lower_bound)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00504">intervals.h:504</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ab63994ddbf7097199cebad7f31b4a8ab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab63994ddbf7097199cebad7f31b4a8ab">operations_research::sat::SchedulingConstraintHelper::TaskByDecreasingStartMax</a></div><div class="ttdeci">const std::vector< TaskTime > & TaskByDecreasingStartMax()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00289">intervals.cc:289</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a3a35a6e84b9bd02b6842e3bdb7f0b3f2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3a35a6e84b9bd02b6842e3bdb7f0b3f2">operations_research::sat::SchedulingConstraintHelper::TaskByIncreasingStartMin</a></div><div class="ttdeci">const std::vector< TaskTime > & TaskByIncreasingStartMin()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00265">intervals.cc:265</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#l01101">integer.h:1101</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#l01328">integer.h:1328</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#l00296">intervals.h:296</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#l00463">intervals.h:463</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#l00171">intervals.h:172</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#l00230">intervals.h:230</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_time_table_edge_finding_html_a79c007a4dcb11e92cfa7de9149d81f6f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a79c007a4dcb11e92cfa7de9149d81f6f">operations_research::sat::TimeTableEdgeFinding::TimeTableEdgeFinding</a></div><div class="ttdeci">TimeTableEdgeFinding(const std::vector< AffineExpression > &demands, AffineExpression capacity, SchedulingConstraintHelper *helper, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="timetable__edgefinding_8cc_source.html#l00030">timetable_edgefinding.cc:30</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_time_table_edge_finding_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::TimeTableEdgeFinding::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="timetable__edgefinding_8cc_source.html#l00047">timetable_edgefinding.cc:47</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#l01323">integer.h:1323</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_time_table_edge_finding_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_time_table_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::TimeTableEdgeFinding::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="timetable__edgefinding_8cc_source.html#l00056">timetable_edgefinding.cc:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a84d83df1877d50258c1a63b83a5315b3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a84d83df1877d50258c1a63b83a5315b3">operations_research::sat::SchedulingConstraintHelper::SynchronizeAndSetTimeDirection</a></div><div class="ttdeci">void SynchronizeAndSetTimeDirection(bool is_forward)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00234">intervals.cc:234</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a7cf01605afaa07af160e933df8433e36"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36">operations_research::sat::SchedulingConstraintHelper::IncreaseStartMin</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool IncreaseStartMin(int t, IntegerValue new_start_min)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00405">intervals.cc:405</a></div></div>
|
|
<div class="ttc" id="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_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#l00223">intervals.h:223</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="anamespacegtl_html_ae625b5510ffc29d1a66a422ec14809f7"><div class="ttname"><a href="namespacegtl.html#ae625b5510ffc29d1a66a422ec14809f7">gtl::reversed_view</a></div><div class="ttdeci">ReverseView< Container > reversed_view(const Container &c)</div><div class="ttdef"><b>Definition:</b> <a href="iterator__adaptors_8h_source.html#l00033">iterator_adaptors.h:33</a></div></div>
|
|
<div class="ttc" id="asched__constraints_8cc_html_a16edac3fa04d9ba10ff012b5fb8add05"><div class="ttname"><a href="sched__constraints_8cc.html#a16edac3fa04d9ba10ff012b5fb8add05">end_min</a></div><div class="ttdeci">Rev< int64 > end_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00243">sched_constraints.cc:243</a></div></div>
|
|
<div class="ttc" id="aiterator__adaptors_8h_html"><div class="ttname"><a href="iterator__adaptors_8h.html">iterator_adaptors.h</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#l00453">intervals.h:453</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="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#l00240">integer.h:240</a></div></div>
|
|
<div class="ttc" id="atimetable__edgefinding_8h_html"><div class="ttname"><a href="timetable__edgefinding_8h.html">timetable_edgefinding.h</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_integer_trail_html_a9974fec8135545ed78d68333b6ec7cec"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a9974fec8135545ed78d68333b6ec7cec">operations_research::sat::IntegerTrail::num_enqueues</a></div><div class="ttdeci">int64 num_enqueues() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00787">integer.h:787</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#l00277">intervals.cc:277</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_aca49afb19cf18dfc1ea50a7d0a36d961"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">operations_research::sat::SchedulingConstraintHelper::AddEndMaxReason</a></div><div class="ttdeci">void AddEndMaxReason(int t, IntegerValue upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00557">intervals.h:557</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#l01384">integer.h:1384</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#l00472">intervals.h:472</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__edgefinding_8cc.html">timetable_edgefinding.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>
|