233 lines
335 KiB
HTML
233 lines
335 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: integer_expr.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('integer__expr_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">integer_expr.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="integer__expr_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="integer__expr_8h.html">ortools/sat/integer_expr.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 <memory></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "absl/container/flat_hash_map.h"</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "absl/memory/memory.h"</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</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="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="integer_8h.html">ortools/sat/integer.h</a>"</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="sat_2util_8h.html">ortools/sat/util.h</a>"</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="sorted__interval__list_8h.html">ortools/util/sorted_interval_list.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#include "<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>"</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#aec1aae1092c281971431aac37d923b60"> 32</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#aec1aae1092c281971431aac37d923b60">IntegerSumLE::IntegerSumLE</a>(<span class="keyword">const</span> std::vector<Literal>& enforcement_literals,</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keyword">const</span> std::vector<IntegerValue>& coeffs,</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  IntegerValue upper, <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="l00036"></a><span class="lineno"> 36</span>  : enforcement_literals_(enforcement_literals),</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  upper_bound_(upper),</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()),</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()),</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  time_limit_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()),</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  rev_integer_value_repository_(</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_rev_integer_value_repository.html">RevIntegerValueRepository</a>>()),</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  coeffs_(coeffs) {</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// TODO(user): deal with this corner case.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!vars_.empty());</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  max_variations_.resize(vars_.size());</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> </div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// Handle negative coefficients.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">if</span> (coeffs_[i] < 0) {</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  vars_[i] = <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars_[i]);</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  coeffs_[i] = -coeffs_[i];</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// Literal reason will only be used with the negation of enforcement_literals.</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : enforcement_literals) {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  literal_reason_.push_back(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated());</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// Initialize the reversible numbers.</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  rev_num_fixed_vars_ = 0;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  rev_lb_fixed_vars_ = IntegerValue(0);</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> }</div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> </div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="keywordtype">void</span> IntegerSumLE::FillIntegerReason() {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  integer_reason_.clear();</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  reason_coeffs_.clear();</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = vars_.size();</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = vars_[i];</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa4c7a44c63bb5d0d0401c9951db2daaa">VariableLowerBoundIsFromLevelZero</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  integer_reason_.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  reason_coeffs_.push_back(coeffs_[i]);</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> }</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="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a83404baa3e4ce3beaefa9a662f627655"> 80</a></span> std::pair<IntegerValue, IntegerValue> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a83404baa3e4ce3beaefa9a662f627655">IntegerSumLE::ConditionalLb</a>(</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> integer_literal, IntegerVariable target_var)<span class="keyword"> const </span>{</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// Recall that all our coefficient are positive.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordtype">bool</span> literal_var_present = <span class="keyword">false</span>;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keywordtype">bool</span> literal_var_present_positively = <span class="keyword">false</span>;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  IntegerValue var_coeff;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">bool</span> target_var_present_negatively = <span class="keyword">false</span>;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  IntegerValue target_coeff;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Compute the implied_lb excluding "- target_coeff * target".</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  IntegerValue implied_lb(-upper_bound_);</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars_.size(); ++i) {</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = vars_[i];</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">const</span> IntegerValue coeff = coeffs_[i];</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> == <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(target_var)) {</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  target_coeff = coeff;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  target_var_present_negatively = <span class="keyword">true</span>;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  implied_lb += coeff * lb;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) == <a class="code" href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">PositiveVariable</a>(integer_literal.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">var</a>)) {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  var_coeff = coeff;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  literal_var_present = <span class="keyword">true</span>;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  literal_var_present_positively = (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> == integer_literal.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">var</a>);</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  }</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  }</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">if</span> (!literal_var_present || !target_var_present_negatively) {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">return</span> {<a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">kMinIntegerValue</a>};</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> </div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// A literal means var >= bound.</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">if</span> (literal_var_present_positively) {</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// We have var_coeff * var in the expression, the literal is var >= bound.</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// When it is false, it is not relevant as implied_lb used var >= lb.</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">// When it is true, the diff is bound - lb.</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">const</span> IntegerValue diff = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  IntegerValue(0), integer_literal.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#aa130e84323404df15a838f6d07e9c775">bound</a> -</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(integer_literal.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">var</a>));</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> {<a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(implied_lb, target_coeff),</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(implied_lb + var_coeff * diff, target_coeff)};</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// We have var_coeff * -var in the expression, the literal is var >= bound.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="comment">// When it is true, it is not relevant as implied_lb used -var >= -ub.</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// And when it is false it means var < bound, so -var >= -bound + 1</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">const</span> IntegerValue diff = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  IntegerValue(0), integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(integer_literal.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">var</a>) -</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  integer_literal.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#aa130e84323404df15a838f6d07e9c775">bound</a> + 1);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">return</span> {<a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(implied_lb + var_coeff * diff, target_coeff),</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(implied_lb, target_coeff)};</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> }</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span> </div><div class="line"><a name="l00135"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 135</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#ac1fe9b1f2b978c4283e42f12e586eb1e">IntegerSumLE::Propagate</a>() {</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="comment">// Reified case: If any of the enforcement_literals are false, we ignore the</span></div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="comment">// constraint.</span></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordtype">int</span> num_unassigned_enforcement_literal = 0;</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  LiteralIndex unique_unnasigned_literal = <a class="code" href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">kNoLiteralIndex</a>;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : enforcement_literals_) {</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <span class="keywordflow">if</span> (!trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  ++num_unassigned_enforcement_literal;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  unique_unnasigned_literal = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index();</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">// Unfortunately, we can't propagate anything if we have more than one</span></div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="comment">// unassigned enforcement literal.</span></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">if</span> (num_unassigned_enforcement_literal > 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">// Save the current sum of fixed variables.</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="keywordflow">if</span> (is_registered_) {</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  rev_integer_value_repository_-><a class="code" href="classoperations__research_1_1_rev_repository.html#a32476d1fb09b1e06181ee07d30378b02">SaveState</a>(&rev_lb_fixed_vars_);</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  rev_num_fixed_vars_ = 0;</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  rev_lb_fixed_vars_ = 0;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// Compute the new lower bound and update the reversible structures.</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  IntegerValue lb_unfixed_vars = IntegerValue(0);</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = vars_.size();</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = rev_num_fixed_vars_; i < num_vars; ++i) {</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = vars_[i];</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keyword">const</span> IntegerValue coeff = coeffs_[i];</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">if</span> (lb != ub) {</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  max_variations_[i] = (ub - lb) * coeff;</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  lb_unfixed_vars += lb * coeff;</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// Update the set of fixed variables.</span></div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(vars_[i], vars_[rev_num_fixed_vars_]);</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(coeffs_[i], coeffs_[rev_num_fixed_vars_]);</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(max_variations_[i], max_variations_[rev_num_fixed_vars_]);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  rev_num_fixed_vars_++;</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  rev_lb_fixed_vars_ += lb * coeff;</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  }</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  time_limit_-><a class="code" href="classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9">AdvanceDeterministicTime</a>(</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  static_cast<double>(num_vars - rev_num_fixed_vars_) * 1e-9);</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>  <span class="comment">// Conflict?</span></div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keyword">const</span> IntegerValue slack =</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  upper_bound_ - (rev_lb_fixed_vars_ + lb_unfixed_vars);</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">if</span> (slack < 0) {</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  FillIntegerReason();</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa981297d0a648cd5c3fef40e2edebf8a">RelaxLinearReason</a>(-slack - 1, reason_coeffs_,</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  &integer_reason_);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">if</span> (num_unassigned_enforcement_literal == 1) {</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// Propagate the only non-true literal to false.</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> to_propagate = <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(unique_unnasigned_literal).<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  std::vector<Literal> tmp = literal_reason_;</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  tmp.erase(std::find(tmp.begin(), tmp.end(), to_propagate));</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a79322fd8dff49ab2eab22c0570aba594">EnqueueLiteral</a>(to_propagate, tmp, integer_reason_);</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  }</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(literal_reason_, integer_reason_);</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</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>  <span class="comment">// We can only propagate more if all the enforcement literals are true.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">if</span> (num_unassigned_enforcement_literal > 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// The lower bound of all the variables except one can be used to update the</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="comment">// upper bound of the last one.</span></div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = rev_num_fixed_vars_; i < num_vars; ++i) {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordflow">if</span> (max_variations_[i] <= slack) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = vars_[i];</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> IntegerValue coeff = coeffs_[i];</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> IntegerValue div = slack / coeff;</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keyword">const</span> IntegerValue new_ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) + div;</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keyword">const</span> IntegerValue propagation_slack = (div + 1) * coeff - slack - 1;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, new_ub),</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">/*lazy_reason=*/</span>[<span class="keyword">this</span>, propagation_slack](</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> i_lit, <span class="keywordtype">int</span> trail_index,</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  std::vector<Literal>* literal_reason,</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  std::vector<int>* trail_indices_reason) {</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  *literal_reason = literal_reason_;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  trail_indices_reason->clear();</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  reason_coeffs_.clear();</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  const int size = vars_.size();</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  for (int i = 0; i < size; ++i) {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  const IntegerVariable var = vars_[i];</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  if (PositiveVariable(var) == PositiveVariable(i_lit.var)) {</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  continue;</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  }</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  const int index =</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  integer_trail_->FindTrailIndexOfVarBefore(var, trail_index);</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  if (index >= 0) {</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  trail_indices_reason->push_back(index);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  if (propagation_slack > 0) {</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  reason_coeffs_.push_back(coeffs_[i]);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  }</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>  <a class="code" href="parser_8yy_8cc.html#a33e91cd0cef6786e9e3a27ac67707207">if</a> (propagation_slack > 0) {</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa981297d0a648cd5c3fef40e2edebf8a">RelaxLinearReason</a>(</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  propagation_slack, reason_coeffs_, trail_indices_reason);</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  }</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  })) {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  }</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  }</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> </div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> }</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span> </div><div class="line"><a name="l00251"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a79ee9e362d647b6d65cf6d38e3df216d"> 251</a></span> <span class="keywordtype">bool</span> IntegerSumLE::PropagateAtLevelZero() {</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="comment">// TODO(user): Deal with enforcements. It is just a bit of code to read the</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">// value of the literals at level zero.</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordflow">if</span> (!enforcement_literals_.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span> </div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">// Compute the new lower bound and update the reversible structures.</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  IntegerValue min_activity = IntegerValue(0);</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size();</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">const</span> IntegerValue coeff = coeffs_[i];</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_->LevelZeroLowerBound(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_->LevelZeroUpperBound(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  max_variations_[i] = (ub - lb) * coeff;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  min_activity += lb * coeff;</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>  time_limit_->AdvanceDeterministicTime(static_cast<double>(num_vars * 1e-9));</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">// Conflict?</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keyword">const</span> IntegerValue slack = upper_bound_ - min_activity;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">if</span> (slack < 0) {</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordflow">return</span> integer_trail_->ReportConflict({}, {});</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> </div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// The lower bound of all the variables except one can be used to update the</span></div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// upper bound of the last one.</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">if</span> (max_variations_[i] <= slack) <span class="keywordflow">continue</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>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i];</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keyword">const</span> IntegerValue coeff = coeffs_[i];</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keyword">const</span> IntegerValue div = slack / coeff;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keyword">const</span> IntegerValue new_ub = integer_trail_->LevelZeroLowerBound(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) + div;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordflow">if</span> (!integer_trail_->Enqueue(<a class="code" href="namespaceoperations__research_1_1sat.html#a9b1f29e2e2079dc31e89749c9a33bc01">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, new_ub), {},</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  {})) {</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  }</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>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> }</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a6ee8ed57254aec3ae99d399bae5b3736"> 293</a></span> <span class="keywordtype">void</span> IntegerSumLE::RegisterWith(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  is_registered_ = <span class="keyword">true</span>;</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</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="l00296"></a><span class="lineno"> 296</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable& <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">WatchLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : enforcement_literals_) {</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// We only watch the true direction.</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">//</span></div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// TODO(user): if there is more than one, maybe we should watch more to</span></div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="comment">// propagate a "conflict" as soon as only one is unassigned?</span></div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">WatchLiteral</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>), <span class="keywordtype">id</span>);</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">RegisterReversibleInt</a>(<span class="keywordtype">id</span>, &rev_num_fixed_vars_);</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> }</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> </div><div class="line"><a name="l00309"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_level_zero_equality.html#ab7be565ae45c1e7171a1975d0055c422"> 309</a></span> LevelZeroEquality::LevelZeroEquality(IntegerVariable target,</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">const</span> std::vector<IntegerValue>& coeffs,</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</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="l00313"></a><span class="lineno"> 313</span>  : target_(target),</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars),</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  coeffs_(coeffs),</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>()),</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  integer_trail_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()) {</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">auto</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="l00319"></a><span class="lineno"> 319</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="l00320"></a><span class="lineno"> 320</span>  watcher->SetPropagatorPriority(<span class="keywordtype">id</span>, 2);</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  watcher->WatchIntegerVariable(target, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable& <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars_) {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  watcher->WatchIntegerVariable(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  }</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> }</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">// TODO(user): We could go even further than just the GCD, and do more</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment">// arithmetic to tighten the target bounds. See for instance a problem like</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> <span class="comment">// ej.mps.gz that we don't solve easily, but has just 3 variables! the goal is</span></div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="comment">// to minimize X, given 31013 X - 41014 Y - 51015 Z = -31013 (all >=0, Y and Z</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span> <span class="comment">// bounded with high values). I know some MIP solvers have a basic linear</span></div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span> <span class="comment">// diophantine equation support.</span></div><div class="line"><a name="l00333"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_level_zero_equality.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 333</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_level_zero_equality.html#ac1fe9b1f2b978c4283e42f12e586eb1e">LevelZeroEquality::Propagate</a>() {</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">// TODO(user): Once the GCD is not 1, we could at any level make sure the</span></div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="comment">// objective is of the correct form. For now, this only happen in a few</span></div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// miplib problem that we close quickly, so I didn't add the extra code yet.</span></div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>() != 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span> </div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  int64_t gcd = 0;</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  IntegerValue sum(0);</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars_.size(); ++i) {</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">IsFixed</a>(vars_[i])) {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  sum += coeffs_[i] * integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(vars_[i]);</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  }</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  gcd = <a class="code" href="classoperations__research_1_1_math_util.html#ae94db7b2fa1d8e1b3c1dc6c683191609">MathUtil::GCD64</a>(gcd, std::abs(coeffs_[i].<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>()));</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">if</span> (gcd == 1) <span class="keywordflow">break</span>;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordflow">if</span> (gcd == 0) <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// All fixed.</span></div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span> </div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keywordflow">if</span> (gcd > gcd_) {</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <a class="code" href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a>(1) << <span class="stringliteral">"Objective gcd: "</span> << gcd;</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  }</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(gcd, gcd_);</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  gcd_ = IntegerValue(gcd);</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span> </div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(target_);</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keyword">const</span> IntegerValue lb_remainder = <a class="code" href="namespaceoperations__research_1_1sat.html#a83f714c395df7a814ed067125f567a0d">PositiveRemainder</a>(lb - sum, gcd_);</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">if</span> (lb_remainder != 0) {</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(target_, lb + gcd_ - lb_remainder),</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="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span> </div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(target_);</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keyword">const</span> IntegerValue ub_remainder =</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a83f714c395df7a814ed067125f567a0d">PositiveRemainder</a>(ub - sum, IntegerValue(gcd));</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span> (ub_remainder != 0) {</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(target_, ub - ub_remainder), {}, {}))</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span> </div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">return</span> <span class="keyword">true</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> </div><div class="line"><a name="l00378"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_min_propagator.html#a7adb3d82f96ba9699d1e1e1b399134ec"> 378</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html#a7adb3d82f96ba9699d1e1e1b399134ec">MinPropagator::MinPropagator</a>(<span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  IntegerVariable min_var,</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  : <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>(vars), min_var_(min_var), integer_trail_(integer_trail) {}</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00383"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_min_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 383</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">MinPropagator::Propagate</a>() {</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">if</span> (vars_.empty()) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> </div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">// Count the number of interval that are possible candidate for the min.</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="comment">// Only the intervals for which lb > current_min_ub cannot.</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html">IntegerLiteral</a> min_ub_literal =</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(min_var_);</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keyword">const</span> IntegerValue current_min_ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(min_var_);</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordtype">int</span> num_intervals_that_can_be_min = 0;</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordtype">int</span> last_possible_min_interval = 0;</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>  IntegerValue <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars_.size(); ++i) {</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(vars_[i]);</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>, lb);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">if</span> (lb <= current_min_ub) {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  ++num_intervals_that_can_be_min;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  last_possible_min_interval = i;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span> </div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="comment">// Propagation a)</span></div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">if</span> (<a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a> > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(min_var_)) {</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  integer_reason_.clear();</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars_) {</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  integer_reason_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>));</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(min_var_, <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a>),</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  {}, integer_reason_)) {</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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">// Propagation b)</span></div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">if</span> (num_intervals_that_can_be_min == 1) {</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  <span class="keyword">const</span> IntegerValue ub_of_only_candidate =</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(vars_[last_possible_min_interval]);</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">if</span> (current_min_ub < ub_of_only_candidate) {</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  integer_reason_.clear();</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="comment">// The reason is that all the other interval start after current_min_ub.</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// And that min_ub has its current value.</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  integer_reason_.push_back(min_ub_literal);</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars_) {</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> == <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_possible_min_interval]) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  integer_reason_.push_back(</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, current_min_ub + 1));</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  }</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[last_possible_min_interval],</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  current_min_ub),</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  {}, integer_reason_)) {</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  }</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  }</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  }</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> </div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="comment">// Conflict.</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="comment">//</span></div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="comment">// TODO(user): Not sure this code is useful since this will be detected</span></div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="comment">// by the fact that the [lb, ub] of the min is empty. It depends on the</span></div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="comment">// propagation order though, but probably the precedences propagator would</span></div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="comment">// propagate before this one. So change this to a CHECK?</span></div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordflow">if</span> (num_intervals_that_can_be_min == 0) {</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  integer_reason_.clear();</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="comment">// Almost the same as propagation b).</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  integer_reason_.push_back(min_ub_literal);</div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars_) {</div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  integer_reason_.push_back(</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, current_min_ub + 1));</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(integer_reason_);</div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  }</div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span> </div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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> </div><div class="line"><a name="l00461"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 461</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">MinPropagator::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</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="l00463"></a><span class="lineno"> 463</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable& <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars_) {</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">WatchLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">WatchUpperBound</a>(min_var_, <span class="keywordtype">id</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"><a class="line" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a3b562468ef8cc634a83e3ac7240a43da"> 469</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a3b562468ef8cc634a83e3ac7240a43da">LinMinPropagator::LinMinPropagator</a>(<span class="keyword">const</span> std::vector<LinearExpression>& exprs,</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  IntegerVariable min_var, <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="l00471"></a><span class="lineno"> 471</span>  : exprs_(exprs),</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  min_var_(min_var),</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  model_(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>),</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  integer_trail_(model_->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>()) {}</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="keywordtype">bool</span> LinMinPropagator::PropagateLinearUpperBound(</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">const</span> std::vector<IntegerValue>& coeffs, <span class="keyword">const</span> IntegerValue <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a>) {</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  IntegerValue sum_lb = IntegerValue(0);</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_vars = vars.size();</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  std::vector<IntegerValue> max_variations;</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = vars[i];</div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="keyword">const</span> IntegerValue coeff = coeffs[i];</div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// The coefficients are assumed to be positive for this to work properly.</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(coeff, 0);</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keyword">const</span> IntegerValue ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  max_variations.push_back((ub - lb) * coeff);</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  sum_lb += lb * coeff;</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  }</div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> </div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  model_-><a class="code" href="classoperations__research_1_1sat_1_1_model.html#a8d72645353ea6770911c4e0724995ed6">GetOrCreate</a><<a class="code" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>>()->AdvanceDeterministicTime(</div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  static_cast<double>(num_vars) * 1e-9);</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span> </div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="keyword">const</span> IntegerValue slack = <a class="code" href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a> - sum_lb;</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span> </div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  std::vector<IntegerLiteral> linear_sum_reason;</div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  std::vector<IntegerValue> reason_coeffs;</div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = vars[i];</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa4c7a44c63bb5d0d0401c9951db2daaa">VariableLowerBoundIsFromLevelZero</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  linear_sum_reason.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  reason_coeffs.push_back(coeffs[i]);</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  }</div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  }</div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">if</span> (slack < 0) {</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="comment">// Conflict.</span></div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa981297d0a648cd5c3fef40e2edebf8a">RelaxLinearReason</a>(-slack - 1, reason_coeffs,</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  &linear_sum_reason);</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  std::vector<IntegerLiteral> local_reason =</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  integer_reason_for_unique_candidate_;</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  local_reason.insert(local_reason.end(), linear_sum_reason.begin(),</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  linear_sum_reason.end());</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>({}, local_reason);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> </div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// The lower bound of all the variables except one can be used to update the</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">// upper bound of the last one.</span></div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_vars; ++i) {</div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordflow">if</span> (max_variations[i] <= slack) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> </div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = vars[i];</div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">const</span> IntegerValue coeff = coeffs[i];</div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keyword">const</span> IntegerValue div = slack / coeff;</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keyword">const</span> IntegerValue new_ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) + div;</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> </div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keyword">const</span> IntegerValue propagation_slack = (div + 1) * coeff - slack - 1;</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, new_ub),</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="comment">/*lazy_reason=*/</span>[<span class="keyword">this</span>, &vars, &coeffs, propagation_slack](</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  IntegerLiteral i_lit, <span class="keywordtype">int</span> trail_index,</div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  std::vector<Literal>* literal_reason,</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  std::vector<int>* trail_indices_reason) {</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  literal_reason->clear();</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  trail_indices_reason->clear();</div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  std::vector<IntegerValue> reason_coeffs;</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  const int size = vars.size();</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  for (int i = 0; i < size; ++i) {</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  const IntegerVariable var = vars[i];</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  if (PositiveVariable(var) == PositiveVariable(i_lit.var)) {</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  continue;</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>  const int index =</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  integer_trail_->FindTrailIndexOfVarBefore(var, trail_index);</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  if (index >= 0) {</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  trail_indices_reason->push_back(index);</div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  if (propagation_slack > 0) {</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  reason_coeffs.push_back(coeffs[i]);</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  }</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  }</div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  }</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <a class="code" href="parser_8yy_8cc.html#a33e91cd0cef6786e9e3a27ac67707207">if</a> (propagation_slack > 0) {</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa981297d0a648cd5c3fef40e2edebf8a">RelaxLinearReason</a>(</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  propagation_slack, reason_coeffs, trail_indices_reason);</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>  <span class="comment">// Now add the old integer_reason that triggered this propatation.</span></div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">for</span> (IntegerLiteral reason_lit :</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  integer_reason_for_unique_candidate_) {</div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a2df75a6456eaa2a1c2cc3255e4a91f29">FindTrailIndexOfVarBefore</a>(</div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  reason_lit.var, trail_index);</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= 0) {</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  trail_indices_reason->push_back(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  }</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  })) {</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  }</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">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span> }</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span> </div><div class="line"><a name="l00573"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 573</a></span> <span class="keywordtype">bool</span> LinMinPropagator::Propagate() {</div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="keywordflow">if</span> (exprs_.empty()) <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>  <span class="comment">// Count the number of interval that are possible candidate for the min.</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// Only the intervals for which lb > current_min_ub cannot.</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keyword">const</span> IntegerValue current_min_ub = integer_trail_->UpperBound(min_var_);</div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">int</span> num_intervals_that_can_be_min = 0;</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordtype">int</span> last_possible_min_interval = 0;</div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span> </div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  expr_lbs_.clear();</div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  IntegerValue min_of_linear_expression_lb = <a class="code" href="namespaceoperations__research_1_1sat.html#a1227e67513602591fb959e35c9de66e8">kMaxIntegerValue</a>;</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < exprs_.size(); ++i) {</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keyword">const</span> IntegerValue lb = <a class="code" href="namespaceoperations__research_1_1sat.html#a14ed349a41e2b31bb1c15ea3c44a6bc0">LinExprLowerBound</a>(exprs_[i], *integer_trail_);</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  expr_lbs_.push_back(lb);</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  min_of_linear_expression_lb = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>(min_of_linear_expression_lb, lb);</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keywordflow">if</span> (lb <= current_min_ub) {</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  ++num_intervals_that_can_be_min;</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  last_possible_min_interval = i;</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  }</div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  }</div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span> </div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// Propagation a) lb(min) >= lb(MIN(exprs)) = MIN(lb(exprs));</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span> </div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="comment">// Conflict will be detected by the fact that the [lb, ub] of the min is</span></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">// empty. In case of conflict, we just need the reason for pushing UB + 1.</span></div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="keywordflow">if</span> (min_of_linear_expression_lb > current_min_ub) {</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  min_of_linear_expression_lb = current_min_ub + 1;</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  }</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">if</span> (min_of_linear_expression_lb > integer_trail_->LowerBound(min_var_)) {</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  std::vector<IntegerLiteral> local_reason;</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < exprs_.size(); ++i) {</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  <span class="keyword">const</span> IntegerValue slack = expr_lbs_[i] - min_of_linear_expression_lb;</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  integer_trail_->AppendRelaxedLinearReason(slack, exprs_[i].coeffs,</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  exprs_[i].vars, &local_reason);</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  }</div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="keywordflow">if</span> (!integer_trail_->Enqueue(<a class="code" href="namespaceoperations__research_1_1sat.html#a0dedef72c691d332e0e1cc092bc01bc8">IntegerLiteral::GreaterOrEqual</a>(</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  min_var_, min_of_linear_expression_lb),</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  {}, local_reason)) {</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  }</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  }</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> </div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// Propagation b) ub(min) >= ub(MIN(exprs)) and we can't propagate anything</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// here unless there is just one possible expression 'e' that can be the min:</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">// for all u != e, lb(u) > ub(min);</span></div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">// In this case, ub(min) >= ub(e).</span></div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="keywordflow">if</span> (num_intervals_that_can_be_min == 1) {</div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="keyword">const</span> IntegerValue ub_of_only_candidate =</div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ad8620567e3849359ab6deda5f97aef91">LinExprUpperBound</a>(exprs_[last_possible_min_interval], *integer_trail_);</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">if</span> (current_min_ub < ub_of_only_candidate) {</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// For this propagation, we only need to fill the integer reason once at</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// the lowest level. At higher levels this reason still remains valid.</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">if</span> (rev_unique_candidate_ == 0) {</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  integer_reason_for_unique_candidate_.clear();</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span> </div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">// The reason is that all the other interval start after current_min_ub.</span></div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="comment">// And that min_ub has its current value.</span></div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  integer_reason_for_unique_candidate_.push_back(</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  integer_trail_->UpperBoundAsLiteral(min_var_));</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < exprs_.size(); ++i) {</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keywordflow">if</span> (i == last_possible_min_interval) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keyword">const</span> IntegerValue slack = expr_lbs_[i] - (current_min_ub + 1);</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  integer_trail_->AppendRelaxedLinearReason(</div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  slack, exprs_[i].coeffs, exprs_[i].vars,</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  &integer_reason_for_unique_candidate_);</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  }</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  rev_unique_candidate_ = 1;</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span> </div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keywordflow">return</span> PropagateLinearUpperBound(</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  exprs_[last_possible_min_interval].vars,</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  exprs_[last_possible_min_interval].coeffs,</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  current_min_ub - exprs_[last_possible_min_interval].offset);</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  }</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  }</div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span> </div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span> }</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span> </div><div class="line"><a name="l00652"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 652</a></span> <span class="keywordtype">void</span> LinMinPropagator::RegisterWith(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</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="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_linear_expression.html">LinearExpression</a>& expr : exprs_) {</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < expr.vars.size(); ++i) {</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="keyword">const</span> IntegerVariable& <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = expr.vars[i];</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="keyword">const</span> IntegerValue coeff = expr.coeffs[i];</div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">if</span> (coeff > 0) {</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">WatchLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">WatchUpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  }</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  }</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">WatchUpperBound</a>(min_var_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">RegisterReversibleInt</a>(<span class="keywordtype">id</span>, &rev_unique_candidate_);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span> }</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span> </div><div class="line"><a name="l00669"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_product_propagator.html#ac88ae9a72b79c5308eebc84c67eb02b2"> 669</a></span> ProductPropagator::ProductPropagator(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> p,</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  : a_(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>), b_(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>), p_(p), integer_trail_(integer_trail) {}</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> </div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span> <span class="comment">// We want all affine expression to be either non-negative or across zero.</span></div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> <span class="keywordtype">bool</span> ProductPropagator::CanonicalizeCases() {</div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(a_) <= 0) {</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  a_ = a_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>();</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  p_ = p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>();</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  }</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(b_) <= 0) {</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  b_ = b_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>();</div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  p_ = p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>();</div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  }</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span> </div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">// If both a and b positive, p must be too.</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(a_) >= 0 &&</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(b_) >= 0) {</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0), {a_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0), b_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0)});</div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  }</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span> </div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// Otherwise, make sure p is non-negative or accros zero.</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(p_) <= 0) {</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(a_) < 0) {</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(a_), 0);</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  a_ = a_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>();</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  p_ = p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>();</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(b_), 0);</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(b_), 0);</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  b_ = b_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>();</div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  p_ = p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>();</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  }</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  }</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span> </div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span> }</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span> </div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span> <span class="comment">// Note that this propagation is exact, except on the domain of p as this</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span> <span class="comment">// involves more complex arithmetic.</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> <span class="comment">//</span></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span> <span class="comment">// TODO(user): We could tighten the bounds on p by removing extreme value that</span></div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span> <span class="comment">// do not contains divisor in the domains of a or b. There is an algo in O(</span></div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span> <span class="comment">// smallest domain size between a or b).</span></div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="keywordtype">bool</span> ProductPropagator::PropagateWhenAllNonNegative() {</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keyword">const</span> IntegerValue max_a = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(a_);</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keyword">const</span> IntegerValue max_b = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(b_);</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keyword">const</span> IntegerValue new_max(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(max_a.value(), max_b.value()));</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordflow">if</span> (new_max < integer_trail_-><a class="code" href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">UpperBound</a>(p_)) {</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(new_max),</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(a_),</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(b_), a_.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">GreaterOrEqual</a>(0),</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  b_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0)})) {</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  }</div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  }</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span> </div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keyword">const</span> IntegerValue min_a = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(a_);</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="keyword">const</span> IntegerValue min_b = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(b_);</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keyword">const</span> IntegerValue new_min(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(min_a.value(), min_b.value()));</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordflow">if</span> (new_min > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(p_)) {</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(new_min),</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(a_),</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(b_)})) {</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  }</div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  }</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span> </div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 2; ++i) {</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keyword">const</span> AffineExpression <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> = i == 0 ? a_ : b_;</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="keyword">const</span> AffineExpression <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = i == 0 ? b_ : a_;</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keyword">const</span> IntegerValue max_a = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>);</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keyword">const</span> IntegerValue min_b = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="keyword">const</span> IntegerValue min_p = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(p_);</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keyword">const</span> IntegerValue max_p = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(p_);</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="keyword">const</span> IntegerValue prod(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(max_a.value(), min_b.value()));</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordflow">if</span> (prod > max_p) {</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.LowerOrEqual(<a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(max_p, min_b)),</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>),</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(p_),</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0)})) {</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  }</div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (prod < min_p) {</div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.GreaterOrEqual(<a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(min_p, max_a)),</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>),</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(p_), <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.GreaterOrEqual(0)})) {</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  }</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  }</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  }</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> </div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> }</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> </div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span> <span class="comment">// This assumes p > 0, p = a * X, and X can take any value.</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="comment">// We can propagate max of a by computing a bound on the min b when positive.</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> <span class="comment">// The expression b is just used to detect when there is no solution given the</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> <span class="comment">// upper bound of b.</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="keywordtype">bool</span> ProductPropagator::PropagateMaxOnPositiveProduct(AffineExpression <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  AffineExpression <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  IntegerValue min_p,</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  IntegerValue max_p) {</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keyword">const</span> IntegerValue max_a = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>);</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  <span class="keywordflow">if</span> (max_a <= 0) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(min_p, 0);</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span> </div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keywordflow">if</span> (max_a >= min_p) {</div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keywordflow">if</span> (max_p < max_a) {</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.LowerOrEqual(max_p),</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  {p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(max_p), p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1)})) {</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  }</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span> </div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keyword">const</span> IntegerValue min_pos_b = <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(min_p, max_a);</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">if</span> (min_pos_b > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)) {</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.LowerOrEqual(0), {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(p_),</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>),</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)})) {</div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  }</div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  }</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> </div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keyword">const</span> IntegerValue new_max_a = <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(max_p, min_pos_b);</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  <span class="keywordflow">if</span> (new_max_a < integer_trail_-><a class="code" href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">UpperBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>)) {</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.LowerOrEqual(new_max_a),</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(p_),</div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>),</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(p_)})) {</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  }</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  }</div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span> }</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span> </div><div class="line"><a name="l00816"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_product_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 816</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_product_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">ProductPropagator::Propagate</a>() {</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordflow">if</span> (!CanonicalizeCases()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span> </div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="comment">// In the most common case, we use better reasons even though the code</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="comment">// below would propagate the same.</span></div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keyword">const</span> int64_t min_a = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(a_).value();</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  <span class="keyword">const</span> int64_t min_b = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(b_).value();</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keywordflow">if</span> (min_a >= 0 && min_b >= 0) {</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="comment">// This was done by CanonicalizeCases().</span></div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(p_), 0);</div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keywordflow">return</span> PropagateWhenAllNonNegative();</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span> </div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="comment">// Lets propagate on p_ first, the max/min is given by one of: max_a * max_b,</span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// max_a * min_b, min_a * max_b, min_a * min_b. This is true, because any</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="comment">// product x * y, depending on the sign, is dominated by one of these.</span></div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="comment">//</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="comment">// TODO(user): In the reasons, including all 4 bounds is always correct, but</span></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="comment">// we might be able to relax some of them.</span></div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <span class="keyword">const</span> int64_t max_a = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(a_).value();</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keyword">const</span> int64_t max_b = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(b_).value();</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  <span class="keyword">const</span> IntegerValue p1(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(max_a, max_b));</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keyword">const</span> IntegerValue p2(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(max_a, min_b));</div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keyword">const</span> IntegerValue p3(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(min_a, max_b));</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keyword">const</span> IntegerValue p4(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(min_a, min_b));</div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="keyword">const</span> IntegerValue new_max_p = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>({p1, p2, p3, p4});</div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keywordflow">if</span> (new_max_p < integer_trail_-><a class="code" href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">UpperBound</a>(p_)) {</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(new_max_p),</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(a_),</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(b_),</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(a_),</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(b_)})) {</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  }</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  }</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keyword">const</span> IntegerValue new_min_p = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::min</a>({p1, p2, p3, p4});</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordflow">if</span> (new_min_p > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(p_)) {</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(new_min_p),</div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(a_),</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(b_),</div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(a_),</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(b_)})) {</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  }</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  }</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span> </div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  <span class="comment">// Lets propagate on a and b.</span></div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keyword">const</span> IntegerValue min_p = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(p_);</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  <span class="keyword">const</span> IntegerValue max_p = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(p_);</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span> </div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  <span class="comment">// We need a bit more propagation to avoid bad cases below.</span></div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> zero_is_possible = min_p <= 0;</div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">if</span> (!zero_is_possible) {</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(a_) == 0) {</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  a_.GreaterOrEqual(1),</div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  {p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1), a_.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">GreaterOrEqual</a>(0)})) {</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  }</div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  }</div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(b_) == 0) {</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  b_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1),</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  {p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1), b_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0)})) {</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  }</div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  }</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(a_) >= 0 &&</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(b_) <= 0) {</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  b_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1), {a_.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">GreaterOrEqual</a>(0), p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1)});</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  }</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(b_) >= 0 &&</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(a_) <= 0) {</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  a_.GreaterOrEqual(1), {b_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0), p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1)});</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  }</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  }</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span> </div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 2; ++i) {</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="comment">// p = a * b, what is the min/max of a?</span></div><div class="line"><a name="l00899"></a><span class="lineno"> 899</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="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a> = i == 0 ? a_ : b_;</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</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="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a> = i == 0 ? b_ : a_;</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keyword">const</span> IntegerValue max_b = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keyword">const</span> IntegerValue min_b = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span> </div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="comment">// If the domain of b contain zero, we can't propagate anything on a.</span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// Because of CanonicalizeCases(), we just deal with min_b > 0 here.</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">if</span> (zero_is_possible && min_b <= 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span> </div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="comment">// Here both a and b are across zero, but zero is not possible.</span></div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">if</span> (min_b < 0 && max_b > 0) {</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(min_p, 0); <span class="comment">// Because zero is not possible.</span></div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> </div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="comment">// If a is not across zero, we will deal with this on the next</span></div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="comment">// Propagate() call.</span></div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <span class="keywordflow">if</span> (!PropagateMaxOnPositiveProduct(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, min_p, max_p)) {</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  }</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordflow">if</span> (!PropagateMaxOnPositiveProduct(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.Negated(), <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.Negated(), min_p,</div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  max_p)) {</div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  }</div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  }</div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span> </div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="comment">// This shouldn't happen here.</span></div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="comment">// If it does, we should reach the fixed point on the next iteration.</span></div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">if</span> (min_b <= 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="keywordflow">if</span> (min_p >= 0) {</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.GreaterOrEqual(0), {p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0), <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.GreaterOrEqual(1)});</div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  }</div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="keywordflow">if</span> (max_p <= 0) {</div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.LowerOrEqual(0), {p_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(0), <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>.GreaterOrEqual(1)});</div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  }</div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span> </div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="comment">// So min_b > 0 and p is across zero: min_p < 0 and max_p > 0.</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keyword">const</span> IntegerValue new_max_a = <a class="code" href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">FloorRatio</a>(max_p, min_b);</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">if</span> (new_max_a < integer_trail_-><a class="code" href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">UpperBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>)) {</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.LowerOrEqual(new_max_a),</div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(p_),</div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)})) {</div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  }</div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  }</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keyword">const</span> IntegerValue new_min_a = <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(min_p, min_b);</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keywordflow">if</span> (new_min_a > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>)) {</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>.GreaterOrEqual(new_min_a),</div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(p_),</div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>)})) {</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  }</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  }</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  }</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span> </div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> }</div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span> </div><div class="line"><a name="l00960"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_product_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 960</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_product_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">ProductPropagator::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</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="l00962"></a><span class="lineno"> 962</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(a_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(b_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(p_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span> }</div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span> </div><div class="line"><a name="l00968"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_square_propagator.html#a86723da0f387e68b890ab489f88318af"> 968</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html#a86723da0f387e68b890ab489f88318af">SquarePropagator::SquarePropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> x, <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> s,</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  : x_(x), s_(s), integer_trail_(integer_trail) {</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(x), 0);</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span> }</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span> </div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> <span class="comment">// Propagation from x to s: s in [min_x * min_x, max_x * max_x].</span></div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="comment">// Propagation from s to x: x in [ceil(sqrt(min_s)), floor(sqrt(max_s))].</span></div><div class="line"><a name="l00976"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_square_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 976</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">SquarePropagator::Propagate</a>() {</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keyword">const</span> IntegerValue min_x = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(x_);</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <span class="keyword">const</span> IntegerValue min_s = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(s_);</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keyword">const</span> IntegerValue min_x_square(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(min_x.value(), min_x.value()));</div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  <span class="keywordflow">if</span> (min_x_square > min_s) {</div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(s_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(min_x_square),</div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  {x_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(min_x)})) {</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  }</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (min_x_square < min_s) {</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="keyword">const</span> IntegerValue new_min(<a class="code" href="namespaceoperations__research_1_1sat.html#a72e9fb9c1d4b0649782f8696e85cbbaa">CeilSquareRoot</a>(min_s.value()));</div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  x_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(new_min),</div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  {s_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>((new_min - 1) * (new_min - 1) + 1)})) {</div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  }</div><div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  }</div><div class="line"><a name="l00993"></a><span class="lineno"> 993</span> </div><div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="keyword">const</span> IntegerValue max_x = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(x_);</div><div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="keyword">const</span> IntegerValue max_s = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(s_);</div><div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="keyword">const</span> IntegerValue max_x_square(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(max_x.value(), max_x.value()));</div><div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keywordflow">if</span> (max_x_square < max_s) {</div><div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(s_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(max_x_square),</div><div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  {x_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(max_x)})) {</div><div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  }</div><div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (max_x_square > max_s) {</div><div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="keyword">const</span> IntegerValue new_max(<a class="code" href="namespaceoperations__research_1_1sat.html#aa7497b495a7fbfddaea40d45861680c5">FloorSquareRoot</a>(max_s.value()));</div><div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  x_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(new_max),</div><div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  {s_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(IntegerValue(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(new_max.value() + 1,</div><div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  new_max.value() + 1)) -</div><div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  1)})) {</div><div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  }</div><div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  }</div><div class="line"><a name="l01012"></a><span class="lineno"> 1012</span> </div><div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01014"></a><span class="lineno"> 1014</span> }</div><div class="line"><a name="l01015"></a><span class="lineno"> 1015</span> </div><div class="line"><a name="l01016"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_square_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 1016</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_square_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">SquarePropagator::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l01017"></a><span class="lineno"> 1017</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="l01018"></a><span class="lineno"> 1018</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(x_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(s_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div><div class="line"><a name="l01021"></a><span class="lineno"> 1021</span> }</div><div class="line"><a name="l01022"></a><span class="lineno"> 1022</span> </div><div class="line"><a name="l01023"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_division_propagator.html#a246b8936f3e0d5275497100133021fb9"> 1023</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html#a246b8936f3e0d5275497100133021fb9">DivisionPropagator::DivisionPropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> num,</div><div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> denom,</div><div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> div,</div><div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div><div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  : num_(num),</div><div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  denom_(denom),</div><div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  div_(div),</div><div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  negated_num_(num.Negated()),</div><div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  negated_div_(div.Negated()),</div><div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  integer_trail_(integer_trail) {</div><div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="comment">// The denominator can never be zero.</span></div><div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">LevelZeroLowerBound</a>(denom), 0);</div><div class="line"><a name="l01035"></a><span class="lineno"> 1035</span> }</div><div class="line"><a name="l01036"></a><span class="lineno"> 1036</span> </div><div class="line"><a name="l01037"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 1037</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">DivisionPropagator::Propagate</a>() {</div><div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  <span class="keywordflow">if</span> (!PropagateSigns()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01039"></a><span class="lineno"> 1039</span> </div><div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(num_) >= 0 &&</div><div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(div_) >= 0 &&</div><div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  !PropagateUpperBounds(num_, denom_, div_)) {</div><div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  }</div><div class="line"><a name="l01045"></a><span class="lineno"> 1045</span> </div><div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(negated_num_) >= 0 &&</div><div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(negated_div_) >= 0 &&</div><div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  !PropagateUpperBounds(negated_num_, denom_, negated_div_)) {</div><div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  }</div><div class="line"><a name="l01051"></a><span class="lineno"> 1051</span> </div><div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(num_) >= 0 &&</div><div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(div_) >= 0) {</div><div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keywordflow">return</span> PropagatePositiveDomains(num_, denom_, div_);</div><div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  }</div><div class="line"><a name="l01056"></a><span class="lineno"> 1056</span> </div><div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(num_) <= 0 &&</div><div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(div_) <= 0) {</div><div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  <span class="keywordflow">return</span> PropagatePositiveDomains(negated_num_, denom_, negated_div_);</div><div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  }</div><div class="line"><a name="l01061"></a><span class="lineno"> 1061</span> </div><div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01063"></a><span class="lineno"> 1063</span> }</div><div class="line"><a name="l01064"></a><span class="lineno"> 1064</span> </div><div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> <span class="keywordtype">bool</span> DivisionPropagator::PropagateSigns() {</div><div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="keyword">const</span> IntegerValue min_num = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(num_);</div><div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keyword">const</span> IntegerValue max_num = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(num_);</div><div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keyword">const</span> IntegerValue min_div = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(div_);</div><div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keyword">const</span> IntegerValue max_div = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(div_);</div><div class="line"><a name="l01070"></a><span class="lineno"> 1070</span> </div><div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="comment">// If num >= 0, as denom > 0, then div must be >= 0.</span></div><div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">if</span> (min_num >= 0 && min_div < 0) {</div><div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(div_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0),</div><div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  {num_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0)})) {</div><div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  }</div><div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  }</div><div class="line"><a name="l01078"></a><span class="lineno"> 1078</span> </div><div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="comment">// If div > 0, as denom > 0, then num must be > 0.</span></div><div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="keywordflow">if</span> (min_num <= 0 && min_div > 0) {</div><div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(num_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1),</div><div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  {div_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1)})) {</div><div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  }</div><div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  }</div><div class="line"><a name="l01086"></a><span class="lineno"> 1086</span> </div><div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="comment">// If num <= 0, as denom > 0, then div must be <= 0.</span></div><div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keywordflow">if</span> (max_num <= 0 && max_div > 0) {</div><div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(div_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(0),</div><div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  {num_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(0)})) {</div><div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  }</div><div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  }</div><div class="line"><a name="l01094"></a><span class="lineno"> 1094</span> </div><div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  <span class="comment">// If div < 0, as denom > 0, then num must be < 0.</span></div><div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordflow">if</span> (max_num >= 0 && max_div < 0) {</div><div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(num_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(-1),</div><div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  {div_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(-1)})) {</div><div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  }</div><div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  }</div><div class="line"><a name="l01102"></a><span class="lineno"> 1102</span> </div><div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01104"></a><span class="lineno"> 1104</span> }</div><div class="line"><a name="l01105"></a><span class="lineno"> 1105</span> </div><div class="line"><a name="l01106"></a><span class="lineno"> 1106</span> <span class="keywordtype">bool</span> DivisionPropagator::PropagateUpperBounds(AffineExpression num,</div><div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  AffineExpression denom,</div><div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  AffineExpression div) {</div><div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="keyword">const</span> IntegerValue max_num = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(num);</div><div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keyword">const</span> IntegerValue min_denom = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(denom);</div><div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keyword">const</span> IntegerValue max_denom = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(denom);</div><div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  <span class="keyword">const</span> IntegerValue max_div = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(div);</div><div class="line"><a name="l01113"></a><span class="lineno"> 1113</span> </div><div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="keyword">const</span> IntegerValue new_max_div = max_num / min_denom;</div><div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">if</span> (max_div > new_max_div) {</div><div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  div.LowerOrEqual(new_max_div),</div><div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(num),</div><div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(denom)})) {</div><div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  }</div><div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  }</div><div class="line"><a name="l01123"></a><span class="lineno"> 1123</span> </div><div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="comment">// We start from num / denom <= max_div.</span></div><div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="comment">// num < (max_div + 1) * denom</span></div><div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  <span class="comment">// num + 1 <= (max_div + 1) * max_denom.</span></div><div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  <span class="keyword">const</span> IntegerValue new_max_num =</div><div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  IntegerValue(<a class="code" href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">CapAdd</a>(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(max_div.value() + 1, max_denom.value()), -1));</div><div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keywordflow">if</span> (max_num > new_max_num) {</div><div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  num.LowerOrEqual(new_max_num),</div><div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(denom),</div><div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(div)})) {</div><div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  }</div><div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  }</div><div class="line"><a name="l01137"></a><span class="lineno"> 1137</span> </div><div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01139"></a><span class="lineno"> 1139</span> }</div><div class="line"><a name="l01140"></a><span class="lineno"> 1140</span> </div><div class="line"><a name="l01141"></a><span class="lineno"> 1141</span> <span class="keywordtype">bool</span> DivisionPropagator::PropagatePositiveDomains(AffineExpression num,</div><div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  AffineExpression denom,</div><div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  AffineExpression div) {</div><div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keyword">const</span> IntegerValue min_num = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(num);</div><div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  <span class="keyword">const</span> IntegerValue max_num = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(num);</div><div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  <span class="keyword">const</span> IntegerValue min_denom = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(denom);</div><div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="keyword">const</span> IntegerValue max_denom = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(denom);</div><div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="keyword">const</span> IntegerValue min_div = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(div);</div><div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="keyword">const</span> IntegerValue max_div = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(div);</div><div class="line"><a name="l01150"></a><span class="lineno"> 1150</span> </div><div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="keyword">const</span> IntegerValue new_min_div = min_num / max_denom;</div><div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <span class="keywordflow">if</span> (min_div < new_min_div) {</div><div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01154"></a><span class="lineno"> 1154</span>  div.GreaterOrEqual(new_min_div),</div><div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(num),</div><div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(denom)})) {</div><div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  }</div><div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  }</div><div class="line"><a name="l01160"></a><span class="lineno"> 1160</span> </div><div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  <span class="comment">// We start from num / denom >= min_div.</span></div><div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <span class="comment">// num >= min_div * denom.</span></div><div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  <span class="comment">// num >= min_div * min_denom.</span></div><div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  <span class="keyword">const</span> IntegerValue new_min_num =</div><div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  IntegerValue(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(min_denom.value(), min_div.value()));</div><div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="keywordflow">if</span> (min_num < new_min_num) {</div><div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  num.GreaterOrEqual(new_min_num),</div><div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(denom),</div><div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(div)})) {</div><div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>  }</div><div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  }</div><div class="line"><a name="l01174"></a><span class="lineno"> 1174</span> </div><div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="comment">// We start with num / denom >= min_div.</span></div><div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="comment">// So num >= min_div * denom</span></div><div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  <span class="comment">// If min_div == 0 we can't deduce anything.</span></div><div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  <span class="comment">// Otherwise, denom <= num / min_div and denom <= max_num / min_div.</span></div><div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  <span class="keywordflow">if</span> (min_div > 0) {</div><div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keyword">const</span> IntegerValue new_max_denom = max_num / min_div;</div><div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordflow">if</span> (max_denom > new_max_denom) {</div><div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  denom.LowerOrEqual(new_max_denom),</div><div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(num), num.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">GreaterOrEqual</a>(0),</div><div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(div)})) {</div><div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  }</div><div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  }</div><div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  }</div><div class="line"><a name="l01190"></a><span class="lineno"> 1190</span> </div><div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="comment">// denom >= CeilRatio(num + 1, max_div+1)</span></div><div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="comment">// >= CeilRatio(min_num + 1, max_div +).</span></div><div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keyword">const</span> IntegerValue new_min_denom = <a class="code" href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">CeilRatio</a>(min_num + 1, max_div + 1);</div><div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  <span class="keywordflow">if</span> (min_denom < new_min_denom) {</div><div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(denom.GreaterOrEqual(new_min_denom),</div><div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(num),</div><div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(div),</div><div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  div.<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">GreaterOrEqual</a>(0)})) {</div><div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  }</div><div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  }</div><div class="line"><a name="l01202"></a><span class="lineno"> 1202</span> </div><div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01204"></a><span class="lineno"> 1204</span> }</div><div class="line"><a name="l01205"></a><span class="lineno"> 1205</span> </div><div class="line"><a name="l01206"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 1206</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">DivisionPropagator::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l01207"></a><span class="lineno"> 1207</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="l01208"></a><span class="lineno"> 1208</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(num_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(denom_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(div_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div><div class="line"><a name="l01212"></a><span class="lineno"> 1212</span> }</div><div class="line"><a name="l01213"></a><span class="lineno"> 1213</span> </div><div class="line"><a name="l01214"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ab3ec103368339f9db05ce8325e246406"> 1214</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ab3ec103368339f9db05ce8325e246406">FixedDivisionPropagator::FixedDivisionPropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> <a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div><div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  IntegerValue <a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div><div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> c,</div><div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div><div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  : a_(<a class="code" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>), b_(<a class="code" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>), c_(c), integer_trail_(integer_trail) {</div><div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(b_, 0);</div><div class="line"><a name="l01220"></a><span class="lineno"> 1220</span> }</div><div class="line"><a name="l01221"></a><span class="lineno"> 1221</span> </div><div class="line"><a name="l01222"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 1222</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">FixedDivisionPropagator::Propagate</a>() {</div><div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keyword">const</span> IntegerValue min_a = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(a_);</div><div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="keyword">const</span> IntegerValue max_a = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(a_);</div><div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  IntegerValue min_c = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(c_);</div><div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  IntegerValue max_c = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(c_);</div><div class="line"><a name="l01227"></a><span class="lineno"> 1227</span> </div><div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="keywordflow">if</span> (max_a / b_ < max_c) {</div><div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  max_c = max_a / b_;</div><div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  c_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(max_c),</div><div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(a_)})) {</div><div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  }</div><div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (max_a / b_ > max_c) {</div><div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  <span class="keyword">const</span> IntegerValue new_max_a =</div><div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  max_c >= 0 ? max_c * b_ + b_ - 1</div><div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  : IntegerValue(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(max_c.value(), b_.value()));</div><div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(new_max_a, max_a);</div><div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>  a_.LowerOrEqual(new_max_a),</div><div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(c_)})) {</div><div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>  }</div><div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>  }</div><div class="line"><a name="l01246"></a><span class="lineno"> 1246</span> </div><div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="keywordflow">if</span> (min_a / b_ > min_c) {</div><div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  min_c = min_a / b_;</div><div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  c_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(min_c),</div><div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(a_)})) {</div><div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  }</div><div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (min_a / b_ < min_c) {</div><div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  <span class="keyword">const</span> IntegerValue new_min_a =</div><div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  min_c > 0 ? IntegerValue(<a class="code" href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">CapProd</a>(min_c.value(), b_.value()))</div><div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  : min_c * b_ - b_ + 1;</div><div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(new_min_a, min_a);</div><div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  a_.GreaterOrEqual(new_min_a),</div><div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(c_)})) {</div><div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  }</div><div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  }</div><div class="line"><a name="l01265"></a><span class="lineno"> 1265</span> </div><div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01267"></a><span class="lineno"> 1267</span> }</div><div class="line"><a name="l01268"></a><span class="lineno"> 1268</span> </div><div class="line"><a name="l01269"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 1269</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">FixedDivisionPropagator::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l01270"></a><span class="lineno"> 1270</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="l01271"></a><span class="lineno"> 1271</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(a_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(c_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01273"></a><span class="lineno"> 1273</span> }</div><div class="line"><a name="l01274"></a><span class="lineno"> 1274</span> </div><div class="line"><a name="l01275"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ae5d1328b48b697601cfa55b49d56c5cc"> 1275</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ae5d1328b48b697601cfa55b49d56c5cc">FixedModuloPropagator::FixedModuloPropagator</a>(<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> expr,</div><div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  IntegerValue mod,</div><div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html">AffineExpression</a> target,</div><div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div><div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  : <a class="code" href="element_8cc.html#a2dac2393bef148b7c15723ef0770d558">expr_</a>(expr), mod_(mod), target_(target), integer_trail_(integer_trail) {</div><div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(mod_, 0);</div><div class="line"><a name="l01281"></a><span class="lineno"> 1281</span> }</div><div class="line"><a name="l01282"></a><span class="lineno"> 1282</span> </div><div class="line"><a name="l01283"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 1283</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">FixedModuloPropagator::Propagate</a>() {</div><div class="line"><a name="l01284"></a><span class="lineno"> 1284</span>  <span class="keywordflow">if</span> (!PropagateSignsAndTargetRange()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="keywordflow">if</span> (!PropagateOuterBounds()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01286"></a><span class="lineno"> 1286</span> </div><div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(expr_) >= 0) {</div><div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="keywordflow">if</span> (!PropagateBoundsWhenExprIsPositive(expr_, target_)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(expr_) <= 0) {</div><div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordflow">if</span> (!PropagateBoundsWhenExprIsPositive(expr_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>(),</div><div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">Negated</a>())) {</div><div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  }</div><div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  }</div><div class="line"><a name="l01295"></a><span class="lineno"> 1295</span> </div><div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01297"></a><span class="lineno"> 1297</span> }</div><div class="line"><a name="l01298"></a><span class="lineno"> 1298</span> </div><div class="line"><a name="l01299"></a><span class="lineno"> 1299</span> <span class="keywordtype">bool</span> FixedModuloPropagator::PropagateSignsAndTargetRange() {</div><div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  <span class="comment">// Initial domain reduction on the target.</span></div><div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(target_) >= mod_) {</div><div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(mod_ - 1), {})) {</div><div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>  }</div><div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  }</div><div class="line"><a name="l01306"></a><span class="lineno"> 1306</span> </div><div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(target_) <= -mod_) {</div><div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(1 - mod_), {})) {</div><div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  }</div><div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  }</div><div class="line"><a name="l01312"></a><span class="lineno"> 1312</span> </div><div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  <span class="comment">// The sign of target_ is fixed by the sign of expr_.</span></div><div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(expr_) >= 0 &&</div><div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(target_) < 0) {</div><div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0),</div><div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  {expr_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(0)})) {</div><div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  }</div><div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  }</div><div class="line"><a name="l01321"></a><span class="lineno"> 1321</span> </div><div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(expr_) <= 0 &&</div><div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(target_) > 0) {</div><div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(0),</div><div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  {expr_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(0)})) {</div><div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  }</div><div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  }</div><div class="line"><a name="l01329"></a><span class="lineno"> 1329</span> </div><div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01331"></a><span class="lineno"> 1331</span> }</div><div class="line"><a name="l01332"></a><span class="lineno"> 1332</span> </div><div class="line"><a name="l01333"></a><span class="lineno"> 1333</span> <span class="keywordtype">bool</span> FixedModuloPropagator::PropagateOuterBounds() {</div><div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  <span class="keyword">const</span> IntegerValue min_expr = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(expr_);</div><div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  <span class="keyword">const</span> IntegerValue max_expr = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(expr_);</div><div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  <span class="keyword">const</span> IntegerValue min_target = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(target_);</div><div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  <span class="keyword">const</span> IntegerValue max_target = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(target_);</div><div class="line"><a name="l01338"></a><span class="lineno"> 1338</span> </div><div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="keywordflow">if</span> (max_expr % mod_ > max_target) {</div><div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  expr_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>((max_expr / mod_) * mod_ + max_target),</div><div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(target_),</div><div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(expr_)})) {</div><div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  }</div><div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  }</div><div class="line"><a name="l01347"></a><span class="lineno"> 1347</span> </div><div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  <span class="keywordflow">if</span> (min_expr % mod_ < min_target) {</div><div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  expr_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>((min_expr / mod_) * mod_ + min_target),</div><div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(expr_),</div><div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(target_)})) {</div><div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  }</div><div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  }</div><div class="line"><a name="l01356"></a><span class="lineno"> 1356</span> </div><div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="keywordflow">if</span> (min_expr / mod_ == max_expr / mod_) {</div><div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>  <span class="keywordflow">if</span> (min_target < min_expr % mod_) {</div><div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(min_expr - (min_expr / mod_) * mod_),</div><div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(target_),</div><div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(target_),</div><div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(expr_),</div><div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(expr_)})) {</div><div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  }</div><div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  }</div><div class="line"><a name="l01368"></a><span class="lineno"> 1368</span> </div><div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="keywordflow">if</span> (max_target > max_expr % mod_) {</div><div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(max_expr - (max_expr / mod_) * mod_),</div><div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(target_),</div><div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(target_),</div><div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(expr_),</div><div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(expr_)})) {</div><div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  }</div><div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  }</div><div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (min_expr / mod_ == 0 && min_target < 0) {</div><div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  <span class="comment">// expr == target when expr <= 0.</span></div><div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  <span class="keywordflow">if</span> (min_target < min_expr) {</div><div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">GreaterOrEqual</a>(min_expr),</div><div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(target_),</div><div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(expr_)})) {</div><div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  }</div><div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  }</div><div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (max_expr / mod_ == 0 && max_target > 0) {</div><div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  <span class="comment">// expr == target when expr >= 0.</span></div><div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>  <span class="keywordflow">if</span> (max_target > max_expr) {</div><div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  target_.<a class="code" href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">LowerOrEqual</a>(max_expr),</div><div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(target_),</div><div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(expr_)})) {</div><div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  }</div><div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  }</div><div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  }</div><div class="line"><a name="l01400"></a><span class="lineno"> 1400</span> </div><div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01402"></a><span class="lineno"> 1402</span> }</div><div class="line"><a name="l01403"></a><span class="lineno"> 1403</span> </div><div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> <span class="keywordtype">bool</span> FixedModuloPropagator::PropagateBoundsWhenExprIsPositive(</div><div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  AffineExpression expr, AffineExpression target) {</div><div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="keyword">const</span> IntegerValue min_target = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(target);</div><div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(min_target, 0);</div><div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keyword">const</span> IntegerValue max_target = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(target);</div><div class="line"><a name="l01409"></a><span class="lineno"> 1409</span> </div><div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  <span class="comment">// The propagation rules below will not be triggered if the domain of target</span></div><div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  <span class="comment">// covers [0..mod_ - 1].</span></div><div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  <span class="keywordflow">if</span> (min_target == 0 && max_target == mod_ - 1) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01413"></a><span class="lineno"> 1413</span> </div><div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  <span class="keyword">const</span> IntegerValue min_expr = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(expr);</div><div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  <span class="keyword">const</span> IntegerValue max_expr = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(expr);</div><div class="line"><a name="l01416"></a><span class="lineno"> 1416</span> </div><div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  <span class="keywordflow">if</span> (max_expr % mod_ < min_target) {</div><div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(max_expr, 0);</div><div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  expr.LowerOrEqual((max_expr / mod_ - 1) * mod_ + max_target),</div><div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(expr),</div><div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(target),</div><div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(target)})) {</div><div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  }</div><div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  }</div><div class="line"><a name="l01427"></a><span class="lineno"> 1427</span> </div><div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  <span class="keywordflow">if</span> (min_expr % mod_ > max_target) {</div><div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(min_expr, 0);</div><div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">SafeEnqueue</a>(</div><div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  expr.GreaterOrEqual((min_expr / mod_ + 1) * mod_ + min_target),</div><div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  {integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(target),</div><div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(target),</div><div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(expr)})) {</div><div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  }</div><div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  }</div><div class="line"><a name="l01438"></a><span class="lineno"> 1438</span> </div><div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l01440"></a><span class="lineno"> 1440</span> }</div><div class="line"><a name="l01441"></a><span class="lineno"> 1441</span> </div><div class="line"><a name="l01442"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 1442</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">FixedModuloPropagator::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div><div class="line"><a name="l01443"></a><span class="lineno"> 1443</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="l01444"></a><span class="lineno"> 1444</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(expr_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">WatchAffineExpression</a>(target_, <span class="keywordtype">id</span>);</div><div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div><div class="line"><a name="l01447"></a><span class="lineno"> 1447</span> }</div><div class="line"><a name="l01448"></a><span class="lineno"> 1448</span> </div><div class="line"><a name="l01449"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a32dffeb8de226de770f1f0b41055ce8d"> 1449</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a64b28e887e5cc31ab18530300f8c745e">IsOneOf</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div><div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  <span class="keyword">const</span> std::vector<Literal>& selectors,</div><div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  <span class="keyword">const</span> std::vector<IntegerValue>& values) {</div><div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  <span class="keywordflow">return</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="l01453"></a><span class="lineno"> 1453</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>();</div><div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div><div class="line"><a name="l01455"></a><span class="lineno"> 1455</span> </div><div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!values.empty());</div><div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  <a class="code" href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a>(values.size(), selectors.size());</div><div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  std::vector<int64_t> unique_values;</div><div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  absl::flat_hash_map<int64_t, std::vector<Literal>> value_to_selector;</div><div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < values.size(); ++i) {</div><div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  unique_values.push_back(values[i].<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>());</div><div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  value_to_selector[values[i].value()].push_back(selectors[i]);</div><div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  }</div><div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&unique_values);</div><div class="line"><a name="l01465"></a><span class="lineno"> 1465</span> </div><div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  integer_trail-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#af931801f592e954a6623cab8cf9a4485">UpdateInitialDomain</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, <a class="code" href="classoperations__research_1_1_domain.html#ac2d88de67793063ad5f5e923ffd1c0eb">Domain::FromValues</a>(unique_values));</div><div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  <span class="keywordflow">if</span> (unique_values.size() == 1) {</div><div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a1655a9b9673e7c4de940ca6e5e3cf936">ClauseConstraint</a>(selectors));</div><div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  }</div><div class="line"><a name="l01471"></a><span class="lineno"> 1471</span> </div><div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  <span class="comment">// Note that it is more efficient to call AssociateToIntegerEqualValue()</span></div><div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  <span class="comment">// with the values ordered, like we do here.</span></div><div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t v : unique_values) {</div><div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="keyword">const</span> std::vector<Literal>& selectors = value_to_selector[v];</div><div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <span class="keywordflow">if</span> (selectors.size() == 1) {</div><div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  encoder->AssociateToIntegerEqualValue(selectors[0], <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div><div class="line"><a name="l01478"></a><span class="lineno"> 1478</span>  IntegerValue(v));</div><div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">NewBooleanVariable</a>()), <span class="keyword">true</span>);</div><div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#affc20db163dca7cacfb4aa97cf8d72b9">ReifiedBoolOr</a>(selectors, l));</div><div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  encoder->AssociateToIntegerEqualValue(l, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, IntegerValue(v));</div><div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  }</div><div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>  }</div><div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  };</div><div class="line"><a name="l01486"></a><span class="lineno"> 1486</span> }</div><div class="line"><a name="l01487"></a><span class="lineno"> 1487</span> </div><div class="line"><a name="l01488"></a><span class="lineno"> 1488</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l01489"></a><span class="lineno"> 1489</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_modulo_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::FixedModuloPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01283">integer_expr.cc:1283</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_aa4c7a44c63bb5d0d0401c9951db2daaa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa4c7a44c63bb5d0d0401c9951db2daaa">operations_research::sat::IntegerTrail::VariableLowerBoundIsFromLevelZero</a></div><div class="ttdeci">bool VariableLowerBoundIsFromLevelZero(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00934">integer.h:934</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_division_propagator_html_a246b8936f3e0d5275497100133021fb9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_division_propagator.html#a246b8936f3e0d5275497100133021fb9">operations_research::sat::DivisionPropagator::DivisionPropagator</a></div><div class="ttdeci">DivisionPropagator(AffineExpression num, AffineExpression denom, AffineExpression div, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01023">integer_expr.cc:1023</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="element_8cc_html_a2dac2393bef148b7c15723ef0770d558"><div class="ttname"><a href="element_8cc.html#a2dac2393bef148b7c15723ef0770d558">expr_</a></div><div class="ttdeci">IntVar *const expr_</div><div class="ttdef"><b>Definition:</b> <a href="element_8cc_source.html#l00087">element.cc:87</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00106">time_limit.h:106</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a38766514ce4824ae1e093a25d7fb43b3"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a38766514ce4824ae1e093a25d7fb43b3">operations_research::sat::NewBooleanVariable</a></div><div class="ttdeci">std::function< BooleanVariable(Model *)> NewBooleanVariable()</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01598">integer.h:1598</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_affine_expression_html_a19bff44fb82e19c55a4da7fe9aa38a86"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a19bff44fb82e19c55a4da7fe9aa38a86">operations_research::sat::AffineExpression::Negated</a></div><div class="ttdeci">AffineExpression Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00252">integer.h:252</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html">operations_research::sat::IntegerLiteral</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00168">integer.h:168</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_product_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_product_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::ProductPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00960">integer_expr.cc:960</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="structoperations__research_1_1sat_1_1_affine_expression_html_a5d6f020504838c2d57528f47cd1fe164"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a5d6f020504838c2d57528f47cd1fe164">operations_research::sat::AffineExpression::GreaterOrEqual</a></div><div class="ttdeci">IntegerLiteral GreaterOrEqual(IntegerValue bound) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01406">integer.h:1406</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_division_propagator_html_ab3ec103368339f9db05ce8325e246406"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ab3ec103368339f9db05ce8325e246406">operations_research::sat::FixedDivisionPropagator::FixedDivisionPropagator</a></div><div class="ttdeci">FixedDivisionPropagator(AffineExpression a, IntegerValue b, AffineExpression c, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01214">integer_expr.cc:1214</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00706">base/logging.h:706</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a14ed349a41e2b31bb1c15ea3c44a6bc0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a14ed349a41e2b31bb1c15ea3c44a6bc0">operations_research::sat::LinExprLowerBound</a></div><div class="ttdeci">IntegerValue LinExprLowerBound(const LinearExpression &expr, const IntegerTrail &integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00348">sat/linear_constraint.cc:348</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="classoperations__research_1_1sat_1_1_lin_min_propagator_html_a3b562468ef8cc634a83e3ac7240a43da"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_lin_min_propagator.html#a3b562468ef8cc634a83e3ac7240a43da">operations_research::sat::LinMinPropagator::LinMinPropagator</a></div><div class="ttdeci">LinMinPropagator(const std::vector< LinearExpression > &exprs, IntegerVariable min_var, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00469">integer_expr.cc:469</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a72e9fb9c1d4b0649782f8696e85cbbaa"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a72e9fb9c1d4b0649782f8696e85cbbaa">operations_research::sat::CeilSquareRoot</a></div><div class="ttdeci">int64_t CeilSquareRoot(int64_t a)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00182">sat/util.cc:182</a></div></div>
|
|
<div class="ttc" id="integer__expr_8h_html"><div class="ttname"><a href="integer__expr_8h.html">integer_expr.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a355a62f25cfadeccfb164ab9fb867c81"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a355a62f25cfadeccfb164ab9fb867c81">operations_research::sat::kMinIntegerValue</a></div><div class="ttdeci">constexpr IntegerValue kMinIntegerValue(-kMaxIntegerValue)</div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_affc20db163dca7cacfb4aa97cf8d72b9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#affc20db163dca7cacfb4aa97cf8d72b9">operations_research::sat::ReifiedBoolOr</a></div><div class="ttdeci">std::function< void(Model *)> ReifiedBoolOr(const std::vector< Literal > &literals, Literal r)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00936">sat_solver.h:936</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_modulo_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::FixedModuloPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01442">integer_expr.cc:1442</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ac0a2e8c6619af74b42472bfa9a9e6465"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ac0a2e8c6619af74b42472bfa9a9e6465">operations_research::sat::IntegerTrail::UpperBoundAsLiteral</a></div><div class="ttdeci">IntegerLiteral UpperBoundAsLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01472">integer.h:1472</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="structoperations__research_1_1sat_1_1_integer_literal_html_a3e2eb445631727dd4abf1d5343f16b2f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">operations_research::sat::IntegerLiteral::LowerOrEqual</a></div><div class="ttdeci">static IntegerLiteral LowerOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01383">integer.h:1383</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_afcaa7cadd41741bb855c2ada1d2ef927"><div class="ttname"><a href="base_2logging_8h.html#afcaa7cadd41741bb855c2ada1d2ef927">VLOG</a></div><div class="ttdeci">#define VLOG(verboselevel)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00983">base/logging.h:983</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html_a83404baa3e4ce3beaefa9a662f627655"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#a83404baa3e4ce3beaefa9a662f627655">operations_research::sat::IntegerSumLE::ConditionalLb</a></div><div class="ttdeci">std::pair< IntegerValue, IntegerValue > ConditionalLb(IntegerLiteral integer_literal, IntegerVariable target_var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00080">integer_expr.cc:80</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a6d55b5b9adc499095dd57dd0c2b6c7df"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">operations_research::sat::IntegerTrail::ReportConflict</a></div><div class="ttdeci">bool ReportConflict(absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00917">integer.h:917</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_model_html_a8d72645353ea6770911c4e0724995ed6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html#a8d72645353ea6770911c4e0724995ed6">operations_research::sat::Model::GetOrCreate</a></div><div class="ttdeci">T * GetOrCreate()</div><div class="ttdoc">Returns an object of type T that is unique to this model (like a "local" singleton).</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00106">sat/model.h:106</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01435">integer.h:1435</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">operations_research::sat::VariablesAssignment::LiteralIsFalse</a></div><div class="ttdeci">bool LiteralIsFalse(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00149">sat_base.h:149</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00263">id_map.h:263</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">operations_research::sat::VariablesAssignment::LiteralIsTrue</a></div><div class="ttdeci">bool LiteralIsTrue(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00152">sat_base.h:152</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00093">sat_base.h:93</a></div></div>
|
|
<div class="ttc" id="time__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</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_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00066">sat_base.h:66</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aa64bf49d041052c7cb3f40f7496d7534"><div class="ttname"><a href="namespaceoperations__research.html#aa64bf49d041052c7cb3f40f7496d7534">operations_research::CapProd</a></div><div class="ttdeci">int64_t CapProd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00235">saturated_arithmetic.h:235</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_ab6516f556b715738034b30d290c40214"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#ab6516f556b715738034b30d290c40214">operations_research::sat::IntegerLiteral::var</a></div><div class="ttdeci">IntegerVariable var</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00211">integer.h:211</a></div></div>
|
|
<div class="ttc" id="namespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d"><div class="ttname"><a href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a></div><div class="ttdeci">void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00058">stl_util.h:58</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_division_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::DivisionPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01037">integer_expr.cc:1037</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="structoperations__research_1_1sat_1_1_linear_expression_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_linear_expression.html">operations_research::sat::LinearExpression</a></div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8h_source.html#l00088">sat/linear_constraint.h:88</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_integer_trail_html_a615d87982145007855f2102262cf773c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a615d87982145007855f2102262cf773c">operations_research::sat::IntegerTrail::LowerBoundAsLiteral</a></div><div class="ttdeci">IntegerLiteral LowerBoundAsLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01467">integer.h:1467</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="classoperations__research_1_1sat_1_1_integer_trail_html_a05e837bb93eeabbbd94e8f690dd59d32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">operations_research::sat::IntegerTrail::Enqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool Enqueue(IntegerLiteral i_lit, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01027">integer.cc:1027</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_square_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_square_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::SquarePropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00976">integer_expr.cc:976</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_a4bd2e815ca2f702a4b6aa744b1ff3b82"><div class="ttname"><a href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a></div><div class="ttdeci">#define CHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00705">base/logging.h:705</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a7f1ac774d4646a83631f8117f4ea03f5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7f1ac774d4646a83631f8117f4ea03f5">operations_research::sat::PositiveVariable</a></div><div class="ttdeci">IntegerVariable PositiveVariable(IntegerVariable i)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00143">integer.h:143</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a9b1f29e2e2079dc31e89749c9a33bc01"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9b1f29e2e2079dc31e89749c9a33bc01">operations_research::sat::LowerOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> LowerOrEqual(IntegerVariable v, int64_t ub)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01696">integer.h:1696</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a64b28e887e5cc31ab18530300f8c745e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a64b28e887e5cc31ab18530300f8c745e">operations_research::sat::IsOneOf</a></div><div class="ttdeci">std::function< void(Model *)> IsOneOf(IntegerVariable var, const std::vector< Literal > &selectors, const std::vector< IntegerValue > &values)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8h_source.html#l00824">integer_expr.h:824</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a26e6db9bcc64b584051ecc28171ed11f"><div class="ttname"><a href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">max</a></div><div class="ttdeci">int64_t max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00140">alldiff_cst.cc:140</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_square_propagator_html_a86723da0f387e68b890ab489f88318af"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_square_propagator.html#a86723da0f387e68b890ab489f88318af">operations_research::sat::SquarePropagator::SquarePropagator</a></div><div class="ttdeci">SquarePropagator(AffineExpression x, AffineExpression s, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00968">integer_expr.cc:968</a></div></div>
|
|
<div class="ttc" id="gscip__solver_8cc_html_a1ba5ca0f61f2fa13bd23bf0f89004f35"><div class="ttname"><a href="gscip__solver_8cc.html#a1ba5ca0f61f2fa13bd23bf0f89004f35">upper_bound</a></div><div class="ttdeci">double upper_bound</div><div class="ttdef"><b>Definition:</b> <a href="gscip__solver_8cc_source.html#l00126">gscip_solver.cc:126</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_aaede7c755aad90772efda6db087f3413"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aaede7c755aad90772efda6db087f3413">operations_research::sat::GenericLiteralWatcher::WatchLowerBound</a></div><div class="ttdeci">void WatchLowerBound(IntegerVariable var, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01559">integer.h:1559</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a9393fc2c24f073a494687363af790b39"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a9393fc2c24f073a494687363af790b39">operations_research::sat::IntegerTrail::SafeEnqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool SafeEnqueue(IntegerLiteral i_lit, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01009">integer.cc:1009</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00356">integer.h:356</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_a111f44b9b9cf67a8e8d83794ac9f5291"><div class="ttname"><a href="namespaceoperations__research.html#a111f44b9b9cf67a8e8d83794ac9f5291">operations_research::CapAdd</a></div><div class="ttdeci">int64_t CapAdd(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00126">saturated_arithmetic.h:126</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_min_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_min_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::MinPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00383">integer_expr.cc:383</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_abaec50ed809d8f0a1754c9a9225d3b5e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#abaec50ed809d8f0a1754c9a9225d3b5e">operations_research::sat::GenericLiteralWatcher::WatchAffineExpression</a></div><div class="ttdeci">void WatchAffineExpression(AffineExpression e, int id)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01271">integer.h:1271</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_aa130e84323404df15a838f6d07e9c775"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#aa130e84323404df15a838f6d07e9c775">operations_research::sat::IntegerLiteral::bound</a></div><div class="ttdeci">IntegerValue bound</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00212">integer.h:212</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_ac2d88de67793063ad5f5e923ffd1c0eb"><div class="ttname"><a href="classoperations__research_1_1_domain.html#ac2d88de67793063ad5f5e923ffd1c0eb">operations_research::Domain::FromValues</a></div><div class="ttdeci">static Domain FromValues(std::vector< int64_t > values)</div><div class="ttdoc">Creates a domain from the union of an unsorted list of integer values.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00144">sorted_interval_list.cc:144</a></div></div>
|
|
<div class="ttc" id="sorted__interval__list_8h_html"><div class="ttname"><a href="sorted__interval__list_8h.html">sorted_interval_list.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0dedef72c691d332e0e1cc092bc01bc8"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0dedef72c691d332e0e1cc092bc01bc8">operations_research::sat::GreaterOrEqual</a></div><div class="ttdeci">std::function< void(Model *)> GreaterOrEqual(IntegerVariable v, int64_t lb)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01681">integer.h:1681</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00613">integer.h:613</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_math_util_html_ae94db7b2fa1d8e1b3c1dc6c683191609"><div class="ttname"><a href="classoperations__research_1_1_math_util.html#ae94db7b2fa1d8e1b3c1dc6c683191609">operations_research::MathUtil::GCD64</a></div><div class="ttdeci">static int64_t GCD64(int64_t x, int64_t y)</div><div class="ttdef"><b>Definition:</b> <a href="mathutil_8h_source.html#l00107">mathutil.h:107</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00235">sat_base.h:235</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_modulo_propagator_html_ae5d1328b48b697601cfa55b49d56c5cc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_modulo_propagator.html#ae5d1328b48b697601cfa55b49d56c5cc">operations_research::sat::FixedModuloPropagator::FixedModuloPropagator</a></div><div class="ttdeci">FixedModuloPropagator(AffineExpression expr, IntegerValue mod, AffineExpression target, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01275">integer_expr.cc:1275</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_af931801f592e954a6623cab8cf9a4485"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#af931801f592e954a6623cab8cf9a4485">operations_research::sat::IntegerTrail::UpdateInitialDomain</a></div><div class="ttdeci">bool UpdateInitialDomain(IntegerVariable var, Domain domain)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00668">integer.cc:668</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a79322fd8dff49ab2eab22c0570aba594"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a79322fd8dff49ab2eab22c0570aba594">operations_research::sat::IntegerTrail::EnqueueLiteral</a></div><div class="ttdeci">void EnqueueLiteral(Literal literal, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01141">integer.cc:1141</a></div></div>
|
|
<div class="ttc" id="pack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00509">pack.cc:509</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_aa981297d0a648cd5c3fef40e2edebf8a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa981297d0a648cd5c3fef40e2edebf8a">operations_research::sat::IntegerTrail::RelaxLinearReason</a></div><div class="ttdeci">void RelaxLinearReason(IntegerValue slack, absl::Span< const IntegerValue > coeffs, std::vector< IntegerLiteral > *reason) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00805">integer.cc:805</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="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_a8f6dd74a841475ccb390614d2b212170"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">operations_research::sat::GenericLiteralWatcher::WatchLiteral</a></div><div class="ttdeci">void WatchLiteral(Literal l, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01551">integer.h:1551</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="base_2logging_8h_html_a7c0ce053b28d53aa4eaf3eb7fb71663b"><div class="ttname"><a href="base_2logging_8h.html#a7c0ce053b28d53aa4eaf3eb7fb71663b">CHECK_EQ</a></div><div class="ttdeci">#define CHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a83f714c395df7a814ed067125f567a0d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a83f714c395df7a814ed067125f567a0d">operations_research::sat::PositiveRemainder</a></div><div class="ttdeci">IntegerValue PositiveRemainder(IntegerValue dividend, IntegerValue positive_divisor)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00107">integer.h:107</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a0ee70f9d17fac333fb71c0ab6423f58c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0ee70f9d17fac333fb71c0ab6423f58c">operations_research::sat::UpperBound</a></div><div class="ttdeci">std::function< int64_t(const Model &)> UpperBound(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01659">integer.h:1659</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00044">alldiff_cst.cc:44</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ad8620567e3849359ab6deda5f97aef91"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ad8620567e3849359ab6deda5f97aef91">operations_research::sat::LinExprUpperBound</a></div><div class="ttdeci">IntegerValue LinExprUpperBound(const LinearExpression &expr, const IntegerTrail &integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2linear__constraint_8cc_source.html#l00358">sat/linear_constraint.cc:358</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="sat_2util_8h_html"><div class="ttname"><a href="sat_2util_8h.html">util.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_aa7497b495a7fbfddaea40d45861680c5"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aa7497b495a7fbfddaea40d45861680c5">operations_research::sat::FloorSquareRoot</a></div><div class="ttdeci">int64_t FloorSquareRoot(int64_t a)</div><div class="ttdef"><b>Definition:</b> <a href="sat_2util_8cc_source.html#l00173">sat/util.cc:173</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_rev_integer_value_repository_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_rev_integer_value_repository.html">operations_research::sat::RevIntegerValueRepository</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01210">integer.h:1210</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a07823d046b027c81155f8a2f322cf813"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a07823d046b027c81155f8a2f322cf813">operations_research::sat::FloorRatio</a></div><div class="ttdeci">IntegerValue FloorRatio(IntegerValue dividend, IntegerValue positive_divisor)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00092">integer.h:92</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_min_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_min_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::MinPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00461">integer_expr.cc:461</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_time_limit_html_af90cfd1fc238433fc303ee28c5914eb9"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html#af90cfd1fc238433fc303ee28c5914eb9">operations_research::TimeLimit::AdvanceDeterministicTime</a></div><div class="ttdeci">void AdvanceDeterministicTime(double deterministic_duration)</div><div class="ttdoc">Advances the deterministic time.</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00227">time_limit.h:227</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a29b96869d2a821cf1d2e6099e7a0f51b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a29b96869d2a821cf1d2e6099e7a0f51b">operations_research::sat::CeilRatio</a></div><div class="ttdeci">IntegerValue CeilRatio(IntegerValue dividend, IntegerValue positive_divisor)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00083">integer.h:83</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_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01439">integer.h:1439</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_min_propagator_html_a7adb3d82f96ba9699d1e1e1b399134ec"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_min_propagator.html#a7adb3d82f96ba9699d1e1e1b399134ec">operations_research::sat::MinPropagator::MinPropagator</a></div><div class="ttdeci">MinPropagator(const std::vector< IntegerVariable > &vars, IntegerVariable min_var, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00378">integer_expr.cc:378</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_square_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_square_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::SquarePropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01016">integer_expr.cc:1016</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html_aec1aae1092c281971431aac37d923b60"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#aec1aae1092c281971431aac37d923b60">operations_research::sat::IntegerSumLE::IntegerSumLE</a></div><div class="ttdeci">IntegerSumLE(const std::vector< Literal > &enforcement_literals, const std::vector< IntegerVariable > &vars, const std::vector< IntegerValue > &coeffs, IntegerValue upper_bound, Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00032">integer_expr.cc:32</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_level_zero_equality_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_level_zero_equality.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::LevelZeroEquality::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00333">integer_expr.cc:333</a></div></div>
|
|
<div class="ttc" id="integer_8h_html"><div class="ttname"><a href="integer_8h.html">integer.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_affine_expression_html_a8d484cfa3afefda70ef152313dffdc27"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_affine_expression.html#a8d484cfa3afefda70ef152313dffdc27">operations_research::sat::AffineExpression::LowerOrEqual</a></div><div class="ttdeci">IntegerLiteral LowerOrEqual(IntegerValue bound) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01422">integer.h:1422</a></div></div>
|
|
<div class="ttc" id="structoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01377">integer.h:1377</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a2df75a6456eaa2a1c2cc3255e4a91f29"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a2df75a6456eaa2a1c2cc3255e4a91f29">operations_research::sat::IntegerTrail::FindTrailIndexOfVarBefore</a></div><div class="ttdeci">int FindTrailIndexOfVarBefore(IntegerVariable var, int threshold) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00735">integer.cc:735</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_division_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::FixedDivisionPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01269">integer_expr.cc:1269</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_ac9d426060b1b7eee72e9e5345379f111"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ac9d426060b1b7eee72e9e5345379f111">operations_research::sat::GenericLiteralWatcher::WatchUpperBound</a></div><div class="ttdeci">void WatchUpperBound(IntegerVariable var, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01577">integer.h:1577</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_rev_repository_html_a32476d1fb09b1e06181ee07d30378b02"><div class="ttname"><a href="classoperations__research_1_1_rev_repository.html#a32476d1fb09b1e06181ee07d30378b02">operations_research::RevRepository::SaveState</a></div><div class="ttdeci">void SaveState(T *object)</div><div class="ttdef"><b>Definition:</b> <a href="rev_8h_source.html#l00061">rev.h:61</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a2dbcb7017d468a17bdb30252af5c6c31"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2dbcb7017d468a17bdb30252af5c6c31">operations_research::sat::kNoLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kNoLiteralIndex(-1)</div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::Trail::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00382">sat_base.h:382</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_fixed_division_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_fixed_division_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::FixedDivisionPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01222">integer_expr.cc:1222</a></div></div>
|
|
<div class="ttc" id="expr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_division_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_division_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::DivisionPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l01206">integer_expr.cc:1206</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a1655a9b9673e7c4de940ca6e5e3cf936"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1655a9b9673e7c4de940ca6e5e3cf936">operations_research::sat::ClauseConstraint</a></div><div class="ttdeci">std::function< void(Model *)> ClauseConstraint(absl::Span< const Literal > literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00906">sat_solver.h:906</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_trail_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::Trail::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00357">sat_base.h:357</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_aa68cc40c827bff2fb311040e2b848f9b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#aa68cc40c827bff2fb311040e2b848f9b">operations_research::sat::IntegerTrail::LevelZeroLowerBound</a></div><div class="ttdeci">IntegerValue LevelZeroLowerBound(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01519">integer.h:1519</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_product_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_product_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::ProductPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00816">integer_expr.cc:816</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_sum_l_e_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_sum_l_e.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::IntegerSumLE::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="integer__expr_8cc_source.html#l00135">integer_expr.cc:135</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_ac072af30c4ffbc834bb4c681f6ecb514"><div class="ttname"><a href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a></div><div class="ttdeci">int64_t value</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00044">demon_profiler.cc:44</a></div></div>
|
|
<div class="ttc" id="parser_8yy_8cc_html_a33e91cd0cef6786e9e3a27ac67707207"><div class="ttname"><a href="parser_8yy_8cc.html#a33e91cd0cef6786e9e3a27ac67707207">if</a></div><div class="ttdeci">if(!yyg->yy_init)</div><div class="ttdef"><b>Definition:</b> <a href="parser_8yy_8cc_source.html#l00965">parser.yy.cc:965</a></div></div>
|
|
<div class="ttc" id="optimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00085">optimization.cc:85</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_integer_trail_html_a523501d854b2ca8034d37c15e7c89117"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a523501d854b2ca8034d37c15e7c89117">operations_research::sat::IntegerTrail::IsFixed</a></div><div class="ttdeci">bool IsFixed(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01443">integer.h:1443</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00893">base/logging.h:893</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_generic_literal_watcher_html_a8963fd33e7bd70e749b2a37060ef1274"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8963fd33e7bd70e749b2a37060ef1274">operations_research::sat::GenericLiteralWatcher::RegisterReversibleInt</a></div><div class="ttdeci">void RegisterReversibleInt(int id, int *rev)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l02039">integer.cc:2039</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="integer__expr_8cc.html">integer_expr.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>
|