165 lines
107 KiB
HTML
165 lines
107 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: cp_model_postsolve.cc Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(initResizable);
|
|
/* @license-end */</script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.15 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "search",false,'Search');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(document).ready(function(){initNavTree('cp__model__postsolve_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">cp_model_postsolve.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="cp__model__postsolve_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="cp__model__postsolve_8h.html">ortools/sat/cp_model_postsolve.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 <cstdint></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> </div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="cp__model__utils_8h.html">ortools/sat/cp_model_utils.h</a>"</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="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="keyword">namespace </span>sat {</div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> </div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// This postsolve is "special". If the clause is not satisfied, we fix the</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// first literal in the clause to true (even if it was fixed to false). This</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// allows to handle more complex presolve operations used by the SAT presolver.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">//</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// Also, any "free" Boolean should be fixed to some value for the subsequent</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// postsolve steps.</span></div><div class="line"><a name="l00030"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#ab67697c2e8ba7d65eff35db17d7b94a9"> 30</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#ab67697c2e8ba7d65eff35db17d7b94a9">PostsolveClause</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, std::vector<Domain>* domains) {</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.bool_or().literals_size();</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(size, 0);</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordtype">bool</span> satisfied = <span class="keyword">false</span>;</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ref = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.bool_or().literals(i);</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="keywordflow">if</span> ((*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].<a class="code" href="namespaceoperations__research_1_1sat.html#ace76b216f012cbdf1443670080329f6d">IsFixed</a>()) {</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  <span class="keywordflow">if</span> ((*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].FixedValue() == (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? 1 : 0)) {</div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  satisfied = <span class="keyword">true</span>;</div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  }</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="comment">// We still need to assign free variable. Any value should work.</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  (*domains)[<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref)] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(0);</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  }</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="keywordflow">if</span> (satisfied) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> </div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// Change the value of the first variable (which was chosen at presolve).</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> first_ref = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.bool_or().literals(0);</div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  (*domains)[<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(first_ref)] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(first_ref) ? 1 : 0);</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> }</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> </div><div class="line"><a name="l00053"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a62feb42f880fdeb019acf6a06cff70c1"> 53</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a62feb42f880fdeb019acf6a06cff70c1">PostsolveExactlyOne</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>,</div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  std::vector<Domain>* domains) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordtype">bool</span> satisfied = <span class="keyword">false</span>;</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  std::vector<int> free_variables;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.exactly_one().literals()) {</div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">if</span> ((*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].<a class="code" href="namespaceoperations__research_1_1sat.html#ace76b216f012cbdf1443670080329f6d">IsFixed</a>()) {</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> ((*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].FixedValue() == (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? 1 : 0)) {</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!satisfied) << <span class="stringliteral">"Two variables at one in exactly one."</span>;</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  satisfied = <span class="keyword">true</span>;</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  }</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  free_variables.push_back(ref);</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>  }</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (!satisfied) {</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="comment">// Fix one at true.</span></div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!free_variables.empty()) << <span class="stringliteral">"All zero in exactly one"</span>;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ref = free_variables.back();</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  (*domains)[<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref)] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? 1 : 0);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  free_variables.pop_back();</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> </div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// Fix any free variable left at false.</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : free_variables) {</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  (*domains)[<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref)] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? 0 : 1);</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> }</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment">// For now we set the first unset enforcement literal to false.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment">// There must be one.</span></div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a73e2ec8896aa53a5c58f86dfd68e6f19"> 84</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a73e2ec8896aa53a5c58f86dfd68e6f19">SetEnforcementLiteralToFalse</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>,</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  std::vector<Domain>* domains) {</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.enforcement_literal().empty());</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordtype">bool</span> has_free_enforcement_literal = <span class="keyword">false</span>;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> enf : <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.enforcement_literal()) {</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> ((*domains)[<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(enf)].IsFixed()) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  has_free_enforcement_literal = <span class="keyword">true</span>;</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(enf)) {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  (*domains)[enf] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(0);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  (*domains)[<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(enf)] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(1);</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  }</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">if</span> (!has_free_enforcement_literal) {</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>)</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  << <span class="stringliteral">"Unsatisfied linear constraint with no free enforcement literal: "</span></div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  << <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ShortDebugString();</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  }</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> }</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span> <span class="comment">// Here we simply assign all non-fixed variable to a feasible value. Which</span></div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="comment">// should always exists by construction.</span></div><div class="line"><a name="l00107"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a86291d0b0cde06894aa6ee35a26e7aff"> 107</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a86291d0b0cde06894aa6ee35a26e7aff">PostsolveLinear</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>,</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keyword">const</span> std::vector<bool>& prefer_lower_value,</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  std::vector<Domain>* domains) {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  int64_t fixed_activity = 0;</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.linear().vars().size();</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  std::vector<int> free_vars;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  std::vector<int64_t> free_coeffs;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.linear().vars(i);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> int64_t coeff = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.linear().coeffs(i);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, domains->size());</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keywordflow">if</span> (coeff == 0) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keywordflow">if</span> ((*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].IsFixed()) {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  fixed_activity += (*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].FixedValue() * coeff;</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  free_vars.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  free_coeffs.push_back(coeff);</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  }</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  }</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (free_vars.empty()) {</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_domain.html">Domain</a> rhs = <a class="code" href="namespaceoperations__research_1_1sat.html#ab1240060466ba48a36a4b36379bce26a">ReadDomainFromProto</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.linear());</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keywordflow">if</span> (!rhs.<a class="code" href="classoperations__research_1_1_domain.html#a22c6c2f121586b5d76feb4b0e536dfde">Contains</a>(fixed_activity)) {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a73e2ec8896aa53a5c58f86dfd68e6f19">SetEnforcementLiteralToFalse</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, domains);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  }</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> </div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// Fast track for the most common case.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_domain.html">Domain</a> initial_rhs = <a class="code" href="namespaceoperations__research_1_1sat.html#ab1240060466ba48a36a4b36379bce26a">ReadDomainFromProto</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.linear());</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">if</span> (free_vars.size() == 1) {</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = free_vars[0];</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_domain.html">Domain</a> domain = initial_rhs.<a class="code" href="classoperations__research_1_1_domain.html#a4f9af4a46ee07931e3e5e50f6ddfb8ad">AdditionWith</a>(<a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(-fixed_activity))</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  .<a class="code" href="classoperations__research_1_1_domain.html#a1341b29865c5167a64de30c797672e4c">InverseMultiplicationBy</a>(free_coeffs[0])</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  .<a class="code" href="classoperations__research_1_1_domain.html#a835826c4c5129b74553042a357a721ff">IntersectionWith</a>((*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (domain.<a class="code" href="classoperations__research_1_1_domain.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()) {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a73e2ec8896aa53a5c58f86dfd68e6f19">SetEnforcementLiteralToFalse</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, domains);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = prefer_lower_value[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] ? domain.<a class="code" href="classoperations__research_1_1_domain.html#a8cf21a67f7d81a800ff912239bb2db64">Min</a>() : domain.<a class="code" href="classoperations__research_1_1_domain.html#aa74ea8cd1b0767659f704b482d07c103">Max</a>();</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  (*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  }</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// The postsolve code is a bit involved if there is more than one free</span></div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// variable, we have to postsolve them one by one.</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="comment">//</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// Here we recompute the same domains as during the presolve. Everything is</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// like if we where substiting the variable one by one:</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// terms[i] + fixed_activity \in rhs_domains[i]</span></div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// In the reverse order.</span></div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  std::vector<Domain> rhs_domains;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  rhs_domains.push_back(initial_rhs);</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i + 1 < free_vars.size(); ++i) {</div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="comment">// Note that these should be exactly the same computation as the one done</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  <span class="comment">// during presolve and should be exact. However, we have some tests that do</span></div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="comment">// not comply, so we don't check exactness here. Also, as long as we don't</span></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <span class="comment">// get empty domain below, and the complexity of the domain do not explode</span></div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="comment">// here, we should be fine.</span></div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <a class="code" href="classoperations__research_1_1_domain.html">Domain</a> term = (*domains)[free_vars[i]].<a class="code" href="classoperations__research_1_1_domain.html#a63a708c626b59b4504ddb879496c894e">MultiplicationBy</a>(-free_coeffs[i]);</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  rhs_domains.push_back(term.<a class="code" href="classoperations__research_1_1_domain.html#a4f9af4a46ee07931e3e5e50f6ddfb8ad">AdditionWith</a>(rhs_domains.back()));</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  }</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = free_vars.size() - 1; i >= 0; --i) {</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// Choose a value for free_vars[i] that fall into rhs_domains[i] -</span></div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// fixed_activity. This will crash if the intersection is empty, but it</span></div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">// shouldn't be.</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = free_vars[i];</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keyword">const</span> int64_t coeff = free_coeffs[i];</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1_domain.html">Domain</a> domain = rhs_domains[i]</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  .AdditionWith(<a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(-fixed_activity))</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  .InverseMultiplicationBy(coeff)</div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  .IntersectionWith((*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]);</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>  <span class="comment">// TODO(user): I am not 100% that the algo here might cover all the presolve</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// case, so if this fail, it might indicate an issue here and not in the</span></div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// presolve/solver code.</span></div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!domain.<a class="code" href="classoperations__research_1_1_domain.html#a8e12342fc420701fbffd97025421575a">IsEmpty</a>()) << <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ShortDebugString();</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = prefer_lower_value[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] ? domain.<a class="code" href="classoperations__research_1_1_domain.html#a8cf21a67f7d81a800ff912239bb2db64">Min</a>() : domain.<a class="code" href="classoperations__research_1_1_domain.html#aa74ea8cd1b0767659f704b482d07c103">Max</a>();</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  (*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  fixed_activity += coeff * <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(initial_rhs.<a class="code" href="classoperations__research_1_1_domain.html#a22c6c2f121586b5d76feb4b0e536dfde">Contains</a>(fixed_activity));</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> }</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> </div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// We assign any non fixed lhs variables to their minimum value. Then we assign</span></div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="comment">// the target to the max. This should always be feasible.</span></div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="comment">//</span></div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// Note(user): Our heuristic is not feasible if x = max(-x, ...) but we made</span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// sure we don't output such int_max here. Alternatively we could probably fix</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// the code here.</span></div><div class="line"><a name="l00197"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a5847f363a08e458c5af1c89ee1112a43"> 197</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a5847f363a08e458c5af1c89ee1112a43">PostsolveIntMax</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, std::vector<Domain>* domains) {</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  int64_t m = <a class="code" href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">std::numeric_limits<int64_t>::min</a>();</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> ref : <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.int_max().vars()) {</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">if</span> (!(*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].<a class="code" href="namespaceoperations__research_1_1sat.html#ace76b216f012cbdf1443670080329f6d">IsFixed</a>()) {</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// Assign to minimum value.</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> =</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? (*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].Min() : (*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].Max();</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  (*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  }</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span> </div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = (*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].FixedValue();</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  m = <a class="code" href="alldiff__cst_8cc.html#a26e6db9bcc64b584051ecc28171ed11f">std::max</a>(m, <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> : -<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a>);</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  }</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_ref = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.int_max().target();</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_var = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(target_ref);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(target_ref)) {</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  (*domains)[target_var] = (*domains)[target_var].IntersectionWith(<a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(m));</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  (*domains)[target_var] =</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  (*domains)[target_var].IntersectionWith(<a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(-m));</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  }</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!(*domains)[target_var].IsEmpty());</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span> }</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span> </div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// We only support 3 cases in the presolve currently.</span></div><div class="line"><a name="l00223"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a1743e4469ce5d2535719981c49544a5d"> 223</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a1743e4469ce5d2535719981c49544a5d">PostsolveElement</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, std::vector<Domain>* domains) {</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> index_ref = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.element().index();</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> index_var = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(index_ref);</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_ref = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.element().target();</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> target_var = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(target_ref);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="comment">// Deal with non-fixed target and non-fixed index. This only happen if</span></div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="comment">// whatever the value of the index and selected variable, we can choose a</span></div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="comment">// valid target, so we just fix the index to its min value in this case.</span></div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (!(*domains)[target_var].<a class="code" href="namespaceoperations__research_1_1sat.html#ace76b216f012cbdf1443670080329f6d">IsFixed</a>() && !(*domains)[index_var].<a class="code" href="namespaceoperations__research_1_1sat.html#ace76b216f012cbdf1443670080329f6d">IsFixed</a>()) {</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keyword">const</span> int64_t index_value = (*domains)[index_var].Min();</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  (*domains)[index_var] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(index_value);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span> </div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="comment">// If the selected variable is not fixed, we also need to fix it.</span></div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> selected_ref = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.element().vars(</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(index_ref) ? index_value : -index_value);</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> selected_var = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(selected_ref);</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">if</span> (!(*domains)[selected_var].<a class="code" href="namespaceoperations__research_1_1sat.html#ace76b216f012cbdf1443670080329f6d">IsFixed</a>()) {</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  (*domains)[selected_var] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>((*domains)[selected_var].Min());</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> </div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="comment">// Deal with fixed index (and constant vars).</span></div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">if</span> ((*domains)[index_var].<a class="code" href="namespaceoperations__research_1_1sat.html#ace76b216f012cbdf1443670080329f6d">IsFixed</a>()) {</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keyword">const</span> int64_t index_value = (*domains)[index_var].FixedValue();</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> selected_ref = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.element().vars(</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(index_ref) ? index_value : -index_value);</div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> selected_var = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(selected_ref);</div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="keyword">const</span> int64_t selected_value = (*domains)[selected_var].FixedValue();</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  (*domains)[target_var] = (*domains)[target_var].IntersectionWith(</div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(target_ref) == <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(selected_ref)</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  ? selected_value</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  : -selected_value));</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!(*domains)[target_var].IsEmpty());</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="comment">// Deal with fixed target (and constant vars).</span></div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <span class="keyword">const</span> int64_t target_value = (*domains)[target_var].FixedValue();</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordtype">int</span> selected_index_value = -1;</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> int64_t v : (*domains)[index_var].Values()) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">const</span> int64_t i = index_var == index_ref ? v : -v;</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">if</span> (i < 0 || i >= <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.element().vars_size()) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> ref = <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.element().vars(i);</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref);</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keyword">const</span> int64_t <a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> = (*domains)[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].FixedValue();</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">if</span> (<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(target_ref) == <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref)) {</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == target_value) {</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  selected_index_value = i;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">break</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="keywordflow">else</span> {</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#ac072af30c4ffbc834bb4c681f6ecb514">value</a> == -target_value) {</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  selected_index_value = i;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">break</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>  }</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  }</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span> </div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(selected_index_value, -1);</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  (*domains)[index_var] = (*domains)[index_var].IntersectionWith(<a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(index_var) ? selected_index_value : -selected_index_value));</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!(*domains)[index_var].IsEmpty());</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"><a class="line" href="namespaceoperations__research_1_1sat.html#a307b9498d713901699c14bb6833c9812"> 289</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a307b9498d713901699c14bb6833c9812">PostsolveResponse</a>(<span class="keyword">const</span> int64_t num_variables_in_original_model,</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html">CpModelProto</a>& mapping_proto,</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> std::vector<int>& postsolve_mapping,</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <a class="code" href="classoperations__research_1_1sat_1_1_cp_solver_response.html">CpSolverResponse</a>* <a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>) {</div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// Map back the sufficient assumptions for infeasibility.</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span>& ref :</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  *(<a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>->mutable_sufficient_assumptions_for_infeasibility())) {</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  ref = <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(ref) ? postsolve_mapping[ref]</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  : <a class="code" href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">NegatedRef</a>(postsolve_mapping[<a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(ref)]);</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  }</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span> </div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// Abort if no solution or something is wrong.</span></div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>->status() != <a class="code" href="namespaceoperations__research_1_1data_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a03f919221217f95d21a593a7120165e1">CpSolverStatus::FEASIBLE</a> &&</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>->status() != <a class="code" href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">CpSolverStatus::OPTIMAL</a>) {</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  }</div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>->solution_size() != postsolve_mapping.size()) <span class="keywordflow">return</span>;</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> </div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="comment">// Read the initial variable domains, either from the fixed solution of the</span></div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="comment">// presolved problems or from the mapping model.</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  std::vector<Domain> domains(mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">variables_size</a>());</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < postsolve_mapping.size(); ++i) {</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(postsolve_mapping[i], domains.size());</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  domains[postsolve_mapping[i]] = <a class="code" href="classoperations__research_1_1_domain.html">Domain</a>(<a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>->solution(i));</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < domains.size(); ++i) {</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  <span class="keywordflow">if</span> (domains[i].IsEmpty()) {</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  domains[i] = <a class="code" href="namespaceoperations__research_1_1sat.html#ab1240060466ba48a36a4b36379bce26a">ReadDomainFromProto</a>(mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6a4544ca20489d70e302f5d6d374a012">variables</a>(i));</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!domains[i].IsEmpty());</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  }</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> </div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Some free variable should be fixed towards their good objective direction.</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">//</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// TODO(user): currently the objective is not part of the mapping_proto, so</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="comment">// this shouldn't matter for our current presolve reduction.</span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a777a6e330a22a8889389cb9b9c9f12d6">has_objective</a>());</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  std::vector<bool> prefer_lower_value(domains.size(), <span class="keyword">true</span>);</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  <span class="keywordflow">if</span> (mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a777a6e330a22a8889389cb9b9c9f12d6">has_objective</a>()) {</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a2787b866382b560920d55ce5cf129920">objective</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#ac7a72ff7bd5bde08ba00f944c5aa3168">vars</a>().size();</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < size; ++i) {</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a2787b866382b560920d55ce5cf129920">objective</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#ac7a72ff7bd5bde08ba00f944c5aa3168">vars</a>(i);</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  int64_t coeff = mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a2787b866382b560920d55ce5cf129920">objective</a>().<a class="code" href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#a50faf32570e4f9cd348c797231fe35e0">coeffs</a>(i);</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  coeff = -coeff;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  }</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  prefer_lower_value[i] = (coeff >= 0);</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  }</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  }</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> </div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// Process the constraints in reverse order.</span></div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_constraints = mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">constraints_size</a>();</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_constraints - 1; i >= 0; i--) {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html">ConstraintProto</a>& <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a> = mapping_proto.<a class="code" href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">constraints</a>(i);</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="comment">// We ignore constraint with an enforcement literal set to false. If the</span></div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// enforcement is still unclear, we still process this constraint.</span></div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordtype">bool</span> constraint_can_be_ignored = <span class="keyword">false</span>;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> enf : <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.enforcement_literal()) {</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">PositiveRef</a>(enf);</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> is_false =</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  domains[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].IsFixed() &&</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">RefIsPositive</a>(enf) == (domains[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>].FixedValue() == 0);</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">if</span> (is_false) {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  constraint_can_be_ignored = <span class="keyword">true</span>;</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">break</span>;</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>  }</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  <span class="keywordflow">if</span> (constraint_can_be_ignored) <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span> </div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="keywordflow">switch</span> (<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.constraint_case()) {</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aaadb0c3370c597095e0cb7e768f04567">ConstraintProto::kBoolOr</a>:</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#ab67697c2e8ba7d65eff35db17d7b94a9">PostsolveClause</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, &domains);</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ad60570d9bed938f8b11385a7ba7f3508">ConstraintProto::kExactlyOne</a>:</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a62feb42f880fdeb019acf6a06cff70c1">PostsolveExactlyOne</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, &domains);</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ac188c019178783e5be55110601309d7d">ConstraintProto::kLinear</a>:</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a86291d0b0cde06894aa6ee35a26e7aff">PostsolveLinear</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, prefer_lower_value, &domains);</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a4d3274f97b77566895b3a239ed62bb72">ConstraintProto::kIntMax</a>:</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a5847f363a08e458c5af1c89ee1112a43">PostsolveIntMax</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, &domains);</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">case</span> <a class="code" href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35acd33b6e972e153ab1a911c84c9585a42">ConstraintProto::kElement</a>:</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a1743e4469ce5d2535719981c49544a5d">PostsolveElement</a>(<a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>, &domains);</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">// This should never happen as we control what kind of constraint we</span></div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">// add to the mapping_proto;</span></div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Unsupported constraint: "</span> << <a class="code" href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a>.ShortDebugString();</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  }</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> </div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// Fill the response. Maybe fix some still unfixed variable.</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>->mutable_solution()->Clear();</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(num_variables_in_original_model, domains.size());</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < num_variables_in_original_model; ++i) {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">if</span> (prefer_lower_value[i]) {</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>->add_solution(domains[i].Min());</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <a class="code" href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a>->add_solution(domains[i].Max());</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  }</div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> }</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span> </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> } <span class="comment">// namespace sat</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> } <span class="comment">// namespace operations_research</span></div><div class="ttc" id="base_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00491">base/logging.h:491</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a307b9498d713901699c14bb6833c9812"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a307b9498d713901699c14bb6833c9812">operations_research::sat::PostsolveResponse</a></div><div class="ttdeci">void PostsolveResponse(const int64_t num_variables_in_original_model, const CpModelProto &mapping_proto, const std::vector< int > &postsolve_mapping, CpSolverResponse *response)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__postsolve_8cc_source.html#l00289">cp_model_postsolve.cc:289</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35ac188c019178783e5be55110601309d7d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ac188c019178783e5be55110601309d7d">operations_research::sat::ConstraintProto::kLinear</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03917">cp_model.pb.h:3917</a></div></div>
|
|
<div class="ttc" id="alldiff__cst_8cc_html_ad10edae0a852d72fb76afb1c77735045"><div class="ttname"><a href="alldiff__cst_8cc.html#ad10edae0a852d72fb76afb1c77735045">min</a></div><div class="ttdeci">int64_t min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_a1341b29865c5167a64de30c797672e4c"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a1341b29865c5167a64de30c797672e4c">operations_research::Domain::InverseMultiplicationBy</a></div><div class="ttdeci">Domain InverseMultiplicationBy(const int64_t coeff) const</div><div class="ttdoc">Returns {x ∈ Int64, ∃ e ∈ D, x * coeff = e}.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00457">sorted_interval_list.cc:457</a></div></div>
|
|
<div class="ttc" id="log__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35aaadb0c3370c597095e0cb7e768f04567"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35aaadb0c3370c597095e0cb7e768f04567">operations_research::sat::ConstraintProto::kBoolOr</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03905">cp_model.pb.h:3905</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_acdbc8ad33149d45a6e6fcd8b72fd68ed"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acdbc8ad33149d45a6e6fcd8b72fd68ed">operations_research::sat::PositiveRef</a></div><div class="ttdeci">int PositiveRef(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00035">cp_model_utils.h:35</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00416">base/logging.h:416</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_abef5f55c3278c137faca92b8e433f8ea"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#abef5f55c3278c137faca92b8e433f8ea">operations_research::sat::CpModelProto::variables_size</a></div><div class="ttdeci">int variables_size() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12036">cp_model.pb.h:12036</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ab67697c2e8ba7d65eff35db17d7b94a9"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab67697c2e8ba7d65eff35db17d7b94a9">operations_research::sat::PostsolveClause</a></div><div class="ttdeci">void PostsolveClause(const ConstraintProto &ct, std::vector< Domain > *domains)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__postsolve_8cc_source.html#l00030">cp_model_postsolve.cc:30</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_aa74ea8cd1b0767659f704b482d07c103"><div class="ttname"><a href="classoperations__research_1_1_domain.html#aa74ea8cd1b0767659f704b482d07c103">operations_research::Domain::Max</a></div><div class="ttdeci">int64_t Max() const</div><div class="ttdoc">Returns the max value of the domain.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00213">sorted_interval_list.cc:213</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_solver_response_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_solver_response.html">operations_research::sat::CpSolverResponse</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l06264">cp_model.pb.h:6264</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#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_objective_proto_html_ac7a72ff7bd5bde08ba00f944c5aa3168"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#ac7a72ff7bd5bde08ba00f944c5aa3168">operations_research::sat::CpObjectiveProto::vars</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int32 vars(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11248">cp_model.pb.h:11248</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_cp_model_proto_html_a6a4544ca20489d70e302f5d6d374a012"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a6a4544ca20489d70e302f5d6d374a012">operations_research::sat::CpModelProto::variables</a></div><div class="ttdeci">const ::operations_research::sat::IntegerVariableProto & variables(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12054">cp_model.pb.h:12054</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html">operations_research::sat::ConstraintProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03865">cp_model.pb.h:3865</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_a8cf21a67f7d81a800ff912239bb2db64"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a8cf21a67f7d81a800ff912239bb2db64">operations_research::Domain::Min</a></div><div class="ttdeci">int64_t Min() const</div><div class="ttdoc">Returns the min value of the domain.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00208">sorted_interval_list.cc:208</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html">operations_research::sat::CpModelProto</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l05975">cp_model.pb.h:5975</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae4db23f10f5d4aad6d735f5a74cd6f8c"><div class="ttname"><a href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a></div><div class="ttdeci">#define CHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00700">base/logging.h:700</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35ad60570d9bed938f8b11385a7ba7f3508"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35ad60570d9bed938f8b11385a7ba7f3508">operations_research::sat::ConstraintProto::kExactlyOne</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03908">cp_model.pb.h:3908</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_afce66afa8ae7776a449bba7313ea3559"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#afce66afa8ae7776a449bba7313ea3559">operations_research::sat::CpModelProto::constraints</a></div><div class="ttdeci">const ::operations_research::sat::ConstraintProto & constraints(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12094">cp_model.pb.h:12094</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ae0803b8198728cd4f6e58498d9c60091"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ae0803b8198728cd4f6e58498d9c60091">operations_research::sat::NegatedRef</a></div><div class="ttdeci">int NegatedRef(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00034">cp_model_utils.h:34</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_ace76b216f012cbdf1443670080329f6d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ace76b216f012cbdf1443670080329f6d">operations_research::sat::IsFixed</a></div><div class="ttdeci">std::function< bool(const Model &)> IsFixed(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01536">integer.h:1536</a></div></div>
|
|
<div class="ttc" id="cp__model__utils_8h_html"><div class="ttname"><a href="cp__model__utils_8h.html">cp_model_utils.h</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_a2787b866382b560920d55ce5cf129920"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a2787b866382b560920d55ce5cf129920">operations_research::sat::CpModelProto::objective</a></div><div class="ttdeci">const ::operations_research::sat::CpObjectiveProto & objective() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12130">cp_model.pb.h:12130</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_objective_proto_html_a50faf32570e4f9cd348c797231fe35e0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_objective_proto.html#a50faf32570e4f9cd348c797231fe35e0">operations_research::sat::CpObjectiveProto::coeffs</a></div><div class="ttdeci">::PROTOBUF_NAMESPACE_ID::int64 coeffs(int index) const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l11295">cp_model.pb.h:11295</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_a835826c4c5129b74553042a357a721ff"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a835826c4c5129b74553042a357a721ff">operations_research::Domain::IntersectionWith</a></div><div class="ttdeci">Domain IntersectionWith(const Domain &domain) const</div><div class="ttdoc">Returns the intersection of D and domain.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00297">sorted_interval_list.cc:297</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_a63a708c626b59b4504ddb879496c894e"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a63a708c626b59b4504ddb879496c894e">operations_research::Domain::MultiplicationBy</a></div><div class="ttdeci">Domain MultiplicationBy(int64_t coeff, bool *exact=nullptr) const</div><div class="ttdoc">Returns {x ∈ Int64, ∃ e ∈ D, x = e * coeff}.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00376">sorted_interval_list.cc:376</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_aeaf0da781ca9b370d96b7fbd3f74266a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#aeaf0da781ca9b370d96b7fbd3f74266a">operations_research::sat::CpModelProto::constraints_size</a></div><div class="ttdeci">int constraints_size() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12076">cp_model.pb.h:12076</a></div></div>
|
|
<div class="ttc" id="cp__model__solver_8cc_html_abcd33b18ce6d5a90a4ba5c37cfa58829"><div class="ttname"><a href="cp__model__solver_8cc.html#abcd33b18ce6d5a90a4ba5c37cfa58829">response</a></div><div class="ttdeci">SharedResponseManager * response</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02015">cp_model_solver.cc:2015</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a1743e4469ce5d2535719981c49544a5d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1743e4469ce5d2535719981c49544a5d">operations_research::sat::PostsolveElement</a></div><div class="ttdeci">void PostsolveElement(const ConstraintProto &ct, std::vector< Domain > *domains)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__postsolve_8cc_source.html#l00223">cp_model_postsolve.cc:223</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_a4f9af4a46ee07931e3e5e50f6ddfb8ad"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a4f9af4a46ee07931e3e5e50f6ddfb8ad">operations_research::Domain::AdditionWith</a></div><div class="ttdeci">Domain AdditionWith(const Domain &domain) const</div><div class="ttdoc">Returns {x ∈ Int64, ∃ a ∈ D, ∃ b ∈ domain, x = a + b}.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00347">sorted_interval_list.cc:347</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_cp_model_proto_html_a777a6e330a22a8889389cb9b9c9f12d6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_cp_model_proto.html#a777a6e330a22a8889389cb9b9c9f12d6">operations_research::sat::CpModelProto::has_objective</a></div><div class="ttdeci">bool has_objective() const</div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l12116">cp_model.pb.h:12116</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a5847f363a08e458c5af1c89ee1112a43"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5847f363a08e458c5af1c89ee1112a43">operations_research::sat::PostsolveIntMax</a></div><div class="ttdeci">void PostsolveIntMax(const ConstraintProto &ct, std::vector< Domain > *domains)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__postsolve_8cc_source.html#l00197">cp_model_postsolve.cc:197</a></div></div>
|
|
<div class="ttc" id="cp__model__postsolve_8h_html"><div class="ttname"><a href="cp__model__postsolve_8h.html">cp_model_postsolve.h</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a62feb42f880fdeb019acf6a06cff70c1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a62feb42f880fdeb019acf6a06cff70c1">operations_research::sat::PostsolveExactlyOne</a></div><div class="ttdeci">void PostsolveExactlyOne(const ConstraintProto &ct, std::vector< Domain > *domains)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__postsolve_8cc_source.html#l00053">cp_model_postsolve.cc:53</a></div></div>
|
|
<div class="ttc" id="base_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html"><div class="ttname"><a href="classoperations__research_1_1_domain.html">operations_research::Domain</a></div><div class="ttdoc">We call domain any subset of Int64 = [kint64min, kint64max].</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8h_source.html#l00081">sorted_interval_list.h:81</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_a22c6c2f121586b5d76feb4b0e536dfde"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a22c6c2f121586b5d76feb4b0e536dfde">operations_research::Domain::Contains</a></div><div class="ttdeci">bool Contains(int64_t value) const</div><div class="ttdoc">Returns true iff value is in Domain.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00236">sorted_interval_list.cc:236</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a73e2ec8896aa53a5c58f86dfd68e6f19"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a73e2ec8896aa53a5c58f86dfd68e6f19">operations_research::sat::SetEnforcementLiteralToFalse</a></div><div class="ttdeci">void SetEnforcementLiteralToFalse(const ConstraintProto &ct, std::vector< Domain > *domains)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__postsolve_8cc_source.html#l00084">cp_model_postsolve.cc:84</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html_aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293"><div class="ttname"><a href="namespaceoperations__research.html#aa0787bf78fb09d1e30f2451b5a68d4b8af00c8dbdd6e1f11bdae06be94277d293">operations_research::DimensionSchedulingStatus::OPTIMAL</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a86291d0b0cde06894aa6ee35a26e7aff"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a86291d0b0cde06894aa6ee35a26e7aff">operations_research::sat::PostsolveLinear</a></div><div class="ttdeci">void PostsolveLinear(const ConstraintProto &ct, const std::vector< bool > &prefer_lower_value, std::vector< Domain > *domains)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__postsolve_8cc_source.html#l00107">cp_model_postsolve.cc:107</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1sat_html_a217338425de4389014563f1f24331713"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a217338425de4389014563f1f24331713">operations_research::sat::RefIsPositive</a></div><div class="ttdeci">bool RefIsPositive(int ref)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00036">cp_model_utils.h:36</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="namespaceoperations__research_1_1sat_html_ab1240060466ba48a36a4b36379bce26a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab1240060466ba48a36a4b36379bce26a">operations_research::sat::ReadDomainFromProto</a></div><div class="ttdeci">Domain ReadDomainFromProto(const ProtoWithDomain &proto)</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__utils_8h_source.html#l00104">cp_model_utils.h:104</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1_domain_html_a8e12342fc420701fbffd97025421575a"><div class="ttname"><a href="classoperations__research_1_1_domain.html#a8e12342fc420701fbffd97025421575a">operations_research::Domain::IsEmpty</a></div><div class="ttdeci">bool IsEmpty() const</div><div class="ttdoc">Returns true if this is the empty set.</div><div class="ttdef"><b>Definition:</b> <a href="sorted__interval__list_8cc_source.html#l00192">sorted_interval_list.cc:192</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="base_2logging_8h_html_ab25e01a2942b821d66371fc68d53f2eb"><div class="ttname"><a href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a></div><div class="ttdeci">#define CHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00699">base/logging.h:699</a></div></div>
|
|
<div class="ttc" id="demon__profiler_8cc_html_a05da18ca9c7b657a4a6ea24e07c9b695"><div class="ttname"><a href="demon__profiler_8cc.html#a05da18ca9c7b657a4a6ea24e07c9b695">ct</a></div><div class="ttdeci">const Constraint * ct</div><div class="ttdef"><b>Definition:</b> <a href="demon__profiler_8cc_source.html#l00043">demon_profiler.cc:43</a></div></div>
|
|
<div class="ttc" id="namespaceoperations__research_1_1data_1_1vbp_html_a4604191fbd84a43686f44c25d7bd0161a03f919221217f95d21a593a7120165e1"><div class="ttname"><a href="namespaceoperations__research_1_1data_1_1vbp.html#a4604191fbd84a43686f44c25d7bd0161a03f919221217f95d21a593a7120165e1">operations_research::data::vbp::FEASIBLE</a></div><div class="ttdef"><b>Definition:</b> <a href="vector__bin__packing_8pb_8h_source.html#l00088">vector_bin_packing.pb.h:88</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35acd33b6e972e153ab1a911c84c9585a42"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35acd33b6e972e153ab1a911c84c9585a42">operations_research::sat::ConstraintProto::kElement</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03919">cp_model.pb.h:3919</a></div></div>
|
|
<div class="ttc" id="classoperations__research_1_1sat_1_1_constraint_proto_html_ada030f50fcddb646af448ac7c5705e35a4d3274f97b77566895b3a239ed62bb72"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_constraint_proto.html#ada030f50fcddb646af448ac7c5705e35a4d3274f97b77566895b3a239ed62bb72">operations_research::sat::ConstraintProto::kIntMax</a></div><div class="ttdef"><b>Definition:</b> <a href="cp__model_8pb_8h_source.html#l03912">cp_model.pb.h:3912</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="cp__model__postsolve_8cc.html">cp_model_postsolve.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>
|