216 lines
161 KiB
HTML
216 lines
161 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.15"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: intervals.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>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</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.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<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('intervals_8cc_source.html','');});
|
|
/* @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">intervals.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="intervals_8cc.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Copyright 2010-2021 Google LLC</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// you may not use this file except in compliance with the License.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// You may obtain a copy of the License at</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">//</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">//</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// See the License for the specific language governing permissions and</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// limitations under the License.</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> </div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include "<a class="code" href="intervals_8h.html">ortools/sat/intervals.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 <memory></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <string></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="sort_8h.html">ortools/util/sort.h</a>"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> </div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_intervals_repository.html#afe6da1694a8573f0272d01dc07d13ea4"> 26</a></span> IntervalVariable <a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#afe6da1694a8573f0272d01dc07d13ea4">IntervalsRepository::CreateInterval</a>(IntegerVariable start,</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  IntegerVariable end,</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  IntegerVariable size,</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  IntegerValue fixed_size,</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  LiteralIndex is_present) {</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#afe6da1694a8573f0272d01dc07d13ea4">CreateInterval</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>(start), <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>(end),</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  size == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  ? <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>(fixed_size)</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  : <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a>(size),</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  is_present, <span class="comment">/*add_linear_relation=*/</span><span class="keyword">true</span>);</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> }</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> </div><div class="line"><a name="l00038"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_intervals_repository.html#a32fb0c5981293b1d9ef825713aa6e26a"> 38</a></span> IntervalVariable <a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#afe6da1694a8573f0272d01dc07d13ea4">IntervalsRepository::CreateInterval</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> start,</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> end,</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> size,</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  LiteralIndex is_present,</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordtype">bool</span> add_linear_relation) {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="comment">// Create the interval.</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">const</span> IntervalVariable i(starts_.size());</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  starts_.push_back(start);</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  ends_.push_back(end);</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  sizes_.push_back(size);</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  is_present_.<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(is_present);</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  std::vector<Literal> enforcement_literals;</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">if</span> (is_present != <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>) {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  enforcement_literals.push_back(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(is_present));</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>  <span class="keywordflow">if</span> (add_linear_relation) {</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">LinearConstraintBuilder</a> builder(model_, IntegerValue(0), IntegerValue(0));</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#a558d12a34c3e461abaa1995ad5b193e6">Start</a>(i), IntegerValue(1));</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#aa57420b719d949fc4e8fec48c0c41dcc">Size</a>(i), IntegerValue(1));</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">AddTerm</a>(<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html#a43ea2047b7fedfd7d0c6d8d3183760e0">End</a>(i), IntegerValue(-1));</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953">LoadConditionalLinearConstraint</a>(enforcement_literals, builder.<a class="code" href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">Build</a>(),</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  model_);</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> </div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">return</span> i;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> }</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a245501f213ec65a6ec229e7c2766316c"> 67</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a245501f213ec65a6ec229e7c2766316c">SchedulingConstraintHelper::SchedulingConstraintHelper</a>(</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keyword">const</span> std::vector<IntervalVariable>& tasks, <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="l00069"></a><span class="lineno"> 69</span>  : trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()),</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  precedences_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>()) {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  starts_.clear();</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  ends_.clear();</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  minus_ends_.clear();</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  minus_starts_.clear();</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  sizes_.clear();</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  reason_for_presence_.clear();</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> </div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keyword">auto</span>* repository = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_intervals_repository.html">IntervalsRepository</a>>();</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntervalVariable i : tasks) {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keywordflow">if</span> (repository->IsOptional(i)) {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  reason_for_presence_.push_back(repository->PresenceLiteral(i).Index());</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  reason_for_presence_.push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>);</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>  sizes_.push_back(repository->Size(i));</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  starts_.push_back(repository->Start(i));</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  ends_.push_back(repository->End(i));</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  minus_starts_.push_back(repository->Start(i).Negated());</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  minus_ends_.push_back(repository->End(i).Negated());</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> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  InitSortedVectors();</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aa6ddfc5f8a8220c6e08fbe7568b41fcd">SynchronizeAndSetTimeDirection</a>(<span class="keyword">true</span>)) {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>>()->NotifyThatModelIsUnsat();</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4870e1d8502aa3cd24733735ce18452b"> 100</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a245501f213ec65a6ec229e7c2766316c">SchedulingConstraintHelper::SchedulingConstraintHelper</a>(<span class="keywordtype">int</span> num_tasks,</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>)</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  : trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()),</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  precedences_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html">PrecedencesPropagator</a>>()) {</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  starts_.resize(num_tasks);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>(), num_tasks);</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 109</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac1fe9b1f2b978c4283e42f12e586eb1e">SchedulingConstraintHelper::Propagate</a>() {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  recompute_all_cache_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a45321337f970685d9847db005c4b3de1"> 114</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a45321337f970685d9847db005c4b3de1">SchedulingConstraintHelper::IncrementalPropagate</a>(</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">const</span> std::vector<int>& watch_indices) {</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> t : watch_indices) recompute_cache_[t] = <span class="keyword">true</span>;</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a176d2c659864433ccd869b5fba8d57af"> 120</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a176d2c659864433ccd869b5fba8d57af">SchedulingConstraintHelper::SetLevel</a>(<span class="keywordtype">int</span> level) {</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="comment">// If there was an Untrail before, we need to refresh the cache so that</span></div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="comment">// we never have value from lower in the search tree.</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="comment">//</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// TODO(user): We could be smarter here, but then this is not visible in our</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// cpu_profile since we call many times IncrementalPropagate() for each new</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// decision, but just call Propagate() once after each Untrail().</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (level < previous_level_) {</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  recompute_all_cache_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  }</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  previous_level_ = level;</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> </div><div class="line"><a name="l00133"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6ee8ed57254aec3ae99d399bae5b3736"> 133</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6ee8ed57254aec3ae99d399bae5b3736">SchedulingConstraintHelper::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="l00134"></a><span class="lineno"> 134</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="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = starts_.size();</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ab2c396c33db5bd5eab32d398c3d55646">WatchIntegerVariable</a>(sizes_[t].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>, t);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ab2c396c33db5bd5eab32d398c3d55646">WatchIntegerVariable</a>(starts_[t].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>, t);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ab2c396c33db5bd5eab32d398c3d55646">WatchIntegerVariable</a>(ends_[t].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>, t);</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  }</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">SetPropagatorPriority</a>(<span class="keywordtype">id</span>, 0);</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="comment">// Note that it is important to register with the integer_trail_ so we are</span></div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  <span class="comment">// ALWAYS called before any propagator that depends on this helper.</span></div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ae517412fa6f592ccb7c8e0f1569ba983">RegisterReversibleClass</a>(<span class="keyword">this</span>);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="keywordtype">bool</span> SchedulingConstraintHelper::UpdateCachedValues(<span class="keywordtype">int</span> t) {</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  recompute_cache_[t] = <span class="keyword">false</span>;</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(t)) <span class="keywordflow">return</span> <span class="keyword">true</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>  IntegerValue smin = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(starts_[t]);</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  IntegerValue smax = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(starts_[t]);</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  IntegerValue emin = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(ends_[t]);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  IntegerValue emax = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(ends_[t]);</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>  <span class="comment">// We take the max for the corner case where the size of an optional interval</span></div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// is used elsewhere and has a domain with negative value.</span></div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="comment">//</span></div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// TODO(user): maybe we should just disallow size with a negative domain, but</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// is is harder to enforce if we have a linear expression for size.</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  IntegerValue dmin =</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(IntegerValue(0), integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(sizes_[t]));</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  IntegerValue dmax = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(sizes_[t]);</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span> </div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Detect first if we have a conflict using the relation start + size = end.</span></div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (dmax < 0) {</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8fa1473cee0250df5996ea074a0ddc7e">AddSizeMaxReason</a>(t, dmax);</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">PushTaskAbsence</a>(t);</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>  <span class="keywordflow">if</span> (smin + dmin - emax > 0) {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3dc35c00655b5b7a99fea52e432adf4b">AddStartMinReason</a>(t, smin);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a37d7d6ef38f2acb9f12940ec8f68283a">AddSizeMinReason</a>(t, dmin);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aca49afb19cf18dfc1ea50a7d0a36d961">AddEndMaxReason</a>(t, emax);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">PushTaskAbsence</a>(t);</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>  <span class="keywordflow">if</span> (smax + dmax - emin < 0) {</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">AddStartMaxReason</a>(t, smax);</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8fa1473cee0250df5996ea074a0ddc7e">AddSizeMaxReason</a>(t, dmax);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">AddEndMinReason</a>(t, emin);</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">PushTaskAbsence</a>(t);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  }</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Sometimes, for optional interval with non-optional bounds, this propagation</span></div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// give tighter bounds. We always consider the value assuming</span></div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <span class="comment">// the interval is present.</span></div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">//</span></div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="comment">// Note that this is also useful in case not everything was propagated. Note</span></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">// also that since there is no conflict, we reach the fix point in one pass.</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  smin = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(smin, emin - dmax);</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  smax = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(smax, emax - dmin);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  dmin = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(dmin, emin - smax);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  emin = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(emin, smin + dmin);</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  emax = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(emax, smax + dmax);</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  cached_start_min_[t] = smin;</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  cached_end_min_[t] = emin;</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  cached_negated_start_max_[t] = -smax;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  cached_negated_end_max_[t] = -emax;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  cached_size_min_[t] = dmin;</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span> </div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// Note that we use the cached value here for EndMin()/StartMax().</span></div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> IntegerValue new_shifted_start_min = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(t) - dmin;</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordflow">if</span> (new_shifted_start_min != cached_shifted_start_min_[t]) {</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  recompute_shifted_start_min_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  cached_shifted_start_min_[t] = new_shifted_start_min;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  }</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> IntegerValue new_negated_shifted_end_max = -(<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(t) + dmin);</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (new_negated_shifted_end_max != cached_negated_shifted_end_max_[t]) {</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  recompute_negated_shifted_end_max_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  cached_negated_shifted_end_max_[t] = new_negated_shifted_end_max;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  }</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div><div class="line"><a name="l00218"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5675b4cbb11b373fc6205fba2d4e0465"> 218</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5675b4cbb11b373fc6205fba2d4e0465">SchedulingConstraintHelper::ResetFromSubset</a>(</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>& other, absl::Span<const int> tasks) {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  current_time_direction_ = other.current_time_direction_;</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>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = tasks.size();</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  starts_.resize(num_tasks);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  ends_.resize(num_tasks);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  minus_ends_.resize(num_tasks);</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  minus_starts_.resize(num_tasks);</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  sizes_.resize(num_tasks);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  reason_for_presence_.resize(num_tasks);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_tasks; ++i) {</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> t = tasks[i];</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  starts_[i] = other.starts_[t];</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  ends_[i] = other.ends_[t];</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  minus_ends_[i] = other.minus_ends_[t];</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  minus_starts_[i] = other.minus_starts_[t];</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  sizes_[i] = other.sizes_[t];</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  reason_for_presence_[i] = other.reason_for_presence_[t];</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  InitSortedVectors();</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aa6ddfc5f8a8220c6e08fbe7568b41fcd">SynchronizeAndSetTimeDirection</a>(<span class="keyword">true</span>);</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> }</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span> </div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> <span class="keywordtype">void</span> SchedulingConstraintHelper::InitSortedVectors() {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = starts_.size();</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> </div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  recompute_all_cache_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  recompute_cache_.resize(num_tasks, <span class="keyword">true</span>);</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> </div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  cached_shifted_start_min_.resize(num_tasks);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  cached_negated_shifted_end_max_.resize(num_tasks);</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  cached_size_min_.resize(num_tasks);</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  cached_start_min_.resize(num_tasks);</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  cached_end_min_.resize(num_tasks);</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  cached_negated_start_max_.resize(num_tasks);</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  cached_negated_end_max_.resize(num_tasks);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  task_by_increasing_start_min_.resize(num_tasks);</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  task_by_increasing_end_min_.resize(num_tasks);</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  task_by_decreasing_start_max_.resize(num_tasks);</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  task_by_decreasing_end_max_.resize(num_tasks);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  task_by_increasing_shifted_start_min_.resize(num_tasks);</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  task_by_negated_shifted_end_max_.resize(num_tasks);</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  task_by_increasing_start_min_[t].task_index = t;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  task_by_increasing_end_min_[t].task_index = t;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  task_by_decreasing_start_max_[t].task_index = t;</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  task_by_decreasing_end_max_[t].task_index = t;</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  task_by_increasing_shifted_start_min_[t].task_index = t;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  task_by_negated_shifted_end_max_[t].task_index = t;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> </div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  recompute_shifted_start_min_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  recompute_negated_shifted_end_max_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> }</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c"> 276</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c">SchedulingConstraintHelper::SetTimeDirection</a>(<span class="keywordtype">bool</span> is_forward) {</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (current_time_direction_ != is_forward) {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  current_time_direction_ = is_forward;</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(starts_, minus_ends_);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(ends_, minus_starts_);</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(task_by_increasing_start_min_, task_by_decreasing_end_max_);</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(task_by_increasing_end_min_, task_by_decreasing_start_max_);</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(task_by_increasing_shifted_start_min_,</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  task_by_negated_shifted_end_max_);</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(cached_start_min_, cached_negated_end_max_);</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(cached_end_min_, cached_negated_start_max_);</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(cached_shifted_start_min_, cached_negated_shifted_end_max_);</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(recompute_shifted_start_min_, recompute_negated_shifted_end_max_);</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> }</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> </div><div class="line"><a name="l00295"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aa6ddfc5f8a8220c6e08fbe7568b41fcd"> 295</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aa6ddfc5f8a8220c6e08fbe7568b41fcd">SchedulingConstraintHelper::SynchronizeAndSetTimeDirection</a>(</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keywordtype">bool</span> is_forward) {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c">SetTimeDirection</a>(is_forward);</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> (recompute_all_cache_) {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < recompute_cache_.size(); ++t) {</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">if</span> (!UpdateCachedValues(t)) <span class="keywordflow">return</span> <span class="keyword">false</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">else</span> {</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < recompute_cache_.size(); ++t) {</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  <span class="keywordflow">if</span> (recompute_cache_[t])</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">if</span> (!UpdateCachedValues(t)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  }</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  recompute_all_cache_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="keyword">const</span> std::vector<TaskTime>&</div><div class="line"><a name="l00313"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3a35a6e84b9bd02b6842e3bdb7f0b3f2"> 313</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3a35a6e84b9bd02b6842e3bdb7f0b3f2">SchedulingConstraintHelper::TaskByIncreasingStartMin</a>() {</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>();</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_tasks; ++i) {</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>& ref = task_by_increasing_start_min_[i];</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">time</a> = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ae2db4f5bc477001abcb8987f30e6b22c">task_index</a>);</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <a class="code" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(task_by_increasing_start_min_.begin(),</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  task_by_increasing_start_min_.end());</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">return</span> task_by_increasing_start_min_;</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> </div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="keyword">const</span> std::vector<TaskTime>&</div><div class="line"><a name="l00325"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4d62ab6133b482aa6d670f4a8534681a"> 325</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4d62ab6133b482aa6d670f4a8534681a">SchedulingConstraintHelper::TaskByIncreasingEndMin</a>() {</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>();</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_tasks; ++i) {</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>& ref = task_by_increasing_end_min_[i];</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">time</a> = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ae2db4f5bc477001abcb8987f30e6b22c">task_index</a>);</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  }</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <a class="code" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(task_by_increasing_end_min_.begin(),</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  task_by_increasing_end_min_.end());</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">return</span> task_by_increasing_end_min_;</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span> }</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span> </div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span> <span class="keyword">const</span> std::vector<TaskTime>&</div><div class="line"><a name="l00337"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab63994ddbf7097199cebad7f31b4a8ab"> 337</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab63994ddbf7097199cebad7f31b4a8ab">SchedulingConstraintHelper::TaskByDecreasingStartMax</a>() {</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>();</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_tasks; ++i) {</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>& ref = task_by_decreasing_start_max_[i];</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">time</a> = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ae2db4f5bc477001abcb8987f30e6b22c">task_index</a>);</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  }</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <a class="code" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(task_by_decreasing_start_max_.begin(),</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  task_by_decreasing_start_max_.end(),</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  std::greater<TaskTime>());</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keywordflow">return</span> task_by_decreasing_start_max_;</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span> }</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> </div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> <span class="keyword">const</span> std::vector<TaskTime>&</div><div class="line"><a name="l00350"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a164da36570ca5032417fffe5e081bba3"> 350</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a164da36570ca5032417fffe5e081bba3">SchedulingConstraintHelper::TaskByDecreasingEndMax</a>() {</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>();</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_tasks; ++i) {</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>& ref = task_by_decreasing_end_max_[i];</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">time</a> = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ae2db4f5bc477001abcb8987f30e6b22c">task_index</a>);</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>  <a class="code" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(task_by_decreasing_end_max_.begin(),</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  task_by_decreasing_end_max_.end(), std::greater<TaskTime>());</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">return</span> task_by_decreasing_end_max_;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> }</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> </div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="keyword">const</span> std::vector<TaskTime>&</div><div class="line"><a name="l00362"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d"> 362</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d">SchedulingConstraintHelper::TaskByIncreasingShiftedStartMin</a>() {</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">if</span> (recompute_shifted_start_min_) {</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  recompute_shifted_start_min_ = <span class="keyword">false</span>;</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>();</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordtype">bool</span> is_sorted = <span class="keyword">true</span>;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  IntegerValue previous = <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>;</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_tasks; ++i) {</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <a class="code" href="structoperations__research_1_1sat_1_1_task_time.html">TaskTime</a>& ref = task_by_increasing_shifted_start_min_[i];</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">time</a> = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">ShiftedStartMin</a>(ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ae2db4f5bc477001abcb8987f30e6b22c">task_index</a>);</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  is_sorted = is_sorted && ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">time</a> >= previous;</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  previous = ref.<a class="code" href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">time</a>;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">if</span> (is_sorted) <span class="keywordflow">return</span> task_by_increasing_shifted_start_min_;</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <a class="code" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(task_by_increasing_shifted_start_min_.begin(),</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  task_by_increasing_shifted_start_min_.end());</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">return</span> task_by_increasing_shifted_start_min_;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> </div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment">// Produces a relaxed reason for StartMax(before) < EndMin(after).</span></div><div class="line"><a name="l00382"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa"> 382</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">SchedulingConstraintHelper::AddReasonForBeingBefore</a>(<span class="keywordtype">int</span> before,</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordtype">int</span> after) {</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  AddOtherReason(before);</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  AddOtherReason(after);</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> </div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  std::vector<IntegerVariable> vars;</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> </div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="comment">// Reason for StartMax(before).</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">const</span> IntegerValue smax_before = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(before);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">if</span> (smax_before >= integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(starts_[before])) {</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">if</span> (starts_[before].<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="l00393"></a><span class="lineno"> 393</span>  vars.push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(starts_[before].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  }</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">if</span> (ends_[before].<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="l00397"></a><span class="lineno"> 397</span>  vars.push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(ends_[before].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">if</span> (sizes_[before].<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="l00400"></a><span class="lineno"> 400</span>  vars.push_back(sizes_[before].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">// Reason for EndMin(after);</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keyword">const</span> IntegerValue emin_after = <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(after);</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">if</span> (emin_after <= integer_trail_-><a class="code" href="namespaceoperations__research_1_1sat.html#ae13e4169ae1934ab2b1c58af67d9fce3">LowerBound</a>(ends_[after])) {</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">if</span> (ends_[after].<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="l00408"></a><span class="lineno"> 408</span>  vars.push_back(ends_[after].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keywordflow">if</span> (starts_[after].<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="l00412"></a><span class="lineno"> 412</span>  vars.push_back(starts_[after].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  }</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">if</span> (sizes_[after].<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="l00415"></a><span class="lineno"> 415</span>  vars.push_back(sizes_[after].<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  }</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> </div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(smax_before, emin_after);</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keyword">const</span> IntegerValue slack = emin_after - smax_before - 1;</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa527950bda17efaeae8589c561d1b453">AppendRelaxedLinearReason</a>(</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  slack, std::vector<IntegerValue>(vars.size(), IntegerValue(1)), vars,</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  &integer_reason_);</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> }</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> </div><div class="line"><a name="l00426"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a15a86f414a12bf85e72bc7608bd3b786"> 426</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a15a86f414a12bf85e72bc7608bd3b786">SchedulingConstraintHelper::PushIntegerLiteral</a>(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> lit) {</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(other_helper_ == <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(lit, literal_reason_, integer_reason_);</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> }</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> </div><div class="line"><a name="l00431"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6ab90cf8345c7b4e9b1e1fb2da7793a2"> 431</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6ab90cf8345c7b4e9b1e1fb2da7793a2">SchedulingConstraintHelper::PushIntegerLiteralIfTaskPresent</a>(</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <span class="keywordtype">int</span> t, <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> lit) {</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(t)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  AddOtherReason(t);</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">ImportOtherReasons</a>();</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9fa7bdc81941d5eae85952db86867de0">IsOptional</a>(t)) {</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ad2f3825d33cbc805d2f490d324bd363c">ConditionalEnqueue</a>(</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac8a0cc4c1cca9aefa21788b096954f31">PresenceLiteral</a>(t), lit, &literal_reason_, &integer_reason_);</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  }</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(lit, literal_reason_, integer_reason_);</div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span> }</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> </div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> <span class="comment">// We also run directly the precedence propagator for this variable so that when</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="comment">// we push an interval start for example, we have a chance to push its end.</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> <span class="keywordtype">bool</span> SchedulingConstraintHelper::PushIntervalBound(<span class="keywordtype">int</span> t, <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> lit) {</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6ab90cf8345c7b4e9b1e1fb2da7793a2">PushIntegerLiteralIfTaskPresent</a>(t, lit)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(t)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">if</span> (!precedences_-><a class="code" href="classoperations__research_1_1sat_1_1_precedences_propagator.html#af3c64e10aa2bb2cc1d3615d800f7c71c">PropagateOutgoingArcs</a>(lit.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">var</a>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">if</span> (!UpdateCachedValues(t)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> }</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> </div><div class="line"><a name="l00453"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36"> 453</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36">SchedulingConstraintHelper::IncreaseStartMin</a>(<span class="keywordtype">int</span> t,</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  IntegerValue new_start_min) {</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">if</span> (starts_[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="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">if</span> (new_start_min > starts_[t].constant) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">PushTaskAbsence</a>(t);</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  }</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordflow">return</span> PushIntervalBound(t, starts_[t].<a class="code" href="namespaceoperations__research_1_1sat.html#a0dedef72c691d332e0e1cc092bc01bc8">GreaterOrEqual</a>(new_start_min));</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> }</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span> </div><div class="line"><a name="l00462"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af055cd3470994f4c8ce4847abe9a2ae2"> 462</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af055cd3470994f4c8ce4847abe9a2ae2">SchedulingConstraintHelper::DecreaseEndMax</a>(<span class="keywordtype">int</span> t,</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  IntegerValue new_end_max) {</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (ends_[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="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> (new_end_max < ends_[t].constant) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">PushTaskAbsence</a>(t);</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  }</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keywordflow">return</span> PushIntervalBound(t, ends_[t].<a class="code" href="namespaceoperations__research_1_1sat.html#a9b1f29e2e2079dc31e89749c9a33bc01">LowerOrEqual</a>(new_end_max));</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span> }</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> </div><div class="line"><a name="l00471"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa"> 471</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">SchedulingConstraintHelper::PushTaskAbsence</a>(<span class="keywordtype">int</span> t) {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(t)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9fa7bdc81941d5eae85952db86867de0">IsOptional</a>(t)) <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> </div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  AddOtherReason(t);</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span> </div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t)) {</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  literal_reason_.push_back(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(reason_for_presence_[t]).Negated());</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  }</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">ImportOtherReasons</a>();</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a79322fd8dff49ab2eab22c0570aba594">EnqueueLiteral</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(reason_for_presence_[t]).Negated(),</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  literal_reason_, integer_reason_);</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span> }</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> </div><div class="line"><a name="l00487"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab8603bd492cd4f0dc0df48dea2e691c5"> 487</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab8603bd492cd4f0dc0df48dea2e691c5">SchedulingConstraintHelper::PushTaskPresence</a>(<span class="keywordtype">int</span> t) {</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(reason_for_presence_[t], <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>);</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t));</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> </div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  AddOtherReason(t);</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(t)) {</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  literal_reason_.push_back(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(reason_for_presence_[t]));</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  }</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">ImportOtherReasons</a>();</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a79322fd8dff49ab2eab22c0570aba594">EnqueueLiteral</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(reason_for_presence_[t]),</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  literal_reason_, integer_reason_);</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span> }</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span> </div><div class="line"><a name="l00503"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22"> 503</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">SchedulingConstraintHelper::ReportConflict</a>() {</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">ImportOtherReasons</a>();</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(literal_reason_, integer_reason_);</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span> }</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> </div><div class="line"><a name="l00508"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804"> 508</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">SchedulingConstraintHelper::WatchAllTasks</a>(<span class="keywordtype">int</span> <span class="keywordtype">id</span>,</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher,</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordtype">bool</span> watch_start_max,</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordtype">bool</span> watch_end_max)<span class="keyword"> const </span>{</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_tasks = starts_.size();</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> t = 0; t < num_tasks; ++t) {</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">WatchLowerBound</a>(starts_[t], <span class="keywordtype">id</span>);</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">WatchLowerBound</a>(ends_[t], <span class="keywordtype">id</span>);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">WatchLowerBound</a>(sizes_[t], <span class="keywordtype">id</span>);</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">if</span> (watch_start_max) {</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">WatchUpperBound</a>(starts_[t], <span class="keywordtype">id</span>);</div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  }</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">if</span> (watch_end_max) {</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">WatchUpperBound</a>(ends_[t], <span class="keywordtype">id</span>);</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  }</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (!<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t) && !<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">IsAbsent</a>(t)) {</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">WatchLiteral</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(reason_for_presence_[t]), <span class="keywordtype">id</span>);</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  }</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  }</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> }</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span> </div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span> <span class="keywordtype">void</span> SchedulingConstraintHelper::AddOtherReason(<span class="keywordtype">int</span> t) {</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="keywordflow">if</span> (other_helper_ == <span class="keyword">nullptr</span> || already_added_to_other_reasons_[t]) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  already_added_to_other_reasons_[t] = <span class="keyword">true</span>;</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> mapped_t = map_to_other_helper_[t];</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  other_helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">AddStartMaxReason</a>(mapped_t, event_for_other_helper_);</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  other_helper_-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">AddEndMinReason</a>(mapped_t, event_for_other_helper_ + 1);</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span> }</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span> <span class="keywordtype">void</span> SchedulingConstraintHelper::ImportOtherReasons() {</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">if</span> (other_helper_ != <span class="keyword">nullptr</span>) ImportOtherReasons(*other_helper_);</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span> }</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span> </div><div class="line"><a name="l00541"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647"> 541</a></span> <span class="keywordtype">void</span> SchedulingConstraintHelper::ImportOtherReasons(</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>& other_helper) {</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  literal_reason_.insert(literal_reason_.end(),</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  other_helper.literal_reason_.begin(),</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  other_helper.literal_reason_.end());</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  integer_reason_.insert(integer_reason_.end(),</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  other_helper.integer_reason_.begin(),</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  other_helper.integer_reason_.end());</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span> }</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span> </div><div class="line"><a name="l00551"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a747c0efc6328c426805df876287111ef"> 551</a></span> std::string <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a747c0efc6328c426805df876287111ef">SchedulingConstraintHelper::TaskDebugString</a>(<span class="keywordtype">int</span> t)<span class="keyword"> const </span>{</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">return</span> absl::StrCat(<span class="stringliteral">"t="</span>, t, <span class="stringliteral">" is_present="</span>, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(t), <span class="stringliteral">" size=["</span>,</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(t).<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(), <span class="stringliteral">","</span>, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afa1aca9725da8adf5c56ea08e7636c32">SizeMax</a>(t).<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(), <span class="stringliteral">"]"</span>,</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="stringliteral">" start=["</span>, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(t).<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(), <span class="stringliteral">","</span>, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(t).<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(),</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="stringliteral">"]"</span>, <span class="stringliteral">" end=["</span>, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(t).<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(), <span class="stringliteral">","</span>, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(t).<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>(),</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="stringliteral">"]"</span>);</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span> }</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span> </div><div class="line"><a name="l00559"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8154381196aaa84918768c323f8401ba"> 559</a></span> IntegerValue <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8154381196aaa84918768c323f8401ba">SchedulingConstraintHelper::GetMinOverlap</a>(<span class="keywordtype">int</span> t,</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  IntegerValue start,</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  IntegerValue end)<span class="keyword"> const </span>{</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(end - start, <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(t)),</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(t) - start, end - <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(t)));</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span> }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span> </div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a245501f213ec65a6ec229e7c2766316c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a245501f213ec65a6ec229e7c2766316c">operations_research::sat::SchedulingConstraintHelper::SchedulingConstraintHelper</a></div><div class="ttdeci">SchedulingConstraintHelper(const std::vector< IntervalVariable > &tasks, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00067">intervals.cc:67</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00226">intervals.h:226</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00583">intervals.h:583</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a6ab90cf8345c7b4e9b1e1fb2da7793a2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6ab90cf8345c7b4e9b1e1fb2da7793a2">operations_research::sat::SchedulingConstraintHelper::PushIntegerLiteralIfTaskPresent</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool PushIntegerLiteralIfTaskPresent(int t, IntegerLiteral lit)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00431">intervals.cc:431</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00561">intervals.h:561</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a793092fb9f25552acabb89ee399bbd81"><div class="ttname"><a href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">operations_research::IncrementalSort</a></div><div class="ttdeci">void IncrementalSort(int max_comparisons, Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false)</div><div class="ttdef"><b>Definition:</b> <a href="sort_8h_source.html#l00046">sort.h:46</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html">operations_research::sat::IntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00167">integer.h:167</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00233">intervals.h:233</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_aa6ddfc5f8a8220c6e08fbe7568b41fcd"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aa6ddfc5f8a8220c6e08fbe7568b41fcd">operations_research::sat::SchedulingConstraintHelper::SynchronizeAndSetTimeDirection</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool SynchronizeAndSetTimeDirection(bool is_forward)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00295">intervals.cc:295</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::SchedulingConstraintHelper::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00109">intervals.cc:109</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a8e6fcd6ce93a128626dede9f9cc89348"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8e6fcd6ce93a128626dede9f9cc89348">operations_research::sat::SchedulingConstraintHelper::IsAbsent</a></div><div class="ttdeci">bool IsAbsent(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00483">intervals.h:483</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a15a86f414a12bf85e72bc7608bd3b786"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a15a86f414a12bf85e72bc7608bd3b786">operations_research::sat::SchedulingConstraintHelper::PushIntegerLiteral</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool PushIntegerLiteral(IntegerLiteral lit)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00426">intervals.cc:426</a></div></div>
|
|
<div class="ttc" id="classoperations__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="classoperations__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#l00350">intervals.cc:350</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="classoperations__research_1_1sat_1_1_integer_trail_html_aa527950bda17efaeae8589c561d1b453"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa527950bda17efaeae8589c561d1b453">operations_research::sat::IntegerTrail::AppendRelaxedLinearReason</a></div><div class="ttdeci">void AppendRelaxedLinearReason(IntegerValue slack, absl::Span< const IntegerValue > coeffs, absl::Span< const IntegerVariable > vars, std::vector< IntegerLiteral > *reason) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00846">integer.cc:846</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a747c0efc6328c426805df876287111ef"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a747c0efc6328c426805df876287111ef">operations_research::sat::SchedulingConstraintHelper::TaskDebugString</a></div><div class="ttdeci">std::string TaskDebugString(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00551">intervals.cc:551</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_afa1aca9725da8adf5c56ea08e7636c32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afa1aca9725da8adf5c56ea08e7636c32">operations_research::sat::SchedulingConstraintHelper::SizeMax</a></div><div class="ttdeci">IntegerValue SizeMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00227">intervals.h:227</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a6d55b5b9adc499095dd57dd0c2b6c7df"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">operations_research::sat::IntegerTrail::ReportConflict</a></div><div class="ttdeci">bool ReportConflict(absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00849">integer.h:849</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_intervals_repository_html_aa57420b719d949fc4e8fec48c0c41dcc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#aa57420b719d949fc4e8fec48c0c41dcc">operations_research::sat::IntervalsRepository::Size</a></div><div class="ttdeci">AffineExpression Size(IntervalVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00094">intervals.h:94</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01345">integer.h:1345</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ab8603bd492cd4f0dc0df48dea2e691c5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab8603bd492cd4f0dc0df48dea2e691c5">operations_research::sat::SchedulingConstraintHelper::PushTaskPresence</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool PushTaskPresence(int t)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00487">intervals.cc:487</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_adbfab9aa6e8f73dcff6e5f1d7d7debfa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">operations_research::sat::SchedulingConstraintHelper::AddReasonForBeingBefore</a></div><div class="ttdeci">void AddReasonForBeingBefore(int before, int after)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00382">intervals.cc:382</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00478">intervals.h:478</a></div></div>
|
|
<div class="ttc" id="gurobi__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="classoperations__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#l00508">intervals.cc:508</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_adb72b59458c581ae6e85295da4e1917d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adb72b59458c581ae6e85295da4e1917d">operations_research::sat::SchedulingConstraintHelper::TaskByIncreasingShiftedStartMin</a></div><div class="ttdeci">const std::vector< TaskTime > & TaskByIncreasingShiftedStartMin()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00362">intervals.cc:362</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9ce9e563527f073b9aac535e63b7f647"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">operations_research::sat::SchedulingConstraintHelper::ImportOtherReasons</a></div><div class="ttdeci">void ImportOtherReasons(const SchedulingConstraintHelper &other_helper)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00541">intervals.cc:541</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_ad65ddc0d04d71006a9ebe3b9dcfe2ce6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#ad65ddc0d04d71006a9ebe3b9dcfe2ce6">operations_research::sat::LinearConstraintBuilder::AddTerm</a></div><div class="ttdeci">void AddTerm(IntegerVariable var, IntegerValue coeff)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00025">sat/linear_constraint.cc:25</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00065">sat_base.h:65</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00453">intervals.cc:453</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">operations_research::sat::IntegerLiteral::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00203">integer.h:203</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l01153">integer.h:1153</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ae6aff7693fe8d422dedbc67f30621d4d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">operations_research::sat::SchedulingConstraintHelper::AddStartMaxReason</a></div><div class="ttdeci">void AddStartMaxReason(int t, IntegerValue upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00568">intervals.h:568</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a45321337f970685d9847db005c4b3de1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a45321337f970685d9847db005c4b3de1">operations_research::sat::SchedulingConstraintHelper::IncrementalPropagate</a></div><div class="ttdeci">bool IncrementalPropagate(const std::vector< int > &watch_indices) final</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00114">intervals.cc:114</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a78d1b48df2c7530fc020d37902ca59d2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">operations_research::sat::SchedulingConstraintHelper::AddEndMinReason</a></div><div class="ttdeci">void AddEndMinReason(int t, IntegerValue lower_bound)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00575">intervals.h:575</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a05e837bb93eeabbbd94e8f690dd59d32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">operations_research::sat::IntegerTrail::Enqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool Enqueue(IntegerLiteral i_lit, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01028">integer.cc:1028</a></div></div>
|
|
<div class="ttc" id="sort_8h_html"><div class="ttname"><a href="sort_8h.html">sort.h</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00488">intervals.h:488</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a9b1f29e2e2079dc31e89749c9a33bc01"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9b1f29e2e2079dc31e89749c9a33bc01">operations_research::sat::LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> LowerOrEqual(IntegerVariable v, int64_t ub)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01567">integer.h:1567</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_precedences_propagator_html_af3c64e10aa2bb2cc1d3615d800f7c71c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_precedences_propagator.html#af3c64e10aa2bb2cc1d3615d800f7c71c">operations_research::sat::PrecedencesPropagator::PropagateOutgoingArcs</a></div><div class="ttdeci">bool PropagateOutgoingArcs(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00096">precedences.cc:96</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l01430">integer.h:1430</a></div></div>
|
|
<div class="ttc" id="intervals_8h_html"><div class="ttname"><a href="intervals_8h.html">intervals.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_af055cd3470994f4c8ce4847abe9a2ae2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af055cd3470994f4c8ce4847abe9a2ae2">operations_research::sat::SchedulingConstraintHelper::DecreaseEndMax</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool DecreaseEndMax(int t, IntegerValue new_end_max)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00462">intervals.cc:462</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_intervals_repository_html_a43ea2047b7fedfd7d0c6d8d3183760e0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#a43ea2047b7fedfd7d0c6d8d3183760e0">operations_research::sat::IntervalsRepository::End</a></div><div class="ttdeci">AffineExpression End(IntervalVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00096">intervals.h:96</a></div></div>
|
|
<div class="ttc" id="structoperations__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#l00161">intervals.h:161</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a1ce92d1c5015cd62d1c4b64ee117d8aa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a1ce92d1c5015cd62d1c4b64ee117d8aa">operations_research::sat::SchedulingConstraintHelper::PushTaskAbsence</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool PushTaskAbsence(int t)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00471">intervals.cc:471</a></div></div>
|
|
<div class="ttc" id="classoperations__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="structoperations__research_1_1sat_1_1_task_time_html_ae2db4f5bc477001abcb8987f30e6b22c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_time.html#ae2db4f5bc477001abcb8987f30e6b22c">operations_research::sat::TaskTime::task_index</a></div><div class="ttdeci">int task_index</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00162">intervals.h:162</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0dedef72c691d332e0e1cc092bc01bc8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0dedef72c691d332e0e1cc092bc01bc8">operations_research::sat::GreaterOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> GreaterOrEqual(IntegerVariable v, int64_t lb)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01552">integer.h:1552</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00574">integer.h:574</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00234">sat_base.h:234</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_adc5598223a363c10d95c00395145bcc6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">operations_research::sat::GenericLiteralWatcher::SetPropagatorPriority</a></div><div class="ttdeci">void SetPropagatorPriority(int id, int priority)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l02019">integer.cc:2019</a></div></div>
|
|
<div class="ttc" id="classabsl_1_1_strong_vector_html_a9263000d449fdccb6cb70b303063e60b"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">absl::StrongVector::push_back</a></div><div class="ttdeci">void push_back(const value_type &x)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00158">strong_vector.h:158</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a79322fd8dff49ab2eab22c0570aba594"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a79322fd8dff49ab2eab22c0570aba594">operations_research::sat::IntegerTrail::EnqueueLiteral</a></div><div class="ttdeci">void EnqueueLiteral(Literal literal, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01142">integer.cc:1142</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00231">intervals.h:231</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_a8f6dd74a841475ccb390614d2b212170"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">operations_research::sat::GenericLiteralWatcher::WatchLiteral</a></div><div class="ttdeci">void WatchLiteral(Literal l, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01422">integer.h:1422</a></div></div>
|
|
<div class="ttc" id="structoperations__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#l00220">integer.h:220</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html">operations_research::sat::LinearConstraintBuilder</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00147">sat/linear_constraint.h:147</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a176d2c659864433ccd869b5fba8d57af"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a176d2c659864433ccd869b5fba8d57af">operations_research::sat::SchedulingConstraintHelper::SetLevel</a></div><div class="ttdeci">void SetLevel(int level) final</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00120">intervals.cc:120</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ad2f3825d33cbc805d2f490d324bd363c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ad2f3825d33cbc805d2f490d324bd363c">operations_research::sat::IntegerTrail::ConditionalEnqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool ConditionalEnqueue(Literal lit, IntegerLiteral i_lit, std::vector< Literal > *literal_reason, std::vector< IntegerLiteral > *integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01035">integer.cc:1035</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_intervals_repository_html_afe6da1694a8573f0272d01dc07d13ea4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#afe6da1694a8573f0272d01dc07d13ea4">operations_research::sat::IntervalsRepository::CreateInterval</a></div><div class="ttdeci">IntervalVariable CreateInterval(IntegerVariable start, IntegerVariable end, IntegerVariable size, IntegerValue fixed_size, LiteralIndex is_present)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00026">intervals.cc:26</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9fa7bdc81941d5eae85952db86867de0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9fa7bdc81941d5eae85952db86867de0">operations_research::sat::SchedulingConstraintHelper::IsOptional</a></div><div class="ttdeci">bool IsOptional(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00474">intervals.h:474</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00232">intervals.h:232</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9583bbea958febd24d92742c2f137d22"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">operations_research::sat::SchedulingConstraintHelper::ReportConflict</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool ReportConflict()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00503">intervals.cc:503</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aae43e784db06c0974ce59ebbe8dd2b22"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">operations_research::sat::NegationOf</a></div><div class="ttdeci">std::vector< IntegerVariable > NegationOf(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00029">integer.cc:29</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a8154381196aaa84918768c323f8401ba"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8154381196aaa84918768c323f8401ba">operations_research::sat::SchedulingConstraintHelper::GetMinOverlap</a></div><div class="ttdeci">IntegerValue GetMinOverlap(int t, IntegerValue start, IntegerValue end) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00559">intervals.cc:559</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00234">intervals.h:234</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ae517412fa6f592ccb7c8e0f1569ba983"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ae517412fa6f592ccb7c8e0f1569ba983">operations_research::sat::IntegerTrail::RegisterReversibleClass</a></div><div class="ttdeci">void RegisterReversibleClass(ReversibleInterface *rev)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00872">integer.h:872</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae13e4169ae1934ab2b1c58af67d9fce3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae13e4169ae1934ab2b1c58af67d9fce3">operations_research::sat::LowerBound</a></div><div class="ttdeci">std::function< int64_t(const Model &)> LowerBound(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01524">integer.h:1524</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00173">intervals.h:173</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00313">intervals.cc:313</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_linear_constraint_builder_html_a8ef32d79f50eb45bb9305c8b436cf6c4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_linear_constraint_builder.html#a8ef32d79f50eb45bb9305c8b436cf6c4">operations_research::sat::LinearConstraintBuilder::Build</a></div><div class="ttdeci">LinearConstraint Build()</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00154">sat/linear_constraint.cc:154</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00204">intervals.h:204</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_ab2c396c33db5bd5eab32d398c3d55646"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ab2c396c33db5bd5eab32d398c3d55646">operations_research::sat::GenericLiteralWatcher::WatchIntegerVariable</a></div><div class="ttdeci">void WatchIntegerVariable(IntegerVariable i, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01454">integer.h:1454</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l01996">integer.cc:1996</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01349">integer.h:1349</a></div></div>
|
|
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__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="namespaceoperations__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="classoperations__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#l01448">integer.h:1448</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a0d7780af676ab4fd1c57e62da9e03686"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">operations_research::sat::SchedulingConstraintHelper::ShiftedStartMin</a></div><div class="ttdeci">IntegerValue ShiftedStartMin(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00250">intervals.h:250</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_aeccc78486bd270a6f68f87f4d412ff2c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c">operations_research::sat::SchedulingConstraintHelper::SetTimeDirection</a></div><div class="ttdeci">void SetTimeDirection(bool is_forward)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00276">intervals.cc:276</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a2dbcb7017d468a17bdb30252af5c6c31"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">operations_research::sat::kNoLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kNoLiteralIndex(-1)</div></div>
|
|
<div class="ttc" id="expr__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="classoperations__research_1_1sat_1_1_intervals_repository_html_a558d12a34c3e461abaa1995ad5b193e6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_intervals_repository.html#a558d12a34c3e461abaa1995ad5b193e6">operations_research::sat::IntervalsRepository::Start</a></div><div class="ttdeci">AffineExpression Start(IntervalVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00095">intervals.h:95</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a5675b4cbb11b373fc6205fba2d4e0465"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5675b4cbb11b373fc6205fba2d4e0465">operations_research::sat::SchedulingConstraintHelper::ResetFromSubset</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool ResetFromSubset(const SchedulingConstraintHelper &other, absl::Span< const int > tasks)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00218">intervals.cc:218</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00325">intervals.cc:325</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00513">intervals.h:513</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ac8a0cc4c1cca9aefa21788b096954f31"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ac8a0cc4c1cca9aefa21788b096954f31">operations_research::sat::SchedulingConstraintHelper::PresenceLiteral</a></div><div class="ttdeci">Literal PresenceLiteral(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00339">intervals.h:339</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00047">intervals.h:47</a></div></div>
|
|
<div class="ttc" id="classoperations__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#l00337">intervals.cc:337</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_task_time_html_ab0a87862f63b7d6715386f80338ff3cb"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_task_time.html#ab0a87862f63b7d6715386f80338ff3cb">operations_research::sat::TaskTime::time</a></div><div class="ttdeci">IntegerValue time</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00163">intervals.h:163</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a4b4da650bfcb86c00bee1df0ab0cc953"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4b4da650bfcb86c00bee1df0ab0cc953">operations_research::sat::LoadConditionalLinearConstraint</a></div><div class="ttdeci">void LoadConditionalLinearConstraint(const absl::Span< const Literal > enforcement_literals, const LinearConstraint &cst, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00575">integer_expr.h:575</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::SchedulingConstraintHelper::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8cc_source.html#l00133">intervals.cc:133</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a8fa1473cee0250df5996ea074a0ddc7e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a8fa1473cee0250df5996ea074a0ddc7e">operations_research::sat::SchedulingConstraintHelper::AddSizeMaxReason</a></div><div class="ttdeci">void AddSizeMaxReason(int t, IntegerValue upper_bound)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00554">intervals.h:554</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</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="intervals_8cc.html">intervals.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.15 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|