1361 lines
263 KiB
HTML
1361 lines
263 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.20"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: pb_constraint.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>
|
|
<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">8.1</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.20 -->
|
|
<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('pb__constraint_8cc_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle">
|
|
<div class="title">pb_constraint.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="pb__constraint_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-2018 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="pb__constraint_8h.html">ortools/sat/pb_constraint.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 <utility></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span>  </div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include "absl/strings/str_format.h"</span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="thorough__hash_8h.html">ortools/base/thorough_hash.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="saturated__arithmetic_8h.html">ortools/util/saturated_arithmetic.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span>  </div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span>  </div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keywordtype">bool</span> LiteralComparator(<span class="keyword">const</span> LiteralWithCoeff& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> LiteralWithCoeff& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.literal.Index() < <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.literal.Index();</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> }</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  </div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keywordtype">bool</span> CoeffComparator(<span class="keyword">const</span> LiteralWithCoeff& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> LiteralWithCoeff& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">if</span> (<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.coefficient == <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.coefficient) {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.literal.Index() < <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.literal.Index();</div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  }</div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="keywordflow">return</span> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.coefficient < <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>.coefficient;</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span> }</div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  </div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span> } <span class="comment">// namespace</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"><a class="line" href="namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e"> 41</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e">ComputeBooleanLinearExpressionCanonicalForm</a>(</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  std::vector<LiteralWithCoeff>* cst, Coefficient* bound_shift,</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  Coefficient* max_value) {</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// Note(user): For some reason, the IntType checking doesn't work here ?! that</span></div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// is a bit worrying, but the code seems to behave correctly.</span></div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  *bound_shift = 0;</div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  *max_value = 0;</div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  </div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// First, sort by literal to remove duplicate literals.</span></div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">// This also remove term with a zero coefficient.</span></div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  std::sort(cst->begin(), cst->end(), LiteralComparator);</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>* <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a> = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cst->size(); ++i) {</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a> current = (*cst)[i];</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keywordflow">if</span> (current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">coefficient</a> == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">if</span> (<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a> != <span class="keyword">nullptr</span> &&</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">Variable</a>() == <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>->literal.Variable()) {</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">if</span> (current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> == <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>->literal) {</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">coefficient</a>, &(<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>->coefficient))) {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  }</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// Here current_literal is equal to (1 - representative).</span></div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(-current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">coefficient</a>,</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  &(<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>->coefficient))) {</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  }</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(-current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">coefficient</a>, bound_shift)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  }</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">if</span> (<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a> != <span class="keyword">nullptr</span> && <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>->coefficient == 0) {</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  --<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</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>  (*cst)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = current;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a> = &((*cst)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>]);</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  }</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  }</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  <span class="keywordflow">if</span> (<a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a> != <span class="keyword">nullptr</span> && <a class="code" href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a>->coefficient == 0) {</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  --<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  }</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  cst->resize(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  </div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="comment">// Then, make all coefficients positive by replacing a term "-c x" into</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="comment">// "c(1-x) - c" which is the same as "c(not x) - c".</span></div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cst->size(); ++i) {</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a> current = (*cst)[i];</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">if</span> (current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">coefficient</a> < 0) {</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(-current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">coefficient</a>, bound_shift)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  (*cst)[i].<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">coefficient</a> = -current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">coefficient</a>;</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  (*cst)[i].literal = current.<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>((*cst)[i].<a class="code" href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a>, max_value)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  </div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="comment">// Finally sort by increasing coefficients.</span></div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  std::sort(cst->begin(), cst->end(), CoeffComparator);</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(*max_value, 0);</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span> }</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  </div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a562245e719610d5969ca1b4b1b310c9d"> 103</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a562245e719610d5969ca1b4b1b310c9d">ApplyLiteralMapping</a>(</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">const</span> <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, LiteralIndex></a>& mapping,</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  std::vector<LiteralWithCoeff>* cst, Coefficient* bound_shift,</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  Coefficient* max_value) {</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0;</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  Coefficient shift_due_to_fixed_variables(0);</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>& entry : *cst) {</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">if</span> (mapping[entry.literal.Index()] >= 0) {</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  (*cst)[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = <a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(mapping[entry.literal.Index()]),</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  entry.coefficient);</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (mapping[entry.literal.Index()] == <a class="code" href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">kTrueLiteralIndex</a>) {</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(-entry.coefficient, &shift_due_to_fixed_variables)) {</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="comment">// Nothing to do if the literal is false.</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(mapping[entry.literal.Index()], <a class="code" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a>);</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  }</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  cst->resize(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>);</div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="keywordflow">if</span> (cst->empty()) {</div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  *bound_shift = shift_due_to_fixed_variables;</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  *max_value = 0;</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> result =</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e">ComputeBooleanLinearExpressionCanonicalForm</a>(cst, bound_shift, max_value);</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(shift_due_to_fixed_variables, bound_shift)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span> }</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  </div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// TODO(user): Also check for no duplicates literals + unit tests.</span></div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#acf18431db5241d6ae15e5db2470d9079"> 136</a></span> <span class="keywordtype">bool</span> <a class="code" href="namespaceoperations__research_1_1sat.html#acf18431db5241d6ae15e5db2470d9079">BooleanLinearExpressionIsCanonical</a>(</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> std::vector<LiteralWithCoeff>& cst) {</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  Coefficient previous(1);</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a> term : cst) {</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">if</span> (term.coefficient < previous) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  previous = term.coefficient;</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  }</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">return</span> <span class="keyword">true</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>  </div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="comment">// TODO(user): Use more complex simplification like dividing by the gcd of</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// everyone and using less different coefficients if possible.</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a740bdf0c6c84d1fd07e8405fac06e04e"> 148</a></span> <span class="keywordtype">void</span> <a class="code" href="namespaceoperations__research_1_1sat.html#a740bdf0c6c84d1fd07e8405fac06e04e">SimplifyCanonicalBooleanLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  std::vector<LiteralWithCoeff>* cst, Coefficient* rhs) {</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="comment">// Replace all coefficient >= rhs by rhs + 1 (these literal must actually be</span></div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="comment">// false). Note that the linear sum of literals remains canonical.</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">// TODO(user): It is probably better to remove these literals and have other</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// constraint setting them to false from the symmetry finder perspective.</span></div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>& x : *cst) {</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="keywordflow">if</span> (x.coefficient > *rhs) x.coefficient = *rhs + 1;</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span> }</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  </div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a01c76d0c46e2975d10e45ab04877f4ac"> 160</a></span> Coefficient <a class="code" href="namespaceoperations__research_1_1sat.html#a01c76d0c46e2975d10e45ab04877f4ac">ComputeCanonicalRhs</a>(Coefficient upper_bound,</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  Coefficient bound_shift,</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  Coefficient max_value) {</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  Coefficient rhs = upper_bound;</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(bound_shift, &rhs)) {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">if</span> (bound_shift > 0) {</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  <span class="comment">// Positive overflow. The constraint is trivially true.</span></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="comment">// This is because the canonical linear expression is in [0, max_value].</span></div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">return</span> max_value;</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// Negative overflow. The constraint is infeasible.</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="keywordflow">return</span> Coefficient(-1);</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  }</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  }</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">if</span> (rhs < 0) <span class="keywordflow">return</span> Coefficient(-1);</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordflow">return</span> <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(max_value, rhs);</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span> }</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a5c5399274f079c718ec46bf4b3032d27"> 178</a></span> Coefficient <a class="code" href="namespaceoperations__research_1_1sat.html#a5c5399274f079c718ec46bf4b3032d27">ComputeNegatedCanonicalRhs</a>(Coefficient lower_bound,</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  Coefficient bound_shift,</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  Coefficient max_value) {</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// The new bound is "max_value - (lower_bound + bound_shift)", but we must</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// pay attention to possible overflows.</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  Coefficient shifted_lb = lower_bound;</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">SafeAddInto</a>(bound_shift, &shifted_lb)) {</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordflow">if</span> (bound_shift > 0) {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Positive overflow. The constraint is infeasible.</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="keywordflow">return</span> Coefficient(-1);</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  <span class="comment">// Negative overflow. The constraint is trivialy satisfiable.</span></div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keywordflow">return</span> max_value;</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  }</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  }</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">if</span> (shifted_lb <= 0) {</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  <span class="comment">// If shifted_lb <= 0 then the constraint is trivialy satisfiable. We test</span></div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="comment">// this so we are sure that max_value - shifted_lb doesn't overflow below.</span></div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">return</span> max_value;</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  }</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">return</span> max_value - shifted_lb;</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span> }</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  </div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a05c49a95f6af6f8d873c96cae6ab6653"> 201</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a05c49a95f6af6f8d873c96cae6ab6653">CanonicalBooleanLinearProblem::AddLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordtype">bool</span> use_lower_bound, Coefficient lower_bound, <span class="keywordtype">bool</span> use_upper_bound,</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  Coefficient upper_bound, std::vector<LiteralWithCoeff>* cst) {</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <span class="comment">// Canonicalize the linear expression of the constraint.</span></div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  Coefficient bound_shift;</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  Coefficient max_value;</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <span class="keywordflow">if</span> (!<a class="code" href="namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e">ComputeBooleanLinearExpressionCanonicalForm</a>(cst, &bound_shift,</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  &max_value)) {</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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="keywordflow">if</span> (use_upper_bound) {</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> Coefficient rhs =</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a01c76d0c46e2975d10e45ab04877f4ac">ComputeCanonicalRhs</a>(upper_bound, bound_shift, max_value);</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="keywordflow">if</span> (!AddConstraint(*cst, max_value, rhs)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  }</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">if</span> (use_lower_bound) {</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  <span class="comment">// We transform the constraint into an upper-bounded one.</span></div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < cst->size(); ++i) {</div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  (*cst)[i].literal = (*cst)[i].literal.Negated();</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>  <span class="keyword">const</span> Coefficient rhs =</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a5c5399274f079c718ec46bf4b3032d27">ComputeNegatedCanonicalRhs</a>(lower_bound, bound_shift, max_value);</div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="keywordflow">if</span> (!AddConstraint(*cst, max_value, rhs)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  }</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> }</div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  </div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="keywordtype">bool</span> CanonicalBooleanLinearProblem::AddConstraint(</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keyword">const</span> std::vector<LiteralWithCoeff>& cst, Coefficient max_value,</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  Coefficient rhs) {</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">if</span> (rhs < 0) <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// Trivially unsatisfiable.</span></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (rhs >= max_value) <span class="keywordflow">return</span> <span class="keyword">true</span>; <span class="comment">// Trivially satisfiable.</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  constraints_.emplace_back(cst.begin(), cst.end());</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  rhs_.push_back(rhs);</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <a class="code" href="namespaceoperations__research_1_1sat.html#a740bdf0c6c84d1fd07e8405fac06e04e">SimplifyCanonicalBooleanLinearConstraint</a>(&constraints_.back(), &rhs_.back());</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span> }</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  </div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac85244c6eaf57970b2057657ae70ee17"> 239</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac85244c6eaf57970b2057657ae70ee17">MutableUpperBoundedLinearConstraint::ClearAndResize</a>(<span class="keywordtype">int</span> num_variables) {</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">if</span> (terms_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>() != num_variables) {</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  terms_.<a class="code" href="classabsl_1_1_strong_vector.html#a184fe69018ae421dcf31c964bfe40576">assign</a>(num_variables, Coefficient(0));</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  non_zeros_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(BooleanVariable(num_variables));</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  rhs_ = 0;</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  max_sum_ = 0;</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>();</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span> }</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  </div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aa7d76b766faf39c1652b6617eac5fe20"> 250</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aa7d76b766faf39c1652b6617eac5fe20">MutableUpperBoundedLinearConstraint::ClearAll</a>() {</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <span class="comment">// TODO(user): We could be more efficient and have only one loop here.</span></div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : non_zeros_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = Coefficient(0);</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  }</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  non_zeros_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>();</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  rhs_ = 0;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  max_sum_ = 0;</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">// TODO(user): Also reduce the trivially false literal when coeff > rhs_ ?</span></div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a16645beea614ddea591b722904131da9"> 261</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a16645beea614ddea591b722904131da9">MutableUpperBoundedLinearConstraint::ReduceCoefficients</a>() {</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(rhs_, max_sum_) << <span class="stringliteral">"Trivially sat."</span>;</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  Coefficient removed_sum(0);</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keyword">const</span> Coefficient <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = max_sum_ - rhs_;</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a5a8bf8a7daa44c4c35f8aa05a84c19ba">PossibleNonZeros</a>()) {</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keyword">const</span> Coefficient diff = <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) - <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>;</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">if</span> (diff > 0) {</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  removed_sum += diff;</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = (terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] > 0) ? <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> : -<a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>;</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  rhs_ -= removed_sum;</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  max_sum_ -= removed_sum;</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(max_sum_, ComputeMaxSum());</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span> }</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  </div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a6097c48821f010becb9a6910f4c39288"> 277</a></span> std::string <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a6097c48821f010becb9a6910f4c39288">MutableUpperBoundedLinearConstraint::DebugString</a>() {</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  std::string result;</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a5a8bf8a7daa44c4c35f8aa05a84c19ba">PossibleNonZeros</a>()) {</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="keywordflow">if</span> (!result.empty()) result += <span class="stringliteral">" + "</span>;</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  result += absl::StrFormat(<span class="stringliteral">"%d[%s]"</span>, <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>(),</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a2296cbfc427d1ccfb3ecc7d0ced18b01">GetLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a6097c48821f010becb9a6910f4c39288">DebugString</a>());</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  }</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  result += absl::StrFormat(<span class="stringliteral">" <= %d"</span>, rhs_.value());</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span> }</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  </div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span> <span class="comment">// TODO(user): Keep this for DCHECK(), but maintain the slack incrementally</span></div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// instead of recomputing it.</span></div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39"> 290</a></span> Coefficient <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39">MutableUpperBoundedLinearConstraint::ComputeSlackForTrailPrefix</a>(</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, <span class="keywordtype">int</span> trail_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  Coefficient activity(0);</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a5a8bf8a7daa44c4c35f8aa05a84c19ba">PossibleNonZeros</a>()) {</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a2296cbfc427d1ccfb3ecc7d0ced18b01">GetLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) &&</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> < trail_index) {</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  activity += <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</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="keywordflow">return</span> rhs_ - activity;</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span> }</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  </div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a34a2ab35db64cd0574f980eb99d34a89"> 303</a></span> Coefficient <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a34a2ab35db64cd0574f980eb99d34a89">MutableUpperBoundedLinearConstraint::</a></div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span> <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a34a2ab35db64cd0574f980eb99d34a89"> ReduceCoefficientsAndComputeSlackForTrailPrefix</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail,</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordtype">int</span> trail_index) {</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  Coefficient activity(0);</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  Coefficient removed_sum(0);</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <span class="keyword">const</span> Coefficient <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> = max_sum_ - rhs_;</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a5a8bf8a7daa44c4c35f8aa05a84c19ba">PossibleNonZeros</a>()) {</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="keyword">const</span> Coefficient diff = <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) - <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>;</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="keywordflow">if</span> (trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a2296cbfc427d1ccfb3ecc7d0ced18b01">GetLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) &&</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> < trail_index) {</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="keywordflow">if</span> (diff > 0) {</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  removed_sum += diff;</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = (terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] > 0) ? <a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a> : -<a class="code" href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a>;</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>  activity += <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// Because we assume the slack (rhs - activity) to be negative, we have</span></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// coeff + rhs - max_sum_ <= coeff + rhs - (activity + coeff)</span></div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// <= slack</span></div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// < 0</span></div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(diff, 0);</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  }</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  rhs_ -= removed_sum;</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  max_sum_ -= removed_sum;</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(max_sum_, ComputeMaxSum());</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="keywordflow">return</span> rhs_ - activity;</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span> }</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  </div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3d589ce2855e8e0e57354f33d73123e2"> 333</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3d589ce2855e8e0e57354f33d73123e2">MutableUpperBoundedLinearConstraint::ReduceSlackTo</a>(</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, <span class="keywordtype">int</span> trail_index, Coefficient initial_slack,</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  Coefficient target) {</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// Positive slack.</span></div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keyword">const</span> Coefficient slack = initial_slack;</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(slack, <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39">ComputeSlackForTrailPrefix</a>(trail, trail_index));</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(target, slack);</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(target, 0);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  </div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// This is not stricly needed, but true in our use case:</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// The variable assigned at trail_index was causing a conflict.</span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">const</span> Coefficient coeff = <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(trail[trail_index].Variable());</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(slack, coeff);</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  </div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// Nothing to do if the slack is already target.</span></div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">if</span> (slack == target) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  </div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// Applies the algorithm described in the .h</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">const</span> Coefficient diff = slack - target;</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  rhs_ -= diff;</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a5a8bf8a7daa44c4c35f8aa05a84c19ba">PossibleNonZeros</a>()) {</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) == 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">if</span> (trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a2296cbfc427d1ccfb3ecc7d0ced18b01">GetLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) &&</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> < trail_index) {</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) > diff) {</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = (terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] > 0) ? terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] - diff : terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] + diff;</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  max_sum_ -= diff;</div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  max_sum_ -= <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  terms_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>] = 0;</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  }</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  }</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(max_sum_, ComputeMaxSum());</div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span> }</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  </div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad49fd13bba7789f08d81d6c71d856082"> 370</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad49fd13bba7789f08d81d6c71d856082">MutableUpperBoundedLinearConstraint::CopyIntoVector</a>(</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  std::vector<LiteralWithCoeff>* output) {</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  output->clear();</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : non_zeros_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keyword">const</span> Coefficient coeff = <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">if</span> (coeff != 0) {</div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  output->push_back(<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>(<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a2296cbfc427d1ccfb3ecc7d0ced18b01">GetLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>), <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)));</div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  }</div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  }</div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  std::sort(output->begin(), output->end(), CoeffComparator);</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> Coefficient MutableUpperBoundedLinearConstraint::ComputeMaxSum()<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  Coefficient result(0);</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">for</span> (BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : non_zeros_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  result += <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  }</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span> }</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  </div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#aaf167a7e47f0e21f2b67ba9af023530a"> 390</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#aaf167a7e47f0e21f2b67ba9af023530a">UpperBoundedLinearConstraint::UpperBoundedLinearConstraint</a>(</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keyword">const</span> std::vector<LiteralWithCoeff>& cst)</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  : is_marked_for_deletion_(false),</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  is_learned_(false),</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  first_reason_trail_index_(-1),</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  activity_(0.0) {</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!cst.empty());</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(cst.begin(), cst.end(), CoeffComparator));</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  literals_.reserve(cst.size());</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  </div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="comment">// Reserve the space for coeffs_ and starts_ (it is slightly more efficient).</span></div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  {</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordtype">int</span> size = 0;</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  Coefficient prev(0); <span class="comment">// Ignore initial zeros.</span></div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a> term : cst) {</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  <span class="keywordflow">if</span> (term.coefficient != prev) {</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  prev = term.coefficient;</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  ++size;</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  }</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  }</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  coeffs_.reserve(size);</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  starts_.reserve(size + 1);</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  </div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  Coefficient prev(0);</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a> term : cst) {</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">if</span> (term.coefficient != prev) {</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  prev = term.coefficient;</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  coeffs_.push_back(term.coefficient);</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  starts_.push_back(literals_.size());</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  }</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  literals_.push_back(term.literal);</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  }</div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  </div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="comment">// Sentinel.</span></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  starts_.push_back(literals_.size());</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  </div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  hash_ = <a class="code" href="namespaceoperations__research.html#a8627f242a0332f34d29d85b6c57f1224">ThoroughHash</a>(<span class="keyword">reinterpret_cast<</span><span class="keyword">const </span><span class="keywordtype">char</span>*<span class="keyword">></span>(cst.data()),</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  cst.size() * <span class="keyword">sizeof</span>(<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a>));</div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> }</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  </div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a79bc25526bc335587dd8b8c433d19306"> 431</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a79bc25526bc335587dd8b8c433d19306">UpperBoundedLinearConstraint::AddToConflict</a>(</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html">MutableUpperBoundedLinearConstraint</a>* conflict) {</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  <span class="keywordtype">int</span> literal_index = 0;</div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keywordtype">int</span> coeff_index = 0;</div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals_) {</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aaff50cb53673c51920c6bcb567ca8806">AddTerm</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, coeffs_[coeff_index]);</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  ++literal_index;</div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keywordflow">if</span> (literal_index == starts_[coeff_index + 1]) ++coeff_index;</div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  }</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac4fb16d0641ccef0502adb8bbe3909af">AddToRhs</a>(rhs_);</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span> }</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  </div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a32f963abf423028dcbb4d1c3daf8086d"> 443</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a32f963abf423028dcbb4d1c3daf8086d">UpperBoundedLinearConstraint::HasIdenticalTerms</a>(</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">const</span> std::vector<LiteralWithCoeff>& cst) {</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">if</span> (cst.size() != literals_.size()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keywordtype">int</span> literal_index = 0;</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordtype">int</span> coeff_index = 0;</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a> term : cst) {</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keywordflow">if</span> (literals_[literal_index] != term.literal) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">if</span> (coeffs_[coeff_index] != term.coefficient) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  ++literal_index;</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="keywordflow">if</span> (literal_index == starts_[coeff_index + 1]) {</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  ++coeff_index;</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  }</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> }</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  </div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a40669a5dba9b3618272a2881174aee5c"> 459</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a40669a5dba9b3618272a2881174aee5c">UpperBoundedLinearConstraint::InitializeRhs</a>(</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  Coefficient rhs, <span class="keywordtype">int</span> trail_index, Coefficient* threshold, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail,</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html">PbConstraintsEnqueueHelper</a>* helper) {</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="comment">// Compute the slack from the assigned variables with a trail index</span></div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  <span class="comment">// smaller than the given trail_index. The variable at trail_index has not</span></div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="comment">// yet been propagated.</span></div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  rhs_ = rhs;</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  Coefficient slack = rhs;</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  </div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="comment">// sum_at_previous_level[i] is the sum of assigned literals with a level <</span></div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">// i. Since we want the sums up to sum_at_previous_level[last_level + 1],</span></div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="comment">// the size of the vector must be last_level + 2.</span></div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> last_level = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>();</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  std::vector<Coefficient> sum_at_previous_level(last_level + 2,</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  Coefficient(0));</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  </div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordtype">int</span> max_relevant_trail_index = 0;</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  <span class="keywordflow">if</span> (trail_index > 0) {</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="keywordtype">int</span> literal_index = 0;</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordtype">int</span> coeff_index = 0;</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals_) {</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable();</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keyword">const</span> Coefficient coeff = coeffs_[coeff_index];</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) &&</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> < trail_index) {</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  max_relevant_trail_index =</div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_relevant_trail_index, trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a>);</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  slack -= coeff;</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  sum_at_previous_level[trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a> + 1] += coeff;</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  }</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  ++literal_index;</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">if</span> (literal_index == starts_[coeff_index + 1]) ++coeff_index;</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  }</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  </div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="comment">// The constraint is infeasible provided the current propagated trail.</span></div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">if</span> (slack < 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  </div>
|
|
<div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  <span class="comment">// Cummulative sum.</span></div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < sum_at_previous_level.size(); ++i) {</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  sum_at_previous_level[i] += sum_at_previous_level[i - 1];</div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  }</div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  }</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  </div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">// Check the no-propagation at earlier level precondition.</span></div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordtype">int</span> literal_index = 0;</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  <span class="keywordtype">int</span> coeff_index = 0;</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals_) {</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keyword">const</span> BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable();</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> level = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  ? trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a></div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  : last_level;</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">if</span> (level > 0) {</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(coeffs_[coeff_index], rhs_ - sum_at_previous_level[level])</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  << <span class="stringliteral">"var should have been propagated at an earlier level !"</span>;</div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  }</div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  ++literal_index;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">if</span> (literal_index == starts_[coeff_index + 1]) ++coeff_index;</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  </div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// Initial propagation.</span></div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="comment">// TODO(user): The source trail index for the propagation reason (i.e.</span></div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="comment">// max_relevant_trail_index) may be higher than necessary (for some of the</span></div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="comment">// propagated literals). Currently this works with FillReason(), but it was a</span></div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">// source of a really nasty bug (see CL 68906167) because of the (rhs == 1)</span></div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">// optim. Find a good way to test the logic.</span></div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  index_ = coeffs_.size() - 1;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  already_propagated_end_ = literals_.size();</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  Update(slack, threshold);</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  <span class="keywordflow">return</span> *threshold < 0</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  ? <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a1d503b84c8c90bca31afd5a89b6db0ba">Propagate</a>(max_relevant_trail_index, threshold, trail, helper)</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  : <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span> }</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  </div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a1d503b84c8c90bca31afd5a89b6db0ba"> 533</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a1d503b84c8c90bca31afd5a89b6db0ba">UpperBoundedLinearConstraint::Propagate</a>(</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordtype">int</span> trail_index, Coefficient* threshold, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail,</div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html">PbConstraintsEnqueueHelper</a>* helper) {</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(*threshold, 0);</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keyword">const</span> Coefficient slack = GetSlackFromThreshold(*threshold);</div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(slack, 0) << <span class="stringliteral">"The constraint is already a conflict!"</span>;</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keywordflow">while</span> (index_ >= 0 && coeffs_[index_] > slack) --index_;</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  </div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="comment">// Check propagation.</span></div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  BooleanVariable first_propagated_variable(-1);</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = starts_[index_ + 1]; i < already_propagated_end_; ++i) {</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(literals_[i])) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(literals_[i])) {</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">if</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(literals_[i].Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> > trail_index) {</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="comment">// Conflict.</span></div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a2c809e3ff1236e74ebaaafb7864aca94">FillReason</a>(*trail, trail_index, literals_[i].Variable(),</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  &helper-><a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#aaae88a70725a09afe173932f040c49a1">conflict</a>);</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  helper-><a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#aaae88a70725a09afe173932f040c49a1">conflict</a>.push_back(literals_[i].Negated());</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  Update(slack, threshold);</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="comment">// Propagation.</span></div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">if</span> (first_propagated_variable < 0) {</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">if</span> (first_reason_trail_index_ == -1) {</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  first_reason_trail_index_ = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  }</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  helper-><a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#a80f73afb7f3e4965def965261750bc86">Enqueue</a>(literals_[i].Negated(), trail_index, <span class="keyword">this</span>, trail);</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  first_propagated_variable = literals_[i].Variable();</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">// Note that the reason for first_propagated_variable is always a</span></div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// valid reason for literals_[i].Variable() because we process the</span></div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="comment">// variable in increasing coefficient order.</span></div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a4086a48ef9859b6ed0a5e9dd08d622c7">EnqueueWithSameReasonAs</a>(literals_[i].Negated(),</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  first_propagated_variable);</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  }</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  }</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  Update(slack, threshold);</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(*threshold, 0);</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span> }</div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  </div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a2c809e3ff1236e74ebaaafb7864aca94"> 576</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a2c809e3ff1236e74ebaaafb7864aca94">UpperBoundedLinearConstraint::FillReason</a>(</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, <span class="keywordtype">int</span> source_trail_index,</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  BooleanVariable propagated_variable, std::vector<Literal>* reason) {</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  reason->clear();</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  </div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="comment">// Optimization for an "at most one" constraint.</span></div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="comment">// Note that the source_trail_index set by InitializeRhs() is ok in this case.</span></div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="keywordflow">if</span> (rhs_ == 1) {</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  reason->push_back(trail[source_trail_index].Negated());</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  }</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  </div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="comment">// Optimization: This will be set to the index of the last literal in the</span></div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  <span class="comment">// reason.</span></div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="keywordtype">int</span> last_i = 0;</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordtype">int</span> last_coeff_index = 0;</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  </div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// Compute the initial reason which is formed by all the literals of the</span></div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// constraint that were assigned to true at the time of the propagation.</span></div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// We remove literals with a level of 0 since they are not needed.</span></div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="comment">// We also compute the slack at the time.</span></div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  Coefficient slack = rhs_;</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  Coefficient propagated_variable_coefficient(0);</div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordtype">int</span> coeff_index = coeffs_.size() - 1;</div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = literals_.size() - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = literals_[i];</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordflow">if</span> (<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable() == propagated_variable) {</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  propagated_variable_coefficient = coeffs_[coeff_index];</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  <span class="keywordflow">if</span> (trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) &&</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> <= source_trail_index) {</div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="keywordflow">if</span> (trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">level</a> > 0) {</div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  reason->push_back(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated());</div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  last_i = i;</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  last_coeff_index = coeff_index;</div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  }</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  slack -= coeffs_[coeff_index];</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  }</div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  }</div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">if</span> (i == starts_[coeff_index]) {</div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  --coeff_index;</div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  }</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  }</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <a class="code" href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a>(propagated_variable_coefficient, slack);</div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(propagated_variable_coefficient, 0);</div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  </div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">// In both cases, we can't minimize the reason further.</span></div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordflow">if</span> (reason->size() <= 1 || coeffs_.size() == 1) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  </div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  Coefficient limit = propagated_variable_coefficient - slack;</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(limit, 1);</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  </div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="comment">// Remove literals with small coefficients from the reason as long as the</span></div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="comment">// limit is still stricly positive.</span></div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  coeff_index = last_coeff_index;</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">if</span> (coeffs_[coeff_index] >= limit) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = last_i; i < literals_.size(); ++i) {</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = literals_[i];</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="keywordflow">if</span> (i == starts_[coeff_index + 1]) {</div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  ++coeff_index;</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordflow">if</span> (coeffs_[coeff_index] >= limit) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  }</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keywordflow">if</span> (<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated() != reason->back()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  limit -= coeffs_[coeff_index];</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  reason->pop_back();</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">if</span> (coeffs_[coeff_index] >= limit) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!reason->empty());</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(limit, 1);</div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span> }</div>
|
|
<div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  </div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a103f8fd98c381df722712e1782af52d4"> 647</a></span> Coefficient <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a103f8fd98c381df722712e1782af52d4">UpperBoundedLinearConstraint::ComputeCancelation</a>(</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, <span class="keywordtype">int</span> trail_index,</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html">MutableUpperBoundedLinearConstraint</a>& conflict) {</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  Coefficient result(0);</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keywordtype">int</span> literal_index = 0;</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordtype">int</span> coeff_index = 0;</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals_) {</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">if</span> (!trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()) ||</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> >= trail_index) {</div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  result += conflict.<a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a7af7a846335222cba297cb30a41c6525">CancelationAmount</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, coeffs_[coeff_index]);</div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  }</div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  ++literal_index;</div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="keywordflow">if</span> (literal_index == starts_[coeff_index + 1]) ++coeff_index;</div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  }</div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span> }</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  </div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a40517ccc9af91f2423cb14c508371ba1"> 664</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a40517ccc9af91f2423cb14c508371ba1">UpperBoundedLinearConstraint::ResolvePBConflict</a>(</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, BooleanVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html">MutableUpperBoundedLinearConstraint</a>* conflict,</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  Coefficient* conflict_slack) {</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> limit_trail_index = trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a>;</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  </div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="comment">// Compute the constraint activity at the time and the coefficient of the</span></div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="comment">// variable var.</span></div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  Coefficient <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#add3bd69a358a7351a31f0a12a4bf16b0">activity</a>(0);</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  Coefficient var_coeff(0);</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  <span class="keywordtype">int</span> literal_index = 0;</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordtype">int</span> coeff_index = 0;</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals_) {</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keywordflow">if</span> (<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable() == <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// The variable must be of the opposite sign in the current conflict.</span></div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <a class="code" href="base_2logging_8h.html#ab25e01a2942b821d66371fc68d53f2eb">CHECK_NE</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a2296cbfc427d1ccfb3ecc7d0ced18b01">GetLiteral</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  var_coeff = coeffs_[coeff_index];</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) &&</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> < limit_trail_index) {</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#add3bd69a358a7351a31f0a12a4bf16b0">activity</a> += coeffs_[coeff_index];</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  }</div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  ++literal_index;</div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="keywordflow">if</span> (literal_index == starts_[coeff_index + 1]) ++coeff_index;</div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  }</div>
|
|
<div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  </div>
|
|
<div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="comment">// Special case.</span></div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#add3bd69a358a7351a31f0a12a4bf16b0">activity</a> > rhs_) {</div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="comment">// This constraint is already a conflict.</span></div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// Use this one instead to start the resolution.</span></div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// TODO(user): Investigate if this is a good idea. It doesn't happen often,</span></div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="comment">// but does happend. Maybe we can detect this before in Propagate()? The</span></div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="comment">// setup is:</span></div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  <span class="comment">// - At a given trail_index, var is propagated and added on the trail.</span></div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// - There is some constraint literals assigned to true with a trail index</span></div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="comment">// in (trail_index, var.trail_index).</span></div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// - Their sum is high enough to cause a conflict.</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">// - But individually, their coefficients are too small to be propagated, so</span></div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">// the conflict is not yet detected. It will be when these variables are</span></div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="comment">// processed by PropagateNext().</span></div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aa7d76b766faf39c1652b6617eac5fe20">ClearAll</a>();</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a79bc25526bc335587dd8b8c433d19306">AddToConflict</a>(conflict);</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  *conflict_slack = rhs_ - <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#add3bd69a358a7351a31f0a12a4bf16b0">activity</a>;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(*conflict_slack,</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39">ComputeSlackForTrailPrefix</a>(trail, limit_trail_index));</div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  }</div>
|
|
<div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  </div>
|
|
<div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="comment">// This is the slack of *this for the trail prefix < limit_trail_index.</span></div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  <span class="keyword">const</span> Coefficient slack = rhs_ - <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#add3bd69a358a7351a31f0a12a4bf16b0">activity</a>;</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(slack, 0);</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  </div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="comment">// This is the slack of the conflict at the same level.</span></div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(*conflict_slack,</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39">ComputeSlackForTrailPrefix</a>(trail, limit_trail_index));</div>
|
|
<div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  </div>
|
|
<div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="comment">// TODO(user): If there is more "cancelation" than the min_coeffs below when</span></div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="comment">// we add the two constraints, the resulting slack may be even lower. Taking</span></div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="comment">// that into account is probably good.</span></div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  <span class="keyword">const</span> Coefficient cancelation =</div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a> ? <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a103f8fd98c381df722712e1782af52d4">ComputeCancelation</a>(trail, limit_trail_index, *conflict)</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  : Coefficient(0);</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  </div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// When we add the two constraints together, the slack of the result for the</span></div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="comment">// trail < limit_trail_index - 1 must be negative. We know that its value is</span></div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="comment">// <= slack1 + slack2 - min(coeffs), so we have nothing to do if this bound is</span></div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="comment">// already negative.</span></div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keyword">const</span> Coefficient conflict_var_coeff = conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">GetCoefficient</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keyword">const</span> Coefficient min_coeffs = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(var_coeff, conflict_var_coeff);</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keyword">const</span> Coefficient new_slack_ub = slack + *conflict_slack - min_coeffs;</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(*conflict_slack, conflict_var_coeff);</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(slack, var_coeff);</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="keywordflow">if</span> (new_slack_ub < 0) {</div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a79bc25526bc335587dd8b8c433d19306">AddToConflict</a>(conflict);</div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(*conflict_slack + slack - cancelation,</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39">ComputeSlackForTrailPrefix</a>(trail, limit_trail_index));</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  }</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  </div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="comment">// We need to relax one or both of the constraints so the new slack is < 0.</span></div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="comment">// Using the relaxation described in ReduceSlackTo(), we can have this new</span></div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="comment">// slack bound:</span></div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="comment">// (slack - diff) + (conflict_slack - conflict_diff)</span></div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  <span class="comment">// - min(var_coeff - diff, conflict_var_coeff - conflict_diff).</span></div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  <span class="comment">// For all diff in [0, slack)</span></div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="comment">// For all conflict_diff in [0, conflict_slack)</span></div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  Coefficient diff(0);</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  Coefficient conflict_diff(0);</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  </div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="comment">// Is relaxing the constraint with the highest coeff enough?</span></div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keywordflow">if</span> (new_slack_ub < <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(var_coeff, conflict_var_coeff) - min_coeffs) {</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keyword">const</span> Coefficient reduc = new_slack_ub + 1;</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="keywordflow">if</span> (var_coeff < conflict_var_coeff) {</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  conflict_diff += reduc;</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  diff += reduc;</div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  }</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">// Just reduce the slack of both constraints to zero.</span></div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// TODO(user): The best will be to relax as little as possible.</span></div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  diff = slack;</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  conflict_diff = *conflict_slack;</div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  }</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  </div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="comment">// Relax the conflict.</span></div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(conflict_diff, 0);</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(conflict_diff, *conflict_slack);</div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordflow">if</span> (conflict_diff > 0) {</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3d589ce2855e8e0e57354f33d73123e2">ReduceSlackTo</a>(trail, limit_trail_index, *conflict_slack,</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  *conflict_slack - conflict_diff);</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  *conflict_slack -= conflict_diff;</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  }</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  </div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="comment">// We apply the same algorithm as the one in ReduceSlackTo() but on</span></div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="comment">// the non-mutable representation and add it on the fly into conflict.</span></div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <a class="code" href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a>(diff, 0);</div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <a class="code" href="base_2logging_8h.html#ae4db23f10f5d4aad6d735f5a74cd6f8c">CHECK_LE</a>(diff, slack);</div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="keywordflow">if</span> (diff == 0) {</div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="comment">// Special case if there if no relaxation is needed.</span></div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a79bc25526bc335587dd8b8c433d19306">AddToConflict</a>(conflict);</div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  </div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  literal_index = 0;</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  coeff_index = 0;</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> : literals_) {</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keywordflow">if</span> (trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>) &&</div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">Info</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Variable()).<a class="code" href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">trail_index</a> < limit_trail_index) {</div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aaff50cb53673c51920c6bcb567ca8806">AddTerm</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, coeffs_[coeff_index]);</div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keyword">const</span> Coefficient new_coeff = coeffs_[coeff_index] - diff;</div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">if</span> (new_coeff > 0) {</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// TODO(user): track the cancelation here so we can update</span></div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="comment">// *conflict_slack properly.</span></div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aaff50cb53673c51920c6bcb567ca8806">AddTerm</a>(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>, new_coeff);</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  }</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  }</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  ++literal_index;</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keywordflow">if</span> (literal_index == starts_[coeff_index + 1]) ++coeff_index;</div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  }</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  </div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="comment">// And the rhs.</span></div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  conflict-><a class="code" href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac4fb16d0641ccef0502adb8bbe3909af">AddToRhs</a>(rhs_ - diff);</div>
|
|
<div class="line"><a name="l00810"></a><span class="lineno"> 810</span> }</div>
|
|
<div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  </div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a63931731d764c40e4c80ec59a553a0f1"> 812</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a63931731d764c40e4c80ec59a553a0f1">UpperBoundedLinearConstraint::Untrail</a>(Coefficient* threshold,</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keywordtype">int</span> trail_index) {</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keyword">const</span> Coefficient slack = GetSlackFromThreshold(*threshold);</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="keywordflow">while</span> (index_ + 1 < coeffs_.size() && coeffs_[index_ + 1] <= slack) ++index_;</div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  Update(slack, threshold);</div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordflow">if</span> (first_reason_trail_index_ >= trail_index) {</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  first_reason_trail_index_ = -1;</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  }</div>
|
|
<div class="line"><a name="l00820"></a><span class="lineno"> 820</span> }</div>
|
|
<div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  </div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span> <span class="comment">// TODO(user): This is relatively slow. Take the "transpose" all at once, and</span></div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span> <span class="comment">// maybe put small constraints first on the to_update_ lists.</span></div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a668f93c96cd8a83dd4bf3da35ba8b7b0"> 824</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a668f93c96cd8a83dd4bf3da35ba8b7b0">PbConstraints::AddConstraint</a>(<span class="keyword">const</span> std::vector<LiteralWithCoeff>& cst,</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  Coefficient rhs, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!cst.empty());</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(std::is_sorted(cst.begin(), cst.end(), CoeffComparator));</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  </div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// Special case if this is the first constraint.</span></div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="keywordflow">if</span> (constraints_.empty()) {</div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  to_update_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>() << 1);</div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  enqueue_helper_.<a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#ac12cf291d1c4f67f024ecd26b791507d">propagator_id</a> = <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">propagator_id_</a>;</div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  enqueue_helper_.<a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#a2b537e8bba9403eef4d626a7a8b921a1">reasons</a>.resize(trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>());</div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  }</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  </div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  std::unique_ptr<UpperBoundedLinearConstraint> c(</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html">UpperBoundedLinearConstraint</a>(cst));</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  std::vector<UpperBoundedLinearConstraint*>& duplicate_candidates =</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  possible_duplicates_[c->hash()];</div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  </div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="comment">// Optimization if the constraint terms are duplicates.</span></div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">for</span> (<a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html">UpperBoundedLinearConstraint</a>* candidate : duplicate_candidates) {</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordflow">if</span> (candidate->HasIdenticalTerms(cst)) {</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keywordflow">if</span> (rhs < candidate->Rhs()) {</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  <span class="comment">// TODO(user): the index is needed to give the correct thresholds_ entry</span></div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">// to InitializeRhs() below, but this linear scan is not super</span></div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="comment">// efficient.</span></div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  ConstraintIndex i(0);</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">while</span> (i < constraints_.size() &&</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  constraints_[i.value()].get() != candidate) {</div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  ++i;</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  }</div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <a class="code" href="base_2logging_8h.html#a4bd2e815ca2f702a4b6aa744b1ff3b82">CHECK_LT</a>(i, constraints_.size());</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="keywordflow">return</span> candidate->InitializeRhs(rhs, <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>,</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  &thresholds_[i], trail,</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  &enqueue_helper_);</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="comment">// The constraint is redundant, so there is nothing to do.</span></div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  }</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  }</div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  }</div>
|
|
<div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  </div>
|
|
<div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  thresholds_.<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(Coefficient(0));</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordflow">if</span> (!c->InitializeRhs(rhs, <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>, &thresholds_.<a class="code" href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">back</a>(),</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  trail, &enqueue_helper_)) {</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  thresholds_.<a class="code" href="classabsl_1_1_strong_vector.html#a058bda4957df6a97b1ea6c9fd783f672">pop_back</a>();</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  }</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  </div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  <span class="keyword">const</span> ConstraintIndex cst_index(constraints_.size());</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  duplicate_candidates.push_back(c.get());</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  constraints_.emplace_back(c.release());</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">for</span> (<a class="code" href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">LiteralWithCoeff</a> term : cst) {</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <a class="code" href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a>(term.literal.Index(), to_update_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>());</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  to_update_[term.literal.Index()].<a class="code" href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(ConstraintIndexWithCoeff(</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(term.literal.Variable()),</div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  cst_index, term.coefficient));</div>
|
|
<div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  }</div>
|
|
<div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"> 883</span> }</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  </div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#afea0121eba5886052ba91716acf7f29f"> 885</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#afea0121eba5886052ba91716acf7f29f">PbConstraints::AddLearnedConstraint</a>(</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keyword">const</span> std::vector<LiteralWithCoeff>& cst, Coefficient rhs, <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  DeleteSomeLearnedConstraintIfNeeded();</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_num_constraints = constraints_.size();</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> result = <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a668f93c96cd8a83dd4bf3da35ba8b7b0">AddConstraint</a>(cst, rhs, trail);</div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  </div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="comment">// The second test is to avoid marking a problem constraint as learned because</span></div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="comment">// of the "reuse last constraint" optimization.</span></div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="keywordflow">if</span> (result && constraints_.size() > old_num_constraints) {</div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  constraints_.back()->set_is_learned(<span class="keyword">true</span>);</div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  }</div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span> }</div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  </div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span> <span class="keywordtype">bool</span> PbConstraints::PropagateNext(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> source_trail_index = <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>;</div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> true_literal = (*trail)[<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>];</div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  ++<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>;</div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  </div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// We need to upate ALL threshold, otherwise the Untrail() will not be</span></div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// synchronized.</span></div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keywordtype">bool</span> conflict = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  num_threshold_updates_ += to_update_[true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()].<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">for</span> (ConstraintIndexWithCoeff& update : to_update_[true_literal.<a class="code" href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">Index</a>()]) {</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keyword">const</span> Coefficient threshold =</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  thresholds_[update.index] - update.coefficient;</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  thresholds_[update.index] = threshold;</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  <span class="keywordflow">if</span> (threshold < 0 && !conflict) {</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html">UpperBoundedLinearConstraint</a>* <span class="keyword">const</span> cst =</div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  constraints_[update.index.value()].get();</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  update.need_untrail_inspection = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  ++num_constraint_lookups_;</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_value = cst-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a5f65c8b6b41bb6b090435d4aa3d7d30b">already_propagated_end</a>();</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">if</span> (!cst-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a1d503b84c8c90bca31afd5a89b6db0ba">Propagate</a>(source_trail_index, &thresholds_[update.index], trail,</div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  &enqueue_helper_)) {</div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a84f6b2c778ed597c90f98f0329a25713">MutableConflict</a>()->swap(enqueue_helper_.<a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#aaae88a70725a09afe173932f040c49a1">conflict</a>);</div>
|
|
<div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  conflicting_constraint_index_ = update.index;</div>
|
|
<div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  conflict = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  </div>
|
|
<div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="comment">// We bump the activity of the conflict.</span></div>
|
|
<div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae087fb0f8731e64e65fb00e517fe8966">BumpActivity</a>(constraints_[update.index.value()].get());</div>
|
|
<div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  }</div>
|
|
<div class="line"><a name="l00928"></a><span class="lineno"> 928</span>  num_inspected_constraint_literals_ +=</div>
|
|
<div class="line"><a name="l00929"></a><span class="lineno"> 929</span>  old_value - cst-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a5f65c8b6b41bb6b090435d4aa3d7d30b">already_propagated_end</a>();</div>
|
|
<div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  }</div>
|
|
<div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  }</div>
|
|
<div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="keywordflow">return</span> !conflict;</div>
|
|
<div class="line"><a name="l00933"></a><span class="lineno"> 933</span> }</div>
|
|
<div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  </div>
|
|
<div class="line"><a name="l00935"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a1f591be5334541874ba049873235f0a9"> 935</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a1f591be5334541874ba049873235f0a9">PbConstraints::Propagate</a>(<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail) {</div>
|
|
<div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_index = trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>();</div>
|
|
<div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="keywordflow">while</span> (trail-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">Index</a>() == old_index && <a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> < old_index) {</div>
|
|
<div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">if</span> (!PropagateNext(trail)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  }</div>
|
|
<div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00941"></a><span class="lineno"> 941</span> }</div>
|
|
<div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  </div>
|
|
<div class="line"><a name="l00943"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae20e3965a974e3a5fe816c033a94e568"> 943</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae20e3965a974e3a5fe816c033a94e568">PbConstraints::Untrail</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail, <span class="keywordtype">int</span> trail_index) {</div>
|
|
<div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  to_untrail_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(ConstraintIndex(constraints_.size()));</div>
|
|
<div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="keywordflow">while</span> (<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> > trail_index) {</div>
|
|
<div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  --<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>;</div>
|
|
<div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = trail[<a class="code" href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>];</div>
|
|
<div class="line"><a name="l00949"></a><span class="lineno"> 949</span>  <span class="keywordflow">for</span> (ConstraintIndexWithCoeff& update : to_update_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]) {</div>
|
|
<div class="line"><a name="l00950"></a><span class="lineno"> 950</span>  thresholds_[update.index] += update.coefficient;</div>
|
|
<div class="line"><a name="l00951"></a><span class="lineno"> 951</span>  </div>
|
|
<div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="comment">// Only the constraints which were inspected during Propagate() need</span></div>
|
|
<div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="comment">// inspection during Untrail().</span></div>
|
|
<div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="keywordflow">if</span> (update.need_untrail_inspection) {</div>
|
|
<div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  update.need_untrail_inspection = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  to_untrail_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(update.index);</div>
|
|
<div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  }</div>
|
|
<div class="line"><a name="l00958"></a><span class="lineno"> 958</span>  }</div>
|
|
<div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  }</div>
|
|
<div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keywordflow">for</span> (ConstraintIndex cst_index : to_untrail_.<a class="code" href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  constraints_[cst_index.value()]->Untrail(&(thresholds_[cst_index]),</div>
|
|
<div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  trail_index);</div>
|
|
<div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  }</div>
|
|
<div class="line"><a name="l00964"></a><span class="lineno"> 964</span> }</div>
|
|
<div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  </div>
|
|
<div class="line"><a name="l00966"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a5aa25e6e306c7158c11d2053170379a2"> 966</a></span> absl::Span<const Literal> <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a5aa25e6e306c7158c11d2053170379a2">PbConstraints::Reason</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>& trail,</div>
|
|
<div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordtype">int</span> trail_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info.html">PbConstraintsEnqueueHelper::ReasonInfo</a>& reason_info =</div>
|
|
<div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  enqueue_helper_.<a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#a2b537e8bba9403eef4d626a7a8b921a1">reasons</a>[trail_index];</div>
|
|
<div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  std::vector<Literal>* reason = trail.<a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a70e532a108e1f03d6f9112c770ffbedb">GetEmptyVectorToStoreReason</a>(trail_index);</div>
|
|
<div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  reason_info.<a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info.html#afe52c2c26c7ea4bb701d2e051c0f3833">pb_constraint</a>-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a2c809e3ff1236e74ebaaafb7864aca94">FillReason</a>(trail, reason_info.<a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info.html#a423024af9357cc1dff15aa424e022d9d">source_trail_index</a>,</div>
|
|
<div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  trail[trail_index].Variable(), reason);</div>
|
|
<div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="keywordflow">return</span> *reason;</div>
|
|
<div class="line"><a name="l00975"></a><span class="lineno"> 975</span> }</div>
|
|
<div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  </div>
|
|
<div class="line"><a name="l00977"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ab00d5c5d5edf37a9568363ba39e02c11"> 977</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html">UpperBoundedLinearConstraint</a>* <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ab00d5c5d5edf37a9568363ba39e02c11">PbConstraints::ReasonPbConstraint</a>(</div>
|
|
<div class="line"><a name="l00978"></a><span class="lineno"> 978</span>  <span class="keywordtype">int</span> trail_index)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00979"></a><span class="lineno"> 979</span>  <span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info.html">PbConstraintsEnqueueHelper::ReasonInfo</a>& reason_info =</div>
|
|
<div class="line"><a name="l00980"></a><span class="lineno"> 980</span>  enqueue_helper_.<a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#a2b537e8bba9403eef4d626a7a8b921a1">reasons</a>[trail_index];</div>
|
|
<div class="line"><a name="l00981"></a><span class="lineno"> 981</span>  <span class="keywordflow">return</span> reason_info.<a class="code" href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info.html#afe52c2c26c7ea4bb701d2e051c0f3833">pb_constraint</a>;</div>
|
|
<div class="line"><a name="l00982"></a><span class="lineno"> 982</span> }</div>
|
|
<div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  </div>
|
|
<div class="line"><a name="l00984"></a><span class="lineno"> 984</span> <span class="comment">// TODO(user): Because num_constraints also include problem constraints, the</span></div>
|
|
<div class="line"><a name="l00985"></a><span class="lineno"> 985</span> <span class="comment">// policy may not be what we want if there is a big number of problem</span></div>
|
|
<div class="line"><a name="l00986"></a><span class="lineno"> 986</span> <span class="comment">// constraints. Fix this.</span></div>
|
|
<div class="line"><a name="l00987"></a><span class="lineno"> 987</span> <span class="keywordtype">void</span> PbConstraints::ComputeNewLearnedConstraintLimit() {</div>
|
|
<div class="line"><a name="l00988"></a><span class="lineno"> 988</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_constraints = constraints_.size();</div>
|
|
<div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  target_number_of_learned_constraint_ =</div>
|
|
<div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  num_constraints + parameters_->pb_cleanup_increment();</div>
|
|
<div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  num_learned_constraint_before_cleanup_ =</div>
|
|
<div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(target_number_of_learned_constraint_ /</div>
|
|
<div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  parameters_->pb_cleanup_ratio()) -</div>
|
|
<div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  num_constraints;</div>
|
|
<div class="line"><a name="l00995"></a><span class="lineno"> 995</span> }</div>
|
|
<div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  </div>
|
|
<div class="line"><a name="l00997"></a><span class="lineno"> 997</span> <span class="keywordtype">void</span> PbConstraints::DeleteSomeLearnedConstraintIfNeeded() {</div>
|
|
<div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordflow">if</span> (num_learned_constraint_before_cleanup_ == 0) {</div>
|
|
<div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="comment">// First time.</span></div>
|
|
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  ComputeNewLearnedConstraintLimit();</div>
|
|
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  }</div>
|
|
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  --num_learned_constraint_before_cleanup_;</div>
|
|
<div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="keywordflow">if</span> (num_learned_constraint_before_cleanup_ > 0) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>  <a class="code" href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a>(&stats_);</div>
|
|
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>  </div>
|
|
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  <span class="comment">// Mark the constraint that needs to be deleted.</span></div>
|
|
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  <span class="comment">// We do that in two pass, first we extract the activities.</span></div>
|
|
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>  std::vector<double> activities;</div>
|
|
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < constraints_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="keyword">const</span> UpperBoundedLinearConstraint& constraint = *(constraints_[i].get());</div>
|
|
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>  <span class="keywordflow">if</span> (constraint.is_learned() && !constraint.is_used_as_a_reason()) {</div>
|
|
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>  activities.push_back(constraint.activity());</div>
|
|
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  }</div>
|
|
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  }</div>
|
|
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  </div>
|
|
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="comment">// Then we compute the cutoff threshold.</span></div>
|
|
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="comment">// Note that we can't delete constraint used as a reason!!</span></div>
|
|
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  std::sort(activities.begin(), activities.end());</div>
|
|
<div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_constraints_to_delete =</div>
|
|
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  constraints_.size() - target_number_of_learned_constraint_;</div>
|
|
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <a class="code" href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a>(num_constraints_to_delete, 0);</div>
|
|
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keywordflow">if</span> (num_constraints_to_delete >= activities.size()) {</div>
|
|
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="comment">// Unlikely, but may happen, so in this case, we just delete all the</span></div>
|
|
<div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="comment">// constraint that can possibly be deleted</span></div>
|
|
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < constraints_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  UpperBoundedLinearConstraint& constraint = *(constraints_[i].get());</div>
|
|
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  <span class="keywordflow">if</span> (constraint.is_learned() && !constraint.is_used_as_a_reason()) {</div>
|
|
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  constraint.MarkForDeletion();</div>
|
|
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  }</div>
|
|
<div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  }</div>
|
|
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> limit_activity = activities[num_constraints_to_delete];</div>
|
|
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keywordtype">int</span> num_constraint_at_limit_activity = 0;</div>
|
|
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = num_constraints_to_delete; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>  <span class="keywordflow">if</span> (activities[i] == limit_activity) {</div>
|
|
<div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  ++num_constraint_at_limit_activity;</div>
|
|
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  }</div>
|
|
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  }</div>
|
|
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  </div>
|
|
<div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="comment">// Mark for deletion all the constraints under this threshold.</span></div>
|
|
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="comment">// We only keep the most recent constraint amongst the one with the activity</span></div>
|
|
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <span class="comment">// exactly equal ot limit_activity, it is why the loop is in the reverse</span></div>
|
|
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="comment">// order.</span></div>
|
|
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = constraints_.size() - 1; i >= 0; --i) {</div>
|
|
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  UpperBoundedLinearConstraint& constraint = *(constraints_[i].get());</div>
|
|
<div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  <span class="keywordflow">if</span> (constraint.is_learned() && !constraint.is_used_as_a_reason()) {</div>
|
|
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keywordflow">if</span> (constraint.activity() <= limit_activity) {</div>
|
|
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keywordflow">if</span> (constraint.activity() == limit_activity &&</div>
|
|
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  num_constraint_at_limit_activity > 0) {</div>
|
|
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  --num_constraint_at_limit_activity;</div>
|
|
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  constraint.MarkForDeletion();</div>
|
|
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  }</div>
|
|
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  }</div>
|
|
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  }</div>
|
|
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  }</div>
|
|
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  }</div>
|
|
<div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  </div>
|
|
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  <span class="comment">// Finally we delete the marked constraint and compute the next limit.</span></div>
|
|
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  DeleteConstraintMarkedForDeletion();</div>
|
|
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  ComputeNewLearnedConstraintLimit();</div>
|
|
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span> }</div>
|
|
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  </div>
|
|
<div class="line"><a name="l01067"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae087fb0f8731e64e65fb00e517fe8966"> 1067</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae087fb0f8731e64e65fb00e517fe8966">PbConstraints::BumpActivity</a>(<a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html">UpperBoundedLinearConstraint</a>* constraint) {</div>
|
|
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  <span class="keywordflow">if</span> (!constraint-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a7e8ee12f0eae3b9e348b88e6675438d7">is_learned</a>()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> max_activity = parameters_->max_clause_activity_value();</div>
|
|
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a033e8db16a2a7516bc261c80d1e6ed0f">set_activity</a>(constraint-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#add3bd69a358a7351a31f0a12a4bf16b0">activity</a>() +</div>
|
|
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  constraint_activity_increment_);</div>
|
|
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">if</span> (constraint-><a class="code" href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#add3bd69a358a7351a31f0a12a4bf16b0">activity</a>() > max_activity) {</div>
|
|
<div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a2aab5f0b8a516d308939c4cad97fc634">RescaleActivities</a>(1.0 / max_activity);</div>
|
|
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div>
|
|
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span> }</div>
|
|
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  </div>
|
|
<div class="line"><a name="l01077"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a2aab5f0b8a516d308939c4cad97fc634"> 1077</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#a2aab5f0b8a516d308939c4cad97fc634">PbConstraints::RescaleActivities</a>(<span class="keywordtype">double</span> scaling_factor) {</div>
|
|
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  constraint_activity_increment_ *= scaling_factor;</div>
|
|
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < constraints_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  constraints_[i]->set_activity(constraints_[i]->activity() * scaling_factor);</div>
|
|
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  }</div>
|
|
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span> }</div>
|
|
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  </div>
|
|
<div class="line"><a name="l01084"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ad064f7982ad8af720e437b82380b629f"> 1084</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_pb_constraints.html#ad064f7982ad8af720e437b82380b629f">PbConstraints::UpdateActivityIncrement</a>() {</div>
|
|
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="keyword">const</span> <span class="keywordtype">double</span> decay = parameters_->clause_activity_decay();</div>
|
|
<div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  constraint_activity_increment_ *= 1.0 / decay;</div>
|
|
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span> }</div>
|
|
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  </div>
|
|
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span> <span class="keywordtype">void</span> PbConstraints::DeleteConstraintMarkedForDeletion() {</div>
|
|
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <a class="code" href="classabsl_1_1_strong_vector.html">absl::StrongVector<ConstraintIndex, ConstraintIndex></a> index_mapping(</div>
|
|
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  constraints_.size(), ConstraintIndex(-1));</div>
|
|
<div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  ConstraintIndex new_index(0);</div>
|
|
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordflow">for</span> (ConstraintIndex i(0); i < constraints_.size(); ++i) {</div>
|
|
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  <span class="keywordflow">if</span> (!constraints_[i.value()]->is_marked_for_deletion()) {</div>
|
|
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  index_mapping[i] = new_index;</div>
|
|
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordflow">if</span> (new_index < i) {</div>
|
|
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  constraints_[new_index.value()] = std::move(constraints_[i.value()]);</div>
|
|
<div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  thresholds_[new_index] = thresholds_[i];</div>
|
|
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  }</div>
|
|
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  ++new_index;</div>
|
|
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="comment">// Remove it from possible_duplicates_.</span></div>
|
|
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  UpperBoundedLinearConstraint* c = constraints_[i.value()].get();</div>
|
|
<div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  std::vector<UpperBoundedLinearConstraint*>& ref =</div>
|
|
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  possible_duplicates_[c->hash()];</div>
|
|
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < ref.size(); ++i) {</div>
|
|
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="keywordflow">if</span> (ref[i] == c) {</div>
|
|
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  std::swap(ref[i], ref.back());</div>
|
|
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  ref.pop_back();</div>
|
|
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  }</div>
|
|
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  }</div>
|
|
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  }</div>
|
|
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  }</div>
|
|
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  constraints_.resize(new_index.value());</div>
|
|
<div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  thresholds_.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(new_index.value());</div>
|
|
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  </div>
|
|
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  <span class="comment">// This is the slow part, we need to remap all the ConstraintIndex to the</span></div>
|
|
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="comment">// new ones.</span></div>
|
|
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="keywordflow">for</span> (LiteralIndex lit(0); lit < to_update_.<a class="code" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>(); ++lit) {</div>
|
|
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  std::vector<ConstraintIndexWithCoeff>& updates = to_update_[lit];</div>
|
|
<div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keywordtype">int</span> new_index = 0;</div>
|
|
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < updates.size(); ++i) {</div>
|
|
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  <span class="keyword">const</span> ConstraintIndex m = index_mapping[updates[i].index];</div>
|
|
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="keywordflow">if</span> (m != -1) {</div>
|
|
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  updates[new_index] = updates[i];</div>
|
|
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  updates[new_index].index = m;</div>
|
|
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  ++new_index;</div>
|
|
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  }</div>
|
|
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  }</div>
|
|
<div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  updates.<a class="code" href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(new_index);</div>
|
|
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  }</div>
|
|
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span> }</div>
|
|
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  </div>
|
|
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l01136"></a><span class="lineno"> 1136</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01858">expr_array.cc:1858</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_with_coeff_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#af63dcc00f2023fdf498e0829e6fb8a6b">operations_research::sat::LiteralWithCoeff::literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00053">pb_constraint.h:53</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a6a5dcff82096cd7a7147bf996dbaa5a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a6a5dcff82096cd7a7147bf996dbaa5a8">operations_research::sat::Literal::Variable</a></div><div class="ttdeci">BooleanVariable Variable() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00080">sat_base.h:80</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a5aa25e6e306c7158c11d2053170379a2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a5aa25e6e306c7158c11d2053170379a2">operations_research::sat::PbConstraints::Reason</a></div><div class="ttdeci">absl::Span< const Literal > Reason(const Trail &trail, int trail_index) const final</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00966">pb_constraint.cc:966</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab62f5ed8f2d48e29802be0cbbcd1359a"><div class="ttname"><a href="base_2logging_8h.html#ab62f5ed8f2d48e29802be0cbbcd1359a">DCHECK_LT</a></div><div class="ttdeci">#define DCHECK_LT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00888">base/logging.h:888</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a9263000d449fdccb6cb70b303063e60b"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a9263000d449fdccb6cb70b303063e60b">absl::StrongVector::push_back</a></div><div class="ttdeci">void push_back(const value_type &x)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00158">strong_vector.h:158</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</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="astructoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info.html">operations_research::sat::PbConstraintsEnqueueHelper::ReasonInfo</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00353">pb_constraint.h:353</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_ae09e38958e558d2c776bc555a0dc2fc7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#ae09e38958e558d2c776bc555a0dc2fc7">operations_research::SparseBitset::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(IntegerType size)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00780">bitset.h:780</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_a204f9b990226e8288e1aaecbb496cbf8"><div class="ttname"><a href="routing__search_8cc.html#a204f9b990226e8288e1aaecbb496cbf8">bound</a></div><div class="ttdeci">int64 bound</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00972">routing_search.cc:972</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_ae087fb0f8731e64e65fb00e517fe8966"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae087fb0f8731e64e65fb00e517fe8966">operations_research::sat::PbConstraints::BumpActivity</a></div><div class="ttdeci">void BumpActivity(UpperBoundedLinearConstraint *constraint)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l01067">pb_constraint.cc:1067</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">absl::StrongVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00147">strong_vector.h:147</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a7cc25402ecd7591b4c39934dd656b1f9"><div class="ttname"><a href="base_2logging_8h.html#a7cc25402ecd7591b4c39934dd656b1f9">CHECK_GE</a></div><div class="ttdeci">#define CHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00701">base/logging.h:701</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a40669a5dba9b3618272a2881174aee5c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a40669a5dba9b3618272a2881174aee5c">operations_research::sat::UpperBoundedLinearConstraint::InitializeRhs</a></div><div class="ttdeci">bool InitializeRhs(Coefficient rhs, int trail_index, Coefficient *threshold, Trail *trail, PbConstraintsEnqueueHelper *helper)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00459">pb_constraint.cc:459</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a29be1a6b9ba823a6fffb927609d18599"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a29be1a6b9ba823a6fffb927609d18599">operations_research::sat::Trail::Info</a></div><div class="ttdeci">const AssignmentInfo & Info(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00381">sat_base.h:381</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html">operations_research::sat::PbConstraintsEnqueueHelper</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00338">pb_constraint.h:338</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ae1bd0133149b70b678b123524541aaad"><div class="ttname"><a href="namespaceoperations__research.html#ae1bd0133149b70b678b123524541aaad">operations_research::SafeAddInto</a></div><div class="ttdeci">bool SafeAddInto(IntegerType a, IntegerType *b)</div><div class="ttdef"><b>Definition:</b> <a href="saturated__arithmetic_8h_source.html#l00087">saturated_arithmetic.h:87</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_literal_with_coeff_html_ada84a5c84452210dd2919b83deb58ca3"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_with_coeff.html#ada84a5c84452210dd2919b83deb58ca3">operations_research::sat::LiteralWithCoeff::coefficient</a></div><div class="ttdeci">Coefficient coefficient</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00054">pb_constraint.h:54</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_ad49fd13bba7789f08d81d6c71d856082"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad49fd13bba7789f08d81d6c71d856082">operations_research::sat::MutableUpperBoundedLinearConstraint::CopyIntoVector</a></div><div class="ttdeci">void CopyIntoVector(std::vector< LiteralWithCoeff > *output)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00370">pb_constraint.cc:370</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a3061094c37b507ae2834cb7d86fbcf39"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3061094c37b507ae2834cb7d86fbcf39">operations_research::sat::MutableUpperBoundedLinearConstraint::ComputeSlackForTrailPrefix</a></div><div class="ttdeci">Coefficient ComputeSlackForTrailPrefix(const Trail &trail, int trail_index) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00290">pb_constraint.cc:290</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ab4f56aa24c4c9cddc47a6abd2d747f9a"><div class="ttname"><a href="base_2logging_8h.html#ab4f56aa24c4c9cddc47a6abd2d747f9a">DCHECK_GT</a></div><div class="ttdeci">#define DCHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00890">base/logging.h:890</a></div></div>
|
|
<div class="ttc" id="ademon__profiler_8cc_html_a21edc7ca4cc5802c8779d68556bc09cf"><div class="ttname"><a href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a></div><div class="ttdeci">int64 value</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="abase_2logging_8h_html_a7e03ec13560fa94a8fea569960d7efc6"><div class="ttname"><a href="base_2logging_8h.html#a7e03ec13560fa94a8fea569960d7efc6">CHECK_GT</a></div><div class="ttdeci">#define CHECK_GT(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00702">base/logging.h:702</a></div></div>
|
|
<div class="ttc" id="abase_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#l00700">base/logging.h:700</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a79bc25526bc335587dd8b8c433d19306"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a79bc25526bc335587dd8b8c433d19306">operations_research::sat::UpperBoundedLinearConstraint::AddToConflict</a></div><div class="ttdeci">void AddToConflict(MutableUpperBoundedLinearConstraint *conflict)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00431">pb_constraint.cc:431</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_ac85244c6eaf57970b2057657ae70ee17"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac85244c6eaf57970b2057657ae70ee17">operations_research::sat::MutableUpperBoundedLinearConstraint::ClearAndResize</a></div><div class="ttdeci">void ClearAndResize(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00239">pb_constraint.cc:239</a></div></div>
|
|
<div class="ttc" id="asaturated__arithmetic_8h_html"><div class="ttname"><a href="saturated__arithmetic_8h.html">saturated_arithmetic.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">The vehicle routing library lets one model and solve generic vehicle routing problems ranging from th...</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="aclassoperations__research_1_1sat_1_1_pb_constraints_html_afea0121eba5886052ba91716acf7f29f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#afea0121eba5886052ba91716acf7f29f">operations_research::sat::PbConstraints::AddLearnedConstraint</a></div><div class="ttdeci">bool AddLearnedConstraint(const std::vector< LiteralWithCoeff > &cst, Coefficient rhs, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00885">pb_constraint.cc:885</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_canonical_boolean_linear_problem_html_a05c49a95f6af6f8d873c96cae6ab6653"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_canonical_boolean_linear_problem.html#a05c49a95f6af6f8d873c96cae6ab6653">operations_research::sat::CanonicalBooleanLinearProblem::AddLinearConstraint</a></div><div class="ttdeci">bool AddLinearConstraint(bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, std::vector< LiteralWithCoeff > *cst)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00201">pb_constraint.cc:201</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a668f93c96cd8a83dd4bf3da35ba8b7b0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a668f93c96cd8a83dd4bf3da35ba8b7b0">operations_research::sat::PbConstraints::AddConstraint</a></div><div class="ttdeci">bool AddConstraint(const std::vector< LiteralWithCoeff > &cst, Coefficient rhs, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00824">pb_constraint.cc:824</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a5300129913f51dcb0b1c531e3248490e">operations_research::sat::VariablesAssignment::LiteralIsTrue</a></div><div class="ttdeci">bool LiteralIsTrue(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00150">sat_base.h:150</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a6097c48821f010becb9a6910f4c39288"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a6097c48821f010becb9a6910f4c39288">operations_research::sat::MutableUpperBoundedLinearConstraint::DebugString</a></div><div class="ttdeci">std::string DebugString()</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00277">pb_constraint.cc:277</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a16645beea614ddea591b722904131da9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a16645beea614ddea591b722904131da9">operations_research::sat::MutableUpperBoundedLinearConstraint::ReduceCoefficients</a></div><div class="ttdeci">void ReduceCoefficients()</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00261">pb_constraint.cc:261</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a1f591be5334541874ba049873235f0a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a1f591be5334541874ba049873235f0a9">operations_research::sat::PbConstraints::Propagate</a></div><div class="ttdeci">bool Propagate(Trail *trail) final</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00935">pb_constraint.cc:935</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_propagator_html_a06e2c6f3432a89d0160b831d48afd8b7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_propagator.html#a06e2c6f3432a89d0160b831d48afd8b7">operations_research::sat::SatPropagator::propagation_trail_index_</a></div><div class="ttdeci">int propagation_trail_index_</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00507">sat_base.h:507</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7ab45c5256e605ee3da3bf3abd1df2e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">operations_research::sat::kTrueLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kTrueLiteralIndex(-2)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a886e9c024f7209181c0a850b6e90c644">operations_research::sat::Literal::Negated</a></div><div class="ttdeci">Literal Negated() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00091">sat_base.h:91</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a7af7a846335222cba297cb30a41c6525"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a7af7a846335222cba297cb30a41c6525">operations_research::sat::MutableUpperBoundedLinearConstraint::CancelationAmount</a></div><div class="ttdeci">Coefficient CancelationAmount(Literal literal, Coefficient coeff) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00296">pb_constraint.h:296</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info_html_afe52c2c26c7ea4bb701d2e051c0f3833"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info.html#afe52c2c26c7ea4bb701d2e051c0f3833">operations_research::sat::PbConstraintsEnqueueHelper::ReasonInfo::pb_constraint</a></div><div class="ttdeci">UpperBoundedLinearConstraint * pb_constraint</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00355">pb_constraint.h:355</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a3d589ce2855e8e0e57354f33d73123e2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a3d589ce2855e8e0e57354f33d73123e2">operations_research::sat::MutableUpperBoundedLinearConstraint::ReduceSlackTo</a></div><div class="ttdeci">void ReduceSlackTo(const Trail &trail, int trail_index, Coefficient initial_slack, Coefficient target)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00333">pb_constraint.cc:333</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5c5399274f079c718ec46bf4b3032d27"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5c5399274f079c718ec46bf4b3032d27">operations_research::sat::ComputeNegatedCanonicalRhs</a></div><div class="ttdeci">Coefficient ComputeNegatedCanonicalRhs(Coefficient lower_bound, Coefficient bound_shift, Coefficient max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00178">pb_constraint.cc:178</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a750b5d744c39a06bfb13e6eb010e35d0"><div class="ttname"><a href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a></div><div class="ttdeci">int index</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00508">pack.cc:508</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_propagator_html_a0af2aa6e387b8037179350b735fe127e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_propagator.html#a0af2aa6e387b8037179350b735fe127e">operations_research::sat::SatPropagator::propagator_id_</a></div><div class="ttdeci">int propagator_id_</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00506">sat_base.h:506</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a184fe69018ae421dcf31c964bfe40576"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a184fe69018ae421dcf31c964bfe40576">absl::StrongVector::assign</a></div><div class="ttdeci">void assign(size_type n, const value_type &val)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00131">strong_vector.h:131</a></div></div>
|
|
<div class="ttc" id="apb__constraint_8h_html"><div class="ttname"><a href="pb__constraint_8h.html">pb_constraint.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a63931731d764c40e4c80ec59a553a0f1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a63931731d764c40e4c80ec59a553a0f1">operations_research::sat::UpperBoundedLinearConstraint::Untrail</a></div><div class="ttdeci">void Untrail(Coefficient *threshold, int trail_index)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00812">pb_constraint.cc:812</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a740bdf0c6c84d1fd07e8405fac06e04e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a740bdf0c6c84d1fd07e8405fac06e04e">operations_research::sat::SimplifyCanonicalBooleanLinearConstraint</a></div><div class="ttdeci">void SimplifyCanonicalBooleanLinearConstraint(std::vector< LiteralWithCoeff > *cst, Coefficient *rhs)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00148">pb_constraint.cc:148</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a8ef12397d1682615bc3108c397734179"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a8ef12397d1682615bc3108c397734179">operations_research::sat::Trail::Index</a></div><div class="ttdeci">int Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00378">sat_base.h:378</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_assignment_info_html_a8843d978bef78a2392a908bd07fffb8e"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_assignment_info.html#a8843d978bef78a2392a908bd07fffb8e">operations_research::sat::AssignmentInfo::trail_index</a></div><div class="ttdeci">int32 trail_index</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00208">sat_base.h:208</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a41f798a04019147982b29c576ff9d8b7"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a41f798a04019147982b29c576ff9d8b7">operations_research::SparseBitset::Set</a></div><div class="ttdeci">void Set(IntegerType index)</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00805">bitset.h:805</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_aa7d76b766faf39c1652b6617eac5fe20"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aa7d76b766faf39c1652b6617eac5fe20">operations_research::sat::MutableUpperBoundedLinearConstraint::ClearAll</a></div><div class="ttdeci">void ClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00250">pb_constraint.cc:250</a></div></div>
|
|
<div class="ttc" id="astats_8h_html_a9995704aaaf45fc21e08c847551a8d04"><div class="ttname"><a href="stats_8h.html#a9995704aaaf45fc21e08c847551a8d04">SCOPED_TIME_STAT</a></div><div class="ttdeci">#define SCOPED_TIME_STAT(stats)</div><div class="ttdef"><b>Definition:</b> <a href="stats_8h_source.html#l00436">stats.h:436</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_af730895c6c6ef6e03caaf6251192dfd2"><div class="ttname"><a href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a></div><div class="ttdeci">int64 a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00042">constraint_solver/table.cc:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_add3bd69a358a7351a31f0a12a4bf16b0"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#add3bd69a358a7351a31f0a12a4bf16b0">operations_research::sat::UpperBoundedLinearConstraint::activity</a></div><div class="ttdeci">double activity() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00468">pb_constraint.h:468</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_aaff50cb53673c51920c6bcb567ca8806"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#aaff50cb53673c51920c6bcb567ca8806">operations_research::sat::MutableUpperBoundedLinearConstraint::AddTerm</a></div><div class="ttdeci">void AddTerm(Literal literal, Coefficient coeff)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00273">pb_constraint.h:273</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8860b588974cb8ffaf2ac97eafd67b3e"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8860b588974cb8ffaf2ac97eafd67b3e">operations_research::sat::ComputeBooleanLinearExpressionCanonicalForm</a></div><div class="ttdeci">bool ComputeBooleanLinearExpressionCanonicalForm(std::vector< LiteralWithCoeff > *cst, Coefficient *bound_shift, Coefficient *max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00041">pb_constraint.cc:41</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html">operations_research::sat::UpperBoundedLinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00373">pb_constraint.h:373</a></div></div>
|
|
<div class="ttc" id="athorough__hash_8h_html"><div class="ttname"><a href="thorough__hash_8h.html">thorough_hash.h</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a058bda4957df6a97b1ea6c9fd783f672"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a058bda4957df6a97b1ea6c9fd783f672">absl::StrongVector::pop_back</a></div><div class="ttdeci">void pop_back()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00168">strong_vector.h:168</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_acf18431db5241d6ae15e5db2470d9079"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#acf18431db5241d6ae15e5db2470d9079">operations_research::sat::BooleanLinearExpressionIsCanonical</a></div><div class="ttdeci">bool BooleanLinearExpressionIsCanonical(const std::vector< LiteralWithCoeff > &cst)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00136">pb_constraint.cc:136</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::Trail::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00380">sat_base.h:380</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a969b5056550d96847f8c35f19fd17f50"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">operations_research::sat::kFalseLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kFalseLiteralIndex(-3)</div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_ac4fb16d0641ccef0502adb8bbe3909af"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ac4fb16d0641ccef0502adb8bbe3909af">operations_research::sat::MutableUpperBoundedLinearConstraint::AddToRhs</a></div><div class="ttdeci">void AddToRhs(Coefficient value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00264">pb_constraint.h:264</a></div></div>
|
|
<div class="ttc" id="apreprocessor_8cc_html_abcdbe46fb8451a69d42c17abdb920021"><div class="ttname"><a href="preprocessor_8cc.html#abcdbe46fb8451a69d42c17abdb920021">representative</a></div><div class="ttdeci">ColIndex representative</div><div class="ttdef"><b>Definition:</b> <a href="preprocessor_8cc_source.html#l00430">preprocessor.cc:430</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_a1e5ae9fb14fd6b25919148ae8bbaf050"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">operations_research::SparseBitset::PositionsSetAtLeastOnce</a></div><div class="ttdeci">const std::vector< IntegerType > & PositionsSetAtLeastOnce() const</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00815">bitset.h:815</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a2c809e3ff1236e74ebaaafb7864aca94"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a2c809e3ff1236e74ebaaafb7864aca94">operations_research::sat::UpperBoundedLinearConstraint::FillReason</a></div><div class="ttdeci">void FillReason(const Trail &trail, int source_trail_index, BooleanVariable propagated_variable, std::vector< Literal > *reason)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00576">pb_constraint.cc:576</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_aaf167a7e47f0e21f2b67ba9af023530a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#aaf167a7e47f0e21f2b67ba9af023530a">operations_research::sat::UpperBoundedLinearConstraint::UpperBoundedLinearConstraint</a></div><div class="ttdeci">UpperBoundedLinearConstraint(const std::vector< LiteralWithCoeff > &cst)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00390">pb_constraint.cc:390</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a562245e719610d5969ca1b4b1b310c9d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a562245e719610d5969ca1b4b1b310c9d">operations_research::sat::ApplyLiteralMapping</a></div><div class="ttdeci">bool ApplyLiteralMapping(const absl::StrongVector< LiteralIndex, LiteralIndex > &mapping, std::vector< LiteralWithCoeff > *cst, Coefficient *bound_shift, Coefficient *max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00103">pb_constraint.cc:103</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html_a4a11c7c4d7706c09de5e18707c3b5c62"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html#a4a11c7c4d7706c09de5e18707c3b5c62">operations_research::sat::Literal::Index</a></div><div class="ttdeci">LiteralIndex Index() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00084">sat_base.h:84</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a4086a48ef9859b6ed0a5e9dd08d622c7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a4086a48ef9859b6ed0a5e9dd08d622c7">operations_research::sat::Trail::EnqueueWithSameReasonAs</a></div><div class="ttdeci">void EnqueueWithSameReasonAs(Literal true_literal, BooleanVariable reference_var)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00272">sat_base.h:272</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_html_a2b537e8bba9403eef4d626a7a8b921a1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#a2b537e8bba9403eef4d626a7a8b921a1">operations_research::sat::PbConstraintsEnqueueHelper::reasons</a></div><div class="ttdeci">std::vector< ReasonInfo > reasons</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00357">pb_constraint.h:357</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_ae20e3965a974e3a5fe816c033a94e568"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#ae20e3965a974e3a5fe816c033a94e568">operations_research::sat::PbConstraints::Untrail</a></div><div class="ttdeci">void Untrail(const Trail &trail, int trail_index) final</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00943">pb_constraint.cc:943</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_ad064f7982ad8af720e437b82380b629f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#ad064f7982ad8af720e437b82380b629f">operations_research::sat::PbConstraints::UpdateActivityIncrement</a></div><div class="ttdeci">void UpdateActivityIncrement()</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l01084">pb_constraint.cc:1084</a></div></div>
|
|
<div class="ttc" id="abase_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#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="abase_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#l00699">base/logging.h:699</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info_html_a423024af9357cc1dff15aa424e022d9d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_1_1_reason_info.html#a423024af9357cc1dff15aa424e022d9d">operations_research::sat::PbConstraintsEnqueueHelper::ReasonInfo::source_trail_index</a></div><div class="ttdeci">int source_trail_index</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00354">pb_constraint.h:354</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_sparse_bitset_html_aa7d76b766faf39c1652b6617eac5fe20"><div class="ttname"><a href="classoperations__research_1_1_sparse_bitset.html#aa7d76b766faf39c1652b6617eac5fe20">operations_research::SparseBitset::ClearAll</a></div><div class="ttdeci">void ClearAll()</div><div class="ttdef"><b>Definition:</b> <a href="bitset_8h_source.html#l00776">bitset.h:776</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a84f6b2c778ed597c90f98f0329a25713"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a84f6b2c778ed597c90f98f0329a25713">operations_research::sat::Trail::MutableConflict</a></div><div class="ttdeci">std::vector< Literal > * MutableConflict()</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00361">sat_base.h:361</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#ad63c4461a1384629cb99413c6df8b9ca">operations_research::sat::Trail::CurrentDecisionLevel</a></div><div class="ttdeci">int CurrentDecisionLevel() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00355">sat_base.h:355</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00064">sat_base.h:64</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a01c76d0c46e2975d10e45ab04877f4ac"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a01c76d0c46e2975d10e45ab04877f4ac">operations_research::sat::ComputeCanonicalRhs</a></div><div class="ttdeci">Coefficient ComputeCanonicalRhs(Coefficient upper_bound, Coefficient bound_shift, Coefficient max_value)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00160">pb_constraint.cc:160</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a103f8fd98c381df722712e1782af52d4"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a103f8fd98c381df722712e1782af52d4">operations_research::sat::UpperBoundedLinearConstraint::ComputeCancelation</a></div><div class="ttdeci">Coefficient ComputeCancelation(const Trail &trail, int trail_index, const MutableUpperBoundedLinearConstraint &conflict)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00647">pb_constraint.cc:647</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a5f65c8b6b41bb6b090435d4aa3d7d30b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a5f65c8b6b41bb6b090435d4aa3d7d30b">operations_research::sat::UpperBoundedLinearConstraint::already_propagated_end</a></div><div class="ttdeci">int already_propagated_end() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00476">pb_constraint.h:476</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector< LiteralIndex, LiteralIndex ></a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_assignment_info_html_afefd28242df91e46e762af1f7eaf623f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_assignment_info.html#afefd28242df91e46e762af1f7eaf623f">operations_research::sat::AssignmentInfo::level</a></div><div class="ttdeci">uint32 level</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00199">sat_base.h:199</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a32f963abf423028dcbb4d1c3daf8086d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a32f963abf423028dcbb4d1c3daf8086d">operations_research::sat::UpperBoundedLinearConstraint::HasIdenticalTerms</a></div><div class="ttdeci">bool HasIdenticalTerms(const std::vector< LiteralWithCoeff > &cst)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00443">pb_constraint.cc:443</a></div></div>
|
|
<div class="ttc" id="arouting__search_8cc_html_ab66ad179c8a6fcf1adb958cb51f4c7cb"><div class="ttname"><a href="routing__search_8cc.html#ab66ad179c8a6fcf1adb958cb51f4c7cb">coefficient</a></div><div class="ttdeci">int64 coefficient</div><div class="ttdef"><b>Definition:</b> <a href="routing__search_8cc_source.html#l00973">routing_search.cc:973</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a7e8ee12f0eae3b9e348b88e6675438d7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a7e8ee12f0eae3b9e348b88e6675438d7">operations_research::sat::UpperBoundedLinearConstraint::is_learned</a></div><div class="ttdeci">bool is_learned() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00462">pb_constraint.h:462</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a2296cbfc427d1ccfb3ecc7d0ced18b01"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a2296cbfc427d1ccfb3ecc7d0ced18b01">operations_research::sat::MutableUpperBoundedLinearConstraint::GetLiteral</a></div><div class="ttdeci">Literal GetLiteral(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00191">pb_constraint.h:191</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a5a8bf8a7daa44c4c35f8aa05a84c19ba"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a5a8bf8a7daa44c4c35f8aa05a84c19ba">operations_research::sat::MutableUpperBoundedLinearConstraint::PossibleNonZeros</a></div><div class="ttdeci">const std::vector< BooleanVariable > & PossibleNonZeros() const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00305">pb_constraint.h:305</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_af71e6c1eccbc12e9339c00a86a981a43"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#af71e6c1eccbc12e9339c00a86a981a43">absl::StrongVector::back</a></div><div class="ttdeci">reference back()</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00174">strong_vector.h:174</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</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="astructoperations__research_1_1sat_1_1_literal_with_coeff_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_literal_with_coeff.html">operations_research::sat::LiteralWithCoeff</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00049">pb_constraint.h:49</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a344010e26426d6a13411648d988bc9b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a></div><div class="ttdeci">int64 b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00043">constraint_solver/table.cc:43</a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a4e3670a285a3642eaa07f66766cffa72"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a4e3670a285a3642eaa07f66766cffa72">absl::StrongVector::resize</a></div><div class="ttdeci">void resize(size_type new_size)</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00150">strong_vector.h:150</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_ab00d5c5d5edf37a9568363ba39e02c11"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#ab00d5c5d5edf37a9568363ba39e02c11">operations_research::sat::PbConstraints::ReasonPbConstraint</a></div><div class="ttdeci">UpperBoundedLinearConstraint * ReasonPbConstraint(int trail_index) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00977">pb_constraint.cc:977</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a1d503b84c8c90bca31afd5a89b6db0ba"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a1d503b84c8c90bca31afd5a89b6db0ba">operations_research::sat::UpperBoundedLinearConstraint::Propagate</a></div><div class="ttdeci">bool Propagate(int trail_index, Coefficient *threshold, Trail *trail, PbConstraintsEnqueueHelper *helper)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00533">pb_constraint.cc:533</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a49e751eb6f0e9babd957889bb8e7472d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">operations_research::sat::VariablesAssignment::VariableIsAssigned</a></div><div class="ttdeci">bool VariableIsAssigned(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00158">sat_base.h:158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html">operations_research::sat::MutableUpperBoundedLinearConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00173">pb_constraint.h:173</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a033e8db16a2a7516bc261c80d1e6ed0f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a033e8db16a2a7516bc261c80d1e6ed0f">operations_research::sat::UpperBoundedLinearConstraint::set_activity</a></div><div class="ttdeci">void set_activity(double activity)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00467">pb_constraint.h:467</a></div></div>
|
|
<div class="ttc" id="abase_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#l00698">base/logging.h:698</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_html_ac12cf291d1c4f67f024ecd26b791507d"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#ac12cf291d1c4f67f024ecd26b791507d">operations_research::sat::PbConstraintsEnqueueHelper::propagator_id</a></div><div class="ttdeci">int propagator_id</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00346">pb_constraint.h:346</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_a8627f242a0332f34d29d85b6c57f1224"><div class="ttname"><a href="namespaceoperations__research.html#a8627f242a0332f34d29d85b6c57f1224">operations_research::ThoroughHash</a></div><div class="ttdeci">uint64 ThoroughHash(const char *bytes, size_t len)</div><div class="ttdef"><b>Definition:</b> <a href="thorough__hash_8h_source.html#l00033">thorough_hash.h:33</a></div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00084">optimization.cc:84</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a9d3beb2afe4ae647674b054bf29290e2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a9d3beb2afe4ae647674b054bf29290e2">operations_research::sat::Trail::NumVariables</a></div><div class="ttdeci">int NumVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00376">sat_base.h:376</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_upper_bounded_linear_constraint_html_a40517ccc9af91f2423cb14c508371ba1"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_upper_bounded_linear_constraint.html#a40517ccc9af91f2423cb14c508371ba1">operations_research::sat::UpperBoundedLinearConstraint::ResolvePBConflict</a></div><div class="ttdeci">void ResolvePBConflict(const Trail &trail, BooleanVariable var, MutableUpperBoundedLinearConstraint *conflict, Coefficient *conflict_slack)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00664">pb_constraint.cc:664</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_html_a80f73afb7f3e4965def965261750bc86"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#a80f73afb7f3e4965def965261750bc86">operations_research::sat::PbConstraintsEnqueueHelper::Enqueue</a></div><div class="ttdeci">void Enqueue(Literal l, int source_trail_index, UpperBoundedLinearConstraint *ct, Trail *trail)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00339">pb_constraint.h:339</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_ad87ff40755cf420a0b8ead1f7f9f0489"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#ad87ff40755cf420a0b8ead1f7f9f0489">operations_research::sat::MutableUpperBoundedLinearConstraint::GetCoefficient</a></div><div class="ttdeci">Coefficient GetCoefficient(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00184">pb_constraint.h:184</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">operations_research::sat::VariablesAssignment::LiteralIsFalse</a></div><div class="ttdeci">bool LiteralIsFalse(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00147">sat_base.h:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_pb_constraints_html_a2aab5f0b8a516d308939c4cad97fc634"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_pb_constraints.html#a2aab5f0b8a516d308939c4cad97fc634">operations_research::sat::PbConstraints::RescaleActivities</a></div><div class="ttdeci">void RescaleActivities(double scaling_factor)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l01077">pb_constraint.cc:1077</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00233">sat_base.h:233</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint_html_a34a2ab35db64cd0574f980eb99d34a89"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_mutable_upper_bounded_linear_constraint.html#a34a2ab35db64cd0574f980eb99d34a89">operations_research::sat::MutableUpperBoundedLinearConstraint::ReduceCoefficientsAndComputeSlackForTrailPrefix</a></div><div class="ttdeci">Coefficient ReduceCoefficientsAndComputeSlackForTrailPrefix(const Trail &trail, int trail_index)</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8cc_source.html#l00303">pb_constraint.cc:304</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper_html_aaae88a70725a09afe173932f040c49a1"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_pb_constraints_enqueue_helper.html#aaae88a70725a09afe173932f040c49a1">operations_research::sat::PbConstraintsEnqueueHelper::conflict</a></div><div class="ttdeci">std::vector< Literal > conflict</div><div class="ttdef"><b>Definition:</b> <a href="pb__constraint_8h_source.html#l00349">pb_constraint.h:349</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a70e532a108e1f03d6f9112c770ffbedb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a70e532a108e1f03d6f9112c770ffbedb">operations_research::sat::Trail::GetEmptyVectorToStoreReason</a></div><div class="ttdeci">std::vector< Literal > * GetEmptyVectorToStoreReason(int trail_index) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00320">sat_base.h:320</a></div></div>
|
|
<!-- 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="pb__constraint_8cc.html">pb_constraint.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.20 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|