203 lines
154 KiB
HTML
203 lines
154 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: diffn.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.2</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('sat_2diffn_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">sat/diffn.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="sat_2diffn_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="diffn_8h.html">ortools/sat/diffn.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 <cstdint></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <limits></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 "absl/container/flat_hash_map.h"</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "absl/strings/str_join.h"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="iterator__adaptors_8h.html">ortools/base/iterator_adaptors.h</a>"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="cumulative_8h.html">ortools/sat/cumulative.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="diffn__util_8h.html">ortools/sat/diffn_util.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="disjunctive_8h.html">ortools/sat/disjunctive.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="preprocessor">#include "<a class="code" href="intervals_8h.html">ortools/sat/intervals.h</a>"</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#include "<a class="code" href="theta__tree_8h.html">ortools/sat/theta_tree.h</a>"</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#include "<a class="code" href="sort_8h.html">ortools/util/sort.h</a>"</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="keyword">namespace </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"> 38</span> <span class="comment">// TODO(user): Use the faster variable only version if all expressions reduce</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// to a single variable?</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keywordtype">void</span> AddIsEqualToMinOf(IntegerVariable min_var,</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <span class="keyword">const</span> std::vector<AffineExpression>& exprs,</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  std::vector<LinearExpression> converted;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> AffineExpression& affine : exprs) {</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  LinearExpression e;</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  e.offset = affine.constant;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">if</span> (affine.var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  e.vars.push_back(affine.var);</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  e.coeffs.push_back(affine.coeff);</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  }</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  converted.push_back(e);</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  }</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  LinearExpression target;</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  target.vars.push_back(min_var);</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  target.coeffs.push_back(IntegerValue(1));</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#ab316e19c73976fdd6381a93d1458699f">IsEqualToMinOf</a>(target, converted));</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> }</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> </div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="keywordtype">void</span> AddIsEqualToMaxOf(IntegerVariable max_var,</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keyword">const</span> std::vector<AffineExpression>& exprs,</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  std::vector<LinearExpression> converted;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> AffineExpression& affine : exprs) {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  LinearExpression e;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  e.offset = affine.constant;</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (affine.var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  e.vars.push_back(affine.var);</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  e.coeffs.push_back(affine.coeff);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  }</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  converted.push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(e));</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  }</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  LinearExpression target;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  target.vars.push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(max_var));</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  target.coeffs.push_back(IntegerValue(1));</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#ab316e19c73976fdd6381a93d1458699f">IsEqualToMinOf</a>(target, converted));</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> }</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> </div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#adceead2704b0f70717a819957d97450f"> 80</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#adceead2704b0f70717a819957d97450f">AddCumulativeRelaxation</a>(<span class="keyword">const</span> std::vector<IntervalVariable>& x_intervals,</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* x,</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* y, <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="l00083"></a><span class="lineno"> 83</span>  int64_t min_starts = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>();</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  int64_t max_ends = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  std::vector<AffineExpression> sizes;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> box = 0; box < y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>(); ++box) {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  min_starts = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_starts, y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(box).value());</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  max_ends = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(max_ends, y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(box).value());</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  sizes.push_back(y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ade00ce69e73ccd8470ea0198961da58e">Sizes</a>()[box]);</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">const</span> IntegerVariable min_start_var =</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a9d8cd5de7be4a42157145228a43d177e">NewIntegerVariable</a>(min_starts, max_ends));</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  AddIsEqualToMinOf(min_start_var, y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a98d787780ea13b5862ccb1ca73067da4">Starts</a>(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">const</span> IntegerVariable max_end_var =</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a9d8cd5de7be4a42157145228a43d177e">NewIntegerVariable</a>(min_starts, max_ends));</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  AddIsEqualToMaxOf(max_end_var, y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">Ends</a>(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="comment">// (max_end - min_start) >= capacity.</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>(</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a9d8cd5de7be4a42157145228a43d177e">NewIntegerVariable</a>(0, <a class="code" href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">CapSub</a>(max_ends, min_starts))));</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">const</span> std::vector<int64_t> coeffs = {-<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>.coeff.value(), -1, 1};</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#af68f789cce73e17fbe614888479c3f0d">WeightedSumGreaterOrEqual</a>({<a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>.var, min_start_var, max_end_var},</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  coeffs, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>.constant.value()));</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>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#ac6a1be9a6c43165f51a69d15c90d7567">Cumulative</a>(x_intervals, sizes, <a class="code" href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a>, x));</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span> }</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> </div><div class="line"><a name="l00111"></a><span class="lineno"><a class="line" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088"> 111</a></span> <span class="preprocessor">#define RETURN_IF_FALSE(f) \</span></div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="preprocessor"> if (!(f)) return false;</span></div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> </div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#afd958c76a25040ab064f6cbca9b5aff4">NonOverlappingRectanglesEnergyPropagator::</a></div><div class="line"><a name="l00115"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#afd958c76a25040ab064f6cbca9b5aff4"> 115</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#afd958c76a25040ab064f6cbca9b5aff4"> ~NonOverlappingRectanglesEnergyPropagator</a>() {}</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 117</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">NonOverlappingRectanglesEnergyPropagator::Propagate</a>() {</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_boxes = x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>();</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> (!x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aa6ddfc5f8a8220c6e08fbe7568b41fcd">SynchronizeAndSetTimeDirection</a>(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (!y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aa6ddfc5f8a8220c6e08fbe7568b41fcd">SynchronizeAndSetTimeDirection</a>(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  active_boxes_.clear();</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  cached_energies_.resize(num_boxes);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  cached_rectangles_.resize(num_boxes);</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> box = 0; box < num_boxes; ++box) {</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  cached_energies_[box] = x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(box) * y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(box);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">if</span> (cached_energies_[box] == 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">if</span> (!x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(box) || !y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(box)) <span class="keywordflow">continue</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>  <span class="comment">// The code needs the size min to be larger or equal to the mandatory part</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="comment">// for it to works correctly. This is always enforced by the helper.</span></div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(box), x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(box) - x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(box));</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(box), y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(box) - y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(box));</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>& rectangle = cached_rectangles_[box];</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  rectangle.x_min = x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">ShiftedStartMin</a>(box);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  rectangle.x_max = x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5caf109ec436f43088925c00bb64794b">ShiftedEndMax</a>(box);</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  rectangle.y_min = y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a0d7780af676ab4fd1c57e62da9e03686">ShiftedStartMin</a>(box);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  rectangle.y_max = y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5caf109ec436f43088925c00bb64794b">ShiftedEndMax</a>(box);</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>  active_boxes_.push_back(box);</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> </div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  absl::Span<int> initial_boxes = <a class="code" href="namespaceoperations__research_1_1sat.html#ae5c5a34c633c8746d9caca8d79cf2727">FilterBoxesThatAreTooLarge</a>(</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  cached_rectangles_, cached_energies_, absl::MakeSpan(active_boxes_));</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="keywordflow">if</span> (initial_boxes.size() <= 1) <span class="keywordflow">return</span> <span class="keyword">true</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>  <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a> conflicting_rectangle;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  std::vector<absl::Span<int>> components =</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7">GetOverlappingRectangleComponents</a>(cached_rectangles_, initial_boxes);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">for</span> (absl::Span<int> boxes : components) {</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Computes the size on x and y past which there is no point doing any</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// energetic reasonning. We do a few iterations since as we filter one size,</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// we can potentially filter more on the transposed dimension.</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  threshold_x_ = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  threshold_y_ = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 3; ++i) {</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a98d09c7e8c4f5a15b569f5f14fa9937a">AnalyzeIntervals</a>(<span class="comment">/*transpose=*/</span>i == 1, boxes, cached_rectangles_,</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  cached_energies_, &threshold_x_, &threshold_y_,</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  &conflicting_rectangle)) {</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="keywordflow">return</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ac15dce45cd213b58af7a1fd6fc8a6ebc">ReportEnergyConflict</a>(conflicting_rectangle, boxes, &x_, &y_);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  }</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  boxes = <a class="code" href="namespaceoperations__research_1_1sat.html#a4e6ac3124f7b4484cb98c11d412f9f34">FilterBoxesAndRandomize</a>(cached_rectangles_, boxes, threshold_x_,</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  threshold_y_, *random_);</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (boxes.size() <= 1) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  }</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">if</span> (boxes.size() <= 1) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span> </div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// Now that we removed boxes with a large domain, resplit everything.</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="keyword">const</span> std::vector<absl::Span<int>> local_components =</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7">GetOverlappingRectangleComponents</a>(cached_rectangles_, boxes);</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">for</span> (absl::Span<int> local_boxes : local_components) {</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  IntegerValue total_sum_of_areas(0);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> box : local_boxes) {</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  total_sum_of_areas += cached_energies_[box];</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  }</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> box : local_boxes) {</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  FailWhenEnergyIsTooLarge(box, local_boxes, total_sum_of_areas));</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  }</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  }</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">return</span> <span class="keyword">true</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> </div><div class="line"><a name="l00187"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#a1868d977c2e9baed0f16c9ec71d6626e"> 187</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#a1868d977c2e9baed0f16c9ec71d6626e">NonOverlappingRectanglesEnergyPropagator::RegisterWith</a>(</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</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="l00190"></a><span class="lineno"> 190</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher, <span class="comment">/*watch_start_max=*/</span><span class="keyword">true</span>,</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="comment">/*watch_end_max=*/</span><span class="keyword">true</span>);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(<span class="keywordtype">id</span>, watcher, <span class="comment">/*watch_start_max=*/</span><span class="keyword">true</span>,</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="comment">/*watch_end_max=*/</span><span class="keyword">true</span>);</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="keywordflow">return</span> id;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="keywordtype">void</span> NonOverlappingRectanglesEnergyPropagator::SortBoxesIntoNeighbors(</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordtype">int</span> box, absl::Span<const int> local_boxes,</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  IntegerValue total_sum_of_areas) {</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>& box_dim = cached_rectangles_[box];</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> </div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  neighbors_.clear();</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> other_box : local_boxes) {</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="keywordflow">if</span> (other_box == box) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html">Rectangle</a>& other_dim = cached_rectangles_[other_box];</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keyword">const</span> IntegerValue span_x = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(box_dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a>, other_dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">x_max</a>) -</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(box_dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">x_min</a>, other_dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">x_min</a>);</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (span_x > threshold_x_) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keyword">const</span> IntegerValue span_y = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(box_dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a>, other_dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">y_max</a>) -</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(box_dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">y_min</a>, other_dim.<a class="code" href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">y_min</a>);</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keywordflow">if</span> (span_y > threshold_y_) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> IntegerValue bounding_area = span_x * span_y;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> (bounding_area < total_sum_of_areas) {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  neighbors_.push_back({other_box, bounding_area});</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  std::sort(neighbors_.begin(), neighbors_.end());</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span> }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> </div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="keywordtype">bool</span> NonOverlappingRectanglesEnergyPropagator::FailWhenEnergyIsTooLarge(</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordtype">int</span> box, absl::Span<const int> local_boxes,</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  IntegerValue total_sum_of_areas) {</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  SortBoxesIntoNeighbors(box, local_boxes, total_sum_of_areas);</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  Rectangle area = cached_rectangles_[box];</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  IntegerValue sum_of_areas = cached_energies_[box];</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keyword">const</span> <span class="keyword">auto</span> add_box_energy_in_rectangle_reason = [&](<span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad663c8b14dbad962a78333fbc02c7967">AddEnergyMinInIntervalReason</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, area.x_min, area.x_max);</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad663c8b14dbad962a78333fbc02c7967">AddEnergyMinInIntervalReason</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, area.y_min, area.y_max);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  };</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> </div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < neighbors_.size(); ++i) {</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> other_box = neighbors_[i].box;</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(cached_energies_[other_box], 0);</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>  <span class="comment">// Update Bounding box.</span></div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  area.TakeUnionWith(cached_rectangles_[other_box]);</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  <span class="keywordflow">if</span> (area.x_max - area.x_min > threshold_x_) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">if</span> (area.y_max - area.y_min > threshold_y_) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span> </div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="comment">// Update sum of areas.</span></div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  sum_of_areas += cached_energies_[other_box];</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keyword">const</span> IntegerValue bounding_area =</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  (area.x_max - area.x_min) * (area.y_max - area.y_min);</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (bounding_area >= total_sum_of_areas) {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">// Nothing will be deduced. Exiting.</span></div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> </div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">if</span> (sum_of_areas > bounding_area) {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  add_box_energy_in_rectangle_reason(box);</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j <= i; ++j) {</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  add_box_energy_in_rectangle_reason(neighbors_[j].box);</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">ImportOtherReasons</a>(y_);</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keywordflow">return</span> x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  }</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="keyword">namespace </span>{</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> </div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment">// We want for different propagation to reuse as much as possible the same</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="comment">// line. The idea behind this is to compute the 'canonical' line to use</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> <span class="comment">// when explaining that boxes overlap on the 'y_dim' dimension. We compute</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// the multiple of the biggest power of two that is common to all boxes.</span></div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> IntegerValue FindCanonicalValue(IntegerValue lb, IntegerValue ub) {</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (lb == ub) <span class="keywordflow">return</span> lb;</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">if</span> (lb <= 0 && ub > 0) <span class="keywordflow">return</span> IntegerValue(0);</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">if</span> (lb < 0 && ub <= 0) {</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">return</span> -FindCanonicalValue(-ub, -lb);</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  }</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  int64_t mask = 0;</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  IntegerValue candidate = ub;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> o = 0; o < 62; ++o) {</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  mask = 2 * mask + 1;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keyword">const</span> IntegerValue masked_ub(ub.value() & ~mask);</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">if</span> (masked_ub >= lb) {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  candidate = masked_ub;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  }</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  }</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keywordflow">return</span> candidate;</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> }</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span> </div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span> <span class="keywordtype">void</span> SplitDisjointBoxes(<span class="keyword">const</span> SchedulingConstraintHelper& x,</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  absl::Span<int> boxes,</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  std::vector<absl::Span<int>>* result) {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  result->clear();</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  std::sort(boxes.begin(), boxes.end(), [&x](<span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">return</span> x.ShiftedStartMin(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>) < x.ShiftedStartMin(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  });</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordtype">int</span> current_start = 0;</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  std::size_t current_length = 1;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  IntegerValue current_max_end = x.EndMax(boxes[0]);</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = 1; <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> < boxes.size(); ++<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) {</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> box = boxes[<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>];</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">if</span> (x.ShiftedStartMin(box) < current_max_end) {</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// Merge.</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  current_length++;</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  current_max_end = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(current_max_end, x.EndMax(box));</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">if</span> (current_length > 1) { <span class="comment">// Ignore lists of size 1.</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  result->emplace_back(&boxes[current_start], current_length);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  current_start = <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>;</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  current_length = 1;</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  current_max_end = x.EndMax(box);</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  }</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Push last span.</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">if</span> (current_length > 1) {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  result->emplace_back(&boxes[current_start], current_length);</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> }</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> </div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> } <span class="comment">// namespace</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> </div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// Note that x_ and y_ must be initialized with enough intervals when passed</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment">// to the disjunctive propagators.</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#ac7e9d0b5d7d04c0da381f5bde0a58b28">NonOverlappingRectanglesDisjunctivePropagator::</a></div><div class="line"><a name="l00332"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#ac7e9d0b5d7d04c0da381f5bde0a58b28"> 332</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#ac7e9d0b5d7d04c0da381f5bde0a58b28"> NonOverlappingRectanglesDisjunctivePropagator</a>(<span class="keywordtype">bool</span> strict,</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* x,</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* y,</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</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="l00336"></a><span class="lineno"> 336</span>  : global_x_(*x),</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  global_y_(*y),</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  x_(x->NumTasks(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  strict_(strict),</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  watcher_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>()),</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  overload_checker_(&x_),</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  forward_detectable_precedences_(true, &x_),</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  backward_detectable_precedences_(false, &x_),</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  forward_not_last_(true, &x_),</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  backward_not_last_(false, &x_),</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  forward_edge_finding_(true, &x_),</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  backward_edge_finding_(false, &x_) {}</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> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#a308c1ea7b7db006e93bc9ef2fb3729ad">NonOverlappingRectanglesDisjunctivePropagator::</a></div><div class="line"><a name="l00350"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#a308c1ea7b7db006e93bc9ef2fb3729ad"> 350</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#a308c1ea7b7db006e93bc9ef2fb3729ad"> ~NonOverlappingRectanglesDisjunctivePropagator</a>() {}</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00352"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#a1864313eb4309550f4eb511570cea011"> 352</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#a1864313eb4309550f4eb511570cea011">NonOverlappingRectanglesDisjunctivePropagator::Register</a>(</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordtype">int</span> fast_priority, <span class="keywordtype">int</span> slow_priority) {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  fast_id_ = 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="l00355"></a><span class="lineno"> 355</span>  watcher_-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">SetPropagatorPriority</a>(fast_id_, fast_priority);</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(fast_id_, watcher_);</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(fast_id_, watcher_);</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> </div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="comment">// This propagator is the one making sure our propagation is complete, so</span></div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="comment">// we do need to make sure it is called again if it modified some bounds.</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  watcher_-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(fast_id_);</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span> </div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> slow_id = 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="l00364"></a><span class="lineno"> 364</span>  watcher_-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">SetPropagatorPriority</a>(slow_id, slow_priority);</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(slow_id, watcher_);</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a3f981878c21fbe2f41a2daf010c93804">WatchAllTasks</a>(slow_id, watcher_);</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span> }</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> <span class="keywordtype">bool</span> NonOverlappingRectanglesDisjunctivePropagator::</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  FindBoxesThatMustOverlapAHorizontalLineAndPropagate(</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordtype">bool</span> fast_propagation, <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>& x,</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html">SchedulingConstraintHelper</a>* y) {</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="comment">// Note that since we only push bounds on x, we cache the value for y just</span></div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="comment">// once.</span></div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">if</span> (!y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aa6ddfc5f8a8220c6e08fbe7568b41fcd">SynchronizeAndSetTimeDirection</a>(<span class="keyword">true</span>)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> </div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">// Compute relevant boxes, the one with a mandatory part of y. Because we will</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">// need to sort it this way, we consider them by increasing start max.</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  indexed_intervals_.clear();</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keyword">const</span> std::vector<TaskTime>& temp = y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab63994ddbf7097199cebad7f31b4a8ab">TaskByDecreasingStartMax</a>();</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = temp.size(); --i >= 0;) {</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> box = temp[i].task_index;</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">if</span> (!strict_ && (x.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(box) == 0 || y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#afdbd968230d01fa0e91bc15b6f5994e3">SizeMin</a>(box) == 0)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// Ignore a box if its x interval and its y interval are not present at</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">// the same time.</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">if</span> (!x.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(box) || !y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(box)) <span class="keywordflow">continue</span>;</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="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> = temp[i].time;</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">const</span> IntegerValue <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a> = y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(box);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">if</span> (<a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a> < <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>) {</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  indexed_intervals_.push_back({box, <a class="code" href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a>, <a class="code" href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a>});</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  }</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> </div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// Less than 2 boxes, no propagation.</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">if</span> (indexed_intervals_.size() < 2) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a74b637c7690aa3cd4c80157b44c5e5ac">ConstructOverlappingSets</a>(<span class="comment">/*already_sorted=*/</span><span class="keyword">true</span>, &indexed_intervals_,</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  &events_overlapping_boxes_);</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span> </div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// Split lists of boxes into disjoint set of boxes (w.r.t. overlap).</span></div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  boxes_to_propagate_.clear();</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  reduced_overlapping_boxes_.clear();</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < events_overlapping_boxes_.size(); ++i) {</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  SplitDisjointBoxes(x, absl::MakeSpan(events_overlapping_boxes_[i]),</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  &disjoint_boxes_);</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">for</span> (absl::Span<int> sub_boxes : disjoint_boxes_) {</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="comment">// Boxes are sorted in a stable manner in the Split method.</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="comment">// Note that we do not use reduced_overlapping_boxes_ directly so that</span></div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="comment">// the order of iteration is deterministic.</span></div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  <span class="keyword">const</span> <span class="keyword">auto</span>& insertion = reduced_overlapping_boxes_.insert(sub_boxes);</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">if</span> (insertion.second) boxes_to_propagate_.push_back(sub_boxes);</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>  }</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> </div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="comment">// And finally propagate.</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="comment">//</span></div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="comment">// TODO(user): Sorting of boxes seems influential on the performance. Test.</span></div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> absl::Span<const int> boxes : boxes_to_propagate_) {</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="comment">// The case of two boxes should be taken care of during "fast" propagation,</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="comment">// so we can skip it here.</span></div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">if</span> (!fast_propagation && boxes.size() <= 2) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a45166c458e2abe6b33a70184c751d0e3">ClearOtherHelper</a>();</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">if</span> (!x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5675b4cbb11b373fc6205fba2d4e0465">ResetFromSubset</a>(x, boxes)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> </div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="comment">// Collect the common overlapping coordinates of all boxes.</span></div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  IntegerValue lb(<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>());</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  IntegerValue ub(<a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::numeric_limits<int64_t>::max</a>());</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> : boxes) {</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  lb = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(lb, y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>));</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  ub = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(ub, y-><a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>) - 1);</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  }</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(lb, ub);</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> </div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// We want for different propagation to reuse as much as possible the same</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// line. The idea behind this is to compute the 'canonical' line to use</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// when explaining that boxes overlap on the 'y_dim' dimension. We compute</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="comment">// the multiple of the biggest power of two that is common to all boxes.</span></div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">//</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">// TODO(user): We should scan the integer trail to find the oldest</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// non-empty common interval. Then we can pick the canonical value within</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="comment">// it.</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">const</span> IntegerValue line_to_use_for_reason = FindCanonicalValue(lb, ub);</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span> </div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="comment">// Setup x_dim for propagation.</span></div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9f4fcdd8cb1e6d59aac13d9aa5e6341c">SetOtherHelper</a>(y, boxes, line_to_use_for_reason);</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">if</span> (fast_propagation) {</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">if</span> (x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>() == 2) {</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// In that case, we can use simpler algorithms.</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// Note that this case happens frequently (~30% of all calls to this</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// method according to our tests).</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(PropagateTwoBoxes());</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(overload_checker_.<a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>());</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(forward_detectable_precedences_.<a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>());</div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(backward_detectable_precedences_.<a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>());</div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  }</div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>(), 2);</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(forward_not_last_.<a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>());</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(backward_not_last_.<a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>());</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(backward_edge_finding_.<a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>());</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(forward_edge_finding_.<a class="code" href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>());</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</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> </div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">return</span> <span class="keyword">true</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"> 471</span> </div><div class="line"><a name="l00472"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 472</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">NonOverlappingRectanglesDisjunctivePropagator::Propagate</a>() {</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c">SetTimeDirection</a>(<span class="keyword">true</span>);</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#aeccc78486bd270a6f68f87f4d412ff2c">SetTimeDirection</a>(<span class="keyword">true</span>);</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> </div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="comment">// Note that the code assumes that this was registered twice in fast and slow</span></div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// mode. So we will not redo some propagation in slow mode that was already</span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// done by the fast mode.</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> fast_propagation = watcher_-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a213ed4b3d803f4f95790931abfe06d77">GetCurrentId</a>() == fast_id_;</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(FindBoxesThatMustOverlapAHorizontalLineAndPropagate(</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  fast_propagation, global_x_, &global_y_));</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> </div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="comment">// We can actually swap dimensions to propagate vertically.</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(FindBoxesThatMustOverlapAHorizontalLineAndPropagate(</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  fast_propagation, global_y_, &global_x_));</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span> </div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">// If two boxes must overlap but do not have a mandatory line/column that</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="comment">// crosses both of them, then the code above do not see it. So we manually</span></div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="comment">// propagate this case.</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="comment">//</span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="comment">// TODO(user): Since we are at it, do more propagation even if no conflict?</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="comment">// This rarely propagate, so disabled for now. Investigate if it is worth</span></div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// it.</span></div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">if</span> (<span class="comment">/*DISABLES CODE*/</span> (<span class="keyword">false</span>) && watcher_-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a213ed4b3d803f4f95790931abfe06d77">GetCurrentId</a>() == fast_id_) {</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_boxes = global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad9b4a962b743e358f3a7c4b2279f99c8">NumTasks</a>();</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> box1 = 0; box1 < num_boxes; ++box1) {</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">if</span> (!global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(box1)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> box2 = box1 + 1; box2 < num_boxes; ++box2) {</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keywordflow">if</span> (!global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a58ca51a90e49e887146f760ba5eb6520">IsPresent</a>(box2)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">if</span> (global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(box1) <= global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(box2)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keywordflow">if</span> (global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(box2) <= global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(box1)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(box1) <= global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(box2)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">if</span> (global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(box2) <= global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(box1)) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span> </div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// X and Y must overlap. This is a conflict.</span></div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(box1);</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(box2);</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(box1, box2);</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(box2, box1);</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(box1);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(box2);</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(box1, box2);</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  global_y_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(box2, box1);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9ce9e563527f073b9aac535e63b7f647">ImportOtherReasons</a>(global_y_);</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keywordflow">return</span> global_x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div><div class="line"><a name="l00518"></a><span class="lineno"> 518</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>  }</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span> </div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> }</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> </div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment">// Specialized propagation on only two boxes that must intersect with the</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment">// given y_line_for_reason.</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="keywordtype">bool</span> NonOverlappingRectanglesDisjunctivePropagator::PropagateTwoBoxes() {</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="comment">// For each direction and each order, we test if the boxes can be disjoint.</span></div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> state =</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  (x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(0) <= x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(1)) + 2 * (x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(1) <= x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(0));</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span> </div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  <span class="keyword">const</span> <span class="keyword">auto</span> left_box_before_right_box = [<span class="keyword">this</span>](<span class="keywordtype">int</span> left, <span class="keywordtype">int</span> right) {</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// left box pushes right box.</span></div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keyword">const</span> IntegerValue left_end_min = x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a11b6d6eef1159c1801cfa033778f09db">EndMin</a>(left);</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keywordflow">if</span> (left_end_min > x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ab3a2a28d08246d8f3432caa1a27811b8">StartMin</a>(right)) {</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(left);</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(right);</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(left, right);</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a78d1b48df2c7530fc020d37902ca59d2">AddEndMinReason</a>(left, left_end_min);</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a7cf01605afaa07af160e933df8433e36">IncreaseStartMin</a>(right, left_end_min));</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  }</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span> </div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="comment">// right box pushes left box.</span></div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">const</span> IntegerValue right_start_max = x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad8f69698386f241297b78589c1f57c3e">StartMax</a>(right);</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">if</span> (right_start_max < x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9125ec8126e6035eacce8a5eb52b45c5">EndMax</a>(left)) {</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(left);</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(right);</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(left, right);</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ae6aff7693fe8d422dedbc67f30621d4d">AddStartMaxReason</a>(right, right_start_max);</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <a class="code" href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a>(x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af055cd3470994f4c8ce4847abe9a2ae2">DecreaseEndMax</a>(left, right_start_max));</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span> </div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</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>  <span class="keywordflow">switch</span> (state) {</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <span class="keywordflow">case</span> 0: { <span class="comment">// Conflict.</span></div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#af9c040735b02626e2c373e820d4b6416">ClearReason</a>();</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(0);</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">AddPresenceReason</a>(1);</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(0, 1);</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#adbfab9aa6e8f73dcff6e5f1d7d7debfa">AddReasonForBeingBefore</a>(1, 0);</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keywordflow">return</span> x_.<a class="code" href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9583bbea958febd24d92742c2f137d22">ReportConflict</a>();</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  }</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordflow">case</span> 1: { <span class="comment">// b1 is left of b2.</span></div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="keywordflow">return</span> left_box_before_right_box(0, 1);</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  }</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="keywordflow">case</span> 2: { <span class="comment">// b2 is left of b1.</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordflow">return</span> left_box_before_right_box(1, 0);</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  }</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keywordflow">default</span>: { <span class="comment">// Nothing to deduce.</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  }</div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  }</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> }</div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> </div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="preprocessor">#undef RETURN_IF_FALSE</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> } <span class="comment">// namespace operations_research</span></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="namespaceoperations__research_html_a4a43d435871f16c321861fa5de32df82"><div class="ttname"><a href="namespaceoperations__research.html#a4a43d435871f16c321861fa5de32df82">operations_research::CapSub</a></div><div class="ttdeci">int64_t CapSub(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00158">saturated_arithmetic.h:158</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a45166c458e2abe6b33a70184c751d0e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a45166c458e2abe6b33a70184c751d0e3">operations_research::sat::SchedulingConstraintHelper::ClearOtherHelper</a></div><div class="ttdeci">void ClearOtherHelper()</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00364">intervals.h:364</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_disjunctive_overload_checker_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_overload_checker.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveOverloadChecker::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00458">disjunctive.cc:458</a></div></div>
|
|
<div class="ttc" id="stl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</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="disjunctive_8h_html"><div class="ttname"><a href="disjunctive_8h.html">disjunctive.h</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00707">base/logging.h:707</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a4e6ac3124f7b4484cb98c11d412f9f34"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4e6ac3124f7b4484cb98c11d412f9f34">operations_research::sat::FilterBoxesAndRandomize</a></div><div class="ttdeci">absl::Span< int > FilterBoxesAndRandomize(const std::vector< Rectangle > &cached_rectangles, absl::Span< int > boxes, IntegerValue threshold_x, IntegerValue threshold_y, absl::BitGenRef random)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00303">diffn_util.cc:303</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a9f4fcdd8cb1e6d59aac13d9aa5e6341c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a9f4fcdd8cb1e6d59aac13d9aa5e6341c">operations_research::sat::SchedulingConstraintHelper::SetOtherHelper</a></div><div class="ttdeci">void SetOtherHelper(SchedulingConstraintHelper *other_helper, absl::Span< const int > map_to_other_helper, IntegerValue event)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00355">intervals.h:355</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::NonOverlappingRectanglesEnergyPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00117">sat/diffn.cc:117</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#l00274">gurobi_interface.cc:274</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_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_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_rectangle_html_ae39303b5b3149e1914834c36ad51fe8f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#ae39303b5b3149e1914834c36ad51fe8f">operations_research::sat::Rectangle::y_max</a></div><div class="ttdeci">IntegerValue y_max</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00033">diffn_util.h:33</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00895">base/logging.h:895</a></div></div>
|
|
<div class="ttc" id="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#l01221">integer.h:1221</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_disjunctive_detectable_precedences_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_detectable_precedences.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveDetectablePrecedences::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00641">disjunctive.cc:641</a></div></div>
|
|
<div class="ttc" id="iterator__adaptors_8h_html"><div class="ttname"><a href="iterator__adaptors_8h.html">iterator_adaptors.h</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a0cc9a3a200ee27bae9b9907d97b5718e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a0cc9a3a200ee27bae9b9907d97b5718e">operations_research::sat::Rectangle::x_max</a></div><div class="ttdeci">IntegerValue x_max</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00031">diffn_util.h:31</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a1227e67513602591fb959e35c9de66e8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">operations_research::sat::kMaxIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMaxIntegerValue(std::numeric_limits< IntegerValue::ValueType >::max() - 1)</div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_disjunctive_edge_finding_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_edge_finding.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveEdgeFinding::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l01174">disjunctive.cc:1174</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_adceead2704b0f70717a819957d97450f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#adceead2704b0f70717a819957d97450f">operations_research::sat::AddCumulativeRelaxation</a></div><div class="ttdeci">void AddCumulativeRelaxation(const std::vector< IntervalVariable > &x_intervals, SchedulingConstraintHelper *x, SchedulingConstraintHelper *y, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00080">sat/diffn.cc:80</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="constraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</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="cumulative_8h_html"><div class="ttname"><a href="cumulative_8h.html">cumulative.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_a9d8cd5de7be4a42157145228a43d177e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9d8cd5de7be4a42157145228a43d177e">operations_research::sat::NewIntegerVariable</a></div><div class="ttdeci">std::function< IntegerVariable(Model *)> NewIntegerVariable(int64_t lb, int64_t ub)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01612">integer.h:1612</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="namespaceoperations__research_1_1sat_html_ab316e19c73976fdd6381a93d1458699f"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab316e19c73976fdd6381a93d1458699f">operations_research::sat::IsEqualToMinOf</a></div><div class="ttdeci">std::function< void(Model *)> IsEqualToMinOf(IntegerVariable min_var, const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00737">integer_expr.h:737</a></div></div>
|
|
<div class="ttc" id="map__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="sched__constraints_8cc_html_a0d94a083ebe1975ac196611f87a4e0a2"><div class="ttname"><a href="sched__constraints_8cc.html#a0d94a083ebe1975ac196611f87a4e0a2">start_max</a></div><div class="ttdeci">Rev< int64_t > start_max</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00244">sched_constraints.cc:244</a></div></div>
|
|
<div class="ttc" id="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_a5caf109ec436f43088925c00bb64794b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a5caf109ec436f43088925c00bb64794b">operations_research::sat::SchedulingConstraintHelper::ShiftedEndMax</a></div><div class="ttdeci">IntegerValue ShiftedEndMax(int t) const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00256">intervals.h:256</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="structoperations__research_1_1sat_1_1_rectangle_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html">operations_research::sat::Rectangle</a></div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00029">diffn_util.h:29</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00704">base/logging.h:704</a></div></div>
|
|
<div class="ttc" id="sched__constraints_8cc_html_ad3f96403731a9e915dad229813609e74"><div class="ttname"><a href="sched__constraints_8cc.html#ad3f96403731a9e915dad229813609e74">end_min</a></div><div class="ttdeci">Rev< int64_t > end_min</div><div class="ttdef"><b>Definition:</b> <a href="sched__constraints_8cc_source.html#l00245">sched_constraints.cc:245</a></div></div>
|
|
<div class="ttc" id="sat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ad663c8b14dbad962a78333fbc02c7967"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ad663c8b14dbad962a78333fbc02c7967">operations_research::sat::SchedulingConstraintHelper::AddEnergyMinInIntervalReason</a></div><div class="ttdeci">void AddEnergyMinInIntervalReason(int t, IntegerValue min, IntegerValue max)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00600">intervals.h:600</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator_html_a1864313eb4309550f4eb511570cea011"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#a1864313eb4309550f4eb511570cea011">operations_research::sat::NonOverlappingRectanglesDisjunctivePropagator::Register</a></div><div class="ttdeci">void Register(int fast_priority, int slow_priority)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00352">sat/diffn.cc:352</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_disjunctive_not_last_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_disjunctive_not_last.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DisjunctiveNotLast::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="disjunctive_8cc_source.html#l00991">disjunctive.cc:991</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#l02018">integer.cc:2018</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_rectangle_html_a1f62ae069f3793df9ae18399ba6d052c"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a1f62ae069f3793df9ae18399ba6d052c">operations_research::sat::Rectangle::x_min</a></div><div class="ttdeci">IntegerValue x_min</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00030">diffn_util.h:30</a></div></div>
|
|
<div class="ttc" id="routing__flow_8cc_html_a2acb49f4df5288066c43610bede123ec"><div class="ttname"><a href="routing__flow_8cc.html#a2acb49f4df5288066c43610bede123ec">capacity</a></div><div class="ttdeci">int64_t capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00151">routing_flow.cc:151</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_a213ed4b3d803f4f95790931abfe06d77"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a213ed4b3d803f4f95790931abfe06d77">operations_research::sat::GenericLiteralWatcher::GetCurrentId</a></div><div class="ttdeci">int GetCurrentId() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01323">integer.h:1323</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a74b637c7690aa3cd4c80157b44c5e5ac"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a74b637c7690aa3cd4c80157b44c5e5ac">operations_research::sat::ConstructOverlappingSets</a></div><div class="ttdeci">void ConstructOverlappingSets(bool already_sorted, std::vector< IndexedInterval > *intervals, std::vector< std::vector< int >> *result)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00346">diffn_util.cc:346</a></div></div>
|
|
<div class="ttc" id="theta__tree_8h_html"><div class="ttname"><a href="theta__tree_8h.html">theta_tree.h</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="base_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00894">base/logging.h:894</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#l00227">integer.h:227</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a3e2516c0d3fc4991896c6a9bbead80e7"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a3e2516c0d3fc4991896c6a9bbead80e7">operations_research::sat::GetOverlappingRectangleComponents</a></div><div class="ttdeci">std::vector< absl::Span< int > > GetOverlappingRectangleComponents(const std::vector< Rectangle > &rectangles, absl::Span< int > active_rectangles)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00026">diffn_util.cc:26</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator_html_afd958c76a25040ab064f6cbca9b5aff4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#afd958c76a25040ab064f6cbca9b5aff4">operations_research::sat::NonOverlappingRectanglesEnergyPropagator::~NonOverlappingRectanglesEnergyPropagator</a></div><div class="ttdeci">~NonOverlappingRectanglesEnergyPropagator() override</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00115">sat/diffn.cc:115</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator_html_a1868d977c2e9baed0f16c9ec71d6626e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_energy_propagator.html#a1868d977c2e9baed0f16c9ec71d6626e">operations_research::sat::NonOverlappingRectanglesEnergyPropagator::RegisterWith</a></div><div class="ttdeci">int RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00187">sat/diffn.cc:187</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a98d09c7e8c4f5a15b569f5f14fa9937a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a98d09c7e8c4f5a15b569f5f14fa9937a">operations_research::sat::AnalyzeIntervals</a></div><div class="ttdeci">bool AnalyzeIntervals(bool transpose, absl::Span< const int > local_boxes, const std::vector< Rectangle > &rectangles, const std::vector< IntegerValue > &rectangle_energies, IntegerValue *x_threshold, IntegerValue *y_threshold, Rectangle *conflict)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00151">diffn_util.cc:151</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_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#l00030">integer.cc:30</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="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_affb6ad259bc1c6bd004308fb3b8a6b05"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#affb6ad259bc1c6bd004308fb3b8a6b05">operations_research::sat::SchedulingConstraintHelper::Ends</a></div><div class="ttdeci">const std::vector< AffineExpression > & Ends() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00337">intervals.h:337</a></div></div>
|
|
<div class="ttc" id="sat_2diffn_8cc_html_a73c06a952919ea45217c5a8ec59c4088"><div class="ttname"><a href="sat_2diffn_8cc.html#a73c06a952919ea45217c5a8ec59c4088">RETURN_IF_FALSE</a></div><div class="ttdeci">#define RETURN_IF_FALSE(f)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00111">sat/diffn.cc:111</a></div></div>
|
|
<div class="ttc" id="diffn_8h_html"><div class="ttname"><a href="diffn_8h.html">diffn.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ac15dce45cd213b58af7a1fd6fc8a6ebc"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac15dce45cd213b58af7a1fd6fc8a6ebc">operations_research::sat::ReportEnergyConflict</a></div><div class="ttdeci">bool ReportEnergyConflict(Rectangle bounding_box, absl::Span< const int > boxes, SchedulingConstraintHelper *x, SchedulingConstraintHelper *y)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00052">diffn_util.cc:52</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_a4ac5e628ca1613b614ccd82bfa785631"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a4ac5e628ca1613b614ccd82bfa785631">operations_research::sat::SchedulingConstraintHelper::AddPresenceReason</a></div><div class="ttdeci">void AddPresenceReason(int t)</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00497">intervals.h:497</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_a98d787780ea13b5862ccb1ca73067da4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#a98d787780ea13b5862ccb1ca73067da4">operations_research::sat::SchedulingConstraintHelper::Starts</a></div><div class="ttdeci">const std::vector< AffineExpression > & Starts() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00336">intervals.h:336</a></div></div>
|
|
<div class="ttc" id="diffn__util_8h_html"><div class="ttname"><a href="diffn__util_8h.html">diffn_util.h</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_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#l01995">integer.cc:1995</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator_html_ac7e9d0b5d7d04c0da381f5bde0a58b28"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#ac7e9d0b5d7d04c0da381f5bde0a58b28">operations_research::sat::NonOverlappingRectanglesDisjunctivePropagator::NonOverlappingRectanglesDisjunctivePropagator</a></div><div class="ttdeci">NonOverlappingRectanglesDisjunctivePropagator(bool strict, SchedulingConstraintHelper *x, SchedulingConstraintHelper *y, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00332">sat/diffn.cc:332</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_non_overlapping_rectangles_disjunctive_propagator_html_a308c1ea7b7db006e93bc9ef2fb3729ad"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#a308c1ea7b7db006e93bc9ef2fb3729ad">operations_research::sat::NonOverlappingRectanglesDisjunctivePropagator::~NonOverlappingRectanglesDisjunctivePropagator</a></div><div class="ttdeci">~NonOverlappingRectanglesDisjunctivePropagator() override</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00350">sat/diffn.cc:350</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae5c5a34c633c8746d9caca8d79cf2727"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae5c5a34c633c8746d9caca8d79cf2727">operations_research::sat::FilterBoxesThatAreTooLarge</a></div><div class="ttdeci">absl::Span< int > FilterBoxesThatAreTooLarge(const std::vector< Rectangle > &cached_rectangles, const std::vector< IntegerValue > &energies, absl::Span< int > boxes)</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8cc_source.html#l00319">diffn_util.cc:319</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="namespaceoperations__research_1_1sat_html_af68f789cce73e17fbe614888479c3f0d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#af68f789cce73e17fbe614888479c3f0d">operations_research::sat::WeightedSumGreaterOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> WeightedSumGreaterOrEqual(const std::vector< IntegerVariable > &vars, const VectorInt &coefficients, int64_t lower_bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00468">integer_expr.h:468</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="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_non_overlapping_rectangles_disjunctive_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_non_overlapping_rectangles_disjunctive_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::NonOverlappingRectanglesDisjunctivePropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="sat_2diffn_8cc_source.html#l00472">sat/diffn.cc:472</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_rectangle_html_a379a897decc0711464cb15e8d02fd095"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_rectangle.html#a379a897decc0711464cb15e8d02fd095">operations_research::sat::Rectangle::y_min</a></div><div class="ttdeci">IntegerValue y_min</div><div class="ttdef"><b>Definition:</b> <a href="diffn__util_8h_source.html#l00032">diffn_util.h:32</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ac6a1be9a6c43165f51a69d15c90d7567"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac6a1be9a6c43165f51a69d15c90d7567">operations_research::sat::Cumulative</a></div><div class="ttdeci">std::function< void(Model *)> Cumulative(const std::vector< IntervalVariable > &vars, const std::vector< AffineExpression > &demands, AffineExpression capacity, SchedulingConstraintHelper *helper=nullptr)</div><div class="ttdef"><b>Definition:</b> <a href="cumulative_8h_source.html#l00045">cumulative.h:45</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_scheduling_constraint_helper_html_ade00ce69e73ccd8470ea0198961da58e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_scheduling_constraint_helper.html#ade00ce69e73ccd8470ea0198961da58e">operations_research::sat::SchedulingConstraintHelper::Sizes</a></div><div class="ttdeci">const std::vector< AffineExpression > & Sizes() const</div><div class="ttdef"><b>Definition:</b> <a href="intervals_8h_source.html#l00338">intervals.h:338</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_aef66ce77e5b87afecf1c5696f44d4d1c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">operations_research::sat::GenericLiteralWatcher::NotifyThatPropagatorMayNotReachFixedPointInOnePass</a></div><div class="ttdeci">void NotifyThatPropagatorMayNotReachFixedPointInOnePass(int id)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l02025">integer.cc:2025</a></div></div>
|
|
<div class="ttc" id="constraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</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="sat_2diffn_8cc.html">diffn.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>
|