827 lines
144 KiB
HTML
827 lines
144 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.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: all_different.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.2</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.1 -->
|
|
<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','.html');
|
|
/* @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('all__different_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">all_different.cc</div> </div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="all__different_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="all__different_8h.html">ortools/sat/all_different.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 <map></span></div>
|
|
<div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a name="l00019"></a><span class="lineno"> 19</span>  </div>
|
|
<div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#include "absl/container/flat_hash_set.h"</span></div>
|
|
<div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include "<a class="code" href="int__type_8h.html">ortools/base/int_type.h</a>"</span></div>
|
|
<div class="line"><a name="l00022"></a><span class="lineno"> 22</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="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include "<a class="code" href="map__util_8h.html">ortools/base/map_util.h</a>"</span></div>
|
|
<div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include "<a class="code" href="strongly__connected__components_8h.html">ortools/graph/strongly_connected_components.h</a>"</span></div>
|
|
<div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="sort_8h.html">ortools/util/sort.h</a>"</span></div>
|
|
<div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  </div>
|
|
<div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  </div>
|
|
<div class="line"><a name="l00031"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a9d6526e2b6f684e7c3c80172b598b7cb"> 31</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a9d6526e2b6f684e7c3c80172b598b7cb">AllDifferentBinary</a>(</div>
|
|
<div class="line"><a name="l00032"></a><span class="lineno"> 32</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars) {</div>
|
|
<div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00034"></a><span class="lineno"> 34</span>  <span class="comment">// Fully encode all the given variables and construct a mapping value -></span></div>
|
|
<div class="line"><a name="l00035"></a><span class="lineno"> 35</span>  <span class="comment">// List of literal each indicating that a given variable takes this value.</span></div>
|
|
<div class="line"><a name="l00036"></a><span class="lineno"> 36</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00037"></a><span class="lineno"> 37</span>  <span class="comment">// Note that we use a map to always add the constraints in the same order.</span></div>
|
|
<div class="line"><a name="l00038"></a><span class="lineno"> 38</span>  std::map<IntegerValue, std::vector<Literal>> value_to_literals;</div>
|
|
<div class="line"><a name="l00039"></a><span class="lineno"> 39</span>  <a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder = <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>();</div>
|
|
<div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> : vars) {</div>
|
|
<div class="line"><a name="l00041"></a><span class="lineno"> 41</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a4ae75bf9ab807bf21ce2caebb7321be0">FullyEncodeVariable</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00042"></a><span class="lineno"> 42</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& entry : encoder-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#aa0a8be7c97692d0b4fdb2f13ba303f36">FullDomainEncoding</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>)) {</div>
|
|
<div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  value_to_literals[entry.value].push_back(entry.literal);</div>
|
|
<div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  }</div>
|
|
<div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  }</div>
|
|
<div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  </div>
|
|
<div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// Add an at most one constraint for each value.</span></div>
|
|
<div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& entry : value_to_literals) {</div>
|
|
<div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="keywordflow">if</span> (entry.second.size() > 1) {</div>
|
|
<div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#ab8221efb0cc3dd5059674845b4db7fed">AtMostOneConstraint</a>(entry.second));</div>
|
|
<div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  }</div>
|
|
<div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  }</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">// If the number of values is equal to the number of variables, we have</span></div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// a permutation. We can add a bool_or for each literals attached to a</span></div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// value.</span></div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">if</span> (value_to_literals.size() == vars.size()) {</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& entry : value_to_literals) {</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->Add(<a class="code" href="namespaceoperations__research_1_1sat.html#a1655a9b9673e7c4de940ca6e5e3cf936">ClauseConstraint</a>(entry.second));</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  }</div>
|
|
<div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  }</div>
|
|
<div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  };</div>
|
|
<div class="line"><a name="l00063"></a><span class="lineno"> 63</span> }</div>
|
|
<div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  </div>
|
|
<div class="line"><a name="l00065"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a467d0c8bf263413aae5e5e530d4c5259"> 65</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a467d0c8bf263413aae5e5e530d4c5259">AllDifferentOnBounds</a>(</div>
|
|
<div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars) {</div>
|
|
<div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  <span class="keywordflow">if</span> (vars.empty()) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">auto</span>* constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html">AllDifferentBoundsPropagator</a>(</div>
|
|
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  vars, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>());</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  constraint->RegisterWith(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  };</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span> }</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  </div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"><a class="line" href="namespaceoperations__research_1_1sat.html#a0f570bf53aae0cd9303912d273425428"> 76</a></span> std::function<void(<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>*)> <a class="code" href="namespaceoperations__research_1_1sat.html#a0f570bf53aae0cd9303912d273425428">AllDifferentAC</a>(</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& variables) {</div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">return</span> [=](<a class="code" href="classoperations__research_1_1sat_1_1_model.html">Model</a>* <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>) {</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  <span class="keywordflow">if</span> (variables.size() < 3) <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div>
|
|
<div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <a class="code" href="classoperations__research_1_1sat_1_1_all_different_constraint.html">AllDifferentConstraint</a>* constraint = <span class="keyword">new</span> <a class="code" href="classoperations__research_1_1sat_1_1_all_different_constraint.html">AllDifferentConstraint</a>(</div>
|
|
<div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  variables, <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>>(),</div>
|
|
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>>(), <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>>());</div>
|
|
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  constraint-><a class="code" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736">RegisterWith</a>(<a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->GetOrCreate<<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>>());</div>
|
|
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <a class="code" href="gurobi__interface_8cc.html#a0728f23c9a47655d38e0bf1a2f200bcf">model</a>->TakeOwnership(constraint);</div>
|
|
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  };</div>
|
|
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span> }</div>
|
|
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  </div>
|
|
<div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#aa93f9022262acc95180e6483878d95d5"> 89</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#aa93f9022262acc95180e6483878d95d5">AllDifferentConstraint::AllDifferentConstraint</a>(</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  std::vector<IntegerVariable> variables, <a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html">IntegerEncoder</a>* encoder,</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="classoperations__research_1_1sat_1_1_trail.html">Trail</a>* trail, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  : num_variables_(variables.size()),</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  variables_(std::move(variables)),</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  trail_(trail),</div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  integer_trail_(integer_trail) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="comment">// Initialize literals cache.</span></div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_value = <a class="code" href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a>;</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_value = <a class="code" href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a>;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  variable_min_value_.resize(num_variables_);</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  variable_max_value_.resize(num_variables_);</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  variable_literal_index_.resize(num_variables_);</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordtype">int</span> num_fixed_variables = 0;</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  variable_min_value_[x] = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(variables_[x]).value();</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  variable_max_value_[x] = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(variables_[x]).value();</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  </div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Compute value range of all variables.</span></div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  min_value = <a class="code" href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">std::min</a>(min_value, variable_min_value_[x]);</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  max_value = <a class="code" href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">std::max</a>(max_value, variable_max_value_[x]);</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  </div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="comment">// FullyEncode does not like 1-value domains, handle this case first.</span></div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="comment">// TODO(user): Prune now, ignore these variables during solving.</span></div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">if</span> (variable_min_value_[x] == variable_max_value_[x]) {</div>
|
|
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  num_fixed_variables++;</div>
|
|
<div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  variable_literal_index_[x].push_back(<a class="code" href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">kTrueLiteralIndex</a>);</div>
|
|
<div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  }</div>
|
|
<div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  </div>
|
|
<div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="comment">// Force full encoding if not already done.</span></div>
|
|
<div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (!encoder-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#ac9e262bbda19ec4b7d51bd77b70bb363">VariableIsFullyEncoded</a>(variables_[x])) {</div>
|
|
<div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  encoder-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#a1fc2c45d01fd348f668c2f7407015a20">FullyEncodeVariable</a>(variables_[x]);</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>  </div>
|
|
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  <span class="comment">// Fill cache with literals, default value is kFalseLiteralIndex.</span></div>
|
|
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> size = variable_max_value_[x] - variable_min_value_[x] + 1;</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  variable_literal_index_[x].resize(size, <a class="code" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a>);</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& entry : encoder-><a class="code" href="classoperations__research_1_1sat_1_1_integer_encoder.html#aa0a8be7c97692d0b4fdb2f13ba303f36">FullDomainEncoding</a>(variables_[x])) {</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = entry.value.value();</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="comment">// Can happen because of initial propagation!</span></div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">if</span> (<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> < variable_min_value_[x] || variable_max_value_[x] < <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>) {</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  }</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  variable_literal_index_[x][<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> - variable_min_value_[x]] =</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  entry.literal.Index();</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  min_all_values_ = min_value;</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  num_all_values_ = max_value - min_value + 1;</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>  successor_.resize(num_variables_);</div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  variable_to_value_.assign(num_variables_, -1);</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  visiting_.resize(num_variables_);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  variable_visited_from_.resize(num_variables_);</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  residual_graph_successors_.resize(num_variables_ + num_all_values_ + 1);</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  component_number_.resize(num_variables_ + num_all_values_ + 1);</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span> }</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  </div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736"> 148</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736">AllDifferentConstraint::RegisterWith</a>(<a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">SetPropagatorPriority</a>(<span class="keywordtype">id</span>, 2);</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keyword">auto</span>& literal_indices : variable_literal_index_) {</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> LiteralIndex li : literal_indices) {</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  <span class="comment">// Watch only unbound literals.</span></div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="keywordflow">if</span> (li >= 0 &&</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  !trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">VariableIsAssigned</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li).Variable())) {</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">WatchLiteral</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li), <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">WatchLiteral</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li).Negated(), <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  }</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span> }</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  </div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span> LiteralIndex AllDifferentConstraint::VariableLiteralIndexOf(<span class="keywordtype">int</span> x,</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>) {</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordflow">return</span> (<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> < variable_min_value_[x] || variable_max_value_[x] < <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>)</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  ? <a class="code" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a></div>
|
|
<div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  : variable_literal_index_[x][<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> - variable_min_value_[x]];</div>
|
|
<div class="line"><a name="l00168"></a><span class="lineno"> 168</span> }</div>
|
|
<div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  </div>
|
|
<div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> AllDifferentConstraint::VariableHasPossibleValue(<span class="keywordtype">int</span> x,</div>
|
|
<div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>) {</div>
|
|
<div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  LiteralIndex li = VariableLiteralIndexOf(x, <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l00173"></a><span class="lineno"> 173</span>  <span class="keywordflow">if</span> (li == <a class="code" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="keywordflow">if</span> (li == <a class="code" href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">kTrueLiteralIndex</a>) <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <a class="code" href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a>(li, 0);</div>
|
|
<div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span> !trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(Literal(li));</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span> }</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  </div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="keywordtype">bool</span> AllDifferentConstraint::MakeAugmentingPath(<span class="keywordtype">int</span> start) {</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <span class="comment">// Do a BFS and use visiting_ as a queue, with num_visited pointing</span></div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="comment">// at its begin() and num_to_visit its end().</span></div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="comment">// To switch to the augmenting path once a nonmatched value was found,</span></div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  <span class="comment">// we remember the BFS tree in variable_visited_from_.</span></div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordtype">int</span> num_to_visit = 0;</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keywordtype">int</span> num_visited = 0;</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="comment">// Enqueue start.</span></div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  visiting_[num_to_visit++] = start;</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  variable_visited_[start] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  variable_visited_from_[start] = -1;</div>
|
|
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  </div>
|
|
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">while</span> (num_visited < num_to_visit) {</div>
|
|
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="comment">// Dequeue node to visit.</span></div>
|
|
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> node = visiting_[num_visited++];</div>
|
|
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  </div>
|
|
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> : successor_[node]) {</div>
|
|
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordflow">if</span> (value_visited_[<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  value_visited_[<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (value_to_variable_[<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>] == -1) {</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// value is not matched: change path from node to start, and return.</span></div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">int</span> path_node = node;</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordtype">int</span> path_value = <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>;</div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keywordflow">while</span> (path_node != -1) {</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">int</span> old_value = variable_to_value_[path_node];</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  variable_to_value_[path_node] = path_value;</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  value_to_variable_[path_value] = path_node;</div>
|
|
<div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  path_node = variable_visited_from_[path_node];</div>
|
|
<div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  path_value = old_value;</div>
|
|
<div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  }</div>
|
|
<div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="comment">// Enqueue node matched to value.</span></div>
|
|
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> next_node = value_to_variable_[<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>];</div>
|
|
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  variable_visited_[next_node] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  visiting_[num_to_visit++] = next_node;</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  variable_visited_from_[next_node] = node;</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="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span> }</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  </div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// The algorithm copies the solver state to successor_, which is used to compute</span></div>
|
|
<div class="line"><a name="l00223"></a><span class="lineno"> 223</span> <span class="comment">// a matching. If all variables can be matched, it generates the residual graph</span></div>
|
|
<div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment">// in separate vectors, computes its SCCs, and filters variable -> value if</span></div>
|
|
<div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="comment">// variable is not in the same SCC as value.</span></div>
|
|
<div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="comment">// Explanations for failure and filtering are fine-grained:</span></div>
|
|
<div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="comment">// failure is explained by a Hall set, i.e. dom(variables) \subseteq {values},</span></div>
|
|
<div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="comment">// with |variables| < |values|; filtering is explained by the Hall set that</span></div>
|
|
<div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="comment">// would happen if the variable was assigned to the value.</span></div>
|
|
<div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00231"></a><span class="lineno"> 231</span> <span class="comment">// TODO(user): If needed, there are several ways performance could be</span></div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="comment">// improved.</span></div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span> <span class="comment">// If copying the variable state is too costly, it could be maintained instead.</span></div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="comment">// If the propagator has too many fruitless calls (without failing/pruning),</span></div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="comment">// we can remember the O(n) arcs used in the matching and the SCC decomposition,</span></div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="comment">// and guard calls to Propagate() if these arcs are still valid.</span></div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 237</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_all_different_constraint.html#ac1fe9b1f2b978c4283e42f12e586eb1e">AllDifferentConstraint::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  <span class="comment">// Copy variable state to graph state.</span></div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  prev_matching_ = variable_to_value_;</div>
|
|
<div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  value_to_variable_.assign(num_all_values_, -1);</div>
|
|
<div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  variable_to_value_.assign(num_variables_, -1);</div>
|
|
<div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  successor_[x].clear();</div>
|
|
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> min_value = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(variables_[x]).value();</div>
|
|
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keyword">const</span> <a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> max_value = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(variables_[x]).value();</div>
|
|
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  <span class="keywordflow">for</span> (<a class="code" href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = min_value; <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> <= max_value; <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>++) {</div>
|
|
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">if</span> (VariableHasPossibleValue(x, <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>)) {</div>
|
|
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> offset_value = <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> - min_all_values_;</div>
|
|
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  <span class="comment">// Forward-checking should propagate x != value.</span></div>
|
|
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  successor_[x].push_back(offset_value);</div>
|
|
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  }</div>
|
|
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  }</div>
|
|
<div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="keywordflow">if</span> (successor_[x].size() == 1) {</div>
|
|
<div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> offset_value = successor_[x][0];</div>
|
|
<div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">if</span> (value_to_variable_[offset_value] == -1) {</div>
|
|
<div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  value_to_variable_[offset_value] = x;</div>
|
|
<div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  variable_to_value_[x] = offset_value;</div>
|
|
<div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  }</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  }</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  }</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  </div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  <span class="comment">// Because we currently propagates all clauses before entering this</span></div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="comment">// propagator, we known that this can't happen.</span></div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">if</span> (<a class="code" href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a>) {</div>
|
|
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> offset_value : successor_[x]) {</div>
|
|
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  <span class="keywordflow">if</span> (value_to_variable_[offset_value] != -1 &&</div>
|
|
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  value_to_variable_[offset_value] != x) {</div>
|
|
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <a class="code" href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a>(<a class="code" href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a>) << <span class="stringliteral">"Should have been propagated by AllDifferentBinary()!"</span>;</div>
|
|
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  }</div>
|
|
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  }</div>
|
|
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  }</div>
|
|
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  }</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  </div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="comment">// Seed with previous matching.</span></div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">if</span> (variable_to_value_[x] != -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> prev_value = prev_matching_[x];</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="keywordflow">if</span> (prev_value == -1 || value_to_variable_[prev_value] != -1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  </div>
|
|
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">if</span> (VariableHasPossibleValue(x, prev_matching_[x] + min_all_values_)) {</div>
|
|
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  variable_to_value_[x] = prev_matching_[x];</div>
|
|
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  value_to_variable_[prev_matching_[x]] = x;</div>
|
|
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  }</div>
|
|
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  }</div>
|
|
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  </div>
|
|
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// Compute max matching.</span></div>
|
|
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordtype">int</span> x = 0;</div>
|
|
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">for</span> (; x < num_variables_; x++) {</div>
|
|
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="keywordflow">if</span> (variable_to_value_[x] == -1) {</div>
|
|
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  value_visited_.assign(num_all_values_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  variable_visited_.assign(num_variables_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  MakeAugmentingPath(x);</div>
|
|
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  }</div>
|
|
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">if</span> (variable_to_value_[x] == -1) <span class="keywordflow">break</span>; <span class="comment">// No augmenting path exists.</span></div>
|
|
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div>
|
|
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  </div>
|
|
<div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// Fail if covering variables impossible.</span></div>
|
|
<div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="comment">// Explain with the forbidden parts of the graph that prevent</span></div>
|
|
<div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="comment">// MakeAugmentingPath from increasing the matching size.</span></div>
|
|
<div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">if</span> (x < num_variables_) {</div>
|
|
<div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// For now explain all forbidden arcs.</span></div>
|
|
<div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  std::vector<Literal>* conflict = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a84f6b2c778ed597c90f98f0329a25713">MutableConflict</a>();</div>
|
|
<div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  conflict->clear();</div>
|
|
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y = 0; y < num_variables_; y++) {</div>
|
|
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="keywordflow">if</span> (!variable_visited_[y]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = variable_min_value_[y]; <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> <= variable_max_value_[y];</div>
|
|
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>++) {</div>
|
|
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keyword">const</span> LiteralIndex li = VariableLiteralIndexOf(y, <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">if</span> (li >= 0 && !value_visited_[<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> - min_all_values_]) {</div>
|
|
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">Assignment</a>().<a class="code" href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">LiteralIsFalse</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li)));</div>
|
|
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  conflict->push_back(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li));</div>
|
|
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  }</div>
|
|
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  }</div>
|
|
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  }</div>
|
|
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  }</div>
|
|
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  </div>
|
|
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  <span class="comment">// The current matching is a valid solution, now try to filter values.</span></div>
|
|
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// Build residual graph, compute its SCCs.</span></div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  residual_graph_successors_[x].clear();</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> succ : successor_[x]) {</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">if</span> (succ != variable_to_value_[x]) {</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  residual_graph_successors_[x].push_back(num_variables_ + succ);</div>
|
|
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  }</div>
|
|
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  }</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="keywordtype">int</span> offset_value = 0; offset_value < num_all_values_; offset_value++) {</div>
|
|
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  residual_graph_successors_[num_variables_ + offset_value].clear();</div>
|
|
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">if</span> (value_to_variable_[offset_value] != -1) {</div>
|
|
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  residual_graph_successors_[num_variables_ + offset_value].push_back(</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  value_to_variable_[offset_value]);</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  }</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  }</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> dummy_node = num_variables_ + num_all_values_;</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  residual_graph_successors_[dummy_node].clear();</div>
|
|
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">if</span> (num_variables_ < num_all_values_) {</div>
|
|
<div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  residual_graph_successors_[dummy_node].push_back(x);</div>
|
|
<div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div>
|
|
<div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> offset_value = 0; offset_value < num_all_values_; offset_value++) {</div>
|
|
<div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keywordflow">if</span> (value_to_variable_[offset_value] == -1) {</div>
|
|
<div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  residual_graph_successors_[num_variables_ + offset_value].push_back(</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  dummy_node);</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  }</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  }</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  </div>
|
|
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="comment">// Compute SCCs, make node -> component map.</span></div>
|
|
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">struct </span>SccOutput {</div>
|
|
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keyword">explicit</span> SccOutput(std::vector<int>* c) : components(c) {}</div>
|
|
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  <span class="keywordtype">void</span> emplace_back(<span class="keywordtype">int</span> <span class="keyword">const</span>* <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>, <span class="keywordtype">int</span> <span class="keyword">const</span>* e) {</div>
|
|
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <span class="keyword">const</span>* it = <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>; it < e; ++it) {</div>
|
|
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  (*components)[*it] = num_components;</div>
|
|
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</div>
|
|
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  ++num_components;</div>
|
|
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</div>
|
|
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  <span class="keywordtype">int</span> num_components = 0;</div>
|
|
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  std::vector<int>* components;</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>  SccOutput scc_output(&component_number_);</div>
|
|
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <a class="code" href="strongly__connected__components_8h.html#aafab5785b250e1013c13511ce478f36b">FindStronglyConnectedComponents</a>(</div>
|
|
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(residual_graph_successors_.size()),</div>
|
|
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  residual_graph_successors_, &scc_output);</div>
|
|
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  </div>
|
|
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  <span class="comment">// Remove arcs var -> val where SCC(var) -/->* SCC(val).</span></div>
|
|
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> x = 0; x < num_variables_; x++) {</div>
|
|
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span> (successor_[x].size() == 1) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> offset_value : successor_[x]) {</div>
|
|
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> value_node = offset_value + num_variables_;</div>
|
|
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  <span class="keywordflow">if</span> (variable_to_value_[x] != offset_value &&</div>
|
|
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  component_number_[x] != component_number_[value_node] &&</div>
|
|
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  VariableHasPossibleValue(x, offset_value + min_all_values_)) {</div>
|
|
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="comment">// We can deduce that x != value. To explain, force x == offset_value,</span></div>
|
|
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="comment">// then find another assignment for the variable matched to</span></div>
|
|
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  <span class="comment">// offset_value. It will fail: explaining why is the same as</span></div>
|
|
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="comment">// explaining failure as above, and it is an explanation of x != value.</span></div>
|
|
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  value_visited_.assign(num_all_values_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  variable_visited_.assign(num_variables_, <span class="keyword">false</span>);</div>
|
|
<div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  <span class="comment">// Undo x -> old_value and old_variable -> offset_value.</span></div>
|
|
<div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_variable = value_to_variable_[offset_value];</div>
|
|
<div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  variable_to_value_[old_variable] = -1;</div>
|
|
<div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> old_value = variable_to_value_[x];</div>
|
|
<div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  value_to_variable_[old_value] = -1;</div>
|
|
<div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  variable_to_value_[x] = offset_value;</div>
|
|
<div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  value_to_variable_[offset_value] = x;</div>
|
|
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  </div>
|
|
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  value_visited_[offset_value] = <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  MakeAugmentingPath(old_variable);</div>
|
|
<div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  <a class="code" href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a>(variable_to_value_[old_variable], -1); <span class="comment">// No reassignment.</span></div>
|
|
<div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  </div>
|
|
<div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  std::vector<Literal>* reason = trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#a70e532a108e1f03d6f9112c770ffbedb">GetEmptyVectorToStoreReason</a>();</div>
|
|
<div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> y = 0; y < num_variables_; y++) {</div>
|
|
<div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="keywordflow">if</span> (!variable_visited_[y]) <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> = variable_min_value_[y];</div>
|
|
<div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> <= variable_max_value_[y]; <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>++) {</div>
|
|
<div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keyword">const</span> LiteralIndex li = VariableLiteralIndexOf(y, <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>);</div>
|
|
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">if</span> (li >= 0 && !value_visited_[<a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a> - min_all_values_]) {</div>
|
|
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(!VariableHasPossibleValue(y, <a class="code" href="demon__profiler_8cc.html#a21edc7ca4cc5802c8779d68556bc09cf">value</a>));</div>
|
|
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  reason->push_back(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li));</div>
|
|
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  }</div>
|
|
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  }</div>
|
|
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  }</div>
|
|
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  </div>
|
|
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keyword">const</span> LiteralIndex li =</div>
|
|
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  VariableLiteralIndexOf(x, offset_value + min_all_values_);</div>
|
|
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(li, <a class="code" href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">kTrueLiteralIndex</a>);</div>
|
|
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <a class="code" href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a>(li, <a class="code" href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">kFalseLiteralIndex</a>);</div>
|
|
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  <span class="keywordflow">return</span> trail_-><a class="code" href="classoperations__research_1_1sat_1_1_trail.html#aa390738a7cb0521a9c1951f3108c0251">EnqueueWithStoredReason</a>(<a class="code" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a>(li).Negated());</div>
|
|
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  }</div>
|
|
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  }</div>
|
|
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  }</div>
|
|
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>  </div>
|
|
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span> }</div>
|
|
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  </div>
|
|
<div class="line"><a name="l00418"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a24bbf12faad7290093a8916c36a14cfa"> 418</a></span> <a class="code" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a24bbf12faad7290093a8916c36a14cfa">AllDifferentBoundsPropagator::AllDifferentBoundsPropagator</a>(</div>
|
|
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keyword">const</span> std::vector<IntegerVariable>& vars, <a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html">IntegerTrail</a>* integer_trail)</div>
|
|
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  : integer_trail_(integer_trail) {</div>
|
|
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <a class="code" href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a>(!vars.empty());</div>
|
|
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  </div>
|
|
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>  <span class="comment">// We need +2 for sentinels.</span></div>
|
|
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a> = vars.size() + 2;</div>
|
|
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  index_to_start_index_.resize(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>);</div>
|
|
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  index_to_end_index_.resize(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>);</div>
|
|
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  index_to_var_.resize(<a class="code" href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a>, <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>);</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="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < vars.size(); ++i) {</div>
|
|
<div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  vars_.push_back({vars[i]});</div>
|
|
<div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  negated_vars_.push_back({<a class="code" href="namespaceoperations__research_1_1sat.html#aae43e784db06c0974ce59ebbe8dd2b22">NegationOf</a>(vars[i])});</div>
|
|
<div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  }</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>  </div>
|
|
<div class="line"><a name="l00435"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e"> 435</a></span> <span class="keywordtype">bool</span> <a class="code" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">AllDifferentBoundsPropagator::Propagate</a>() {</div>
|
|
<div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  <span class="keywordflow">if</span> (!PropagateLowerBounds()) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  </div>
|
|
<div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// Note that it is not required to swap back vars_ and negated_vars_.</span></div>
|
|
<div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="comment">// TODO(user): investigate the impact.</span></div>
|
|
<div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  std::swap(vars_, negated_vars_);</div>
|
|
<div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> result = PropagateLowerBounds();</div>
|
|
<div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  std::swap(vars_, negated_vars_);</div>
|
|
<div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a name="l00444"></a><span class="lineno"> 444</span> }</div>
|
|
<div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  </div>
|
|
<div class="line"><a name="l00446"></a><span class="lineno"> 446</span> <span class="keywordtype">void</span> AllDifferentBoundsPropagator::FillHallReason(IntegerValue hall_lb,</div>
|
|
<div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  IntegerValue hall_ub) {</div>
|
|
<div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  integer_reason_.clear();</div>
|
|
<div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> limit = GetIndex(hall_ub);</div>
|
|
<div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = GetIndex(hall_lb); i <= limit; ++i) {</div>
|
|
<div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = index_to_var_[i];</div>
|
|
<div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  integer_reason_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, hall_lb));</div>
|
|
<div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  integer_reason_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">IntegerLiteral::LowerOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, hall_ub));</div>
|
|
<div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  }</div>
|
|
<div class="line"><a name="l00455"></a><span class="lineno"> 455</span> }</div>
|
|
<div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  </div>
|
|
<div class="line"><a name="l00457"></a><span class="lineno"> 457</span> <span class="keywordtype">int</span> AllDifferentBoundsPropagator::FindStartIndexAndCompressPath(<span class="keywordtype">int</span> <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>) {</div>
|
|
<div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="comment">// First, walk the pointer until we find one pointing to itself.</span></div>
|
|
<div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="keywordtype">int</span> start_index = <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>;</div>
|
|
<div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = index_to_start_index_[start_index];</div>
|
|
<div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  <span class="keywordflow">if</span> (start_index == <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  start_index = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</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>  </div>
|
|
<div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  <span class="comment">// Second, redo the same thing and make everyone point to the representative.</span></div>
|
|
<div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div>
|
|
<div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a> = index_to_start_index_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>];</div>
|
|
<div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="keywordflow">if</span> (start_index == <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>) <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  index_to_start_index_[<a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a>] = start_index;</div>
|
|
<div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <a class="code" href="pack_8cc.html#a750b5d744c39a06bfb13e6eb010e35d0">index</a> = <a class="code" href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a>;</div>
|
|
<div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  }</div>
|
|
<div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">return</span> start_index;</div>
|
|
<div class="line"><a name="l00474"></a><span class="lineno"> 474</span> }</div>
|
|
<div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  </div>
|
|
<div class="line"><a name="l00476"></a><span class="lineno"> 476</span> <span class="keywordtype">bool</span> AllDifferentBoundsPropagator::PropagateLowerBounds() {</div>
|
|
<div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// Start by filling the cached bounds and sorting by increasing lb.</span></div>
|
|
<div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keywordflow">for</span> (VarValue& entry : vars_) {</div>
|
|
<div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  entry.lb = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">LowerBound</a>(entry.var);</div>
|
|
<div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  entry.ub = integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(entry.var);</div>
|
|
<div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  }</div>
|
|
<div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <a class="code" href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">IncrementalSort</a>(<a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.begin(), <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.end(),</div>
|
|
<div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  [](VarValue <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, VarValue <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) { return a.lb < b.lb; });</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="comment">// We will split the variable in vars sorted by lb in contiguous subset with</span></div>
|
|
<div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// index of the form [start, start + num_in_window).</span></div>
|
|
<div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="keywordtype">int</span> start = 0;</div>
|
|
<div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordtype">int</span> num_in_window = 1;</div>
|
|
<div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  </div>
|
|
<div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  <span class="comment">// Minimum lower bound in the current window.</span></div>
|
|
<div class="line"><a name="l00491"></a><span class="lineno"> 491</span>  IntegerValue min_lb = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.front().lb;</div>
|
|
<div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  </div>
|
|
<div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> size = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>.size();</div>
|
|
<div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i < size; ++i) {</div>
|
|
<div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keyword">const</span> IntegerValue lb = <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>[i].lb;</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="comment">// If the lower bounds of all the other variables is greater, then it can</span></div>
|
|
<div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="comment">// never fall into a potential hall interval formed by the variable in the</span></div>
|
|
<div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="comment">// current window, so we can split the problem into independent parts.</span></div>
|
|
<div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">if</span> (lb <= min_lb + IntegerValue(num_in_window - 1)) {</div>
|
|
<div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  ++num_in_window;</div>
|
|
<div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keywordflow">continue</span>;</div>
|
|
<div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  }</div>
|
|
<div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  </div>
|
|
<div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  <span class="comment">// Process the current window.</span></div>
|
|
<div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordflow">if</span> (num_in_window > 1) {</div>
|
|
<div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  absl::Span<VarValue> window(&vars_[start], num_in_window);</div>
|
|
<div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">if</span> (!PropagateLowerBoundsInternal(min_lb, window)) {</div>
|
|
<div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div>
|
|
<div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  }</div>
|
|
<div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  </div>
|
|
<div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  <span class="comment">// Start of the next window.</span></div>
|
|
<div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  start = i;</div>
|
|
<div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  num_in_window = 1;</div>
|
|
<div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  min_lb = lb;</div>
|
|
<div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  }</div>
|
|
<div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  </div>
|
|
<div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  <span class="comment">// Take care of the last window.</span></div>
|
|
<div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="keywordflow">if</span> (num_in_window > 1) {</div>
|
|
<div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  absl::Span<VarValue> window(&vars_[start], num_in_window);</div>
|
|
<div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keywordflow">return</span> PropagateLowerBoundsInternal(min_lb, window);</div>
|
|
<div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  }</div>
|
|
<div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  </div>
|
|
<div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00526"></a><span class="lineno"> 526</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> <span class="keywordtype">bool</span> AllDifferentBoundsPropagator::PropagateLowerBoundsInternal(</div>
|
|
<div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  IntegerValue min_lb, absl::Span<VarValue> vars) {</div>
|
|
<div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  hall_starts_.clear();</div>
|
|
<div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  hall_ends_.clear();</div>
|
|
<div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  </div>
|
|
<div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="comment">// All cached lb in vars will be in [min_lb, min_lb + vars_.size()).</span></div>
|
|
<div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">// Make sure we change our base_ so that GetIndex() fit in our buffers.</span></div>
|
|
<div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  base_ = min_lb - IntegerValue(1);</div>
|
|
<div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  </div>
|
|
<div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// Sparse cleaning of value_to_nodes_.</span></div>
|
|
<div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> <span class="keywordtype">int</span> i : indices_to_clear_) {</div>
|
|
<div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  index_to_var_[i] = <a class="code" href="namespaceoperations__research_1_1sat.html#a5bd8c44473618b7eafd33ba978db2f06">kNoIntegerVariable</a>;</div>
|
|
<div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  }</div>
|
|
<div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  indices_to_clear_.clear();</div>
|
|
<div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  </div>
|
|
<div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">// Sort vars by increasing ub.</span></div>
|
|
<div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  std::sort(vars.begin(), vars.end(),</div>
|
|
<div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  [](VarValue <a class="code" href="constraint__solver_2table_8cc.html#af730895c6c6ef6e03caaf6251192dfd2">a</a>, VarValue <a class="code" href="constraint__solver_2table_8cc.html#a344010e26426d6a13411648d988bc9b6">b</a>) { return a.ub < b.ub; });</div>
|
|
<div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> VarValue entry : vars) {</div>
|
|
<div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="keyword">const</span> IntegerVariable <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a> = entry.var;</div>
|
|
<div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  </div>
|
|
<div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">// Note that it is important to use the cache to make sure GetIndex() is</span></div>
|
|
<div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// not out of bound in case integer_trail_->LowerBound() changed when we</span></div>
|
|
<div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">// pushed something.</span></div>
|
|
<div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">const</span> IntegerValue lb = entry.lb;</div>
|
|
<div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> lb_index = GetIndex(lb);</div>
|
|
<div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keyword">const</span> <span class="keywordtype">bool</span> value_is_covered = PointIsPresent(lb_index);</div>
|
|
<div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  </div>
|
|
<div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="comment">// Check if lb is in an Hall interval, and push it if this is the case.</span></div>
|
|
<div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">if</span> (value_is_covered) {</div>
|
|
<div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> hall_index =</div>
|
|
<div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  std::lower_bound(hall_ends_.begin(), hall_ends_.end(), lb) -</div>
|
|
<div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  hall_ends_.begin();</div>
|
|
<div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">if</span> (hall_index < hall_ends_.size() && hall_starts_[hall_index] <= lb) {</div>
|
|
<div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="keyword">const</span> IntegerValue hs = hall_starts_[hall_index];</div>
|
|
<div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="keyword">const</span> IntegerValue he = hall_ends_[hall_index];</div>
|
|
<div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  FillHallReason(hs, he);</div>
|
|
<div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  integer_reason_.push_back(<a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, hs));</div>
|
|
<div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="keywordflow">if</span> (!integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">Enqueue</a>(</div>
|
|
<div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <a class="code" href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">IntegerLiteral::GreaterOrEqual</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>, he + 1),</div>
|
|
<div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">/*literal_reason=*/</span>{}, integer_reason_)) {</div>
|
|
<div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</div>
|
|
<div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  }</div>
|
|
<div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  }</div>
|
|
<div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  </div>
|
|
<div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// Update our internal representation of the non-consecutive intervals.</span></div>
|
|
<div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// If lb is not used, we add a node there, otherwise we add it to the</span></div>
|
|
<div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// right of the interval that contains lb. In both cases, if there is an</span></div>
|
|
<div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// interval to the left (resp. right) we merge them.</span></div>
|
|
<div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keywordtype">int</span> new_index = lb_index;</div>
|
|
<div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keywordtype">int</span> start_index = lb_index;</div>
|
|
<div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keywordtype">int</span> end_index = lb_index;</div>
|
|
<div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  <span class="keywordflow">if</span> (value_is_covered) {</div>
|
|
<div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  start_index = FindStartIndexAndCompressPath(new_index);</div>
|
|
<div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  new_index = index_to_end_index_[start_index] + 1;</div>
|
|
<div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  end_index = new_index;</div>
|
|
<div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">if</span> (PointIsPresent(new_index - 1)) {</div>
|
|
<div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  start_index = FindStartIndexAndCompressPath(new_index - 1);</div>
|
|
<div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  }</div>
|
|
<div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  }</div>
|
|
<div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keywordflow">if</span> (PointIsPresent(new_index + 1)) {</div>
|
|
<div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  end_index = index_to_end_index_[new_index + 1];</div>
|
|
<div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  index_to_start_index_[new_index + 1] = start_index;</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">// Update the end of the representative.</span></div>
|
|
<div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  index_to_end_index_[start_index] = end_index;</div>
|
|
<div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  </div>
|
|
<div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="comment">// This is the only place where we "add" a new node.</span></div>
|
|
<div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  {</div>
|
|
<div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  index_to_start_index_[new_index] = start_index;</div>
|
|
<div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  index_to_var_[new_index] = <a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>;</div>
|
|
<div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  indices_to_clear_.push_back(new_index);</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>  <span class="comment">// We cannot have a conflict, because it should have beend detected before</span></div>
|
|
<div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="comment">// by pushing an interval lower bound past its upper bound.</span></div>
|
|
<div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// TODO(user): Not 100% clear since pushing can have side-effect, maybe we</span></div>
|
|
<div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// should just report the conflict if it happens!</span></div>
|
|
<div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keyword">const</span> IntegerValue end = GetValue(end_index);</div>
|
|
<div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <a class="code" href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a>(end, integer_trail_-><a class="code" href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">UpperBound</a>(<a class="code" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>));</div>
|
|
<div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  </div>
|
|
<div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// If we have a new Hall interval, add it to the set. Note that it will</span></div>
|
|
<div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// always be last, and if it overlaps some previous Hall intervals, it</span></div>
|
|
<div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// always overlaps them fully.</span></div>
|
|
<div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="comment">//</span></div>
|
|
<div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  <span class="comment">// Note: It is okay to not use entry.ub here if we want to fetch the last</span></div>
|
|
<div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// value, but in practice it shouldn't really change when we push a</span></div>
|
|
<div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// lower_bound and it is faster to use the cached entry.</span></div>
|
|
<div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordflow">if</span> (end == entry.ub) {</div>
|
|
<div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keyword">const</span> IntegerValue start = GetValue(start_index);</div>
|
|
<div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordflow">while</span> (!hall_starts_.empty() && start <= hall_starts_.back()) {</div>
|
|
<div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  hall_starts_.pop_back();</div>
|
|
<div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  hall_ends_.pop_back();</div>
|
|
<div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  }</div>
|
|
<div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <a class="code" href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a>(hall_ends_.empty() || hall_ends_.back() < start);</div>
|
|
<div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  hall_starts_.push_back(start);</div>
|
|
<div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  hall_ends_.push_back(end);</div>
|
|
<div class="line"><a name="l00630"></a><span class="lineno"> 630</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="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00633"></a><span class="lineno"> 633</span> }</div>
|
|
<div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  </div>
|
|
<div class="line"><a name="l00635"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736"> 635</a></span> <span class="keywordtype">void</span> <a class="code" href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">AllDifferentBoundsPropagator::RegisterWith</a>(</div>
|
|
<div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">GenericLiteralWatcher</a>* watcher) {</div>
|
|
<div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> <span class="keywordtype">id</span> = watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">Register</a>(<span class="keyword">this</span>);</div>
|
|
<div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="keywordflow">for</span> (<span class="keyword">const</span> VarValue entry : <a class="code" href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a>) {</div>
|
|
<div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ab2c396c33db5bd5eab32d398c3d55646">WatchIntegerVariable</a>(entry.var, <span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  }</div>
|
|
<div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  watcher-><a class="code" href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">NotifyThatPropagatorMayNotReachFixedPointInOnePass</a>(<span class="keywordtype">id</span>);</div>
|
|
<div class="line"><a name="l00642"></a><span class="lineno"> 642</span> }</div>
|
|
<div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  </div>
|
|
<div class="line"><a name="l00644"></a><span class="lineno"> 644</span> } <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a name="l00645"></a><span class="lineno"> 645</span> } <span class="comment">// namespace operations_research</span></div>
|
|
<div class="ttc" id="aall__different_8h_html"><div class="ttname"><a href="all__different_8h.html">all_different.h</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a021e695f54a13bd809c34b2f4ca87c37"><div class="ttname"><a href="alldiff__cst_8cc.html#a021e695f54a13bd809c34b2f4ca87c37">min</a></div><div class="ttdeci">int64 min</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00138">alldiff_cst.cc:138</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a151248525a9e07eb3e6e60ea1c4995eb"><div class="ttname"><a href="alldiff__cst_8cc.html#a151248525a9e07eb3e6e60ea1c4995eb">vars_</a></div><div class="ttdeci">const std::vector< IntVar * > vars_</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00043">alldiff_cst.cc:43</a></div></div>
|
|
<div class="ttc" id="aalldiff__cst_8cc_html_a9d0c202d5fdd62f4fa2c613339ff168a"><div class="ttname"><a href="alldiff__cst_8cc.html#a9d0c202d5fdd62f4fa2c613339ff168a">max</a></div><div class="ttdeci">int64 max</div><div class="ttdef"><b>Definition:</b> <a href="alldiff__cst_8cc_source.html#l00139">alldiff_cst.cc:139</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html"><div class="ttname"><a href="base_2logging_8h.html">logging.h</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a3e1cfef60e774a81f30eaddf26a3a274"><div class="ttname"><a href="base_2logging_8h.html#a3e1cfef60e774a81f30eaddf26a3a274">CHECK</a></div><div class="ttdeci">#define CHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00495">base/logging.h:495</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a4395e95bab44e222cb2e77251017a0e2"><div class="ttname"><a href="base_2logging_8h.html#a4395e95bab44e222cb2e77251017a0e2">DCHECK_LE</a></div><div class="ttdeci">#define DCHECK_LE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00887">base/logging.h:887</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_a46e69120fbd3b36e6960e096d23b66f0"><div class="ttname"><a href="base_2logging_8h.html#a46e69120fbd3b36e6960e096d23b66f0">DCHECK_NE</a></div><div class="ttdeci">#define DCHECK_NE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00886">base/logging.h:886</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_aae2dc65d9ea248d54bf39daa986dd295"><div class="ttname"><a href="base_2logging_8h.html#aae2dc65d9ea248d54bf39daa986dd295">DCHECK_GE</a></div><div class="ttdeci">#define DCHECK_GE(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00889">base/logging.h:889</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_accad43a85d781d53381cd53a9894b6ae"><div class="ttname"><a href="base_2logging_8h.html#accad43a85d781d53381cd53a9894b6ae">LOG</a></div><div class="ttdeci">#define LOG(severity)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00420">base/logging.h:420</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae17f8119c108cf3070bad3449c7e0006"><div class="ttname"><a href="base_2logging_8h.html#ae17f8119c108cf3070bad3449c7e0006">DCHECK</a></div><div class="ttdeci">#define DCHECK(condition)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00884">base/logging.h:884</a></div></div>
|
|
<div class="ttc" id="abase_2logging_8h_html_ae89df3243bbb8341130c7b3f44145ea0"><div class="ttname"><a href="base_2logging_8h.html#ae89df3243bbb8341130c7b3f44145ea0">DCHECK_EQ</a></div><div class="ttdeci">#define DCHECK_EQ(val1, val2)</div><div class="ttdef"><b>Definition:</b> <a href="base_2logging_8h_source.html#l00885">base/logging.h:885</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_bounds_propagator_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html">operations_research::sat::AllDifferentBoundsPropagator</a></div><div class="ttdef"><b>Definition:</b> <a href="all__different_8h_source.html#l00147">all_different.h:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_bounds_propagator_html_a24bbf12faad7290093a8916c36a14cfa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a24bbf12faad7290093a8916c36a14cfa">operations_research::sat::AllDifferentBoundsPropagator::AllDifferentBoundsPropagator</a></div><div class="ttdeci">AllDifferentBoundsPropagator(const std::vector< IntegerVariable > &vars, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00418">all_different.cc:418</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_bounds_propagator_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::AllDifferentBoundsPropagator::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00635">all_different.cc:635</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_bounds_propagator_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_bounds_propagator.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::AllDifferentBoundsPropagator::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00435">all_different.cc:435</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_constraint_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_constraint.html">operations_research::sat::AllDifferentConstraint</a></div><div class="ttdef"><b>Definition:</b> <a href="all__different_8h_source.html#l00062">all_different.h:62</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_constraint_html_a6ee8ed57254aec3ae99d399bae5b3736"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_constraint.html#a6ee8ed57254aec3ae99d399bae5b3736">operations_research::sat::AllDifferentConstraint::RegisterWith</a></div><div class="ttdeci">void RegisterWith(GenericLiteralWatcher *watcher)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00148">all_different.cc:148</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_constraint_html_aa93f9022262acc95180e6483878d95d5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_constraint.html#aa93f9022262acc95180e6483878d95d5">operations_research::sat::AllDifferentConstraint::AllDifferentConstraint</a></div><div class="ttdeci">AllDifferentConstraint(std::vector< IntegerVariable > variables, IntegerEncoder *encoder, Trail *trail, IntegerTrail *integer_trail)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00089">all_different.cc:89</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_all_different_constraint_html_ac1fe9b1f2b978c4283e42f12e586eb1e"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_all_different_constraint.html#ac1fe9b1f2b978c4283e42f12e586eb1e">operations_research::sat::AllDifferentConstraint::Propagate</a></div><div class="ttdeci">bool Propagate() final</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00237">all_different.cc:237</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html">operations_research::sat::GenericLiteralWatcher</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01108">integer.h:1108</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_a8f6dd74a841475ccb390614d2b212170"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#a8f6dd74a841475ccb390614d2b212170">operations_research::sat::GenericLiteralWatcher::WatchLiteral</a></div><div class="ttdeci">void WatchLiteral(Literal l, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01365">integer.h:1365</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_ab2c396c33db5bd5eab32d398c3d55646"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#ab2c396c33db5bd5eab32d398c3d55646">operations_research::sat::GenericLiteralWatcher::WatchIntegerVariable</a></div><div class="ttdeci">void WatchIntegerVariable(IntegerVariable i, int id, int watch_index=-1)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01397">integer.h:1397</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_adc5598223a363c10d95c00395145bcc6"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adc5598223a363c10d95c00395145bcc6">operations_research::sat::GenericLiteralWatcher::SetPropagatorPriority</a></div><div class="ttdeci">void SetPropagatorPriority(int id, int priority)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01962">integer.cc:1962</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_adeee4ac52bfe0f1b48ee8958bb88b4e3"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#adeee4ac52bfe0f1b48ee8958bb88b4e3">operations_research::sat::GenericLiteralWatcher::Register</a></div><div class="ttdeci">int Register(PropagatorInterface *propagator)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01939">integer.cc:1939</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_generic_literal_watcher_html_aef66ce77e5b87afecf1c5696f44d4d1c"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_generic_literal_watcher.html#aef66ce77e5b87afecf1c5696f44d4d1c">operations_research::sat::GenericLiteralWatcher::NotifyThatPropagatorMayNotReachFixedPointInOnePass</a></div><div class="ttdeci">void NotifyThatPropagatorMayNotReachFixedPointInOnePass(int id)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l01969">integer.cc:1969</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html">operations_research::sat::IntegerEncoder</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00276">integer.h:276</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html_a1fc2c45d01fd348f668c2f7407015a20"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#a1fc2c45d01fd348f668c2f7407015a20">operations_research::sat::IntegerEncoder::FullyEncodeVariable</a></div><div class="ttdeci">void FullyEncodeVariable(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00036">integer.cc:36</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html_aa0a8be7c97692d0b4fdb2f13ba303f36"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#aa0a8be7c97692d0b4fdb2f13ba303f36">operations_research::sat::IntegerEncoder::FullDomainEncoding</a></div><div class="ttdeci">std::vector< ValueLiteralPair > FullDomainEncoding(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00106">integer.cc:106</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_encoder_html_ac9e262bbda19ec4b7d51bd77b70bb363"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_encoder.html#ac9e262bbda19ec4b7d51bd77b70bb363">operations_research::sat::IntegerEncoder::VariableIsFullyEncoded</a></div><div class="ttdeci">bool VariableIsFullyEncoded(IntegerVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00068">integer.cc:68</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html">operations_research::sat::IntegerTrail</a></div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l00540">integer.h:540</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a05e837bb93eeabbbd94e8f690dd59d32"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a05e837bb93eeabbbd94e8f690dd59d32">operations_research::sat::IntegerTrail::Enqueue</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool Enqueue(IntegerLiteral i_lit, absl::Span< const Literal > literal_reason, absl::Span< const IntegerLiteral > integer_reason)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8cc_source.html#l00989">integer.cc:989</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_a8b6d5a25e6ad3d28a85b1924471e2cac"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#a8b6d5a25e6ad3d28a85b1924471e2cac">operations_research::sat::IntegerTrail::UpperBound</a></div><div class="ttdeci">IntegerValue UpperBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01304">integer.h:1304</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_integer_trail_html_ab857cd2aead68952d9fe92a8ad8d3ac9"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_integer_trail.html#ab857cd2aead68952d9fe92a8ad8d3ac9">operations_research::sat::IntegerTrail::LowerBound</a></div><div class="ttdeci">IntegerValue LowerBound(IntegerVariable i) const</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01300">integer.h:1300</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00064">sat_base.h:64</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_model_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_model.html">operations_research::sat::Model</a></div><div class="ttdoc">Class that owns everything related to a particular optimization model.</div><div class="ttdef"><b>Definition:</b> <a href="sat_2model_8h_source.html#l00038">sat/model.h:38</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html">operations_research::sat::Trail</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00233">sat_base.h:233</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a70e532a108e1f03d6f9112c770ffbedb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a70e532a108e1f03d6f9112c770ffbedb">operations_research::sat::Trail::GetEmptyVectorToStoreReason</a></div><div class="ttdeci">std::vector< Literal > * GetEmptyVectorToStoreReason(int trail_index) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00320">sat_base.h:320</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a84f6b2c778ed597c90f98f0329a25713"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a84f6b2c778ed597c90f98f0329a25713">operations_research::sat::Trail::MutableConflict</a></div><div class="ttdeci">std::vector< Literal > * MutableConflict()</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00361">sat_base.h:361</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_a9789bf03dba611e9be5679d6e902d0c8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#a9789bf03dba611e9be5679d6e902d0c8">operations_research::sat::Trail::Assignment</a></div><div class="ttdeci">const VariablesAssignment & Assignment() const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00380">sat_base.h:380</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_trail_html_aa390738a7cb0521a9c1951f3108c0251"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_trail.html#aa390738a7cb0521a9c1951f3108c0251">operations_research::sat::Trail::EnqueueWithStoredReason</a></div><div class="ttdeci">ABSL_MUST_USE_RESULT bool EnqueueWithStoredReason(Literal true_literal)</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00284">sat_base.h:284</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_a49e751eb6f0e9babd957889bb8e7472d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#a49e751eb6f0e9babd957889bb8e7472d">operations_research::sat::VariablesAssignment::VariableIsAssigned</a></div><div class="ttdeci">bool VariableIsAssigned(BooleanVariable var) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00158">sat_base.h:158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html_acfd1646011e643f58fd7dc66d9cc90a5"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html#acfd1646011e643f58fd7dc66d9cc90a5">operations_research::sat::VariablesAssignment::LiteralIsFalse</a></div><div class="ttdeci">bool LiteralIsFalse(Literal literal) const</div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00147">sat_base.h:147</a></div></div>
|
|
<div class="ttc" id="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="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="aconstraint__solver_8cc_html_a395f613555f398dd389670bb4c2a4599"><div class="ttname"><a href="constraint__solver_8cc.html#a395f613555f398dd389670bb4c2a4599">next</a></div><div class="ttdeci">Block * next</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_8cc_source.html#l00674">constraint_solver.cc:674</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="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="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#l00272">gurobi_interface.cc:272</a></div></div>
|
|
<div class="ttc" id="aint__type_8h_html"><div class="ttname"><a href="int__type_8h.html">int_type.h</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a74ea76ea27f48fb1b6e148e1577b3719"><div class="ttname"><a href="integral__types_8h.html#a74ea76ea27f48fb1b6e148e1577b3719">kint64max</a></div><div class="ttdeci">static const int64 kint64max</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00053">integral_types.h:53</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_a7cde0074dfd288f2d70c0e035dacb28a"><div class="ttname"><a href="integral__types_8h.html#a7cde0074dfd288f2d70c0e035dacb28a">int64</a></div><div class="ttdeci">int64_t int64</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00034">integral_types.h:34</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html_af458164b470cbba416d5ed579e00ff60"><div class="ttname"><a href="integral__types_8h.html#af458164b470cbba416d5ed579e00ff60">kint64min</a></div><div class="ttdeci">static const int64 kint64min</div><div class="ttdef"><b>Definition:</b> <a href="integral__types_8h_source.html#l00052">integral_types.h:52</a></div></div>
|
|
<div class="ttc" id="alog__severity_8h_html_acdd38e3c9f22f127d7776920e3079eda"><div class="ttname"><a href="log__severity_8h.html#acdd38e3c9f22f127d7776920e3079eda">FATAL</a></div><div class="ttdeci">const int FATAL</div><div class="ttdef"><b>Definition:</b> <a href="log__severity_8h_source.html#l00032">log_severity.h:32</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html_a7f536a3b33f9bed8f75734e035d30725"><div class="ttname"><a href="macros_8h.html#a7f536a3b33f9bed8f75734e035d30725">DEBUG_MODE</a></div><div class="ttdeci">const bool DEBUG_MODE</div><div class="ttdef"><b>Definition:</b> <a href="macros_8h_source.html#l00024">macros.h:24</a></div></div>
|
|
<div class="ttc" id="amap__util_8h_html"><div class="ttname"><a href="map__util_8h.html">map_util.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a0f570bf53aae0cd9303912d273425428"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a0f570bf53aae0cd9303912d273425428">operations_research::sat::AllDifferentAC</a></div><div class="ttdeci">std::function< void(Model *)> AllDifferentAC(const std::vector< IntegerVariable > &variables)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00076">all_different.cc:76</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a1655a9b9673e7c4de940ca6e5e3cf936"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a1655a9b9673e7c4de940ca6e5e3cf936">operations_research::sat::ClauseConstraint</a></div><div class="ttdeci">std::function< void(Model *)> ClauseConstraint(absl::Span< const Literal > literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00904">sat_solver.h:904</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a467d0c8bf263413aae5e5e530d4c5259"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a467d0c8bf263413aae5e5e530d4c5259">operations_research::sat::AllDifferentOnBounds</a></div><div class="ttdeci">std::function< void(Model *)> AllDifferentOnBounds(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00065">all_different.cc:65</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a4ae75bf9ab807bf21ce2caebb7321be0"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a4ae75bf9ab807bf21ce2caebb7321be0">operations_research::sat::FullyEncodeVariable</a></div><div class="ttdeci">std::function< std::vector< IntegerEncoder::ValueLiteralPair >Model *)> FullyEncodeVariable(IntegerVariable var)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01587">integer.h:1587</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="anamespaceoperations__research_1_1sat_html_a7ab45c5256e605ee3da3bf3abd1df2e1"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7ab45c5256e605ee3da3bf3abd1df2e1">operations_research::sat::kTrueLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kTrueLiteralIndex(-2)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a969b5056550d96847f8c35f19fd17f50"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a969b5056550d96847f8c35f19fd17f50">operations_research::sat::kFalseLiteralIndex</a></div><div class="ttdeci">const LiteralIndex kFalseLiteralIndex(-3)</div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a9d6526e2b6f684e7c3c80172b598b7cb"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a9d6526e2b6f684e7c3c80172b598b7cb">operations_research::sat::AllDifferentBinary</a></div><div class="ttdeci">std::function< void(Model *)> AllDifferentBinary(const std::vector< IntegerVariable > &vars)</div><div class="ttdef"><b>Definition:</b> <a href="all__different_8cc_source.html#l00031">all_different.cc:31</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#l00027">integer.cc:27</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ab8221efb0cc3dd5059674845b4db7fed"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ab8221efb0cc3dd5059674845b4db7fed">operations_research::sat::AtMostOneConstraint</a></div><div class="ttdeci">std::function< void(Model *)> AtMostOneConstraint(const std::vector< Literal > &literals)</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00890">sat_solver.h:890</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="anamespaceoperations__research_html_a793092fb9f25552acabb89ee399bbd81"><div class="ttname"><a href="namespaceoperations__research.html#a793092fb9f25552acabb89ee399bbd81">operations_research::IncrementalSort</a></div><div class="ttdeci">void IncrementalSort(int max_comparisons, Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false)</div><div class="ttdef"><b>Definition:</b> <a href="sort_8h_source.html#l00046">sort.h:46</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="arouting__flow_8cc_html_adf3be22c64f10c0783c0cf277e857adf"><div class="ttname"><a href="routing__flow_8cc.html#adf3be22c64f10c0783c0cf277e857adf">capacity</a></div><div class="ttdeci">int64 capacity</div><div class="ttdef"><b>Definition:</b> <a href="routing__flow_8cc_source.html#l00129">routing_flow.cc:129</a></div></div>
|
|
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="asort_8h_html"><div class="ttname"><a href="sort_8h.html">sort.h</a></div></div>
|
|
<div class="ttc" id="astrongly__connected__components_8h_html"><div class="ttname"><a href="strongly__connected__components_8h.html">strongly_connected_components.h</a></div></div>
|
|
<div class="ttc" id="astrongly__connected__components_8h_html_aafab5785b250e1013c13511ce478f36b"><div class="ttname"><a href="strongly__connected__components_8h.html#aafab5785b250e1013c13511ce478f36b">FindStronglyConnectedComponents</a></div><div class="ttdeci">void FindStronglyConnectedComponents(const NodeIndex num_nodes, const Graph &graph, SccOutput *components)</div><div class="ttdef"><b>Definition:</b> <a href="strongly__connected__components_8h_source.html#l00211">strongly_connected_components.h:211</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_integer_literal_html_a3e2eb445631727dd4abf1d5343f16b2f"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a3e2eb445631727dd4abf1d5343f16b2f">operations_research::sat::IntegerLiteral::LowerOrEqual</a></div><div class="ttdeci">static IntegerLiteral LowerOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01270">integer.h:1270</a></div></div>
|
|
<div class="ttc" id="astructoperations__research_1_1sat_1_1_integer_literal_html_a6c233aafac25ea66d69de93a83c9be63"><div class="ttname"><a href="structoperations__research_1_1sat_1_1_integer_literal.html#a6c233aafac25ea66d69de93a83c9be63">operations_research::sat::IntegerLiteral::GreaterOrEqual</a></div><div class="ttdeci">static IntegerLiteral GreaterOrEqual(IntegerVariable i, IntegerValue bound)</div><div class="ttdef"><b>Definition:</b> <a href="integer_8h_source.html#l01264">integer.h:1264</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="all__different_8cc.html">all_different.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.9.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|