477 lines
84 KiB
HTML
477 lines
84 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: disjunctive.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('disjunctive_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">disjunctive.h</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="disjunctive_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a name="l00013"></a><span class="lineno"> 13</span>  </div>
|
|
<div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#ifndef OR_TOOLS_SAT_DISJUNCTIVE_H_</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#define OR_TOOLS_SAT_DISJUNCTIVE_H_</span></div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span>  </div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <functional></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="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="intervals_8h.html">ortools/sat/intervals.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="sat_2model_8h.html">ortools/sat/model.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="precedences_8h.html">ortools/sat/precedences.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="theta__tree_8h.html">ortools/sat/theta_tree.h</a>"</span></div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  </div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// Enforces a disjunctive (or no overlap) constraint on the given interval</span></div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// variables. The intervals are interpreted as [start, end) and the constraint</span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// enforces that no time point belongs to two intervals.</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// TODO(user): This is not completely true for empty intervals (start == end).</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// Make sure such intervals are ignored by the constraint.</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> std::function<void(Model*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0">Disjunctive</a>(</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars);</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">// Creates Boolean variables for all the possible precedences of the form (task</span></div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment">// i is before task j) and forces that, for each couple of task (i,j), either i</span></div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment">// is before j or j is before i. Do not create any other propagators.</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span> std::function<void(Model*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a73098886bd45684da9f3b3019c25ab93">DisjunctiveWithBooleanPrecedencesOnly</a>(</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars);</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  </div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment">// Same as Disjunctive() + DisjunctiveWithBooleanPrecedencesOnly().</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span> std::function<void(Model*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a89be28cfe3c4682b26fd153f9f133705">DisjunctiveWithBooleanPrecedences</a>(</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& vars);</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  </div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment">// Helper class to compute the end-min of a set of tasks given their start-min</span></div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment">// and size-min. In Petr Vilim's PhD "Global Constraints in Scheduling",</span></div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// this corresponds to his Theta-tree except that we use a O(n) implementation</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// for most of the function here, not a O(log(n)) one.</span></div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html"> 56</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_task_set.html">TaskSet</a> {</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a632fb419eb35f8eefeb6009e4f1c4dfa"> 58</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a632fb419eb35f8eefeb6009e4f1c4dfa">TaskSet</a>(<span class="keywordtype">int</span> num_tasks) { sorted_tasks_.reserve(num_tasks); }</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  </div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html"> 60</a></span>  <span class="keyword">struct </span><a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">Entry</a> {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a427ef99d8b77e4cac03718a0a769f806"> 61</a></span>  <span class="keywordtype">int</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a427ef99d8b77e4cac03718a0a769f806">task</a>;</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8"> 62</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a>;</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a65aeef300c5d89103a5b85a3191a9a20"> 63</a></span>  IntegerValue <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a65aeef300c5d89103a5b85a3191a9a20">size_min</a>;</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// Note that the tie-breaking is not important here.</span></div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"><a class="line" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a69317f47b95f04ae4154ca09be89998e"> 66</a></span>  <span class="keywordtype">bool</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a69317f47b95f04ae4154ca09be89998e">operator<</a>(<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">Entry</a> other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a> < other.<a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">start_min</a>; }</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</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="comment">// Insertion and modification. These leave sorted_tasks_ sorted.</span></div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#aa71d36872f416feaa853788a7a7a7ef8"> 70</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#aa71d36872f416feaa853788a7a7a7ef8">Clear</a>() {</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  sorted_tasks_.clear();</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  optimized_restart_ = 0;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  }</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a98c223e2c82a01f67cd71dd4eca70b70">AddEntry</a>(<span class="keyword">const</span> Entry& e);</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a34dd782f4175fa103604d994fba1d6de">RemoveEntryWithIndex</a>(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  </div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// Same as AddEntry({t, helper->ShiftedStartMin(t), helper->SizeMin(t)}).</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="comment">// This is a minor optimization to not call SizeMin(t) twice.</span></div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a7e3986de45625c55b092944d4cd9e547">AddShiftedStartMinEntry</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>& helper, <span class="keywordtype">int</span> t);</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="comment">// Advanced usage, if the entry is present, this assumes that its start_min is</span></div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// >= the end min without it, and update the datastructure accordingly.</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a122123bd7c7d530bbd686617ffb4c798">NotifyEntryIsNowLastIfPresent</a>(<span class="keyword">const</span> Entry& e);</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  </div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// Advanced usage. Instead of calling many AddEntry(), it is more efficient to</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// call AddUnsortedEntry() instead, but then Sort() MUST be called just after</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="comment">// the insertions. Nothing is checked here, so it is up to the client to do</span></div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="comment">// that properly.</span></div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a032dc7e53f9416a067c429709cc83ba6"> 89</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a032dc7e53f9416a067c429709cc83ba6">AddUnsortedEntry</a>(<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">Entry</a>& e) { sorted_tasks_.push_back(e); }</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#ae424c3360277f457eba79fd25b4eed3b"> 90</a></span>  <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#ae424c3360277f457eba79fd25b4eed3b">Sort</a>() { std::sort(sorted_tasks_.begin(), sorted_tasks_.end()); }</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  </div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="comment">// Returns the end-min for the task in the set. The time profile of the tasks</span></div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// packed to the left will always be a set of contiguous tasks separated by</span></div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="comment">// empty space:</span></div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// [Bunch of tasks] ... [Bunch of tasks] ... [critical tasks].</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="comment">// We call "critical tasks" the last group. These tasks will be solely</span></div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="comment">// responsible for for the end-min of the whole set. The returned</span></div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// critical_index will be the index of the first critical task in</span></div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="comment">// SortedTasks().</span></div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="comment">// A reason for the min end is:</span></div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="comment">// - The size-min of all the critical tasks.</span></div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// - The fact that all critical tasks have a start-min greater or equal to the</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// first of them, that is SortedTasks()[critical_index].start_min.</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="comment">// It is possible to behave like if one task was not in the set by setting</span></div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="comment">// task_to_ignore to the id of this task. This returns 0 if the set is empty</span></div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="comment">// in which case critical_index will be left unchanged.</span></div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  IntegerValue <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a95dc40a61faa48e7996a4c139a9d119d">ComputeEndMin</a>(<span class="keywordtype">int</span> task_to_ignore, <span class="keywordtype">int</span>* critical_index) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  IntegerValue <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a95dc40a61faa48e7996a4c139a9d119d">ComputeEndMin</a>() <span class="keyword">const</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="comment">// Warning, this is only valid if ComputeEndMin() was just called. It is the</span></div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// same index as if one called ComputeEndMin(-1, &critical_index), but saves</span></div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// another unneeded loop.</span></div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#a425191fbad86521fccd89226ed8dfbb0"> 117</a></span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#a425191fbad86521fccd89226ed8dfbb0">GetCriticalIndex</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> optimized_restart_; }</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  </div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_task_set.html#ab1073196aabdb8a939860e16e9f8b505"> 119</a></span>  <span class="keyword">const</span> std::vector<Entry>& <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html#ab1073196aabdb8a939860e16e9f8b505">SortedTasks</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> sorted_tasks_; }</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="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  std::vector<Entry> sorted_tasks_;</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">mutable</span> <span class="keywordtype">int</span> optimized_restart_ = 0;</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> };</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  </div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// ============================================================================</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// Below are many of the known propagation techniques for the disjunctive, each</span></div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="comment">// implemented in only one time direction and in its own propagator class. The</span></div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span> <span class="comment">// Disjunctive() model function above will instantiate the used ones (according</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="comment">// to the solver parameters) in both time directions.</span></div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span> <span class="comment">// See Petr Vilim PhD "Global Constraints in Scheduling" for a description of</span></div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="comment">// some of the algorithm.</span></div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="comment">// ============================================================================</span></div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  </div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html"> 136</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html">DisjunctiveOverloadChecker</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a0c5d48979d7e91d89347afcd173138a2"> 138</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a0c5d48979d7e91d89347afcd173138a2">DisjunctiveOverloadChecker</a>(<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper)</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  : helper_(helper) {</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="comment">// Resize this once and for all.</span></div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  task_to_event_.resize(helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>());</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() final;</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">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="l00145"></a><span class="lineno"> 145</span>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  private:</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordtype">bool</span> PropagateSubwindow(IntegerValue global_window_end);</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  </div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper_;</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>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> window_;</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> task_by_increasing_end_max_;</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>  <a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">ThetaLambdaTree</a><IntegerValue> theta_tree_;</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  std::vector<<span class="keywordtype">int</span>> task_to_event_;</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"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html"> 158</a></span> class <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html">DisjunctiveDetectablePrecedences</a> : public <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#a96ae70b1063a4270844ea92507fd4654"> 160</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#a96ae70b1063a4270844ea92507fd4654">DisjunctiveDetectablePrecedences</a>(<span class="keywordtype">bool</span> time_direction,</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper)</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  : time_direction_(time_direction),</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  helper_(helper),</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  task_set_(helper->NumTasks()) {}</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() final;</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">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="l00167"></a><span class="lineno"> 167</span>  </div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  private:</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordtype">bool</span> PropagateSubwindow();</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  </div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> task_by_increasing_end_min_;</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> task_by_increasing_start_max_;</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>  std::vector<<span class="keywordtype">bool</span>> processed_;</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  std::vector<<span class="keywordtype">int</span>> to_propagate_;</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  </div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  const <span class="keywordtype">bool</span> time_direction_;</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper_;</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html">TaskSet</a> task_set_;</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span> };</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  </div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="comment">// Singleton model class which is just a SchedulingConstraintHelper will all</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// the intervals.</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_intervals_helper.html"> 184</a></span> class <a class="code" href="classoperations__research_1_1sat_1_1_all_intervals_helper.html">AllIntervalsHelper</a> : public <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a> {</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_intervals_helper.html#a3a1a065eddd21dfca6cebacdc5fd5e21"> 186</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_all_intervals_helper.html#a3a1a065eddd21dfca6cebacdc5fd5e21">AllIntervalsHelper</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  : <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>(</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>()->AllIntervals(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {}</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>  </div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// This propagates the same things as DisjunctiveDetectablePrecedences, except</span></div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// that it only sort the full set of intervals once and then work on a combined</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment">// set of disjunctives.</span></div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="keyword">template</span> <<span class="keywordtype">bool</span> time_direction></div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html"> 195</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html">CombinedDisjunctive</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_combined_disjunctive.html">CombinedDisjunctive</a>(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  </div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// After creation, this must be called for all the disjunctive constraints</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="comment">// in the model.</span></div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">void</span> AddNoOverlap(<span class="keyword">const</span> std::vector<IntervalVariable>& <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</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="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() <span class="keyword">final</span>;</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">private</span>:</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="code" href="classoperations__research_1_1sat_1_1_all_intervals_helper.html">AllIntervalsHelper</a>* helper_;</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::vector<std::vector<int>> task_to_disjunctives_;</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  std::vector<bool> task_is_added_;</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  std::vector<TaskSet> task_sets_;</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  std::vector<IntegerValue> end_mins_;</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span> };</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  </div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html"> 213</a></span> <span class="keyword">class </span><a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html">DisjunctiveNotLast</a> : <span class="keyword">public</span> <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#a514affefc1cf166156f79e6c55929061"> 215</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#a514affefc1cf166156f79e6c55929061">DisjunctiveNotLast</a>(<span class="keywordtype">bool</span> time_direction, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper)</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  : time_direction_(time_direction),</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  helper_(helper),</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  task_set_(helper->NumTasks()) {}</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() final;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">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="l00221"></a><span class="lineno"> 221</span>  </div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  private:</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordtype">bool</span> PropagateSubwindow();</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  </div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> start_min_window_;</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> start_max_window_;</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>  const <span class="keywordtype">bool</span> time_direction_;</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper_;</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html">TaskSet</a> task_set_;</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</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"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html"> 233</a></span> class <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html">DisjunctiveEdgeFinding</a> : public <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#a84d573d74053a5b49f91e466c63e30e2"> 235</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#a84d573d74053a5b49f91e466c63e30e2">DisjunctiveEdgeFinding</a>(<span class="keywordtype">bool</span> time_direction,</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper)</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  : time_direction_(time_direction), helper_(helper) {}</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() final;</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">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="l00240"></a><span class="lineno"> 240</span>  </div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  private:</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordtype">bool</span> PropagateSubwindow(IntegerValue window_end_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>  const <span class="keywordtype">bool</span> time_direction_;</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper_;</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  </div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="comment">// This only contains non-gray tasks.</span></div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> task_by_increasing_end_max_;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  </div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">// All these member are indexed in the same way.</span></div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> window_;</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <a class="code" href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">ThetaLambdaTree</a><IntegerValue> theta_tree_;</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  std::vector<IntegerValue> event_size_;</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">// Task indexed.</span></div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  std::vector<<span class="keywordtype">int</span>> non_gray_task_to_event_;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  std::vector<<span class="keywordtype">bool</span>> is_gray_;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span> };</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  </div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// Exploits the precedences relations of the form "this set of disjoint</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// IntervalVariables must be performed before a given IntegerVariable". The</span></div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// relations are computed with PrecedencesPropagator::ComputePrecedences().</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html"> 263</a></span> class <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html">DisjunctivePrecedences</a> : public <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#ad653efc28d0387554f04db18421782d2"> 265</a></span>  <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#ad653efc28d0387554f04db18421782d2">DisjunctivePrecedences</a>(<span class="keywordtype">bool</span> time_direction,</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper,</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail,</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* precedences)</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  : time_direction_(time_direction),</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  helper_(helper),</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  integer_trail_(integer_trail),</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  precedences_(precedences),</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  task_set_(helper->NumTasks()),</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  task_to_arc_index_(helper->NumTasks()) {}</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() final;</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">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="l00277"></a><span class="lineno"> 277</span>  </div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  private:</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordtype">bool</span> PropagateSubwindow();</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>  const <span class="keywordtype">bool</span> time_direction_;</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper_;</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail_;</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>* precedences_;</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  </div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  std::vector<<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>> window_;</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  std::vector<IntegerVariable> index_to_end_vars_;</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="classoperations__research_1_1sat_1_1_task_set.html">TaskSet</a> task_set_;</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  std::vector<<span class="keywordtype">int</span>> task_to_arc_index_;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  std::vector<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>::IntegerPrecedences> before_;</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span> };</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  </div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="comment">// This is an optimization for the case when we have a big number of such</span></div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span> <span class="comment">// pairwise constraints. This should be roughtly equivalent to what the general</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span> <span class="comment">// disjunctive case is doing, but it dealt with variable size better and has a</span></div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span> <span class="comment">// lot less overhead.</span></div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html"> 298</a></span> class <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html">DisjunctiveWithTwoItems</a> : public <a class="code" href="classoperations__research_1_1sat_1_1_propagator_interface.html">PropagatorInterface</a> {</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">public</span>:</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#a1bd06ea7d41b72f47389f893d4a8347e"> 300</a></span>  <span class="keyword">explicit</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#a1bd06ea7d41b72f47389f893d4a8347e">DisjunctiveWithTwoItems</a>(<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper)</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  : helper_(helper) {}</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>() final;</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">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="l00304"></a><span class="lineno"> 304</span>  </div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  private:</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* helper_;</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span> };</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  </div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  </div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_DISJUNCTIVE_H_</span></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_intervals_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_intervals_helper.html">operations_research::sat::AllIntervalsHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00184">disjunctive.h:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_intervals_helper_html_a3a1a065eddd21dfca6cebacdc5fd5e21"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_intervals_helper.html#a3a1a065eddd21dfca6cebacdc5fd5e21">operations_research::sat::AllIntervalsHelper::AllIntervalsHelper</a></div><div class="ttdeci">AllIntervalsHelper(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00186">disjunctive.h:186</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_combined_disjunctive_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_combined_disjunctive.html">operations_research::sat::CombinedDisjunctive</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00195">disjunctive.h:195</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_detectable_precedences_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html">operations_research::sat::DisjunctiveDetectablePrecedences</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00158">disjunctive.h:158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_detectable_precedences_html_a96ae70b1063a4270844ea92507fd4654"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#a96ae70b1063a4270844ea92507fd4654">operations_research::sat::DisjunctiveDetectablePrecedences::DisjunctiveDetectablePrecedences</a></div><div class="ttdeci">DisjunctiveDetectablePrecedences(bool time_direction, SchedulingConstraintHelper *helper)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00160">disjunctive.h:160</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_edge_finding_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html">operations_research::sat::DisjunctiveEdgeFinding</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00233">disjunctive.h:233</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_edge_finding_html_a84d573d74053a5b49f91e466c63e30e2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#a84d573d74053a5b49f91e466c63e30e2">operations_research::sat::DisjunctiveEdgeFinding::DisjunctiveEdgeFinding</a></div><div class="ttdeci">DisjunctiveEdgeFinding(bool time_direction, SchedulingConstraintHelper *helper)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00235">disjunctive.h:235</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_not_last_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html">operations_research::sat::DisjunctiveNotLast</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00213">disjunctive.h:213</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_not_last_html_a514affefc1cf166156f79e6c55929061"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#a514affefc1cf166156f79e6c55929061">operations_research::sat::DisjunctiveNotLast::DisjunctiveNotLast</a></div><div class="ttdeci">DisjunctiveNotLast(bool time_direction, SchedulingConstraintHelper *helper)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00215">disjunctive.h:215</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_overload_checker_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html">operations_research::sat::DisjunctiveOverloadChecker</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00136">disjunctive.h:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_overload_checker_html_a0c5d48979d7e91d89347afcd173138a2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a0c5d48979d7e91d89347afcd173138a2">operations_research::sat::DisjunctiveOverloadChecker::DisjunctiveOverloadChecker</a></div><div class="ttdeci">DisjunctiveOverloadChecker(SchedulingConstraintHelper *helper)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00138">disjunctive.h:138</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_overload_checker_html_a1868d977c2e9baed0f16c9ec71d6626e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#a1868d977c2e9baed0f16c9ec71d6626e">operations_research::sat::DisjunctiveOverloadChecker::RegisterWith</a></div><div class="ttdeci">int RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00631">disjunctive.cc:631</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_overload_checker_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveOverloadChecker::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00460">disjunctive.cc:460</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_precedences_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html">operations_research::sat::DisjunctivePrecedences</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00263">disjunctive.h:263</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_precedences_html_ad653efc28d0387554f04db18421782d2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_precedences.html#ad653efc28d0387554f04db18421782d2">operations_research::sat::DisjunctivePrecedences::DisjunctivePrecedences</a></div><div class="ttdeci">DisjunctivePrecedences(bool time_direction, SchedulingConstraintHelper *helper, IntegerTrail *integer_trail, PrecedencesPropagator *precedences)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00265">disjunctive.h:265</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_with_two_items_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html">operations_research::sat::DisjunctiveWithTwoItems</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00298">disjunctive.h:298</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_disjunctive_with_two_items_html_a1bd06ea7d41b72f47389f893d4a8347e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_with_two_items.html#a1bd06ea7d41b72f47389f893d4a8347e">operations_research::sat::DisjunctiveWithTwoItems::DisjunctiveWithTwoItems</a></div><div class="ttdeci">DisjunctiveWithTwoItems(SchedulingConstraintHelper *helper)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00300">disjunctive.h:300</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">operations_research::sat::GenericLiteralWatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01113">integer.h:1113</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00545">integer.h:545</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_intervals_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html">operations_research::sat::IntervalsRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00046">intervals.h:46</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_precedences_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html">operations_research::sat::PrecedencesPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00052">precedences.h:52</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_propagator_interface_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_propagator_interface.html">operations_research::sat::PropagatorInterface</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01065">integer.h:1065</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">operations_research::sat::SchedulingConstraintHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00172">intervals.h:173</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ad9b4a962b743e358f3a7c4b2279f99c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">operations_research::sat::SchedulingConstraintHelper::NumTasks</a></div><div class="ttdeci">int NumTasks() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00203">intervals.h:203</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html">operations_research::sat::TaskSet</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00056">disjunctive.h:56</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a032dc7e53f9416a067c429709cc83ba6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a032dc7e53f9416a067c429709cc83ba6">operations_research::sat::TaskSet::AddUnsortedEntry</a></div><div class="ttdeci">void AddUnsortedEntry(const Entry &e)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00089">disjunctive.h:89</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a122123bd7c7d530bbd686617ffb4c798"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a122123bd7c7d530bbd686617ffb4c798">operations_research::sat::TaskSet::NotifyEntryIsNowLastIfPresent</a></div><div class="ttdeci">void NotifyEntryIsNowLastIfPresent(const Entry &e)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00184">disjunctive.cc:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a34dd782f4175fa103604d994fba1d6de"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a34dd782f4175fa103604d994fba1d6de">operations_research::sat::TaskSet::RemoveEntryWithIndex</a></div><div class="ttdeci">void RemoveEntryWithIndex(int index)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00199">disjunctive.cc:199</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a425191fbad86521fccd89226ed8dfbb0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a425191fbad86521fccd89226ed8dfbb0">operations_research::sat::TaskSet::GetCriticalIndex</a></div><div class="ttdeci">int GetCriticalIndex() const</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00117">disjunctive.h:117</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a632fb419eb35f8eefeb6009e4f1c4dfa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a632fb419eb35f8eefeb6009e4f1c4dfa">operations_research::sat::TaskSet::TaskSet</a></div><div class="ttdeci">TaskSet(int num_tasks)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00058">disjunctive.h:58</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a7e3986de45625c55b092944d4cd9e547"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a7e3986de45625c55b092944d4cd9e547">operations_research::sat::TaskSet::AddShiftedStartMinEntry</a></div><div class="ttdeci">void AddShiftedStartMinEntry(const SchedulingConstraintHelper &helper, int t)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00178">disjunctive.cc:178</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a95dc40a61faa48e7996a4c139a9d119d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a95dc40a61faa48e7996a4c139a9d119d">operations_research::sat::TaskSet::ComputeEndMin</a></div><div class="ttdeci">IntegerValue ComputeEndMin() const</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00204">disjunctive.cc:204</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_a98c223e2c82a01f67cd71dd4eca70b70"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#a98c223e2c82a01f67cd71dd4eca70b70">operations_research::sat::TaskSet::AddEntry</a></div><div class="ttdeci">void AddEntry(const Entry &e)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00163">disjunctive.cc:163</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_aa71d36872f416feaa853788a7a7a7ef8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#aa71d36872f416feaa853788a7a7a7ef8">operations_research::sat::TaskSet::Clear</a></div><div class="ttdeci">void Clear()</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00070">disjunctive.h:70</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_ab1073196aabdb8a939860e16e9f8b505"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#ab1073196aabdb8a939860e16e9f8b505">operations_research::sat::TaskSet::SortedTasks</a></div><div class="ttdeci">const std::vector< Entry > & SortedTasks() const</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00119">disjunctive.h:119</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_task_set_html_ae424c3360277f457eba79fd25b4eed3b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_task_set.html#ae424c3360277f457eba79fd25b4eed3b">operations_research::sat::TaskSet::Sort</a></div><div class="ttdeci">void Sort()</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00090">disjunctive.h:90</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_theta_lambda_tree_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_theta_lambda_tree.html">operations_research::sat::ThetaLambdaTree</a></div><div class="ttdef"><b>Definition:</b> <a href="theta__tree_8h_source.html#l00104">theta_tree.h:104</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00273">gurobi_interface.cc:273</a></div></div>
|
|
<div class="ttc" id="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="ainteger_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="aintervals_8h_html"><div class="ttname"><a href="intervals_8h.html">intervals.h</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a73098886bd45684da9f3b3019c25ab93"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a73098886bd45684da9f3b3019c25ab93">operations_research::sat::DisjunctiveWithBooleanPrecedencesOnly</a></div><div class="ttdeci">std::function< void(Model *)> DisjunctiveWithBooleanPrecedencesOnly(const std::vector< IntervalVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00132">disjunctive.cc:132</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a89be28cfe3c4682b26fd153f9f133705"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a89be28cfe3c4682b26fd153f9f133705">operations_research::sat::DisjunctiveWithBooleanPrecedences</a></div><div class="ttdeci">std::function< void(Model *)> DisjunctiveWithBooleanPrecedences(const std::vector< IntervalVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00155">disjunctive.cc:155</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a93f88f728c3591678a7052bb92ee53d0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a93f88f728c3591678a7052bb92ee53d0">operations_research::sat::Disjunctive</a></div><div class="ttdeci">std::function< void(Model *)> Disjunctive(const std::vector< IntervalVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00030">disjunctive.cc:30</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="aprecedences_8h_html"><div class="ttname"><a href="precedences_8h.html">precedences.h</a></div></div>
|
|
<div class="ttc" id="asat_2model_8h_html"><div class="ttname"><a href="sat_2model_8h.html">model.h</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html">operations_research::sat::TaskSet::Entry</a></div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00060">disjunctive.h:60</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html_a427ef99d8b77e4cac03718a0a769f806"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a427ef99d8b77e4cac03718a0a769f806">operations_research::sat::TaskSet::Entry::task</a></div><div class="ttdeci">int task</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00061">disjunctive.h:61</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html_a65aeef300c5d89103a5b85a3191a9a20"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a65aeef300c5d89103a5b85a3191a9a20">operations_research::sat::TaskSet::Entry::size_min</a></div><div class="ttdeci">IntegerValue size_min</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00063">disjunctive.h:63</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html_a69317f47b95f04ae4154ca09be89998e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a69317f47b95f04ae4154ca09be89998e">operations_research::sat::TaskSet::Entry::operator<</a></div><div class="ttdeci">bool operator<(Entry other) const</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00066">disjunctive.h:66</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_set_1_1_entry_html_a79a74bd07a8525e729a55c74f7edf5a8"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_set_1_1_entry.html#a79a74bd07a8525e729a55c74f7edf5a8">operations_research::sat::TaskSet::Entry::start_min</a></div><div class="ttdeci">IntegerValue start_min</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8h_source.html#l00062">disjunctive.h:62</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_task_time_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_time.html">operations_research::sat::TaskTime</a></div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00160">intervals.h:160</a></div></div>
|
|
<div class="ttc" id="atheta__tree_8h_html"><div class="ttname"><a href="theta__tree_8h.html">theta_tree.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="disjunctive_8h.html">disjunctive.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|