1099 lines
196 KiB
HTML
1099 lines
196 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.18"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: precedences.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.0</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.8.18 -->
|
|
<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('precedences_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">precedences.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="precedences_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="precedences_8h.html">ortools/sat/precedences.h</a>"</span></div>
|
|
<div class="line"><a name="l00015"></a><span class="lineno"> 15</span>  </div>
|
|
<div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <algorithm></span></div>
|
|
<div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span>  </div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="preprocessor">#include "<a class="code" href="cleanup_8h.html">ortools/base/cleanup.h</a>"</span></div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "<a class="code" href="base_2logging_8h.html">ortools/base/logging.h</a>"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="stl__util_8h.html">ortools/base/stl_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include "<a class="code" href="clause_8h.html">ortools/sat/clause.h</a>"</span></div>
|
|
<div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="cp__constraints_8h.html">ortools/sat/cp_constraints.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span>  </div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">namespace </span>sat {</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="keyword">namespace </span>{</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  </div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keywordtype">void</span> AppendLowerBoundReasonIfValid(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>,</div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  <span class="keyword">const</span> IntegerTrail& i_trail,</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  std::vector<IntegerLiteral>* reason) {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  reason->push_back(i_trail.LowerBoundAsLiteral(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</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> }</div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  </div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span> } <span class="comment">// namespace</span></div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  </div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#a1f591be5334541874ba049873235f0a9"> 40</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">PrecedencesPropagator::Propagate</a>(<a class="code" href="classoperations__research_1_1sat_1_1Trail.html">Trail</a>* trail) { <span class="keywordflow">return</span> <a class="code" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">Propagate</a>(); }</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  </div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 42</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">PrecedencesPropagator::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">while</span> (propagation_trail_index_ < trail_-><a class="code" href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">Index</a>()) {</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1Literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = (*trail_)[<a class="code" href="classoperations__research_1_1sat_1_1SatPropagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>++];</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="keywordflow">if</span> (<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index() >= literal_to_new_impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// IMPORTANT: Because of the way Untrail() work, we need to add all the</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// potential arcs before we can abort. It is why we iterate twice here.</span></div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index :</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  literal_to_new_impacted_arcs_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]) {</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">if</span> (--arc_counts_[arc_index] == 0) {</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  impacted_arcs_[arc.tail_var].<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(arc_index);</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  }</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  }</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  </div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// Iterate again to check for a propagation and indirectly update</span></div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">// modified_vars_.</span></div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index :</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  literal_to_new_impacted_arcs_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]) {</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keywordflow">if</span> (arc_counts_[arc_index] > 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(arc.head_var)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">const</span> IntegerValue new_head_lb =</div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.tail_var) + ArcOffset(arc);</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">if</span> (new_head_lb > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.head_var)) {</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">if</span> (!EnqueueAndCheck(arc, new_head_lb, trail_)) <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>  }</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>  </div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// Do the actual propagation of the IntegerVariable bounds.</span></div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  InitializeBFQueueWithModifiedNodes();</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keywordflow">if</span> (!BellmanFordTarjan(trail_)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="comment">// We can only test that no propagation is left if we didn't enqueue new</span></div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="comment">// literal in the presence of optional variables.</span></div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1SatPropagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> == trail_-><a class="code" href="classoperations__research_1_1sat_1_1Trail.html#a8ef12397d1682615bc3108c397734179">Index</a>()) {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  DCHECK(NoPropagationLeft(*trail_));</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  }</div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  </div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="comment">// Propagate the presence literals of the arcs that can't be added.</span></div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  PropagateOptionalArcs(trail_);</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">// Clean-up modified_vars_ to do as little as possible on the next call.</span></div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  modified_vars_.<a class="code" href="classoperations__research_1_1SparseBitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#af88a18429909498405c450015f0a223a">NumIntegerVariables</a>());</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span> }</div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  </div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#af3c64e10aa2bb2cc1d3615d800f7c71c"> 90</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#af3c64e10aa2bb2cc1d3615d800f7c71c">PrecedencesPropagator::PropagateOutgoingArcs</a>(IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : impacted_arcs_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(arc.head_var)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">const</span> IntegerValue new_head_lb =</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.tail_var) + ArcOffset(arc);</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (new_head_lb > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.head_var)) {</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">if</span> (!EnqueueAndCheck(arc, new_head_lb, trail_)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  }</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  }</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 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="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ae20e3965a974e3a5fe816c033a94e568"> 103</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ae20e3965a974e3a5fe816c033a94e568">PrecedencesPropagator::Untrail</a>(<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1Trail.html">Trail</a>& trail, <span class="keywordtype">int</span> trail_index) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (<a class="code" href="classoperations__research_1_1sat_1_1SatPropagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> > trail_index) {</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="comment">// This means that we already propagated all there is to propagate</span></div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// at the level trail_index, so we can safely clear modified_vars_ in case</span></div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// it wasn't already done.</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  modified_vars_.<a class="code" href="classoperations__research_1_1SparseBitset.html#ae09e38958e558d2c776bc555a0dc2fc7">ClearAndResize</a>(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#af88a18429909498405c450015f0a223a">NumIntegerVariables</a>());</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <span class="keywordflow">while</span> (<a class="code" href="classoperations__research_1_1sat_1_1SatPropagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a> > trail_index) {</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1Literal.html">Literal</a> <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = trail[--<a class="code" href="classoperations__research_1_1sat_1_1SatPropagator.html#a06e2c6f3432a89d0160b831d48afd8b7">propagation_trail_index_</a>];</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index() >= literal_to_new_impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index :</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  literal_to_new_impacted_arcs_[<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Index()]) {</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keywordflow">if</span> (arc_counts_[arc_index]++ == 0) {</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  impacted_arcs_[arc.tail_var].<a class="code" href="classgtl_1_1ITIVector.html#a058bda4957df6a97b1ea6c9fd783f672">pop_back</a>();</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  }</div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  }</div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span> }</div>
|
|
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  </div>
|
|
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// Instead of simply sorting the IntegerPrecedences returned by .var,</span></div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment">// experiments showed that it is faster to regroup all the same .var "by hand"</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment">// by first computing how many times they appear and then apply the sorting</span></div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// permutation.</span></div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#a880ad5f7514aee33f81302d8af2a7be2"> 127</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#a880ad5f7514aee33f81302d8af2a7be2">PrecedencesPropagator::ComputePrecedences</a>(</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars,</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  std::vector<IntegerPrecedences>* output) {</div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  tmp_sorted_vars_.clear();</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  tmp_precedences_.clear();</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = 0; <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> < vars.size(); ++<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = vars[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  CHECK_NE(<a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>, <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> >= impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : impacted_arcs_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(arc.head_var)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  </div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  IntegerValue offset = arc.offset;</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (arc.offset_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  offset += integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.offset_var);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  }</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  </div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="comment">// TODO(user): it seems better to ignore negative min offset as we will</span></div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <span class="comment">// often have relation of the form interval_start >= interval_end -</span></div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  <span class="comment">// offset, and such relation are usually not useful. Revisit this in case</span></div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="comment">// we see problems where we can propagate more without this test.</span></div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">if</span> (offset < 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  </div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (var_to_degree_[arc.head_var] == 0) {</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  tmp_sorted_vars_.push_back(</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  {arc.head_var, integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.head_var)});</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  <span class="comment">// This "seen" mechanism is needed because we may have multi-arc and we</span></div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  <span class="comment">// don't want any duplicates in the "is_before" relation. Note that it</span></div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="comment">// works because var_to_last_index_ is reset by the var_to_degree_ == 0</span></div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  <span class="comment">// case.</span></div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">if</span> (var_to_last_index_[arc.head_var] == <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  var_to_last_index_[arc.head_var] = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  var_to_degree_[arc.head_var]++;</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  tmp_precedences_.push_back(</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  {<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>, arc.head_var, arc_index.value(), offset});</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  }</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  }</div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  </div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="comment">// This order is a topological order for the precedences relation order</span></div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  <span class="comment">// provided that all the offset between the involved IntegerVariable are</span></div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  <span class="comment">// positive.</span></div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="comment">// TODO(user): use an order that is always topological? This is not clear</span></div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="comment">// since it may be slower to compute and not worth it because the order below</span></div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">// is more natural and may work better.</span></div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  std::sort(tmp_sorted_vars_.begin(), tmp_sorted_vars_.end());</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  </div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="comment">// Permute tmp_precedences_ into the output to put it in the correct order.</span></div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="comment">// For that we transform var_to_degree_ to point to the first position of</span></div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// each lbvar in the output vector.</span></div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="keywordtype">int</span> start = 0;</div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> SortedVar pair : tmp_sorted_vars_) {</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> degree = var_to_degree_[pair.var];</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="keywordflow">if</span> (degree > 1) {</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  var_to_degree_[pair.var] = start;</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  start += degree;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  <span class="comment">// Optimization: we remove degree one relations.</span></div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  var_to_degree_[pair.var] = -1;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  }</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  output->resize(start);</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="structoperations__research_1_1sat_1_1PrecedencesPropagator_1_1IntegerPrecedences.html">IntegerPrecedences</a>& precedence : tmp_precedences_) {</div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keywordflow">if</span> (var_to_degree_[precedence.var] < 0) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  (*output)[var_to_degree_[precedence.var]++] = precedence;</div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  </div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// Cleanup var_to_degree_, note that we don't need to clean</span></div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="comment">// var_to_last_index_.</span></div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> SortedVar pair : tmp_sorted_vars_) {</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  var_to_degree_[pair.var] = 0;</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  }</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span> }</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  </div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#a09ebe3a2f1825d6366649cd157e5020f"> 204</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#a09ebe3a2f1825d6366649cd157e5020f">PrecedencesPropagator::AddPrecedenceReason</a>(</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="keywordtype">int</span> arc_index, IntegerValue min_offset,</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  std::vector<Literal>* literal_reason,</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  std::vector<IntegerLiteral>* integer_reason)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a>(arc_index)];</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1Literal.html">Literal</a> l : arc.presence_literals) {</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  literal_reason->push_back(l.<a class="code" href="classoperations__research_1_1sat_1_1Literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  }</div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">if</span> (arc.offset_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <span class="comment">// Reason for ArcOffset(arc) to be >= min_offset.</span></div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  integer_reason->push_back(<a class="code" href="structoperations__research_1_1sat_1_1IntegerLiteral.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  arc.offset_var, min_offset - arc.offset));</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  }</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span> }</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="keywordtype">void</span> PrecedencesPropagator::AdjustSizeFor(IntegerVariable i) {</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(i.value(), <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(i).<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>());</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordflow">if</span> (<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> >= impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="comment">// TODO(user): only watch lower bound of the relevant variable instead</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// of watching everything in [0, max_index_of_variable_used_in_this_class).</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="keywordflow">for</span> (IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()); <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> <= <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>; ++<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  watcher_-><a class="code" href="classoperations__research_1_1sat_1_1GenericLiteralWatcher.html#aaede7c755aad90772efda6db087f3413">WatchLowerBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, watcher_id_);</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>  impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1);</div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  impacted_potential_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1);</div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  var_to_degree_.<a class="code" href="classgtl_1_1ITIVector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1);</div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  var_to_last_index_.<a class="code" href="classgtl_1_1ITIVector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> + 1);</div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  }</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> }</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  </div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="keywordtype">void</span> PrecedencesPropagator::AddArc(</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  IntegerVariable <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, IntegerVariable <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, IntegerValue offset,</div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  IntegerVariable offset_var, absl::Span<const Literal> presence_literals) {</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  DCHECK_EQ(trail_-><a class="code" href="classoperations__research_1_1sat_1_1Trail.html#ad63c4461a1384629cb99413c6df8b9ca">CurrentDecisionLevel</a>(), 0);</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  AdjustSizeFor(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>);</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  AdjustSizeFor(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>);</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="keywordflow">if</span> (offset_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) AdjustSizeFor(offset_var);</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  </div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="comment">// This arc is present iff all the literals here are true.</span></div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  absl::InlinedVector<Literal, 6> enforcement_literals;</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  {</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : presence_literals) {</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  enforcement_literals.push_back(l);</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#acc1aaae243ed4381e84f8309aacb3bbc">IsOptional</a>(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>)) {</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  enforcement_literals.push_back(</div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac8db20a5dab063aa3ca64a4ae1202d4c">IsIgnoredLiteral</a>(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>).<a class="code" href="classoperations__research_1_1sat_1_1Literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#acc1aaae243ed4381e84f8309aacb3bbc">IsOptional</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>)) {</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  enforcement_literals.push_back(</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac8db20a5dab063aa3ca64a4ae1202d4c">IsIgnoredLiteral</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>).<a class="code" href="classoperations__research_1_1sat_1_1Literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  }</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="keywordflow">if</span> (offset_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a> &&</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#acc1aaae243ed4381e84f8309aacb3bbc">IsOptional</a>(offset_var)) {</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  enforcement_literals.push_back(</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac8db20a5dab063aa3ca64a4ae1202d4c">IsIgnoredLiteral</a>(offset_var).<a class="code" href="classoperations__research_1_1sat_1_1Literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>());</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&enforcement_literals);</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="keywordtype">int</span> new_size = 0;</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : enforcement_literals) {</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1Trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1VariablesAssignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(Literal(l))) {</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">continue</span>; <span class="comment">// At true, ignore this literal.</span></div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1Trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1VariablesAssignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(Literal(l))) {</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">return</span>; <span class="comment">// At false, ignore completely this arc.</span></div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  }</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  enforcement_literals[new_size++] = l;</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>  enforcement_literals.resize(new_size);</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  </div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordflow">if</span> (<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a> == <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>) {</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// A self-arc is either plain SAT or plain UNSAT or it forces something on</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// the given offset_var or presence_literal_index. In any case it could be</span></div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// presolved in something more efficent.</span></div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  VLOG(1) << <span class="stringliteral">"Self arc! This could be presolved. "</span></div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  << <span class="stringliteral">"var:"</span> << <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> << <span class="stringliteral">" offset:"</span> << offset</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  << <span class="stringliteral">" offset_var:"</span> << offset_var</div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  << <span class="stringliteral">" conditioned_by:"</span> << presence_literals;</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  }</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// Remove the offset_var if it is fixed.</span></div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="comment">// TODO(user): We should also handle the case where tail or head is fixed.</span></div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">if</span> (offset_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keyword">const</span> IntegerValue lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(offset_var);</div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">if</span> (lb == integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(offset_var)) {</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  offset += lb;</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  offset_var = <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  }</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  }</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  </div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// Deal first with impacted_potential_arcs_/potential_arcs_.</span></div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (!enforcement_literals.empty()) {</div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="keyword">const</span> OptionalArcIndex arc_index(potential_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>());</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  potential_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(</div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  {<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, offset, offset_var, enforcement_literals});</div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  impacted_potential_arcs_[<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>].<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(arc_index);</div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  impacted_potential_arcs_[<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>)].<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(arc_index);</div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">if</span> (offset_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  impacted_potential_arcs_[offset_var].<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(arc_index);</div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  }</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  }</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  </div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">// Now deal with impacted_arcs_/arcs_.</span></div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">struct </span>InternalArc {</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  IntegerVariable tail_var;</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  IntegerVariable head_var;</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  IntegerVariable offset_var;</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  };</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  std::vector<InternalArc> to_add;</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> (offset_var == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) {</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  <span class="comment">// a + offset <= b and -b + offset <= -a</span></div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  to_add.push_back({<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>});</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  to_add.push_back({<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>), <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>), <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>});</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="comment">// tail (a) and offset_var (b) are symmetric, so we add:</span></div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// - a + b + offset <= c</span></div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  to_add.push_back({<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, offset_var});</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  to_add.push_back({offset_var, <a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>, <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>});</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// - a - c + offset <= -b</span></div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  to_add.push_back({<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(offset_var), <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>)});</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  to_add.push_back({<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>), <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(offset_var), <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>});</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  <span class="comment">// - b - c + offset <= -a</span></div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  to_add.push_back({offset_var, <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>), <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>)});</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  to_add.push_back({<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a>), <a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>), offset_var});</div>
|
|
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  }</div>
|
|
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> InternalArc <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a> : to_add) {</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// Since we add a new arc, we will need to consider its tail during the next</span></div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// propagation. Note that the size of modified_vars_ will be automatically</span></div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// updated when new integer variables are created since we register it with</span></div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="comment">// IntegerTrail in this class contructor.</span></div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="comment">// TODO(user): Adding arcs and then calling Untrail() before Propagate()</span></div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="comment">// will cause this mecanism to break. Find a more robust implementation.</span></div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="comment">// TODO(user): In some rare corner case, rescanning the whole list of arc</span></div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="comment">// leaving tail_var can make AddVar() have a quadratic complexity where it</span></div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="comment">// shouldn't. A better solution would be to see if this new arc currently</span></div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="comment">// propagate something, and if it does, just update the lower bound of</span></div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// a.head_var and let the normal "is modified" mecanism handle any eventual</span></div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// follow up propagations.</span></div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  modified_vars_.<a class="code" href="classoperations__research_1_1SparseBitset.html#a41f798a04019147982b29c576ff9d8b7">Set</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.tail_var);</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  </div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="comment">// If a.head_var is optional, we can potentially remove some literal from</span></div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="comment">// enforcement_literals.</span></div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index(arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>());</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(</div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  {<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.tail_var, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.head_var, offset, <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.offset_var, enforcement_literals});</div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">auto</span>& presence_literals = arcs_.<a class="code" href="classgtl_1_1ITIVector.html#af71e6c1eccbc12e9339c00a86a981a43">back</a>().presence_literals;</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#acc1aaae243ed4381e84f8309aacb3bbc">IsOptional</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.head_var)) {</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="comment">// TODO(user): More generally, we can remove any literal that is implied</span></div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="comment">// by to_remove.</span></div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keyword">const</span> Literal to_remove =</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac8db20a5dab063aa3ca64a4ae1202d4c">IsIgnoredLiteral</a>(<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.head_var).<a class="code" href="classoperations__research_1_1sat_1_1Literal.html#a886e9c024f7209181c0a850b6e90c644">Negated</a>();</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keyword">const</span> <span class="keyword">auto</span> it = std::find(presence_literals.begin(),</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  presence_literals.end(), to_remove);</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordflow">if</span> (it != presence_literals.end()) presence_literals.erase(it);</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  }</div>
|
|
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  </div>
|
|
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">if</span> (presence_literals.empty()) {</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  impacted_arcs_[<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>.tail_var].<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(arc_index);</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : presence_literals) {</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  <span class="keywordflow">if</span> (l.Index() >= literal_to_new_impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) {</div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  literal_to_new_impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(l.Index().value() + 1);</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>  literal_to_new_impacted_arcs_[l.Index()].<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(arc_index);</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  }</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  arc_counts_.<a class="code" href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">push_back</a>(presence_literals.size());</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  }</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span> }</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  </div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span> <span class="comment">// TODO(user): On jobshop problems with a lot of tasks per machine (500), this</span></div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="comment">// takes up a big chunck of the running time even before we find a solution.</span></div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span> <span class="comment">// This is because, for each lower bound changed, we inspect 500 arcs even</span></div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="comment">// though they will never be propagated because the other bound is still at the</span></div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment">// horizon. Find an even sparser algorithm?</span></div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="keywordtype">void</span> PrecedencesPropagator::PropagateOptionalArcs(Trail* trail) {</div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : modified_vars_.<a class="code" href="classoperations__research_1_1SparseBitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> >= impacted_potential_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  </div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// Note that we can currently check the same ArcInfo up to 3 times, one for</span></div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  <span class="comment">// each of the arc variables: tail, NegationOf(head) and offset_var.</span></div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> OptionalArcIndex arc_index : impacted_potential_arcs_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  <span class="keyword">const</span> ArcInfo& arc = potential_arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  <span class="keywordtype">int</span> num_not_true = 0;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  Literal to_propagate;</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : arc.presence_literals) {</div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">if</span> (!trail->Assignment().LiteralIsTrue(l)) {</div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  ++num_not_true;</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  to_propagate = l;</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  }</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  }</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">if</span> (num_not_true != 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">if</span> (trail->Assignment().LiteralIsFalse(to_propagate)) <span class="keywordflow">continue</span>;</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">// Test if this arc can be present or not.</span></div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  <span class="comment">// Important arc.tail_var can be different from var here.</span></div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keyword">const</span> IntegerValue tail_lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.tail_var);</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keyword">const</span> IntegerValue head_ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(arc.head_var);</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  <span class="keywordflow">if</span> (tail_lb + ArcOffset(arc) > head_ub) {</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  integer_reason_.clear();</div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  integer_reason_.push_back(</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(arc.tail_var));</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  integer_reason_.push_back(</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(arc.head_var));</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  AppendLowerBoundReasonIfValid(arc.offset_var, *integer_trail_,</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  &integer_reason_);</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  literal_reason_.clear();</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : arc.presence_literals) {</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  <span class="keywordflow">if</span> (l != to_propagate) literal_reason_.push_back(l.Negated());</div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  }</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a79322fd8dff49ab2eab22c0570aba594">EnqueueLiteral</a>(to_propagate.Negated(), literal_reason_,</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  integer_reason_);</div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  }</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  }</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> }</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> IntegerValue PrecedencesPropagator::ArcOffset(<span class="keyword">const</span> ArcInfo& arc)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">return</span> arc.offset + (arc.offset_var == <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a></div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  ? IntegerValue(0)</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  : integer_trail_-><a class="code" href="namespaceoperations__research_1_1sat.html#a1000a311929a470e5485258d765eeabd">LowerBound</a>(arc.offset_var));</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span> }</div>
|
|
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  </div>
|
|
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="keywordtype">bool</span> PrecedencesPropagator::EnqueueAndCheck(<span class="keyword">const</span> ArcInfo& arc,</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  IntegerValue new_head_lb,</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  Trail* trail) {</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  DCHECK_GT(new_head_lb, integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.head_var));</div>
|
|
<div class="line"><a name="l00433"></a><span class="lineno"> 433</span>  </div>
|
|
<div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="comment">// Compute the reason for new_head_lb.</span></div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="comment">// TODO(user): do like for clause and keep the negation of</span></div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  <span class="comment">// arc.presence_literals? I think we could change the integer.h API to accept</span></div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// true literal like for IntegerVariable, it is really confusing currently.</span></div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  literal_reason_.clear();</div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : arc.presence_literals) {</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  literal_reason_.push_back(l.Negated());</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  }</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  </div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  integer_reason_.clear();</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  integer_reason_.push_back(integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a615d87982145007855f2102262cf773c">LowerBoundAsLiteral</a>(arc.tail_var));</div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  AppendLowerBoundReasonIfValid(arc.offset_var, *integer_trail_,</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  &integer_reason_);</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  </div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="comment">// The code works without this block since Enqueue() below can already take</span></div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// care of conflicts. However, it is better to deal with the conflict</span></div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// ourselves because we can be smarter about the reason this way.</span></div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// The reason for a "precedence" conflict is always a linear reason</span></div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">// involving the tail lower_bound, the head upper bound and eventually the</span></div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="comment">// size lower bound. Because of that, we can use the RelaxLinearReason()</span></div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// code.</span></div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="keywordflow">if</span> (new_head_lb > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(arc.head_var)) {</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="keyword">const</span> IntegerValue slack =</div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  new_head_lb - integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(arc.head_var) - 1;</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  integer_reason_.push_back(</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac0a2e8c6619af74b42472bfa9a9e6465">UpperBoundAsLiteral</a>(arc.head_var));</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  std::vector<IntegerValue> coeffs(integer_reason_.size(), IntegerValue(1));</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#aa981297d0a648cd5c3fef40e2edebf8a">RelaxLinearReason</a>(slack, coeffs, &integer_reason_);</div>
|
|
<div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  </div>
|
|
<div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#acc1aaae243ed4381e84f8309aacb3bbc">IsOptional</a>(arc.head_var)) {</div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(literal_reason_, integer_reason_);</div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  CHECK(!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(arc.head_var));</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keyword">const</span> Literal l = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac8db20a5dab063aa3ca64a4ae1202d4c">IsIgnoredLiteral</a>(arc.head_var);</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">if</span> (trail->Assignment().LiteralIsFalse(l)) {</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  literal_reason_.push_back(l);</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(literal_reason_, integer_reason_);</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a79322fd8dff49ab2eab22c0570aba594">EnqueueLiteral</a>(l, literal_reason_, integer_reason_);</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  }</div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  }</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  </div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <a class="code" href="structoperations__research_1_1sat_1_1IntegerLiteral.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(arc.head_var, new_head_lb),</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  literal_reason_, integer_reason_);</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span> }</div>
|
|
<div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  </div>
|
|
<div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="keywordtype">bool</span> PrecedencesPropagator::NoPropagationLeft(<span class="keyword">const</span> Trail& trail)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordflow">for</span> (IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>(0); <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> < num_nodes; ++<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>) {</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : impacted_arcs_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>]) {</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(arc.head_var)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.tail_var) + ArcOffset(arc) ></div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.head_var)) {</div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</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>  }</div>
|
|
<div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span> }</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> <span class="keywordtype">void</span> PrecedencesPropagator::InitializeBFQueueWithModifiedNodes() {</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// Sparse clear of the queue. TODO(user): only use the sparse version if</span></div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">// queue.size() is small or use SparseBitset.</span></div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  bf_in_queue_.resize(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> node : bf_queue_) bf_in_queue_[node] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  bf_queue_.clear();</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  DCHECK(std::none_of(bf_in_queue_.begin(), bf_in_queue_.end(),</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  [](<span class="keywordtype">bool</span> v) { return v; }));</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : modified_vars_.<a class="code" href="classoperations__research_1_1SparseBitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> >= num_nodes) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  bf_queue_.push_back(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value());</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  bf_in_queue_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value()] = <span class="keyword">true</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> }</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  </div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span> <span class="keywordtype">void</span> PrecedencesPropagator::CleanUpMarkedArcsAndParents() {</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="comment">// To be sparse, we use the fact that each node with a parent must be in</span></div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// modified_vars_.</span></div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : modified_vars_.<a class="code" href="classoperations__research_1_1SparseBitset.html#a1e5ae9fb14fd6b25919148ae8bbaf050">PositionsSetAtLeastOnce</a>()) {</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="keywordflow">if</span> (<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> >= num_nodes) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> parent_arc_index = bf_parent_arc_of_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value()];</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="keywordflow">if</span> (parent_arc_index != -1) {</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  arcs_[parent_arc_index].is_marked = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  bf_parent_arc_of_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value()] = -1;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  bf_can_be_skipped_[<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>.value()] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  }</div>
|
|
<div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  }</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  DCHECK(std::none_of(bf_parent_arc_of_.begin(), bf_parent_arc_of_.end(),</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  [](<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> v) { return v != -1; }));</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  DCHECK(std::none_of(bf_can_be_skipped_.begin(), bf_can_be_skipped_.end(),</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  [](<span class="keywordtype">bool</span> v) { return v; }));</div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span> }</div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  </div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span> <span class="keywordtype">bool</span> PrecedencesPropagator::DisassembleSubtree(</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="keywordtype">int</span> source, <span class="keywordtype">int</span> target, std::vector<bool>* can_be_skipped) {</div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// Note that we explore a tree, so we can do it in any order, and the one</span></div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">// below seems to be the fastest.</span></div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  tmp_vector_.clear();</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  tmp_vector_.push_back(source);</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  <span class="keywordflow">while</span> (!tmp_vector_.empty()) {</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a> = tmp_vector_.back();</div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  tmp_vector_.pop_back();</div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : impacted_arcs_[IntegerVariable(<a class="code" href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a>)]) {</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">if</span> (arc.is_marked) {</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  arc.is_marked = <span class="keyword">false</span>; <span class="comment">// mutable.</span></div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="keywordflow">if</span> (arc.head_var.value() == target) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  DCHECK(!(*can_be_skipped)[arc.head_var.value()]);</div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  (*can_be_skipped)[arc.head_var.value()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  tmp_vector_.push_back(arc.head_var.value());</div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  }</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  }</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span> }</div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  </div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span> <span class="keywordtype">void</span> PrecedencesPropagator::AnalyzePositiveCycle(</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> first_arc, Trail* trail, std::vector<Literal>* must_be_all_true,</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  std::vector<Literal>* literal_reason,</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  std::vector<IntegerLiteral>* integer_reason) {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  must_be_all_true->clear();</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  literal_reason->clear();</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  integer_reason->clear();</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  </div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">// Follow bf_parent_arc_of_[] to find the cycle containing first_arc.</span></div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keyword">const</span> IntegerVariable first_arc_head = arcs_[first_arc].head_var;</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index = first_arc;</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  std::vector<ArcIndex> arc_on_cycle;</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>  <span class="comment">// Just to be safe and avoid an infinite loop we use the fact that the maximum</span></div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// cycle size on a graph with n nodes is of size n. If we have more in the</span></div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// code below, it means first_arc is not part of a cycle according to</span></div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// bf_parent_arc_of_[], which should never happen.</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keywordflow">while</span> (arc_on_cycle.size() <= num_nodes) {</div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  arc_on_cycle.push_back(arc_index);</div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordflow">if</span> (arc.tail_var == first_arc_head) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  arc_index = bf_parent_arc_of_[arc.tail_var.value()];</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  CHECK_NE(arc_index, <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a>(-1));</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  }</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  CHECK_NE(arc_on_cycle.size(), num_nodes + 1) << <span class="stringliteral">"Infinite loop."</span>;</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  </div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="comment">// Compute the reason for this cycle.</span></div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  IntegerValue sum(0);</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : arc_on_cycle) {</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  sum += ArcOffset(arc);</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  AppendLowerBoundReasonIfValid(arc.offset_var, *integer_trail_,</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  integer_reason);</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : arc.presence_literals) {</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  literal_reason->push_back(l.Negated());</div>
|
|
<div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  }</div>
|
|
<div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  </div>
|
|
<div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="comment">// If the cycle happens to contain optional variable not yet ignored, then</span></div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="comment">// it is not a conflict anymore, but we can infer that these variable must</span></div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  <span class="comment">// all be ignored. This is because since we propagated them even if they</span></div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// where not present for sure, their presence literal must form a cycle</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="comment">// together (i.e. they are all absent or present at the same time).</span></div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#acc1aaae243ed4381e84f8309aacb3bbc">IsOptional</a>(arc.head_var)) {</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  must_be_all_true->push_back(</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac8db20a5dab063aa3ca64a4ae1202d4c">IsIgnoredLiteral</a>(arc.head_var));</div>
|
|
<div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  }</div>
|
|
<div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  }</div>
|
|
<div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  </div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="comment">// TODO(user): what if the sum overflow? this is just a check so I guess</span></div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">// we don't really care, but fix the issue.</span></div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  CHECK_GT(sum, 0);</div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span> }</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> <span class="comment">// Note that in our settings it is important to use an algorithm that tries to</span></div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="comment">// minimize the number of integer_trail_->Enqueue() as much as possible.</span></div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span> <span class="comment">// TODO(user): The current algorithm is quite efficient, but there is probably</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span> <span class="comment">// still room for improvments.</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span> <span class="keywordtype">bool</span> PrecedencesPropagator::BellmanFordTarjan(Trail* trail) {</div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> num_nodes = impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>();</div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  </div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// These vector are reset by CleanUpMarkedArcsAndParents() so resize is ok.</span></div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  bf_can_be_skipped_.resize(num_nodes, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  bf_parent_arc_of_.resize(num_nodes, <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a>(-1));</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keyword">const</span> <span class="keyword">auto</span> cleanup =</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <a class="code" href="namespaceabsl.html#a9bfb260a67150f0bc1da17aac9199866">::absl::MakeCleanup</a>([<span class="keyword">this</span>]() { CleanUpMarkedArcsAndParents(); });</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  </div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">// The queue initialization is done by InitializeBFQueueWithModifiedNodes().</span></div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">while</span> (!bf_queue_.empty()) {</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = bf_queue_.front();</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  bf_queue_.pop_front();</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  bf_in_queue_[node] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  </div>
|
|
<div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="comment">// TODO(user): we don't need bf_can_be_skipped_ since we can detect this</span></div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  <span class="comment">// if this node has a parent arc which is not marked. Investigate if it is</span></div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  <span class="comment">// faster without the vector<bool>.</span></div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// TODO(user): An alternative algorithm is to remove all these nodes from</span></div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="comment">// the queue instead of simply marking them. This should also lead to a</span></div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// better "relaxation" order of the arcs. It is however a bit more work to</span></div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="comment">// remove them since we need to track their position.</span></div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">if</span> (bf_can_be_skipped_[node]) {</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  DCHECK_NE(bf_parent_arc_of_[node], -1);</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  DCHECK(!arcs_[bf_parent_arc_of_[node]].is_marked);</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  }</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>  <span class="keyword">const</span> IntegerValue tail_lb =</div>
|
|
<div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(IntegerVariable(node));</div>
|
|
<div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : impacted_arcs_[IntegerVariable(node)]) {</div>
|
|
<div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  DCHECK_EQ(arc.tail_var, node);</div>
|
|
<div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keyword">const</span> IntegerValue candidate = tail_lb + ArcOffset(arc);</div>
|
|
<div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keywordflow">if</span> (candidate > integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.head_var)) {</div>
|
|
<div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a309d057e12c8d4d393f13975eea2e2a9">IsCurrentlyIgnored</a>(arc.head_var)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  <span class="keywordflow">if</span> (!EnqueueAndCheck(arc, candidate, trail)) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  </div>
|
|
<div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="comment">// This is the Tarjan contribution to Bellman-Ford. This code detect</span></div>
|
|
<div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  <span class="comment">// positive cycle, and because it disassemble the subtree while doing</span></div>
|
|
<div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="comment">// so, the cost is amortized during the algorithm execution. Another</span></div>
|
|
<div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="comment">// advantages is that it will mark the node explored here as skippable</span></div>
|
|
<div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="comment">// which will avoid to propagate them too early (knowing that they will</span></div>
|
|
<div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="comment">// need to be propagated again later).</span></div>
|
|
<div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">if</span> (DisassembleSubtree(arc.head_var.value(), arc.tail_var.value(),</div>
|
|
<div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  &bf_can_be_skipped_)) {</div>
|
|
<div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  std::vector<Literal> must_be_all_true;</div>
|
|
<div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  AnalyzePositiveCycle(arc_index, trail, &must_be_all_true,</div>
|
|
<div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  &literal_reason_, &integer_reason_);</div>
|
|
<div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="keywordflow">if</span> (must_be_all_true.empty()) {</div>
|
|
<div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(literal_reason_,</div>
|
|
<div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  integer_reason_);</div>
|
|
<div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <a class="code" href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a>(&must_be_all_true);</div>
|
|
<div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : must_be_all_true) {</div>
|
|
<div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1Trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1VariablesAssignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(l)) {</div>
|
|
<div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  literal_reason_.push_back(l);</div>
|
|
<div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="keywordflow">return</span> integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">ReportConflict</a>(literal_reason_,</div>
|
|
<div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  integer_reason_);</div>
|
|
<div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  }</div>
|
|
<div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  }</div>
|
|
<div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : must_be_all_true) {</div>
|
|
<div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keywordflow">if</span> (trail_-><a class="code" href="classoperations__research_1_1sat_1_1Trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1VariablesAssignment.html#a5300129913f51dcb0b1c531e3248490e">LiteralIsTrue</a>(l)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#a79322fd8dff49ab2eab22c0570aba594">EnqueueLiteral</a>(l, literal_reason_,</div>
|
|
<div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  integer_reason_);</div>
|
|
<div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  }</div>
|
|
<div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  </div>
|
|
<div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">// We just marked some optional variable as ignored, no need</span></div>
|
|
<div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="comment">// to update bf_parent_arc_of_[].</span></div>
|
|
<div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">continue</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>  }</div>
|
|
<div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  </div>
|
|
<div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="comment">// We need to enforce the invariant that only the arc_index in</span></div>
|
|
<div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// bf_parent_arc_of_[] are marked (but not necessarily all of them</span></div>
|
|
<div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// since we unmark some in DisassembleSubtree()).</span></div>
|
|
<div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="keywordflow">if</span> (bf_parent_arc_of_[arc.head_var.value()] != -1) {</div>
|
|
<div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  arcs_[bf_parent_arc_of_[arc.head_var.value()]].is_marked = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  }</div>
|
|
<div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  </div>
|
|
<div class="line"><a name="l00698"></a><span class="lineno"> 698</span>  <span class="comment">// Tricky: We just enqueued the fact that the lower-bound of head is</span></div>
|
|
<div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="comment">// candidate. However, because the domain of head may be discrete, it is</span></div>
|
|
<div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="comment">// possible that the lower-bound of head is now higher than candidate!</span></div>
|
|
<div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="comment">// If this is the case, we don't update bf_parent_arc_of_[] so that we</span></div>
|
|
<div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="comment">// don't wrongly detect a positive weight cycle because of this "extra</span></div>
|
|
<div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="comment">// push".</span></div>
|
|
<div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keywordflow">if</span> (integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(arc.head_var) == candidate) {</div>
|
|
<div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  bf_parent_arc_of_[arc.head_var.value()] = arc_index;</div>
|
|
<div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  arcs_[arc_index].is_marked = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="comment">// We still unmark any previous dependency, since we have pushed the</span></div>
|
|
<div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">// value of arc.head_var further.</span></div>
|
|
<div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  bf_parent_arc_of_[arc.head_var.value()] = -1;</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>  </div>
|
|
<div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  bf_can_be_skipped_[arc.head_var.value()] = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">if</span> (!bf_in_queue_[arc.head_var.value()]) {</div>
|
|
<div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  bf_queue_.push_back(arc.head_var.value());</div>
|
|
<div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  bf_in_queue_[arc.head_var.value()] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  }</div>
|
|
<div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  }</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>  }</div>
|
|
<div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00722"></a><span class="lineno"> 722</span> }</div>
|
|
<div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  </div>
|
|
<div class="line"><a name="l00724"></a><span class="lineno"> 724</span> <span class="keywordtype">int</span> PrecedencesPropagator::AddGreaterThanAtLeastOneOfConstraintsFromClause(</div>
|
|
<div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="keyword">const</span> absl::Span<const Literal> clause, Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  CHECK_EQ(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<Trail>()->CurrentDecisionLevel(), 0);</div>
|
|
<div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="keywordflow">if</span> (clause.size() < 2) <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  </div>
|
|
<div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="comment">// Collect all arcs impacted by this clause.</span></div>
|
|
<div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  std::vector<ArcInfo> infos;</div>
|
|
<div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : clause) {</div>
|
|
<div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  <span class="keywordflow">if</span> (l.Index() >= literal_to_new_impacted_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : literal_to_new_impacted_arcs_[l.Index()]) {</div>
|
|
<div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  <span class="keywordflow">if</span> (arc.presence_literals.size() != 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  </div>
|
|
<div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  <span class="comment">// TODO(user): Support variable offset.</span></div>
|
|
<div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  <span class="keywordflow">if</span> (arc.offset_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  infos.push_back(arc);</div>
|
|
<div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  }</div>
|
|
<div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  }</div>
|
|
<div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="keywordflow">if</span> (infos.size() <= 1) <span class="keywordflow">return</span> 0;</div>
|
|
<div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  </div>
|
|
<div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="comment">// Stable sort by head_var so that for a same head_var, the entry are sorted</span></div>
|
|
<div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="comment">// by Literal as they appear in clause.</span></div>
|
|
<div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  std::stable_sort(infos.begin(), infos.end(),</div>
|
|
<div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  [](<span class="keyword">const</span> ArcInfo& <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, <span class="keyword">const</span> ArcInfo& <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) {</div>
|
|
<div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  return a.head_var < b.head_var;</div>
|
|
<div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  });</div>
|
|
<div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  </div>
|
|
<div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  <span class="comment">// We process ArcInfo with the same head_var toghether.</span></div>
|
|
<div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordtype">int</span> num_added_constraints = 0;</div>
|
|
<div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="keyword">auto</span>* solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatSolver>();</div>
|
|
<div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < infos.size();) {</div>
|
|
<div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> start = i;</div>
|
|
<div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  <span class="keyword">const</span> IntegerVariable head_var = infos[start].head_var;</div>
|
|
<div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="keywordflow">for</span> (i++; i < infos.size() && infos[i].head_var == head_var; ++i) {</div>
|
|
<div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  }</div>
|
|
<div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keyword">const</span> absl::Span<ArcInfo> arcs(&infos[start], i - start);</div>
|
|
<div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  </div>
|
|
<div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="comment">// Skip single arcs since it will already be fully propagated.</span></div>
|
|
<div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  <span class="keywordflow">if</span> (arcs.size() < 2) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  </div>
|
|
<div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">// Heuristic. Look for full or almost full clauses. We could add</span></div>
|
|
<div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="comment">// GreaterThanAtLeastOneOf() with more enforcement literals. TODO(user):</span></div>
|
|
<div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// experiments.</span></div>
|
|
<div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="keywordflow">if</span> (arcs.size() + 1 < clause.size()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  </div>
|
|
<div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  std::vector<IntegerVariable> vars;</div>
|
|
<div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  std::vector<IntegerValue> offsets;</div>
|
|
<div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  std::vector<Literal> selectors;</div>
|
|
<div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  std::vector<Literal> enforcements;</div>
|
|
<div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  </div>
|
|
<div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="keywordtype">int</span> j = 0;</div>
|
|
<div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> Literal l : clause) {</div>
|
|
<div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordtype">bool</span> added = <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keywordflow">for</span> (; j < arcs.size() && l == arcs[j].presence_literals.front(); ++j) {</div>
|
|
<div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  added = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  vars.push_back(arcs[j].tail_var);</div>
|
|
<div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  offsets.push_back(arcs[j].offset);</div>
|
|
<div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  </div>
|
|
<div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="comment">// Note that duplicate selector are supported.</span></div>
|
|
<div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="comment">// TODO(user): If we support variable offset, we should regroup the arcs</span></div>
|
|
<div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="comment">// into one (tail + offset <= head) though, instead of having too</span></div>
|
|
<div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="comment">// identical entries.</span></div>
|
|
<div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  selectors.push_back(l);</div>
|
|
<div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  }</div>
|
|
<div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="keywordflow">if</span> (!added) {</div>
|
|
<div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  enforcements.push_back(l.Negated());</div>
|
|
<div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  }</div>
|
|
<div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  }</div>
|
|
<div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  </div>
|
|
<div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="comment">// No point adding a constraint if there is not at least two different</span></div>
|
|
<div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="comment">// literals in selectors.</span></div>
|
|
<div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="keywordflow">if</span> (enforcements.size() + 1 == clause.size()) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  </div>
|
|
<div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  ++num_added_constraints;</div>
|
|
<div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a216ffbba6c851b6f83f4d58bb53ff880">GreaterThanAtLeastOneOf</a>(head_var, vars, offsets, selectors,</div>
|
|
<div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  enforcements));</div>
|
|
<div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keywordflow">if</span> (!solver->FinishPropagation()) <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  }</div>
|
|
<div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00804"></a><span class="lineno"> 804</span> }</div>
|
|
<div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  </div>
|
|
<div class="line"><a name="l00806"></a><span class="lineno"> 806</span> <span class="keywordtype">int</span> PrecedencesPropagator::</div>
|
|
<div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  AddGreaterThanAtLeastOneOfConstraintsWithClauseAutoDetection(Model* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keyword">auto</span>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a> = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<TimeLimit>();</div>
|
|
<div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keyword">auto</span>* solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<SatSolver>();</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>  <span class="comment">// Fill the set of incoming conditional arcs for each variables.</span></div>
|
|
<div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <a class="code" href="classgtl_1_1ITIVector.html">gtl::ITIVector<IntegerVariable, std::vector<ArcIndex></a>> incoming_arcs_;</div>
|
|
<div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keywordflow">for</span> (<a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index(0); arc_index < arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>(); ++arc_index) {</div>
|
|
<div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keyword">const</span> ArcInfo& arc = arcs_[arc_index];</div>
|
|
<div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  </div>
|
|
<div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="comment">// Only keep arc that have a fixed offset and a single presence_literals.</span></div>
|
|
<div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keywordflow">if</span> (arc.offset_var != <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keywordflow">if</span> (arc.tail_var == arc.head_var) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="keywordflow">if</span> (arc.presence_literals.size() != 1) <span class="keywordflow">continue</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>  <span class="keywordflow">if</span> (arc.head_var >= incoming_arcs_.size()) {</div>
|
|
<div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  incoming_arcs_.<a class="code" href="classgtl_1_1ITIVector.html#a4e3670a285a3642eaa07f66766cffa72">resize</a>(arc.head_var.value() + 1);</div>
|
|
<div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  }</div>
|
|
<div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  incoming_arcs_[arc.head_var].push_back(arc_index);</div>
|
|
<div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  }</div>
|
|
<div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  </div>
|
|
<div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keywordtype">int</span> num_added_constraints = 0;</div>
|
|
<div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keywordflow">for</span> (IntegerVariable target(0); target < incoming_arcs_.size(); ++target) {</div>
|
|
<div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  <span class="keywordflow">if</span> (incoming_arcs_[target].size() <= 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->LimitReached()) <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  </div>
|
|
<div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="comment">// Detect set of incoming arcs for which at least one must be present.</span></div>
|
|
<div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="comment">// TODO(user): Find more than one disjoint set of incoming arcs.</span></div>
|
|
<div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="comment">// TODO(user): call MinimizeCoreWithPropagation() on the clause.</span></div>
|
|
<div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  solver->Backtrack(0);</div>
|
|
<div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  <span class="keywordflow">if</span> (solver->IsModelUnsat()) <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  std::vector<Literal> clause;</div>
|
|
<div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : incoming_arcs_[target]) {</div>
|
|
<div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a> = arcs_[arc_index].presence_literals.<a class="code" href="classgtl_1_1ITIVector.html#a6a48363b4355f6f5b441637774f79a59">front</a>();</div>
|
|
<div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="keywordflow">if</span> (solver->Assignment().LiteralIsFalse(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>)) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  </div>
|
|
<div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_level = solver->CurrentDecisionLevel();</div>
|
|
<div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  solver->EnqueueDecisionAndBacktrackOnConflict(<a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated());</div>
|
|
<div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">if</span> (solver->IsModelUnsat()) <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> new_level = solver->CurrentDecisionLevel();</div>
|
|
<div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  <span class="keywordflow">if</span> (new_level <= old_level) {</div>
|
|
<div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  clause = solver->GetLastIncompatibleDecisions();</div>
|
|
<div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  }</div>
|
|
<div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  }</div>
|
|
<div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  solver->Backtrack(0);</div>
|
|
<div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  </div>
|
|
<div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  <span class="keywordflow">if</span> (clause.size() > 1) {</div>
|
|
<div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  <span class="comment">// Extract the set of arc for which at least one must be present.</span></div>
|
|
<div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="keyword">const</span> std::set<Literal> clause_set(clause.begin(), clause.end());</div>
|
|
<div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  std::vector<ArcIndex> arcs_in_clause;</div>
|
|
<div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> arc_index : incoming_arcs_[target]) {</div>
|
|
<div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keyword">const</span> Literal <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(arcs_[arc_index].presence_literals.front());</div>
|
|
<div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="keywordflow">if</span> (<a class="code" href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a>(clause_set, <a class="code" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>.Negated())) {</div>
|
|
<div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  arcs_in_clause.push_back(arc_index);</div>
|
|
<div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  }</div>
|
|
<div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  }</div>
|
|
<div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  </div>
|
|
<div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  VLOG(2) << arcs_in_clause.size() << <span class="stringliteral">"/"</span> << incoming_arcs_[target].size();</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>  ++num_added_constraints;</div>
|
|
<div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  std::vector<IntegerVariable> vars;</div>
|
|
<div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  std::vector<IntegerValue> offsets;</div>
|
|
<div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  std::vector<Literal> selectors;</div>
|
|
<div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">ArcIndex</a> <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a> : arcs_in_clause) {</div>
|
|
<div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  vars.push_back(arcs_[<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>].tail_var);</div>
|
|
<div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  offsets.push_back(arcs_[<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>].offset);</div>
|
|
<div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  selectors.push_back(Literal(arcs_[<a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>].presence_literals.front()));</div>
|
|
<div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  }</div>
|
|
<div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a216ffbba6c851b6f83f4d58bb53ff880">GreaterThanAtLeastOneOf</a>(target, vars, offsets, selectors));</div>
|
|
<div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="keywordflow">if</span> (!solver->FinishPropagation()) <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  }</div>
|
|
<div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  }</div>
|
|
<div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  </div>
|
|
<div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  <span class="keywordflow">return</span> num_added_constraints;</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>  </div>
|
|
<div class="line"><a name="l00883"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ab802de47d15374aab8e3721d5fc508e5"> 883</a></span> <span class="keywordtype">int</span> <a class="code" href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ab802de47d15374aab8e3721d5fc508e5">PrecedencesPropagator::AddGreaterThanAtLeastOneOfConstraints</a>(<a class="code" href="classoperations__research_1_1sat_1_1Model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  VLOG(1) << <span class="stringliteral">"Detecting GreaterThanAtLeastOneOf() constraints..."</span>;</div>
|
|
<div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="keyword">auto</span>* <a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a> = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1TimeLimit.html">TimeLimit</a>>();</div>
|
|
<div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="keyword">auto</span>* solver = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1SatSolver.html">SatSolver</a>>();</div>
|
|
<div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="keyword">auto</span>* clauses = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1LiteralWatchers.html">LiteralWatchers</a>>();</div>
|
|
<div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="keywordtype">int</span> num_added_constraints = 0;</div>
|
|
<div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  </div>
|
|
<div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="comment">// We have two possible approaches. For now, we prefer the first one except if</span></div>
|
|
<div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="comment">// there is too many clauses in the problem.</span></div>
|
|
<div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  <span class="comment">// TODO(user): Do more extensive experiment. Remove the second approach as</span></div>
|
|
<div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="comment">// it is more time consuming? or identify when it make sense. Note that the</span></div>
|
|
<div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="comment">// first approach also allows to use "incomplete" at least one between arcs.</span></div>
|
|
<div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">if</span> (clauses->AllClausesInCreationOrder().size() < 1e6) {</div>
|
|
<div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="comment">// TODO(user): This does not take into account clause of size 2 since they</span></div>
|
|
<div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="comment">// are stored in the BinaryImplicationGraph instead. Some ideas specific</span></div>
|
|
<div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  <span class="comment">// to size 2:</span></div>
|
|
<div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  <span class="comment">// - There can be a lot of such clauses, but it might be nice to consider</span></div>
|
|
<div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="comment">// them. we need to experiments.</span></div>
|
|
<div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="comment">// - The automatic clause detection might be a better approach and it</span></div>
|
|
<div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="comment">// could be combined with probing.</span></div>
|
|
<div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="classoperations__research_1_1sat_1_1SatClause.html">SatClause</a>* clause : clauses->AllClausesInCreationOrder()) {</div>
|
|
<div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="keywordflow">if</span> (<a class="code" href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a>->LimitReached()) <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="keywordflow">if</span> (solver->IsModelUnsat()) <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  num_added_constraints += AddGreaterThanAtLeastOneOfConstraintsFromClause(</div>
|
|
<div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  clause->AsSpan(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  }</div>
|
|
<div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  num_added_constraints +=</div>
|
|
<div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  AddGreaterThanAtLeastOneOfConstraintsWithClauseAutoDetection(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>);</div>
|
|
<div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  }</div>
|
|
<div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  </div>
|
|
<div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  VLOG(1) << <span class="stringliteral">"Added "</span> << num_added_constraints</div>
|
|
<div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  << <span class="stringliteral">" GreaterThanAtLeastOneOf() constraints."</span>;</div>
|
|
<div class="line"><a name="l00917"></a><span class="lineno"> 917</span>  <span class="keywordflow">return</span> num_added_constraints;</div>
|
|
<div class="line"><a name="l00918"></a><span class="lineno"> 918</span> }</div>
|
|
<div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  </div>
|
|
<div class="line"><a name="l00920"></a><span class="lineno"> 920</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00921"></a><span class="lineno"> 921</span> } <span class="comment">// namespace operations_research</span></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1Trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1Trail.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_1LiteralWatchers_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1LiteralWatchers.html">operations_research::sat::LiteralWatchers</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00159">clause.h:159</a></div></div>
|
|
<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="aclassoperations__research_1_1sat_1_1VariablesAssignment_html_a5300129913f51dcb0b1c531e3248490e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1VariablesAssignment.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="arouting__flow_8cc_html_a10b672faee4b99c6a02feb0e343f3b0f"><div class="ttname"><a href="routing__flow_8cc.html#a10b672faee4b99c6a02feb0e343f3b0f">tail</a></div><div class="ttdeci">int64 tail</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00127">routing_flow.cc:127</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1000a311929a470e5485258d765eeabd"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1000a311929a470e5485258d765eeabd">operations_research::sat::LowerBound</a></div><div class="ttdeci">std::function< int64(const Model &)> LowerBound(IntegerVariable v)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01376">integer.h:1376</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SparseBitset_html_ae09e38958e558d2c776bc555a0dc2fc7"><div class="ttname"><a href="classoperations__research_1_1SparseBitset.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="astructoperations__research_1_1sat_1_1IntegerLiteral_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1IntegerLiteral.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01197">integer.h:1197</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a5bd8c44473618b7eafd33ba978db2f06"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">operations_research::sat::kNoIntegerVariable</a></div><div class="ttdeci">const IntegerVariable kNoIntegerVariable(-1)</div></div>
|
|
<div class="ttc" id="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="aclassoperations__research_1_1sat_1_1IntegerTrail_html_ac8db20a5dab063aa3ca64a4ae1202d4c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac8db20a5dab063aa3ca64a4ae1202d4c">operations_research::sat::IntegerTrail::IsIgnoredLiteral</a></div><div class="ttdeci">Literal IsIgnoredLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00617">integer.h:617</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1IntegerTrail_html_acc1aaae243ed4381e84f8309aacb3bbc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#acc1aaae243ed4381e84f8309aacb3bbc">operations_research::sat::IntegerTrail::IsOptional</a></div><div class="ttdeci">bool IsOptional(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00609">integer.h:609</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1PrecedencesPropagator_1_1IntegerPrecedences_html"><div class="ttname"><a href="structoperations__research_1_1sat_1_1PrecedencesPropagator_1_1IntegerPrecedences.html">operations_research::sat::PrecedencesPropagator::IntegerPrecedences</a></div><div class="ttdef"><b>Definition:</b> <a href="precedences_8h_source.html#l00111">precedences.h:111</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SparseBitset_html_a41f798a04019147982b29c576ff9d8b7"><div class="ttname"><a href="classoperations__research_1_1SparseBitset.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_1IntegerTrail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01221">integer.h:1221</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1ITIVector_html_a6a48363b4355f6f5b441637774f79a59"><div class="ttname"><a href="classgtl_1_1ITIVector.html#a6a48363b4355f6f5b441637774f79a59">gtl::ITIVector::front</a></div><div class="ttdeci">reference front()</div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00171">int_type_indexed_vector.h:171</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</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="aclassgtl_1_1ITIVector_html_a4e3670a285a3642eaa07f66766cffa72"><div class="ttname"><a href="classgtl_1_1ITIVector.html#a4e3670a285a3642eaa07f66766cffa72">gtl::ITIVector::resize</a></div><div class="ttdeci">void resize(size_type new_size)</div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00149">int_type_indexed_vector.h:149</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_1Trail_html_a8ef12397d1682615bc3108c397734179"><div class="ttname"><a href="classoperations__research_1_1sat_1_1Trail.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="acleanup_8h_html"><div class="ttname"><a href="cleanup_8h.html">cleanup.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_aae43e784db06c0974ce59ebbe8dd2b22"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">operations_research::sat::NegationOf</a></div><div class="ttdeci">std::vector< IntegerVariable > NegationOf(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00042">integer.cc:42</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1PrecedencesPropagator_html_ae20e3965a974e3a5fe816c033a94e568"><div class="ttname"><a href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ae20e3965a974e3a5fe816c033a94e568">operations_research::sat::PrecedencesPropagator::Untrail</a></div><div class="ttdeci">void Untrail(const Trail &trail, int trail_index) final</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00103">precedences.cc:103</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1IntegerTrail_html_a05e837bb93eeabbbd94e8f690dd59d32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#a05e837bb93eeabbbd94e8f690dd59d32">operations_research::sat::IntegerTrail::Enqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool Enqueue(IntegerLiteral i_lit, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00965">integer.cc:965</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1IntegerTrail_html_a309d057e12c8d4d393f13975eea2e2a9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#a309d057e12c8d4d393f13975eea2e2a9">operations_research::sat::IntegerTrail::IsCurrentlyIgnored</a></div><div class="ttdeci">bool IsCurrentlyIgnored(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00612">integer.h:612</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1PrecedencesPropagator_html_af3c64e10aa2bb2cc1d3615d800f7c71c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#af3c64e10aa2bb2cc1d3615d800f7c71c">operations_research::sat::PrecedencesPropagator::PropagateOutgoingArcs</a></div><div class="ttdeci">bool PropagateOutgoingArcs(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00090">precedences.cc:90</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1PrecedencesPropagator_html_ab802de47d15374aab8e3721d5fc508e5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ab802de47d15374aab8e3721d5fc508e5">operations_research::sat::PrecedencesPropagator::AddGreaterThanAtLeastOneOfConstraints</a></div><div class="ttdeci">int AddGreaterThanAtLeastOneOfConstraints(Model *model)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00883">precedences.cc:883</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1ITIVector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classgtl_1_1ITIVector.html#a60304b65bf89363bcc3165d3cde67f86">gtl::ITIVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00146">int_type_indexed_vector.h:146</a></div></div>
|
|
<div class="ttc" id="anamespaceabsl_html_a9bfb260a67150f0bc1da17aac9199866"><div class="ttname"><a href="namespaceabsl.html#a9bfb260a67150f0bc1da17aac9199866">absl::MakeCleanup</a></div><div class="ttdeci">absl::Cleanup< absl::decay_t< Callback > > MakeCleanup(Callback &&callback)</div><div class="ttdef"><b>Definition:</b> <a href="cleanup_8h_source.html#l00120">cleanup.h:120</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1Model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1Model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="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_1SatSolver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1SatSolver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00058">sat_solver.h:58</a></div></div>
|
|
<div class="ttc" id="aclause_8h_html"><div class="ttname"><a href="clause_8h.html">clause.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1Trail_html_ad63c4461a1384629cb99413c6df8b9ca"><div class="ttname"><a href="classoperations__research_1_1sat_1_1Trail.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_1Literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1Literal.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="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_1Literal_html_a886e9c024f7209181c0a850b6e90c644"><div class="ttname"><a href="classoperations__research_1_1sat_1_1Literal.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_1SatClause_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1SatClause.html">operations_research::sat::SatClause</a></div><div class="ttdef"><b>Definition:</b> <a href="clause_8h_source.html#l00050">clause.h:50</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_ac3cf9db02b23ea1455b5ae6955d03e47"><div class="ttname"><a href="cp__model__solver_8cc.html#ac3cf9db02b23ea1455b5ae6955d03e47">time_limit</a></div><div class="ttdeci">SharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02025">cp_model_solver.cc:2025</a></div></div>
|
|
<div class="ttc" id="aprecedences_8h_html"><div class="ttname"><a href="precedences_8h.html">precedences.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1TimeLimit_html"><div class="ttname"><a href="classoperations__research_1_1TimeLimit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00105">time_limit.h:105</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1SatPropagator_html_a06e2c6f3432a89d0160b831d48afd8b7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1SatPropagator.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#l00506">sat_base.h:506</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_a288a1dc92da5d3ad62d4bc4cec9e8b1d"><div class="ttname"><a href="namespacegtl.html#a288a1dc92da5d3ad62d4bc4cec9e8b1d">gtl::STLSortAndRemoveDuplicates</a></div><div class="ttdeci">void STLSortAndRemoveDuplicates(T *v, const LessFunc &less_func)</div><div class="ttdef"><b>Definition:</b> <a href="stl__util_8h_source.html#l00058">stl_util.h:58</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1ITIVector_html_a058bda4957df6a97b1ea6c9fd783f672"><div class="ttname"><a href="classgtl_1_1ITIVector.html#a058bda4957df6a97b1ea6c9fd783f672">gtl::ITIVector::pop_back</a></div><div class="ttdeci">void pop_back()</div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00167">int_type_indexed_vector.h:167</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1IntegerTrail_html_aa981297d0a648cd5c3fef40e2edebf8a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#aa981297d0a648cd5c3fef40e2edebf8a">operations_research::sat::IntegerTrail::RelaxLinearReason</a></div><div class="ttdeci">void RelaxLinearReason(IntegerValue slack, absl::Span< const IntegerValue > coeffs, std::vector< IntegerLiteral > *reason) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00773">integer.cc:773</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1IntegerTrail_html_ac0a2e8c6619af74b42472bfa9a9e6465"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#ac0a2e8c6619af74b42472bfa9a9e6465">operations_research::sat::IntegerTrail::UpperBoundAsLiteral</a></div><div class="ttdeci">IntegerLiteral UpperBoundAsLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01252">integer.h:1252</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1Trail_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1Trail.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="aclassoperations__research_1_1sat_1_1IntegerTrail_html_af88a18429909498405c450015f0a223a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#af88a18429909498405c450015f0a223a">operations_research::sat::IntegerTrail::NumIntegerVariables</a></div><div class="ttdeci">IntegerVariable NumIntegerVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00558">integer.h:558</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1SparseBitset_html_a1e5ae9fb14fd6b25919148ae8bbaf050"><div class="ttname"><a href="classoperations__research_1_1SparseBitset.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_1IntegerTrail_html_a6d55b5b9adc499095dd57dd0c2b6c7df"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#a6d55b5b9adc499095dd57dd0c2b6c7df">operations_research::sat::IntegerTrail::ReportConflict</a></div><div class="ttdeci">bool ReportConflict(absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00784">integer.h:784</a></div></div>
|
|
<div class="ttc" id="acp__constraints_8h_html"><div class="ttname"><a href="cp__constraints_8h.html">cp_constraints.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1IntegerTrail_html_a615d87982145007855f2102262cf773c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#a615d87982145007855f2102262cf773c">operations_research::sat::IntegerTrail::LowerBoundAsLiteral</a></div><div class="ttdeci">IntegerLiteral LowerBoundAsLiteral(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01247">integer.h:1247</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html_ad90a9fc7d16bb2c98a088a4162bbbc9d"><div class="ttname"><a href="namespaceoperations__research.html#ad90a9fc7d16bb2c98a088a4162bbbc9d">operations_research::ArcIndex</a></div><div class="ttdeci">int32 ArcIndex</div><div class="ttdef"><b>Definition:</b> <a href="ebert__graph_8h_source.html#l00201">ebert_graph.h:201</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1PrecedencesPropagator_html_a09ebe3a2f1825d6366649cd157e5020f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#a09ebe3a2f1825d6366649cd157e5020f">operations_research::sat::PrecedencesPropagator::AddPrecedenceReason</a></div><div class="ttdeci">void AddPrecedenceReason(int arc_index, IntegerValue min_offset, std::vector< Literal > *literal_reason, std::vector< IntegerLiteral > *integer_reason) const</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00204">precedences.cc:204</a></div></div>
|
|
<div class="ttc" id="agurobi__interface_8cc_html_a0728f23c9a47655d38e0bf1a2f200bcf"><div class="ttname"><a href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a></div><div class="ttdeci">GRBmodel * model</div><div class="ttdef"><b>Definition:</b> <a href="gurobi__interface_8cc_source.html#l00195">gurobi_interface.cc:195</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1IntegerTrail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01217">integer.h:1217</a></div></div>
|
|
<div class="ttc" id="astl__util_8h_html"><div class="ttname"><a href="stl__util_8h.html">stl_util.h</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1VariablesAssignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1VariablesAssignment.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_1IntegerTrail_html_a79322fd8dff49ab2eab22c0570aba594"><div class="ttname"><a href="classoperations__research_1_1sat_1_1IntegerTrail.html#a79322fd8dff49ab2eab22c0570aba594">operations_research::sat::IntegerTrail::EnqueueLiteral</a></div><div class="ttdeci">void EnqueueLiteral(Literal literal, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01034">integer.cc:1034</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="aclassoperations__research_1_1sat_1_1PrecedencesPropagator_html_a880ad5f7514aee33f81302d8af2a7be2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#a880ad5f7514aee33f81302d8af2a7be2">operations_research::sat::PrecedencesPropagator::ComputePrecedences</a></div><div class="ttdeci">void ComputePrecedences(const std::vector< IntegerVariable > &vars, std::vector< IntegerPrecedences > *output)</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00127">precedences.cc:127</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1ITIVector_html"><div class="ttname"><a href="classgtl_1_1ITIVector.html">gtl::ITIVector</a></div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00076">int_type_indexed_vector.h:76</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1glop_html_abec9e934a51aa2ab519684cc0f446a41"><div class="ttname"><a href="namespaceoperations__research_1_1glop.html#abec9e934a51aa2ab519684cc0f446a41">operations_research::glop::Index</a></div><div class="ttdeci">int32 Index</div><div class="ttdef"><b>Definition:</b> <a href="lp__types_8h_source.html#l00037">lp_types.h:37</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1ITIVector_html_a9263000d449fdccb6cb70b303063e60b"><div class="ttname"><a href="classgtl_1_1ITIVector.html#a9263000d449fdccb6cb70b303063e60b">gtl::ITIVector::push_back</a></div><div class="ttdeci">void push_back(const value_type &x)</div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00157">int_type_indexed_vector.h:157</a></div></div>
|
|
<div class="ttc" id="arouting__flow_8cc_html_ac891d9f514e55ec8ee1212757a147888"><div class="ttname"><a href="routing__flow_8cc.html#ac891d9f514e55ec8ee1212757a147888">head</a></div><div class="ttdeci">int64 head</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00128">routing_flow.cc:128</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_1GenericLiteralWatcher_html_aaede7c755aad90772efda6db087f3413"><div class="ttname"><a href="classoperations__research_1_1sat_1_1GenericLiteralWatcher.html#aaede7c755aad90772efda6db087f3413">operations_research::sat::GenericLiteralWatcher::WatchLowerBound</a></div><div class="ttdeci">void WatchLowerBound(IntegerVariable var, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01285">integer.h:1285</a></div></div>
|
|
<div class="ttc" id="aclassgtl_1_1ITIVector_html_af71e6c1eccbc12e9339c00a86a981a43"><div class="ttname"><a href="classgtl_1_1ITIVector.html#af71e6c1eccbc12e9339c00a86a981a43">gtl::ITIVector::back</a></div><div class="ttdeci">reference back()</div><div class="ttdef"><b>Definition:</b> <a href="int__type__indexed__vector_8h_source.html#l00173">int_type_indexed_vector.h:173</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a216ffbba6c851b6f83f4d58bb53ff880"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a216ffbba6c851b6f83f4d58bb53ff880">operations_research::sat::GreaterThanAtLeastOneOf</a></div><div class="ttdeci">std::function< void(Model *)> GreaterThanAtLeastOneOf(IntegerVariable target_var, const absl::Span< const IntegerVariable > vars, const absl::Span< const IntegerValue > offsets, const absl::Span< const Literal > selectors)</div><div class="ttdef"><b>Definition:</b> <a href="cp__constraints_8h_source.html#l00123">cp_constraints.h:123</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1PrecedencesPropagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1PrecedencesPropagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::PrecedencesPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="precedences_8cc_source.html#l00042">precedences.cc:42</a></div></div>
|
|
<div class="ttc" id="anamespacegtl_html_aae28e97bd1fa93cb0032642550da7455"><div class="ttname"><a href="namespacegtl.html#aae28e97bd1fa93cb0032642550da7455">gtl::ContainsKey</a></div><div class="ttdeci">bool ContainsKey(const Collection &collection, const Key &key)</div><div class="ttdef"><b>Definition:</b> <a href="map__util_8h_source.html#l00170">map_util.h:170</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="precedences_8cc.html">precedences.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.18 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|